Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
K-clustering in wireless ad hoc networks
Proceedings of the second ACM international workshop on Principles of mobile computing
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Connectivity-based clustering with stretching technique in MANETs
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Toward stable clustering in mobile ad hoc networks
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
An overlay approach for optimising small-world properties in VANETs
EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation
| Hi-index | 0.00 |
In mobile wireless networks communication is often improved by sending messages along a stable backbone of more reliable communication paths. Building such a backbone requires efficient clustering algorithms which aggregate network nodes into logical groups, each group being managed by a clusterhead and any two neighboring clusters being interconnected by at least one gateway node or gateway path. In this concept k-hop clustering refers to cluster structures where cluster members are at most k hops away from their clusterhead. While the dynamicity of mobile wireless network is often considered as a challenge, in this work we explicitly exploit node mobility in order to support cluster formation and maintenance of k-hop clusters. The described KHOPCA algorithm consists of a set of easy to implement rules which form and maintain k-hop sized clusters in a purely localized way. In a static network cluster formation is limited to a constant number of messages exchanges among neighboring nodes. In dynamic networks the localized nature of the described rules promise a fast cluster convergence and low communication complexity in case of mobility triggered cluster reconfiguration.