Parallel Architectures, Algorithms, and Networks, International Symposium on (2005)
Las Vegas, Nevada, USA
Dec. 7, 2005 to Dec. 9, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2005.12
Doina Bein , UNLV
Ajoy K. Datta , UNLV
Chakradhar R. Jagganagari , UNLV
Vincent Villain , LaRIA, Universite de Picardie Jules Verne, France
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.
C. R. Jagganagari, D. Bein, V. Villain and A. K. Datta, "A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks," Parallel Architectures, Algorithms, and Networks, International Symposium on(ISPAN), Las Vegas, Nevada, USA, 2005, pp. 436-441.