Dynamic proxy tree-based data dissemination schemes for wireless sensor networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publication2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
Pages21-30
Number of pages10
StatePublished - Dec 1 2004
Event2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems - Fort Lauderdale, FL, United States
Duration: Oct 25 2004Oct 27 2004

Publication series

Name2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems

Other

Other2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
CountryUnited States
CityFort Lauderdale, FL
Period10/25/0410/27/04

Fingerprint

Target tracking
Wireless sensor networks
Multicasting
Sensor nodes
Communication

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Zhang, W., Cao, G., & La Porta, T. F. (2004). Dynamic proxy tree-based data dissemination schemes for wireless sensor networks. In 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (pp. 21-30). (2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems).
Zhang, Wensheng ; Cao, Guohong ; La Porta, Thomas F. / Dynamic proxy tree-based data dissemination schemes for wireless sensor networks. 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. 2004. pp. 21-30 (2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems).
@inproceedings{53993298e9f24ab7a6764bb34133a781,
title = "Dynamic proxy tree-based data dissemination schemes for wireless sensor networks",
abstract = "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.",
author = "Wensheng Zhang and Guohong Cao and {La Porta}, {Thomas F.}",
year = "2004",
month = "12",
day = "1",
language = "English (US)",
isbn = "0780388151",
series = "2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems",
pages = "21--30",
booktitle = "2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems",

}

Zhang, W, Cao, G & La Porta, TF 2004, Dynamic proxy tree-based data dissemination schemes for wireless sensor networks. in 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, pp. 21-30, 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, Fort Lauderdale, FL, United States, 10/25/04.

Dynamic proxy tree-based data dissemination schemes for wireless sensor networks. / Zhang, Wensheng; Cao, Guohong; La Porta, Thomas F.

2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. 2004. p. 21-30 (2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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

ER -

Zhang W, Cao G, La Porta TF. Dynamic proxy tree-based data dissemination schemes for wireless sensor networks. In 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. 2004. p. 21-30. (2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems).