Abstract
Reducing energy consumption and prolonging lifetime of network to reduce the amount of packet loss are important issues in wireless sensor networks. Many researches derive the minimum hop path for each sensor to transmit its corresponding data to the sink. The sensors in the path forward the data. However, some common sensors in many forwarding paths will consume much more energy, and then they will die soon. Besides, the establishment and maintenance of the above routing need the whole information of the network, and this will consume more energy in gathering and synchronizing the locations of all sensors. In this paper, each sensor using the information of neighboring sensors derives the minimum hop path to the sink, and with the knowledge of the loading of its up-streaming sensors, it selects the minimum loaded sensor for its first sensor to transmit to. In this way, the loading of each sensor will be balanced. The above routing derives minimum balanced tree (MBT). This data structure will be adjusted locally while some sensors change their statuses in the network such that the control overhead needed to adjust is much less than to reconstruct all over again. Some results of simulated experimentations are shown in this paper.
| Original language | English |
|---|---|
| Pages | 503-510 |
| Number of pages | 8 |
| DOIs | |
| Publication status | Published - 2009 Dec 1 |
| Event | 5th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2009 - Fujian Province, China Duration: 2009 Dec 14 → 2009 Dec 16 |
Other
| Other | 5th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2009 |
|---|---|
| Country | China |
| City | Fujian Province |
| Period | 09-12-14 → 09-12-16 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
Cite this
}
Localized routing protocols based on minimum balanced tree in wireless sensor networks. / Huang, Chiming; Cheng, Rei Heng; Wu, Tung-Kuang; Chen, Shau Ruei.
2009. 503-510 Paper presented at 5th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2009, Fujian Province, China.Research output: Contribution to conference › Paper
TY - CONF
T1 - Localized routing protocols based on minimum balanced tree in wireless sensor networks
AU - Huang, Chiming
AU - Cheng, Rei Heng
AU - Wu, Tung-Kuang
AU - Chen, Shau Ruei
PY - 2009/12/1
Y1 - 2009/12/1
N2 - Reducing energy consumption and prolonging lifetime of network to reduce the amount of packet loss are important issues in wireless sensor networks. Many researches derive the minimum hop path for each sensor to transmit its corresponding data to the sink. The sensors in the path forward the data. However, some common sensors in many forwarding paths will consume much more energy, and then they will die soon. Besides, the establishment and maintenance of the above routing need the whole information of the network, and this will consume more energy in gathering and synchronizing the locations of all sensors. In this paper, each sensor using the information of neighboring sensors derives the minimum hop path to the sink, and with the knowledge of the loading of its up-streaming sensors, it selects the minimum loaded sensor for its first sensor to transmit to. In this way, the loading of each sensor will be balanced. The above routing derives minimum balanced tree (MBT). This data structure will be adjusted locally while some sensors change their statuses in the network such that the control overhead needed to adjust is much less than to reconstruct all over again. Some results of simulated experimentations are shown in this paper.
AB - Reducing energy consumption and prolonging lifetime of network to reduce the amount of packet loss are important issues in wireless sensor networks. Many researches derive the minimum hop path for each sensor to transmit its corresponding data to the sink. The sensors in the path forward the data. However, some common sensors in many forwarding paths will consume much more energy, and then they will die soon. Besides, the establishment and maintenance of the above routing need the whole information of the network, and this will consume more energy in gathering and synchronizing the locations of all sensors. In this paper, each sensor using the information of neighboring sensors derives the minimum hop path to the sink, and with the knowledge of the loading of its up-streaming sensors, it selects the minimum loaded sensor for its first sensor to transmit to. In this way, the loading of each sensor will be balanced. The above routing derives minimum balanced tree (MBT). This data structure will be adjusted locally while some sensors change their statuses in the network such that the control overhead needed to adjust is much less than to reconstruct all over again. Some results of simulated experimentations are shown in this paper.
UR - http://www.scopus.com/inward/record.url?scp=77949931546&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77949931546&partnerID=8YFLogxK
U2 - 10.1109/MSN.2009.55
DO - 10.1109/MSN.2009.55
M3 - Paper
AN - SCOPUS:77949931546
SP - 503
EP - 510
ER -