Energy-efficient coverage problems in wireless ad-hoc sensor networks

Published on Feb 1, 2006in Computer Communications2.816
· DOI :10.1016/J.COMCOM.2004.12.025
Mihaela Cardei28
Estimated H-index: 28
(FAU: Florida Atlantic University),
Jie Wu128
Estimated H-index: 128
(FAU: Florida Atlantic University)
Sources
Abstract
Wireless sensor networks constitute the platform of a broad range of applications related to national security, surveillance, military, health care, and environmental monitoring. The sensor coverage problem has received increased attention recently, being considerably driven by recent advances in affordable and efficient integrated electronic devices. This problem is centered around a fundamental question: How well do the sensors observe the physical space? The coverage concept is subject to a wide range of interpretations due to a variety of sensors and their applications. Different coverage formulations have been proposed, based on the subject to be covered (area versus discrete points) and sensor deployment mechanism (random versus deterministic) as well as on other wireless sensor network properties (e.g. network connectivity and minimum energy consumption). In this article, we survey recent contributions addressing energy-efficient coverage problems in the context of static wireless sensor networks. We present various coverage formulations, their assumptions, as well as an overview of the solutions proposed.
📖 Papers frequently viewed together
1,333 Citations
221 Citations
808 Citations
References27
Newest
#1Mihaela Cardei (FAU: Florida Atlantic University)H-Index: 28
#2Ding-Zhu Du (UMN: University of Minnesota)H-Index: 62
A critical aspect of applications with wireless sensor networks is network lifetime. Battery-powered sensors are usable as long as they can communicate captured data to a processing node. Sensing and communications consume energy, therefore judicious power management and scheduling can effectively extend operational time. To monitor a set of targets with known locations when ground access in the monitored area is prohibited, one solution is to deploy the sensors remotely, from an aircraft. The l...
808 CitationsSource
#1Honghai ZhangH-Index: 28
#2Jennifer C. Hou (UIUC: University of Illinois at Urbana–Champaign)H-Index: 44
In this paper, we address the issues of maintaining sensing coverage and connectivity by keeping a minimum number of sensor nodes in the active mode in wireless sensor networks. We investigate the relationship between coverage and connectivity by solving the following two sub-problems. First, we prove that if the radio range is at least twice the sensing range, complete coverage of a convex area implies connectivity among the working set of nodes. Second, we derive, under the ideal case in which...
1,333 Citations
The nodes in sensor networks must self-organize to monitor the target area as long as possible. Researchers at the Fundamental Computer Science Laboratory of Lille are developing strategies for selecting and updating an energy-efficient connected active sensor set that extends the network lifetime. We report on their work to optimize energy consumption in three separate problems: area coverage, request spreading, and data aggregation.
389 CitationsSource
#1Xiaorui Wang (WashU: Washington University in St. Louis)H-Index: 54
#2Guoliang Xing (WashU: Washington University in St. Louis)H-Index: 45
Last. Christopher Gill (WashU: Washington University in St. Louis)H-Index: 32
view all 6 authors...
An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and network connectivity. Furthermore, the network must be able to configure itself to any feasible degrees of coverage and connectivity in order to support different applications and environments with di...
1,204 CitationsSource
Jul 9, 2003 in INFOCOM (International Conference on Computer Communications)
#1Jie Wu (FAU: Florida Atlantic University)H-Index: 128
#2Fei Dai (FAU: Florida Atlantic University)H-Index: 22
We propose a general framework for broadcasting in ad hoc networks through self-pruning. The approach is based on selecting a small subset of hosts (also called nodes) to form a forward node set to carry out a broadcast process. Each node, upon receiving a broadcast packet, determines whether to forward the packet based on two neighborhood coverage conditions. These coverage conditions depend on neighbor connectivity and history of visited nodes, and in general, resort to global network informat...
213 CitationsSource
#1Fei Dai (FAU: Florida Atlantic University)H-Index: 22
#2Jie Wu (FAU: Florida Atlantic University)H-Index: 128
Efficient routing among mobile hosts is an important function in ad hoc networks. Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts are either in the set or neighbors of hosts in the set. The efficiency of dominating-set-based routing mainly depends on the overhead introduced in the formation of the dominating set and the size of the dominating set. In this paper, we fir...
106 CitationsSource
#1Seapahn Megerian (UCLA: University of California, Los Angeles)H-Index: 10
#2Miodrag Potkonjak (UCLA: University of California, Los Angeles)H-Index: 77
Sensor networks consist of a set of sensor nodes, each equipped with one or more sensors, communication subsystems, storage and processing resources, and in some cases actuators. The sensors in a node observe phenomena such as thermal, optic, acoustic, seismic, and acceleration events, while the processing and other components analyze the raw data and formulate answers to specific user requests. Recent advances in technology have paved the way for the design and implementation of new generations...
35 CitationsSource
We address the problem of optimal node placement for ensuring connected coverage in sensor networks. We consider two different practical scenarios. In the first scenario, a certain region (or a set of regions) are to be provided connected coverage, while in the second case, a given set of n points are to be covered and connected. For the first case, we provide solutions that are within a small factor of the optimum. For the second case, we present an algorithm that runs in polynomial time, and g...
272 Citations
#1Di Tian (U of O: University of Ottawa)H-Index: 5
#2Nicolas D. Georganas (U of O: University of Ottawa)H-Index: 27
In wireless sensor networks that consist of a large number of low-power, short-lived, unreliable sensors, one of the main design challenges is to obtain long system lifetime, as well as maintain sufficient sensing coverage and reliability. In this paper, we propose a node-scheduling scheme, which can reduce system overall energy consumption, therefore increasing system lifetime, by turning off some redundant nodes. Our coverage-based off-duty eligibility rule and backoff-based node-scheduling sc...
1,073 CitationsSource
#1Mihaela Cardei (UMN: University of Minnesota)H-Index: 28
#2David MacCallum (UMN: University of Minnesota)H-Index: 4
Last. Ding-Zhu Du (UMN: University of Minnesota)H-Index: 62
view all 7 authors...
A critical aspect of applications with wireless sensor networks is network lifetime. Battery-powered sensors are usable as long as they can communicate captured data to a processing node. Sensing and communications consume energy, therefore judicious power management and scheduling can effectively extend the operational time. One important class of wireless sensor applications of deployment of large number of sensors in an area for environmental monitoring. The data collected by the sensors is s...
221 CitationsSource
Cited By562
Newest
Source
Source
Source
#1A. Karthikeyan (SNS College of Technology)H-Index: 2
#2P. Prakasam (VIT University)H-Index: 2
Last. S. Sai Gokul (Institut supérieur d'électronique de Paris)
view all 5 authors...
The linked governance set has presently been introduced as an attractive scheme to the region analysis in wireless sensor networks (WSNs). Therefore the key issue bothering the behavior of the prevailing Minimal sized Governing Set (MGS) based analysis standards is that they are focused on increasing the count of sleep nodes to safeguard the energy. It makes the lively sensors to feel immense loads for handling voluminous adjacencies. The quicker depletion of the lively sensors might detach the ...
Source
In this paper, a problem regarding how multiple mobile agents track a high-speed maneuvering target is considered. Due to the uncertainties of the target caused by the background noises, we use a d...
Source
#1Ziyad A. Alhaddad (Information Technology University)
#2S. Manimurugan (Information Technology University)
Abstract Wireless Sensor Networks (WSNs) consist of set of sensors which used to perform specific tasks. Recently, it used in different fields at large area. The sensor networks provide effective functions in get data for any environment selected for many aims and objectives and monitors selected environments. Wireless sensors networks are used to monitor large areas for different application so that is important to increase the coverage to support the monitor performance. Deployment of nodes ar...
1 CitationsSource
#1Tripatjot Singh Panag (Baba Banda Singh Bahadur Engineering College)H-Index: 5
#2Jaspreet Singh Dhillon (SLIET: Sant Longowal Institute of Engineering and Technology)H-Index: 20
Grouping the sensor nodes into clusters is an effective way to organize wireless sensor networks and to prolong the networks’ lifetime. This paper presents a static clustering algorithm that employs predator–prey optimization (PPO) for identifying cluster heads as well as routes for sending data to the sink. The objective of the optimization algorithm is to reduce the energy consumed in data collection and transmission, to achieve equalization in energy utilization by the wireless sensor nodes a...
1 CitationsSource
#1Prashant Ahluwalia (Chandigarh University)
#2Nitin Mittal (Chandigarh University)H-Index: 9
Source
#1Pooja ChaturvediH-Index: 4
#2A. K. Daniel (Madan Mohan Malaviya University of Technology)H-Index: 7
Source
#1Yu-Fang Jian (AU: Asia University (Taiwan))
#2Wei-Fu Lu (AU: Asia University (Taiwan))
The directional connected target coverage (DCTC) problem that schedules directional sensors to cover all targets and forward target information back to the sink to maximize system lifetime is still an important research issue in directional sensor networks. In this paper, a Sector Cover and Transmission Weighted Greedy Algorithm (SCTW-greedy algorithm) is proposed to construct the scheduling of sensors for the DCTC problem. The directional sensor nodes used in the previous works are composed of ...
Source