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.展开更多
The paper presents a new protocol called Link Stability and Transmission Delay Aware(LSTDA)for Flying Adhoc Network(FANET)with a focus on network corridors(NC).FANET consists of Unmanned Aerial Vehicles(UAVs)that face...The paper presents a new protocol called Link Stability and Transmission Delay Aware(LSTDA)for Flying Adhoc Network(FANET)with a focus on network corridors(NC).FANET consists of Unmanned Aerial Vehicles(UAVs)that face challenges in avoiding transmission loss and delay while ensuring stable communication.The proposed protocol introduces a novel link stability with network corridors priority node selection to check and ensure fair communication in the entire network.The protocol uses a Red-Black(R-B)tree to achieve maximum channel utilization and an advanced relay approach.The paper evaluates LSTDA in terms of End-to-End Delay(E2ED),Packet Delivery Ratio(PDR),Network Lifetime(NLT),and Transmission Loss(TL),and compares it with existing methods such as Link Stability Estimation-based Routing(LEPR),Distributed Priority Tree-based Routing(DPTR),and Delay and Link Stability Aware(DLSA)using MATLAB simulations.The results show that LSTDA outperforms the other protocols,with lower average delay,higher average PDR,longer average NLT,and comparable average TL.展开更多
This paper deals with the co-design problem of event-triggered communication scheduling and platooning control over vehicular ad-hoc networks(VANETs)subject to finite communication resource.First,a unified model is pr...This paper deals with the co-design problem of event-triggered communication scheduling and platooning control over vehicular ad-hoc networks(VANETs)subject to finite communication resource.First,a unified model is presented to describe the coordinated platoon behavior of leader-follower vehicles in the simultaneous presence of unknown external disturbances and an unknown leader control input.Under such a platoon model,the central aim is to achieve robust platoon formation tracking with desired inter-vehicle spacing and same velocities and accelerations guided by the leader,while attaining improved communication efficiency.Toward this aim,a novel bandwidth-aware dynamic event-triggered scheduling mechanism is developed.One salient feature of the scheduling mechanism is that the threshold parameter in the triggering law is dynamically adjusted over time based on both vehicular state variations and bandwidth status.Then,a sufficient condition for platoon control system stability and performance analysis as well as a co-design criterion of the admissible event-triggered platooning control law and the desired scheduling mechanism are derived.Finally,simulation results are provided to substantiate the effectiveness and merits of the proposed co-design approach for guaranteeing a trade-off between robust platooning control performance and communication efficiency.展开更多
Most existing work on survivability in mobile ad-hoc networks(MANETs) focuses on two dimensional(2D) networks.However,many real applications run in three dimensional(3D) networks,e.g.,climate and ocean monitoring,and ...Most existing work on survivability in mobile ad-hoc networks(MANETs) focuses on two dimensional(2D) networks.However,many real applications run in three dimensional(3D) networks,e.g.,climate and ocean monitoring,and air defense systems.The impact on network survivability due to node behaviors was presented,and a quantitative analysis method on survivability was developed in 3D MANETs by modeling node behaviors and analyzing 3D network connectivity.Node behaviors were modeled by using a semi-Markov process.The node minimum degree of 3D MANETs was discussed.An effective approach to derive the survivability of k-connected networks was proposed through analyzing the connectivity of 3D MANETs caused by node misbehaviors,based on the model of node isolation.The quantitative analysis of node misbehaviors on the survivability in 3D MANETs is obtained through mathematical description,and the effectiveness and rationality of the proposed approach are verified through numerical analysis.The analytical results show that the effect from black and gray attack on network survivability is much severer than other misbehaviors.展开更多
The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range comm...The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.展开更多
The routing protocols are paramount to guarantee the Quality of Service(QoS)for Flying Ad Hoc Networks(FANETs).However,they still face several challenges owing to high mobility and dynamic topology.This paper mainly f...The routing protocols are paramount to guarantee the Quality of Service(QoS)for Flying Ad Hoc Networks(FANETs).However,they still face several challenges owing to high mobility and dynamic topology.This paper mainly focuses on the adaptive routing protocol and proposes a Three Dimensional Q-Learning(3DQ)based routing protocol to guarantee the packet delivery ratio and improve the QoS.In 3DQ routing,we propose a Q-Learning based routing decision scheme,which contains a link-state prediction module and routing decision module.The link-state prediction module allows each Unmanned Aerial Vehicle(UAV)to predict the link-state of Neighboring UAVs(NUs),considering their Three Dimensional mobility and packet arrival.Then,UAV can produce routing decisions with the help of the routing decision module considering the link-state.We evaluate the various performance of 3DQ routing,and simulation results demonstrate that 3DQ can improve packet delivery ratio,goodput and delay of baseline protocol at most 71.36%,89.32%and 83.54%in FANETs over a variety of communication scenarios.展开更多
In order to improve the broadcast reception rates of beacon messages in vehicle ad-hoc networks,a conclusion that the relationship between collision probability and minimum contention window size and the relationship ...In order to improve the broadcast reception rates of beacon messages in vehicle ad-hoc networks,a conclusion that the relationship between collision probability and minimum contention window size and the relationship between expiration probability and minimum window size was reached by building a Markov model. According to this conclusion, a back-off algorithm based on adjusting the size of minimum contention window called CEB is proposed, and this algorithm is on the basis of the differential size between the number of expiration beacons and preset threshold. Simulations were done to compare the performance of CEB with that of RBEB and BEB, and the results show that the performance of the new proposed algorithm is better than that of RBEB and BEB.展开更多
To achieve the better system performance for cooperative communication in non-orthogonal cognitive radio vehicular adhoc networks(CR-VANETs),this paper investigates the power allocation considering the interference to...To achieve the better system performance for cooperative communication in non-orthogonal cognitive radio vehicular adhoc networks(CR-VANETs),this paper investigates the power allocation considering the interference to the main system in a controllable range.We propose a three-slot one-way vehicle system model where the mobile vehicle nodes complete information interaction with the assistance of other independent nodes by borrowing the unused radio spectrum with the primary networks.The end-to-end SNR relationship in overlay and underlay cognitive communication system mode are analyzed by using two forwarding protocol,namely,decode-and-forward(DF)protocol and amplify-and-forward(AF)protocol,respectively.The system outage probability is derived and the optimal power allocation factor is obtained via seeking the minimum value of the approximation of system outage probability.The analytical results have been confirmed by means of Monte Carlo simulations.Simulation results show that the proposed system performance in terms of outage under the optimal power allocation is superior to that under the average power allocation,and is also better than that under other power allocation systems.展开更多
The Unmanned Aerial Vehicle(UAV)technologies are envisioned to play an important role in the era of Air-Space-Ground integrated networks.In this paper,we investigate the connectivity of a Flying Ad hoc Network(FANET)i...The Unmanned Aerial Vehicle(UAV)technologies are envisioned to play an important role in the era of Air-Space-Ground integrated networks.In this paper,we investigate the connectivity of a Flying Ad hoc Network(FANET)in the presence of a groundbased terminal.In particular,the connected probability of the UAV-to-UAV (U2U) link as well as that of the UAV-to-Ground (U2G) link in a three dimensional (3D) space are analyzed.Furthermore,to mitigate the aggregate interference from UAV individuals,a priority based power control scheme is implemented for enhancing the connectivity of both U2U and U2G links.Numerical results illustrate the effectiveness of the proposed analysis.展开更多
Due to highly dynamic topology caused by fast moving nodes the Vehicular ad-hoc network (VANET) results in the existence of transient communication links, which degrade the performance of developed protocols. Establis...Due to highly dynamic topology caused by fast moving nodes the Vehicular ad-hoc network (VANET) results in the existence of transient communication links, which degrade the performance of developed protocols. Established routes frequently become stale, and existing communication flows are interrupted, incurring delay and additional overhead. In this paper we propose a novel hybrid routing protocol, which is the combined between of the table-driven routing and on-demand routing in VANET. It makes fast convergence in routing process, minimal drop links, making more reliable links, and adaptive with changing of VANET topology. With neighbor table is updated instantaneously, and using strong neighbor for routing process makes route discovery process start whenever it received requirement, and through using route mechanism appropriately it reduces significantly route overhead at each node. The simulation results illustrate the outstanding properties of our proposed routing protocol.展开更多
Due to the fading characteristics of wireless channels and the burstiness of data traffic,how to deal with congestion in Ad-hoc networks with effective algorithms is still open and challenging.In this paper,we focus o...Due to the fading characteristics of wireless channels and the burstiness of data traffic,how to deal with congestion in Ad-hoc networks with effective algorithms is still open and challenging.In this paper,we focus on enabling congestion control to minimize network transmission delays through flexible power control.To effectively solve the congestion problem,we propose a distributed cross-layer scheduling algorithm,which is empowered by graph-based multi-agent deep reinforcement learning.The transmit power is adaptively adjusted in real-time by our algorithm based only on local information(i.e.,channel state information and queue length)and local communication(i.e.,information exchanged with neighbors).Moreover,the training complexity of the algorithm is low due to the regional cooperation based on the graph attention network.In the evaluation,we show that our algorithm can reduce the transmission delay of data flow under severe signal interference and drastically changing channel states,and demonstrate the adaptability and stability in different topologies.The method is general and can be extended to various types of topologies.展开更多
Recently the Cognitive Radio (CR), in particular the CR Ad-Hoc Network (CRAHN) technology appears as a burgeoning area in wireless communication that enables utilization of limited network resources in more efficient ...Recently the Cognitive Radio (CR), in particular the CR Ad-Hoc Network (CRAHN) technology appears as a burgeoning area in wireless communication that enables utilization of limited network resources in more efficient and intelligent way;studies indicate that opportunistic utilization of the available radio frequency spectrum, without interfering the licensed primary user (PU) could be made. This paper presents some simulation based performance of the Multi-Channel Hidden Terminal (MCHT) problem on CRAHNs;new observations on the effect of the number of channels on certain PU-activity metrics, e.g., delay and throughput, are described.展开更多
Among mobile users, ad-hoc social network (ASN) is becoming a popular platform to connect and share their interests anytime anywhere. Many researchers and computer scientists investigated ASN architecture, implementat...Among mobile users, ad-hoc social network (ASN) is becoming a popular platform to connect and share their interests anytime anywhere. Many researchers and computer scientists investigated ASN architecture, implementation, user experience, and different profile matching algorithms to provide better user experience in ad-hoc social network. We emphasize that strength of an ad-hoc social network depends on a good profile-matching algorithm that provides meaningful friend suggestions in proximity. Keeping browsing history is a good way to determine user’s interest, however, interests change with location. This paper presents a novel profile-matching algorithm for automatically building a user profile based on dynamic GPS (Global Positing System) location and browsing history of users. Building user profile based on GPS location of a user provides benefits to ASN users as this profile represents user’s dynamic interests that keep changing with location e.g. office, home, or some other location. Proposed profile-matching algorithm maintains multiple local profiles based on location of mobile device.展开更多
Jamming attack is quite serious threat for Mobile networks that collapses all necessary communication infrastructure. Since mobile nodes in Mobile Ad Hoc Networks (MANET) communicate in a multi-hop mode, there is alwa...Jamming attack is quite serious threat for Mobile networks that collapses all necessary communication infrastructure. Since mobile nodes in Mobile Ad Hoc Networks (MANET) communicate in a multi-hop mode, there is always a possibility for an intruder to launch a jamming attack in order to intercept communication among communication nodes. In this study, a network simulation has been carried out in order to explore and evaluate the possible impacts of jamming attack on MACAW protocol. Ad-hoc network modelling is used to provide communication infrastructure among mobile nodes in order to modelling the simulation scenarios. In simulation model, these nodes have used AODV routing protocol which is designed for MANET while second scenario contains simulated MACAW node models for comparison. On the other hand, this paper is the first study that addresses performance evaluation of MACAW protocol under a constant Jamming Attack. The performance of MACAW protocol is simulated through OPNET Modeler 14.5 software.展开更多
The support for multiple video streams in an ad-hoc wireless network requires appropriate routing and rate allocation measures ascertaining the set of links for transmitting each stream and the encoding rate of the vi...The support for multiple video streams in an ad-hoc wireless network requires appropriate routing and rate allocation measures ascertaining the set of links for transmitting each stream and the encoding rate of the video to be delivered over the chosen links. The routing and rate allocation procedures impact the sustained quality of each video stream measured as the mean squared error (MSE) distortion at the receiver, and the overall network congestion in terms of queuing delay per link. We study the trade-off between these two competing objectives in a convex optimization formulation, and discuss both centralized and dis- tributed solutions for joint routing and rate allocation for multiple streams. For each stream, the optimal allocated rate strikes a balance between the selfish motive of minimizing video distortion and the global good of minimizing network congestions, while the routes are chosen over the least-congested links in the network. In addition to detailed analysis, network simulation results using ns-2 are presented for studying the optimal choice of parameters and to confirm the effectiveness of the proposed measures.展开更多
As an indispensable part of the Intelli-gent Transportation System(ITS),the vehicular ad-hoc network(VANET)has attracted widespread atten-tion from academia and industry.In order to ensure the security of VANET,vehicl...As an indispensable part of the Intelli-gent Transportation System(ITS),the vehicular ad-hoc network(VANET)has attracted widespread atten-tion from academia and industry.In order to ensure the security of VANET,vehicles need to be authen-ticated before accessing the network.Most existing authentication protocols in VANET adopt the Trusted Authority(TA)with centralized structure which is re-sponsible for the authentication tasks of all vehicles.However,the large-scale network consume a lot of computing resources,which leads to unacceptable de-lay in message transmission in VANET.For reducing the computational cost of TA,an efficient three-factor privacy-preserving authentication and key agreement protocol was proposed in our paper.Different from before,the RoadSide Unit(RSU)no longer acts as an intermediate node but is responsible for assisting user authentication,which lead to the computational cost of TA is very low.Through formal and informal analysis,our protocol demonstrates excellent security.Com-pared with previous studies,our work emerges advan-tages and superiorities in the following aspects:com-putational cost,communication cost,security proper-ties and functions,message loss ratio,and message de-lay.These data and evidence indicate that our protocol is an ideal choice for large-scale VANET.展开更多
Cognitive radio,which is capable of enabling dynamic spectrum access,is a promising technology in future wireless communication.The feasibility of cognitive radio network greatly depends on the energy efciency and rel...Cognitive radio,which is capable of enabling dynamic spectrum access,is a promising technology in future wireless communication.The feasibility of cognitive radio network greatly depends on the energy efciency and reliability of spectrum sensing technology.In this paper,spectrum sensing in cognitive ad-hoc network(CAN)with wide-band dynamic spectrum is considered.A cognitive cluster head(CCH)is set and responsible for dividing the wide-band spectrum into multiple sub-channels;it can either sense sub-channels in a centralized manner,or make use of sensing modules to sense sub-channels in a distributed manner.Then cognitive users(CUs)can get sensing results and access to the available sub-channel.We take the cost of control message into consideration and formulate the energy consumption of CAN in terms of sub-channel sampling rate and whole-band sensing time.We define energy efciency intuitively and solve the energy efciency optimization problem with sensing reliability constraints by constructing a parametric problem and obtain the optimal sampling rate and the wholeband sensing time.Power dissipation model of a practical A/D convertor(ADC)is introduced,and numerical results are given to show the energy efciency performance of two diferent sensing manners.展开更多
Vehicular ad-hoc networks （VANETs） are a significant field in the intelligent transportation system （ITS） for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments ...Vehicular ad-hoc networks （VANETs） are a significant field in the intelligent transportation system （ITS） for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments have been performed in the region of VANET improvement. A familiar challenge that occurs is obtaining various constrained quality of service （QoS） metrics. For resolving this issue, this study obtains a cost design for the vehicle routing issue by focusing on the QoS metrics such as collision, travel cost, awareness, and congestion. The awareness of QoS is fuzzified into a price design that comprises the entire cost of routing. As the genetic algorithm （GA） endures from the most significant challenges such as complexity, unassisted issues in mutation, detecting slow convergence, global maxima, multifaceted features under genetic coding, and better fitting, the currently established lion algorithm （LA） is employed. The computation is analyzed by deploying three well-known studies such as cost analysis, convergence analysis, and complexity investigations. A numerical analysis with quantitative outcome has also been studied based on the obtained correlation analysis among various cost functions. It is found that LA performs better than GA with a reduction in complexity and routing cost.展开更多
We consider the problem of fair rate control for wireless ad-hoc networks with time varying channel capacities. The interaction between links in wireless ad-hoc networks introduces additional constraints on the flow r...We consider the problem of fair rate control for wireless ad-hoc networks with time varying channel capacities. The interaction between links in wireless ad-hoc networks introduces additional constraints on the flow rate. A primal-dual algorithm that guarantees fair rate control is proved to be trajectory stable. Various fairness indexes are obtained by choosing the specified form of the utility functions, and the numerical results validate the effectiveness of the proposed algorithm.展开更多
基金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.
基金supported in part by the Office of Research and Sponsored Programs,Kean University,the RIF Activity Code 23009 of Zayed University,UAE,and the National Natural Science Foundation of China under Grant 62172366.
文摘The paper presents a new protocol called Link Stability and Transmission Delay Aware(LSTDA)for Flying Adhoc Network(FANET)with a focus on network corridors(NC).FANET consists of Unmanned Aerial Vehicles(UAVs)that face challenges in avoiding transmission loss and delay while ensuring stable communication.The proposed protocol introduces a novel link stability with network corridors priority node selection to check and ensure fair communication in the entire network.The protocol uses a Red-Black(R-B)tree to achieve maximum channel utilization and an advanced relay approach.The paper evaluates LSTDA in terms of End-to-End Delay(E2ED),Packet Delivery Ratio(PDR),Network Lifetime(NLT),and Transmission Loss(TL),and compares it with existing methods such as Link Stability Estimation-based Routing(LEPR),Distributed Priority Tree-based Routing(DPTR),and Delay and Link Stability Aware(DLSA)using MATLAB simulations.The results show that LSTDA outperforms the other protocols,with lower average delay,higher average PDR,longer average NLT,and comparable average TL.
基金This work was supported in part by the Australian Research Council Discovery Early Career Researcher Award under Grant DE200101128.
文摘This paper deals with the co-design problem of event-triggered communication scheduling and platooning control over vehicular ad-hoc networks(VANETs)subject to finite communication resource.First,a unified model is presented to describe the coordinated platoon behavior of leader-follower vehicles in the simultaneous presence of unknown external disturbances and an unknown leader control input.Under such a platoon model,the central aim is to achieve robust platoon formation tracking with desired inter-vehicle spacing and same velocities and accelerations guided by the leader,while attaining improved communication efficiency.Toward this aim,a novel bandwidth-aware dynamic event-triggered scheduling mechanism is developed.One salient feature of the scheduling mechanism is that the threshold parameter in the triggering law is dynamically adjusted over time based on both vehicular state variations and bandwidth status.Then,a sufficient condition for platoon control system stability and performance analysis as well as a co-design criterion of the admissible event-triggered platooning control law and the desired scheduling mechanism are derived.Finally,simulation results are provided to substantiate the effectiveness and merits of the proposed co-design approach for guaranteeing a trade-off between robust platooning control performance and communication efficiency.
基金Project(07JJ1010) supported by the Hunan Provincial Natural Science Foundation of China for Distinguished Young ScholarsProjects(61073037,60773013) supported by the National Natural Science Foundation of China
文摘Most existing work on survivability in mobile ad-hoc networks(MANETs) focuses on two dimensional(2D) networks.However,many real applications run in three dimensional(3D) networks,e.g.,climate and ocean monitoring,and air defense systems.The impact on network survivability due to node behaviors was presented,and a quantitative analysis method on survivability was developed in 3D MANETs by modeling node behaviors and analyzing 3D network connectivity.Node behaviors were modeled by using a semi-Markov process.The node minimum degree of 3D MANETs was discussed.An effective approach to derive the survivability of k-connected networks was proposed through analyzing the connectivity of 3D MANETs caused by node misbehaviors,based on the model of node isolation.The quantitative analysis of node misbehaviors on the survivability in 3D MANETs is obtained through mathematical description,and the effectiveness and rationality of the proposed approach are verified through numerical analysis.The analytical results show that the effect from black and gray attack on network survivability is much severer than other misbehaviors.
文摘The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.
基金This work is supported in part by the National Natural Science Foundation of China under Grant No.61931011in part by the National Key Research and Development Project of China under Grant No.2018YFB1800801+2 种基金in part by the Primary Research&Development plan of Jiangsu Province under Grant BE2021013-4in part by the National Natural Science Foundation of China under Grants No.61827801 and 61631020the China Scholarship Council(CSC)Grant 202006830072.
文摘The routing protocols are paramount to guarantee the Quality of Service(QoS)for Flying Ad Hoc Networks(FANETs).However,they still face several challenges owing to high mobility and dynamic topology.This paper mainly focuses on the adaptive routing protocol and proposes a Three Dimensional Q-Learning(3DQ)based routing protocol to guarantee the packet delivery ratio and improve the QoS.In 3DQ routing,we propose a Q-Learning based routing decision scheme,which contains a link-state prediction module and routing decision module.The link-state prediction module allows each Unmanned Aerial Vehicle(UAV)to predict the link-state of Neighboring UAVs(NUs),considering their Three Dimensional mobility and packet arrival.Then,UAV can produce routing decisions with the help of the routing decision module considering the link-state.We evaluate the various performance of 3DQ routing,and simulation results demonstrate that 3DQ can improve packet delivery ratio,goodput and delay of baseline protocol at most 71.36%,89.32%and 83.54%in FANETs over a variety of communication scenarios.
基金supported by National Basic Research Program of China (2013CB329005)National Natural Science Foundation of China (61302100, 61201162, 61471203)+1 种基金Basic Research Program of Jiangsu Province (BK2011027)Specialized Research Fund for the Doctoral Program of Higher Education (20133223120002)
文摘In order to improve the broadcast reception rates of beacon messages in vehicle ad-hoc networks,a conclusion that the relationship between collision probability and minimum contention window size and the relationship between expiration probability and minimum window size was reached by building a Markov model. According to this conclusion, a back-off algorithm based on adjusting the size of minimum contention window called CEB is proposed, and this algorithm is on the basis of the differential size between the number of expiration beacons and preset threshold. Simulations were done to compare the performance of CEB with that of RBEB and BEB, and the results show that the performance of the new proposed algorithm is better than that of RBEB and BEB.
基金funded by the Six Talent Peaks Project in Jiangsu Province(No.KTHY-052)the National Natural Science Foundation of China(No.61971245)+1 种基金the Science and Technology program of Nantong(Contract No.JC2018048)the Key Lab of Advanced Optical Manufacturing Technologies of Jiangsu Province&Key Lab of Modern Optical Technologies of Education Ministry of China,Soochow University(No.KJS1858).
文摘To achieve the better system performance for cooperative communication in non-orthogonal cognitive radio vehicular adhoc networks(CR-VANETs),this paper investigates the power allocation considering the interference to the main system in a controllable range.We propose a three-slot one-way vehicle system model where the mobile vehicle nodes complete information interaction with the assistance of other independent nodes by borrowing the unused radio spectrum with the primary networks.The end-to-end SNR relationship in overlay and underlay cognitive communication system mode are analyzed by using two forwarding protocol,namely,decode-and-forward(DF)protocol and amplify-and-forward(AF)protocol,respectively.The system outage probability is derived and the optimal power allocation factor is obtained via seeking the minimum value of the approximation of system outage probability.The analytical results have been confirmed by means of Monte Carlo simulations.Simulation results show that the proposed system performance in terms of outage under the optimal power allocation is superior to that under the average power allocation,and is also better than that under other power allocation systems.
基金National Natural Science Foundation of China(No.62071035)。
文摘The Unmanned Aerial Vehicle(UAV)technologies are envisioned to play an important role in the era of Air-Space-Ground integrated networks.In this paper,we investigate the connectivity of a Flying Ad hoc Network(FANET)in the presence of a groundbased terminal.In particular,the connected probability of the UAV-to-UAV (U2U) link as well as that of the UAV-to-Ground (U2G) link in a three dimensional (3D) space are analyzed.Furthermore,to mitigate the aggregate interference from UAV individuals,a priority based power control scheme is implemented for enhancing the connectivity of both U2U and U2G links.Numerical results illustrate the effectiveness of the proposed analysis.
基金Sponsored by the National Science and Technology Major Project(Grant No. 2010ZX03005-003)
文摘Due to highly dynamic topology caused by fast moving nodes the Vehicular ad-hoc network (VANET) results in the existence of transient communication links, which degrade the performance of developed protocols. Established routes frequently become stale, and existing communication flows are interrupted, incurring delay and additional overhead. In this paper we propose a novel hybrid routing protocol, which is the combined between of the table-driven routing and on-demand routing in VANET. It makes fast convergence in routing process, minimal drop links, making more reliable links, and adaptive with changing of VANET topology. With neighbor table is updated instantaneously, and using strong neighbor for routing process makes route discovery process start whenever it received requirement, and through using route mechanism appropriately it reduces significantly route overhead at each node. The simulation results illustrate the outstanding properties of our proposed routing protocol.
基金supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No.RS-2022-00155885, Artificial Intelligence Convergence Innovation Human Resources Development (Hanyang University ERICA))supported by the National Natural Science Foundation of China under Grant No. 61971264the National Natural Science Foundation of China/Research Grants Council Collaborative Research Scheme under Grant No. 62261160390
文摘Due to the fading characteristics of wireless channels and the burstiness of data traffic,how to deal with congestion in Ad-hoc networks with effective algorithms is still open and challenging.In this paper,we focus on enabling congestion control to minimize network transmission delays through flexible power control.To effectively solve the congestion problem,we propose a distributed cross-layer scheduling algorithm,which is empowered by graph-based multi-agent deep reinforcement learning.The transmit power is adaptively adjusted in real-time by our algorithm based only on local information(i.e.,channel state information and queue length)and local communication(i.e.,information exchanged with neighbors).Moreover,the training complexity of the algorithm is low due to the regional cooperation based on the graph attention network.In the evaluation,we show that our algorithm can reduce the transmission delay of data flow under severe signal interference and drastically changing channel states,and demonstrate the adaptability and stability in different topologies.The method is general and can be extended to various types of topologies.
文摘Recently the Cognitive Radio (CR), in particular the CR Ad-Hoc Network (CRAHN) technology appears as a burgeoning area in wireless communication that enables utilization of limited network resources in more efficient and intelligent way;studies indicate that opportunistic utilization of the available radio frequency spectrum, without interfering the licensed primary user (PU) could be made. This paper presents some simulation based performance of the Multi-Channel Hidden Terminal (MCHT) problem on CRAHNs;new observations on the effect of the number of channels on certain PU-activity metrics, e.g., delay and throughput, are described.
文摘Among mobile users, ad-hoc social network (ASN) is becoming a popular platform to connect and share their interests anytime anywhere. Many researchers and computer scientists investigated ASN architecture, implementation, user experience, and different profile matching algorithms to provide better user experience in ad-hoc social network. We emphasize that strength of an ad-hoc social network depends on a good profile-matching algorithm that provides meaningful friend suggestions in proximity. Keeping browsing history is a good way to determine user’s interest, however, interests change with location. This paper presents a novel profile-matching algorithm for automatically building a user profile based on dynamic GPS (Global Positing System) location and browsing history of users. Building user profile based on GPS location of a user provides benefits to ASN users as this profile represents user’s dynamic interests that keep changing with location e.g. office, home, or some other location. Proposed profile-matching algorithm maintains multiple local profiles based on location of mobile device.
文摘Jamming attack is quite serious threat for Mobile networks that collapses all necessary communication infrastructure. Since mobile nodes in Mobile Ad Hoc Networks (MANET) communicate in a multi-hop mode, there is always a possibility for an intruder to launch a jamming attack in order to intercept communication among communication nodes. In this study, a network simulation has been carried out in order to explore and evaluate the possible impacts of jamming attack on MACAW protocol. Ad-hoc network modelling is used to provide communication infrastructure among mobile nodes in order to modelling the simulation scenarios. In simulation model, these nodes have used AODV routing protocol which is designed for MANET while second scenario contains simulated MACAW node models for comparison. On the other hand, this paper is the first study that addresses performance evaluation of MACAW protocol under a constant Jamming Attack. The performance of MACAW protocol is simulated through OPNET Modeler 14.5 software.
基金Project (No. CCR-0325639) partially supported by the National Science Foundation, USA
文摘The support for multiple video streams in an ad-hoc wireless network requires appropriate routing and rate allocation measures ascertaining the set of links for transmitting each stream and the encoding rate of the video to be delivered over the chosen links. The routing and rate allocation procedures impact the sustained quality of each video stream measured as the mean squared error (MSE) distortion at the receiver, and the overall network congestion in terms of queuing delay per link. We study the trade-off between these two competing objectives in a convex optimization formulation, and discuss both centralized and dis- tributed solutions for joint routing and rate allocation for multiple streams. For each stream, the optimal allocated rate strikes a balance between the selfish motive of minimizing video distortion and the global good of minimizing network congestions, while the routes are chosen over the least-congested links in the network. In addition to detailed analysis, network simulation results using ns-2 are presented for studying the optimal choice of parameters and to confirm the effectiveness of the proposed measures.
基金the National Natural Sci-ence Foundation of China under Grant No.61772185.
文摘As an indispensable part of the Intelli-gent Transportation System(ITS),the vehicular ad-hoc network(VANET)has attracted widespread atten-tion from academia and industry.In order to ensure the security of VANET,vehicles need to be authen-ticated before accessing the network.Most existing authentication protocols in VANET adopt the Trusted Authority(TA)with centralized structure which is re-sponsible for the authentication tasks of all vehicles.However,the large-scale network consume a lot of computing resources,which leads to unacceptable de-lay in message transmission in VANET.For reducing the computational cost of TA,an efficient three-factor privacy-preserving authentication and key agreement protocol was proposed in our paper.Different from before,the RoadSide Unit(RSU)no longer acts as an intermediate node but is responsible for assisting user authentication,which lead to the computational cost of TA is very low.Through formal and informal analysis,our protocol demonstrates excellent security.Com-pared with previous studies,our work emerges advan-tages and superiorities in the following aspects:com-putational cost,communication cost,security proper-ties and functions,message loss ratio,and message de-lay.These data and evidence indicate that our protocol is an ideal choice for large-scale VANET.
基金the National Natural Science Foundation of China(Nos.61102052 and 60972050)the National Basic Research Program(973)of China(No.2010CB731803)+1 种基金the China Ministry of Education Fok Ying Tung Fund(No.122002)the National Science and Technology Major Project of China(Nos.2010ZX03002-007-01 and 2010ZX03003-001-01)
文摘Cognitive radio,which is capable of enabling dynamic spectrum access,is a promising technology in future wireless communication.The feasibility of cognitive radio network greatly depends on the energy efciency and reliability of spectrum sensing technology.In this paper,spectrum sensing in cognitive ad-hoc network(CAN)with wide-band dynamic spectrum is considered.A cognitive cluster head(CCH)is set and responsible for dividing the wide-band spectrum into multiple sub-channels;it can either sense sub-channels in a centralized manner,or make use of sensing modules to sense sub-channels in a distributed manner.Then cognitive users(CUs)can get sensing results and access to the available sub-channel.We take the cost of control message into consideration and formulate the energy consumption of CAN in terms of sub-channel sampling rate and whole-band sensing time.We define energy efciency intuitively and solve the energy efciency optimization problem with sensing reliability constraints by constructing a parametric problem and obtain the optimal sampling rate and the wholeband sensing time.Power dissipation model of a practical A/D convertor(ADC)is introduced,and numerical results are given to show the energy efciency performance of two diferent sensing manners.
文摘Vehicular ad-hoc networks （VANETs） are a significant field in the intelligent transportation system （ITS） for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments have been performed in the region of VANET improvement. A familiar challenge that occurs is obtaining various constrained quality of service （QoS） metrics. For resolving this issue, this study obtains a cost design for the vehicle routing issue by focusing on the QoS metrics such as collision, travel cost, awareness, and congestion. The awareness of QoS is fuzzified into a price design that comprises the entire cost of routing. As the genetic algorithm （GA） endures from the most significant challenges such as complexity, unassisted issues in mutation, detecting slow convergence, global maxima, multifaceted features under genetic coding, and better fitting, the currently established lion algorithm （LA） is employed. The computation is analyzed by deploying three well-known studies such as cost analysis, convergence analysis, and complexity investigations. A numerical analysis with quantitative outcome has also been studied based on the obtained correlation analysis among various cost functions. It is found that LA performs better than GA with a reduction in complexity and routing cost.
基金supported by the National Natural Science Foundation of China for Distinguished Young Scholars(No.60525303)the National Natural Science Foundation of China(No.60904048,60404022,60604012)the Natural Science Foundation of Hebei Province(No.F2005000390,F2006000270)
文摘We consider the problem of fair rate control for wireless ad-hoc networks with time varying channel capacities. The interaction between links in wireless ad-hoc networks introduces additional constraints on the flow rate. A primal-dual algorithm that guarantees fair rate control is proved to be trajectory stable. Various fairness indexes are obtained by choosing the specified form of the utility functions, and the numerical results validate the effectiveness of the proposed algorithm.
