• DocumentCode
    1972240
  • Title

    Adaptive learning solution for congestion avoidance in wireless sensor networks

  • Author

    Misra, Sudip ; Tiwari, Vivek ; Obaidat, Mohammad S.

  • Author_Institution
    Sch. of Inf. Technol., Indian Inst. of Technol., Kharagpur
  • fYear
    2009
  • fDate
    10-13 May 2009
  • Firstpage
    478
  • Lastpage
    484
  • Abstract
    One of the major challenges in wireless sensor network (WSN) research is to curb down congestion in the network´s traffic, without compromising with the energy of the sensor nodes. In this work, we address the problem of congestion in the nodes of a WSN using Learning Automata (LA)-based adaptive learning approach. Our primary objective, using this approach, is to adaptively make the processing rate (data packet arrival rate) in the nodes equal to the transmitting rate (packet service rate), so that the occurrence of congestion in the nodes is seamlessly avoided. We maintain that the proposed algorithm, named as Learning Automata-Based Congestion Avoidance Algorithm in Sensor Networks (LACAS), can counter the congestion problem in WSNs effectively. The results obtained through the experiments with respect to important performance criteria showed that the proposed algorithm is capable of successfully avoiding congestion in typical WSNs requiring a reliable congestion control mechanism.
  • Keywords
    learning automata; telecommunication congestion control; wireless sensor networks; adaptive learning solution; congestion avoidance; congestion control; data packet arrival rate; learning automata; wireless sensor networks; Automatic control; Computer science; Counting circuits; Information technology; Intelligent sensors; Learning automata; Telecommunication traffic; Terminology; USA Councils; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Systems and Applications, 2009. AICCSA 2009. IEEE/ACS International Conference on
  • Conference_Location
    Rabat
  • Print_ISBN
    978-1-4244-3807-5
  • Electronic_ISBN
    978-1-4244-3806-8
  • Type

    conf

  • DOI
    10.1109/AICCSA.2009.5069367
  • Filename
    5069367