Affiliation:
1. National Taichung University of Science and Technology
Abstract
A 2-covered path routing method providing each path with redundant antennas to provide high availability ensures reliable multi-hop communication under practical conditions. In real life, the transmission range of an antenna increases at a rate proportionate to its input power. This paper focuses on the 2-covered path problem in which antennas have discrete transmission power levels. Given a set of n antennas with m available radii, a source point A and a destination B on the plane, we propose three power-aware methods that construct the 2-covered paths between endpoints A and B. These methods are called 2-covered area stretching planning (TASP), and radii shrinking planning (RSP) to reduce power consumption. RSP and TASP are polynomial-time algorithms and save energy up to 96% of that achieved by optimum solutions.
Publisher
Trans Tech Publications, Ltd.
Reference11 articles.
1. M. Abellanas, A. Bajuelos, G. Hernández, I. Matos: Good illumination with limited visibility, Proc. of the International Conference of Numerical Analysis and Applied Mathematics, pp.35-38, (2005).
2. M. Abellanas, A. Bajuelos, G. Hernández, I. Matos, B. Palop: Minimum illumination range voronoi diagrams, Proc. of the 2nd International Symposium on Voronoi Diagrams in Science and Engineering, pp.231-238, (2005).
3. M. Abellanas, A. L. Bajuelos, I. Matos: 2-Covered paths by a set of antennas with minimum power transmission range, Information Processing Letters, Volume 109, Issue 14, pp.768-773, (2009).
4. A. Agnetis, E. Grande, P. B. Mirchandani, A. Pacifici: Covering a line segment with variabledius discs, Computers and Operations Research, 36 (5), pp.1423-1436, (2009).
5. G. Alexandris, I. Giannikos: A new model for maximal coverage exploiting GIS capabilities, European Journal of Operational Research, 202, pp.328-338, (2010).