An efficient algorithm for relay placement in a ring sensor networks

Authors:
Chang-Chien Chou
Affiliations:
Department of Information Management, Lunghwa University of Science and Technology, Taiwan, ROC
Venue:
Expert Systems with Applications: An International Journal
Year:
2010

Citing 4
Cited 0

Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Touring a sequence of polygons

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
A base function for generating contour traversal paths in stereolithography apparatus applications

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

Abstract

This work proposes an intelligent algorithm which can arrange the minimum number of relays connecting n scattered base stations in a sensor networks with ring topology. The problem is firstly transformed to a corresponding problem of computing the shortest polygon connecting n base stations. Then a fleet of minimum number of relays can be deployed to cover the sides of the polygon. Algorithms are developed to construct such shortest polygon in polynomial time of O(kn) where 1=