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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2020/6699515 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832567760731766784 |
|---|---|
| author | Boya Liu Xiaobo Zhou |
| author_facet | Boya Liu Xiaobo Zhou |
| author_sort | Boya Liu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-d7cd9ec8de4e488ab62fc4f155ea6a76 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-d7cd9ec8de4e488ab62fc4f155ea6a762025-02-03T01:00:40ZengWileyComplexity1076-27871099-05262020-01-01202010.1155/2020/66995156699515Topology Optimization of Interactive Visual Communication Networks Based on the Non-Line-of-Sight Congestion Control AlgorithmBoya Liu0Xiaobo Zhou1Department of Journalism and Media, Chongqing Normal University, Chongqing 401331, ChinaFilm and Television Animation Department, Sichuan Fine Arts Institute, Chongqing 401331, ChinaIn 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.http://dx.doi.org/10.1155/2020/6699515 |
| spellingShingle | Boya Liu Xiaobo Zhou Topology Optimization of Interactive Visual Communication Networks Based on the Non-Line-of-Sight Congestion Control Algorithm Complexity |
| title | Topology Optimization of Interactive Visual Communication Networks Based on the Non-Line-of-Sight Congestion Control Algorithm |
| title_full | Topology Optimization of Interactive Visual Communication Networks Based on the Non-Line-of-Sight Congestion Control Algorithm |
| title_fullStr | Topology Optimization of Interactive Visual Communication Networks Based on the Non-Line-of-Sight Congestion Control Algorithm |
| title_full_unstemmed | Topology Optimization of Interactive Visual Communication Networks Based on the Non-Line-of-Sight Congestion Control Algorithm |
| title_short | Topology Optimization of Interactive Visual Communication Networks Based on the Non-Line-of-Sight Congestion Control Algorithm |
| title_sort | topology optimization of interactive visual communication networks based on the non line of sight congestion control algorithm |
| url | http://dx.doi.org/10.1155/2020/6699515 |
| work_keys_str_mv | AT boyaliu topologyoptimizationofinteractivevisualcommunicationnetworksbasedonthenonlineofsightcongestioncontrolalgorithm AT xiaobozhou topologyoptimizationofinteractivevisualcommunicationnetworksbasedonthenonlineofsightcongestioncontrolalgorithm |