Tree and cluster management for MANET

The lack of infrastructure and dynamic nature of mobile ad hoc networks demand new networking strategies to be implemented in order to provide efficient end-to-end communication. Some researches have been proposed to organize the network into groups called clusters and use different routing protocols for inter and intra clusters to propagate an information. But with these solutions, the network first needs to be organized into cluster and next, we need to construct each routing table. Other researchers have been proposed to build a spanning tree on the network to forward informations on a tree but many solutions need to know the global network topology. In this paper, we propose a self-stabilizing algorithm both to construct cluster and simultaneously build a spanning tree on the network. Without any global knowledge, we use only one type of periodically exchanged messages of size Log(5n+3) bits and we construct clusters and the spanning tree on the network.

[1]  Ivan Stojmenovic,et al.  An Adaptive Localized Scheme for Energy-Efficient Broadcasting in Ad Hoc Networks with Directional Antennas , 2004, PWC.

[2]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[3]  Mehmet Hakan Karaata,et al.  Self-stabilizing clustering of tree networks , 2006, IEEE Transactions on Computers.

[4]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[5]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[6]  Ajoy Kumar Datta,et al.  A Self-Stabilizing K-Clustering Algorithm Using an Arbitrary Metric ( Revised Version ) , 2008 .

[7]  David Powell,et al.  A Survey of Dependability Issues in Mobile Wireless Networks , 2003 .

[8]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Constructing Spanning Trees , 1991, Inf. Process. Lett..

[9]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[10]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[11]  Ajoy Kumar Datta,et al.  A Self-Stabilizing O(k)-Time k-Clustering Algorithm , 2010, Comput. J..

[12]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Constructing Breadth-First Trees , 1992, Inf. Process. Lett..

[13]  Murat Demirbas,et al.  A Fault-Local Self-Stabilizing Clustering Service for Wireless Ad Hoc Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[14]  Sayaka Kamei,et al.  A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence , 2008, OPODIS.

[15]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).