Skip to main content

An Efficient Genetic Algorithm for the Power-Based QoS Many-to-One Routing Problem for Wireless Sensor Networks

  • Conference paper
Book cover Information Networking. Convergence in Broadband and Mobile Networking (ICOIN 2005)

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

Included in the following conference series:

Abstract

Since the operations of sensors in a wireless sensor network mainly rely on battery power, power consumption becomes an important issue. In this paper, we will consider the problem of searching for multiple paths between multiple source sensors and the sink such that any sensor in a path from a source sensor to the sink does not run out of its power during the transmission of packets. The problem has been proved to be NP-complete. Based on the principle of genetic algorithms, in this paper, we will design an efficient heuristic algorithm for it. Computer simulations verify that the suboptimal solutions generated by our genetic algorithm are very close to the optimal ones.

This work was supported by the National Science Council of the Republic of China under Grant # NSC 93-2213-E-224-023

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Banerjee, N., Das, S.K.: Fast Determination of QoS-Based Multicast Routes in Wireless Networks Using Genetic Algorithm. In: ICC 2001, vol. 8, pp. 2588–2592 (2001)

    Google Scholar 

  2. Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  3. Gen, M., Cheng, R.: Genetic Algorithms & Engineering Design. Wiley-Interscience, Hoboken (1997)

    Google Scholar 

  4. Hu, C.P.: An Efficient QoS Power-Aware Reverse Multicast Routing Protocol in Wireless Sensor Networks. Master’s Thesis, National Yunlin University of Science and Technology, Yunlin, Taiwan, R.O.C (2004)

    Google Scholar 

  5. Jiang, Q., Manivannan, D.: Routing Protocols for Sensor Networks. In: IEEE Consumer Communications and Networking Conference, pp. 93–98 (2004)

    Google Scholar 

  6. Kalpakis, K., Dasgupta, K., Namjoshi, P.: Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks. In: The Proceedings of the 2002 IEEE International Conference on Networking, Atlanta, Georgia, pp. 685–696 (2002)

    Google Scholar 

  7. Tragoudas, S., Dimitrova, S.: Routing with Energy Considerations in Mobile Ad- Hoc Networks. In: IEEE Wireless communications and Networking Conference, vol. 3, pp. 1258–1261 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sheu, PR., Chien, CH., Hu, CP., Li, YT. (2005). An Efficient Genetic Algorithm for the Power-Based QoS Many-to-One Routing Problem for Wireless Sensor Networks. In: Kim, C. (eds) Information Networking. Convergence in Broadband and Mobile Networking. ICOIN 2005. Lecture Notes in Computer Science, vol 3391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30582-8_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30582-8_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24467-7

  • Online ISBN: 978-3-540-30582-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics