In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work invo...In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work involves maintaining multiple tokens across the network.To prevent mutual interference among multi-token holders,we introduce the time and space non-interference theorems.Furthermore,we propose a master-slave strategy between tokens.When the master token holder(MTH)performs the neighbor discovery,it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders(STHs).Using this approach,the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other.Building on this foundation,we provide a comprehensive procedure for the M-SAND protocol.We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability.Finally,simulation results demonstrate the time efficiency of the M-SAND protocol.When compared to the QSAND protocol,which uses only one token,the total neighbor discovery time is reduced by 28% when 6beams and 112 nodes are employed.展开更多
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.展开更多
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 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.展开更多
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.展开更多
Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,local...Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data speed,efficiency and determines the path and optimization problem.In comparison with other models,the proposed method yielded an efficient communication,increased the throughput,and reduced the end-to-end delay,energy consumption and packet loss performance in disaster area networks.展开更多
针对避免广播冲突的CR Ad Hoc网络的分布式广播协议广播成功率低和基于选择性广播信道集的低延迟广播算法广播冲突率高的问题,提出基于中继节点选择的多跳CR Ad Hoc网络广播算法。根据节点可用信道集的大小和基于邻居度的转发概率选取...针对避免广播冲突的CR Ad Hoc网络的分布式广播协议广播成功率低和基于选择性广播信道集的低延迟广播算法广播冲突率高的问题,提出基于中继节点选择的多跳CR Ad Hoc网络广播算法。根据节点可用信道集的大小和基于邻居度的转发概率选取中继节点,并对相应中继节点的可用信道集随机左移,在保证一定广播成功率、广播时延和广播冲突率的前提下,降低节点转发率,减少网络中的冗余信息;建立综合评价函数对广播算法的综合性能进行了定量分析;给出广播冲突概率推导。仿真结果表明,该算法与分布式广播协议相比,提高了广播成功率,降低了广播时延;与低延迟广播算法相比,降低了节点转发率和广播冲突概率。根据综合评价函数,该广播算法的综合性能更好。展开更多
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...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 sufficient 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 efficient while maintaining the same level of effectiveness. Finally, the intrusion detection method is evaluated through simulation experiments.展开更多
Mobile ad hoc networks are particularly vulnerable to denial of service (DOS) attacks launched through compromised nodes or intruders. In this paper, we present a new DOS attack and its defense in ad hoc networks. T...Mobile ad hoc networks are particularly vulnerable to denial of service (DOS) attacks launched through compromised nodes or intruders. In this paper, we present a new DOS attack and its defense in ad hoc networks. The new DOS attack, called AA hoc Flooding Attack(AHFA), is that intruder broadcasts mass Route Request packets to exhaust the communication bandwidth and node resource so that the valid communication can not be kept. After analyzed AM hoc Flooding Attack, we develop Flooding Attack Prevention (FAP), a genetic defense against the AM hoc Flooding Attack. When the intruder broadcasts exceeding packets of Route Request, the immediate neighbors of the intruder record the rate of Route Request. Once the threshold is exceeded, nodes deny any future request packets from the intruder. The results of our implementation show FAP can prevent the AM hoe Flooding attack efficiently.展开更多
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 pa per, we propose a fully self-organized public k...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 pa per, 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 re quirement of hosts better.展开更多
A dynamic protocol stack(DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol sta...A dynamic protocol stack(DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol stack, DPS operates in a dynamic and adaptive manner and is scalable to network condition changes. In addition, a protocol construction algorithm is proposed to dynamically construct of the protocol stack each network node. Simulation results show that, the processing and forwarding performance of our scheme is close to 1 Gb/s, and the performance of our algorithm is close to that of the classical algorithms with much lower complexity.展开更多
A QoS routing protocol based on mobility prediction is proposed. The protocol selects the steadiest path based on mobility prediction and QoS requirements on bandwidth, delay, and so forth. The main properties of the ...A QoS routing protocol based on mobility prediction is proposed. The protocol selects the steadiest path based on mobility prediction and QoS requirements on bandwidth, delay, and so forth. The main properties of the protocol as follows. (1) Each node just broadcasts its own information, so the packet is very small and can get to the destination in a very short time. (2) When another path is built for the same QoS requirements, the original path has higher priority. (3) The update messages are reduced by using mobility prediction. (4) Data packets carry the information of link change using piggyback, which is helpful for forecasting the link status more accurately. (5) When source node gets Resource Reserve and reconnect packets at the same time, it selects reconnect packet over Resource Reserve packet. The results of simulation show that the protocol has good network performance with low control overload, and efficiently supports transmitting multimedia with QoS requirements in mobile ad hoc networks.展开更多
In wireless ad hoe network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multi...In wireless ad hoe network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multicast in wireless ad hoe network is a difficult issue. It is a major challenge to transmission delays and packet losses due to link changes of a multicast tree at the provision of high delivery ratio for each packet transmission in wireless ad hoe network environment. In this paler, we propose and evaluate Reliable Adaptive Multicast Protocol (RAMP) based on a relay node concept. Relay nodes are placed along the multieast tree. Data recovery is done between relay nodes. RAMP supports a reliable multicasting suitable for mobile ad hoe network by reducing the number of packet retransmissions. We compare RAMP with SRM (Scalable Reliable Multicast). Simulation results show that the RAMP has high delivery ratio and low end-to-end delay for packet transmsission.展开更多
Because the intrinsic characteristics of mobile ad hoc networks(MANETs) cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of secu...Because the intrinsic characteristics of mobile ad hoc networks(MANETs) cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns.Until recently,lots of anonymous routing protocols have been proposed.However,most of them are single path or use one path at a time,and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously.Thus an anonymous multipath routing protocol based on secret sharing is proposed.The protocol provides identity anonymity,location anonymity,data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process.Meanwhile,a hash function is introduced to detect active attacks in the data transmission process.The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks(such as interception and physical destroy attacks).Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.展开更多
To study multi-radio multi-channel (MR-MC) Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer ro...To study multi-radio multi-channel (MR-MC) Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer routing (JCACR), is presented. Firstly, this paper introduces a new concept called channel utilization percentage (CUP), which is for measuring the contention level of different channels in a node’s neighborhood, and deduces its optimal value for determining whether a channel is overloaded or not. Then, a metric parameter named channel selection metric (CSM) is designed, which actually reffects not only the channel status but also corresponding node’s capacity to seize it. JCACR evaluates channel assignment by CSM, performs a local optimization by assigning each node a channel with the smaller CSM value, and changes the working channel dynamically when the channel is overloaded. Therefore, the network load balancing can be achieved. In addition, simulation shows that, when compared with the protocol of weighted cumulative expected transfer time (WCETT), the new protocol can improve the network throughput and reduce the end-to-end average delay with fewer overheads.展开更多
基金supported in part by the National Natural Science Foundations of CHINA(Grant No.61771392,No.61771390,No.61871322 and No.61501373)Science and Technology on Avionics Integration Laboratory and the Aeronautical Science Foundation of China(Grant No.201955053002 and No.20185553035)。
文摘In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work involves maintaining multiple tokens across the network.To prevent mutual interference among multi-token holders,we introduce the time and space non-interference theorems.Furthermore,we propose a master-slave strategy between tokens.When the master token holder(MTH)performs the neighbor discovery,it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders(STHs).Using this approach,the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other.Building on this foundation,we provide a comprehensive procedure for the M-SAND protocol.We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability.Finally,simulation results demonstrate the time efficiency of the M-SAND protocol.When compared to the QSAND protocol,which uses only one token,the total neighbor discovery time is reduced by 28% when 6beams and 112 nodes are employed.
文摘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.
文摘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.
基金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.
文摘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.
文摘Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data speed,efficiency and determines the path and optimization problem.In comparison with other models,the proposed method yielded an efficient communication,increased the throughput,and reduced the end-to-end delay,energy consumption and packet loss performance in disaster area networks.
文摘针对避免广播冲突的CR Ad Hoc网络的分布式广播协议广播成功率低和基于选择性广播信道集的低延迟广播算法广播冲突率高的问题,提出基于中继节点选择的多跳CR Ad Hoc网络广播算法。根据节点可用信道集的大小和基于邻居度的转发概率选取中继节点,并对相应中继节点的可用信道集随机左移,在保证一定广播成功率、广播时延和广播冲突率的前提下,降低节点转发率,减少网络中的冗余信息;建立综合评价函数对广播算法的综合性能进行了定量分析;给出广播冲突概率推导。仿真结果表明,该算法与分布式广播协议相比,提高了广播成功率,降低了广播时延;与低延迟广播算法相比,降低了节点转发率和广播冲突概率。根据综合评价函数,该广播算法的综合性能更好。
基金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 sufficient 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 efficient while maintaining the same level of effectiveness. Finally, the intrusion detection method is evaluated through simulation experiments.
基金This project was supported by the National"863"High Technology Development Programof China (2003AA148010) Key Technologies R&D Programof China (2002DA103A03 -07)
文摘Mobile ad hoc networks are particularly vulnerable to denial of service (DOS) attacks launched through compromised nodes or intruders. In this paper, we present a new DOS attack and its defense in ad hoc networks. The new DOS attack, called AA hoc Flooding Attack(AHFA), is that intruder broadcasts mass Route Request packets to exhaust the communication bandwidth and node resource so that the valid communication can not be kept. After analyzed AM hoc Flooding Attack, we develop Flooding Attack Prevention (FAP), a genetic defense against the AM hoc Flooding Attack. When the intruder broadcasts exceeding packets of Route Request, the immediate neighbors of the intruder record the rate of Route Request. Once the threshold is exceeded, nodes deny any future request packets from the intruder. The results of our implementation show FAP can prevent the AM hoe Flooding attack efficiently.
基金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 pa per, 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 re quirement of hosts better.
基金supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China (Grant No. 2014ZX03006003)the ZTE Research and Development Fund
文摘A dynamic protocol stack(DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol stack, DPS operates in a dynamic and adaptive manner and is scalable to network condition changes. In addition, a protocol construction algorithm is proposed to dynamically construct of the protocol stack each network node. Simulation results show that, the processing and forwarding performance of our scheme is close to 1 Gb/s, and the performance of our algorithm is close to that of the classical algorithms with much lower complexity.
基金TheNationalHighTechnologyDevelopment"863"Program(No.2 0 0 1AA112051),TheNationalScienceFundforOverseasDistinguishedYoungScholars (No .6992 82 0 1)
文摘A QoS routing protocol based on mobility prediction is proposed. The protocol selects the steadiest path based on mobility prediction and QoS requirements on bandwidth, delay, and so forth. The main properties of the protocol as follows. (1) Each node just broadcasts its own information, so the packet is very small and can get to the destination in a very short time. (2) When another path is built for the same QoS requirements, the original path has higher priority. (3) The update messages are reduced by using mobility prediction. (4) Data packets carry the information of link change using piggyback, which is helpful for forecasting the link status more accurately. (5) When source node gets Resource Reserve and reconnect packets at the same time, it selects reconnect packet over Resource Reserve packet. The results of simulation show that the protocol has good network performance with low control overload, and efficiently supports transmitting multimedia with QoS requirements in mobile ad hoc networks.
文摘In wireless ad hoe network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multicast in wireless ad hoe network is a difficult issue. It is a major challenge to transmission delays and packet losses due to link changes of a multicast tree at the provision of high delivery ratio for each packet transmission in wireless ad hoe network environment. In this paler, we propose and evaluate Reliable Adaptive Multicast Protocol (RAMP) based on a relay node concept. Relay nodes are placed along the multieast tree. Data recovery is done between relay nodes. RAMP supports a reliable multicasting suitable for mobile ad hoe network by reducing the number of packet retransmissions. We compare RAMP with SRM (Scalable Reliable Multicast). Simulation results show that the RAMP has high delivery ratio and low end-to-end delay for packet transmsission.
基金supported by the National Basic Research Program of China(973 Program)(2011CB302903)the Key Program of Natural Science for Universities of Jiangsu Province(10KJA510035)+2 种基金the Science and Technology Innovation Group Foundation of Jiangsu Province ("Qing and Lan" Project)the Postgraduate Innovation Project Foundation of Jiangsu Province(CX10B 194ZCX09B 152Z)
文摘Because the intrinsic characteristics of mobile ad hoc networks(MANETs) cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns.Until recently,lots of anonymous routing protocols have been proposed.However,most of them are single path or use one path at a time,and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously.Thus an anonymous multipath routing protocol based on secret sharing is proposed.The protocol provides identity anonymity,location anonymity,data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process.Meanwhile,a hash function is introduced to detect active attacks in the data transmission process.The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks(such as interception and physical destroy attacks).Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.
基金supported by the National Natural Science Foundationof China (60873195 61070220)+3 种基金the Natural Science Foundation of Anhui Province (070412049)the Outstanding Young Teacher Foundation of Anhui Higher Education Institutions of China (2009SQRZ167)the Natural Science Foundation of Anhui Higher Education Institutions of China (KJ2009B114)the Open Project Program of Engineering Research Center of Safety Critical Industry Measure and Control Technology (SCIMCT0802)
文摘To study multi-radio multi-channel (MR-MC) Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer routing (JCACR), is presented. Firstly, this paper introduces a new concept called channel utilization percentage (CUP), which is for measuring the contention level of different channels in a node’s neighborhood, and deduces its optimal value for determining whether a channel is overloaded or not. Then, a metric parameter named channel selection metric (CSM) is designed, which actually reffects not only the channel status but also corresponding node’s capacity to seize it. JCACR evaluates channel assignment by CSM, performs a local optimization by assigning each node a channel with the smaller CSM value, and changes the working channel dynamically when the channel is overloaded. Therefore, the network load balancing can be achieved. In addition, simulation shows that, when compared with the protocol of weighted cumulative expected transfer time (WCETT), the new protocol can improve the network throughput and reduce the end-to-end average delay with fewer overheads.