You are here

A PERFORMANCE COMPARISON OF CLUSTERING ALGORITHMS IN AD HOCNETWORKS

Download pdf | Full Screen View

Date Issued:
2006
Abstract/Description:
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.
Title: A PERFORMANCE COMPARISON OF CLUSTERING ALGORITHMS IN AD HOCNETWORKS.
25 views
14 downloads
Name(s): Yeung, Chun, Author
Turgut, Damla, Committee Chair
University of Central Florida, Degree Grantor
Type of Resource: text
Date Issued: 2006
Publisher: University of Central Florida
Language(s): English
Abstract/Description: 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.
Identifier: CFE0001314 (IID), ucf:47022 (fedora)
Note(s): 2006-08-01
M.S.Cp.E.
Engineering and Computer Science, School of Electrical Engineering and Computer Science
Masters
This record was generated from author submitted information.
Subject(s): Ad hoc Clustering Algortihm
Persistent Link to This Record: http://purl.flvc.org/ucf/fd/CFE0001314
Restrictions on Access: campus 2007-01-31
Host Institution: UCF

In Collections