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 |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2007
|
Subjects: | |
Online Access: | 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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Approximating the Spanning k-Tree Forest Problem
by: Liao, C.-S., et al.
Published: (2014) -
Practical 3D geographic routing for wireless sensor networks
by: PRATIBHA SUNDAR SUNDARAMOORTHY
Published: (2010) -
Average competitive ratios of on-line spanning trees
by: Bao, F., et al.
Published: (2016) -
Scalable parallel minimum spanning forest computation
by: Nobari, S., et al.
Published: (2013) -
OR-AHaD: An Opportunistic Routing Algorithm for Energy Harvesting WSN
by: BEHESHTIHA, Sanam Shirazi, et al.
Published: (2013)