A Dynamic Alternate Path QoS Enabled Routing Scheme in Mobile Ad hoc Networks

A mobile ad hoc network (MANET) is a collection of self-organized mobile nodes that are capable of communicating with each other without the aid of any established infrastructure or centralized administration. Routing algorithm has been a challenge task in the wireless ad hoc network for a long time due to the dynamic nature of network topology. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. The on-demand routing protocol for ad hoc network is appealing because of its low routing overhead and its effectiveness when the frequency of route re-establishment and the demand of route queries are not high. However, considering the increasing demand of Quality-of-Service (QoS) requirements in many applications, the current on-demand routing protocols used for ad-hoc network should be adapted appropriately to effectively meet the stringent QoS requirements of specific multimedia traffic. We thus propose a routing protocol which tries its best to satisfy QoS requirements of specific multimedia traffic in the volatile environments of a MANET. The results of a series of simulations exhibit the practicability and feasibility of our approaches. This research was partially supported by National Science Council under grant NSC 93-2213-E-026-001     

AODVCS,a new bio-inspired routing protocol based on cuckoo search algorithm for mobile ad hoc networks

Mobile ad hoc networks (MANETs) are becoming an emerging technology that offer several advantages to users in terms of cost and ease of use. A MANET is a collection of mobile nodes connected by wireless links that form a temporary network topology that operates without a base station and centralized administration. Routing is a method through which information is forwarded from a transmitter to a specific recipient. Routing is a strategy that guarantees, at any time, the connection between any two nodes in a network. In this work, we propose a novel routing protocol inspired by the cuckoo search method. Our routing protocol is implemented using Network simulator 2. We chose Random WayPoint model as our mobility model. To validate our work, we opted for the comparison with the routing protocol ad hoc on-demand distance vector, destination sequence distance vector and the bio-inspired routing protocol AntHocNet in terms of the quality of service parameters: packet delivery ratio and end-to-end delay (E2ED).     

Fuzzy Logic QoS Dynamic Source Routing for Mobile Ad Hoc Networks

Considering the characters of dynamic topology and the imprecise state information in mobile ad hoc network,we propose a Fuzzy Logic QoS Dynamic Source Routing(FLQDSR)algorithm based on Dynamic Source Routing(DSR)protocol while adopting fuzzy logic to select the appropriate QoS routing in multiple paths which are searched in parallel.This scheme considers not only the bandwidth and end-to-end delay of routing,but also the cost of the path.On the otherhand the merit of using fuzzy logic is that it can be implemented by hardware.This makes the realization of the schemeeasier and faster.However our algorithm is based on DSR,the maximal hop count should be less than 10,i.e.,the scaleof mobile ad hoc network should not be very large.Simulation results show that FLQDSR can tolerate a high degree of in-formation imprecision by adding the fuzzy logic module which integrates the QoS requirements of application and the rout-ing QoS parameters to determine the most qualified one in every node.     

Improving UDP and TCP performance in mobile ad hoc networks withINSIGNIA

There is a growing need to provide better service differentiation in mobile ad hoc networks; however, this is challenging. These networks are characterized as being multihop in nature where the wireless topology that interconnects mobile hosts/routers can change rapidly in unpredictable ways or remain relatively static over long periods of time. Power and bandwidth constrained, mobile ad hoc networks typically only support best effort communications where the transport protocol's “goodput” is often lower than the maximum radio transmission rate after encountering the effects of multiple access, fading, noise, and interference. We evaluate three routing protocols with INSIGNIA, an in-band signaling system that supports adaptive reservation-based services in mobile ad hoc networks. INSIGNIA represents a general-purpose approach to delivering quality of service in mobile ad hoc network supporting “operational transparency” between a number of IETF mobile ad hoc network routing protocols that include Ad Hoc On-Demand Distance Vector, Dynamic Source Routing, and the Temporally Ordered Routing Algorithm. We evaluate the performance gains delivered when using INSIGNIA with these MANET routing protocols in support of UDP and TCP traffic. The INSIGNIA ns-2 code used for the study reported in this article is available from the Web at comet.columbia.edu/insignia     

