TY - GEN
T1 - A robust scalable cluster-based multi-hop routing protocol for wireless sensor networks
AU - Mudundi, Sudha
AU - Ali, Hesham
PY - 2007
Y1 - 2007
N2 - Wireless sensor networks are widely deployed for a wide range of applications for gathering information about the environment, monitoring huge building etc. However, the limited energy of the sensor nodes requires efficient gathering of information so that the network lifetime is increased. In literature it is proved that this efficiency can be achieved by clustering the sensor nodes in the network. Previously we proposed a single hop genetic based clustering protocol (GCA) for sensor networks. However, multi-hop routing techniques are known to be a practical approach to solving the problem of routing in sensor networks. In this paper, we present a new robust clustering based multi-hop routing protocol for wireless sensor networks. The proposed genetic clustering algorithm (M-GCA) employs evolutionary techniques to form an efficient virtual backbone. This backbone is used to support routing messages to the base station. Simulation results show that the proposed multi-hop routing protocol outperforms GCA, a single-hop clustering protocol in several scenarios.
AB - Wireless sensor networks are widely deployed for a wide range of applications for gathering information about the environment, monitoring huge building etc. However, the limited energy of the sensor nodes requires efficient gathering of information so that the network lifetime is increased. In literature it is proved that this efficiency can be achieved by clustering the sensor nodes in the network. Previously we proposed a single hop genetic based clustering protocol (GCA) for sensor networks. However, multi-hop routing techniques are known to be a practical approach to solving the problem of routing in sensor networks. In this paper, we present a new robust clustering based multi-hop routing protocol for wireless sensor networks. The proposed genetic clustering algorithm (M-GCA) employs evolutionary techniques to form an efficient virtual backbone. This backbone is used to support routing messages to the base station. Simulation results show that the proposed multi-hop routing protocol outperforms GCA, a single-hop clustering protocol in several scenarios.
UR - http://www.scopus.com/inward/record.url?scp=38149123933&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149123933&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-74742-0_79
DO - 10.1007/978-3-540-74742-0_79
M3 - Conference contribution
AN - SCOPUS:38149123933
SN - 3540747419
SN - 9783540747413
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 895
EP - 907
BT - Parallel and Distributed Processing and Applications - 5th International Symposium, ISPA 2007, Proceedingsq
PB - Springer Verlag
T2 - 5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007
Y2 - 29 August 2007 through 31 August 2007
ER -