No abstract

No abstract

No abstract

No 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.