Activity-aware clustering algorithm for wireless sensor networks

Morteza Mohammadi Zanjireh; Hadi Larijani; Wasiu O. Popoola

doi:10.1109/CSNDSP.2014.6923810

Activity-aware clustering algorithm for wireless sensor networks

Morteza Mohammadi Zanjireh, Hadi Larijani, Wasiu O. Popoola

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

In a Wireless Sensor Network (WSN) environment, there are many application cases that make use of unequally importance of the nature of distributed sensors. This paper proposes a clustering algorithm for these kinds of environments: prioritising the prolonging of active sensors by way of monitoring the important regions in a network environment. The results of our extensive study for this type of environment shows a considerable increase in the number of sensed events on average by 104.28%, 73.14%, and 50.97%, compared with those of Low Energy Adaptive Clustering Hierarchy (LEACH), Hybrid Energy-Efficient Distributed (HEED), and Avoid Near Cluster Head (ANCH) algorithms, respectively.

Original language	English
Title of host publication	2014 9th International Symposium on Communication Systems, Networks and Digital Signal Processing, CSNDSP 2014
Place of Publication	Manchester, UK
Publisher	IEEE
Pages	122-127
Number of pages	6
ISBN (Electronic)	9781479925810
ISBN (Print)	9781479925810
DOIs	https://doi.org/10.1109/CSNDSP.2014.6923810
Publication status	Published - 16 Oct 2014

Keywords

wireless sensor networks (WSN)
clustering algorithm
network environment
Energy efficiency
Active and inactive sensors
Clustering
Environmental monitoring
Wireless Sensor Networks
Algorithm

Documents and Links

10.1109/CSNDSP.2014.6923810

Cite this

@inproceedings{b2a75c51327640369abe8f59988d6815,

title = "Activity-aware clustering algorithm for wireless sensor networks",

abstract = "In a Wireless Sensor Network (WSN) environment, there are many application cases that make use of unequally importance of the nature of distributed sensors. This paper proposes a clustering algorithm for these kinds of environments: prioritising the prolonging of active sensors by way of monitoring the important regions in a network environment. The results of our extensive study for this type of environment shows a considerable increase in the number of sensed events on average by 104.28%, 73.14%, and 50.97%, compared with those of Low Energy Adaptive Clustering Hierarchy (LEACH), Hybrid Energy-Efficient Distributed (HEED), and Avoid Near Cluster Head (ANCH) algorithms, respectively.",

keywords = "wireless sensor networks (WSN), clustering algorithm, network environment, Energy efficiency, Active and inactive sensors, Clustering, Environmental monitoring, Wireless Sensor Networks, Algorithm",

author = "Zanjireh, {Morteza Mohammadi} and Hadi Larijani and Popoola, {Wasiu O.}",

year = "2014",

month = oct,

day = "16",

doi = "10.1109/CSNDSP.2014.6923810",

language = "English",

isbn = "9781479925810",

pages = "122--127",

booktitle = "2014 9th International Symposium on Communication Systems, Networks and Digital Signal Processing, CSNDSP 2014",

publisher = "IEEE",

address = "United States",

}

Activity-aware clustering algorithm for wireless sensor networks. / Zanjireh, Morteza Mohammadi; Larijani, Hadi; Popoola, Wasiu O.
2014 9th International Symposium on Communication Systems, Networks and Digital Signal Processing, CSNDSP 2014. Manchester, UK: IEEE, 2014. p. 122-127.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Activity-aware clustering algorithm for wireless sensor networks

AU - Zanjireh, Morteza Mohammadi

AU - Larijani, Hadi

AU - Popoola, Wasiu O.

PY - 2014/10/16

Y1 - 2014/10/16

N2 - In a Wireless Sensor Network (WSN) environment, there are many application cases that make use of unequally importance of the nature of distributed sensors. This paper proposes a clustering algorithm for these kinds of environments: prioritising the prolonging of active sensors by way of monitoring the important regions in a network environment. The results of our extensive study for this type of environment shows a considerable increase in the number of sensed events on average by 104.28%, 73.14%, and 50.97%, compared with those of Low Energy Adaptive Clustering Hierarchy (LEACH), Hybrid Energy-Efficient Distributed (HEED), and Avoid Near Cluster Head (ANCH) algorithms, respectively.

AB - In a Wireless Sensor Network (WSN) environment, there are many application cases that make use of unequally importance of the nature of distributed sensors. This paper proposes a clustering algorithm for these kinds of environments: prioritising the prolonging of active sensors by way of monitoring the important regions in a network environment. The results of our extensive study for this type of environment shows a considerable increase in the number of sensed events on average by 104.28%, 73.14%, and 50.97%, compared with those of Low Energy Adaptive Clustering Hierarchy (LEACH), Hybrid Energy-Efficient Distributed (HEED), and Avoid Near Cluster Head (ANCH) algorithms, respectively.

KW - wireless sensor networks (WSN)

KW - clustering algorithm

KW - network environment

KW - Energy efficiency

KW - Active and inactive sensors

KW - Clustering

KW - Environmental monitoring

KW - Wireless Sensor Networks

KW - Algorithm

U2 - 10.1109/CSNDSP.2014.6923810

DO - 10.1109/CSNDSP.2014.6923810

M3 - Conference contribution

SN - 9781479925810

SP - 122

EP - 127

BT - 2014 9th International Symposium on Communication Systems, Networks and Digital Signal Processing, CSNDSP 2014

PB - IEEE

CY - Manchester, UK

ER -

Activity-aware clustering algorithm for wireless sensor networks

Abstract

Keywords

Documents and Links

Fingerprint

Cite this