Skip to main content

Analysis of Emergent Behavior for GA-based Topology Control Mechanism for Self-Spreading Nodes in MANETs

  • Chapter
Advances in Intelligent Modelling and Simulation

Part of the book series: Studies in Computational Intelligence ((SCI,volume 422))

Abstract

We introduce a genetic algorithm based MANET topology control mechanism to be used in decision making process of adaptive and autonomic systems at run time. A mobile node adapts its speed and direction using limited information collected from local neighbors operating in an unknown geographical terrain. We represent the genetic operators (i.e., selection, crossover and mutation) as a dynamical system model to describe the behavior of a single node’s decision mechanism. In this dynamical system model each mobile node is viewed as a stochastic variable. We build a homogeneous Markov chain to study the convergent nature of multiple mobile nodes running our algorithm, called FGA. Each state in our chain represents a configuration of the nodes in a MANET for a given instant. The homogeneous Markov chain model of our FGA is shown to be ergodic; its convergence is demonstrated using Dobrushin’s contraction coefficients. We also observe that the nodes with longer communication ranges utilize more information about their neighborhood to make better decisions, require less movement and converge faster, whereas smaller communication ranges utilize limited information, take more time to escape local optima, and, hence, consume more energy.

This research was initiated with support from collaborative participation in the Communications Networks Consortium sponsored by the U.S. Army Research Lab under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011, the National Science Foundation grants ECS-0421159 and CNS-0619577 and US Army, Fort Monmouth, New Jersey, Army Communications-Electronics RD&E Center Grant W15P7T-09-CS021.

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

