Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks
International Journal of Network Management
Robust self-stabilizing weight-based clustering algorithm
Theoretical Computer Science
A robust cluster based routing protocol for MANET
Proceedings of the 2011 International Conference on Communication, Computing & Security
Self-stabilization versus robust self-stabilization for clustering in ad-hoc network
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Robust self-stabilizing clustering algorithm
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Self-stabilizing algorithm for maximal graph partitioning into triangles
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
From self- to self-stabilizing with service guarantee 1-hop weight-based clustering
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a single special node, called clusterhead that contains the routing information about inter and intra-cluster communication. The proposed algorithm assumes that all nodes have unique IDs. The algorithm achieves two tasks. First, the set of special nodes (clusterheads) is elected such that it models the link-cluster architecture: any node belongs to a single cluster, is within two hops of the clusterhead, and knows the direct neighbor on the shortest path toward the clusterhead. Second, the routing tables are maintained by the clusterheads to store information about nodes both within and outside the cluster. There are two advantages of maintaining routing tables only in the clusterheads. First, as no two neighboring nodes are clusterhead (as per the link-cluster architecture), there exists no consistency problems. Second, since other nodes are responsible for forwarding only, they use less power. So, when the CH runs out of power, some neighboring node will be available to take on the task.