Location‐Aided Routing (LAR) in mobile ad hoc networks

A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks. By using location information, the proposed Location‐Aided Routing (LAR) protocols limit the search for a new route to a smaller “request zone” of the ad hoc network. This results in a significant reduction in the number of routing messages. We present two algorithms to determine the request zone, and also suggest potential optimizations to our algorithms. This revised version was published online in July 2006 with corrections to the Cover Date.     

移动自组网络MANET路由策略综述

路由策略是网络技术研究的焦点问题之一。由于移动自组网络MANET中节点的动态性和节点资源的有限性,以及多媒体应用服务质量的需求,导致在MANET网络实现路由存在诸多困难。综述了目前文献中基于MANET网络的普通路由协议和满足服务质量需求的QoS路由协议/算法,详细说明了不同协议的实现过程和存在的优缺点,并指出了目前路由策略研究中存在的问题和将来的发展方向。     

Routing security in wireless ad hoc networks

A mobile ad hoc network consists of a collection of wireless mobile nodes that are capable of communicating with each other without the use of a network infrastructure or any centralized administration. MANET is an emerging research area with practical applications. However, wireless MANET is particularly vulnerable due to its fundamental characteristics, such as open medium, dynamic topology, distributed cooperation, and constrained capability. Routing plays an important role in the security of the entire network. In general, routing security in wireless MANETs appears to be a problem that is not trivial to solve. In this article we study the routing security issues of MANETs, and analyze in detail one type of attack-the "black hole" problem-that can easily be employed against the MANETs. We also propose a solution for the black hole problem for ad hoc on-demand distance vector routing protocol.     

An energy aware algorithm for OLSR clustering

One of the important aspects of a mobile ad hoc network (MANET) is the limitation of the amount of available energy and the network lifetime. The tremendous amount of using mobile nodes in wireless communication medium makes energy efficiency a fundamental requirement for MANETs. In this paper, we propose a novel energy aware clustering algorithm for the optimized link state routing (OLSR) routing protocol. This algorithm takes into account the node density and mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reasonable number of cluster heads that will serve for hierarchical routing based on OLSR. The proposed algorithm aims to increase the network lifetime by considering the ad hoc residual energy while taking routing decisions. It also optimizes the delay of carried flows by adopting a selective forwarding approach based on a hierarchical routing model.     

DBLAR：A DISTANCE-BASED LOCATION-AIDED ROUTING FOR MANET

In location-aided routing of Mobile Ad hoc NETworks (MANET), nodes mobility and the inaccuracy of location information may result in constant flooding, which will reduce the network performance. In this paper, a Distance-Based Location-Aided Routing (DBLAR) for MANET has been proposed. By tracing the location information of destination nodes and referring to distance change between nodes to adjust route discovery dynamically, the proposed routing algorithm can avoid flooding in the whole networks. Besides, Distance Update Threshold (DUT) is set up to reach the balance between real-time ability and update overhead of location information of nodes, meanwhile, the detection of relative distance vector can achieve the goal of adjusting forwarding condition. Simulation results reveal that DBLAR performs better than LAR1 in terms of packet successful delivery ratio, average end-to-end delay and routing-load, and the set of DUT and relative distance vector has a significant impact on this algorithm.     

HOPNET: A hybrid ant colony optimization routing algorithm for mobile ad hoc network

Mobile ad hoc network (MANET) is a group of mobile nodes which communicates with each other without any supporting infrastructure. Routing in MANET is extremely challenging because of MANETs dynamic features, its limited bandwidth and power energy. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MANETs. Swarm intelligence is a computational intelligence technique that involves collective behavior of autonomous agents that locally interact with each other in a distributed environment to solve a given problem in the hope of finding a global solution to the problem. In this paper, we propose a hybrid routing algorithm for MANETs based on ACO and zone routing framework of bordercasting. The algorithm, HOPNET, based on ants hopping from one zone to the next, consists of the local proactive route discovery within a node’s neighborhood and reactive communication between the neighborhoods. The algorithm has features extracted from ZRP and DSR protocols and is simulated on GlomoSim and is compared to AODV routing protocol. The algorithm is also compared to the well known hybrid routing algorithm, AntHocNet, which is not based on zone routing framework. Results indicate that HOPNET is highly scalable for large networks compared to AntHocNet. The results also indicate that the selection of the zone radius has considerable impact on the delivery packet ratio and HOPNET performs significantly better than AntHocNet for high and low mobility. The algorithm has been compared to random way point model and random drunken model and the results show the efficiency and inefficiency of bordercasting. Finally, HOPNET is compared to ZRP and the strength of nature-inspired algorithm is shown.     

