File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Oblivious rendezvous in cognitive radio networks

TitleOblivious rendezvous in cognitive radio networks
Authors
Issue Date2014
PublisherSpringer 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, 23-25 July 2014. In Lecture Notes in Computer Science, 2014, v. 8576, p. 165-179 How to Cite?
AbstractRendezvous 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 non-overlapping 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 (ORP-M for short) in a multihop network with diameter D. We first focus on the rendezvous process between two users (ORP-2) and then extend the derived algorithms to ORP-M. Specifically, we give an Ω(N 2) lower bound for ORP-2, and propose two deterministic distributed algorithms solving ORP-2. 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 Multi-Step 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 non-oblivious rendezvous and the performance is comparable to the state-of-the-art results. Then we extend the algorithms to ORP-M with bounded rendezvous time by increasing the diameter D by a factor.
DescriptionLNCS v. 8576 entitled: Structural Information and Communication Complexity: 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings
Persistent Identifierhttp://hdl.handle.net/10722/229707
ISBN
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252

 

DC FieldValueLanguage
dc.contributor.authorGu, ZQ-
dc.contributor.authorHua, QS-
dc.contributor.authorWang, Y-
dc.contributor.authorLau, FCM-
dc.date.accessioned2016-08-23T14:12:48Z-
dc.date.available2016-08-23T14:12:48Z-
dc.date.issued2014-
dc.identifier.citationThe 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), Takayama, Japan, 23-25 July 2014. In Lecture Notes in Computer Science, 2014, v. 8576, p. 165-179-
dc.identifier.isbn978-3-319-09619-3-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/229707-
dc.descriptionLNCS v. 8576 entitled: Structural Information and Communication Complexity: 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings-
dc.description.abstractRendezvous 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 non-overlapping 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 (ORP-M for short) in a multihop network with diameter D. We first focus on the rendezvous process between two users (ORP-2) and then extend the derived algorithms to ORP-M. Specifically, we give an Ω(N 2) lower bound for ORP-2, and propose two deterministic distributed algorithms solving ORP-2. 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 Multi-Step 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 non-oblivious rendezvous and the performance is comparable to the state-of-the-art results. Then we extend the algorithms to ORP-M with bounded rendezvous time by increasing the diameter D by a factor.-
dc.languageeng-
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/-
dc.relation.ispartofLecture Notes in Computer Science-
dc.rightsThe final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-09620-9_14-
dc.titleOblivious rendezvous in cognitive radio networks-
dc.typeConference_Paper-
dc.identifier.emailWang, Y: amywang@hku.hk-
dc.identifier.emailLau, FCM: fcmlau@cs.hku.hk-
dc.identifier.authorityLau, FCM=rp00221-
dc.identifier.doi10.1007/978-3-319-09620-9_14-
dc.identifier.scopuseid_2-s2.0-84958535145-
dc.identifier.hkuros260208-
dc.identifier.volume8576-
dc.identifier.spage165-
dc.identifier.epage179-
dc.publisher.placeGermany-
dc.customcontrol.immutablesml 160901-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats