File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
 Publisher Website: 10.1007/9783319096209_14
 Scopus: eid_2s2.084958535145
 Find via
Supplementary

Citations:
 Scopus: 0
 Appears in Collections:
Conference Paper: Oblivious rendezvous in cognitive radio networks
Title  Oblivious rendezvous in cognitive radio networks 

Authors  
Issue Date  2014 
Publisher  Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ 
Citation  The 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), Takayama, Japan, 2325 July 2014. In Lecture Notes in Computer Science, 2014, v. 8576, p. 165179 How to Cite? 
Abstract  Rendezvous is a fundamental process in the operation of a Cognitive Radio Network (CRN), through which a secondary user can establish a link to communicate with its neighbors on the same frequency band (channel). The licensed spectrum is divided into N nonoverlapping channels, and most previous works assume all users have the same label for the same channel. This implies some degree of centralized coordination which might be impractical in distributed systems such as a CRN. Thus we propose Oblivious Rendezvous where the users may have different labels for the same frequency band.
In this paper, we study the oblivious rendezvous problem for M users (ORPM for short) in a multihop network with diameter D. We first focus on the rendezvous process between two users (ORP2) and then extend the derived algorithms to ORPM. Specifically, we give an Ω(N 2) lower bound for ORP2, and propose two deterministic distributed algorithms solving ORP2. The first one is the ID Hopping (IDH) algorithm which generates a fixed length sequence and guarantees rendezvous in O(N max {N,M}) time slots; it meets the lower bound when M = O(N). The second one is the MultiStep Hopping (MSH) algorithm which guarantees rendezvous in O(N 2 log N M) time slots by combing ID scaling and hopping with different steps; it meets the lower bound if M can be bounded by a polynomial function of N, which is true of large scale networks. The two algorithms are also applicable to nonoblivious rendezvous and the performance is comparable to the stateoftheart results. Then we extend the algorithms to ORPM with bounded rendezvous time by increasing the diameter D by a factor. 
Description  LNCS v. 8576 entitled: Structural Information and Communication Complexity: 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 2325, 2014. Proceedings 
Persistent Identifier  http://hdl.handle.net/10722/229707 
ISBN  
ISSN  2005 Impact Factor: 0.402 2015 SCImago Journal Rankings: 0.252 
DC Field  Value  Language 

dc.contributor.author  Gu, ZQ   
dc.contributor.author  Hua, QS   
dc.contributor.author  Wang, Y   
dc.contributor.author  Lau, FCM   
dc.date.accessioned  20160823T14:12:48Z   
dc.date.available  20160823T14:12:48Z   
dc.date.issued  2014   
dc.identifier.citation  The 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), Takayama, Japan, 2325 July 2014. In Lecture Notes in Computer Science, 2014, v. 8576, p. 165179   
dc.identifier.isbn  9783319096193   
dc.identifier.issn  03029743   
dc.identifier.uri  http://hdl.handle.net/10722/229707   
dc.description  LNCS v. 8576 entitled: Structural Information and Communication Complexity: 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 2325, 2014. Proceedings   
dc.description.abstract  Rendezvous is a fundamental process in the operation of a Cognitive Radio Network (CRN), through which a secondary user can establish a link to communicate with its neighbors on the same frequency band (channel). The licensed spectrum is divided into N nonoverlapping channels, and most previous works assume all users have the same label for the same channel. This implies some degree of centralized coordination which might be impractical in distributed systems such as a CRN. Thus we propose Oblivious Rendezvous where the users may have different labels for the same frequency band. In this paper, we study the oblivious rendezvous problem for M users (ORPM for short) in a multihop network with diameter D. We first focus on the rendezvous process between two users (ORP2) and then extend the derived algorithms to ORPM. Specifically, we give an Ω(N 2) lower bound for ORP2, and propose two deterministic distributed algorithms solving ORP2. The first one is the ID Hopping (IDH) algorithm which generates a fixed length sequence and guarantees rendezvous in O(N max {N,M}) time slots; it meets the lower bound when M = O(N). The second one is the MultiStep Hopping (MSH) algorithm which guarantees rendezvous in O(N 2 log N M) time slots by combing ID scaling and hopping with different steps; it meets the lower bound if M can be bounded by a polynomial function of N, which is true of large scale networks. The two algorithms are also applicable to nonoblivious rendezvous and the performance is comparable to the stateoftheart results. Then we extend the algorithms to ORPM with bounded rendezvous time by increasing the diameter D by a factor.   
dc.language  eng   
dc.publisher  Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/   
dc.relation.ispartof  Lecture Notes in Computer Science   
dc.rights  The final publication is available at Springer via http://dx.doi.org/10.1007/9783319096209_14   
dc.title  Oblivious rendezvous in cognitive radio networks   
dc.type  Conference_Paper   
dc.identifier.email  Wang, Y: amywang@hku.hk   
dc.identifier.email  Lau, FCM: fcmlau@cs.hku.hk   
dc.identifier.authority  Lau, FCM=rp00221   
dc.identifier.doi  10.1007/9783319096209_14   
dc.identifier.scopus  eid_2s2.084958535145   
dc.identifier.hkuros  260208   
dc.identifier.volume  8576   
dc.identifier.spage  165   
dc.identifier.epage  179   
dc.publisher.place  Germany   
dc.customcontrol.immutable  sml 160901   