Composite event coverage in wireless sensor networks with heterogeneous sensors

Event monitoring is a popular task carried out by Wireless Sensor Networks (WSNs). A composite event involves multiple properties requiring different types of sensors to monitor. Considering the costs of different deployment of heterogeneous sensors and the total budget for a monitored region, this paper investigates the composite event coverage problem with the purpose of optimizing coverage quality subjecting to the constraint of not exceeding the total budget. This is a novel coverage problem which is different from the traditional ones where deployment costs of sensors, total budget and composite events are not considered. Two exact algorithms are proposed whose time complexities are O(nk) and O(nk-1) respectively in the worst case, and a (1 - e-1)-approximate algorithm are designed. The simulation results indicate the efficiency and effectiveness of the proposed algorithms.

[1]  Jing Gao,et al.  Model-Based Approximate Event Detection in Heterogeneous Wireless Sensor Networks , 2014, WASA.

[2]  Maxim Sviridenko,et al.  A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..

[3]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[4]  Jianzhong Li,et al.  Approximate Physical World Reconstruction Algorithms in Sensor Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[5]  Jianzhong Li,et al.  Drawing dominant dataset from big sensory data in wireless sensor networks , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[6]  Dong Xuan,et al.  Notice of Violation of IEEE Publication PrinciplesOptimal multiple-coverage of sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[7]  Ai Chen,et al.  Local Barrier Coverage in Wireless Sensor Networks , 2010, IEEE Transactions on Mobile Computing.

[8]  Yingshu Li,et al.  Distributed Energy-Efficient Algorithms for Coverage Problem in Adjustable Sensing Ranges Wireless Sensor Networks , 2009, Discret. Math. Algorithms Appl..

[9]  Mihaela Cardei,et al.  Coverage for composite event detection in wireless sensor networks , 2011, Wirel. Commun. Mob. Comput..

[10]  Sandeep Mann,et al.  Coverage in Wireless Sensor Networks : A Survey , 2013 .

[11]  2015 IEEE Conference on Computer Communications, INFOCOM 2015, Kowloon, Hong Kong, April 26 - May 1, 2015 , 2015, IEEE Conference on Computer Communications.

[12]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[13]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  Shan Gao,et al.  Sensor Scheduling for k-Coverage in Wireless Sensor Networks , 2006, MSN.

[15]  Jianzhong Li,et al.  Curve Query Processing in Wireless Sensor Networks , 2015, IEEE Transactions on Vehicular Technology.

[16]  Radha Poovendran,et al.  Coverage In Heterogeneous Sensor Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[17]  Raheem A. Beyah,et al.  Sensor scheduling for p-percent coverage in wireless sensor networks , 2011, Cluster Computing.

[18]  Zhipeng Cai,et al.  Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks , 2014, COCOA.

[19]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[20]  Sharma Chakravarthy,et al.  Composite Events for Active Databases: Semantics, Contexts and Detection , 1994, VLDB.

[21]  Guohui Lin,et al.  Improved Approximation Algorithms for the Capacitated Multicast Routing Problem , 2005, COCOON.