Adaptive congestion avoidance scheme based on reinforcement learning for wireless sensor network

Author(s):  
Hu Tan ◽  
Lijun Zhao ◽  
Wei Liu ◽  
Yawen Niu ◽  
Chenglin Zhao
2007 ◽  
Vol E90-B (12) ◽  
pp. 3362-3372 ◽  
Author(s):  
Md. MAMUN-OR-RASHID ◽  
M. M. ALAM ◽  
Md. A. RAZZAQUE ◽  
C. S. HONG

Computing ◽  
2021 ◽  
Author(s):  
Ahmed Nawaz Khan ◽  
Muhammad Adnan Tariq ◽  
Muhammad Asim ◽  
Zakaria Maamar ◽  
Thar Baker

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Santosh Soni ◽  
Manish Shrivastava

Generally, wireless sensor network is a group of sensor nodes which is used to continuously monitor and record the various physical, environmental, and critical real time application data. Data traffic received by sink in WSN decreases the energy of nearby sensor nodes as compared to other sensor nodes. This problem is known as hot spot problem in wireless sensor network. In this research study, two novel algorithms are proposed based upon reinforcement learning to solve hot spot problem in wireless sensor network. The first proposed algorithm RLBCA, created cluster heads to reduce the energy consumption and save about 40% of battery power. In the second proposed algorithm ODMST, mobile sink is used to collect the data from cluster heads as per the demand/request generated from cluster heads. Here mobile sink is used to keep record of incoming request from cluster heads in a routing table and visits accordingly. These algorithms did not create the extra overhead on mobile sink and save the energy as well. Finally, the proposed algorithms are compared with existing algorithms like CLIQUE, TTDD, DBRkM, EPMS, RLLO, and RL-CRC to better prove this research study.


Author(s):  
Parag Verma ◽  
Ankur Dumka ◽  
Dhawal Vyas ◽  
Anuj Bhardwaj

A wireless sensor network is a collection of small sensor nodes that have limited energy and are usually not rechargeable. Because of this, the lifetime of wireless sensor networks has always been a challenging area. One of the basic problems of the network has been the ability of the nodes to effectively schedule the sleep and wake-up time to overcome this problem. The motivation behind node sleep or wake-up time scheduling is to take care of nodes in sleep mode for as long as possible (without losing data packet transfer efficiency) and thus extend their useful life. This research going to propose scheduling of nodes sleeps and wake-up time through reinforcement learning. This research is not based on the nodes' duty cycle strategy (which creates a compromise between data packet delivery and nodes energy saving delay) like other existing researches. It is based on the research of reinforcement learning which gives independence to each node to choose its own activity from the transmission of packets, tuning or sleep node in each time band which works in a decentralized way. The simulation results show the qualified performance of the proposed algorithm under different conditions.


Sign in / Sign up

Export Citation Format

Share Document