Bahia Zebbane

Topology control protocol for conserving energy in wireless sensor networks

The wireless sensor network is characterized by its density in number of deployed sensors. In reality, sensors in the same region collect and forward, in general, the same information. In order to conserve nodes energy, it is necessary to keep active a set of nodes while others can sleep. In this paper, we present a new topology control protocol (GECP) for wireless sensor network that extends the network lifetime by minimizing the energy consumption as well as ensuring the network connectivity. GECP exploits the sensor redundancy in the same region by dividing the network into a set of groups and allowing only to one sensor node to be active in each group. The group formation process is based only on exchanged messages between one-hop neighbors.

Distributed and stable energy-efficient scheduling algorithm for coverage in wireless sensor networks

Minimizing the energy consumption of battery-powered sensors is an essential consideration in sensor network applications like coverage, and sleep/wake scheduling mechanism has been proved to an efficient approach to handling this issue. Nevertheless, the frequent switching between states, during scheduling, leads also to significant energy consumption. In this article, a coverage-guaranteed distributed sleep/wake scheduling scheme is presented with the purpose of prolonging network lifetime while guaranteeing network coverage. Our scheme mitigates scheduling process to be more stable by avoiding useless transitions between states without affecting the coverage level required by the application. The simulation results illustrate that out scheme outperforms some other existed algorithms in terms of coverage guarantee, energy conservation and stability.

A Group-Based Energy-Saving Algorithm for Sleep/Wake Scheduling and Topology Control in Wireless Sensor Networks

In wireless sensor networks, one of the main design challenges is to save energy of sensors and obtain long system lifetime without sacrificing the quality of network coverage and connectivity. Topology control is the primary technique of energy saving which consists to keep a minimum number of sensor nodes to operate in active mode with the purpose of conserving energy as well as ensuring network connectivity and/or coverage. In this paper, we propose a Group-based Energy-Conserving Protocol (GECP) for wireless sensor networks that extends the network lifetime by sleep scheduling among sensor nodes with the purpose to ensure the network connectivity. It exploits the sensor redundancy in the same region by dividing the network into groups so that a connected backbone can be maintained by keeping only one active node in each group and turning off the redundant ones. The scheduling strategy, used by GECP, minimizes the number of transitions between sleep and active states in order to minimize the transition energy and the leader election frequency. The simulation results confirm the efficiency of GECP in terms of energy conservation, connectivity guarantee and network lifetime.

GTC: a geographical topology control protocol to conserve energy in wireless sensor networks

One of the main design challenges, in wireless sensor networks, is to save energy of sensors and obtain long system lifetime without sacrificing the quality of network coverage and connectivity. Topology control is the primary technique of energy saving. It consists in keeping a minimum number of sensor nodes to operate in active mode with the purpose of conserving energy. It also ensures network connectivity and/or coverage. In this paper, we propose a geographical topology control (GTC) protocol to reduce energy consumption in wireless sensor networks by sleep scheduling among sensor nodes with the purpose to ensure the network connectivity. GTC identifies redundant nodes and organises them into zones so that a connected backbone can be maintained by keeping only one active node in each zone. The redundant ones are turned off. The scheduling strategy, used by GTC, minimises the number of transitions between sleep and active states in order to minimise the transition energy and the leader election freque...

Towards an Energy-Efficient Algorithm Based Sleep-Scheduling for Wireless Sensor Networks

In this paper, we investigated the issue of energy conservation, in the WSNs, by keeping a minimum number of sensor nodes to operate in active mode as well as ensure network connectivity. To address this problem, we proposed a Geographical Topology Control (GTC) Protocol to reduce energy consumption in wireless sensor network by sleep scheduling among sensor nodes. The simulation results of GTC show that it can consume 30% less energy than GAF protocol. Moreover, GTC extends the network lifetime by 20% compared to GAF.

A distributed lightweight Redundancy aware Topology Control Protocol for wireless sensor networks

