Abstract
Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions of optimal, i.e. under different cost metrics). However, all these schemes differ from one common failing – they construct an optimal tree for a given fixed subset of the sensors. In most practical scenarios, the sensor group is continuously and dynamically varying – consider for example the set of sensors scattered in a forest that are sensing temperatures above some specified threshold, during a wildfire. Given the limited computational and energy resources of sensor nodes it is impossible to either prestore the optimal tree for every conceivable group or to dynamically generate them on the fly.
In this paper we propose the novel approach of constructing a single group-independent spanning tree (GIST) T for the network and then letting any sensor group S use the subtree induced by S on T, T S as its group aggregation tree. The important question is, how does the quality of the subtree T S compare to the optimal tree, OPT S , across different groups S. We consider two well-accepted measures – aggregation cost (sum over all links) and delay (diameter). We show that in polynomial time we can construct a GIST that simultaneously achieves O(log n)-approximate aggregation cost and O(1)-approximate delay, for all groups S.
To the best of our knowledge GIST is the first construction with a nontrivial and provable performance guarantee that works for all groups. We provide a practical and distributed protocol for realizing GIST that requires only local knowledge. We show an Ω(n) lower bound for commonly accepted solutions such as MST and SPT (i.e. there exists a group for which the induced subtree performs poorly) and demonstrate by simulation that GIST is good not just in the worst case – it outperforms SPT and MST by between 30 and 60 per cent in realistic random scenarios. GIST is an overlay construction and for the special case of grids we present GRID-GIST, a physical tree that uses only grid edges and achieves the same performance bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albowicz, J., Chen, A., Zhang, L.: Recursive position estimation in sensor networks. In: IEEE ICNP (November 2001)
Alon, N., Azar, Y.: On-line steiner trees in euclidean plane. In: Proceedings of the 8th Annual ACM Symposium on Computational Geometry, pp. 337–343 (1992)
Bhattacharya, S., Kim, H., Prabh, S., Abdelzaher, T.: Energy-conserving data placement and asynchronous multicast in wireless sensor networks. In: International Conference on Mobile Systems, Applications, and Services (MobiSys) (May 2003)
Bonfils, B., Bonnet, P.: Adaptive and decentralized operator placement for in-network query processing. In: Proceedings of Information Processing in Sensor Networks (April 2003)
Brosh, E., Shavitt, Y.: Approximation and heuristic algorithms for minimum delay application-layer multicast trees. In: INFOCOM (March 2004)
Bulusu, N., Heidemann, J., Estrin, D.: Gps-less low cost outdoor localization for very small devices. In: IEEE Personal Communications (October 2000) (Special Issue on Smart Space and Environments)
Cetintemel, U., Flinders, A., Sun, Y.: Power-efficient data dissemination in wireless sensor networks. In: ACM MobiDE (September 2003)
Chen, J., Jia, L., Liu, X., Noubir, G., Sundaram, R.: 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)
Chen, J., Kleinberg, R., Lovász, L., Rajaraman, R., Sundaram, R., Vetta, A. (Almost) tight bounds and existence theorems for confluent flows. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), June 2004, pp. 529–538 (2004)
Chen, J., Rajaraman, R., Sundaram, R.: Meet and merge: Approximation algorithms for confluent flows. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), June 2003, pp. 373–382 (2003) (This paper has been accepted for publication in the special issue of the Journal of Computer and System Sciences (JCSS))
Chen, K., Nahrstedt, K.: Effective location-guided tree construction algorithm for small group multicast in manet. In: IEEE INFOCOM (June 2002)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge, MA (1990)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Gui, C., Mohapatra, P.: Efficient overlay multicast for mobile ad hoc networks. In: IEEE WCNC (April 2003)
Gui, C., Mohapatra, P.: Scalable multicasting in mobile ad hoc networks. In: INFOCOM (March 2004)
Gupta, P., Kumar, P.: Capacity of wireless networks. IEEE Transactions on Information Theory IT-46, 388–404 (2000)
Hellerstein, J., Hong, W., Madden, S., Stanek, K.: Beyond average: Towards sophisticated sensing with queries. In: Intl Workshop on Information Processing in Sensor Networks (IPSN) (2003)
Hou, Y.T., Shi, Y., Sherali, H., Midkiff, S.: On energy provisioning and relay node placement for wireless sensor networks. IEEE Transactions on Wireless Communications 4 (2005)
Huang, Q., Lu, C., Gruia-Catalin, R.: Spatiotemporal multicast in sensor networks. In: SenSys (November 2003)
Huang, Y., Garcia-Molina, H.: Publish/subscribe tree construction in wireless ad-hoc networks. In: Proceedings of the 4th International Conference on Mobile Data Management (January 2003)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: A scalable and robust communication paradigm for sensor networks. In: ACM MobiCom (August 2000)
Jia, L., Lin, G., Noubir, G., Rajaraman, R., Sundaram, R.: Universal approximations for TSP, Steiner tree, and set cover. In: Proceedings of the Thirty-Seventh ACM Symposium on Theory of Computing (STOC) (May 2005)
Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of ACM Symposium on Mobile Computing and Networking, pp. 243–254 (August 2000)
Kim, H., Abdelzaher, T., Kwon, W.: Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks. In: ACM SenSys (November 2003)
Kim, S., Son, S.H., Stankovic, J.A., Li, S., Choi, Y.: Safe: A data dissemination protocol for periodic updates in sensor networks. In: Workshop on Data Distribution for Real-Time Systems (DDRTS) (May 2003)
Ko, Y.B., Vaidya, N.H.: Geocasting in mobile ad hoc networks: Location-based multicast algorithms. In: WMCSA (Feburary 1999)
Krishnamachari, B., Estrin, d., Wicker, S.: The impact of data aggregation in wireless sensor networks. In: Proceedings of the 22nd International Conference on Distributed Computing Systems Worshops (July 2002)
Krishnamachari, B., Estrin, D., Wicker, S.: Modelling data-centric routing in wireless sensor networks. In: IEEE INFOCOM (June 2002)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: ACM Mobihoc (June 2003)
Li, J., Jannotti, J., De Couto, D., Karger, D., Morris, R.: A scalable location service for geographic ad-hoc routing. In: Proceedings of the 6th ACM International Conference on Mobile Computing and Networking (MobiCom 2000), pp. 120–130 (August 2000)
Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: Tag: A tiny aggregation service for ad hoc sensor networks. In: OSDI (December 2002)
Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Bicriteria network design problems. In: Automata, Languages and Programming, pp. 487–498 (1995)
Penrose, M.: On fk-connectivity for a geometric random graph. Random Structures and Algorithms 15, 145–164 (1999)
Sirkeci-Mergen, B., Scaglione, A.: A continuum approach to dense wireless networks with cooperation. In: INFOCOM (March 2005)
Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2003)
Xie, J., Talpade, R.: AMRoute: Ad hoc multicast routing protocol. ACM Mobile Networks and Applications 7 (December 2002)
Yang, M., Fei, Z.: A proactive approach to reconstructing overlay multicast trees. In: INFOCOM (March 2004)
Yao, Y., Gehrke, J.: The Cougar approach to in-network query processing in sensor networks. Sigmod Record 31(3) (September 2002)
Ye, F., Luo, H., Cheng, J., Lu, S., Zhang, L.: A two-tier data dissemination model for large-scale wireless sensor networks. In: MOBICOM (September 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jia, L., Noubir, G., Rajaraman, R., Sundaram, R. (2006). GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds) Distributed Computing in Sensor Systems. DCOSS 2006. Lecture Notes in Computer Science, vol 4026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11776178_18
Download citation
DOI: https://doi.org/10.1007/11776178_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35227-3
Online ISBN: 978-3-540-35228-0
eBook Packages: Computer ScienceComputer Science (R0)