GIST: Group-independent spanning tree for data aggregation in dense sensor networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4026 LNCS, Issue , 2006, Pages 282-304

  Jia, Lujun ^a   Noubir, Guevara ^a   Rajaraman, Rajmohan ^a   Sundaram, Ravi ^a  

^a Northeastern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; ENERGY RESOURCES; INFORMATION DISSEMINATION; NETWORK PROTOCOLS; SENSORS;

DISTRIBUTED PROTOCOL; OPTIMAL TREE; OVERLAY CONSTRUCTION; PERFORMANCE BOUNDS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33746093331     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776178_18     Document Type: Conference Paper

References (40)

1. J. Albowicz, A. Chen, and L. Zhang. Recursive position estimation in sensor networks. In IEEE ICNP, November 2001.
2. N. Alon and Y. Azar. On-line steiner trees in euclidean plane. In Proceedings of the 8th Annual ACM Symposium on Computational Geometry, pages 337-343, 1992.
3. S. Bhattacharya, H. Kim, S. Prabh, and T. Abdelzaher. Energy-conserving data placement and asynchronous multicast in wireless sensor networks. In International Conference on Mobile Systems, Applications, and Services (MobiSys), May 2003.
4. B. Bonfils and P. Bonnet. Adaptive and decentralized operator placement for in-network query processing. In Proceedings of Information Processing in Sensor Networks, April 2003.
5. E. Brosh and Yuval Shavitt. Approximation and heuristic algorithms for minimum delay application-layer multicast trees. In INFOCOM, March 2004.
6. N. Bulusu, J. Heidemann, and D. Estrin. Gps-less low cost outdoor localization for very small devices. In IEEE Personal Communications, Special Issue on Smart Space and Environments, October 2000.
7. U. Cetintemel, A. Flinders, and Y. Sun. Power-efficient data dissemination in wireless sensor networks. In ACM MobiDE, September 2003.
8. J. Chen, L. Jia, X. Liu, G. Noubir, and R. Sundaram. Minimum energy accumulative routing in wireless networks. In In Proceedings of IEEE INFOCOM 2005, The 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005.
9. J. Chen, R. Kleinberg, L. Lovász, R. Rajaraman, R. Sundaram, and A. Vetta. (Almost) tight bounds and existence theorems for confluent flows. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pages 529-538, June 2004.
10. J. Chen, R. Rajaraman, and R. Sundaram. Meet and merge: Approximation algorithms for confluent flows. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pages 373-382, June 2003.
11. This paper has been accepted for publication in the special issue of the Journal of Computer and System Sciences (JCSS).
12. K. Chen and K. Nahrstedt. Effective location-guided tree construction algorithm for small group multicast in manet. In IEEE INFOCOM, June 2002.
13. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
14. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
15. C. Gui and P. Mohapatra. Efficient overlay multicast for mobile ad hoc networks. In IEEE WCNC, April 2003.
16. C. Gui and P. Mohapatra. Scalable multicasting in mobile ad hoc networks. In INFOCOM, March 2004.
17. P. Gupta and P. Kumar. Capacity of wireless networks. IEEE Transactions on Information Theory, IT-46:388-404, 2000.
18. J. Hellerstein, W. Hong, S. Madden, and K. Stanek. Beyond average; Towards sophisticated sensing with queries. In Intl Workshop on Information Processing in Sensor Networks (IPSN), 2003.
19. Y.T. Hou, Y. Shi, H. Sherali, and S. Midkiff. On energy provisioning and relay node placement for wireless sensor networks. IEEE Transactions on Wireless Communications, 4, 2005.
20. Q. Huang, G. Lu, and R. Gruia-Catalin. Spatiotemporal multicast in sensor networks. In SenSys, November 2003.
21. Y. Huang and H. Garcia-Molina. Publish/subscribe tree construction in wireless ad-hoc networks. In Proceedings of the 4th International Conference on Mobile Data Management, January 2003.
22. C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion; A scalable and robust communication paradigm for sensor networks. In ACM MobiCom, August 2000.
23. L. Jia, G. Lin, G. Noubir, R. Rajaraman, and R. Sundaram. Universal approximations for TSP, Steiner tree, and set cover. In Proceedings of the Thirty-Seventh ACM Symposium on Theory of Computing (STOC), May 2005.
24. B. Karp and H. T. Kung. GPSR; greedy perimeter stateless routing for wireless networks. In Proceedings of ACM Symposium on Mobile Computing and Networking, pages 243-254, August 2000.
25. H. Kim, T. Abdelzaher, and W. Kwon. Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks. In ACM SenSys, November 2003.
26. S. Kim, S.H. Son, J.A. Stankovic, S. Li, and Y. Choi. Safe: A data dissemination protocol for periodic updates in sensor networks. In Workshop on Data Distribution for Real-Time Systems (DDRTS), May 2003.
27. Y.B. Ko and N.H. Vaidya, Geocasting in mobile ad hoc networks: Location-based multicast algorithms. In WMCSA, Feburary 1999.
28. B. Krishnamachari, d. Estrin, and S. Wicker. The impact of data aggregation in wireless sensor networks. In Proceedings of the 22nd International Conference on Distributed Computing Systems Worshops, July 2002.
29. B. Krishnamachari, D. Estrin, and S. Wicker. Modelling data-centric routing in wireless sensor networks. In IEEE INFOCOM, June 2002.
30. F. Kuhn, R. Wattenhofer, and A. Zollinger. Worst-case optimal and average-case efficient geometric ad-hoc routing. In ACM Mobihoc, June 2003.
31. J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris. A scalable location service for geographic ad-hoc routing. In Proceedings of the 6th ACM International Conference on Mobile Computing and Networking (MobiCom '00), pages 120-130, August 2000.
32. S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong. Tag: A tiny aggregation service for ad hoc sensor networks. In OSDI, December 2002.
33. Madhav V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, and Harry B. Hunt III. Bicriteria network design problems. In Automata, Languages and Programming, pages 487-498, 1995.
34. M. Penrose. On fk-connectivity for a geometric random graph. Random Structures and Algorithms, 15:145-164, 1999.
35. B. Sirkeci-Mergen and A. Scaglione. A continuum approach to dense wireless networks with cooperation. In INFOCOM, March 2005.
36. V. Vazirani. Approximation Algorithms. Springer-Verlag, 2003.
37. J. Xie and R. Talpade. AMRoute: Ad hoc multicast routing protocol. ACM Mobile Networks and Applications, 7, December 2002.
38. M. Yang and Z. Fei. A proactive approach to reconstructing overlay multicast trees. In INFOCOM, March 2004.
39. Y. Yao and J. Gehrke. The Cougar approach to in-network query processing in sensor networks. Sigmod Record, 31(3), September 2002.
40. F. Ye, H. Luo, J. Cheng, S. Lu, and L. Zhang. A two-tier data dissemination model for large-scale wireless sensor networks. In MOBICOM, September 2002.