Relay augmentation for lifetime extension of wireless sensor networks

  title={Relay augmentation for lifetime extension of wireless sensor networks},
  author={Marcus Brazil and Charl J. Ras and Doreen A. Thomas},
  journal={IET Wirel. Sens. Syst.},
The authors propose a novel relay augmentation strategy for extending the lifetime of a certain class of wireless sensor networks. In this class sensors are located at fixed and pre-determined positions and all communication takes place through multi-hop paths in a fixed routing tree rooted at the base station. It is assumed that no accumulation of data takes place along the communication paths and that there is no restriction on where additional relays may be located. Under these assumptions… 

Average relay transmit-power analysis in dual-hop amplify-and-forward relaying systems

A general analytical expression of ARTP is given for any relay selection strategy when all relays have enough energy in amplify-and-forward relaying systems and simulation results validate that MinARTP and MaxARTP can approximately represent the lower bound and the upper bound of AR TP for the system.

Joint node selection, flow routing, and cell coverage optimisation for network sum-rate maximisation in wireless sensor networks

This work provides significant theoretical results on network sum-rate maximisation for WSNs under a variety of practical constraints.

An Echo-Aided Bat Algorithm to Construct Topology of Spanning Tree in Wireless Sensor Networks

This framework including network topology constructed by EABD and network lifetime estimated by transmission simulation is created in this study to aid the plan for duration of WSN deployment.

A Review on Energy Efficient Clustering Protocol of Heterogeneous Wireless Sensor Network

Basic considered in designing clustering algorithm and metrics available for validation are presented, which enhance the energy efficiency and prolongs the lifetime of the network.

Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem

A novel Monte Carlo Tree Search algorithm based on Upper Confidence Bound for Trees is proposed that is adapted to the specific characteristics of Steiner trees and shown to work better than both the greedy heuristic and pure Monte Carlo simulations.

SZBC-HWSN : Stabilize Zone Balanced Cluster Head Selection Protocol for Heterogeneous Wireless Sensor Network

The result shows that the proposed scheme outperforms than the existing protocols in terms of stability, throughput and energy remain in the network.

An immune clone selection based power control strategy for alleviating energy hole problems in wireless sensor networks

Simulation results are analyzed to show that the energy hole problem in WSNs has been largely alleviated by the ICSPC strategy, and the network lifetime is greatly prolonged.

Sleeping ZigBee networks at the application layer

A sleeping technique at the application layer that enables sleep mode for all nodes of a ZigBee network is implemented and a time synchronisation mechanism to deal with the clock drift of the sensor nodes was developed.

Steiner Trees with Other Cost Functions and Constraints

This chapter looks at Steiner tree problems that involve other cost functions and constraints but that still can be solved exactly by exploiting the geometric properties of minimal solutions.

Solving Euclidean Steiner Tree Problems with Multi Swarm Optimization

A new iterative heuristic algorithm, based on Multi Swarm Optimization, is presented for Steiner Tree Problems (STP) in the 2-dimensional Euclidean plane, which often produces near optimal solutions with limited resources.



Voronoi-based relay placement scheme for wireless sensor networks

A novel relay deployment scheme for WSNs based on the Voronoi diagram is proposed that is applicable to both two-dimensional and three-dimensional network topologies and establishes effective routing paths that balance the traffic load within the sensor network and alleviate the burden on the sensors around the sink.

Relay sensor placement in wireless sensor networks

This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum number of relay

Relay Node Deployment Strategies in Heterogeneous Wireless Sensor Networks

This study explores the trade-off between connectivity and lifetime extension in the problem of RN deployment and provides a guideline for efficient deployment of RNs in a large-scale heterogeneous WSN.

Relay Deployment and Power Control for Lifetime Elongation in Sensor Networks

This paper shows that the network lifetime can be extended significantly with the addition of relay nodes to the network, and suggests that it is sufficient to deploy relay nodes only with a specific probabilistic distribution rather than the specifying the exact places.

Relay Node Placement in Wireless Sensor Networks

A polynomial time 7-approximation algorithm for the first problem and a polynometric time (5+epsi)-approximating algorithm forThe second problem, where epsi>0 can be any given constant.

Density-Varying High-End Sensor Placement in Heterogeneous Wireless Sensor Networks

This paper proposes a novel density-varying deployment scheme for high-end sensors (H-sensors) in an HSN that solves the bottleneck problem in typical many-to-one sensor networks, and presents an effective H-sensor placement scheme that can simultaneously achieve coverage, connectivity and data relay requirements while uses a small number of H-Sensors.

Traffic-Aware Relay Node Deployment for Data Collection in Wireless Sensor Networks

  • Feng WangDan WangJiangchuan Liu
  • Computer Science
    2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks
  • 2009
This paper develops algorithms for discrete relay node assignment, together with local adjustments that yield high-quality practical solutions that achieves up to 6 to 14 times improvement on the network lifetime over the existing traffic-oblivious strategies.

Deploying Sensor Nets with Guaranteed Capacity and Fault Tolerance

This work designs and analyzes the first algorithms that place an almost-minimum number of additional sensors to augment an existing network into a k-connected network, for any desired parameter k, and proves that the number ofAdditional sensors is within a constant factor of the absolute minimum for any fixed k.

Approximations for a Bottleneck Steiner Tree Problem

It is shown that if NP is NP-hard, then there exists a polynomial-time approximation with performance ratio 2 for the problem in both the rectilinear plane and the Euclidean plane.