MECOR: Minimal Energy Consumption with Optimized Routing in MANET

Energy and routing efficiency is a long-research topic from past decades in the area of MANET. The prior research contribution focusing on addressing both the issues are associated with issues like (1) few benchmarked studies, (2) adoption of conventional routing protocols based on shortest path to mitigate both issues, and (3) inefficient design principles of routing. Hence, this paper proposes a novel routing protocol in mobile ad hoc network (MANET) termed as MECOR i.e. minimal energy consumption with optimized routing. MECOR presents a simple communication strategy based on mathematical and signaling properties of mobile nodes in MANET to jointly address the energy and routing issues in MANET. The outcome of the MECOR was compared with conventional routing algorithm as well as recent studies of energy efficient routing policy to find that MECOR can minimize 58.82 % of energy in most challenging mobility scenarios of MANET.     

Unidirectional link-state advertisement based on power control for MANET

Link states are studied in ad hoc network. The characters of unidirectional links are discussed. Unidirectional link-state advertisement based on power control mechanism (ULAPC) for mobile ad hoc networks (MANET) is designed. ULAPC is able to advertise unidirectional link-state to relational nodes. And it may offer help for process of routing discovery in ad hoc network. Based on ULAPC, the routing method solving the problem of unidirectional link is described in ad hoc network. Simulation results show the performance of ULAPC is better than the traditional routing protocols in many aspects.     

嵌入服务通告与发现的ZRP协议

服务通告和发现在MANET(Mobile Ad hoc Networks)网络中,是一个十分重要的组成部分.现有的服务通告和发现协议不是为MANET网络设计的.文章提出了一个适合MANET、基于ZRP(Zone Routing Protocol)的服务通告及发现协议.服务的通告与发现存在于ZRP路由控制分组中,避免了周期性的通告给MANET网络带来的负载,节约了有限的带宽和设备的能耗.     

SDR: A Stable Direction-Based Routing for Vehicular Ad Hoc Networks

A stable and reliable routing mechanism for vehicular ad hoc networks (VANETs) is an important step toward the provision of long data transmission applications, such as file sharing and music download. Traditional mobile ad hoc network (MANET) routing protocols are not suitable for VANET because the mobility model and environment of VANET are different from those of traditional MANET. To solve this problem, we proposed a new stable routing algorithm, called stable directional forward routing. The novelty of the proposed routing protocol is its combining direction broadcast and path duration prediction into ad hoc on-demand distance vector routing protocols, which including: (1) Nodes in VANET are grouped based on the position, only nodes in a given direction range participating in the route discovery process to reduce the frequency of flood requests, (2) Route selection is based on the link duration while not the hops or other metrics to increase the path duration, (3) Route discovery is executed before the path expiration in order to decrease the end to end delay. The performance of the new scheme is evaluated through extensive simulations with Qualnet. Simulation results indicate the benefits of the proposed routing strategy in terms of decreasing routing control packet, reducing the number of link-breakage events, improving the packet delivery ratio and decreasing the end-to-end delay.     

Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks

Routing is one of the most basic networking functions in mobile ad hoc networks. Hence, an adversary can easily paralyze the operation of the network by attacking the routing protocol. This has been realized by many researchers and several "secure" routing protocols have been proposed for ad hoc networks. However, the security of those protocols has mainly been analyzed by informal means only. In this paper, we argue that flaws in ad hoc routing protocols can be very subtle, and we advocate a more systematic way of analysis. We propose a mathematical framework in which security can be precisely defined and routing protocols for mobile ad hoc networks can be proved to be secure in a rigorous manner. Our framework is tailored for on-demand source routing protocols, but the general principles are applicable to other types of protocols too. Our approach is based on the simulation paradigm, which has already been used extensively for the analysis of key establishment protocols, but, to the best of our knowledge, it has not been applied in the context of ad hoc routing so far. We also propose a new on-demand source routing protocol, called endairA, and we demonstrate the use of our framework by proving that it is secure in our model     

