2-Connected relay placement problem in wireless sensor networks

Author

Wang, Wei-Lun ; Liou, Bang-Heng ; Solomon, Aaron

Author_Institution

Comput. Sci. & Inf. Eng., Nat. Chi Nan Univ., Nantou, Taiwan

fYear

2012

fDate

16-18 May 2012

Firstpage

19

Lastpage

24

Abstract

This paper addresses a more reliable and fault-tolerant version of the standard relay placement problem (RPP) in the design and deployment of wireless sensor networks. Given a set of sensors in a Euclidean plane, the 2-connected relay placement problem (2CRPP) is to place minimum number of relays such that each sensor can communicate with at least one relay, and all relays jointly form a 2-connected network. Since 2CRPP is proven to be NP-hard, in this paper we proposed a polynomial time approximation algorithm for the problem and mathematically proved that its approximation ratio is bound by (4+ε), in the worst case.

Keywords

computational complexity; polynomial approximation; wireless sensor networks; 2-connected network; 2-connected relay placement problem; 2CRPP; Euclidean plane; NP-hard problem; RPP; approximation ratio; fault-tolerant version; polynomial time approximation algorithm; standard relay placement problem; wireless sensor networks; Algorithm design and analysis; Approximation algorithms; Approximation methods; Intelligent sensors; Relays; Wireless sensor networks; 2-connected; 2CRPP; Approximation algorithm; Fault-tolerant; RPP; Relay placement; Sensor network;

fLanguage

English

Publisher

ieee

Conference_Titel

Digital Information and Communication Technology and it's Applications (DICTAP), 2012 Second International Conference on

Conference_Location

Bangkok

Print_ISBN

978-1-4673-0733-8

Type

conf

DOI

10.1109/DICTAP.2012.6215372

Filename

6215372