The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2012 vol.23)
pp: 701-712
Shibo He , Zhejiang University, Hangzhou and University of Waterloo, Waterloo
Jiming Chen , Zhejiang University, Hangzhou
Xu Li , INRIA Lille - Nord Europe, Villeneuve d'Ascq
Xuemin (Sherman) Shen , University of Waterloo, Waterloo
Youxian Sun , Zhejiang University, Hangzhou
ABSTRACT
As sensors are energy constrained devices, one challenge in wireless sensor networks (WSNs) is to guarantee coverage and meanwhile maximize network lifetime. In this paper, we leverage prediction to solve this challenging problem, by exploiting temporal-spatial correlations among sensory data. The basic idea lies in that a sensor node can be turned off safely when its sensory information can be inferred through some prediction methods, like Bayesian inference. We adopt the concept of entropy in information theory to evaluate the information uncertainty about the region of interest (RoI). We formulate the problem as a minimum weight submodular set cover problem, which is known to be NP hard. To address this problem, an efficient centralized truncated greedy algorithm (TGA) is proposed. We prove the performance guarantee of TGA in terms of the ratio of aggregate weight obtained by TGA to that by the optimal algorithm. Considering the decentralization nature of WSNs, we further present a distributed version of TGA, denoted as DTGA, which can obtain the same solution as TGA. The implementation issues such as network connectivity and communication cost are extensively discussed. We perform real data experiments as well as simulations to demonstrate the advantage of DTGA over the only existing competing algorithm [1] and the impacts of different parameters associated with data correlations on the network lifetime.
INDEX TERMS
Prediction, temporal-spatial correlations, coverage, network lifetime, wireless sensor networks.
CITATION
Shibo He, Jiming Chen, Xu Li, Xuemin (Sherman) Shen, Youxian Sun, "Leveraging Prediction to Improve the Coverage of Wireless Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 4, pp. 701-712, April 2012, doi:10.1109/TPDS.2011.180
REFERENCES
[1] H. Gupta, V. Navda, S.D. Das, and V. Chowdhary, "Efficient Gathering of Correlated Data in Sensor Networks," Proc. ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), 2005.
[2] H. Zhang and J. Hou, "Maintaining Sensing Coverage and Connectivity in Large Sensor Networks," Ad hoc and Sensor Wireless Networks, vol. 1, nos. 1/2, pp. 89-124, 2005.
[3] G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill, "Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks," ACM Trans. Sensor Networks, vol. 1, no. 1, pp. 36-72, 2005.
[4] J. Chen, W. Xu, S. He, Y. Sun, P. Thulasiramanz, and X. Shen, "Utility-Based Asynchronous Flow Control Algorithm for Wireless Sensor Networks," IEEE J. Selected Areas in Comm., vol. 28, no. 7, pp. 1116-1126, Sept. 2010.
[5] R. Lu, X. Lin, H. Zhu, X. Liang, and X. Shen, "Becan: A Bandwidth-Efficient Cooperative Authentication Scheme for Filtering Injected False Data in Wireless Sensor Networks," IEEE Trans. Parallel and Distributed Systems, To Appear.
[6] H. Tan, I. Korpeoglu, and I. Stojmenovic, "Computing Localized Power Efficient Data Aggregation Trees for Sensor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 3, pp. 489-500, Mar. 2011.
[7] X. Li, H. Frey, N. Santoro, and I. Stojmenovic, "Strictly Localized Sensor Self-Deployment for Optimal Focused Coverage," IEEE Trans. Mobile Computing, To Appear, 2011.
[8] P. Balister, Z. Zheng, S. Kumar, and P. Sinha, "Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless SensorNetworks ," Proc. IEEE INFOCOM, 2009.
[9] S. He, J. Chen, D.K.Y. Yau, H. Shao, and Y. Sun, "Energy-Efficient Capture of Stochastic Events by Global- and Local-Periodic Network Coverage," Proc. the Sixth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), 2009.
[10] N.A. Cressie, Statistics for Spatial Data. Wiley, 1991.
[11] A. Krause and C. Guestrin, A Note on the Budgeted Maximization on Submodular Functions, Technical Report. Carnegie Mellon Univ. 2005.
[12] L. Wolsey, "An Analysis of the Greedy Algorithm for the Submodular Set Covering Problem," Combinatorica, vol. 2, no. 4, pp. 385-393, 1981.
[13] C. Rasmussen and C. Williams, Gaussian Processes for Machine Learning. Massachusetts Inst. of Technology Press, 2006.
[14] C. Williams, "Prediction with Gaussian Processes: From Linear Regression to Linear Prediction and Beyond," Technical Report NCRG/97/012, 1997.
[15] Nat'l Climatic Data Center, www.ncdc.noaa.gov/cgi-bin res40.pl?page=gsod.html , 2011.
[16] A. Gallais, J. Carle, D. Simplot-Ryl, and I. Stojmenovic, "Localized Sensor Area Coverage with Low Communication Overhead," IEEE Trans. Mobile Computing, vol. 7, no. 5, pp. 661-672, May 2008.
[17] R. Kershner, "The Number of Circles Covering a Set," Am. J. Math., vol. 61, pp. 665-671, 1939.
[18] X. Bai, C. Zhang, and D. Xuan, "Deploying Wireless Sensors to Achieve both Coverage and Connectivity," Proc. ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), 2006.
[19] X. Bai, Z. Yun, D. Xuan, T. Lai, and W. Jia, "Deploying Four-Connectivity and Full-Coverage Wireless SensorNetworks ," Proc. IEEE INFOCOM, 2008.
[20] D. Tian and N. Georganas, "A Coverage Preserving Node Scheduling Scheme for Large Wireless SensorNetworks," Proc. Int'l Workshop Wireless Sensor Networks and Applications, 2002.
[21] T. Dam and K. Langendoen, "An Adaptive Energy-Efficient Mac Protocol for Wireless Sensor Networks," Proc. Int'l Conf. Embedded Networked Sensor Systems (SenSys), 2003.
[22] S. Yang, F. Dai, M. Cardei, J. Wu, and F. Patterson, "On Connected Multiple Point Coverage in Wireless Sensor Networks," Int'l J. Wireless Information Networks, vol. 13, no. 4, pp. 289-301, 2006.
[23] A. Keshavarzian, H. Lee, and L. Venkatraman, "Wakeup Scheduling in Wireless SensorNetworks," Proc. Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), 2006.
[24] C. Hsin and M. Liu, "Network Coverage Using Low Duty-Cycled Sensors: Random and Coordinated Sleep Algorithms," Proc. the Int'l Symp. Information Processing in Sensor Networks (IPSN), 2004.
[25] B. Wang, K. Chua, V. Srinivasan, and W. Wang, "Information Coverage in Randomly Deployed Wireless Sensor Networks," IEEE Trans. Wireless Comm., vol. 6, no. 8, pp. 2994-3004, Aug. 2007.
[26] G. Yang and D. Qiao, "Barrier Information Coverage with Wireless Sensors," Proc. IEEE INFOCOM, 2009.
[27] G. Xing, R. Tan, B. Liu, J. Wang, and C. Yi, "Data Fusion Improves the Coverage of Wireless Sensor Networks," Proc. MobiCom, 2009.
[28] R. Ghrist and A. Muhammad, "Coverage and Hole-Detection in Sensor Networks via Homology," Proc. the Int'l Symp. Information Processing in Sensor Networks (IPSN), 2005.
[29] K. Yedavalli and B. Krishnamachari, "Sequence-Based Localization in Wireless Sensor Networks," IEEE Trans. Mobile Computing, vol. 7, no. 1, pp. 1-14, Jan. 2008.
[30] G. Kasbekar, Y. Bejerano, and S. Sarkar, "Lifetime and Coverage Guarantees through Distributed Coordinate-Free Sensor Activation," Proc. MobiCom, 2009.
[31] R. Garnett, M. Osborne, and S. Roberts, "Bayesian Optimization for Sensor Set Selection," Proc. the Int'l Symp. Information Processing in Sensor Networks (IPSN), 2010.
[32] S. Ganeriwal, R. Kumar, and M.B. Srivastava, "Timing-Sync Protocol for SensorNetworks," Proc. Int'l Conf. Embedded Networked Sensor Systems (SenSys), 2003.
[33] H. Takahashi and A. Matsuyama, "An Approximate Solution for the Steiner Problem in Graphs," Math. Japonica, vol. 24, no. 6, pp. 573-577, 1980.
[34] http:/www.gaussianprocess.org, 2011.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool