Skip to main content

Adaptive Routing Algorithm in Wireless Communication Networks Using Evolutionary Algorithm

  • Conference paper
  • 1617 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 15))

Abstract

At present, mobile communications traffic routing designs are complicated because there are more systems inter-connecting to one another. For example, Mobile Communication in the wireless communication networks has two routing design conditions to consider, i.e. the circuit switching and the packet switching. The problem in the Packet Switching routing design is its use of high-speed transmission link and its dynamic routing nature. In this paper, Evolutionary Algorithms is used to determine the best solution and the shortest communication paths. We developed a Genetic Optimization Process that can help network planners solving the best solutions or the best paths of routing table in wireless communication networks are easily and quickly. From the experiment results can be noted that the evolutionary algorithm not only gets good solutions, but also a more predictable running time when compared to sequential genetic algorithm.

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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Woo, M., Singh, S., Raghavendra, C.S.: Power-aware Routing in Mobile Ad Hoc Networks. In: Proc. 4th Annual ACM/IEEE Intl. Conf. on Mobile Computing & Networking, pp. 181–190 (1998)

    Google Scholar 

  2. Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford Univ. Press, Oxford (1987)

    Google Scholar 

  3. Jan, R.H.: Design of reliable networks. Comput. Oper. Res. 20, 25–34 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Jan, R.H., Hwang, F.J., Cheng, S.T.: Topological Optimization of a Communication Network Subject to a Reliability Constraint. IEEE Trans. Reliab. 42, 63–70 (1993)

    Article  MATH  Google Scholar 

  5. Vetetsanopoulos, A.N., Singh, I.: Topological Optimization of Communication Networks Subject to Reliability Constraint. Probl. Contr. Inform. Theor. 15, 63–78 (1986)

    Google Scholar 

  6. Atiqullah, M.M., Rao, S.S.: Reliability Optimization of Comunication Network Using Simulated Annealing. Microelectron. Reliab. 33, 1303–1319 (1993)

    Article  Google Scholar 

  7. Pierre, S., Hyppolite, M.A., Bourjolly, J.M., Dioume, O.: Topological Desing of Computer Communication Network Using Simulated Annealing. Eng. Appl. Artif. Intel. 8, 61–69 (1995)

    Article  Google Scholar 

  8. Glover, F., Lee, M., Ryan, J.: Least-cost Network Topology Design for a New Service: An Application of a Tabu Search. Ann. Oper. Res. 33, 351–362 (1991)

    Article  MATH  Google Scholar 

  9. Beltran, H.F., Skorin-Kapov, D.: On Minimum Cost Isolated Failure Immune Network. Telecommun. Syst. 3, 183–200 (1994)

    Article  Google Scholar 

  10. Koh, S.J., Lee, C.Y.: A Tabu Search for the Survivable Fiber Optic Communication Network Design. Comput. Ind. Eng. 28, 689–700 (1995)

    Article  Google Scholar 

  11. Davis, L. (ed.): Genetic Algorithms and Simulated Annealing. Morgan Kaufmann Publishers, San Mateo (1987)

    MATH  Google Scholar 

  12. Barán, B., Laufer, F.: Topological Optimization of Reliable Networks using A-Teams. In: Proceedings of the International Conferences on Systemics, Cybernetic and Informatics, Orlando-Florida, USA (1999)

    Google Scholar 

  13. Guo, T., Michalewize, Z.: Inver-over Operator for the TSP. In: Parallel Problem Sovling from Nature (PPSN V), pp. 803–812. Springer, Heidelberg (1998)

    Google Scholar 

  14. Yan, X.S., Li, H., et al.: A Fast Evolutionary Algorithm for Combinatorial Optimization Problems. In: Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, pp. 3288–3292. IEEE Press, Los Alamitos (2005)

    Google Scholar 

  15. Dengiz, B., Altiparmak, F., Smith, A.E.: Local Search Genetic Algorithm for Optimal Design of Reliable Networks. IEEE Trans. Evolut. Comput. 1(3), 179–188 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

De-Shuang Huang Donald C. Wunsch II Daniel S. Levine Kang-Hyun Jo

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yan, X., Wu, Q., Cai, Z. (2008). Adaptive Routing Algorithm in Wireless Communication Networks Using Evolutionary Algorithm. In: Huang, DS., Wunsch, D.C., Levine, D.S., Jo, KH. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques. ICIC 2008. Communications in Computer and Information Science, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85930-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85930-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85929-1

  • Online ISBN: 978-3-540-85930-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics