TY - JOUR
T1 - Opportunistic Routing with Available Bandwidth Assurance for High Dynamic UAV Swarms
AU - Li, Zhi Lin
AU - Lei, Lei
AU - Shen, Gao Qing
N1 - Publisher Copyright:
© Published under licence by IOP Publishing Ltd.
PY - 2019/5/8
Y1 - 2019/5/8
N2 - The reconstruction of routing schemes constitutes an important quality of service (QoS) support for UAV swarms to keep their applications and services stable and active. In this paper, we develop a forwarding distance and available bandwidth (AB) estimation based opportunistic routing (FD-ABOR) protocol for high dynamic UAV swarms. We first improve the AB estimation algorithm for multi-hop UAV ad hoc networks by taking full account of the disparity between the sending and receiving ability and reconsidering the bandwidth consumption induced by hidden nodes. Secondly, we propose the scheme that the sender broadcast the RTS frame piggybacked with available bandwidth information for route request. Based on available bandwidth and forwarding distance, neighbour node decides it to be the candidate forwarder and computes the forwarding priority, then competes with each other to forward data packets. The simulation results show that our method outperforms AODV and DSR in terms of throughput and packet delivery ratio.
AB - The reconstruction of routing schemes constitutes an important quality of service (QoS) support for UAV swarms to keep their applications and services stable and active. In this paper, we develop a forwarding distance and available bandwidth (AB) estimation based opportunistic routing (FD-ABOR) protocol for high dynamic UAV swarms. We first improve the AB estimation algorithm for multi-hop UAV ad hoc networks by taking full account of the disparity between the sending and receiving ability and reconsidering the bandwidth consumption induced by hidden nodes. Secondly, we propose the scheme that the sender broadcast the RTS frame piggybacked with available bandwidth information for route request. Based on available bandwidth and forwarding distance, neighbour node decides it to be the candidate forwarder and computes the forwarding priority, then competes with each other to forward data packets. The simulation results show that our method outperforms AODV and DSR in terms of throughput and packet delivery ratio.
UR - http://www.scopus.com/inward/record.url?scp=85067689655&partnerID=8YFLogxK
U2 - 10.1088/1742-6596/1187/4/042080
DO - 10.1088/1742-6596/1187/4/042080
M3 - Conference article
AN - SCOPUS:85067689655
SN - 1742-6588
VL - 1187
JO - Journal of Physics: Conference Series
JF - Journal of Physics: Conference Series
IS - 4
M1 - 042080
T2 - 2018 International Symposium on Power Electronics and Control Engineering, ISPECE 2018
Y2 - 28 December 2018 through 30 December 2018
ER -