Fault-tolerant relay node placement in wireless sensor networks

  • Authors:
  • Hai Liu;Peng-Jun Wan;Xiaohua Jia

  • Affiliations:
  • Department of Computer Science, City University of Hong Kong, Hong Kong, P.R. China;Department of Computer Science, City University of Hong Kong, Hong Kong, P.R. China;Department of Computer Science, City University of Hong Kong, Hong Kong, P.R. China

  • Venue:
  • COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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