Topology Optimization of Interactive Visual Communication Networks Based on the Non-Line-of-Sight Congestion Control Algorithm

In this paper, an in-depth study of interactive visual communication of network topology through non-line-of-sight congestion control algorithms is conducted to address the real-time routing problem of adapting to dynamic topologies, and a delay-constrained stochastic routing algorithm is proposed t...

Full description

Saved in:
Bibliographic Details
Published in:Complexity (New York, N.Y.) N.Y.), 2020, Vol.2020 (2020), p.1-11
Main Authors: Liu, Boya, Zhou, Xiaobo
Format: Article
Language:English
Subjects:
Big Data
Communication networks
Communications networks
Congestion
Control algorithms
Control theory
Data analysis
Delay
Flying platforms
Greedy algorithms
Ground stations
Interactive control
Line of sight communication
Network topologies
Nodes
Packets (communication)
Radio equipment
Relay
Science education
Topology optimization
Visual communication
Visualization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, an in-depth study of interactive visual communication of network topology through non-line-of-sight congestion control algorithms is conducted to address the real-time routing problem of adapting to dynamic topologies, and a delay-constrained stochastic routing algorithm is proposed to enable packets to reach GB within the delay threshold in the absence of end-to-end delay information while improving network throughput and reducing network resource consumption. The algorithm requires each sending node to select an available relay set based on the location of its neighbor nodes and channel state and computes transfer probabilities for each node in the relay set combining the remaining delay of the packet with the distance from the relay node to GB. Based on the obtained transfer probability and local channel state, the sending node passes the packet to the relay node. The convergence of the algorithm is proved and its performance is verified by simulation. The first part of the algorithm is based on the greedy algorithm to deploy and locate the network flying platform nodes with the goal of efficient coverage of the network flying platform nodes, considering the ground base station services. As the delay on each link varies due to the change of channel state, the source and relay nodes asynchronously update the data generation rate and the pairwise parameters based on the received local information and use the obtained optimal values to pass the packets to GB.
ISSN:1076-2787
1099-0526
DOI:10.1155/2020/6699515