An efficient relay sensors placing algorithm for connectivity in wireless sensor networks

Authors:
Jyh-Huei Chang;Rong-Hong Jan
Affiliations:
Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan;Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan
Venue:
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Year:
2006

Citing 10
Cited 0

A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points

Information Processing Letters
Approximations for Steiner Trees with Minimum Number of Steiner Points

Journal of Global Optimization
Connected sensor cover: self-organization of sensor networks for efficient query execution

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
Power-efficient sensor placement and transmission structure for data gathering under distortion constraints

ACM Transactions on Sensor Networks (TOSN)
Relay sensor placement in wireless sensor networks

Wireless Networks
Connectivity maintenance and coverage preservation in wireless sensor networks

Ad Hoc Networks
On energy provisioning and relay node placement for wireless sensor networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Randomly deployed sensor networks often make initial communication gaps inside the deployed area even in an extremely high-density network. How to add relay sensors such that the underlying graph is connected and the number of relay sensors added is minimized is an important problem in wireless sensor networks. This paper presents an Efficient Relay Sensors Placing Algorithm (ERSPA) for solving such a problem. Compared with minimum spanning tree algorithm and greedy algorithm, ERSPA achieves a better performance in terms of number of relay sensors added. Simulation results show that the average number of relay sensors added by minimal spanning tree algorithm is approximately up to two times than ERSPA algorithm