Unmanned Aerial Vehicles(UAVs)in Flying Ad-Hoc Networks(FANETs)are widely used in both civilian and military fields,but they face severe security,trust,and privacy vulnerabilities due to their high mobility,dynamic to...Unmanned Aerial Vehicles(UAVs)in Flying Ad-Hoc Networks(FANETs)are widely used in both civilian and military fields,but they face severe security,trust,and privacy vulnerabilities due to their high mobility,dynamic topology,and open wireless channels.Existing security protocols for Mobile Ad-Hoc Networks(MANETs)cannot be directly applied to FANETs,as FANETs require lightweight,high real-time performance,and strong anonymity.The current FANETs security protocol cannot simultaneously meet the requirements of strong anonymity,high security,and low overhead in high dynamic and resource-constrained scenarios.To address these challenges,this paper proposes an Anonymous Authentication and Key Exchange Protocol(AAKE-OWA)for UAVs in FANETs based on OneWay Accumulators(OWA).During the UAV registration phase,the Key Management Center(KMC)generates an identity ticket for each UAV using OWA and transmits it securely to the UAV’s on-board tamper-proof module.In the key exchange phase,UAVs generate temporary authentication tickets with random numbers and compute the same session key leveraging the quasi-commutativity of OWA.For mutual anonymous authentication,UAVs encrypt random numbers with the session key and verify identities by comparing computed values with authentication values.Formal analysis using the Scyther tool confirms that the protocol resists identity spoofing,man-in-the-middle,and replay attacks.Through Burrows Abadi Needham(BAN)logic proof,it achieves mutual anonymity,prevents simulation and physical capture attacks,and ensures secure connectivity of 1.Experimental comparisons with existing protocols prove that the AAKE-OWA protocol has lower computational overhead,communication overhead,and storage overhead,making it more suitable for resource-constrained FANET scenarios.Performance comparison experiments show that,compared with other schemes,this scheme only requires 8 one-way accumulator operations and 4 symmetric encryption/decryption operations,with a total computational overhead as low as 2.3504 ms,a communication overhead of merely 1216 bits,and a storage overhead of 768 bits.We have achieved a reduction in computational costs from 6.3%to 90.3%,communication costs from 5.0%to 69.1%,and overall storage costs from 33%to 68%compared to existing solutions.It can meet the performance requirements of lightweight,real-time,and anonymity for unmanned aerial vehicles(UAVs)networks.展开更多
Flying ad hoc networks(FANETs),which are composed of unmanned aerial vehicles(UAVs),face severe quality-of-service(QoS)challenges because of their high mobility,rapidly changing topologies,and limited infrastructure s...Flying ad hoc networks(FANETs),which are composed of unmanned aerial vehicles(UAVs),face severe quality-of-service(QoS)challenges because of their high mobility,rapidly changing topologies,and limited infrastructure support.Conventional MAC protocols,such as contention-based CSMA/CA,often fail to guarantee low latency and high throughput under these conditions.To address these challenges,this paper investigates the MAC-layer QoS problem in FANETs and proposes a polling-based MAC protocol integrated with the IEEE 802.11 point coordination function(PCF).The protocol adopts a centralized scheduling mechanism using a master node to coordinate data transmission on the basis of a first-in-first-out(FIFO)policy.While this centralized approach simplifies coordination and reduces contention,it introduces limitations regarding scalability and robustness in decentralized or dynamic environments,which are common in FANET scenarios.To analyse protocol behavior,a polling system model is developed with three service strategies:Gated Service,Exhaustive Service,and Limited-1 Service.Analytical models are derived for queue length and delay,and MATLAB simulations validate the feasibility of the proposed scheme.The results show that despite its structural constraints,the proposed protocol can achieve a balance between throughput,delay,and fairness in specific mission-driven UAV applications,such as coordinated surveillance and real-time task distribution.Further research will explore decentralized adaptations to improve protocol flexibility and fault tolerance in dynamic UAV networks.展开更多
基金supported in part by National Natural Science Foundation of China(under Grant 61902163)the Jiangsu“Qing Lan Project”,Natural Science Foundation of the Jiangsu Higher Education Institutions of China(Major Research Project:23KJA520007)Postgraduate Research&Practice Innovation Program of Jiangsu Province(No.SJCX25_1303).
文摘Unmanned Aerial Vehicles(UAVs)in Flying Ad-Hoc Networks(FANETs)are widely used in both civilian and military fields,but they face severe security,trust,and privacy vulnerabilities due to their high mobility,dynamic topology,and open wireless channels.Existing security protocols for Mobile Ad-Hoc Networks(MANETs)cannot be directly applied to FANETs,as FANETs require lightweight,high real-time performance,and strong anonymity.The current FANETs security protocol cannot simultaneously meet the requirements of strong anonymity,high security,and low overhead in high dynamic and resource-constrained scenarios.To address these challenges,this paper proposes an Anonymous Authentication and Key Exchange Protocol(AAKE-OWA)for UAVs in FANETs based on OneWay Accumulators(OWA).During the UAV registration phase,the Key Management Center(KMC)generates an identity ticket for each UAV using OWA and transmits it securely to the UAV’s on-board tamper-proof module.In the key exchange phase,UAVs generate temporary authentication tickets with random numbers and compute the same session key leveraging the quasi-commutativity of OWA.For mutual anonymous authentication,UAVs encrypt random numbers with the session key and verify identities by comparing computed values with authentication values.Formal analysis using the Scyther tool confirms that the protocol resists identity spoofing,man-in-the-middle,and replay attacks.Through Burrows Abadi Needham(BAN)logic proof,it achieves mutual anonymity,prevents simulation and physical capture attacks,and ensures secure connectivity of 1.Experimental comparisons with existing protocols prove that the AAKE-OWA protocol has lower computational overhead,communication overhead,and storage overhead,making it more suitable for resource-constrained FANET scenarios.Performance comparison experiments show that,compared with other schemes,this scheme only requires 8 one-way accumulator operations and 4 symmetric encryption/decryption operations,with a total computational overhead as low as 2.3504 ms,a communication overhead of merely 1216 bits,and a storage overhead of 768 bits.We have achieved a reduction in computational costs from 6.3%to 90.3%,communication costs from 5.0%to 69.1%,and overall storage costs from 33%to 68%compared to existing solutions.It can meet the performance requirements of lightweight,real-time,and anonymity for unmanned aerial vehicles(UAVs)networks.
基金supported by Yang Zhijun’s Industry Innovation Talents Project of the Yunnan Xingdian Talents Support Plan(Certificate No.YNWR–CYJS–2020–017),formerly part of the Yunnan“Ten-Thousand Talents Plan”for industrial technology leadership.support of the Wu Zhonghai Expert Workstation of Yunnan Province(No.202305AF150045).
文摘Flying ad hoc networks(FANETs),which are composed of unmanned aerial vehicles(UAVs),face severe quality-of-service(QoS)challenges because of their high mobility,rapidly changing topologies,and limited infrastructure support.Conventional MAC protocols,such as contention-based CSMA/CA,often fail to guarantee low latency and high throughput under these conditions.To address these challenges,this paper investigates the MAC-layer QoS problem in FANETs and proposes a polling-based MAC protocol integrated with the IEEE 802.11 point coordination function(PCF).The protocol adopts a centralized scheduling mechanism using a master node to coordinate data transmission on the basis of a first-in-first-out(FIFO)policy.While this centralized approach simplifies coordination and reduces contention,it introduces limitations regarding scalability and robustness in decentralized or dynamic environments,which are common in FANET scenarios.To analyse protocol behavior,a polling system model is developed with three service strategies:Gated Service,Exhaustive Service,and Limited-1 Service.Analytical models are derived for queue length and delay,and MATLAB simulations validate the feasibility of the proposed scheme.The results show that despite its structural constraints,the proposed protocol can achieve a balance between throughput,delay,and fairness in specific mission-driven UAV applications,such as coordinated surveillance and real-time task distribution.Further research will explore decentralized adaptations to improve protocol flexibility and fault tolerance in dynamic UAV networks.
