A Neural-Q-Learning Based Approach for Delay Tolerant Underwater Acoustic Wireless Sensor Networks

2014 ◽  
Vol 548-549 ◽  
pp. 1530-1535
Author(s):  
Lin Zou ◽  
De Feng Huang ◽  
Roberto Togneri

Delay tolerance is a major design concern for supporting underwater acoustic wireless sensor networks (UA-WSNs) to carry out tasks in harsh subsea environments. Due to the great difference between the underwater acoustic channel and the radio frequency channel, most of the existing routing protocols developed for terrestrial wireless sensor networks perform poorly in underwater acoustic communications. In this work, we present a Neural-Q-Learning algorithm based delay tolerant protocol for UA-WSNs. Due to the advantages of the artificial neural network along with the Q-Learning algorithm, the ferry node is capable of determining an optimal route in a two-dimensional continuous space to relay packets effectively and efficiently between sensors. Simulation results show that the delivery delay and delivery cost of the network significantly decrease by maximizing the meeting probability between the ferry node and sensors.

2019 ◽  
Vol 161 ◽  
pp. 138-149 ◽  
Author(s):  
Zhenchun Wei ◽  
Fei Liu ◽  
Yan Zhang ◽  
Juan Xu ◽  
Jianjun Ji ◽  
...  

2016 ◽  
Vol 63 (1) ◽  
pp. 89-97 ◽  
Author(s):  
Jose Anand ◽  
J. Raja Paul Perinbam ◽  
D. Meganathan

2017 ◽  
Vol 13 (7) ◽  
pp. 155014771771738 ◽  
Author(s):  
Min Wook Kang ◽  
Yun Won Chung

In delay-tolerant wireless sensor networks, messages for sensor data are delivered using opportunistic contacts between intermittently connected nodes. Since there is no stable end-to-end routing path like the Internet and mobile nodes operate on battery, an energy-efficient routing protocol is needed. In this article, we consider the probabilistic routing protocol using history of encounters and transitivity protocol as the base protocol. Then, we propose an energy-aware routing protocol in intermittently connected delay-tolerant wireless sensor networks, where messages are forwarded based on the node’s remaining battery, delivery predictability, and type of nodes. The performance of the proposed protocol is compared with that of probabilistic routing protocol using history of encounters and transitivity and probabilistic routing protocol using history of encounters and transitivity with periodic sleep in detail, from the aspects of delivery ratio, overhead ratio, delivery latency, and ratio of alive nodes. Simulation results show that the proposed protocol has better delivery probability, overhead ratio, and ratio of alive nodes, in most of the considered parameter settings, in spite of a small increase in delivery latency.


Sign in / Sign up

Export Citation Format

Share Document