Enhancing drone network resilience: Investigating strategies for k-connectivity restoration

Asci M., Dagdeviren Z. A., AKRAM V., Yıldız H. U., DAĞDEVİREN O., Tavli B.

Computer Standards and Interfaces, cilt.92, 2025 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 92
  • Basım Tarihi: 2025
  • Doi Numarası: 10.1016/j.csi.2024.103941
  • Dergi Adı: Computer Standards and Interfaces
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Linguistic Bibliography, Metadex, Civil Engineering Abstracts
  • Anahtar Kelimeler: Drone networks, Graph theory, k-connectivity, Mathematical programming, Reliability
  • TED Üniversitesi Adresli: Evet

Özet

Drones have recently become more popular due to technological improvements that have made them useful in many other industries, including agriculture, emergency services, and military operations. Coordination of communication amongst drones is often required for the efficient performance of missions. With an emphasis on building robust k-connected networks and restoration procedures, this paper investigates the relevance of connection in drone swarms. Specifically, we tackle the k-connectivity restoration problem, which aims to create k-connected networks by moving the drones as little as possible. We propose four novel approaches, including an integer programming model, an integer programming-based heuristic approach, a node converging heuristic, and a cluster moving heuristic. Through extensive measurements taken from various drone networking setups, we provide a comparative analysis of the proposed approaches. Our evaluations reveal that the drone movements produced by the integer programming-based heuristics are nearly the same as the original mathematical formulation, whereas the other heuristics are favorable in terms of execution time.