Sensor coverage in wireless sensor networks

Distributed and networked embedded systems equipped with sensors and actuators hold promises of making revolutionary changes in the way we observe, understand, and interact with the world. Sensor networks are one class of such networked embedded systems that are designed with the primary objective of observing physical phenomena in an environment. Fundamental design, development, deployment, and utilization issues for any sensor network are first trying to understand and characterize, and second to optimize the "quality of sensing" that the system as a whole can provide, subject to the ever-present resource constraints. In order to approach the quality of sensing, i.e., sensor coverage problem, one needs models of the sensors; the phenomena, and the environments in which the sensors interact with the phenomena. Furthermore, in collaborative settings where multiple distributed sensors participate in the sensing task, the methods and computation algorithms used, also play significant roles in the observability of phenomena and thus, must also be modeled. This thesis is an in-depth investigation of the sensor coverage problem in wireless sensor networks that follows two general directions: (1) coverage by abstraction and (2) data prediction. In the first case, three different methods of sensor abstractions and the way they observe phenomena or detect targets are used to characterize coverage: (a) 0/1 coverage, where sensors are modeled as having known sensing regions; (b) worst- and best-case coverage, where sensing effectiveness is assumed to be a monotonically decreasing function of distance from the sensor, and observability of an event is dictated by the closest, or farthest distance from the event to a sensor; and (c) exposure-based methods, where the time and the path taken by objects impact their observability. While coverage abstractions are the theme in the first case, in the second case, data prediction models are used to evaluate the level of redundancy in the data collected by the sensors. If the measurements of a sensor can be predicted by others, then that sensor is covered. In order to address the sensor prediction problem, we present the details of our Symmetric Monotonic Regression and analyze it extensively using experimental data for indoor environmental monitoring.

[1]  Jie Wu,et al.  Energy-Efficient Backbone Construction, Broadcasting, and Area Coverage in Sensor Networks , 2005, Handbook of Sensor Networks.

[2]  I. Stojmenovic,et al.  Ensuring Area k-Coverage in Wireless Sensor Networks with Realistic Physical Layers , 2006, 2006 5th IEEE Conference on Sensors.

[3]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[4]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[5]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[6]  Jie Wu,et al.  Energy-efficient coverage problems in wireless ad-hoc sensor networks , 2006, Comput. Commun..

[7]  Guoliang Xing,et al.  On greedy geographic routing algorithms in sensing-covered networks , 2004, MobiHoc '04.

[8]  Wenhua Dou,et al.  A Coverage-Preserving Density Control Algorithm for Wireless Sensor Networks , 2004, ADHOC-NOW.

[9]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[10]  Tatsuya Suda,et al.  Scalable Coverage Maintenance for Dense Wireless Sensor Networks , 2006 .

[11]  Samir R. Das,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2006, TNET.

[12]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[13]  Ivan Stojmenovic,et al.  Ensuring K-Coverage in Wireless Sensor Networks under Realistic Physical Layer Assumptions , 2006 .

[14]  Ning Zhong,et al.  Efficient point coverage in wireless sensor networks , 2006, J. Comb. Optim..

[15]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[16]  Michael T. Goodrich,et al.  Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..

[17]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[18]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[19]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

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

[21]  Donald F. Towsley,et al.  A study of the coverage of large-scale sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[22]  Himanshu Gupta,et al.  Fault tolerant connected sensor cover with variable sensing and transmission ranges , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

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

[24]  Jang-Ping Sheu,et al.  A Distributed Query Protocol in Wireless Sensor Networks , 2007, Wirel. Pers. Commun..

[25]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[26]  Jie Wu,et al.  On Connected Multiple Point Coverage in Wireless Sensor Networks , 2006, Int. J. Wirel. Inf. Networks.

[27]  Di Tian,et al.  A node scheduling scheme for energy conservation in large wireless sensor networks , 2003, Wirel. Commun. Mob. Comput..

[28]  Ashish Goel,et al.  Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[29]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

[30]  Bing-Hong Liu,et al.  Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete , 2007, IEEE Transactions on Computers.

[31]  Jie Wu,et al.  Maximum network lifetime in wireless sensor networks with adjustable sensing ranges , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[32]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[33]  Di Tian,et al.  Connectivity maintenance and coverage preservation in wireless sensor networks , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[34]  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..

[35]  Suman Banerjee,et al.  Node Placement for Connected Coverage in Sensor Networks , 2003 .

[36]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[37]  Jie Wu,et al.  Energy-Efficient Connected Coverage of Discrete Targets in Wireless Sensor Networks , 2005, ICCNMC.

[38]  Ivan Stojmenovic,et al.  Handbook of Sensor Networks: Algorithms and Architectures , 2005, Handbook of Sensor Networks.

[39]  Jie Wu,et al.  Distributed dominant pruning in ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[40]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[41]  Di Tian,et al.  Location and calculation-free node-scheduling schemes in large wireless sensor networks , 2004, Ad Hoc Networks.

[42]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[43]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[44]  David Simplot-Ryl,et al.  Energy-efficient area monitoring for sensor networks , 2004, Computer.