Department of Computer ScienceThe George Washington University
Department of Computer ScienceThe University of Texas at Dallas
Department of Computer ScienceCity University of Hong Kong
School of Math. and Computer ScienceNanjing Normal University
Cite this article as:
Cheng, X., Du, D., Wang, L. et al. Wireless Netw (2008) 14: 347. doi:10.1007/s11276-006-0724-8
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum number of relay sensors such that the induced topology by all sensors is globally connected. This problem is motivated by practically considering the tradeoff among performance, lifetime, and cost when designing sensor networks. In our study, this problem is modelled by a NP-hard network optimization problem named Steiner Minimum Tree with Minimum number of Steiner Points and bounded edge length (SMT-MSP). In this paper, we propose two approximate algorithms, and conduct detailed performance analysis. The first algorithm has a performance ratio of 3 and the second has a performance ratio of 2.5.
Wireless sensor networksRelay sensorSteiner pointSMT-MSPTopology control