移动自组织网与有线网融合技术研究与展望

随着移动自组织网络(MANET)组网技术的不断成熟,MANET路由协议与传统Internet路由协议的融合已经成为网络互联的重要内容,成为影响组网效率的决定性因素.本文分别对移动自组织网络作为末端网和承载网的互联技术进行了研究,并在此基础上提出了基于无线栅格网络(wireless mesh networl,WMN)结构的未来移动互联技术的演进方案,对WMN的路由协议进行了有意义的探讨.     

基于NS2的Ad hoc网络路由协议性能分析比较

A d Hoc网络的路由协议是A d Hoc网络研究的关键问题,对于研究A d Hoc网络是至关重要的。本文采用网络仿真软件N S2评价移动自组网的路由协议。通过实例仿真,利用编写的脚本程序,对仿真结果进行分析,从而对移动自组网路由协议AODV(自组网按需路由协议)、DSR(动态源路由)以及DSDV(基于目的序号和距离矢量路由)的性能参数进行比较。     

Privacy preservation and protection for cluster based geographic routing protocol in MANET

In mobile ad hoc networks (MANET), the malicious attackers may attack the location information and routing messages. Hence these information need to be protected by means of authentication, integrity and encryption. In this paper, we propose a privacy preservation and protection for cluster based geographic routing protocol in MANET. In this technique, cluster head is chosen based on node value which is estimated based on degree difference, node mobility and residual energy. The cluster consists of GPS enabled node and antenna equipped node. The cluster that contains at least one G-Node considers the remaining energy, speed of the node along with the mobility of node to select the cluster head. In order to perform privacy and anonymity protection of cluster members, the cluster head then initializes group signature scheme. Then the secured routing technique is deployed where the routing packets are protected by encryption. By simulation results, we show that the proposed technique reduces the network overhead.     

A secure and trust based on-demand multipath routing scheme for self-organized mobile ad-hoc networks

A mobile ad hoc network (MANET) is a self-configurable network connected by wireless links. This type of network is only suitable for provisional communication links as it is infrastructure-less and there is no centralized control. Providing QoS and security aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of secure and trust based on-demand multipath routing is to find trust based secure route from source to destination which will satisfy two or more end to end QoS constraints. In this paper, the standard ad hoc on-demand multi-path distance vector protocol is extended as the base routing protocol to evaluate this model. The proposed mesh based multipath routing scheme to discover all possible secure paths using secure adjacent position trust verification protocol and better link optimal path find by the Dolphin Echolocation Algorithm for efficient communication in MANET. The performance analysis and numerical results show that our proposed routing protocol produces better packet delivery ratio, reduced packet delay, reduced overheads and provide security against vulnerabilities and attacks.     

Route Stability Based QoS Routing in Mobile Ad Hoc Networks

To provide high quality communications service among mobile wireless devices is basically a challenging task in wireless ad hoc networks. In this paper, we propose a Route Stability based QoS Routing (RSQR) protocol in Mobile Ad Hoc Networks (MANETs) which is an extension of QoS routing with throughput and delay constraints. Ensuring a data path to be valid for sufficiently longer period of time is a very difficult problem in MANET due to its highly dynamic nature. We propose a simple model for computing link stability and route stability based on received signal strengths. By including some extra fields in route request/reply packets, the route stability information can be utilized to select a route with higher stability among all the feasible routes between a given source destination pair. Further, inclusion of a signal strength based admission control enhances the performance of the routing. Results of our experiments show performance improvements in terms of packet delivery ratio, control overhead and average end-to-end delay in comparison with a QoS routing protocol proposed by Q. Xue and A. Ganz.