TY - GEN
T1 - A distributed topology management protocol for wireless sensor networks
AU - Alqamzi, Hend
AU - Li, Tiffany Jing
PY - 2010
Y1 - 2010
N2 - A new clustering approach, termed Distributed Energy Efficient clustering Protocol (DEEP), is proposed for wireless sensor networks. Using a non-iterative cluster formation operation, the protocol spends an extremely low overhead energy compared to the existing protocols and terminates faster than the energy-expensive iterative processes. The distributed head election algorithm guarantees that the periodically-elected leaders have the highest residual energy among their members in each data reporting cycle, effectively balancing the energy consumption among sensors. The DEEP also accounts for sensor limitations as well as practical concerns such as wireless collision that has not been considered by the existing clustering protocols. It intelligently exploits the overhearing ability of sensors to alleviate the loss of clustering control packets due to collisions. The proposed protocol is very effective in forming well-distributed clusters that ensure the required load balancing, the connectivity of clusters, and the minimum data communication energy during the data collection stage. In addition, the DEEP does not make any advanced assumptions about the required number of clusters, the network density, the energy consumption pattern of sensors or their clock synchronization and capabilities. For a thorough evaluation, we have compared the performance of DEEP with an existing clustering protocol. The simulation results show the effectiveness of DEEP in reducing the energy expenditure besides assuring other desirable features. We have also examined its performance in prolonging the network lifetime in the context of a practical routing protocol.
AB - A new clustering approach, termed Distributed Energy Efficient clustering Protocol (DEEP), is proposed for wireless sensor networks. Using a non-iterative cluster formation operation, the protocol spends an extremely low overhead energy compared to the existing protocols and terminates faster than the energy-expensive iterative processes. The distributed head election algorithm guarantees that the periodically-elected leaders have the highest residual energy among their members in each data reporting cycle, effectively balancing the energy consumption among sensors. The DEEP also accounts for sensor limitations as well as practical concerns such as wireless collision that has not been considered by the existing clustering protocols. It intelligently exploits the overhearing ability of sensors to alleviate the loss of clustering control packets due to collisions. The proposed protocol is very effective in forming well-distributed clusters that ensure the required load balancing, the connectivity of clusters, and the minimum data communication energy during the data collection stage. In addition, the DEEP does not make any advanced assumptions about the required number of clusters, the network density, the energy consumption pattern of sensors or their clock synchronization and capabilities. For a thorough evaluation, we have compared the performance of DEEP with an existing clustering protocol. The simulation results show the effectiveness of DEEP in reducing the energy expenditure besides assuring other desirable features. We have also examined its performance in prolonging the network lifetime in the context of a practical routing protocol.
UR - http://www.scopus.com/inward/record.url?scp=77955359144&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955359144&partnerID=8YFLogxK
U2 - 10.1109/ICC.2010.5502449
DO - 10.1109/ICC.2010.5502449
M3 - Conference contribution
AN - SCOPUS:77955359144
SN - 9781424464043
T3 - IEEE International Conference on Communications
BT - 2010 IEEE International Conference on Communications, ICC 2010
T2 - 2010 IEEE International Conference on Communications, ICC 2010
Y2 - 23 May 2010 through 27 May 2010
ER -