This paper presents a Distributed, Efficient Clustering Approach (DECA) for ad hoc and sensor networks. DECA can provide robustness against moderate node mobility and at the same time render energy-efficiency. The identified clusterheads cover the whole network and each node in the network can determine its cluster and only one cluster. The algorithm terminates in deterministic time without iterations, and each node transmits only one message during the algorithm. We prove analytically the correctness and complexity of the algorithm, and simulation results demonstrate that DECA is energy-efficient and resilient against node mobility.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- A Distributed Efficient Clustering Approach for Ad Hoc and Sensor Networks
Jason H. Li
- Springer Berlin Heidelberg
Neuer Inhalt/© ITandMEDIA