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.

Author dc:creator

• Yeung, Chun

Contributors dc:contributor

• Turgut, Damla

• Ad hoc Clustering Algortihm
• Computer Engineering
• Engineering

Language dc:language

English

Identifier

CFE0001314

OAI identifier oai:identifier

oai:stars.library.ucf.edu:etd-1908