Inter- and intra-cluster movement of mobile sink algorithms for cluster-based networks to enhance the network lifetime

Due to limited resources of the sensor nodes energy efficiency is an important performance metric to evaluate the wireless sensor networks (WSN). In cluster-based WSNs, the cluster heads (CH) located around base station (BS) consume more energy and exhaust their energy supplies faster than other one...

Full description

Bibliographic Details
Main Authors: Gharaei, Niayesh, Abu Bakar, Kamalrulnizam, Mohd. Hashim, Siti Zaiton, Pourasl, Ali Hosseingholi
Format: Article
Published: Elsevier B.V. 2019
Subjects:
_version_ 1796864446262411264
author Gharaei, Niayesh
Abu Bakar, Kamalrulnizam
Mohd. Hashim, Siti Zaiton
Pourasl, Ali Hosseingholi
author_facet Gharaei, Niayesh
Abu Bakar, Kamalrulnizam
Mohd. Hashim, Siti Zaiton
Pourasl, Ali Hosseingholi
author_sort Gharaei, Niayesh
collection ePrints
description Due to limited resources of the sensor nodes energy efficiency is an important performance metric to evaluate the wireless sensor networks (WSN). In cluster-based WSNs, the cluster heads (CH) located around base station (BS) consume more energy and exhaust their energy supplies faster than other ones which leads to energy hole problem and premature network death. Furthermore, single-hop transmission manner is usually applied for intra-cluster communication, therefore the member nodes (MN) located farther away from CHs die sooner than other MNs, which leads to coverage holes and reduce the network performance. In this paper, we propose mobile sink (MS) based inter- and intra-cluster routing algorithms. The first algorithm aims to solve the unbalanced energy consumption of CHs, which results in enhanced network lifetime. Likewise, the goal of the second algorithm is to balance the energy consumption of MNs, which results in improved coverage time of the network. In the proposed mechanism, MSs move along clusters and stay in each cluster for a limited sojourn time calculated via first algorithm. Then, the optimal sojourn positions of MSs in the clusters are determined via second algorithm. Simulation results reveal that the proposed algorithms enhance the network performance in terms of different performance evaluation metrics.
first_indexed 2024-03-05T20:41:59Z
format Article
id utm.eprints-87460
institution Universiti Teknologi Malaysia - ePrints
last_indexed 2024-03-05T20:41:59Z
publishDate 2019
publisher Elsevier B.V.
record_format dspace
spelling utm.eprints-874602020-11-08T04:00:06Z http://eprints.utm.my/87460/ Inter- and intra-cluster movement of mobile sink algorithms for cluster-based networks to enhance the network lifetime Gharaei, Niayesh Abu Bakar, Kamalrulnizam Mohd. Hashim, Siti Zaiton Pourasl, Ali Hosseingholi QA75 Electronic computers. Computer science Due to limited resources of the sensor nodes energy efficiency is an important performance metric to evaluate the wireless sensor networks (WSN). In cluster-based WSNs, the cluster heads (CH) located around base station (BS) consume more energy and exhaust their energy supplies faster than other ones which leads to energy hole problem and premature network death. Furthermore, single-hop transmission manner is usually applied for intra-cluster communication, therefore the member nodes (MN) located farther away from CHs die sooner than other MNs, which leads to coverage holes and reduce the network performance. In this paper, we propose mobile sink (MS) based inter- and intra-cluster routing algorithms. The first algorithm aims to solve the unbalanced energy consumption of CHs, which results in enhanced network lifetime. Likewise, the goal of the second algorithm is to balance the energy consumption of MNs, which results in improved coverage time of the network. In the proposed mechanism, MSs move along clusters and stay in each cluster for a limited sojourn time calculated via first algorithm. Then, the optimal sojourn positions of MSs in the clusters are determined via second algorithm. Simulation results reveal that the proposed algorithms enhance the network performance in terms of different performance evaluation metrics. Elsevier B.V. 2019-03-15 Article PeerReviewed Gharaei, Niayesh and Abu Bakar, Kamalrulnizam and Mohd. Hashim, Siti Zaiton and Pourasl, Ali Hosseingholi (2019) Inter- and intra-cluster movement of mobile sink algorithms for cluster-based networks to enhance the network lifetime. Ad Hoc Networks, 85 . pp. 60-70. ISSN 1570-8705 http://dx.doi.org/10.1016/j.adhoc.2018.10.020 DOI:10.1016/j.adhoc.2018.10.020
spellingShingle QA75 Electronic computers. Computer science
Gharaei, Niayesh
Abu Bakar, Kamalrulnizam
Mohd. Hashim, Siti Zaiton
Pourasl, Ali Hosseingholi
Inter- and intra-cluster movement of mobile sink algorithms for cluster-based networks to enhance the network lifetime
title Inter- and intra-cluster movement of mobile sink algorithms for cluster-based networks to enhance the network lifetime
title_full Inter- and intra-cluster movement of mobile sink algorithms for cluster-based networks to enhance the network lifetime
title_fullStr Inter- and intra-cluster movement of mobile sink algorithms for cluster-based networks to enhance the network lifetime
title_full_unstemmed Inter- and intra-cluster movement of mobile sink algorithms for cluster-based networks to enhance the network lifetime
title_short Inter- and intra-cluster movement of mobile sink algorithms for cluster-based networks to enhance the network lifetime
title_sort inter and intra cluster movement of mobile sink algorithms for cluster based networks to enhance the network lifetime
topic QA75 Electronic computers. Computer science
work_keys_str_mv AT gharaeiniayesh interandintraclustermovementofmobilesinkalgorithmsforclusterbasednetworkstoenhancethenetworklifetime
AT abubakarkamalrulnizam interandintraclustermovementofmobilesinkalgorithmsforclusterbasednetworkstoenhancethenetworklifetime
AT mohdhashimsitizaiton interandintraclustermovementofmobilesinkalgorithmsforclusterbasednetworkstoenhancethenetworklifetime
AT pouraslalihosseingholi interandintraclustermovementofmobilesinkalgorithmsforclusterbasednetworkstoenhancethenetworklifetime