Advertisement

Optimal Broadcast in Shared Spectrum Radio Networks

  • Mohsen Ghaffari
  • Seth Gilbert
  • Calvin Newport
  • Henry Tan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7702)

Abstract

This paper studies single hop broadcast in a single hop shared spectrum radio network. The problem requires a source to deliver a message to n receivers, where only a polynomial upper bound on n is known. The model assumes that in each round, each device can participate on 1 out of \(\mathcal{C} \geq 1\) available communication channels, up to \(t < \mathcal{C}\) of which might be disrupted, preventing communication. This disruption captures the unpredictable message loss that plagues real shared spectrum networks. The best existing solution to the problem, which comes from the systems literature, requires \(O\big({\frac{\mathcal{C} t}{\mathcal{C}-t}}\log{n}\big)\) rounds. Our algorithm, by contrast, solves the problem in \(O\big(\frac{\mathcal{C}}{\mathcal{C}-t}\lceil\frac{t}{n}\rceil\log{n}\big)\) rounds, when \(\mathcal{C} \geq \log{n}\), and in \(O\big(\frac{\mathcal{C}}{\mathcal{C}-t}\log{n}\cdot\log{\rm log}{n}\big)\) rounds, when \(\mathcal{C}\) is smaller. It accomplishes this improvement by deploying a self-regulating relay strategy in which receivers that already know useful information coordinate themselves to efficiently assist the source’s broadcast. We conclude by proving these bounds tight for most cases.

Keywords

Test Segment Direct Sequence Spread Spectrum Test Round Estimation Routine Broadcast Communication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences 45(1), 104–126 (1992)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Daum, S., Gilbert, S., Kuhn, F., Newport, C.: Leader Election in Shared Spectrum Radio Networks. In: Proceedings of the International Symposium on Principles of Distributed Computing (2012)Google Scholar
  3. 3.
    Dolev, S., Gilbert, S., Guerraoui, R., Kuhn, F., Newport, C.: The wireless synchronization problem. In: Proc. 28th Symp. on Principles of Distributed Computing, PODC, pp. 190–199 (2009)Google Scholar
  4. 4.
    Dolev, S., Gilbert, S., Khabbazian, M., Newport, C.: Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 252–267. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  5. 5.
    Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.: Gossiping in a Multi-channel Radio Network: An Oblivious Approach to Coping with Malicious Interference (Extended Abstract). In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 208–222. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.: Secure Communication Over Radio Channels. In: Proceedings of the International Symposium on Principles of Distributed Computing (2008)Google Scholar
  7. 7.
    Gilbert, S., Guerraoui, R., Kowalski, D., Newport, C.: Interference-Resilient Information Exchange. In: The Proceedings of the Conference on Computer Communication (2009)Google Scholar
  8. 8.
    Gummadi, R., Wetherall, D., Greenstein, B., Seshan, S.: Understanding and Mitigating the Impact of RF Interference on 802.11 Networks. In: Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM, pp. 385–396 (2007)Google Scholar
  9. 9.
    Jin, T., Noubir, G., Thapa, B.: Zero Pre-Shared Secret Key Establishment in the Presence of Jammers. In: Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (2009)Google Scholar
  10. 10.
    Liu, A., Ning, P., Dai, H., Liu, Y.: USD-FH: Jamming-Resistant Wireless Communication using Frequency Hopping with Uncoordinated Seed Disclosure. In: Proceedings of the IEEE International Conference on Mobile Ad Hoc and Sensor Systems (2010)Google Scholar
  11. 11.
    Liu, A., Ning, P., Dai, H., Liu, Y., Wang, C.: Defending DSSS-Based Broadcast Communication Against Insider Jammers via Delayed Seed-Disclosure. In: Proceedings of the IEEE Annual Computer Security Applications Conference (2010)Google Scholar
  12. 12.
    Liu, Y., Ning, P., Dai, H., Liu, A.: Randomized Differential DSSS: Jamming-Resistant Wireless Broadcast Communication. In: The Proceedings of the Conference on Computer Communication (2010)Google Scholar
  13. 13.
    Meier, D., Pignolet, Y.A., Schmid, S., Wattenhofer, R.: Speed Dating Despite Jammers. In: Krishnamachari, B., Suri, S., Heinzelman, W., Mitra, U. (eds.) DCOSS 2009. LNCS, vol. 5516, pp. 1–14. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  14. 14.
    Newport, C.: Distributed Computation on Unreliable Radio Channels. Ph.D. thesis. MIT (2009)Google Scholar
  15. 15.
    Panconesi, A., Srinivasan, A.: Randomized distributed edge coloring via an extension of the chernoff–hoeffding bounds. SIAM J. Comput. 26(2), 350–368 (1997), http://dx.doi.org/10.1137/S0097539793250767 MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Pöpper, C., Strasser, M., Čapkun, S.: Jamming-Resistant Broadcast Communication without Shared Keys. In: Proceedings of the USENIX Security Symposium (2009)Google Scholar
  17. 17.
    Popper, C., Strasser, M., Čapkun, S.: Anti-Jamming Broadcast Communication using Uncoordinated Spread Spectrum Techniques. IEEE Journal on Selected Areas in Communications 28(5), 703–715 (2010)Google Scholar
  18. 18.
    Slater, D., Tague, P., Poovendran, R., Matt, B.: A Coding-Theoretic Approach for Efficient Message Verification over Insecure Channels. In: Proceedings of the ACM Conference on Wireless Network Security (2009)Google Scholar
  19. 19.
    Strasser, M., Capkun, S., Popper, C., Čagalj, M.: Jamming-Resistant Key Establishment using Uncoordinated Frequency Hopping. In: IEEE Symposium on Security and Privacy (2008)Google Scholar
  20. 20.
    Strasser, M., Pöpper, C., Čapkun, S.: Efficient Uncoordinated FHSS Anti-Jamming Communication. In: Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (2009)Google Scholar
  21. 21.
    Xiao, L., Dai, H., Ning, P.: Jamming-Resistant Collaborative Broadcast Using Uncoordinated Frequency Hopping. IEEE Transactions on Forensics and Security 7(1), 297–309 (2012)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Mohsen Ghaffari
    • 1
  • Seth Gilbert
    • 2
  • Calvin Newport
    • 3
  • Henry Tan
    • 3
  1. 1.MITUSA
  2. 2.National University of SingaporeSingapore
  3. 3.Georgetown UniversityUSA

Personalised recommendations