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.展开更多
A channel assignment algorithm with awareness of link traffic is proposed in multi-radio multi-channel wireless mesh networks. First, the physical interference model based on the signal-to-interference-plus-noise rati...A channel assignment algorithm with awareness of link traffic is proposed in multi-radio multi-channel wireless mesh networks. First, the physical interference model based on the signal-to-interference-plus-noise ratio and successful transmission condition is described. The model is more suitable for a wireless communication environment than other existing models. Secondly, a pure integer quadratic programming （PIQP） model is used to solve the channel assignment problem and improve the capacity of wireless mesh networks. Consequently, a traffic- aware static channel assignment algorithm（TASC） is designed. The algorithm adopts some network parameters, including the network connectivity, the limitation of the number of radios and the successful transmission conditions in wireless communications. The TASC algorithm can diminish network interference and increase the efficiency of channel assignment while keeping the connectivity of the network. Finally, the feasibility and effectivity of the channel assignment solution are illustrated by the simulation results. Compared witb similar algorithms, the proposed algorithm can increase the capacity of WMNs.展开更多
With ensured network connectivity in quantum channels, the issue of distributing entangled particles in wireless quantum communication mesh networks can be equivalently regarded as a problem of quantum backbone nodes ...With ensured network connectivity in quantum channels, the issue of distributing entangled particles in wireless quantum communication mesh networks can be equivalently regarded as a problem of quantum backbone nodes selection in order to save cost and reduce complexity. A minimum spanning tree（ MST）-based quantum distribution algorithm（ QDMST） is presented to construct the mesh backbone network. First, the articulation points are found,and for each connected block uncovered by the articulation points, the general centers are solved. Then, both articulation points and general centers are classified as backbone nodes and an M ST is formed. The quantum path between every two neighbor nodes on the MST is calculated. The nodes on these paths are also classified as backbone nodes. Simulation results validate the advantages of QDMST in the average backbone nodes number and average quantum channel distance compared to the existing random selection algorithm under multiple network scenarios.展开更多
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.展开更多
This paper focuses on investigating immunological principles in designing a multi-agent security architecture for intrusion detection and response in wireless mesh networks.In this approach,the immunity-based agents m...This paper focuses on investigating immunological principles in designing a multi-agent security architecture for intrusion detection and response in wireless mesh networks.In this approach,the immunity-based agents monitor the situation in the network.These agents can take appropriate actions according to the underlying security policies.Specifically,their activities are coordinated in a hierarchical fashion while sensing,communicating,determining and generating responses.Such an agent can learn about and adapt to its environment dynamically and can detect both known and unknown intrusions.The proposed intrusion detection architecture is designed to be flexible,extendible,and adaptable so that it can perform real-time monitoring.This paper provides the conceptual view and a general framework of the proposed system.In the end,the architecture is illustrated by an example and by simulation to show it can prevent attacks efficiently.展开更多
In this paper, we propose a multi-source multi-path video streaming system for supporting high quality concurrent video-on-demand (VoD) services over wireless mesh networks (WMNs), and leverage forward error correctio...In this paper, we propose a multi-source multi-path video streaming system for supporting high quality concurrent video-on-demand (VoD) services over wireless mesh networks (WMNs), and leverage forward error correction to enhance the error resilience of the system. By taking wireless interference into consideration, we present a more realistic networking model to capture the characteristics of WMNs and then design a route selection scheme using a joint rate/interference-distortion optimiza- tion framework to help the system optimally select concurrent streaming paths. We mathematically formulate such a route selec- tion problem, and solve it heuristically using genetic algorithm. Simulation results demonstrate the effectiveness of our proposed scheme.展开更多
Wireless Mesh Networks （WMNs） are vulnerable to various security threats because of their special infrastructure and communication mode, wherein insider attacks are the most challenging issue. To address this proble...Wireless Mesh Networks （WMNs） are vulnerable to various security threats because of their special infrastructure and communication mode, wherein insider attacks are the most challenging issue. To address this problem and protect innocent users from malicious attacks, it is important to encourage cooperation and deter malicious behaviors. Reputation systems constitute a major category of techniques used for managing trust in distributed networks, and they are effective in characterizing and quantifying a node＇s behavior for WMNs. However, conventional layered reputation mechanisms ignore several key factors of reputation in other layers; therefore, they cannot provide optimal performance and accurate malicious node identification and isolation for WMNs. In this paper, we propose a novel dynamic reputation mechanism, SLCRM, which couples reputation systems with a cross-layer design and node-security-rating classification techniques to dynamically detect and restrict insider attacks. Simulation results show that in terms of network throughput, packet delivery ratio, malicious nodes＇ identification, and success rates, SI_CRM imple- ments security protection against insider attacks in a more dynamic, effective, and efficient manner than the subjective logic and uncertainty-based reputation model and the familiarity-based reputation model.展开更多
Wireless Mesh Networks is vulnerable to attacks due to the open medium, dynamically changing network topology, cooperative algorithms, Lack of centralized monitoring and management point. The traditional way of protec...Wireless Mesh Networks is vulnerable to attacks due to the open medium, dynamically changing network topology, cooperative algorithms, Lack of centralized monitoring and management point. The traditional way of protecting networks with firewalls and encryption software is no longer suffi- cient and effective for those features. In this paper, we propose a distributed intrusion detection ap- proach based on timed automata. 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 we con- struct the Finite State Machine （FSM） by the way of manually abstracting the correct behaviors of the node according to the routing protocol of Dynamic Source Routing （DSR）. The monitor nodes can verify every node＇s behavior by the Finite State Ma- chine （FSM）, 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, our approach is much more efficient while maintaining the same level of effectiveness. Finally, we evaluate the intrusion detection method through simulation experiments.展开更多
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.展开更多
This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies gateways and assigns m...This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies gateways and assigns mesh routers to identified gateways. The new algorithm can guarantee to find a feasible gateway placement satisfying Quality-of-Service (QoS) constraints, including delay constraint, relay load constraint and gateway capacity constraint. Experimental results show that its performance is as good as that of the best of existing algorithms for the gateway placement problem. But, the new algorithm can be used for BWMNs that do not form one connected component, and it is easy to implement and use.展开更多
Communication security is a critical aspect of QoS provisioning in wireless mesh network （WMN）. Because of the inherent characteristics of WMN, conventional security mechanisms cannot be applied. In order to guarant...Communication security is a critical aspect of QoS provisioning in wireless mesh network （WMN）. Because of the inherent characteristics of WMN, conventional security mechanisms cannot be applied. In order to guarantee the communication security, a novel communication security mechanism is proposed. The mechanism uses a communication encryption scheme to encrypt data packets and employs a risk avoidance scheme to avoid the malicious nodes during communications. Simulation results indicate that the mechanism is able to provide secure communication effectively and reduce the damage of attacks through multiple paths.展开更多
基金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.
基金The National Basic Research Program of China(973Program)(No.2009CB320501)the Natural Science Foundation of Jiangsu Province(No.BK2010414)+1 种基金China Postdoctoral Science Foundation(No.20100480071)Specialized Research Fund for the Doctoral Program of Higher Education(No.20090092120029)
文摘A channel assignment algorithm with awareness of link traffic is proposed in multi-radio multi-channel wireless mesh networks. First, the physical interference model based on the signal-to-interference-plus-noise ratio and successful transmission condition is described. The model is more suitable for a wireless communication environment than other existing models. Secondly, a pure integer quadratic programming （PIQP） model is used to solve the channel assignment problem and improve the capacity of wireless mesh networks. Consequently, a traffic- aware static channel assignment algorithm（TASC） is designed. The algorithm adopts some network parameters, including the network connectivity, the limitation of the number of radios and the successful transmission conditions in wireless communications. The TASC algorithm can diminish network interference and increase the efficiency of channel assignment while keeping the connectivity of the network. Finally, the feasibility and effectivity of the channel assignment solution are illustrated by the simulation results. Compared witb similar algorithms, the proposed algorithm can increase the capacity of WMNs.
基金Prospective Research Project on Future Networks of Jiangsu Province,China(No.BY2013095-1-18)
文摘With ensured network connectivity in quantum channels, the issue of distributing entangled particles in wireless quantum communication mesh networks can be equivalently regarded as a problem of quantum backbone nodes selection in order to save cost and reduce complexity. A minimum spanning tree（ MST）-based quantum distribution algorithm（ QDMST） is presented to construct the mesh backbone network. First, the articulation points are found,and for each connected block uncovered by the articulation points, the general centers are solved. Then, both articulation points and general centers are classified as backbone nodes and an M ST is formed. The quantum path between every two neighbor nodes on the MST is calculated. The nodes on these paths are also classified as backbone nodes. Simulation results validate the advantages of QDMST in the average backbone nodes number and average quantum channel distance compared to the existing random selection algorithm under multiple network scenarios.
基金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.
基金supported by National Natural Science Foundation of China under Grant No.60932003National High Technical Research and Development Program of China(863 program) Grant No.2007AA01Z452,No.2009AA01Z118+1 种基金Shanghai Municipal Natural Science Foundation under Grant No.09ZR1414900National Undergraduate Innovative Test Program under Grant No.091024812
文摘This paper focuses on investigating immunological principles in designing a multi-agent security architecture for intrusion detection and response in wireless mesh networks.In this approach,the immunity-based agents monitor the situation in the network.These agents can take appropriate actions according to the underlying security policies.Specifically,their activities are coordinated in a hierarchical fashion while sensing,communicating,determining and generating responses.Such an agent can learn about and adapt to its environment dynamically and can detect both known and unknown intrusions.The proposed intrusion detection architecture is designed to be flexible,extendible,and adaptable so that it can perform real-time monitoring.This paper provides the conceptual view and a general framework of the proposed system.In the end,the architecture is illustrated by an example and by simulation to show it can prevent attacks efficiently.
文摘In this paper, we propose a multi-source multi-path video streaming system for supporting high quality concurrent video-on-demand (VoD) services over wireless mesh networks (WMNs), and leverage forward error correction to enhance the error resilience of the system. By taking wireless interference into consideration, we present a more realistic networking model to capture the characteristics of WMNs and then design a route selection scheme using a joint rate/interference-distortion optimiza- tion framework to help the system optimally select concurrent streaming paths. We mathematically formulate such a route selec- tion problem, and solve it heuristically using genetic algorithm. Simulation results demonstrate the effectiveness of our proposed scheme.
基金supported by the Program for Changjiang Scholars and Innovative Research Team in University under Grant No.IRT1078the Key Program of NSFC-Guangdong Union Foundation under Grant No.U1135002+1 种基金Major National S&T Program under Grant No.2011ZX03005-002the Fundamental Research Funds for the Central Universities under Grant No.JY10000903001
文摘Wireless Mesh Networks （WMNs） are vulnerable to various security threats because of their special infrastructure and communication mode, wherein insider attacks are the most challenging issue. To address this problem and protect innocent users from malicious attacks, it is important to encourage cooperation and deter malicious behaviors. Reputation systems constitute a major category of techniques used for managing trust in distributed networks, and they are effective in characterizing and quantifying a node＇s behavior for WMNs. However, conventional layered reputation mechanisms ignore several key factors of reputation in other layers; therefore, they cannot provide optimal performance and accurate malicious node identification and isolation for WMNs. In this paper, we propose a novel dynamic reputation mechanism, SLCRM, which couples reputation systems with a cross-layer design and node-security-rating classification techniques to dynamically detect and restrict insider attacks. Simulation results show that in terms of network throughput, packet delivery ratio, malicious nodes＇ identification, and success rates, SI_CRM imple- ments security protection against insider attacks in a more dynamic, effective, and efficient manner than the subjective logic and uncertainty-based reputation model and the familiarity-based reputation model.
基金Acknowledgements Project supported by the National Natural Science Foundation of China （Grant No.60932003）, the National High Technology Development 863 Program of China （Grant No.2007AA01Z452, No. 2009AA01 Z118 ）, Project supported by Shanghai Municipal Natural Science Foundation （Grant No.09ZRI414900）, National Undergraduate Innovative Test Program （091024812）.
文摘Wireless Mesh Networks is vulnerable to attacks due to the open medium, dynamically changing network topology, cooperative algorithms, Lack of centralized monitoring and management point. The traditional way of protecting networks with firewalls and encryption software is no longer suffi- cient and effective for those features. In this paper, we propose a distributed intrusion detection ap- proach based on timed automata. 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 we con- struct the Finite State Machine （FSM） by the way of manually abstracting the correct behaviors of the node according to the routing protocol of Dynamic Source Routing （DSR）. The monitor nodes can verify every node＇s behavior by the Finite State Ma- chine （FSM）, 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, our approach is much more efficient while maintaining the same level of effectiveness. Finally, we evaluate the intrusion detection method through simulation experiments.
基金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.
文摘This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies gateways and assigns mesh routers to identified gateways. The new algorithm can guarantee to find a feasible gateway placement satisfying Quality-of-Service (QoS) constraints, including delay constraint, relay load constraint and gateway capacity constraint. Experimental results show that its performance is as good as that of the best of existing algorithms for the gateway placement problem. But, the new algorithm can be used for BWMNs that do not form one connected component, and it is easy to implement and use.
基金This project was supported by the National Natural Science Foundation of China (60573129).
文摘Communication security is a critical aspect of QoS provisioning in wireless mesh network （WMN）. Because of the inherent characteristics of WMN, conventional security mechanisms cannot be applied. In order to guarantee the communication security, a novel communication security mechanism is proposed. The mechanism uses a communication encryption scheme to encrypt data packets and employs a risk avoidance scheme to avoid the malicious nodes during communications. Simulation results indicate that the mechanism is able to provide secure communication effectively and reduce the damage of attacks through multiple paths.
