Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency

Includes bibliographical references (leaves 161-172).

Saved in:
Bibliographic Details
Main Author: Wei, Dali
Other Authors: Chan, H Anthony
Format: Thesis
Language:English
Published: Department of Electrical Engineering 2014
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867613161047195648
access_status_str Open Access
author Wei, Dali
author2 Chan, H Anthony
author_browse Chan, H Anthony
Wei, Dali
author_facet Chan, H Anthony
Wei, Dali
author_sort Wei, Dali
collection Thesis
description Includes bibliographical references (leaves 161-172).
format Thesis
id oai:open.uct.ac.za:11427/5084
institution University of Cape Town (South Africa)
language eng
last_indexed 2026-06-10T12:31:43.046Z
license_str Not specified — see source repository
provenance_str_mv Harvested via OAI-PMH from UCTD — University of Cape Town Open Access Repository
publishDate 2014
publishDateRange 2014
publishDateSort 2014
publisher Department of Electrical Engineering
publisherStr Department of Electrical Engineering
record_format dspace
source_str UCTD — University of Cape Town Open Access Repository
spelling oai:open.uct.ac.za:11427/5084 Clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency Wei, Dali Chan, H Anthony Electrical Engineering Includes bibliographical references (leaves 161-172). Many clustering algorithms have been proposed to improve energy efficiency of ad hoc networks as this is one primary challenge in ad hoc networks. The design of these clustering algorithms in sensor networks is different from that in mobile ad hoc networks in accordance with their specific characteristics and application purposes. A typical sensor network, which consists of stationary sensor nodes, usually has a data sink because of the limitation on processing capability of sensor nodes. The data traffic of the entire network is directional towards the sink. This directional traffic burdens the nodes/clusters differently according to their distance to the sink. Most clustering algorithms assign a similar number of nodes to each cluster to balance the burden of the clusters without considering the directional data traffic. They thus fail to maximize network lifetime. This dissertation proposes two clustering algorithms. These consider the directional data traffic in order to improve energy efficiency of homogeneous sensor networks with identical sensor nodes and uniform node distribution. One algorithm is for sensor networks with low to medium node density. The other is for sensor networks with high node density. Both algorithms organize the clusters in such a way that the cluster load is proportional to the cluster energy stored, thereby equalizing cluster lifetimes and preventing premature node/cluster death. Furthermore, in a homogeneous sensor network with low to medium node density, the clusterhead is maintained in the central area of the cluster through re-clustering without ripple effect to save more energy. The simulation results show that the proposed algorithms improve both the lifetime of the networks and performance of data being delivered to the sink. A typical mobile ad hoc network, which usually consists of moveable nodes, does not have a data sink. Existing energy-efficient clustering algorithms maintain clusters by periodically broadcasting control messages. In a typical mobile ad hoc network, a greater speed of node usually needs more frequent broadcasting. To efficiently maintain the clusters, the frequency of this periodic broadcasting needs to meet the requirement of the potentially maximum speed of node. When the node speed is low, the unnecessary broadcasting may waste significant energy. Furthermore, some clustering algorithms limit the maximum cluster size to moderate the difference in cluster sizes. Unfortunately, the cluster sizes in these algorithms still experience significant difference. The larger clusters will have higher burdens. Some clustering algorithms restrict the cluster sizes between the maximum and minimum limits. The energy required to maintain these clusters within the maximum and minimum sizes is quite extensive, especially when the nodes are moving quickly. Thus, energy efficiency is not optimized. 2014-07-31T10:51:22Z 2014-07-31T10:51:22Z 2007 Doctoral Thesis Doctoral PhD http://hdl.handle.net/11427/5084 eng application/pdf Department of Electrical Engineering Faculty of Engineering and the Built Environment University of Cape Town
spellingShingle Electrical Engineering
Wei, Dali
Clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency
thesis_degree_str Doctoral
title Clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency
title_full Clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency
title_fullStr Clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency
title_full_unstemmed Clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency
title_short Clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency
title_sort clustering algorithms for sensor networks and mobile ad hoc networks to improve energy efficiency
topic Electrical Engineering
url http://hdl.handle.net/11427/5084
work_keys_str_mv AT weidali clusteringalgorithmsforsensornetworksandmobileadhocnetworkstoimproveenergyefficiency