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...
Saved in:
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 |
Similar Items
-
Effective indexing for approximate constrained shortest path queries on large road networks
by: Wang, Sibo, et al.
Published: (2017) -
Efficient navigation for constrained shortest path with adaptive expansion control
by: XIA, Wenwen, et al.
Published: (2022) -
Multicast routing in WDM networks
by: LAHLOU KITANE DRISS
Published: (2010) -
A chance-constrained programming of fourth-party logistics routing problem with fuzzy duration time
by: Cui, Y., et al.
Published: (2014) -
Quantum theory for a time-dependent harmonic oscillator
by: Surarit Pepore
Published: (2023)