# Improved Approximation Algorithms for Relay Placement

@article{Efrat2008ImprovedAA, title={Improved Approximation Algorithms for Relay Placement}, author={Alon Efrat and S{\'a}ndor P. Fekete and Joseph B. M. Mitchell and Valentin Polishchuk and Jukka Suomela}, journal={ACM Transactions on Algorithms (TALG)}, year={2008}, volume={12}, pages={1 - 28} }

In the relay placement problem, the input is a set of sensors and a number r ⩾ 1, the communication range of a relay. In the one-tier version of the problem, the objective is to place a minimum number of relays so that between every pair of sensors there is a path through sensors and/or relays such that the consecutive vertices of the path are within distance r if both vertices are relays and within distance 1 otherwise. The two-tier version adds the restrictions that the path must go through…

## 67 Citations

### A survey on relay placement with runtime and approximation guarantees

- Computer ScienceComput. Sci. Rev.
- 2011

### Relay placement for fault tolerance in wireless networks in higher dimensions

- Computer ScienceComput. Geom.
- 2011

### 2-Connected relay placement problem in wireless sensor networks

- Computer Science2012 Second International Conference on Digital Information and Communication Technology and it's Applications (DICTAP)
- 2012

This paper proposed a polynomial time approximation algorithm for the 2CRPP problem and mathematically proved that its approximation ratio is bound by (4+ε), in the worst case.

### Optimal Placement of Relay Nodes Over Limited Positions in Wireless Sensor Networks

- Computer Science, BusinessIEEE Transactions on Wireless Communications
- 2017

The proposed solution aims for minimizing the outage probabilities when constructing the routing tree, by adding a minimum number of RNs that guarantee connectivity, at a reasonable cost in terms of the number of added RNs.

### Topology control with a limited number of relays

- Computer Science2012 IEEE Global Communications Conference (GLOBECOM)
- 2012

A polynomial-time bicriteria approximation algorithm is presented for the placement of limited number of relays and optimal sensor power assignments such that the network is connected and an optimal O(n2 log n)-time algorithm is provided for a restricted version where nodes lie on a simplified urban grid.

### Placement of relayers in wireless industrial sensor networks: An approximation algorithm

- Computer Science2014 IEEE Ninth International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP)
- 2014

This work proposes an iterative placement and scheduling algorithm and compares its performance against two baseline algorithms, one using random relay placement, and another algorithm giving the truly optimal relay positions and schedule on a grid.

### Novel relay node placement algorithms for establishing connected topologies

- Computer ScienceJ. Netw. Comput. Appl.
- 2016

### Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations

- Computer ScienceIEEE Transactions on Mobile Computing
- 2012

This paper studies two-tiered constrained relay node placement problems, where the relay nodes can be placed only at some prespecified candidate locations, and proposes novel polynomial time approximation algorithms for these problems.

### Optimal relay node placement for throughput enhancement in wireless sensor networks

- Computer Science2011 50th FITCE Congress - "ICT: Bridging an Ever Shifting Digital Divide"
- 2011

This work considers the relay node placement problem in wireless sensor networks: where to position a limited number of available nodes that can act as additional relays to foward sensor data toward one or more base stations, and formalizes the problem by defining a linear, mixed integer mathematical programming model.

## References

SHOWING 1-10 OF 34 REFERENCES

### On optimal placement of relay nodes for reliable connectivity in wireless sensor networks

- Computer ScienceJ. Comb. Optim.
- 2006

The paper addresses the relay node placement problem in two-tiered wireless sensor networks by proposing two approximation algorithms with (24+ε) and (6/T+12+ε), respectively, and extends the results to the cases where communication radiuses of sensor nodes and relay nodes are different from each other.

### Fault-Tolerant Relay Node Placement in Wireless Sensor Networks

- Computer ScienceCOCOON
- 2005

The paper addresses the relay node placement problem in two-tiered wireless sensor networks by proposing a 6+e-approximation algorithm for any e>0 with polynomial running time when e is fixed and two approximation algorithms with 24+e and 6/T+12+e, respectively.

### Relay sensor placement in wireless sensor networks

- Computer ScienceWirel. Networks
- 2008

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…

### Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms

- Computer ScienceIEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
- 2007

This paper studies four related fault-tolerant relay node placement problems and presents a polynomial time O(1)-approximation algorithm with a small approximation ratio for each of them.

### Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements

- Computer ScienceIEEE INFOCOM 2008 - The 27th Conference on Computer Communications
- 2008

This paper studies constrained versions of the relay node placement problem, where relay nodes can only be placed at a subset of candidate locations, and presents a framework of polynomial time O(1) -approximation algorithms with small approximation ratios.

### Fault-tolerant relay node placement in wireless sensor networks: formulation and approximation

- Computer Science2004 Workshop on High Performance Switching and Routing, 2004. HPSR.
- 2004

A polynomial time approximation algorithm is presented and it is proved the worst-case performance given by the algorithm is bounded within O(D log n) times of the size of an optimal solution, where n is the number of sensor nodes in the network, D is the diameter of the network formed by a sufficient set of possible positions for relay nodes.

### Mobile backbone networks --: construction and maintenance

- Computer ScienceMobiHoc '06
- 2006

It is shown that the proposed GDC algorithms perform very well under mobility and that the new approac for the joint solution can significantly reduce the number of required Mobile Backbone Nodes.

### Relay Node Placement in Wireless Sensor Networks

- Computer ScienceIEEE Transactions on Computers
- 2007

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.

### Approximations for Steiner Trees with Minimum Number of Steiner Points

- MathematicsTheor. Comput. Sci.
- 2000

### Deploying Sensor Networks With Guaranteed Fault Tolerance

- Computer ScienceIEEE/ACM Transactions on Networking
- 2010

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 .