Flooding attack and defence in Ad hoc networks

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.

A Composite Service Provision Method Based on Novel Node Model in Mobile Ad Hoc Networks

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.

A Novel Multi-Level Trust Algorithm for Mobile Ad Hoc Networks

Firstly, a multilevel trust algorithm for MANET （mobile ad hoe networks） is presented in this paper and the trust level is defined as a three-tuple type in this multilevel trust algorithm. The paper introduces the multilevel trust into MANET, thereby controlling restricted classified information flows among nodes that have different trust levels. Secondly, the infrastructure of MANET that suit to our multi-level trust is presented, Some conclusions are given at lastly.

A Layer-Cluster Key Agreement Protocol for Ad Hoc Networks

Mobile ad hoc networks create additional challenges for implementing the group key establishment due to resource constraints on nodes and dynamic changes on topology. The nodes in mobile ad hoc networks are usually low power devices that run on battery power. As a result, the costs of the node resources should be minimized when constructing a group key agreement protocol so that the battery life could be prolonged. To achieve this goal, in this paper we propose a security efficient group key agreement protocol based on Burmester-Desmedt （BD） scheme and layer-cluster group model, referred to as LCKM-BD, which is appropriate for large mobile ad hoe networks. In the layer-cluster group model, BD scheme is employed to establish group key, which can not only meet security demands of mobile ad hoc networks but also improve executing performance. Finally, the proposed protocol LCKM-BD are compared with BD, TGDH （tree-based group Diffe-Hellman）, and GDH （group Diffie-Hellman） group key agreement protocols. The analysis results show that our protocol can significantly decrease both the computational overhead and communication costs with respect to these comparable protocols.

A mesh based routing protocol in vehicular ad hoc networks

This paper studies a routing protocol used in the application of collecting real-time traffic information using mobile vehicles to monitor traffic status. The biggest challenge of vehicular ad hoe network routing protocol lies in the mismatch between the direction of moving vehicles and routed data. In order to deal with this mismatch, a mesh based routing protocol with a two-tier network architecture is proposed. By using mesh nodes deployed at intersections, data can be routed through an optimized path which can improve the delivery ratio and reduce the consumption of network resources. The simulation uses the mobility model processed from the GPS data of taxis mnning in Shanghai urban areas. The result shows that the proposed protocol outperforms the existing flooding protocol.

Effective link quality estimation as a means to improved end-to-end packet delivery in high traffic mobile ad hoc networks

Accurate link quality estimation is a fundamental building block in quality aware multi hop routing. In an inherently lossy, unreliable and dynamic medium such as wireless, the task of accurate estimation becomes very challenging. Over the years ETX has been widely used as a reliable link quality estimation metric. However, more recently it has been established that under heavy traffic loads ETX performance gets significantly worse. We examine the ETX metric＇s behavior in detail with respect to the MAC layer and UDP data; and identify the causes of its unreliability. Motivated by the observations made in our analysis, we present the design and implementation of our link quality measurement metric xDDR - a variation of ETX. This article extends xDDR to support network mobility. Our experiments show that xDDR substantially outperforms minimum hop count, ETX and HETX in terms of end-to-end packet delivery ratio in static as well as mobile scenarios.

A reliable routing algorithm based on fuzzy Petri net in mobile ad hoc networks

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.

AODV-RM:route maintenance against route flapping in Ad hoc network

Route flapping is common in mobile Ad hoc networks.It usually causes large delay or even interruption during communication.This paper proposed a routing protocol AODV-RM to alleviate this effect.AODV-RM selects routes with the lightest traffic load,to avoid striving for hot nodes with other users,hence minishes the chance of collision.AODV-RM keeps all valid routes to the destination in its routing table as backups.When the link under usage breaks down,AODV-RM shifts to a valid route in its routing table instead of route repair or researching,which ensures the continuity of communication.AODV-RM chooses a route maintenance scheme by the network topology.If the origination has multi routes to the destination,only the origination maintains routes.Otherwise,middle nodes,instead of the origination,maintain sub-routes to the destination.By simulating the traditional AODV and AODV-RM,the results showed that AODV-RM has a lower drop rate and better performance against route flapping.

Signcryption-Based Key Management for MANETs Applications in Mobile Commerce

Mobile commerce uses wireless device and wireless link to result in the transfer of values in exchange of information, services or goods. Wireless mobile ad hoc networks （MANETs） will bring a revolution to the business model of mobile commerce if such networks are used as the underlying network technology for mobile commerce. Mobile commerce will remain in a niche market until the security issue is properly addressed. Hence, security is also very important for MANET applications in mobile commerce. Robust key management is one of the most crucial technologies for security of MANETs. In this paper, a new solution for key management is proposed using identity-based （ID-based） signcryption and threshold secret sharing. It enables flexible and efficient key management while respecting the constraints of MANETs. In our solution, each mobile host uses its globally unique identity as its public key. It greatly decreases the computation and storage costs of mobile hosts, as well as communication cost for system key management.

A Cooperative Forwarding Scheme for VANET Routing Protocols

Providing efficient packet delivery in vehicular ad hoc networks （VANETs） is particularly challenging due to the vehicle move- ment and lossy wireless channels. A data packet can be lost at a forwarding node even when a proper node is selected as the for- warding node. In this paper, we propose a loss-tolerant scheme for unicast routing protocols in VANETs. The proposed scheme employs multiple forwarding nodes to improve the packet reception ratio at the forwarding nodes. The scheme uses network coding to reduce the number of required transmissions, resulting in a significant improvement in end-to-end packet delivery ratio with low message overhead. The effectiveness of the proposed scheme is evaluated by using both theoretical analysis and computer sim-