The University of Southampton
University of Southampton Institutional Repository

A cluster-head selection and update algorithm for ad hoc networks

A cluster-head selection and update algorithm for ad hoc networks
A cluster-head selection and update algorithm for ad hoc networks
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 performance 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.
978-1-4244-5637-6
IEEE
Wu, Hao
8d0e3477-dc5a-4ce8-8121-991ad1bbb48d
Zhong, Zhangdui
e048ba4a-3852-4f67-aadd-a88711c717ba
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Wu, Hao
8d0e3477-dc5a-4ce8-8121-991ad1bbb48d
Zhong, Zhangdui
e048ba4a-3852-4f67-aadd-a88711c717ba
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Wu, Hao, Zhong, Zhangdui and Hanzo, Lajos (2011) A cluster-head selection and update algorithm for ad hoc networks. In 2010 IEEE Global Telecommunications Conference GLOBECOM 2010. IEEE. 5 pp . (doi:10.1109/GLOCOM.2010.5683416).

Record type: Conference or Workshop Item (Paper)

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 performance 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.

Other
03-332-03.PDF - Other
Download (252kB)

More information

e-pub ahead of print date: December 2010
Published date: 10 January 2011
Venue - Dates: IEEE Global Telecommunications Conference, 2010. GLOBECOM 2010, Miamai, United States, 2010-12-06 - 2010-12-10
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 271776
URI: http://eprints.soton.ac.uk/id/eprint/271776
ISBN: 978-1-4244-5637-6
PURE UUID: b72c69a2-4239-45ff-8e63-ed47136a763d
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 13 Dec 2010 17:59
Last modified: 10 Dec 2019 01:58

Export record

Altmetrics

Contributors

Author: Hao Wu
Author: Zhangdui Zhong
Author: Lajos Hanzo ORCID iD

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×