Ant colony optimization based polymorphism-aware routing algorithm for AdHoc UAV network

被引：1
|
作者：
Sun M. [1 ,2 ]
Zhou L. [1 ]
Yu Y. [1 ]
Gu J. [3 ]
机构：
[1] Air and Missile Defense College, Air Force Engineering University, Xi'an
[2] Unit 93861 of the PLA, Xianyang
[3] Unit 32272 of the PLA, Lanzhou
来源：
Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics | 2021年 / 43卷 / 09期
关键词：
AdHoc unmanned aerial vehicle (UAV) network; Ant colony algorithm; Congestion level of route; Dynamic source routing algorithm; Polymorphism-aware; Stability of route;
D O I：
10.12305/j.issn.1001-506X.2021.09.24
中图分类号：
学科分类号：
摘要：
AdHoc unmanned aerial vehicle (UAV) network is characterized for its high node mobility, fast changing network topology, high frequency of interchanging data and complex application environment. The performances of traditional routing algorithms are so bad over aspects such as transmitting delay, packet loss rate and routing overhead that they cannot provide efficient communication for multi-UAVs carrying out missions synergistically. To solve the problems, an ant colony optimization based polymorphism-aware routing (APAR) algorithm is proposed. This algorithm integrates ant colony optimization algorithm and dynamic source routing algorithm, and the level of pheromone in routes, which are gained in routing discovery process, is chosen as a standard to choose route and calculated by sensing the distance, the congestion level, and the stability of a route. A new volatilization mechanism of pheromone is also introduced to the algorithm. Meanwhile, the algorithm can make adjustment to the variance of UAV formation to prevent the compromise of the network performance. The simulation results show that compared with traditional algorithms the APAR algorithm improves the data packet transmission ratio, reduces the average end to end delay, reduces the routing overhead and has reliability in battlefield environment. © 2021, Editorial Office of Systems Engineering and Electronics. All right reserved.
引用
收藏
页码：2562 / 2572
页数：10
相关论文
共 35 条
  • [1] PERKINS C E, WATSON T J., Highly dynamic destination sequenced distance vector routing (DSDV) for mobile computers, Proc.of the ACM SIGCOMM Conference on Communications Architectures, pp. 234-255, (1994)
  • [2] PEI G, GERLA M, CHEN T W., Fish eye state routing: a routing scheme for ad hoc wireless networks, Proc.of the IEEE International Conference on Communications, (2000)
  • [3] GARCIA-LUNA-ACEVES J J, MARCELO S C., Source-tree routing in wireless networks, Proc.of the 7th Annual International Conference on Network Protocols, pp. 273-282, (1999)
  • [4] CLAUSEN T., Optimized link state routing protocol, Proc.of the IEEE International Multitopics Conference, (2001)
  • [5] MURTHY J J, GARCIA L A., A routing protocol for packet radio networks, Proc.of the 1st Annual ACM International Conference on Mobile Computing and Networking, pp. 86-95, (1995)
  • [6] BELLUR B., Topology dissemination based on reverse-path forwarding (TBRPF), Proceedings of IEEE International Publication, 4, 5, pp. 44-56, (2003)
  • [7] PERKINS C, ROYER E., AdHoc on demand distance vector (AODV) routing, Proc.of the IEEE 2nd Workshop on Mobile Computing Systems and Applications, pp. 90-100, (1999)
  • [8] JOHNSON D B, MALTZ A D, BROCH J., DSR: the dynamic source routing protocol for multi-hop wireless adHoc networks, AdHoc Networking, 5, pp. 139-172, (2001)
  • [9] PEI G, GERLA M, HONG X., A wireless hierarchical routing protocol with group mobility, Proc.of the IEEE Wireless Communications and Networking, pp. 1538-1542, (1999)
  • [10] DUBE R, RAIS C D, WANG K Y, Et al., Signal stability based adaptive routing(SSA)for ad hoc mobile networks, IEEE Personal Communications Magazine, 4, 1, pp. 36-45, (1997)
1234