File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/3242102.3242103
- Scopus: eid_2-s2.0-85058483121
- WOS: WOS:000683751900043
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Where to Rendezvous? Preferring Quiet Channels in Cognitive Radio Networks
Title | Where to Rendezvous? Preferring Quiet Channels in Cognitive Radio Networks |
---|---|
Authors | |
Keywords | Cognitive Radio Network Interference Rendezvous |
Issue Date | 2018 |
Publisher | Association for Computing Machinery. |
Citation | Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2018), Montreal, Canada, 28 October -2 November 2018, p. 325-332 How to Cite? |
Abstract | Rendezvous is a fundamental building block in distributed cognitive radio networks (CRNs), where users must find a jointly available channel. Research on the rendezvous problem has focused so far on minimizing the time to rendezvous (to find a suitable channel) or on maximizing the degree (number of channels on which rendezvous can take place). In this paper, we model the rendezvous problem in a more realistic way that acknowledges the fact available channels may suffer from interference, and interference may vary among users in different locations over time. In this setting, CRNs benefit from rendezvous methods that find a quiet channel, which supports high symbol rates and does not suffer much from dropped packets. We propose algorithms that achieve this goal for both initial rendezvous problem (users share no prior information) and continuous rendezvous problem (users who have already established a link must vacate the channel and seek another). We propose both deterministic and randomized methods based on mapping the channel set to a larger set in a way that gives preference to quiet channels. This technique allows us to add interference-awareness to existing rendezvous algorithms. We analyze the new algorithms and substantiate our analyses through extensive simulations. |
Persistent Identifier | http://hdl.handle.net/10722/286401 |
ISBN | |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shen, T | - |
dc.contributor.author | Gu, ZQ | - |
dc.contributor.author | Wang, Y | - |
dc.contributor.author | Toledo, S | - |
dc.contributor.author | Zhang, SR | - |
dc.contributor.author | Song, ML | - |
dc.date.accessioned | 2020-08-31T07:03:22Z | - |
dc.date.available | 2020-08-31T07:03:22Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2018), Montreal, Canada, 28 October -2 November 2018, p. 325-332 | - |
dc.identifier.isbn | 978-1-4503-5960-3 | - |
dc.identifier.uri | http://hdl.handle.net/10722/286401 | - |
dc.description.abstract | Rendezvous is a fundamental building block in distributed cognitive radio networks (CRNs), where users must find a jointly available channel. Research on the rendezvous problem has focused so far on minimizing the time to rendezvous (to find a suitable channel) or on maximizing the degree (number of channels on which rendezvous can take place). In this paper, we model the rendezvous problem in a more realistic way that acknowledges the fact available channels may suffer from interference, and interference may vary among users in different locations over time. In this setting, CRNs benefit from rendezvous methods that find a quiet channel, which supports high symbol rates and does not suffer much from dropped packets. We propose algorithms that achieve this goal for both initial rendezvous problem (users share no prior information) and continuous rendezvous problem (users who have already established a link must vacate the channel and seek another). We propose both deterministic and randomized methods based on mapping the channel set to a larger set in a way that gives preference to quiet channels. This technique allows us to add interference-awareness to existing rendezvous algorithms. We analyze the new algorithms and substantiate our analyses through extensive simulations. | - |
dc.language | eng | - |
dc.publisher | Association for Computing Machinery. | - |
dc.relation.ispartof | MSWiM 2018: Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems | - |
dc.rights | MSWiM 2018: Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems. Copyright © Association for Computing Machinery. | - |
dc.subject | Cognitive Radio Network | - |
dc.subject | Interference | - |
dc.subject | Rendezvous | - |
dc.title | Where to Rendezvous? Preferring Quiet Channels in Cognitive Radio Networks | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Wang, Y: amywang@hku.hk | - |
dc.identifier.doi | 10.1145/3242102.3242103 | - |
dc.identifier.scopus | eid_2-s2.0-85058483121 | - |
dc.identifier.hkuros | 313377 | - |
dc.identifier.spage | 325 | - |
dc.identifier.epage | 332 | - |
dc.identifier.isi | WOS:000683751900043 | - |
dc.publisher.place | New York, NY | - |