File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/INFOCOM.2019.8737477
- Scopus: eid_2-s2.0-85068217448
- WOS: WOS:000480426400115
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Fast Distributed Backbone Construction Despite Strong Adversarial Jamming
Title | Fast Distributed Backbone Construction Despite Strong Adversarial Jamming |
---|---|
Authors | |
Keywords | Jamming Computational complexity Distributed algorithms Radio networks Interference |
Issue Date | 2019 |
Publisher | IEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359 |
Citation | Proceedings of IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, Paris, France, 29 April-2 May 2019, p. 1027-1035 How to Cite? |
Abstract | This paper studies jamming-resilient distributed backbone construction in multi-hop wireless networks. Specifically, a strong adversarial jamming model is proposed that captures the general jamming phenomena suffered by wireless communications. The jamming model is based on the realistic Signal-to-Interference-plus-Noise-Ratio (SINR) interference model, and is featured by local-uniformity, unrestricted energy budget and reactivity, which covers more jamming scenarios and is much closer to reality than existing jamming models. Under the strong adversarial jamming model, we propose a randomized distributed algorithm that can construct a backbone in J(O(log n + logR)) rounds with high probability, where J(O(log n + log R)) is the number of rounds in the interval from the beginning of the algorithm execution that contains O(log n + log R) unjammed rounds for every node. This result is asymptotically optimal considering the trivial lower bound of Ω(log n) for a successful transmission even without interference and jamming. |
Persistent Identifier | http://hdl.handle.net/10722/293188 |
ISSN | 2023 SCImago Journal Rankings: 2.865 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zou, Y | - |
dc.contributor.author | Yu, D | - |
dc.contributor.author | Wu, L | - |
dc.contributor.author | Yu, J | - |
dc.contributor.author | Wu, Y | - |
dc.contributor.author | Hua, Q | - |
dc.contributor.author | Lau, FCM | - |
dc.date.accessioned | 2020-11-23T08:13:05Z | - |
dc.date.available | 2020-11-23T08:13:05Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | Proceedings of IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, Paris, France, 29 April-2 May 2019, p. 1027-1035 | - |
dc.identifier.issn | 0743-166X | - |
dc.identifier.uri | http://hdl.handle.net/10722/293188 | - |
dc.description.abstract | This paper studies jamming-resilient distributed backbone construction in multi-hop wireless networks. Specifically, a strong adversarial jamming model is proposed that captures the general jamming phenomena suffered by wireless communications. The jamming model is based on the realistic Signal-to-Interference-plus-Noise-Ratio (SINR) interference model, and is featured by local-uniformity, unrestricted energy budget and reactivity, which covers more jamming scenarios and is much closer to reality than existing jamming models. Under the strong adversarial jamming model, we propose a randomized distributed algorithm that can construct a backbone in J(O(log n + logR)) rounds with high probability, where J(O(log n + log R)) is the number of rounds in the interval from the beginning of the algorithm execution that contains O(log n + log R) unjammed rounds for every node. This result is asymptotically optimal considering the trivial lower bound of Ω(log n) for a successful transmission even without interference and jamming. | - |
dc.language | eng | - |
dc.publisher | IEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359 | - |
dc.relation.ispartof | IEEE INFOCOM - IEEE Conference on Computer Communications | - |
dc.rights | IEEE INFOCOM - IEEE Conference on Computer Communications. Copyright © IEEE Computer Society. | - |
dc.rights | ©2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
dc.subject | Jamming | - |
dc.subject | Computational complexity | - |
dc.subject | Distributed algorithms | - |
dc.subject | Radio networks | - |
dc.subject | Interference | - |
dc.title | Fast Distributed Backbone Construction Despite Strong Adversarial Jamming | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Lau, FCM: fcmlau@cs.hku.hk | - |
dc.identifier.authority | Lau, FCM=rp00221 | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/INFOCOM.2019.8737477 | - |
dc.identifier.scopus | eid_2-s2.0-85068217448 | - |
dc.identifier.hkuros | 319194 | - |
dc.identifier.spage | 1027 | - |
dc.identifier.epage | 1035 | - |
dc.identifier.isi | WOS:000480426400115 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 0743-166X | - |