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

Wireless Networks

Volumn 13, Issue 5, 2007, Pages 583-595

  Zhang, Wensheng ^a   Cao, Guohong ^b   La Porta, Tom ^b  

^a Iowa State University   (United States)

^b The Pennsylvania State University   (United States)

Author keywords

Data dissemination; Wireless sensor networks

Indexed keywords

DATA DISSEMINATION; DYNAMIC PROXY; EUCLIDEAN PLANE; STEINER TREE;

COMPUTER SIMULATION; DATA ACQUISITION; INFORMATION DISSEMINATION; MULTICASTING;

WIRELESS SENSOR NETWORKS;

EID: 34547535426     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-006-6254-6     Document Type: Article

References (31)

1. I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E.Cayirci, Wire-less 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 International 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.
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 Annual 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.
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.
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.
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).