Study of the minimum spanning hyper-tree routing algorithm in wireless sensor networks
Designing energy-efficient routing protocols to effectively increase the networks' lifetime and provide the robust network service is one of the important problems in the research of wireless sensor networks. Using the hyper-graph theory, the paper represents large-scale wireless sensor network...
Saved in:
Main Authors: | YANG, Ting, SUN, Yugeng, WANG, Zhaoxia, ZHANG, Juwei, DING, Yingqiang |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2007
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/6695 https://ink.library.smu.edu.sg/context/sis_research/article/7698/viewcontent/2007C_Study_of_the_Minimum_Spanning_Hyper_Tree_Routing_Algorithm_in_Wireless_Sensor_Networks.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Singapore Management University |
語言: | English |
相似書籍
-
Approximating the Spanning k-Tree Forest Problem
由: Liao, C.-S., et al.
出版: (2014) -
Practical 3D geographic routing for wireless sensor networks
由: PRATIBHA SUNDAR SUNDARAMOORTHY
出版: (2010) -
Average competitive ratios of on-line spanning trees
由: Bao, F., et al.
出版: (2016) -
OR-AHaD: An Opportunistic Routing Algorithm for Energy Harvesting WSN
由: BEHESHTIHA, Sanam Shirazi, et al.
出版: (2013) -
Ad hoc routing and time synchronization protocol for data collection on wireless sensor networks
由: Co, Kimberly Jane Y.
出版: (2021)