scholarly journals Research on the Difficulty of Mobile Node Deployment’s Self-Play in Wireless Ad Hoc Networks Based on Deep Reinforcement Learning

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Huitao Wang ◽  
Ruopeng Yang ◽  
Changsheng Yin ◽  
Xiaofei Zou ◽  
Xuefeng Wang
Keyword(s):  
Reinforcement Learning ◽  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Node ◽  
Machine Learning Algorithms ◽  
Mobile Nodes ◽  
Sample Data ◽  
Hoc Networks ◽  
Dynamic Updating

Deep reinforcement learning is one kind of machine learning algorithms which uses the maximum cumulative reward to learn the optimal strategy. The difficulty is how to ensure the fast convergence of the model and generate a large number of sample data to promote the model optimization. Using the deep reinforcement learning framework of the AlphaZero algorithm, the deployment problem of wireless nodes in wireless ad hoc networks is equivalent to the game of Go. A deployment model of mobile nodes in wireless ad hoc networks based on the AlphaZero algorithm is designed. Because the application scenario of wireless ad hoc network does not have the characteristics of chessboard symmetry and invariability, it cannot expand the data sample set by rotating and changing the chessboard orientation. The strategy of dynamic updating learning rate and the method of selecting the latest model to generate sample data are used to solve the problem of fast model convergence.

scholarly journals A Survey on Applications of Reinforcement Learning in Flying Ad-Hoc Networks

Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 449
Author(s):  
Sifat Rezwan ◽  
Wooyeol Choi
Keyword(s):  
Reinforcement Learning ◽  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocol ◽  
Traffic Congestion ◽  
Ad Hoc ◽  
High Mobility ◽  
Flight Trajectory ◽  
Research Issues ◽  
Hoc Networks

Flying ad-hoc networks (FANET) are one of the most important branches of wireless ad-hoc networks, consisting of multiple unmanned air vehicles (UAVs) performing assigned tasks and communicating with each other. Nowadays FANETs are being used for commercial and civilian applications such as handling traffic congestion, remote data collection, remote sensing, network relaying, and delivering products. However, there are some major challenges, such as adaptive routing protocols, flight trajectory selection, energy limitations, charging, and autonomous deployment that need to be addressed in FANETs. Several researchers have been working for the last few years to resolve these problems. The main obstacles are the high mobility and unpredictable changes in the topology of FANETs. Hence, many researchers have introduced reinforcement learning (RL) algorithms in FANETs to overcome these shortcomings. In this study, we comprehensively surveyed and qualitatively compared the applications of RL in different scenarios of FANETs such as routing protocol, flight trajectory selection, relaying, and charging. We also discuss open research issues that can provide researchers with clear and direct insights for further research.

scholarly journals Optimally-balanced Hash Tree Generation in Ad Hoc Networks

2011 ◽  
Vol 6 (1) ◽  
Author(s):  
Vijay Ram Ghorpade ◽  
Yashwant V. Joshi ◽  
Ramchandra R. Manthalkar
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Node ◽  
Public Key ◽  
Mobile Nodes ◽  
Tree Structures ◽  
Tree Generation ◽  
Balanced Structure ◽  
Hoc Networks ◽  
Specific Number

Ideally a hash tree is a perfect binary tree with leaves equal to power of two. Each leaf node in this type of tree can represent a mobile node in an ad hoc network. Each leaf in the tree contains hash value of mobile node’s identification (ID) and public key (PK). Such a tree can be used for authenticating PK in ad hoc networks. Most of the previous works based on hash tree assumed perfect hash tree structures, which can be used efficiently only in networks with a specific number of mobile nodes. Practically the number of mobile nodes may not be always equal to a power of two and the conventional algorithms may result in an inefficient tree structure. In this paper the issue of generating a hash tree is addressed by proposing an algorithm to generate an optimally-balanced structure for a complete hash tree. It is demonstrated through both the mathematical analysis and simulation that such a tree is optimally-balanced and can efficiently be used for public key authentication in ad hoc networks.

scholarly journals Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
HyungJune Lee
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobile Node ◽  
Network Services ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Packet Delivery ◽  
Hoc Networks ◽  
Ad Hoc Sensor Networks

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

Energy Conservation Issues and Challenges in MANETs

2012 ◽  
pp. 291-318 ◽  
Author(s):  
Niranjan Kumar Ray ◽  
Ashok Kumar Turuk
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Efficient Design ◽  
Mobile Nodes ◽  
Big Picture ◽  
Management Techniques ◽  
Hoc Networks ◽  
Battery Technology

Energy efficiency is a major issue of concern in wireless ad hoc networks as mobile nodes rely on batteries, which are limited sources of energy, and, in many environments, it is quite a cumbersome task to replace or recharge them. Despite the progress made in battery technology, the lifetime of battery powered devices continues to be a key challenge, requiring additional research on efficient design of platforms, protocols, and systems. Many tangible efforts are made by many researchers to reduce the power consumption at protocol level by designing an energy efficient protocol to prolong the lifetime of the networks. The main focus of this chapter is to present a comprehensive analysis of energy efficient techniques in wireless ad hoc networks, integrating various issues and challenges to provide a big picture in this area. This chapter addresses energy management techniques in wireless ad hoc networks, especially in decentralized ad hoc environments.

A Rendezvous-Location Based Multicast Secure Communication in Ad Hoc Networks

2010 ◽  
Vol 121-122 ◽  
pp. 657-662
Author(s):  
Tzu Chiang Chiang ◽  
Hua Yi Lin ◽  
Jia Lin Chang
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Key Management ◽  
Secure Communication ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Group Key Management ◽  
Mobile Nodes ◽  
Hoc Networks ◽  
Wireless Infrastructure

Mobile ad-hoc networking (MANET) is a collection of mobile nodes that want to communicate to each others, but has no fixed links like wireless infrastructure networks to provide group applications and services. Therefore we need concern about providing each node with a secure and efficient key management system for dynamically discovering other nodes which can directly communicate with. Due to the network topology of an ad hoc network changes frequently and unpredictable, so the security of multicast routing becomes more challenging than the traditional networks. In this paper, we describe how any users in the multicast group can compose the group keys and propose a hierarchical group key management to securely multicast data from the multicast source to the rest of the multicast members in wireless ad hoc networks. This approach has a hierarchical structure where the group members are partitioned into rendezvous-location based clusters which can reduce the cost of key management. It not only provides the multicast routing information, but also fits the robustness of the wireless networks and reduces the overhead for the security management.

scholarly journals Optimized Adaptive Back off Algorithm for Static and Mobile Wireless Ad hoc Networks

2020 ◽  
Vol 8 (5) ◽  
pp. 998-1002
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Medium Access ◽  
Mobile Wireless ◽  
Backoff Algorithm ◽  
Hoc Networks ◽  
Packet Drop

In wireless ad hoc networks with stationary and portable nodules situation, planning a backoff procedure is decisive to evade impact and to increase the act of nodules. Majority of the Medium Access Control (MAC) etiquettes intended for ad hoc networks take up stationary nodules situation. In this paper, an Optimized Adaptive Backoff Algorithm (OABA) is proposed for static and mobile wireless ad hoc networks. In this algorithm, during the back off stage, the type of node is determined as static or mobile. For mobile nodes, their residence time is determined in addition to their priority. Then optimized adaptive backoff algorithm is applied, by checking the type of node. Simulation results have shown that OABA achieves higher delivery ratio with minimized delay, packet drop and energy consumption.

Sign in / Sign up

Export Citation Format

Share Document