DocumentCode
2781089
Title
Energy-efficient routing in hierarchical wireless sensor networks using differential-evolution-based memetic algorithm
Author
Chakraborty, Uday K. ; Das, Sajal K. ; Abbott, Travis E.
Author_Institution
Dept. of Math. & Comput. Sci., Univ. of Missouri - St. Louis, St. Louis, MO, USA
fYear
2012
fDate
10-15 June 2012
Firstpage
1
Lastpage
8
Abstract
Optimal routing in hierarchical wireless sensor networks is an NP-complete problem of immense practical importance for which exact solutions exist for very small problem sizes. This paper presents a new memetic algorithm, based on differential evolution, that solves routing problems of more than a thousand relay nodes; in comparison, the best-known approach in the literature handles up to 312 nodes. Simulation results show that the proposed method consistently produces better-quality solutions than three competing approaches.
Keywords
evolutionary computation; telecommunication network routing; wireless sensor networks; NP-complete problem; differential-evolution; energy-efficient routing; hierarchical wireless sensor network; memetic algorithm; Base stations; Encoding; Genetic algorithms; Memetics; Relays; Routing; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation (CEC), 2012 IEEE Congress on
Conference_Location
Brisbane, QLD
Print_ISBN
978-1-4673-1510-4
Electronic_ISBN
978-1-4673-1508-1
Type
conf
DOI
10.1109/CEC.2012.6252985
Filename
6252985
Link To Document