Paper Info
Title
Energy-Efficient Routing In Hierarchical Wireless Sensor Networks Using Differential-Evolution-Based Memetic Algorithm
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.
Year
DOI
Venue
2012
10.1109/CEC.2012.6252985
2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)
Keywords
Field
DocType
routing,base stations,memetic algorithm,encoding,wireless sensor networks,vectors,memetics,evolutionary computation,np complete problem,differential evolution,genetic algorithms
Link-state routing protocol,Dynamic Source Routing,Computer science,Static routing,Artificial intelligence,Geographic routing,Distributed computing,Key distribution in wireless sensor networks,Mathematical optimization,Hierarchical routing,Destination-Sequenced Distance Vector routing,Wireless Routing Protocol,Machine learning
Conference
Citations 
PageRank 
References 
7
0.51
9
Authors
3
Name
Order
Citations
PageRank
Uday K. Chakraborty187344.61
Sajal K. Das28086745.54
Travis E. Abbott3605.25