Assessment of Indicators for Updating Adjacency Matrix of Self-Organizing Flying Ad Hoc Network

Abstract

The concept of a swarm of drones assumes the presence of a wireless ad hoc network, in which drones are network nodes and exchanging information with each other. This article is devoted to studying the behavior of an ad hoc network in a transient mode and assessing the characteristics of updating local adjacency matrices (LAM), which allow network nodes to autonomously form packet transmission routes. Using a simulation model, a comparison was made of two multiple access methods to a common data transmission channel in the process of updating matrices: cyclic and random (slotted ALOHA). The simulation results made it possible to determine areas of their effective application: slotted ALOHA is advisable to use with relatively high probabilities of packet distortion (of the order of 0.1 and higher), a numerous nodes (more than 40), and low network connectivity, and cyclic access (CA) is effective at a low level of distortion. It is shown that the completion of the process of updating adjacency matrices (AM) can be judged by such indicators of the exchange of routing information as the achievement of a certain threshold of the number of transmissions and a decrease in the level of network traffic.

Keywords

• Unmanned aerial vehicle
• Swarm
• Flying Ad Hoc Network
• Adjacency matrix
• Cyclic access
• Slotted ALOHA