Skip to main content

Advertisement

SpringerLink
Log in

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

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In wireless sensor networks, efficiently disseminating data from a dynamic source to multiple mobile sinks is important for the applications such as mobile target detection and tracking. The tree-based multicasting scheme can be used. However, because of 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, the shortest path-based (SP) scheme and the 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, the SR scheme outperforms the SP scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E.Cayirci, Wireless Sensor Networks: A Survey, Computer Networks 38(4) (March 2002).

  2. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, Energy-Efficient Communication Protocal for Wireless Microsensor network, in: Proc. of the Hawaii International Conference on System Sciences (January 2000).

  3. C. Intanagonwiwat, R. Govindan, and D. Estrin, Directed Diffusion: A Scalable and Robust Communication, MobiCOM ’00 (August 2000).

  4. F. Ye, H. Luo, J. Cheng, S. Lu, and L. Zhang, A Two-Tier Data Dissemination Model for Large-scale Wireless Sensor Networks, ACM International Conference on Mobile Computing and Networking (MOBICOM’02) (September 2002) pp. 148–159.

  5. S. RatNasamy, B. karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, GHT: A Geographic Hash Table for Data-Centric Storage, ACM International Workshop on Wireless Sensor Networks and Applications (September 2002).

  6. A. Ghose, J. Grobklags and J. Chuang, Resilient data-centric storage in wireless ad-hoc sensor networks, in: Proceedings the 4th International Conference on Mobile Data Management (MDM’03) (2003) pp. 45–62.

  7. B. Greenstein, D. Estrin, R. Govindan, S. Ratnasamy and S. Shenker, DIFS: A Distributed Index for Features in Sensor Networks, First IEEE Ineternational Workshop on Sensor Network Protocols and Applications (May 2003).

  8. W. Zhang, G. Cao, and T. La Porta, Data Dissemination with Ring-Based Index for Sensor Networks, IEEE International Conference on Network Protocol (ICNP) (November 2003).

  9. F. Bauer and A. Varma, ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm, IEEE Journal of Selected Areas in Communications 15(3) (1997) 382–397.

    Article  Google Scholar 

  10. S. Lee, W. Su, and M. Gerla, On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks, IEEE ICNP’98 (1998).

  11. M. Liu, R. Talpade, A. Mcauley, and E. Bommaiah, Ad Hoc Multicast Routing Protocol (AMroute), UMD TechReport 99-8 (1999).

  12. H. Laboid and H. Moustafa, Source Routing-based Multicast Protocol (SRMP), Internet Draft (2001).

  13. N. Alon and Y. Azar, On-line Steiner Trees in the Euclidean Plane, (2000).

  14. US Naval Observatory (USNO) GPS Operations (April 2001). http://tycho.usno.navy.mil/gps.html.

  15. N. Bulusu, J. Heidemann, and D. Estrin, GPS-less Low Cost Outdoor Location For Very Small Devices, IEEE Personal Communication, Special Issue on “Smart Space and Environments" (October 2000).

  16. B. Karp and H. Kung, GPSR: Greedy Perimeter Stateless Routing for Wireless Networks, The Sixth Aunual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom 2000) (August 2000).

  17. M. Chu, H. Haussecker and F. Zhao, Scalable Information-driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks, International Journal of High Performance Computing Applications (2002).

  18. W. Zhang and G. Cao, Optimizing Tree Reconfiguration for Mobile Target Tracking in Sensor Networks, IEEE Infocom’04 (March 2004).

  19. A. Ivanov and A. Tuzhilin, Minimal Networks (CRC Press, Inc., 1994).

  20. F. Hwang, D. Richards, and R. Winter, The Steiner Tree Problem, Annals of Discrete Mathematics 53. Elsevier Science Publishers (1992).

  21. J. Smith, D. Lee, and J. Liebman, An O(nlogn) Heuristic for Steiner Minimal Tree Problems on the Euclidean Metric, Networks 11 (1981) 12–29.

  22. T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms (The MIT Press, 1990) pp. 514–543.

  23. E. Thompson, The Method of Minimum Evolution, Annals of Human Genetics 36 (1973) 333–340.

    Google Scholar 

  24. S. Chang, The Generation of Minimal Trees with a Steiner Topology, J. Assoc. Comput. Mach. 19.

  25. F. Hwang, A Linear Time Algorithm for Full Steinter Trees, Operations Research Letters 4(5) (1986) 235–237.

    Article  MATH  Google Scholar 

  26. B. Waxman, Routing of Multipoint Connections, IEEE Journal on Selected Areas in Communications 40(9) (Dec. 1988) 45– 72.

  27. M. Imase and B. Waxman, Dynamic Steinter Tree Problem, SIAM J. Disc. Math. 4(3) (Aug. 1991) 369–384.

    Article  MATH  Google Scholar 

  28. J. Kadirire, Comparison of Dynamic Multicast Routing Algorithms for Wide-Area Packet Switched (Asynchronous Transfer Mode) Networks, IEEE INFOCOM (April 1995) 212–219.

  29. Q. Huang, C. Lu, and G. Roman, Spatiotemporal Multicast in Sensor Networks, ACM Conference on Embedded Networked Sensor Systems (Sensys’03) (Nov. 2003).

  30. S. Bhattacharya, H. Kim, S. Prabh and T. Abdelzaher, Energy-Conserving Data Placement and Asynchronous Multicast in Wireless Sensor Networks, ACM Mobisys’03 (2003).

  31. H. Kim, T. Abdelzaher, and W. Kwon, Minimum-Energy Asynchronous Dissemination to Mobile Sinks in Wireless Sensor Networks, ACM Conference on Embedded Networked Sensor Systems (Sensys’03) (Nov. 2003).

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Iowa State University, Ames, IA, 50011

    Wensheng Zhang

  2. Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, 16802

    Guohong Cao & Tom La Porta

Authors
  1. Wensheng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guohong Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tom La Porta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wensheng Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, W., Cao, G. & La Porta, T. Dynamic proxy tree-based data dissemination schemes for wireless sensor networks. Wireless Netw 13, 583–595 (2007). https://doi.org/10.1007/s11276-006-6254-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-6254-6

Keywords

Search

Navigation