Skip to main content

Using Cellular Automata to Determine Bounds for Measuring the Efficiency of Broadcast Algorithms in Highly Mobile Ad Hoc Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3305))

Abstract

The proliferation of mobile computing devices in recent years has produced an increased interest in the development of efficient methods of communication among these devices. As networked mobile devices move, the configurations of the networks of which they are a part change and if the time between these changes is short enough then conventional routing algorithms are no longer useful. This paper describes the use of cellular automata to model message broadcasting among autonomous agents in highly mobile ad hoc networks. The advantages offered by using this method to study the problem are discussed and an upper bound on the time steps required by a “reasonable” broadcast algorithm is derived.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tanenbaum, A., van Steen, M.: Distributed Systems, Principles and Paradigms. Prentice Hall, Inc., Upper Saddle River (2002)

    MATH  Google Scholar 

  2. Perkins, C., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. In: SIGCOMM 1994, pp. 234–244 (1994)

    Google Scholar 

  3. Johansson, P., Larsson, T., Hedman, N., Mielczarek, B., Degermark, M.: Scenario-based Performance Analysis of Routing Protocols for Mobile Ad-hoc Networks. In: Mobicom 1999, pp. 195–206 (1999)

    Google Scholar 

  4. Chandy, K.M., Lamport, L.: Distributed Snapshots: Determining Global States if Distributed Systems. ACM Transactions on Computer Systems 3(1), 63–75 (1985)

    Article  Google Scholar 

  5. Murphy, A., Roman, G.-C., Varghese, G.: An Algorithm for Message Delivery to Mobile Units. In: PODC 1997, p. 292 (1997)

    Google Scholar 

  6. Das, S.K., Manoj, B., Ram, C.S., Murthy, A.: A Dynamic Core Based Multicast Routing Protocol for Ad Hoc Wireless Networks. In: MobiHoc 2002, pp. 24–34 (2002)

    Google Scholar 

  7. Chen, Y., Liestman, A.: Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile. In: Ad Hoc Networks, MobiHoc 2002, pp. 165–172 (2002)

    Google Scholar 

  8. Peng, W., Lu, X.-C.: On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks. In: MobiHoc 2000, pp. 129–130 (2000)

    Google Scholar 

  9. Chantemargue, F., Dagaeff, T., Hirsbrunner, B.: Emergence-based Cooperation in a Multi-Agent System. In: Proceedings of the Second European Conference Cognitive Science (ECCS 1997), Manchester U.K, April 9-11, pp. 91–96 (1997)

    Google Scholar 

  10. Thangiah, S., Shmygelska, L., Mennell., W.: An Agent Architecture for Vehicle Routing Problems. In: ACM Symposium on Applied Computing 2001, pp. 517–521 (2001)

    Google Scholar 

  11. Sarkar, P.: A Brief History of Cellular Automata. ACM Computing Surveys 32(1), 80–107 (2000)

    Article  Google Scholar 

  12. Mukhopadhyay, A.: Representation of Events in the von Neumann Cellular Model. Journal of the Association for Computing Machinery 15(4), 693–705 (1968)

    MATH  Google Scholar 

  13. Subrata, R., Zomaya, A.: Evolving Cellular Automata for Location Management in Mobile Computing Networks. IEEE Transactions on Parallel and Distributed Systems 14(1), 13–26 (2003)

    Article  Google Scholar 

  14. Farley, A.: Broadcast time in communication networks. SIAM Journal of Applied Mathematics (39), 385–390 (1980)

    Google Scholar 

  15. Khelil, A., Becker, C., Tian, J., Rothermel, K.: An Epidemic Model for Information Diffusion in MANETs. In: Proceedings of The Fifth ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2002), pp. 54–60 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kirkpatrick, M., Van Scoy, F. (2004). Using Cellular Automata to Determine Bounds for Measuring the Efficiency of Broadcast Algorithms in Highly Mobile Ad Hoc Networks. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds) Cellular Automata. ACRI 2004. Lecture Notes in Computer Science, vol 3305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30479-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30479-1_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23596-5

  • Online ISBN: 978-3-540-30479-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics