Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
The paper addresses the relay node placement probleM in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum number of relay nodes to forward data packets from sensor nodes to the sink, such that: 1) the network is connected, 2) the network is 2-connected. For case one, we propose a (6 + ∈)approximation algorithm for any ∈ > 0 with polynomial running time when e is fixed. For case two, we propose two approximation algorithms with (24 + ∈) and (6/T+ 12 + ∈), respectively, where T is the ratio of the number of relay nodes placed in case one to the number of sensors.
sensor networks fault-tolerant relay node placement
Hai Liu Peng-Jun Wan Xiaohua Jia
Department of Computer Science, City University of Hong Kong Tat Chee Avenue, Kowloon, Hong Kong, P.R. China
国际会议
The 11th Annual International Computing and Combinatorics Conference COCOON 2005(第11届国际计算和组合会议)
昆明
英文
230-239
2005-08-01（万方平台首次上网日期，不代表论文的发表时间）