Dynamic Relay Node Placement in Wireless Sensor Networks

In this paper we present an online algorithm that attacks the problem of placing relay nodes in regions where high localized congestion is detected. Congestion refers to the network overload caused by excess concurrent attempts of wireless devices to access the common shared channel. Our algorithm uses the expected transmission delay (ETD) metric based on both current measurements and history observations over a window of time and is used by the nodes to identify the level of congestion in the local environment of the node. Our scheme uses a dissemination probing mechanism to exchange statistical local information periodically which are used to detect the congested area. Detailed simulation results illustrate the working and benefits of our approach.

[1]  Jangeun Jun,et al.  Theoretical maximum throughput of IEEE 802.11 and its applications , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[2]  Chieh-Yih Wan,et al.  CODA: congestion detection and avoidance in sensor networks , 2003, SenSys '03.

[3]  Halim Yanikomeroglu,et al.  On the scalability of relay based wireless networks , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[4]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[5]  Hai Liu,et al.  Fault-Tolerant Relay Node Placement in Wireless Sensor Networks , 2005, COCOON.

[6]  Jian Tang,et al.  Interference-aware topology control and QoS routing in multi-channel wireless mesh networks , 2005, MobiHoc '05.

[7]  Nitin H. Vaidya,et al.  Capacity of multi-channel wireless networks: impact of number of channels and interfaces , 2005, MobiCom '05.

[8]  Robert Tappan Morris,et al.  Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.

[9]  Kevin C. Almeroth,et al.  Understanding congestion in IEEE 802.11b wireless networks , 2005, IMC '05.

[10]  XueGuoliang,et al.  Relay Node Placement in Wireless Sensor Networks , 2007 .

[11]  Errol L. Lloyd,et al.  Relay Node Placement in Wireless Sensor Networks , 2011, IEEE Transactions on Computers.

[12]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2003, IEEE Trans. Wirel. Commun..

[13]  Srikanth V. Krishnamurthy,et al.  A rate control framework for supporting multiple classes of traffic in sensor networks , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[14]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[15]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[16]  Eytan Modiano,et al.  Mobile backbone networks --: construction and maintenance , 2006, MobiHoc '06.

[17]  V. Kalogeraki,et al.  Cluster-based congestion control for supporting multiple classes of traffic in sensor networks , 2005, The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II..

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

[19]  Jon Crowcroft,et al.  Siphon: overload traffic management using multi-radio virtual sinks in sensor networks , 2005, SenSys '05.

[20]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[21]  Krithi Ramamritham,et al.  Contour estimation using collaborating mobile sensors , 2006, DIWANS '06.

[22]  Satyajayant Misra,et al.  Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.