Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
A Distributed Formation of a Virtual Backbone in MANETs Using Adjustable Transmission Ranges
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
On Constructing k-Connected k-Dominating Set in Wireless Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Localized Low-Power Topology Control Algorithms in IEEE 802.15.4-Based Sensor Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
The emergence of networking abstractions and techniques in TinyOS
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
MCC: model-based continuous clustering in wireless sensor networks
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
Hi-index | 0.00 |
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied in each cluster can greatly help to reduce traffic. The size of a cluster is measured by the hop distance from the farthest node to the cluster head. Rather than 1-hop clustering, K-hop clustering is preferred by many energy-constrained applications. However, existing solutions fail to distribute clusters evenly across the sensing field, which may lead to unbalanced energy consumption and network inefficiency. Moreover, they incur high communication overhead. We propose an Evenly Distributed Clustering (EDC) algorithm. Constrained by the maximum cluster size K, EDC distributes clusters uniformly, and minimizes the number of clusters. By introducing a relative synchronization technique, EDC converges fast with low communication overhead. It also helps to improve the successful transmission rate from nodes to their cluster heads. The simulation results indicate that EDC outperforms other existing algorithms.