A Cluster-head Selection and Update Algorithm for Ad Hoc Networks


Wu, Hao, Zhong, Zhangdui and Hanzo, Lajos (2010) A Cluster-head Selection and Update Algorithm for Ad Hoc Networks. In, Globecom 2010

Download

[img] PDF
Download (246Kb)

Description/Abstract

Abstract—A novel cluster-head selection and update algorithm “Type-based Cluster-forming Algorithm (TCA)” is proposed, which outperforms both the lowest node ID (LID) and the Weighted Clustering Algorithm (WCA) in the ad hoc network scenario considered. The system’s per-formance is investigated in a scenario, when the 50 communicating nodes belong to three different groups, for example, a group of rescue workers, fire-fighters and paramedics. It is demonstrated that the carefully designed protocol is capable of outperforming the above-mentioned benchmarkers both in terms of a reduced number of cluster-head updates and cluster-change events. Hence its quality-of-service may be deemed higher.

Item Type: Conference or Workshop Item (Paper)
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Comms, Signal Processing & Control
Item ID: 271776
Date Deposited: 13 Dec 2010 17:59
Last Modified: 02 Mar 2012 12:22
Contributors: Wu, Hao (Author)
Zhong, Zhangdui (Author)
Hanzo, Lajos (Author)
Date: December 2010
Status: Published
Further Information:Google Scholar
ISI Citation Count:0
URI: http://eprints.soton.ac.uk/id/eprint/271776

Actions (login required)

View Item View Item