CMSTR: a constrained minimum spanning tree based routing protocol for wireless sensor networks

How to extend the network lifetime with given limited energy budget is always one of the main concerns in Wireless Sensor Networks (WSNs). However, imbalanced energy consumption and overlong intra-cluster communication paths are prevalent in the hierarchical routing protocols, which shortens the net...

Full description

Saved in:
Bibliographic Details
Main Authors: Lin, Deyu, Lin, Zihao, Kong, Linghe, Guan, Yong Liang
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2023
Subjects:
Online Access:https://hdl.handle.net/10356/170671
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-170671
record_format dspace
spelling sg-ntu-dr.10356-1706712023-09-25T08:44:13Z CMSTR: a constrained minimum spanning tree based routing protocol for wireless sensor networks Lin, Deyu Lin, Zihao Kong, Linghe Guan, Yong Liang School of Electrical and Electronic Engineering Engineering::Electrical and electronic engineering Energy Efficient Shortest Hamiltonian Path How to extend the network lifetime with given limited energy budget is always one of the main concerns in Wireless Sensor Networks (WSNs). However, imbalanced energy consumption and overlong intra-cluster communication paths are prevalent in the hierarchical routing protocols, which shortens the network lifetime inevitably. To this end, an energy-efficient routing Protocol based on Constrained Minimum Spanning Tree (CMSTR) is proposed in this paper. To be specific, a new multichain routing scheme to balance the energy consumption for intra-cluster communications is presented. Based on the multichain routing scheme, the problem of establishing intra-cluster routing is transformed into a shortest Hamiltonian path problem on the basis of a graph-theoretic analysis model, which is solved through a Constrained Minimum Spanning Tree (CMST) algorithm proposed in this paper, with the aim to obtain the initial path for intra-cluster communications. In order to shorten the initial path length to obtain higher energy-efficient chain routes, a Neighbor Node Replacement (NNR) algorithm and a Link Intersection Detection and Elimination (LIDE) algorithm are proposed, in which the problem of potential long links and intersections is to be effectively alleviated. With shorter chain routes, unnecessary intra-cluster communication energy depletion can be reduced accordingly. In order to evaluate the performance of CMSTR, extensive simulation experiments are conducted. The results show that CMSTR can greatly prolong the network lifetime with regard to the metrics of FND and HND. To be specific, compared with LEACH, R-LEACH, and DCMSTR, the value of FND increased by 800%, 540% and 57%, that of HND increased by 322%, 286% and 22%, and overall network lifetime (AND) increased by 29%, 10% and 5%, respectively. Besides, CMSTR has a stable and lowest packet loss percentage (0.4%). In summary, CMSTR has excellent performance in terms of energy efficiency and network stability. This paper is supported in part by the National Natural Science Foundation of China (61962019), and in part by Natural Science Foundation of Jiangxi Province (20224BAB212016), China Scholarship Council (No. 202106825021), and Natural Science Foundation of Shaanxi Province (2020NY-175). 2023-09-25T08:44:13Z 2023-09-25T08:44:13Z 2023 Journal Article Lin, D., Lin, Z., Kong, L. & Guan, Y. L. (2023). CMSTR: a constrained minimum spanning tree based routing protocol for wireless sensor networks. Ad Hoc Networks, 146, 103160-. https://dx.doi.org/10.1016/j.adhoc.2023.103160 1570-8705 https://hdl.handle.net/10356/170671 10.1016/j.adhoc.2023.103160 2-s2.0-85153872928 146 103160 en Ad Hoc Networks © 2023 Elsevier B.V. All rights reserved.
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Engineering::Electrical and electronic engineering
Energy Efficient
Shortest Hamiltonian Path
spellingShingle Engineering::Electrical and electronic engineering
Energy Efficient
Shortest Hamiltonian Path
Lin, Deyu
Lin, Zihao
Kong, Linghe
Guan, Yong Liang
CMSTR: a constrained minimum spanning tree based routing protocol for wireless sensor networks
description How to extend the network lifetime with given limited energy budget is always one of the main concerns in Wireless Sensor Networks (WSNs). However, imbalanced energy consumption and overlong intra-cluster communication paths are prevalent in the hierarchical routing protocols, which shortens the network lifetime inevitably. To this end, an energy-efficient routing Protocol based on Constrained Minimum Spanning Tree (CMSTR) is proposed in this paper. To be specific, a new multichain routing scheme to balance the energy consumption for intra-cluster communications is presented. Based on the multichain routing scheme, the problem of establishing intra-cluster routing is transformed into a shortest Hamiltonian path problem on the basis of a graph-theoretic analysis model, which is solved through a Constrained Minimum Spanning Tree (CMST) algorithm proposed in this paper, with the aim to obtain the initial path for intra-cluster communications. In order to shorten the initial path length to obtain higher energy-efficient chain routes, a Neighbor Node Replacement (NNR) algorithm and a Link Intersection Detection and Elimination (LIDE) algorithm are proposed, in which the problem of potential long links and intersections is to be effectively alleviated. With shorter chain routes, unnecessary intra-cluster communication energy depletion can be reduced accordingly. In order to evaluate the performance of CMSTR, extensive simulation experiments are conducted. The results show that CMSTR can greatly prolong the network lifetime with regard to the metrics of FND and HND. To be specific, compared with LEACH, R-LEACH, and DCMSTR, the value of FND increased by 800%, 540% and 57%, that of HND increased by 322%, 286% and 22%, and overall network lifetime (AND) increased by 29%, 10% and 5%, respectively. Besides, CMSTR has a stable and lowest packet loss percentage (0.4%). In summary, CMSTR has excellent performance in terms of energy efficiency and network stability.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Lin, Deyu
Lin, Zihao
Kong, Linghe
Guan, Yong Liang
format Article
author Lin, Deyu
Lin, Zihao
Kong, Linghe
Guan, Yong Liang
author_sort Lin, Deyu
title CMSTR: a constrained minimum spanning tree based routing protocol for wireless sensor networks
title_short CMSTR: a constrained minimum spanning tree based routing protocol for wireless sensor networks
title_full CMSTR: a constrained minimum spanning tree based routing protocol for wireless sensor networks
title_fullStr CMSTR: a constrained minimum spanning tree based routing protocol for wireless sensor networks
title_full_unstemmed CMSTR: a constrained minimum spanning tree based routing protocol for wireless sensor networks
title_sort cmstr: a constrained minimum spanning tree based routing protocol for wireless sensor networks
publishDate 2023
url https://hdl.handle.net/10356/170671
_version_ 1779156403292733440