WSN consists of a large number of sensor nodes randomly deployed, and, in many cases, it is impossible to replace sensors when a node failure occurs. Thus, applications tend to deploy more nodes than necessary to cope with possible node failures and to increase the network lifetime, which leads to create some sensing and communication redundancy. However, sensors in the same region, may collect and forward the same information, which will waste more energy. In this paper, we propose a distributed Lightweight Redundancy aware Topology Control Protocol (LRTCP) for wireless sensor networks. It exploits the sensor redundancy in the same region by dividing the network into groups so that a connected backbone can be maintained by keeping a minimum of working nodes and turning off the redundant ones. LRTCP identifies equivalent nodes in terms of communication based on their redundancy degrees with respect of some eligibility rules. Simulation results indicate that, compared with existing distributed topology control algorithms, LRTCP improves network capacity and energy efficiency.

RTCP: Redundancy aware Topology Control Protocol for wireless sensor network

Topology control-based sleep-scheduling aims at exploiting node redundancy to save energy and extend the network lifetime, by putting as many nodes as possible in sleep mode, while maintaining a connected network. In this paper, we propose a redundancy aware topology control protocol (RTCP) for a wireless sensor network which exploits the sensor redundancy in the same region. This is achieved by dividing the network into groups so that a connected backbone can be maintained by keeping a necessary set of working nodes and turning off the redundant ones. RTCP allows applications to parameterise the desired connectivity degree. It identifies node redundancy, in terms of communication; it groups redundant nodes together according to their redundancy degrees and threshold of connectivity level. Finally, it schedules nodes in groups for active or sleep mode. The simulation results illustrate that RTCP outperforms some other existing algorithms, in terms of energy conservation, network lifetime and connectivity guarantee.

Exploiting node redundancy for maximizing wireless sensor network lifetime

In this paper, we propose a Redundancy aware Topology Control Protocol (RTCP) for wireless sensor network which exploits the sensor redundancy in the same region by dividing the network into groups so that a connected backbone can be maintained by keeping a necessary set of working nodes and turning off the redundant ones. RTCP identifies equivalent nodes in terms of communication based only on the connectivity information of one-hop neighbors which leads to a low communication overhead and then schedule nodes based on this equivalence. RTCP allows only the election of one sensor node to be active in each group. The simulation results illustrate that RTCP outperforms some other existing algorithms in terms of energy conservation and network lifetime.

BSCP: Buckup Scheduling Mecanism for Coverage Perserving in WSNs

Coverage is one fundamental problem in wireless sensor networks, it reflects how well an area is monitored or surveyed by sensors. Some applications require a high degree of coverage as it would want a region to be monitored by multiple nodes simultaneously. Nevertheless, the failure of one or several sensors, can paralysis the area coverage unless it was before completely covered.In this paper we will investigate the restoration of the area coverage under unexpected node failure with reduce energy consumption. In fact, we adopt new recovery mechanism where every active node selects a subset of its neighbors (backup cover) and schedules them to periodically wake up according to some optimization parameters.

LSEA: Light Weight Sector Eligibility Algorithm for k-Coverage in Wireless Sensor Networks

In wireless sensor networks, preserving sensing k-coverage with energy constraint is a basic issue drawing increasing attentions. In fact, the k-coverage configuration is extensively exploited to ensure that each location is covered by at least k active sensor nodes. However, most of these algorithms incur several drawbacks like: i) The need of a global view of the monitored field ii) Redundant sensor occurrence, and iii) Considerably high computation cost. We propose, in this paper, (LSEA) a distributed Lightweight Sector Eligibility Algorithm that settles all of the above critical problems and prove that a monitored area is k-covered with very low cost. LSEA proves that whether a sensor is eligible to sleep (redundant) or stay active can be accurately determined by simply checking if its neighbours belong to a well known set of points within its sensing range (Flower Area). LSEA has a computational complexity of O(N), where N is the number of neighboring nodes, lower than the complexity of many other eligibility algorithms. Simulation results confirm the theoretical analysis.