Coverage and Connectivity Issue in Wireless Sensor Networks

Wireless sensor networks (WSNs) are an emerging area of interest in research and development. It finds use in military surveillance, health care, environmental monitoring, forest fire detection and smart environments. An important research issue in WSNs is the coverage since cost, area and lifetime are directly validated to it.In this paper we present an overview of WSNs and try to refine the coverage and connectivity issues in wireless sensor networks

Some Target Coverage Issues of Wireless Sensor Network

Wireless Sensor Network is an emerging field that is achieving much importance due to its immense contribution in varieties of target specific applications. One of the active issues is Target Coverage that deals with the coverage of a specific set of targets. Static sensor nodes are being deployed in a random manner to monitor the required targets and collect as much information as possible. In this Paper we have presented an overview of WSN and some of the strategies of the Target Coverage Problem

Controlling the Coverage of Wireless Sensors Network Using Coverage in Block Algorithm

This research investigate the modeling of Blocks, Present in the sensing field and its impact in the computation of coverage path in wireless sensor networks (WSNs). The solutions of these problems are proposed using techniques from Approximation algorithm. In order to accomplish the designated task successfully, sensors need to actuate, compute and disseminate the acquired information amongst them. Intuitively, coverage denotes the quality of sensing of a sensor node. While a sensor senses. It needs to communicate with its neighboring sensor nodes in order to disseminate the acquired data. That is where connectivity comes in to place. In fact, coverage and connectivity together measure the quality of service (QoS) of a sensor network. Coverage and connectivity in wireless sensor networks are not unrelated problems. Therefore, the goal of an optimal sensor deployment strategy is to have a globally connected network, while optimizing coverage at the same time. By optimizing coverage, the deployment strategy would guarantee that optimum area in the sensing field is covered by sensor, as required by the underlying application, whereas by ensuring that the network is connected, it is ensured that the sensed information is transmitted to other nodes and possibly to a centralized base station (called sink) which makes valuable decision for the application. Many recent and ongoing research in sensor networks focus on optimizing coverage and connectivity by optimizing node placement strategy, minimizing number of nodes to guarantee required degree of coverage, maximizing network lifetime by minimizing energy usage, computing the most and least sensed path in the given region and so on. To solve these optimizing problems related to coverage, exiting research uses mostly probabilistic technique based on random graph theory, randomized algorithm, computational geometry, and so on. Of particular interest to us is the problem of computing the coverage in block (CIB), where give

Efficiency Impairment of Wireless Sensor Networks Protocols under Realistic Physical Layer Conditions

International audienceMost of existing works about sensor networks focus on energy management. Already proposed solutions often consist in balancing energy consumption by taking advantage of the redundancy induced by the random deployment of nodes; some nodes are active while others are in sleep mode, thus consuming less energy. Such a dynamical topology should not impact the monitoring activity. Area coverage protocols aim at turning off redundant sensor nodes in order to constitute a set of active nodes that covers as large an area as the whole set of nodes. In this paper, we focus on localized algorithms that require 1-hop knowledge only to allow nodes to choose their activity status. The unit disk model is the most commonly used assumption; if a node emits a message, any node within its communication range receives it while any node outside the disk does not. In this article, the impact of a realistic radio channel on area coverage protocols for wireless sensor networks is studied. It is shown that a non-binary reception probability can lead to very different results for protocols that could though provide great performances with the unit disk model. An optimization of a protocol to keep increasing the network lifetime once a realistic energy consumption model is considered is also provided

An Energy Efficient Sleep/Wake up Routing Protocol for Wireless Sensor Networks

In recent years, wireless sensor networks (WSNs) have a rapid development and they take a lot of research attention because of their wide-range applications. A WSN consists of a large number of distributed sensor nodes. These nodes are often deployed in remote or hostile areas to monitor physical or environmental conditions where they send this data to a main location. The most critical parameter in WSNs is network lifetime, so an efficient routing protocol is essential to reduce the energy consumption and to increase the network lifetime. This paper proposes an energy-efficient chain-based cooperative routing protocol based on node sleep/wake-up mechanism for WSNs. We compare this protocol with two efficient protocols; LEACH and CBCCP using MATLAB. Simulation results show that the proposed algorithm achieves better performance and conserves more energy than the other two protocols