Fluctuation control for many-to-one routing in wireless sensor networks

Abstract This paper presents a distributed and adaptive fluctuation control scheme for many-to-one routing (FCM) in wireless sensor networks. Unlike well-known topology control schemes, the primary design objective is to reduce the fluctuation which happens due to overload of sensors in a data collection tree. More specifically, an estimation model of a sensor available capacity based on the number of its neighbors is proposed. In addition, this paper proposes a parent selection mechanism by three-way handshake. With such model and the selection mechanism, it is ensured that the load of a sensor does not exceed its available capacity. Finally, an adaptive maintenance mechanism is proposed to adjust the estimation of a sensor available capacity as the network environment changes. Simulation results demonstrate the effectiveness of the scheme.

[1]  Capacity of Data Collection in Arbitrary Wireless Sensor Networks , 2012, IEEE Trans. Parallel Distributed Syst..

[2]  Robert Tappan Morris,et al.  Performance of multihop wireless networks: shortest path is not enough , 2003, CCRV.

[3]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[4]  Pramod K. Varshney,et al.  Traffic management in wireless sensor networks: Decoupling congestion control and fairness , 2012, Comput. Commun..

[5]  Ying Jun.  Resource allocation and transmission scheduling for wireless networks:an overview , 2009 .

[6]  Martin Heusse,et al.  Performance anomaly of 802.11b , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Philip Levis,et al.  Four-Bit Wireless Link Estimation , 2007, HotNets.

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

[9]  Mingyan Liu,et al.  Data-gathering wireless sensor networks: organization and capacity , 2003, Comput. Networks.

[10]  David E. Culler,et al.  A transmission control scheme for media access in sensor networks , 2001, MobiCom '01.

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

[12]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[13]  Anish Arora,et al.  The mote connectivity protocol , 2003, Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712).

[14]  Liu Jing,et al.  A relay node selection technique for opportunistic routing in mobile Ad Hoc networks , 2009, 2009 15th Asia-Pacific Conference on Communications.

[15]  Rami Mochaourab,et al.  topology control protocol based on eligibility and efficiency metrics , 2010 .

[16]  Ruzena Bajcsy,et al.  Congestion control and fairness for many-to-one routing in sensor networks , 2004, SenSys '04.

[17]  H. Balakrishnan,et al.  Mitigating congestion in wireless sensor networks , 2004, SenSys '04.

[18]  Philip Levis,et al.  Collection tree protocol , 2009, SenSys '09.

[19]  Chenyang Lu,et al.  Robust topology control for indoor wireless sensor networks , 2008, SenSys '08.

[20]  Hongwei Zhang,et al.  Reliable bursty convergecast in wireless sensor networks , 2007, Comput. Commun..

[21]  Ramesh Govindan,et al.  RCRT: rate-controlled reliable transport for wireless sensor networks , 2007, SenSys '07.

[22]  Guoliang Xing,et al.  Localized and Configurable Topology Control in Lossy Wireless Sensor Networks , 2007, 2007 16th International Conference on Computer Communications and Networks.