Spanner-Aware Relay Node Placement in Wireless Ad Hoc Sensor Networks

Relay node placement is an important issue because it greatly affects the performance of wireless ad hoc sensor networks. The pervious works mainly pay attentions on placing the minimum number of relay nodes to connect all the sensor nodes. But we find that this placement scheme may result in QoS reduction of the network, such as transmission delay, energy cost, etc. Therefore, this work studies the minimum relay node placement problem to guarantee both the connectivity and geometric spanner properties. We first show that there is no algorithm with the performance O(opt) for this problem, where opt is the minimum number of relay nodes to connect the sensor nodes. Thus, this paper presents an efficient placement algorithm MSGP with O(max{n, opt}) relay nodes, where n is the number of sensor nodes. Specially, if any two sensor nodes cannot communicate directly, the algorithm obtains O(1)-approximation bound. Then, as data gathering is one of the most important operations in sensor networks, we also study the spanner-aware placement problem for this communication scheme. The simulation results show the efficiency of the proposed algorithm. For example, MSGP algorithm can reach the spanner factor 3 with the additional 30% relay nodes compared with MST-based placement algorithm.

[1]  Tim Tau Hsieh.  Using sensor networks for highway and traffic applications , 2004, IEEE Potentials.

[2]  Pei-Ling Chiu,et al.  A near-optimal sensor placement algorithm to achieve complete coverage-discrimination in sensor networks , 2005, IEEE Communications Letters.

[3]  Giri Narasimhan,et al.  A Fast Algorithm for Constructing Sparse Euclidean Spanners , 1997, Int. J. Comput. Geom. Appl..

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

[5]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[6]  Giri Narasimhan,et al.  New sparseness results on graph spanners , 1992, SCG '92.

[7]  T. Shermer.  Recent Results in Art Galleries , 1992 .

[8]  Arunabha Sen,et al.  Relay node placement in large scale wireless sensor networks , 2006, Comput. Commun..

[9]  Lusheng Wang,et al.  Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, Theor. Comput. Sci..

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

[11]  T. C. Shermer,et al.  Recent results in art galleries (geometry) , 1992, Proc. IEEE.

[12]  Krishnendu Chakrabarty,et al.  Sensor placement for effective coverage and surveillance in distributed sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[13]  Yu-Chee Tseng,et al.  An integrated mobile surveillance and wireless sensor (iMouse) system and its detection delay analysis , 2005, MSWiM '05.

[14]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[15]  Giri Narasimhan,et al.  New sparseness results on graph spanners , 1995, Int. J. Comput. Geom. Appl..

[16]  Jenna Burrell,et al.  Vineyard computing: sensor networks in agricultural production , 2004, IEEE Pervasive Computing.

[17]  Satyajayant Misra,et al.  Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[18]  Yu-Chee Tseng,et al.  Wireless sensor networks for emergency navigation , 2006, Computer.

[19]  Lusheng Wang,et al.  Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.