In sensor networks, it is desired to conserve energy so that the network lifetime can be maximized. An efficient approach to prolong the network lifetime is to identify a schedule for all the sensors, indicating which subset of the sensors can be active during the current time slot. Furthermore, to ensure the quality of surveillance, some applications require k-coverage of the monitored area. In this paper, we first define the Sensor Energy-efficient Scheduling for k-coverage (SESK) problem. We further resolve it by proposing a scheduling approach named Distributed Energy-efficient Scheduling for k-coverage DESK such that the energy consumption among all the sensors is balanced while still assuring the k-coverage requirement. This approach is completely distributed as well as localized, which is more practical than centralized ones in wireless sensor networks.
#2My T. Thai(UF: University of Florida)H-Index: 40
Last. Weili Wu(UTD: University of Texas at Dallas)H-Index: 37
view all 5 authors...
Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, with the limited bandwidth, coverage breach (i.e, targets that are not covered) can occur if the number of available time-slots/channels is less than the number of sensors in a sensor cover. In this paper, we study a joint optimization problem in which the objective is to minimize the coverage breach as well as to maximize ...
#1Himanshu Gupta(SUNY: State University of New York System)H-Index: 34
#2Zongheng Zhou(SUNY: State University of New York System)H-Index: 6
Last. Quinyi Gu(SUNY: State University of New York System)H-Index: 2
view all 4 authors...
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor network can be exploited to reduce the communication cost incurred in execution of such queries. Any reduction in communication cost would result in an efficient use of the battery energy, which is very limited in sensors. One approach to reduce the communication cost of a query is to self-organize the network, in response to...
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 w...
This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient power management can extend network lifetime. In this paper, we consider a large number of sensors with adjustable sensing range that are randomly deployed to monitor a number of targets. Since targets are redundantly covered by more sensors, in order to conserve energy resources, sensors can be organized in sets, activated succ...
#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...
A critical aspect of applications with wireless sensor networks is network lifetime. Power-constrained wireless sensor networks are usable as long as they can communicate sensed data to a processing node. Sensing and communications consume energy, therefore judicious power management and sensor scheduling can effectively extend network lifetime. To cover a set of targets with known locations when ground access in the remote area is prohibited, one solution is to deploy the sensors remotely, from...
This paper addresses the coverage breach problem in wireless sensor networks with limited bandwidths. In wireless sensor networks, sensor nodes are powered by batteries. To make efficient use of battery energy is critical to sensor network lifetimes. When targets are redundantly covered by multiple sensors, especially in stochastically deployed sensor networks, it is possible to save battery energy by organizing sensors into mutually exclusive subsets and alternatively activating only one subset...
#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...
#2Samir R. Das(SBU: Stony Brook University)H-Index: 61
Last. Himanshu Gupta(SBU: Stony Brook University)H-Index: 34
view all 3 authors...
In overdeployed sensor networks, one approach to conserve energy is to keep only a small subset of sensors active at any instant. In this article, we consider the problem of selecting a minimum size connected K-cover, which is defined as a set of sensors M such that each point in the sensor network is "covered" by at least K different sensors in M, and the communication graph induced by M is connected. For the above optimization problem, we design a centralized approximation algorithm that deliv...
Sep 26, 2004 in MOBICOM (ACM/IEEE International Conference on Mobile Computing and Networking)
#1Santosh Kumar(OSU: Ohio State University)H-Index: 96
#2Ten H. Lai(OSU: Ohio State University)H-Index: 22
Last. József Balogh(OSU: Ohio State University)H-Index: 30
view all 3 authors...
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their lifetime. On the other hand, surveillance kind of applications require guaranteed k-coverage of the protected region at all times. As a result, determining the appropriate number of sensors to deploy that achieves both goals simultaneously becomes a challenging problem. In this paper, we consider three kinds of deployme...
Preserving sufficient coverage and prolonging the network lifetime as much as possible has become one of the most critical issues in Wireless Sensor Networks (WSNs). In this article, a protocol called Energy-efficient Particle Swarm Optimization for Lifetime Coverage Prolongation (EPSOLCOP) is proposed to maintain the coverage and enhance the WSN lifetime. The target sensing field is virtually partitioned into smaller subfields. EPSOLCOP protocol is distributed on the sensor nodes of each subfie...
Last. Andreas Spanias(ASU: Arizona State University)H-Index: 32
view all 3 authors...
A fully distributed algorithm for estimating the center and the radius of the smallest sphere that contains a wireless sensor network is proposed. The center finding problem is formulated as a convex optimization problem in summation form by using a soft-max approximation to the maximum function. Diffusion adaptation method is used where states of nodes converge to the estimated center distributively. Then, distributed max consensus is used to compute the radius. The proposed algorithm is fully ...
#2Karine Deschinkel(CNRS: Centre national de la recherche scientifique)H-Index: 5
Last. Raphaël Couturier(CNRS: Centre national de la recherche scientifique)H-Index: 21
view all 4 authors...
Coverage and lifetime are two paramount problems in wireless sensor networks (WSNs). In this paper, a method called Multiround Distributed Lifetime Coverage Optimization protocol (MuDiLCO) is proposed to maintain the coverage and to improve the lifetime in wireless sensor networks. The area of interest is first divided into subregions, and then the MuDiLCO protocol is distributed to the sensor nodes in each subregion. The proposed MuDiLCO protocol works in periods during which sets of sensor nod...
Abstract The area of detection and estimation in a distributed wireless sensor network (WSN) has several applications, including military surveillance, sustainability, health monitoring, and Internet of Things (IoT). Compared with a wired centralized sensor network, a distributed WSN has many advantages including scalability and robustness to sensor node failures. In this book, we address the problem of estimating the structure of distributed WSNs. First, we provide a literature review in: (a) g...
Last. Andreas Spanias(ASU: Arizona State University)H-Index: 32
view all 3 authors...
A fully distributed algorithm for estimating the center and coverage region of a wireless sensor network (WSN) is proposed. The proposed algorithm is useful in many applications, such as finding the required power for a certain level of connectivity in WSNs and localizing a service center in a network. The network coverage region is defined to be the smallest sphere that covers all the sensor nodes. The center and radius of the smallest covering sphere are estimated. The center estimation is for...
#2Karine Deschinkel(CNRS: Centre national de la recherche scientifique)H-Index: 5
Last. Raphaël Couturier(CNRS: Centre national de la recherche scientifique)H-Index: 21
view all 4 authors...
The most important problem in a Wireless Sensor Network (WSN) is to optimize the use of its limited energy provision, so that it can fulfil its monitoring task as long as possible. Among known available approaches that can be used to improve power management, lifetime coverage optimization provides activity scheduling which ensures sensing coverage while minimizing the energy cost. In this article an approach called Perimeter-based Coverage Optimization protocol (PeCO) is proposed. It is a hybri...
#2Karine Deschinkel(CNRS: Centre national de la recherche scientifique)H-Index: 5
Last. Raphaël Couturier(CNRS: Centre national de la recherche scientifique)H-Index: 21
view all 4 authors...
One of the main research challenges faced in Wireless Sensor Networks (WSNs) is to preserve continuously and effectively the coverage of an area (or region) of interest to be monitored, while simultaneously preventing as much as possible a network failure due to battery-depleted nodes. In this paper, we propose a protocol, called distributed lifetime coverage optimization protocol (DiLCO), which maintains the coverage and improves the lifetime of a wireless sensor network. First, we partition th...
#1Minghui Zhu(PSU: Pennsylvania State University)H-Index: 22
#2Sonia Martinez(UCSD: University of California, San Diego)H-Index: 41
In noncooperative games, players are self-interested and aim to maximize their own utilities. The selfishness makes the decision-making of players naturally distributed. This attractive feature is evident in a large number of game theoretic learning algorithms, e.g., better and best reply dynamics. As a result, game theoretic learning provides a powerful arsenal for the synthesis of efficient distributed algorithms to multi-agent networks. This chapter will discuss one of its applications to sen...
Sensing coverage is one of fundamental problems in wireless sensor networks. In this paper, we investigate the polytype target coverage problem in heterogeneous wireless sensor networks where each sensor is equipped with multiple sensing units and each type of sensing unit can sense an attribute of multiple targets. How to schedule multiple sensing units of a sensor to cover multiple targets becomes a new challenging problem. This problem is formulated as an integer linear programming problem fo...