Fault-tolerant relay node placement in wireless sensor networks: formulation and approximation

A two-tiered network model has been proposed for prolonging lifetime and improving scalability in wireless sensor networks (Gupta, G. and Younis, M., Proc. IEEE WCNC'03, p.1579-84, 2003; Proc. IEEE ICC'03, p.1848-52, 2003). This two-tiered network is a cluster-based network. Relay nodes are placed in the playing field to act as cluster heads and to form a connected topology for data transmission in the higher tier. They are able to fuse data packets from sensor nodes in their clusters and send them to sinks through wireless multi-hop paths. However, this model is not fault-tolerant as the network may be disconnected if a relay node fails. We formulate and study a fault-tolerant relay node placement problem in wireless sensor networks. In this problem, we want to place a minimum number of relay nodes in the playing field of a sensor network such that (1) each sensor node can communicate with at least two relay nodes and (2) the relay node network is 2-connected. We present a polynomial time approximation algorithm for this problem and prove the worst-case performance given by our algorithm is bounded within O(D log n) times of the size of an optimal solution, where n is the number of sensor nodes in the network, D is the (2, 1) diameter of the network formed by a sufficient set of possible positions for relay nodes.

[1]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[2]  Jianping Pan,et al.  Topology control for wireless sensor networks , 2003, MobiCom '03.

[3]  Eytan Modiano,et al.  Minimum energy disjoint path routing in wireless ad-hoc networks , 2003, MobiCom '03.

[4]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[5]  Krishna M. Sivalingam,et al.  Data Gathering Algorithms in Sensor Networks Using Energy Metrics , 2002, IEEE Trans. Parallel Distributed Syst..

[6]  Mohamed F. Younis,et al.  Fault-tolerant clustering of wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[7]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[8]  Mohamed F. Younis,et al.  Load-balanced clustering of wireless sensor networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[9]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[10]  Guohui Lin,et al.  Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length , 1999, Inf. Process. Lett..

[11]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[12]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[13]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[14]  Mani B. Srivastava,et al.  Topology management for sensor networks: exploiting latency and density , 2002, MobiHoc '02.