The working of a Mobile Ad hoc NETwork(MANET)relies on the supportive cooperation among the network nodes.But due to its intrinsic features,a misbehaving node can easily lead to a routing disorder.This paper presents ...The working of a Mobile Ad hoc NETwork(MANET)relies on the supportive cooperation among the network nodes.But due to its intrinsic features,a misbehaving node can easily lead to a routing disorder.This paper presents two trust-based routing schemes,namely Trust-based Self-Detection Routing(TSDR)and Trust-based Cooperative Routing(TCOR)designed with an Ad hoc On-demand Distance Vector(AODV)protocol.The proposed work covers a wide range of security challenges,including malicious node identification and prevention,accurate trust quantification,secure trust data sharing,and trusted route maintenance.This brings a prominent solution for mitigating misbehaving nodes and establishing efficient communication in MANET.It is empirically validated based on a performance comparison with the current Evolutionary Self-Cooperative Trust(ESCT)scheme,Generalized Trust Model(GTM),and the conventional AODV protocol.The extensive simulations are conducted against three different varying network scenarios.The results affirm the improved values of eight popular performance metrics overcoming the existing routing schemes.Among the two proposed works,TCOR is more suitable for highly scalable networks;TSDR suits,however,the MANET application better with its small size.This work thus makes a significant contribution to the research community,in contrast to many previous works focusing solely on specific security aspects,and results in a trade-off in the expected values of evaluation parameters and asserts their efficiency.展开更多
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.展开更多
In order to save the energy and reduce the latency of the end-to-end transmission in mobile ad hoc networks an adaptive and distance-driven power control ADPC scheme is proposed by means of distance research in random...In order to save the energy and reduce the latency of the end-to-end transmission in mobile ad hoc networks an adaptive and distance-driven power control ADPC scheme is proposed by means of distance research in random geometrics. Through mathematical proof the optimal number of relay nodes and the optimal location of each node for data transmission can be obtained when a distance is given.In the ADPC first the source node computes the optimal number and the sites of the relay nodes between the source and the destination nodes.Then it searches feasible relay nodes around the optimal virtual relay-sites and selects one link with the minimal total transmission energy consumption for data transmission.Simulation results show that the ADPC can reduce both the energy dissipation and the end-to-end latency of the transmission.展开更多
An improved internetworking approach is proposed to enhance the Internet connectivity which is deteriorated due to unidirectional links and blind rebroadcasting of gateway discovery packets for mobile ad hoc networks....An improved internetworking approach is proposed to enhance the Internet connectivity which is deteriorated due to unidirectional links and blind rebroadcasting of gateway discovery packets for mobile ad hoc networks. The hybrid gateway discovery scheme that combined the advantages of a proactive and reactive gateway discovery approach is used to achieve high connectivity while keeping overhead costs low. By exchanging ad hoc on-demand distance vector （AODV） hello packet which includes additional fields named symmetric neighbor list and asymmetric neighbor list, unidirectional links are removed from route computation and broadcast storm can also be relieved simultaneously. Performance results using ns-2 simulations, under varying numbers of unidirectional links and node speeds, show that this improved Internet connectivity approach can provide better performance than others.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is b...A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.展开更多
We propose an on-demand multipath routing algorithm in a mobile ad hoc network for video transmission and evaluate its real world performance in video streaming application. There have been a number of multipath routi...We propose an on-demand multipath routing algorithm in a mobile ad hoc network for video transmission and evaluate its real world performance in video streaming application. There have been a number of multipath routing protocols extended from AODV which is a well-known single path routing protocol. Multipath routing protocols indicate good performance in the reduction of route discovery latency and unnecessary routing packets in simulations. We show that the route establishment using source route lists provided by us (Hu and Johnson, 2002) can reduce the route discovery latency, select stable routes automatically, and work well for live video streaming without limitation of the hop count based approaches. We evaluate this proposed method compared with the original AODV by using eight laptop PCs and demonstrate live streaming experiments.展开更多
This paper focuses on investigating immunological principles in designing a multi-agent security architecture for intrusion detection and response in mobile ad hoc networks. In this approach, the immunity-based agents...This paper focuses on investigating immunological principles in designing a multi-agent security architecture for intrusion detection and response in mobile ad hoc 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, decision and generating responses. Such an agent can learn 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 that 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 to show it can prevent the attack efficiently.展开更多
Mobile ad-hoc networks (MANETs) are a specific kind of wireless networks that can be quickly deployed without pre- existing infrastructures. They are used in different contexts such as collaborative, medical, military...Mobile ad-hoc networks (MANETs) are a specific kind of wireless networks that can be quickly deployed without pre- existing infrastructures. They are used in different contexts such as collaborative, medical, military or embedded applications. However, MANETs raise new challenges when they are used in large scale network that contain a large number of nodes. Subsequently, many clustering algorithms have emerged. In fact, these clustering algorithms allow the structuring of the network into groups of entities called clusters creating a hierarchical structure. Each cluster contains a particular node called cluster head elected as cluster head according to a specific metric or a combination of metrics such as identity, degree, mobility, weight, density, etc. MANETs has drawbacks due to both the characteristics of the transmission medium (transmission medium sharing, low bandwidth, etc.) and the routing protocols (information diffusion, path finding, etc.). Clustering in mobile ad hoc networks plays a vital role in improving resource management and network performance (routing delay, bandwidth consumption and throughput). In this paper, we present a study and analyze of some existing clustering approaches for MANETs that recently appeared in literature, which we classify as: Identifier Neighbor based clustering, Topology based clustering, Mobility based clustering, Energy based clustering, and Weight based clustering. We also include clustering definition, review existing clustering approaches, evaluate their performance and cost, discuss their advantages, disadvantages, features and suggest a best clustering approach.展开更多
Due to their characteristics of dynamic topology, wireless channels and limited resources, mobile ad hoc networks are particularly vulnerable to a denial of service （DoS） attacks launched by intruders. The effects o...Due to their characteristics of dynamic topology, wireless channels and limited resources, mobile ad hoc networks are particularly vulnerable to a denial of service （DoS） attacks launched by intruders. The effects of flooding attacks in network simulation 2 （NS2） and measured performance parameters are investigated, including packet loss ratio, average delay, throughput and average number of hops under different numbers of attack nodes, flooding frequency, network bandwidth and network size. Simulation results show that with the increase of the flooding frequency and the number of attack nodes, network performance sharply drops. But when the frequency of flooding attacks or the number of attack nodes is greater than a certain value, performance degradation tends to a stable value.展开更多
A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structure...A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structured representation of network topology, which has a fuzzy reasoning mechanism for finding the routing sprouting tree from the source node to the destination node in the mobile ad boc environment. Finally, by comparing the degree of reliability in the routing sprouting tree, the most reliable route can be computed. The algorithm not only offers the local reliability between each neighboring node, but also provides global reliability for the whole selected route. The algorithm can be applied to most existing on-demand routing protocols, and the simulation results show that the routing reliability is increased by more than 80% when applying the proposed algorithm to the ad hoc on demand distance vector routing protocol.展开更多
This paper theoretically analyzes a deficiency of the existing scheme, and proposes a distributed multi-hop certification authority scheme for mobile Ad Hoc networks. In our design, we distribute the certification aut...This paper theoretically analyzes a deficiency of the existing scheme, and proposes a distributed multi-hop certification authority scheme for mobile Ad Hoc networks. In our design, we distribute the certification authority functions through a threshold secret sharing mechanism, in which each node holds a secret share and multiple nodes jointly provide complete services. Certification authority is not limited in a local neighborhood but can be completed within multi-hop location. In addition, we replace broadcast by multicast to improve system performance and reduce communication overhead. This paper resolves some technical problems of ubiquitous certification authority services, and presents a wieldy multi-hop certification authority algorithm. Simulation results confirm the availability and effectiveness of our design.展开更多
Composite service provision in mobile ad hoc networks encounters great challenges and its success rate is not satisfactory because the nodes' locations are dynamic and the nodes maybe unavailable at any time.Compo...Composite service provision in mobile ad hoc networks encounters great challenges and its success rate is not satisfactory because the nodes' locations are dynamic and the nodes maybe unavailable at any time.Composite service is built through the service composition.In mobile ad hoc networks,the factors influencing the success rate of service composition are mainly the number of nodes and the time spent for the composition.The node's failure probability is proportional to the length of time the node exist in the networks.In order to improve the success rate of service composition,we take several measures.First,we split the service requirement into several segments and cluster the nodes,so that the nodes' waiting time for service composition can be reduced.Second,we propose a new node model of "one node contains multiple services" in mobile ad hoc networks.Using this type of nodes model,the number of nodes required for service composition can be reduced.These means can increase the success rate of service composition.展开更多
To deeply exploit the mechanisms of ant colony optimization （ACO） applied to develop routing in mobile ad hoe networks （MANETS）,some existing representative ant colony routing protocols were analyzed and compared....To deeply exploit the mechanisms of ant colony optimization （ACO） applied to develop routing in mobile ad hoe networks （MANETS）,some existing representative ant colony routing protocols were analyzed and compared.The analysis results show that every routing protocol has its own characteristics and competitive environment.No routing protocol is better than others in all aspects.Therefore,based on no free lunch theory,ant routing protocols were decomposed into three key components：route discovery,route maintenance （including route refreshing and route failure handling） and data forwarding.Moreover,component based ant routing protocol （CBAR） was proposed.For purpose of analysis,it only maintained basic ant routing process,and it was simple and efficient with a low overhead.Subsequently,different mechanisms used in every component and their effect on performance were analyzed and tested by simulations.Finally,future research strategies and trends were also summarized.展开更多
A network model is proposed to support service differentiation for mobile Ad Hoc networks by combining a fully distributed admission control approach and the DIFS based differentiation mechanism of IEEE802.11. It can ...A network model is proposed to support service differentiation for mobile Ad Hoc networks by combining a fully distributed admission control approach and the DIFS based differentiation mechanism of IEEE802.11. It can provide different kinds of QoS (Quality of Service) for various applications. Admission controllers determine a committed bandwidth based on the reserved bandwidth of flows and the source utilization of networks. Packets are marked when entering into networks by markers according to the committed rate. By the mark in the packet header, intermediate nodes handle the received packets in different manners to provide applications with the QoS corresponding to the pre-negotiated profile. Extensive simulation experiments showed that the proposed mechanism can provide QoS guarantee to assured service traffic and increase the channel utilization of networks.展开更多
Identity authentication plays an important role in ad hoc networks as a part of the secure mechanism. On the basis of GQ signature scheme, a new GQ threshold group signature scheme was presented, by which a novel dist...Identity authentication plays an important role in ad hoc networks as a part of the secure mechanism. On the basis of GQ signature scheme, a new GQ threshold group signature scheme was presented, by which a novel distributed algorithm was proposed to achieve the multi-hop authentication for mobile ad hoc networks. In addition, a protocol verifying the identity with zero knowledge proofs was designed so that the reuse of certificates comes into truth. Moreover, the security of this algorithm was proved through the random oracle model. With the lower cost of computation and communication, this algorithm is efficient, secure and especially suitable for mobile ad hoc networks characterized by distributed computing, dynamic topology and multi-hop communications.展开更多
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 working of a Mobile Ad hoc NETwork(MANET)relies on the supportive cooperation among the network nodes.But due to its intrinsic features,a misbehaving node can easily lead to a routing disorder.This paper presents two trust-based routing schemes,namely Trust-based Self-Detection Routing(TSDR)and Trust-based Cooperative Routing(TCOR)designed with an Ad hoc On-demand Distance Vector(AODV)protocol.The proposed work covers a wide range of security challenges,including malicious node identification and prevention,accurate trust quantification,secure trust data sharing,and trusted route maintenance.This brings a prominent solution for mitigating misbehaving nodes and establishing efficient communication in MANET.It is empirically validated based on a performance comparison with the current Evolutionary Self-Cooperative Trust(ESCT)scheme,Generalized Trust Model(GTM),and the conventional AODV protocol.The extensive simulations are conducted against three different varying network scenarios.The results affirm the improved values of eight popular performance metrics overcoming the existing routing schemes.Among the two proposed works,TCOR is more suitable for highly scalable networks;TSDR suits,however,the MANET application better with its small size.This work thus makes a significant contribution to the research community,in contrast to many previous works focusing solely on specific security aspects,and results in a trade-off in the expected values of evaluation parameters and asserts their efficiency.
文摘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 National Basic Research Program of China(973 Program)(No.2009CB320501)the National Natural Science Foundation of China(No.61370209,61272532)the Natural Science Foundation of Jiangsu Province(No.BK2010414,BK2011335)
文摘In order to save the energy and reduce the latency of the end-to-end transmission in mobile ad hoc networks an adaptive and distance-driven power control ADPC scheme is proposed by means of distance research in random geometrics. Through mathematical proof the optimal number of relay nodes and the optimal location of each node for data transmission can be obtained when a distance is given.In the ADPC first the source node computes the optimal number and the sites of the relay nodes between the source and the destination nodes.Then it searches feasible relay nodes around the optimal virtual relay-sites and selects one link with the minimal total transmission energy consumption for data transmission.Simulation results show that the ADPC can reduce both the energy dissipation and the end-to-end latency of the transmission.
基金The National Natural Science Foundation of China(No60362001)
文摘An improved internetworking approach is proposed to enhance the Internet connectivity which is deteriorated due to unidirectional links and blind rebroadcasting of gateway discovery packets for mobile ad hoc networks. The hybrid gateway discovery scheme that combined the advantages of a proactive and reactive gateway discovery approach is used to achieve high connectivity while keeping overhead costs low. By exchanging ad hoc on-demand distance vector （AODV） hello packet which includes additional fields named symmetric neighbor list and asymmetric neighbor list, unidirectional links are removed from route computation and broadcast storm can also be relieved simultaneously. Performance results using ns-2 simulations, under varying numbers of unidirectional links and node speeds, show that this improved Internet connectivity approach can provide better performance than others.
基金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.
基金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.
基金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.
基金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.
文摘A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.
文摘We propose an on-demand multipath routing algorithm in a mobile ad hoc network for video transmission and evaluate its real world performance in video streaming application. There have been a number of multipath routing protocols extended from AODV which is a well-known single path routing protocol. Multipath routing protocols indicate good performance in the reduction of route discovery latency and unnecessary routing packets in simulations. We show that the route establishment using source route lists provided by us (Hu and Johnson, 2002) can reduce the route discovery latency, select stable routes automatically, and work well for live video streaming without limitation of the hop count based approaches. We evaluate this proposed method compared with the original AODV by using eight laptop PCs and demonstrate live streaming experiments.
基金Supported by the National High Technology Develop ment 863 Program of China (No.2003AA148010)Key Technologies R&D Program of China (No.2002DA103A03-07).
文摘This paper focuses on investigating immunological principles in designing a multi-agent security architecture for intrusion detection and response in mobile ad hoc 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, decision and generating responses. Such an agent can learn 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 that 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 to show it can prevent the attack efficiently.
文摘Mobile ad-hoc networks (MANETs) are a specific kind of wireless networks that can be quickly deployed without pre- existing infrastructures. They are used in different contexts such as collaborative, medical, military or embedded applications. However, MANETs raise new challenges when they are used in large scale network that contain a large number of nodes. Subsequently, many clustering algorithms have emerged. In fact, these clustering algorithms allow the structuring of the network into groups of entities called clusters creating a hierarchical structure. Each cluster contains a particular node called cluster head elected as cluster head according to a specific metric or a combination of metrics such as identity, degree, mobility, weight, density, etc. MANETs has drawbacks due to both the characteristics of the transmission medium (transmission medium sharing, low bandwidth, etc.) and the routing protocols (information diffusion, path finding, etc.). Clustering in mobile ad hoc networks plays a vital role in improving resource management and network performance (routing delay, bandwidth consumption and throughput). In this paper, we present a study and analyze of some existing clustering approaches for MANETs that recently appeared in literature, which we classify as: Identifier Neighbor based clustering, Topology based clustering, Mobility based clustering, Energy based clustering, and Weight based clustering. We also include clustering definition, review existing clustering approaches, evaluate their performance and cost, discuss their advantages, disadvantages, features and suggest a best clustering approach.
基金supported by the National Natural Science Foundation of China (60932003)the National High Technology Research and Development Program of China (863 Program)(2007AA01Z452+2 种基金 2009AA01Z118)Shanghai Municipal Natural Science Foundation (09ZR1414900)The National Undergraduate Innovative Test Program(091024812)
文摘Due to their characteristics of dynamic topology, wireless channels and limited resources, mobile ad hoc networks are particularly vulnerable to a denial of service （DoS） attacks launched by intruders. The effects of flooding attacks in network simulation 2 （NS2） and measured performance parameters are investigated, including packet loss ratio, average delay, throughput and average number of hops under different numbers of attack nodes, flooding frequency, network bandwidth and network size. Simulation results show that with the increase of the flooding frequency and the number of attack nodes, network performance sharply drops. But when the frequency of flooding attacks or the number of attack nodes is greater than a certain value, performance degradation tends to a stable value.
文摘A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structured representation of network topology, which has a fuzzy reasoning mechanism for finding the routing sprouting tree from the source node to the destination node in the mobile ad boc environment. Finally, by comparing the degree of reliability in the routing sprouting tree, the most reliable route can be computed. The algorithm not only offers the local reliability between each neighboring node, but also provides global reliability for the whole selected route. The algorithm can be applied to most existing on-demand routing protocols, and the simulation results show that the routing reliability is increased by more than 80% when applying the proposed algorithm to the ad hoc on demand distance vector routing protocol.
文摘This paper theoretically analyzes a deficiency of the existing scheme, and proposes a distributed multi-hop certification authority scheme for mobile Ad Hoc networks. In our design, we distribute the certification authority functions through a threshold secret sharing mechanism, in which each node holds a secret share and multiple nodes jointly provide complete services. Certification authority is not limited in a local neighborhood but can be completed within multi-hop location. In addition, we replace broadcast by multicast to improve system performance and reduce communication overhead. This paper resolves some technical problems of ubiquitous certification authority services, and presents a wieldy multi-hop certification authority algorithm. Simulation results confirm the availability and effectiveness of our design.
基金ACKNOWLEDGEMENT This research is supported by the National Grand Fundamental Research 973 Program of China under Grant No. 2011CB302506, 2012CB315802 National Key Technology Research and Development Program of China （Grant No. 2012BAH94F02）+3 种基金 National High-tech R＆D Program of China （863 Program） under Grant No. 2013AA102301 National Natural Science Foundation of China under Grant No. 61132001, 61171102） Program for New Century Excellent Talents in University （Grant No. NCET-11-0592） Project of New Generation Broad band Wireless Networks under Grant No. 2011ZX03002-002-01. The technology development and experiment of innovative networks architecture （CNGI-12- 03-007）.
文摘Composite service provision in mobile ad hoc networks encounters great challenges and its success rate is not satisfactory because the nodes' locations are dynamic and the nodes maybe unavailable at any time.Composite service is built through the service composition.In mobile ad hoc networks,the factors influencing the success rate of service composition are mainly the number of nodes and the time spent for the composition.The node's failure probability is proportional to the length of time the node exist in the networks.In order to improve the success rate of service composition,we take several measures.First,we split the service requirement into several segments and cluster the nodes,so that the nodes' waiting time for service composition can be reduced.Second,we propose a new node model of "one node contains multiple services" in mobile ad hoc networks.Using this type of nodes model,the number of nodes required for service composition can be reduced.These means can increase the success rate of service composition.
基金Project(61225012)supported by the National Science Foundation for Distinguished Young Scholars of ChinaProjects(61070162,71071028,70931001)supported by the National Natural Science Foundation of China+4 种基金Project(20120042130003)supported by the Specialized Research Fund of the Doctoral Program of Higher Education for the Priority Development Areas,ChinaProjects(20100042110025,20110042110024)supported by the Specialized Research Fund for the Doctoral Program of Higher Education,ChinaProject(2012)supported by the Specialized Development Fund for the Internet of Things from the Ministry of Industry and Information Technology of ChinaProject(N110204003)supported by the Fundamental Research Funds for the Central Universities of ChinaProject(L2013001)supported by the Scientific Research Fund of Liaoning Provincial Education Department,China
文摘To deeply exploit the mechanisms of ant colony optimization （ACO） applied to develop routing in mobile ad hoe networks （MANETS）,some existing representative ant colony routing protocols were analyzed and compared.The analysis results show that every routing protocol has its own characteristics and competitive environment.No routing protocol is better than others in all aspects.Therefore,based on no free lunch theory,ant routing protocols were decomposed into three key components：route discovery,route maintenance （including route refreshing and route failure handling） and data forwarding.Moreover,component based ant routing protocol （CBAR） was proposed.For purpose of analysis,it only maintained basic ant routing process,and it was simple and efficient with a low overhead.Subsequently,different mechanisms used in every component and their effect on performance were analyzed and tested by simulations.Finally,future research strategies and trends were also summarized.
文摘A network model is proposed to support service differentiation for mobile Ad Hoc networks by combining a fully distributed admission control approach and the DIFS based differentiation mechanism of IEEE802.11. It can provide different kinds of QoS (Quality of Service) for various applications. Admission controllers determine a committed bandwidth based on the reserved bandwidth of flows and the source utilization of networks. Packets are marked when entering into networks by markers according to the committed rate. By the mark in the packet header, intermediate nodes handle the received packets in different manners to provide applications with the QoS corresponding to the pre-negotiated profile. Extensive simulation experiments showed that the proposed mechanism can provide QoS guarantee to assured service traffic and increase the channel utilization of networks.
文摘Identity authentication plays an important role in ad hoc networks as a part of the secure mechanism. On the basis of GQ signature scheme, a new GQ threshold group signature scheme was presented, by which a novel distributed algorithm was proposed to achieve the multi-hop authentication for mobile ad hoc networks. In addition, a protocol verifying the identity with zero knowledge proofs was designed so that the reuse of certificates comes into truth. Moreover, the security of this algorithm was proved through the random oracle model. With the lower cost of computation and communication, this algorithm is efficient, secure and especially suitable for mobile ad hoc networks characterized by distributed computing, dynamic topology and multi-hop communications.
文摘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.
