The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significan...The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significantly.To protect the network efficiently,critical nodes should be identified accurately and rapidly.Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information,this paper develops a critical node identification method to relax the prior topology information condition about critical nodes.Specifically,we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges,and prove the universality of the theorem in a realistic two-dimensional scenario.After that,we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node,the greater degree value of nodes with high probability.Moreover,we develop a novel strategy to improve the accuracy of critical node identification without topology information.Finally,simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks.展开更多
In the internet of battlefield things, ammunition is becoming networked and intelligent, which depends on location information. Therefore, this paper focuses on the self-organized network collaborative localization of...In the internet of battlefield things, ammunition is becoming networked and intelligent, which depends on location information. Therefore, this paper focuses on the self-organized network collaborative localization of munitions with an aerial three-dimensional(3D) highly-dynamic topographic structure under a satellite denied environment. As for aerial networked munitions, the measurement of munitions is objectively incomplete due to the degenerated and interrupted link of munitions. For this reason, a cluster-oriented collaborative localization method is put forward in this paper. Multidimensional scaling(MDS) was first integrated with a trilateration localization method(TLM) to construct a relative localization algorithm for determining the relative location of a mobile cluster network. The information related to relative velocity was then combined into a collaborative localization framework to devise a TLM-vMDS algorithm. Finally, an iterative refinement algorithm based on scaling by majorizing a complicated function(SMACOF) was employed to effectively eliminate the influence of incomplete link observation on localization accuracy. Compared with the currently available advanced algorithms, the proposed TLM-vMDS algorithm achieves higher localization accuracy and faster convergence for a cluster of extensively networked munitions, and also offers better numerical stability and robustness for highspeed motion models.展开更多
Vehicle Ad hoc Networks(VANETs)have high mobility and a rando-mized connection structure,resulting in extremely dynamic behavior.Several challenges,such as frequent connection failures,sustainability,multi-hop data tr...Vehicle Ad hoc Networks(VANETs)have high mobility and a rando-mized connection structure,resulting in extremely dynamic behavior.Several challenges,such as frequent connection failures,sustainability,multi-hop data transfer,and data loss,affect the effectiveness of Transmission Control Protocols(TCP)on such wireless ad hoc networks.To avoid the problem,in this paper,mobility-aware zone-based routing in VANET is proposed.To achieve this con-cept,in this paper hybrid optimization algorithm is presented.The hybrid algo-rithm is a combination of Ant colony optimization(ACO)and artificial bee colony optimization(ABC).The proposed hybrid algorithm is designed for the routing process which is transmitting the information from one place to another.The optimal routing process is used to avoid traffic and link failure.Thefitness function is designed based on Link stability and Residual energy.The validation of the proposed algorithm takes solution encoding,fitness calculation,and updat-ing functions.To perform simulation experiments,NS2 simulator software is used.The performance of the proposed approach is analyzed based on different metrics namely,delivery ratio,delay time,throughput,and overhead.The effec-tiveness of the proposed method compared with different algorithms.Compared to other existing VANET algorithms,the hybrid algorithm has proven to be very efficient in terms of packet delivery ratio and delay.展开更多
Vehicular Ad hoc Networks(VANETs)become a very crucial addition in the Intelligent Transportation System(ITS).It is challenging for a VANET system to provide security services and parallelly maintain high throughput b...Vehicular Ad hoc Networks(VANETs)become a very crucial addition in the Intelligent Transportation System(ITS).It is challenging for a VANET system to provide security services and parallelly maintain high throughput by utilizing limited resources.To overcome these challenges,we propose a blockchain-based Secured Cluster-based MAC(SCB-MAC)protocol.The nearby vehicles heading towards the same direction will form a cluster and each of the clusters has its blockchain to store and distribute the safety messages.The message which contains emergency information and requires Strict Delay Requirement(SDR)for transmission are called safety messages(SM).Cluster Members(CMs)sign SMs with their private keys while sending them to the blockchain to confirm authentication,integrity,and confidentiality of the message.A Certificate Authority(CA)is responsible for physical verification,key generation,and privacy preservation of the vehicles.We implemented a test scenario as proof of concept and tested the safety message transmission(SMT)protocol in a real-world platform.Computational and storage overhead analysis shows that the proposed protocol for SMT implements security,authentication,integrity,robustness,non-repudiation,etc.while maintaining the SDR.Messages that are less important compared to the SMs are called non-safety messages(NSM)and vehicles use RTS/CTS mechanism for NSM transmission.Numerical studies show that the proposed NSM transmission method maintains 6 times more throughput,2 times less delay and 125%less Packet Dropping Rate(PDR)than traditional MAC protocols.These results prove that the proposed protocol outperforms the traditional MAC protocols.展开更多
A critical challenge for mobile ad hoc networks is the design of efficient routing protocols which are able to provide high bandwidth utilization and desired fairness in mobile wireless environment without any fixed c...A critical challenge for mobile ad hoc networks is the design of efficient routing protocols which are able to provide high bandwidth utilization and desired fairness in mobile wireless environment without any fixed communication establishments. Although extensive efforts have already been devoted to providing optimization based distributed congestion elusion strategy for efficient bandwidth utilization and fair allocation in both wired and wireless networks,a common assumption therein is the fixed link capacities,which will unfortunately limit the application scope in mobile ad hoc networks where channels keep changing. In this paper,an effective congestion elusion strategy is presented explicitly based on ant colony algorithm for mobile ad hoc networks, which will explore the optimal route between two nodes promptly,meanwhile forecast congestion state of the link. Accordingly,a new path will be found rapidly to have the flow spread around to relieve the congestion degree. Compared with OLSR,the strategy proposed will greatly reduce the packet loss ratio and the average end-to-end delay at the same time,which illustrate that it will make use of networking resource effectively.展开更多
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 recent years,with the rapid development of the Internet and wireless communication technology,wireless Ad hoc networks have received more attention.Due to the limited transmission range and energy of nodes in Ad ho...In recent years,with the rapid development of the Internet and wireless communication technology,wireless Ad hoc networks have received more attention.Due to the limited transmission range and energy of nodes in Ad hoc networks,it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks.This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol,which has the following two aspects of improvement:(1)In the route discovery process,a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a“Mark”bit that representing remaining energy of a node.(2)Based on(1),a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively.Simulation results demonstrate that compared with AODV and other existing routing protocols,proposed algorithm can reduce network energy consumption and balance node energy,thus extending the network lifetime.展开更多
One of the fundamental properties of an ad hoc network is its connectivity. Maintaining connectivity in wireless networks is extremely difficult due to dynamic changing topology of MANETs. There are several techniques...One of the fundamental properties of an ad hoc network is its connectivity. Maintaining connectivity in wireless networks is extremely difficult due to dynamic changing topology of MANETs. There are several techniques to understand the connectivity level for a given network topology. In this paper, we examine the existing methods and discuss the issues and challenges that are still insurmountable in order to enhance the connectivity properties of wireless multi hop networks.展开更多
Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data sy...Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data synchronization was mainly studied in the latency-tolerant distributed databases,or assuming the general model of wireless ad hoc networks.In this paper,we propose a pair of linear network coding(NC)and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator’s control.We consider both data block selection and transmitting node selection for exploiting the benefits of NC.Instead of using the store-and-forward protocol as in the conventional uncoded approach,a compute-and-forward protocol is used in our scheme,which improves the transmission efficiency.The performance of the proposed algorithms is studied under different values of network size,network connection degree,and per-hop packet error rate.Simulation results demonstrate that our algorithms significantly reduce the times slots used for data synchronization compared with the baseline that does not use NC.展开更多
As a special type of mobile ad hoc network(MANET),the flying ad hoc network(FANET)has the potential to enable a variety of emerging applications in both civilian wireless communications(e.g.,5G and 6G)and the defense ...As a special type of mobile ad hoc network(MANET),the flying ad hoc network(FANET)has the potential to enable a variety of emerging applications in both civilian wireless communications(e.g.,5G and 6G)and the defense industry.The routing protocol plays a pivotal role in FANET.However,when designing the routing protocol for FANET,it is conventionally assumed that the aerial nodes move randomly.This is clearly inappropriate for a mission-oriented FANET(MO-FANET),in which the aerial nodes typically move toward a given destination from given departure point(s),possibly along a roughly deterministic flight path while maintaining a well-established formation,in order to carry out certain missions.In this paper,a novel cyber–physical routing protocol exploiting the particular mobility pattern of an MO-FANET is proposed based on cross-disciplinary integration,which makes full use of the missiondetermined trajectory dynamics to construct the time sequence of rejoining and separating,as well as the adjacency matrix for each node,as prior information.Compared with the existing representative routing protocols used in FANETs,our protocol achieves a higher packet-delivery ratio(PDR)at the cost of even lower overhead and lower average end-to-end latency,while maintaining a reasonably moderate and stable network jitter,as demonstrated by extensive ns-3-based simulations assuming realistic configurations in an MO-FANET.展开更多
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.展开更多
Mobile ad hoc network(MANET)is a dynamically reconfigurable wireless network with time-variable infrastructure.Given that nodes are highly mobile,MANET’s topology often changes.These changes increase the difficulty i...Mobile ad hoc network(MANET)is a dynamically reconfigurable wireless network with time-variable infrastructure.Given that nodes are highly mobile,MANET’s topology often changes.These changes increase the difficulty in finding the routes that the packets use when they are routed.This study proposes an algorithm called genetic algorithm-based location-aided routing(GALAR)to enhance the MANET routing protocol efficiency.The GALAR algorithm maintains an adaptive update of the node location information by adding the transmitting node location information to the routing packet and selecting the transmitting node to carry the packets to their destination.The GALAR was constructed based on a genetic optimization scheme that considers all contributing factors in the delivery behavior using criterion function optimization.Simulation results showed that the GALAR algorithm can make the probability of packet delivery ratio more than 99%with less network overhead.Moreover,GALAR was compared to other algorithms in terms of different network evaluation measures.The GALAR algorithm significantly outperformed the other algorithms that were used in the study.展开更多
Route flapping is common in mobile Ad hoc networks.It usually causes large delay or even interruption during communication.This paper proposed a routing protocol AODV-RM to alleviate this effect.AODV-RM selects routes...Route flapping is common in mobile Ad hoc networks.It usually causes large delay or even interruption during communication.This paper proposed a routing protocol AODV-RM to alleviate this effect.AODV-RM selects routes with the lightest traffic load,to avoid striving for hot nodes with other users,hence minishes the chance of collision.AODV-RM keeps all valid routes to the destination in its routing table as backups.When the link under usage breaks down,AODV-RM shifts to a valid route in its routing table instead of route repair or researching,which ensures the continuity of communication.AODV-RM chooses a route maintenance scheme by the network topology.If the origination has multi routes to the destination,only the origination maintains routes.Otherwise,middle nodes,instead of the origination,maintain sub-routes to the destination.By simulating the traditional AODV and AODV-RM,the results showed that AODV-RM has a lower drop rate and better performance against route flapping.展开更多
An Ad hoc network is composed of wireless mobile nodes.Because there is no other wired infrastructure such as base stations,the ad hoc network,unlike other wireless networks such as Wireless Local Area Network(WLAN),h...An Ad hoc network is composed of wireless mobile nodes.Because there is no other wired infrastructure such as base stations,the ad hoc network,unlike other wireless networks such as Wireless Local Area Network(WLAN),has to face attacks from both the control plane and the data plane.Ad hoc should ensure the routing security on the control plane,and the secure forwarding of packets on the data plane.The distributed network protocol should operate safely,and peer-to-peer nodes should have trusting relations for each other.For this purpose,a complete security solution should include three parts:security on the control plane,security on the data plane,and security of key management.展开更多
Over the course of the last 10 years, research on Mobile Ad Hoc Networks has witnessed high levels of focus. Because of this field being a relatively new topic, most researchers have focused on using simulation as the...Over the course of the last 10 years, research on Mobile Ad Hoc Networks has witnessed high levels of focus. Because of this field being a relatively new topic, most researchers have focused on using simulation as the first choice for performance measurement and evaluation. In order to contribute to the credibility and reliability of research results on Ad Hoc networks, this paper addresses the issue of choosing parameter values that are used as input for simulators used in such experiments by surveying a sample of recently published papers on Ad Hoc Networks. Results show that in the majority of revised papers, the simulation environment is not carefully planned as reflected by the diversity and quality of parameters used.展开更多
Mobile Ad hoc Network (MANET) is a wireless network consisting of mobile devices (laptops, smart phones, etc.) that move and communicate with each other without the use of any existing network infrastructure or centra...Mobile Ad hoc Network (MANET) is a wireless network consisting of mobile devices (laptops, smart phones, etc.) that move and communicate with each other without the use of any existing network infrastructure or centralized server to avoid collisions which have negative effects on the performance of the network. Access to the shared media is controlled by a Backoff algorithm that is a part of the Media Access Protocol. In this paper, we improve the History Based Probabilistic Backoff (HPPB) algorithm by modifying the increment/decrement behavior of the Contention Window to introduce History Based Increment Backoff (HBIB) algorithm which outperforms HBPB in terms of throughput and end-to-end delay with various numbers of nodes and different traffic loads.展开更多
The unique anywhere, anytime wireless communication support offers, tremendous potential for the next generation of applications in a Mobile Ad-hoc Network (MANET). The Quality of Service (QoS) has been the ever deman...The unique anywhere, anytime wireless communication support offers, tremendous potential for the next generation of applications in a Mobile Ad-hoc Network (MANET). The Quality of Service (QoS) has been the ever demanding task of wireless communication to satisfy the application requirements. Geographical routing employs a greedy forwarding technique to deliver the packets to the destination and to owe the communication void, it fails to render the expected level of QoS. Opportunistic routing technique effectively utilizes the advantages of broadcasting nature of the wireless medium and selects a set of forwarding candidates instead of relying on a greedy node. To improve the efficiency of QoS routing in sparse and highly dynamic network topology, this paper proposes the Void-Aware Position based Opportunistic Routing (VAPOR). The VAPOR maintains 2-hop neighbor information to take a routing decision, but it is limited to 1-hop information when the node density is high. It efficiently balances the storage overhead and communication delay due to void and it increases the network throughput even under a sparse network. To provide a certain assurance level for packet reachability, VAPOR decides the potential forwarders based on the forwarding probability that measures link stability, capacity, and connectivity factor. It adaptively favors a path that avoids frequent link failure and unreliable link usage. By limiting the propagation area of duplicate packets, VAPOR reduces wastage of network resources, and ittakes the advantage of concurrent batch forwarding to avoid further duplication and unnecessary delay.展开更多
Mobile ad hoc networking (MANET) has become an exciting and important technology in recent years,because of the rapid proliferation of wireless devices.Mobile ad hoc networks is highly vulnerable to attacks due to the...Mobile ad hoc networking (MANET) has become an exciting and important technology in recent years,because of the rapid proliferation of wireless devices.Mobile ad hoc networks is highly vulnerable to attacks due to the open medium,dynamically changing network topology,cooperative algorithms,and lack of centralized monitoring and management point.The traditional way of protecting networks with firewalls and encryption software is no longer suffcient and effective for those features.A distributed intrusion detection approach based on timed automata is given.A cluster-based detection scheme is presented,where periodically a node is elected as the monitor node for a cluster.These monitor nodes can not only make local intrusion detection decisions,but also cooperatively take part in global intrusion detection.And then the timed automata is constructed by the way of manually abstracting the correct behaviours of the node according to the routing protocol of dynamic source routing (DSR).The monitor nodes can verify the behaviour of every nodes by timed automata,and validly detect real-time attacks without signatures of intrusion or trained data.Compared with the architecture where each node is its own IDS agent,the approach is much more effcient while maintaining the same level of effectiveness.Finally,the intrusion detection method is evaluated through simulation experiments.展开更多
In traditional networks ,the authentication is performed by certificate authoritys(CA),which can’t be built in distributed mobile Ad Hoc Networks however. In this paper, we propose a fully self-organized public key m...In traditional networks ,the authentication is performed by certificate authoritys(CA),which can’t be built in distributed mobile Ad Hoc Networks however. In this paper, we propose a fully self-organized public key management based on bidirectional trust model without any centralized authority that allows users to generate their public-private key pairs, to issue certificates, and the trust relation spreads rationally according to the truly human relations. In contrast with the traditional self-organized public-key management, the average certificates paths get more short,the authentication passing rate gets more high and the most important is that the bidirectional trust based model satisfys the trust requirement of hosts better.展开更多
基金supported by the National Natural Science Foundation of China(62231020)the Youth Innovation Team of Shaanxi Universities。
文摘The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significantly.To protect the network efficiently,critical nodes should be identified accurately and rapidly.Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information,this paper develops a critical node identification method to relax the prior topology information condition about critical nodes.Specifically,we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges,and prove the universality of the theorem in a realistic two-dimensional scenario.After that,we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node,the greater degree value of nodes with high probability.Moreover,we develop a novel strategy to improve the accuracy of critical node identification without topology information.Finally,simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks.
文摘In the internet of battlefield things, ammunition is becoming networked and intelligent, which depends on location information. Therefore, this paper focuses on the self-organized network collaborative localization of munitions with an aerial three-dimensional(3D) highly-dynamic topographic structure under a satellite denied environment. As for aerial networked munitions, the measurement of munitions is objectively incomplete due to the degenerated and interrupted link of munitions. For this reason, a cluster-oriented collaborative localization method is put forward in this paper. Multidimensional scaling(MDS) was first integrated with a trilateration localization method(TLM) to construct a relative localization algorithm for determining the relative location of a mobile cluster network. The information related to relative velocity was then combined into a collaborative localization framework to devise a TLM-vMDS algorithm. Finally, an iterative refinement algorithm based on scaling by majorizing a complicated function(SMACOF) was employed to effectively eliminate the influence of incomplete link observation on localization accuracy. Compared with the currently available advanced algorithms, the proposed TLM-vMDS algorithm achieves higher localization accuracy and faster convergence for a cluster of extensively networked munitions, and also offers better numerical stability and robustness for highspeed motion models.
文摘Vehicle Ad hoc Networks(VANETs)have high mobility and a rando-mized connection structure,resulting in extremely dynamic behavior.Several challenges,such as frequent connection failures,sustainability,multi-hop data transfer,and data loss,affect the effectiveness of Transmission Control Protocols(TCP)on such wireless ad hoc networks.To avoid the problem,in this paper,mobility-aware zone-based routing in VANET is proposed.To achieve this con-cept,in this paper hybrid optimization algorithm is presented.The hybrid algo-rithm is a combination of Ant colony optimization(ACO)and artificial bee colony optimization(ABC).The proposed hybrid algorithm is designed for the routing process which is transmitting the information from one place to another.The optimal routing process is used to avoid traffic and link failure.Thefitness function is designed based on Link stability and Residual energy.The validation of the proposed algorithm takes solution encoding,fitness calculation,and updat-ing functions.To perform simulation experiments,NS2 simulator software is used.The performance of the proposed approach is analyzed based on different metrics namely,delivery ratio,delay time,throughput,and overhead.The effec-tiveness of the proposed method compared with different algorithms.Compared to other existing VANET algorithms,the hybrid algorithm has proven to be very efficient in terms of packet delivery ratio and delay.
文摘Vehicular Ad hoc Networks(VANETs)become a very crucial addition in the Intelligent Transportation System(ITS).It is challenging for a VANET system to provide security services and parallelly maintain high throughput by utilizing limited resources.To overcome these challenges,we propose a blockchain-based Secured Cluster-based MAC(SCB-MAC)protocol.The nearby vehicles heading towards the same direction will form a cluster and each of the clusters has its blockchain to store and distribute the safety messages.The message which contains emergency information and requires Strict Delay Requirement(SDR)for transmission are called safety messages(SM).Cluster Members(CMs)sign SMs with their private keys while sending them to the blockchain to confirm authentication,integrity,and confidentiality of the message.A Certificate Authority(CA)is responsible for physical verification,key generation,and privacy preservation of the vehicles.We implemented a test scenario as proof of concept and tested the safety message transmission(SMT)protocol in a real-world platform.Computational and storage overhead analysis shows that the proposed protocol for SMT implements security,authentication,integrity,robustness,non-repudiation,etc.while maintaining the SDR.Messages that are less important compared to the SMs are called non-safety messages(NSM)and vehicles use RTS/CTS mechanism for NSM transmission.Numerical studies show that the proposed NSM transmission method maintains 6 times more throughput,2 times less delay and 125%less Packet Dropping Rate(PDR)than traditional MAC protocols.These results prove that the proposed protocol outperforms the traditional MAC protocols.
基金Sponsored by Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20122301120004)China Postdoctoral Science Foundation (Grant No. 2012M520778)+2 种基金Heilongjiang Province Postdoctoral Science Foundation (Grant No. LBH-Z12217)Research Foundation of Education Bureau of Heilongjiang Provincethe Youth Science Fund Project of Heilongjiang University (Grant No. QL201110)
文摘A critical challenge for mobile ad hoc networks is the design of efficient routing protocols which are able to provide high bandwidth utilization and desired fairness in mobile wireless environment without any fixed communication establishments. Although extensive efforts have already been devoted to providing optimization based distributed congestion elusion strategy for efficient bandwidth utilization and fair allocation in both wired and wireless networks,a common assumption therein is the fixed link capacities,which will unfortunately limit the application scope in mobile ad hoc networks where channels keep changing. In this paper,an effective congestion elusion strategy is presented explicitly based on ant colony algorithm for mobile ad hoc networks, which will explore the optimal route between two nodes promptly,meanwhile forecast congestion state of the link. Accordingly,a new path will be found rapidly to have the flow spread around to relieve the congestion degree. Compared with OLSR,the strategy proposed will greatly reduce the packet loss ratio and the average end-to-end delay at the same time,which illustrate that it will make use of networking resource effectively.
基金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.
基金This Paper is supported by the National Natural Science Foundation of China(Grants Nos.61761035,41761086,61461037,61661041).
文摘In recent years,with the rapid development of the Internet and wireless communication technology,wireless Ad hoc networks have received more attention.Due to the limited transmission range and energy of nodes in Ad hoc networks,it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks.This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol,which has the following two aspects of improvement:(1)In the route discovery process,a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a“Mark”bit that representing remaining energy of a node.(2)Based on(1),a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively.Simulation results demonstrate that compared with AODV and other existing routing protocols,proposed algorithm can reduce network energy consumption and balance node energy,thus extending the network lifetime.
文摘One of the fundamental properties of an ad hoc network is its connectivity. Maintaining connectivity in wireless networks is extremely difficult due to dynamic changing topology of MANETs. There are several techniques to understand the connectivity level for a given network topology. In this paper, we examine the existing methods and discuss the issues and challenges that are still insurmountable in order to enhance the connectivity properties of wireless multi hop networks.
基金This work is financially supported by Beijing Municipal Natural Science Foundation(No.L202012)the Open Research Project of the State Key Laboratory of Media Convergence and Communication,Communication University of China(No.SKLMCC2020KF008)the Fundamental Research Funds for the Central Universities(No.2020RC05).
文摘Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data synchronization was mainly studied in the latency-tolerant distributed databases,or assuming the general model of wireless ad hoc networks.In this paper,we propose a pair of linear network coding(NC)and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator’s control.We consider both data block selection and transmitting node selection for exploiting the benefits of NC.Instead of using the store-and-forward protocol as in the conventional uncoded approach,a compute-and-forward protocol is used in our scheme,which improves the transmission efficiency.The performance of the proposed algorithms is studied under different values of network size,network connection degree,and per-hop packet error rate.Simulation results demonstrate that our algorithms significantly reduce the times slots used for data synchronization compared with the baseline that does not use NC.
基金This work is financially supported by the Beijing Municipal Natural Science Foundation(L202012)the Open Research Project of the State Key Laboratory of Media Convergence and Communication,Communication University of China(SKLMCC2020KF008)the Fundamental Research Funds for the Central Universities(2020RC05).The authors would like to thank Professor Ping Zhang(Member of the Chinese Academy of Engineering,Beijing University of Posts and Telecommunications)and Professor Quan Yu(Member of the Chinese Academy of Engineering,Peng Cheng Laboratory)for their insightful comments and suggestions.
文摘As a special type of mobile ad hoc network(MANET),the flying ad hoc network(FANET)has the potential to enable a variety of emerging applications in both civilian wireless communications(e.g.,5G and 6G)and the defense industry.The routing protocol plays a pivotal role in FANET.However,when designing the routing protocol for FANET,it is conventionally assumed that the aerial nodes move randomly.This is clearly inappropriate for a mission-oriented FANET(MO-FANET),in which the aerial nodes typically move toward a given destination from given departure point(s),possibly along a roughly deterministic flight path while maintaining a well-established formation,in order to carry out certain missions.In this paper,a novel cyber–physical routing protocol exploiting the particular mobility pattern of an MO-FANET is proposed based on cross-disciplinary integration,which makes full use of the missiondetermined trajectory dynamics to construct the time sequence of rejoining and separating,as well as the adjacency matrix for each node,as prior information.Compared with the existing representative routing protocols used in FANETs,our protocol achieves a higher packet-delivery ratio(PDR)at the cost of even lower overhead and lower average end-to-end latency,while maintaining a reasonably moderate and stable network jitter,as demonstrated by extensive ns-3-based simulations assuming realistic configurations in an MO-FANET.
基金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.
基金funded by the Deanship of Scientific Research at Princess Nourah bint Abdulrahman University through the Fast-track Research Funding Program.
文摘Mobile ad hoc network(MANET)is a dynamically reconfigurable wireless network with time-variable infrastructure.Given that nodes are highly mobile,MANET’s topology often changes.These changes increase the difficulty in finding the routes that the packets use when they are routed.This study proposes an algorithm called genetic algorithm-based location-aided routing(GALAR)to enhance the MANET routing protocol efficiency.The GALAR algorithm maintains an adaptive update of the node location information by adding the transmitting node location information to the routing packet and selecting the transmitting node to carry the packets to their destination.The GALAR was constructed based on a genetic optimization scheme that considers all contributing factors in the delivery behavior using criterion function optimization.Simulation results showed that the GALAR algorithm can make the probability of packet delivery ratio more than 99%with less network overhead.Moreover,GALAR was compared to other algorithms in terms of different network evaluation measures.The GALAR algorithm significantly outperformed the other algorithms that were used in the study.
基金Sponsored by the National Natural Science Foundation of China(Grant No. 60432040)the Program for New Century Excellent Talents in University(Grant No.NCET-04-0332)
文摘Route flapping is common in mobile Ad hoc networks.It usually causes large delay or even interruption during communication.This paper proposed a routing protocol AODV-RM to alleviate this effect.AODV-RM selects routes with the lightest traffic load,to avoid striving for hot nodes with other users,hence minishes the chance of collision.AODV-RM keeps all valid routes to the destination in its routing table as backups.When the link under usage breaks down,AODV-RM shifts to a valid route in its routing table instead of route repair or researching,which ensures the continuity of communication.AODV-RM chooses a route maintenance scheme by the network topology.If the origination has multi routes to the destination,only the origination maintains routes.Otherwise,middle nodes,instead of the origination,maintain sub-routes to the destination.By simulating the traditional AODV and AODV-RM,the results showed that AODV-RM has a lower drop rate and better performance against route flapping.
基金This work was funded by the National Basic Research Program (973 Program) of China under Grant 2007CB310704.
文摘An Ad hoc network is composed of wireless mobile nodes.Because there is no other wired infrastructure such as base stations,the ad hoc network,unlike other wireless networks such as Wireless Local Area Network(WLAN),has to face attacks from both the control plane and the data plane.Ad hoc should ensure the routing security on the control plane,and the secure forwarding of packets on the data plane.The distributed network protocol should operate safely,and peer-to-peer nodes should have trusting relations for each other.For this purpose,a complete security solution should include three parts:security on the control plane,security on the data plane,and security of key management.
文摘Over the course of the last 10 years, research on Mobile Ad Hoc Networks has witnessed high levels of focus. Because of this field being a relatively new topic, most researchers have focused on using simulation as the first choice for performance measurement and evaluation. In order to contribute to the credibility and reliability of research results on Ad Hoc networks, this paper addresses the issue of choosing parameter values that are used as input for simulators used in such experiments by surveying a sample of recently published papers on Ad Hoc Networks. Results show that in the majority of revised papers, the simulation environment is not carefully planned as reflected by the diversity and quality of parameters used.
文摘Mobile Ad hoc Network (MANET) is a wireless network consisting of mobile devices (laptops, smart phones, etc.) that move and communicate with each other without the use of any existing network infrastructure or centralized server to avoid collisions which have negative effects on the performance of the network. Access to the shared media is controlled by a Backoff algorithm that is a part of the Media Access Protocol. In this paper, we improve the History Based Probabilistic Backoff (HPPB) algorithm by modifying the increment/decrement behavior of the Contention Window to introduce History Based Increment Backoff (HBIB) algorithm which outperforms HBPB in terms of throughput and end-to-end delay with various numbers of nodes and different traffic loads.
文摘The unique anywhere, anytime wireless communication support offers, tremendous potential for the next generation of applications in a Mobile Ad-hoc Network (MANET). The Quality of Service (QoS) has been the ever demanding task of wireless communication to satisfy the application requirements. Geographical routing employs a greedy forwarding technique to deliver the packets to the destination and to owe the communication void, it fails to render the expected level of QoS. Opportunistic routing technique effectively utilizes the advantages of broadcasting nature of the wireless medium and selects a set of forwarding candidates instead of relying on a greedy node. To improve the efficiency of QoS routing in sparse and highly dynamic network topology, this paper proposes the Void-Aware Position based Opportunistic Routing (VAPOR). The VAPOR maintains 2-hop neighbor information to take a routing decision, but it is limited to 1-hop information when the node density is high. It efficiently balances the storage overhead and communication delay due to void and it increases the network throughput even under a sparse network. To provide a certain assurance level for packet reachability, VAPOR decides the potential forwarders based on the forwarding probability that measures link stability, capacity, and connectivity factor. It adaptively favors a path that avoids frequent link failure and unreliable link usage. By limiting the propagation area of duplicate packets, VAPOR reduces wastage of network resources, and ittakes the advantage of concurrent batch forwarding to avoid further duplication and unnecessary delay.
基金the National High Technology Development "863" Program of China (2006AA01Z436, 2007AA01Z452)the National Natural Science Foundation of China(60702042).
文摘Mobile ad hoc networking (MANET) has become an exciting and important technology in recent years,because of the rapid proliferation of wireless devices.Mobile ad hoc networks is highly vulnerable to attacks due to the open medium,dynamically changing network topology,cooperative algorithms,and lack of centralized monitoring and management point.The traditional way of protecting networks with firewalls and encryption software is no longer suffcient and effective for those features.A distributed intrusion detection approach based on timed automata is given.A cluster-based detection scheme is presented,where periodically a node is elected as the monitor node for a cluster.These monitor nodes can not only make local intrusion detection decisions,but also cooperatively take part in global intrusion detection.And then the timed automata is constructed by the way of manually abstracting the correct behaviours of the node according to the routing protocol of dynamic source routing (DSR).The monitor nodes can verify the behaviour of every nodes by timed automata,and validly detect real-time attacks without signatures of intrusion or trained data.Compared with the architecture where each node is its own IDS agent,the approach is much more effcient while maintaining the same level of effectiveness.Finally,the intrusion detection method is evaluated through simulation experiments.
基金Supported by the National Natural Science Funda-tion of China (60403027)
文摘In traditional networks ,the authentication is performed by certificate authoritys(CA),which can’t be built in distributed mobile Ad Hoc Networks however. In this paper, we propose a fully self-organized public key management based on bidirectional trust model without any centralized authority that allows users to generate their public-private key pairs, to issue certificates, and the trust relation spreads rationally according to the truly human relations. In contrast with the traditional self-organized public-key management, the average certificates paths get more short,the authentication passing rate gets more high and the most important is that the bidirectional trust based model satisfys the trust requirement of hosts better.