A Performance Comparison Of Clustering Algorithms In Ad Hocnetworks

An ad hoc network is comprised of wireless mobile nodes without the need of wired network infrastructure. Due to the limited transmission range of nodes, the exchange of data between them may not be possible using direct communication. Partitioning the network into clusters and electing a clusterhead for each cluster to assist with the resource allocation and data packet transmissions among its members and neighboring clusterheads is one of the most common ways of providing support for the existing ad hoc routing protocols. This thesis presents the performance comparison of four ad hoc network clustering protocols: Dynamic Mobile Adaptive Clustering (DMAC), Highest-Degree and Lowest-ID algorithms, and Weighted Clustering Algorithm (WCA). Yet Another Extensible Simulation (YAES) was used as the simulator to carry out the simulations.

[1]  Anthony Ephremides,et al.  A Distributed Algorithm for Organizing Mobile Radio Telecommunication Networks , 1981, IEEE International Conference on Distributed Computing Systems.

[2]  Winston Khoon Guan Seah,et al.  Mobility-based d-hop clustering algorithm for mobile ad hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[3]  Imrich Chlamtac,et al.  Energy Efficient Design of Wireless Ad Hoc Networks , 2002, NETWORKING.

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

[5]  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).

[6]  Damla Turgut,et al.  YAES: a modular simulator for mobile networks , 2005, MSWiM '05.

[7]  Ramez Elmasri,et al.  Optimizing clustering algorithm in mobile ad hoc networks using genetic algorithmic approach , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[8]  Ramez Elmasri,et al.  Optimizing clustering algorithm in mobile ad hoc networks using simulated annealing , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

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

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

[11]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[12]  Stefano Basagni,et al.  A performance comparison of protocols for clustering and backbone formation in large scale ad hoc networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[13]  Ruay-Shiung Chang,et al.  Weight-based clustering multicast routing protocol for mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[14]  Charalampos Konstantopoulos,et al.  Lowest-ID with adaptive ID reassignment: a novel mobile ad-hoc networks clustering algorithm , 2006, 2006 1st International Symposium on Wireless Pervasive Computing.

[15]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

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