SCAM: Scenario-based Clustering Algorithm for Mobile ad hoc networks

This paper proposes a scenario based, adaptive and distributed clustering algorithm SCAM (Scenario-based Clustering Algorithm for Mobile ad hoc networks). A distributed algorithm based on (k, r) - Dominating Set is used for the selection of clusterheads and gateway nodes, here k is the minimum number of clusterheads per node in the network and r is the maximum number of hops between the node and the clusterhead. From among the k dominating nodes, the non-clusterhead node can select the most qualified dominating node as its clusterhead. The quality of the clusterhead is calculated based on various metrics, which include connectivity, stability and residual battery power. Long-term service as clusterhead depletes their energy, causing them to drop out of the network. Similarly, the clusterhead with relatively high mobility than its neighbours leads to frequent clusterhead election process. This perturbs the stability of the network and adversely affects the performance of the network. Load balancing among clusterheads and correct positioning of clusterhead in a cluster are also vital to increase the life span of the network. The proposed algorithm periodically calculates the quality of all dominating nodes and if it goes below the threshold level it resigns the job as clusterhead and sends this message to all other member nodes. Since these nodes have k dominating nodes within r - hop distance, it can choose the current best-qualified node as its clusterhead. SCAM uses techniques to maintain the cluster structure as stable as possible with less control messages.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[2]  Jie Wu,et al.  On constructing k-connected k-dominating set in wireless networks , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[3]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

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

[5]  Prithwish Basu,et al.  A mobility based metric for clustering in mobile ad hoc networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[6]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[7]  Jie Wu,et al.  On constructing k-connected k-dominating set in wireless ad hoc and sensor networks , 2006, J. Parallel Distributed Comput..

[8]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[9]  Peter Han Joo Chong,et al.  3hBAC (3-hop between adjacent clusterheads): a novel non-overlapping clustering algorithm for mobile ad hoc networks , 2003, 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490).

[10]  Stefano Basagni,et al.  Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

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

[12]  Julio Solano-González,et al.  Connectivity Based k-Hop Clustering in Wireless Networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[13]  Wonchang Choi,et al.  A Distributed Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2006, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06).

[14]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

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

[16]  Alessandro Panconesi,et al.  Localized protocols for ad hoc clustering and backbone formation: a performance comparison , 2006, IEEE Transactions on Parallel and Distributed Systems.

[17]  Dong-Ho Cho,et al.  New clustering schemes for energy conservation in two-tiered mobile ad-hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[18]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[19]  J. J. Garcia-Luna-Aceves,et al.  Bounded-distance multi-clusterhead formation in wireless ad hoc networks , 2007, Ad Hoc Networks.

[20]  H.T. Friis,et al.  A Note on a Simple Transmission Formula , 1946, Proceedings of the IRE.

[21]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[22]  Stefano Basagni,et al.  Limiting the impact of mobility on ad hoc clustering , 2005, PE-WASUN '05.

[23]  Sajal K. Das,et al.  Mobility-adaptive protocols for managing large ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[24]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[25]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[26]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[27]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.