Solving a 2-covered path problem with variable radii for wireless sensor networks

Authors:
Da-Ren Chen;Chiun-Chieh Hsu;You-Shyang Chen;Jun-Fu Guo
Affiliations:
Department of Information Management, National Taichung University of Science and Technology, Taichung, Taiwan, R.O.C.;Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, R.O.C.;Department of Information Management, Hwa Hsia Institute of Technology, Taipei, Taiwan, R.O.C.;Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, R.O.C.
Venue:
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Year:
2012

Citing 4
Cited 0

Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
An energy aware coverage-preserving scheme for wireless sensor networks

PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Understanding UMTS Radio Network Modelling, Planning and Automated Optimisation: Theory and Practice

Understanding UMTS Radio Network Modelling, Planning and Automated Optimisation: Theory and Practice
2-Covered paths by a set of antennas with minimum power transmission range

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose two techniques to solve a 2-covered path problem. Given a set of n antennas with m available radii and two points A and B on the plane, our goal is to find a suitable radius p∈m (as well as transmission power) for each antenna so that the active antennas in a 2-covered path with endpoints A and B consumes minimum transmission power. The proposed techniques called 2-covered area stretching planning (TASP) and radii shrinking planning (RSP) that apply different strategies to reduce power consumption. Experimental results show that RSP derives less power consumption than TASP, and RSP and TASP take O(n2) and O(n3) time complexity, respectively.