Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics

ALGOSENSORS 2018: Algorithms for Sensor Systems pp 1–14Cite as

Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks

  • Conference paper
  • First Online:

  • 453 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 11410))

Abstract

We propose a new task called \(\delta \)-local gossip, which can be viewed as a variant of both gossiping and geocasting. We motivate its study by showing how the tasks of discovering and maintaining neighbourhood information reduce to solving \(\delta \)-local gossip. We then provide a deterministic algorithm that solves \(\delta \)-local gossip when nodes travel on a line along arbitrary continuous trajectories with bounded speed.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Anta, A.F., Milani, A., Mosteiro, M.A., Zaks, S.: Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Distrib. Comput. 25(4), 279–296 (2012). https://doi.org/10.1007/s00446-012-0165-9

    Article  MATH  Google Scholar 

  2. Augustine, J., Pandurangan, G., Robinson, P.: Distributed algorithmic foundations of dynamic networks. SIGACT News 47(1), 69–98 (2016). https://doi.org/10.1145/2902945.2902959

    Article  MathSciNet  Google Scholar 

  3. Baldoni, R., Anta, A.F., Ioannidou, K., Milani, A.: The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost. Theor. Comput. Sci. 412(12–14), 1066–1080 (2011). https://doi.org/10.1016/j.tcs.2010.12.006

    Article  MathSciNet  MATH  Google Scholar 

  4. Chung, H.C., Viqar, S., Welch, J.L.: Neighbor knowledge of mobile nodes in a road network. In: 2012 IEEE 32nd International Conference on Distributed Computing Systems, 18–21 June 2012, Macau, China, pp. 486–495. IEEE Computer Society (2012). https://doi.org/10.1109/ICDCS.2012.16

  5. Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Kosaraju, S.R. (ed.) Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 7–9 January 2001, Washington, DC, USA, pp. 709–718. ACM/SIAM (2001). http://dl.acm.org/citation.cfm?id=365411.365756

  6. Cornejo, A., Viqar, S., Welch, J.L.: Reliable neighbor discovery for mobile ad hoc networks. Ad Hoc Netw. 12, 259–277 (2014). https://doi.org/10.1016/j.adhoc.2012.08.009

    Article  Google Scholar 

  7. Dyachkov, A.G., Rykov, V.V., Rashad, A.M.: Superimposed distance codes. Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform. 18(4), 237–250 (1989)

    MathSciNet  MATH  Google Scholar 

  8. Ellen, F., Subramanian, S., Welch, J.: Maintaining information about nearby processors in a mobile environment. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) ICDCN 2006. LNCS, vol. 4308, pp. 193–202. Springer, Heidelberg (2006). https://doi.org/10.1007/11947950_22

    Chapter  Google Scholar 

  9. Erdös, P., Frankl, P., Füredi, Z.: Families of finite sets in which no set is covered by the union of \(r\) others. Israel J. Math. 51, 79–89 (1985)

    Article  MathSciNet  Google Scholar 

  10. Gasieniec, L., Pagourtzis, A., Potapov, I., Radzik, T.: Deterministic communication in radio networks with large labels. Algorithmica 47(1), 97–117 (2007). https://doi.org/10.1007/s00453-006-1212-3

    Article  MathSciNet  MATH  Google Scholar 

  11. Kautz, W., Singleton, R.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory 10(4), 363–377 (1964)

    Article  Google Scholar 

  12. Khan, A.A., Rehmani, M.H., Saleem, Y.: Neighbor discovery in traditional wireless networks and cognitive radio networks: basics, taxonomy, challenges and future research directions. J. Netw. Comput. Appl. 52, 173–190 (2015). https://doi.org/10.1016/j.jnca.2015.03.003

    Article  Google Scholar 

  13. Krishnamurthy, S., et al.: Time-efficient distributed layer-2 auto-configuration for cognitive radio networks. Comput. Netw. 52(4), 831–849 (2008). https://doi.org/10.1016/j.comnet.2007.11.013

    Article  MATH  Google Scholar 

  14. Kuhn, F., Lynch, N.A., Newport, C.C.: The abstract MAC layer. Distrib. Comput. 24(3–4), 187–206 (2011). https://doi.org/10.1007/s00446-010-0118-0

    Article  MATH  Google Scholar 

  15. Kuhn, F., Oshman, R.: Dynamic networks: models and algorithms. SIGACT News 42(1), 82–96 (2011). https://doi.org/10.1145/1959045.1959064

    Article  Google Scholar 

  16. Miller, A.: Gossiping in one-dimensional synchronous ad hoc wireless radio networks. In: Blin, L., Busnel, Y. (eds.) 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, TADDS 2012, 17 December 2012, Roma, Italy, pp. 32–43. ACM (2012). https://doi.org/10.1145/2414815.2414822

  17. Miller, A.: Deterministic neighbourhood learning in ad hoc wireless radio networks. Ph.D. thesis, University of Toronto (2014). http://hdl.handle.net/1807/68138

  18. Mittal, N., Krishnamurthy, S., Chandrasekaran, R., Venkatesan, S., Zeng, Y.: On neighbor discovery in cognitive radio networks. J. Parallel Distrib. Comput. 69(7), 623–637 (2009). https://doi.org/10.1016/j.jpdc.2009.03.008

    Article  Google Scholar 

  19. Vaya, S.: Round complexity of leader election and gossiping in bidirectional radio networks. Inf. Process. Lett. 113(9), 307–312 (2013). https://doi.org/10.1016/j.ipl.2013.02.001

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was partially supported by NSERC Discovery Grant 2017-05936. The author would like to thank Faith Ellen for her invaluable advice that substantially increased the quality of the results and presentation of this research.

Author information

Authors and Affiliations

  1. University of Manitoba, Winnipeg, MB, R3T 2N2, Canada

    Avery Miller

Authors
  1. Avery Miller
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Avery Miller .

Editor information

Editors and Affiliations

  1. National University of Singapore, Singapore, Singapore

    Seth Gilbert

  2. KU Leuven, Heverlee, Belgium

    Danny Hughes

  3. University of Southern California, Los Angeles, CA, USA

    Bhaskar Krishnamachari

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Miller, A. (2019). Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks. In: Gilbert, S., Hughes, D., Krishnamachari, B. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2018. Lecture Notes in Computer Science(), vol 11410. Springer, Cham. https://doi.org/10.1007/978-3-030-14094-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-14094-6_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-14093-9

  • Online ISBN: 978-3-030-14094-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation