Discrete Mathematics - Topics on domination
A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Spine routing in ad hoc networks
Cluster Computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
A Mobility-Resistant Efficient Clustering Approach for ad hoc and sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
A scalable key management and clustering scheme for ad hoc networks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Agent-Based Cooperative Anomaly Detection for Wireless Ad Hoc Networks
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A scalable key management and clustering scheme for wireless ad hoc and sensor networks
Future Generation Computer Systems
Hi-index | 0.00 |
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.