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

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.

[1]  Konstantinos Kalpakis,et al.  MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS , 2002 .

[2]  D. Manivannan,et al.  Routing protocols for sensor networks , 2004, First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004..

[3]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4]  Spyros Tragoudas,et al.  Routing with energy considerations in mobile ad-hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[5]  Sajal K. Das,et al.  Fast determination of QoS-based multicast routes in wireless networks using genetic algorithm , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).