Relay movement control for maintaining connectivity in aeronautical ad hoc networks

Abstract

As a new sort of mobile ad hoc network (MANET), aeronautical ad hoc network (AANET) has fleet-moving airborne nodes (ANs) and suffers from frequent network partitioning due to the rapid-changing topology. In this work, the additional relay nodes (RNs) is employed to repair the network and maintain connectivity in AANET. As ANs move, RNs need to move as well in order to re-establish the topology as quickly as possible. The network model and problem definition are firstly given, and then an online approach for RNs’ movement control is presented to make ANs achieve certain connectivity requirement during run time. By defining the minimum cost feasible moving matrix (MCFM), a fast algorithm is proposed for RNs’ movement control problem. Simulations demonstrate that the proposed algorithm outperforms other control approaches in the highly-dynamic environment and is of great potential to be applied in AANET.

Keywords

aeronautical ad hoc network (AANET) / mobile ad hoc networks / topology control / network connectivity / movement control

References

[1] SakhaeeE, JamalipourA. The global in-flight internet [J]. IEEE Journal on Selected Areas in Communications, 2006, 24(9): 1748-1757

[2] SakhaeeE, JamalipourA, KatoN. Aeronautical ad hoc networks [C]. Proceedings of the Wireless Communications and Networking Conference. Las Vegas, USA: IEEE, 2006246-251

[3] KarrasK, KyritsisT, AmirfeizM. Aeronautical mobile ad hoc networks [C]. Proceedings of the 14th European Wireless Conference. Hong Kong: IEEE, 20081-6

[4] SchnellM, ScaliseS. NEWSKY—A concept for networking the sky for civil aeronautical communications [J]. Space Communications, 2008, 21(3): 157-166

[5] KwakK J, SagduyuY, DengJ, YackoskiJ, LiJ. Airborne network evaluation: Challenges and high fidelity emulation solution [C]. Proceedings of The First ACM MobiHoc Workshop on Airborne Networks and Communications. Hilton Head, South Carolina, USA: ACM, 201249-54

[6] FallK. A delay-tolerant network architecture for challenged internets [C]. Proceedings of ACM International Conference on the Applications, Technologies, Architectures, and Protocols for Computer Communication. Karlsruhe, Germany: ACM, 200327-34

[7] AzizA A, SekerciogluY A, FitzpatrickP, IvanovichM. A survey on distributed topology control techniques for extending the lifetime of battery powered wireless sensor networks [J]. IEEE Communications Surveys & Tutorials, 2013, 15(1): 121-144

[8] NishiyamaH, NgoT, AnsariN, KatoN. On minimizing the impact of mobility on topology control in mobile ad hoc networks [J]. IEEE Transactions on Wireless Communications, 2012, 11(3): 1158-1166

[9] DasS, LiuH, NayakA, StojmenovicI. A localized algorithm for bi-connectivity of connected mobile robots [J]. Telecommunication Systems, 2009, 40(3): 129-140

[10] NigamA, AgarwalY K. Optimal relay node placement in delay constrained wireless sensor network design [J]. European Journal of Operational Research, 2014, 233(1): 220-233

[11] KashyapA, KhullerS, ShaymanM. Relay placement for fault tolerance in wireless networks in higher dimensions [J]. Computational Geometry, 2011, 44(4): 206-215

[12] RohrerJ P, JabbarA, CetinkayaE K, PerrinsE, SterbenzJ P. Highly-dynamic cross-layered aeronautical network architecture [J]. IEEE Transactions on Aerospace and Electronic System, 2011, 47(4): 2742-2765

[13] OuyangJ, ZhuangY, LinM, LiuJia. Optimization of beamforming and path planning for UAV-assisted wireless relay networks [J]. Chinese Journal of Aeronautics, 2014, 27(2): 313-320

[14] KashyapA, ShaymanM. Relay placement and movement control for realization of fault-tolerant ad hoc networks [C]. Proceedings of the 41st Annual Conference on Information Sciences and Systems. Baltimore, MD, USA: IEEE, 2007783-788

[15] SenturkI F, AkkayaK, YilmazS. Relay placement for restoring connectivity in partitioned wireless sensor networks under limited information [J]. Ad Hoc Networks, 2014, 13: 487-503

[16] LinG H, XueG. Steiner tree problem with minimum number of Steiner points and bounded edge-length [J]. Information Processing Letters, 1999, 69: 53-57

[17] DegenerB, FeketeS P, KempkesB. A survey on relay placement with runtime and approximation guarantees [J]. Computer Science Review, 2011, 5(1): 57-68

[18] CheriyanJ, VempalaS, VettaA. Approximation algorithms for minimum-cost k-vertex connected subgraphs [C]. Proceedings of the 34th Annual ACM Symposium on Theory of Computing. Montreal, Quebec, Canada: ACM, 2002306-312

[19] WestD BIntroduction to graph theory [M], 2000125-130

[20] BredinJ L, DemaineE D, HajiaghayiM T, RusD. Deploying sensor networks with guaranteed fault tolerance [J]. IEEE/ACM Transactions on Networking, 2010, 18(1): 216-228

[21] OpenSim Ltd.. OMNET++ [EB/OL].[2015-01-30]. http://www.omnetpp.org.

[22] CampT, BolengJ, DaviesV. A survey of mobility models for ad hoc networks research [J]. Wireless Communications and Mobile Computing, 2002, 2(5): 483-502