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...
Main Authors: | Lin, Deyu, Lin, Zihao, Kong, Linghe, Guan, Yong Liang |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/170671 |
Similar Items
-
Effective indexing for approximate constrained shortest path queries on large road networks
by: Wang, Sibo, et al.
Published: (2017) -
Efficient Minimization of Routing Cost in Wireless Networks
by: Anas Ali Hussien, et al.
Published: (2013-06-01) -
On the Empirical Evaluation of Multicasting with Minimum Delay Variation
by: Nicklaus Rhodes, et al.
Published: (2016-01-01) -
Problems on Shortest k-Node Cycles and Paths
by: Petro Stetsyuk, et al.
Published: (2021-09-01) -
Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and Prospects
by: Juarez Machado da Silva, et al.
Published: (2023-03-01)