Author_Institution :
Dept. of Comput. & Inf. Sci., Delaware Univ., Newark, DE
Abstract :
A wireless sensor network consists of many low-cost, low-power sensor nodes, which can perform sensing, simple computation, and transmission of sensed information. Long distance transmission by sensor nodes is not energy efficient since energy consumption is a superlinear function of the transmission distance. One approach to prolonging network lifetime while preserving network connectivity is to deploy a small number of costly, but more powerful, relay nodes whose main task is communication with other sensor or relay nodes. In this paper, we assume that sensor nodes have communication range r>0, while relay nodes have communication range Rgesr, and we study two versions of relay node placement problems. In the first version, we want to deploy the minimum number of relay nodes so that, between each pair of sensor nodes, there is a connecting path consisting of relay and/or sensor nodes. In the second version, we want to deploy the minimum number of relay nodes so that, between each pair of sensor nodes, there is a connecting path consisting solely of relay nodes. We present a polynomial time 7-approximation algorithm for the first problem and a polynomial time (5+epsi)-approximation algorithm for the second problem, where epsi>0 can be any given constant
Keywords :
computational complexity; wireless sensor networks; communication range; energy consumption; polynomial time approximation algorithms; relay node placement problems; wireless sensor networks; Approximation algorithms; Clustering algorithms; Computer networks; Energy consumption; Energy efficiency; Joining processes; Polynomials; Protective relaying; Relays; Wireless sensor networks; Relay node placement; approximation algorithms.; wireless sensor networks;
