This Article 
 Bibliographic References 
 Add to: 
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks
January 2007 (vol. 6 no. 1)
pp. 2-11
Energy-constrained sensor networks have been deployed widely for monitoring and surveillance purposes. Data gathering in such networks is often a prevalent operation. Since sensors have significant power constraints (battery life), energy efficient methods must be employed for data gathering to prolong network lifetime. We consider an online data gathering problem in sensor networks, which is stated as follows: Assume that there is a sequence of data gathering queries, which arrive one by one. To respond to each query as it arrives, the system builds a routing tree for it. Within the tree, the volume of the data transmitted by each internal node depends on not only the volume of sensed data by the node itself, but also the volume of data received from its children. The objective is to maximize the network lifetime without any knowledge of future query arrivals and generation rates. In other words, the objective is to maximize the number of data gathering queries answered until the first node in the network fails. For the problem of concern, in this paper, we first present a generic cost model of energy consumption for data gathering queries if a routing tree is used for the query evaluation. We then show the problem to be NP-complete and propose several heuristic algorithms for it. We finally conduct experiments by simulation to evaluate the performance of the proposed algorithms in terms of network lifetime delivered. The experimental results show that, among the proposed algorithms, one algorithm that takes into account both the residual energy and the volume of data at each sensor node significantly outperforms the others.

[1] J. Aspnes, Y. Azar, A. Fait, S. Plotkin, and O. Warrts, “On-Line Routing of Virtual Circuits with Applications to Load Balancing and Machine Scheduling,” J. ACM, vol. 44, pp. 486-504, 1997.
[2] M. Cagalj, J.-P. Hubaux, and C. Enz, “Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues,” Proc. ACM MobiCom '02, 2002.
[3] J.-H. Chang and L. Tassiulas, “Energy Conserving Routing in Wireless Ad Hoc Networks,” Proc. INFOCOM '00, 2000.
[4] J.-H. Chang and L. Tassiulas, “Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad Hoc Networks,” Proc. Int'l Federation for Information Processing TC6/European Commission Int'l Conf., pp. 702-713, 2000.
[5] R. Cristescu, B. Beferull-Lonzano, and M. Vetterli, “On Network Correlated Data Gathering,” Proc. INFOCOM '04, 2004.
[6] H.N. Gabow, Z. Galil, T. Sencer, and R.E. Tarjan, “Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs,” Combinatorica, vol. 6, pp. 109-122, 1986.
[7] A. Goel and D. Estrin, “Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk,” Proc. ACM/SIAM Symp. Discrete Algorithms, pp. 499-505, 2003.
[8] R. Govindan, J.M. Hellerstein, W. Hong, S. Madden, M. Franklin, and S. Shenker, “The Sensor Network as a Database,” Technical Report 02-771, Computer Science Dept., Univ. of Southern California, Sept. 2002.
[9] W.R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Microsensor Networks,” Proc. IEEE Hawaii Int'l Conf. System Sciences, 2000.
[10] C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann, “Impact of Network Density on Data Aggregation in Wireless Sensor Networking,” Proc. 22nd IEEE Int'l Conf. Distributed Computing Systems, pp. 457-458, 2002.
[11] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, “Directed Diffusion for Wireless Sensor Networking,” IEEE/ACM Trans. Networking, vol. 11, pp. 2-16, 2003.
[12] K. Kalpakis, K. Dasgupta, and P. Namjoshi, “Efficient Algorithms for Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks,” Computer Networks, vol. 42, pp. 697-716, 2003.
[13] I. Kang and R. Poovendran, “Maximizing Static Network Lifetime of Wireless Broadcast Ad Hoc Networks,” Proc. IEEE Int'l Conf. Comm. (ICC '03), 2003.
[14] K. Kar, M. Kodialam, T.V. Lakshman, and L. Tassiulas, “Routing for Network Capacity Maximization in Energy-Constrained Ad-Hoc Networks,” Proc. INFOCOM '03, 2003.
[15] S. Khuller, B. Raghavachar, N. Young, “Balancing Minimum Spanning and Shortest Path Trees,” Proc. Fourth ACM-SIAM Symp. Discrete Math., 1993.
[16] W. Liang, “Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks,” Proc. MobiHoc '02, 2002.
[17] S. Lindsey and C.S. Raghavendra, “PEGASIS: Power-Efficient Gathering in Sensor Information Systems,” Proc. IEEE Aerospace Conf., pp. 1125-1130, 2002.
[18] S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, “TAG: A Tiny Aggregation Service for Ad Hoc Sensor Networks,” ACM SIGOPS Operating Systems Rev., vol. 36, pp. 131-146, 2002.
[19] S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, “The Design of an Acquisitional Query Processor for Sensor Networks,” Proc. ACM SIGMOD '03, pp. 491-502, 2003.
[20] S. Madden, R. Szewczyk, M.J. Franklin, and D. Culler, “Supporting Aggregate Queries over Ad Hoc Wireless Sensor Networks,” Proc. Fourth IEEE Workshop Mobile Computing and System Applications, 2002.
[21] P. von Richenbach and R. Wattenhofer, “Gathering Correlated Data in Sensor Networks,” Proc. Second ACM DIALM-POMC Joint Workshop Foundations of Mobile Computing, Oct. 2004.
[22] A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, and J. Anderson, “Wireless Sensor Networks for Habitat Monitoring,” Proc. First ACM Int'l Workshop Wireless Sensor Networks and Applications, pp. 88-97, 2002.
[23] M.A. Sharaf, J. Beaver, A. Labrinidis, and P.K. Chrysanthis, “Balancing Energy Efficiency and Quality of Aggregate Data in Sensor Networks,” J. Very Large Data Bases, 2004.
[24] A. Singh, M. Woo, and C.S. Raghavendra, “Power-Aware Routing in Mobile Ad Hoc Networks,” Proc. MobiCom '98, pp.181-190, 1998.
[25] H.Ö. Tan and İ. Körpeogˇlu, “Power Efficient Data Gathering and Aggregation in Wireless Sensor Networks,” ACM SIGMOD Record, vol. 32, pp. 66-71, 2003.
[26] D.B. Terry, D. Goldberg, D. Nichols, and B.M. Oki, “Continuous Queries over Append-Only Databases,” Proc. ACM SIGMOD '02, 2002.
[27] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks,” Proc. INFOCOM '00, 2000.
[28] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “Resource Management in Energy-Limited, Bandwidth-Limited, Transceiver-Limited Wireless Networks for Session-Based Multicasting,” Computer Networks, vol. 39, pp. 113-131, 2002.
[29] Y. Yao and J. Gehrke, “The Cougar Approach to In-Network Query Processing in Sensor Networks,” ACM SIGMOD Record, vol. 31, pp. 9-18, 2002.

Index Terms:
Sensor network, data gathering, energy consumption optimization, network lifetime, sensor database, sensornet query optimization.
Weifa Liang, Yuzhen Liu, "Online Data Gathering for Maximizing Network Lifetime in Sensor Networks," IEEE Transactions on Mobile Computing, vol. 6, no. 1, pp. 2-11, Jan. 2007, doi:10.1109/TMC.2007.10
Usage of this product signifies your acceptance of the Terms of Use.