Access this chapter

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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baras, J.S., Tan, X.: Control of autonomous swarms using gibbs sampling. In: 43rd IEEE Conference on Decision and Control, CDC, vol. 5, pp. 4752–4757 (2004)

    Google Scholar 

  2. Borovkov, A.A.: Ergodicity and Stability of Stochastic Processes. Wiley (1998)

    Google Scholar 

  3. Campos, C.A.V., Moraes, L.F.M.: A markovian model representation of individual mobility scenarios in ad hoc networks and its evaluation. EURASIP Journal on Wireless Communications and Networking 2007(35946), 14 (2007)

    Google Scholar 

  4. Chen, M., Zalzala, A.: Safety considirections in the optimization of the paths for mobile robots using genetic algorithms. In: Proc. of First Int. Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (1995)

    Google Scholar 

  5. Ching, W.K., Ng, M.K., Ching, W.: Markov Chains: Models, Algorithms and Applications. International Series in Operations Research & Management Science. Springer (2005)

    Google Scholar 

  6. Dobrushin, R.: Central limit theorem for nonstationary Markov chains. Teor. Veroyatnost Primenen, 365–425 (1956)

    Google Scholar 

  7. Garro, B.A., Sossa, H., Vazquez, R.A.: Path Planning Optimization Using Bio-Inspirited Algorithms. In: Gelbukh, A., Reyes-Garcia, C.A. (eds.) MICAI 2006. LNCS (LNAI), vol. 4293, pp. 319–330. Springer, Heidelberg (2006)

    Google Scholar 

  8. Gesu, V.D., Lenzitti, B., Bosco, G.L., Tegolo, D.: A distributed architecture for autonomous navigation of robots. In: International Workshop on Computer Architectures for Machine Perception, vol. 0, p. 190 (2000)

    Google Scholar 

  9. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc., Boston (1989)

    MATH  Google Scholar 

  10. Gundry, S., Urrea, E., Sahin, C.S., Zou, J., Kusyk, J., Uyar, M.U.: Formal convergence analysis for bio-inspired topology control in manets. In: IEEE Sarnoff Symposium, pp. 1–5 (2011)

    Google Scholar 

  11. Hachigian, J.: Collapsed Markov chains and the Chapman-Kolmogorov equation. The Annals of Mathematical Statistics 34(1), 233–237 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  12. Heo, N., Varshney, P.: A distributed self spreading algorithm for mobile wireless sensor networks. IEEE Wireless Communications and Networking (WCNC) 3(1), 1597–1602 (2003)

    Article  Google Scholar 

  13. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan, New York (1975)

    Google Scholar 

  14. Howard, A., Mataric, M., Sukhatme, G.: Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem. In: Proc. Int. Conf. on Distributed Autonomous Robotic Systems (2002)

    Google Scholar 

  15. Huang, C.F.: A Markov chain analysis of fitness proportional mate selection schemes in genetic algorithm. In: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, p. 682. Morgan Kaufmann Publishers Inc., San Francisco (2002)

    Google Scholar 

  16. Jarvis, J., Shier, D.: Graph-theoretic analysis of finite Markov chains. In: Shier, D.R., Wallenius, K.T. (eds.) Applied Mathematical Modeling: A Multidisciplinary Approach. CRC Press, Cambridge (1999)

    Google Scholar 

  17. Nakama, T.: Markov chain analysis of genetic algorithms in a wide variety of noisy environments. In: GECCO 2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 827–834 (2009)

    Google Scholar 

  18. Nix, A.E., Vose, M.D.: Modeling genetic algorithms with markov chains. Annals of Math. and Artificial Intelligence 5(1), 79–88 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  19. Rudolph, G.: Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks 5 (1994)

    Google Scholar 

  20. Sahin, C.S., Gundry, S., Urrea, E., Uyar, M.U.: Optimizing topology in manets using evolutionary algorithms. In: Chiong, R. (ed.) Variants of Evolutionary Algorithms for Real-World Applications (2011)

    Google Scholar 

  21. Sahin, C.S., Gundry, S., Urrea, E., Uyar, M.U., Conner, M., Bertoli, G., Pizzo, C.: Markov chain models for genetic algorithm based topology control in manets. In: Applications of Evolutionary Computation: EvoApplications 2010, pp. 41–50 (2010)

    Google Scholar 

  22. Sahin, C.S., Urrea, E., Uyar, M.U.: Bio-inspired techniques for topology control of mobile nodes. In: Formal and Practical Aspects of Autonomic Computing and Networking: Specification, Development, and Verification, pp. 217–240 (2011)

    Google Scholar 

  23. Sahin, C.S., Urrea, E., Uyar, M.U., Conner, M., Bertoli, G., Pizzo, C.: Design of genetic algorithms for topology control of unmanned vehicles. International Journal of Applied Decision Sciences (IJADS), Special Issue on “Decision Support Systems for Unmanned Vehicles” 3(3) (2010)

    Google Scholar 

  24. Sahin, C.S., Urrea, U., Uyar, M.U., Conner, M., Hökelek, I., Bertoli, G., Pizzo, C.: Genetic algorithms for self-spreading nodes in manets. In: GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pp. 1115–1116 (2008)

    Google Scholar 

  25. Shinchi, T., Tabuse, M., Kitazoe, T., Todaka, A.: Khepera robots applied to highway autonomous mobiles. Artificial Life and Robotics 7, 118–123 (2000)

    Article  Google Scholar 

  26. Suzuki, J.: A Markov chain analysis on simple genetic algorithms. IEEE Transaction on Systems, Man, and Cybernetics 25(4) (2005)

    Google Scholar 

  27. Urrea, E.: Knowledge sharing agents using genetic algorithms in mobile ad hoc networks. Ph.D. Thesis, The Graduate Center of the City University of New York (2010)

    Google Scholar 

  28. Urrea, E., Sahin, C.S., Uyar, M.U., Conner, M., Bertoli, G., Pizzo, C.: Estimating behavior of a ga-based topology control mechanism for self-spreading nodes in manets. In: IEEE Intl. Conf. on Military Communications (MILCOM), pp. 1275–1280 (2010)

    Google Scholar 

  29. Vose, M.D.: The Simple Genetic Algorithm. MIT Press, Cambridge (1998)

    Google Scholar 

  30. Winfield, A.F.: Distributed sensing and data collection via broken ad hoc wireless connected networks of mobile robots. In: Distributed Autonomous Robotic Systems, vol. 4, pp. 273–282 (2000)

    Google Scholar 

  31. Winkler, G.: Image Analysis, Random Fields and Markov Chains Monte Carlo Methods. Springer, Heidelberg (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stephen Gundry .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gundry, S., Zou, J., Urrea, E., Sahin, C.S., Kusyk, J., Uyar, M.U. (2012). Analysis of Emergent Behavior for GA-based Topology Control Mechanism for Self-Spreading Nodes in MANETs. In: Kołodziej, J., Khan, S., Burczy´nski, T. (eds) Advances in Intelligent Modelling and Simulation. Studies in Computational Intelligence, vol 422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30154-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30154-4_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30153-7

  • Online ISBN: 978-3-642-30154-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics