TY - GEN
T1 - Dynamic proxy tree-based data dissemination schemes for wireless sensor networks
AU - Zhang, Wensheng
AU - Cao, Guohong
AU - La Porta, Thomas F.
PY - 2004/12/1
Y1 - 2004/12/1
N2 - In wireless sensor networks, efficiently disseminating data from a dynamic source to multiple mobile sinks is important for applications such as mobile target detection and tracking. The tree-based multicasting scheme can be used. However, due to the short communication range of each sensor node and the frequent movement of sources and sinks, a sink may fail to receive data due to broken paths, and the tree should be frequently reconfigured to reconnect sources and sinks. To address the problem, we propose a dynamic proxy tree-based framework in this paper. A big challenge in implementing the framework is how to efficiently reconfigure the proxy tree as sources and sinks change. We model the problem as on-line constructing a minimum Steiner tree in an Euclidean plane, and propose centralized schemes to solve it. Considering the strict energy constraints in wireless sensor networks, we further propose two distributed on-line schemes, a shortest path-based (SP) scheme and a spanning range-based (SR) scheme. Extensive simulations are conducted to evaluate the schemes. The results show that the distributed schemes have similar performance as the centralized ones, and among the distributed schemes, SR outperforms SP.
AB - In wireless sensor networks, efficiently disseminating data from a dynamic source to multiple mobile sinks is important for applications such as mobile target detection and tracking. The tree-based multicasting scheme can be used. However, due to the short communication range of each sensor node and the frequent movement of sources and sinks, a sink may fail to receive data due to broken paths, and the tree should be frequently reconfigured to reconnect sources and sinks. To address the problem, we propose a dynamic proxy tree-based framework in this paper. A big challenge in implementing the framework is how to efficiently reconfigure the proxy tree as sources and sinks change. We model the problem as on-line constructing a minimum Steiner tree in an Euclidean plane, and propose centralized schemes to solve it. Considering the strict energy constraints in wireless sensor networks, we further propose two distributed on-line schemes, a shortest path-based (SP) scheme and a spanning range-based (SR) scheme. Extensive simulations are conducted to evaluate the schemes. The results show that the distributed schemes have similar performance as the centralized ones, and among the distributed schemes, SR outperforms SP.
UR - http://www.scopus.com/inward/record.url?scp=20344404194&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=20344404194&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:20344404194
SN - 0780388151
SN - 9780780388154
T3 - 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
SP - 21
EP - 30
BT - 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
T2 - 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
Y2 - 25 October 2004 through 27 October 2004
ER -