Component based ant routing protocols analysis over mobile ad hoc networks

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.

Genetic Algorithm Routing Protocol for Mobile Ad Hoc Network

Mobile ad hoc network(MANET)is a dynamically reconfigurable wireless network with time-variable infrastructure.Given that nodes are highly mobile,MANET’s topology often changes.These changes increase the difficulty in finding the routes that the packets use when they are routed.This study proposes an algorithm called genetic algorithm-based location-aided routing(GALAR)to enhance the MANET routing protocol efficiency.The GALAR algorithm maintains an adaptive update of the node location information by adding the transmitting node location information to the routing packet and selecting the transmitting node to carry the packets to their destination.The GALAR was constructed based on a genetic optimization scheme that considers all contributing factors in the delivery behavior using criterion function optimization.Simulation results showed that the GALAR algorithm can make the probability of packet delivery ratio more than 99%with less network overhead.Moreover,GALAR was compared to other algorithms in terms of different network evaluation measures.The GALAR algorithm significantly outperformed the other algorithms that were used in the study.

Analysis of reactive routing protocols for mobile ad hoc networks in Markov models

Mobile ad hoc networks （MANETs） have become a hot issue in the area of wireless networks for their non-infrastructure and mobile features. In this paper, a MANET is modeled so that the length of each link in the network is considered as a birthdeath process and the space is reused for n times in the flooding process, which is named as an n-spatiai reuse birth-death model （n-SRBDM）. We analyze the performance of the network under the dynamic source routing protocol （DSR） which is a famous reactive routing protocol. Some performance parameters of the route discovery are studied such as the probability distribution and the expectation of the flooding distance, the probability that a route is discovered by a query packet with a hop limit, the probability that a request packet finds a τ-time-valid route or a symmetric-valid route, and the average time needed to discover a valid route. For the route maintenance, some parameters are introduced and studied such as the average frequency of route recovery and the average time of a route to be valid. We compare the two models with spatial reuse and without spatial reuse by evaluating these parameters. It is shown that the spatial reuse model is much more effective in routing.

Route maintenance of on-demand routing protocol in mobile ad hoc networks

In mobile ad hoc networks （MANETs）, if a mnltihop route breaks, route maintenance is typically performed to establish a new route which causes high control overhead and long packet delay. To decrease the time of recovery and the overhead of maintenance, a new route maintenance mechanism in which the maintenance is confined to the vicinity of the broken link is proposed. This mechanism patches broken route through some other nodes in which only nodes near the broken link（s） may need to be substituted and the rest of nodes can be retained on the route. The broken link can be repaired without considering its relative position in the whole path, so the abihty of dealing with hnk failure is improved obviously. Simulation results show that the proposed strategy improves network performance significantly, such as in merits of control overhead and packet delay.

A Secure and Pragmatic Routing Protocol for Mobile Ad hoc Networks

An ad hoc network is a group of wireless mobile computers(or nodes),in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range.Because of node mobility and power limitations,the network topology changes frequently.Routing protocol plays an important role in the ad hoc network.A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required.As an optimization for the current Dynamic Source Routing Protocol,a secure and pragmatic routes selection scheme based on Reputation Systems was proposed.We design the Secure and Pragmatic Routing protocol and implement simulation models using GloMoSim.Simulation results show that the Secure and Pragmatic Routing protocol provides better experimental results on packet delivery ratio,power consumption and system throughput than Dynamic Source Routing Protocol.

Anonymous multipath routing protocol based on secret sharing 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 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 Partially Non-Cryptographic Security Routing Protocol in Mobile Ad Hoc Networks

In this paper, we propose a partially non-cryptographic security routing protocol （PNCSR） that protects both routing and data forwarding operations through the same reactive approach. PNCSR only apply public-key cryptographic system in managing token, but it doesn＇t utilize any cryptographic primitives on the routing messages. In PNCSR, each node is fair. Local neighboring nodes collaboratively monitor each other and sustain each other. It also uses a novel credit strategy which additively increases the token lifetime each time a node renews its token. We also analyze the storage, computation, and communication overhead of PNCSR, and provide a simple yet meaningful overhead comparison. Finally, the simulation results show the effectiveness of PNCSR in various situations.

An Empirical Examination of Routing Protocols in Mobile Ad Hoc Networks

A Mobile Ad hoc NETwork (MANET) is a self-organizing, temporary, infrastructure-free, multi-hop, dynamic topology wireless network that contains collection of cooperative autonomous freely roaming mobile nodes. The nodes communicate with each other by wireless radio links with no human intervention. Each mobile node functions as a specialized router to forward information to other mobile nodes. In order to provide efficient end-to-end communication with the network of nodes, a routing protocol is used to discover the optimal routes between the nodes. The routing protocols meant for wired networks can not be used for mobile ad hoc networks because of the mobility of nodes. Routing in ad hoc networks is nontrivial due to highly dynamic nature of the nodes. Various routing protocols have been proposed and widely evaluated for efficient routing of packets. This research paper presents an overview on classification of wide range of routing protocols for mobile ad hoc wireless networks proposed in the literature and shows the performance evaluation of the routing protocols: DSDV, AODV, FSR, LAR, OLSR, STAR and ZRP using the network simulator QualNet 4.0 to determine which protocols may perform best in large networks. To judge the merit of a routing protocol, one needs performance metrics (throughput, end-to-end delay, jitter, packet delivery ratio, routing overhead) with which to measure its suitability and performance. Our simulation experiments show that the LAR protocol achieve relatively good performance compared to other routing protocols.

A quality of service routing protocol based on mobility prediction in mobile ad hoc networks

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.

Experimental evaluation of an on-demand multipath routing protocol for video transmission in mobile ad hoc networks

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.

Performance Study of a Cross-Layer Based Multipath Routing Protocol for IEEE 802.11e Mobile Ad Hoc Networks

Communication over wireless links identifies significant challenges for routing protocols operating. This paper proposes a Cross-layer design based Multipath Routing Protocol (CMRP) for mobile ad hoc networks, by means of the node energy signal from the physical layer. The purpose is to optimize routing decision and path quality. The nodes’ mobility behavior is predicted using a notion of “Signal Fading Degree, SFD”. Especially, in combination of the IEEE 802.11e standard at the MAC layer, we determine that the IEEE 802.11e makes a significant contribution to performance improvement of CMRP. Performance evaluation of AODV in legacy 802.11 and CMRP in IEEE 802.11e shows that, as a function of speed of node mobility, a tremendous reduction achieved, in metrics such as the average end-to-end delay, route overhead, route discovery frequency, normalized routing load - almost more than 80%, 40%, 40%, and 40%. In the case of varying number of sessions, the reduction for route discovery frequency and normalized routing load are up to 70% and 80%.

Trust-based co-operative routing for secure communication in mobile ad hoc networks

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.

A distributed on-demand bandwidth-constrained multicast routing protocol for wireless ad hoc networks

To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.

Distributed QoS multicast routing protocol in ad hoc networks

Quality of service （QoS） routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. The multicast routing problem with multiple QoS constraints is discussed, which may deal with the delay, bandwidth and cost metrics, and describes a network model for researching the ad hoc networks QoS multicast routing problem. It presents a distributed QoS multicast routing protocol （DQMRP）. The proof of correctness and complenty analysis of the DQMRP are also given. Simulation results show that the multicast tree optimized by DQMRP is better than other protocols and is fitter for the network situations with frequently changed status and the realtime multimedia application. It is an available approach to multicast routing decision with multiple QoS constraints.

DECLARATIVE HYBRID ROUTING PROTOCOLS IN AD HOC NETWORKS

This paper presents adaptive hybrid protocols based on the declarative network and mainly discusses the principle and realization of the Bayesian-estimation based adaptive hybrid protocol in the declarative network, which is well adapted to the Mobile Ad hoc NETwork (MANET). The adaptive hybrid protocol is designed for ad hoc networks which have characteristics like self-organizing, no trusted party, flexibility, etc. The nodes that run the hybrid protocol can automatically select one routing protocol that is suitable for different network environment. The Bayesian-estimation based adaptive strategy, that improves the adaptability and stability of the protocol, succeeds in the Rapidnet, a declarative network engine. The result in the Rapidnet proves that the hybrid protocol and the adaptive strategy are feasible. The experiment on the ns-3 simulator, an emerging discrete-event network simulator, validates that this protocol performs well and reduces communication overheads.

Simulation &Performance Evaluation of QoS Routing Protocol for Adhoc Networks Using Directional Communication

A wireless ad-hoc network is a self-organized wireless network without fixed or backbone infrastructure. All nodes have routing capability and use peer-to-peer packet transmission or forward packets to other node using multi hop communication. Now days mobile ad-hoc networks are being used for different applications and traffics, so it require quality of service (QoS) support in routing protocol. In this paper, a modified QoS routing protocol using directional antenna has been proposed. High and normal priority can be assigned based on type of traffic. All the nodes in the path used by high priority flow are reserved as high priority flow for that flow and normal priority flow will avoid the paths used by high priority flows. If no disjoint paths are available, there may be two possibilities: Normal priority flows are blocked and other is, normal priority flows are allow using the coupled path with high priority flow. Blocking the normal priority flow, QoS routing protocol improves the performance of high priority flow. This concept may be use in emergency communication. Simulation results show that by assigning the priorities to flows, performance of high priority flows are improved and it will further improved by blocking the normal priority flow.

Reliable adaptive multicast protocol in wireless 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.

Joint channel assignment and cross-layer routing protocol for multi-radio multi-channel Ad Hoc networks

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.

An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years,with the rapid development of the Internet and wireless communication technology,wireless Ad hoc networks have received more attention.Due to the limited transmission range and energy of nodes in Ad hoc networks,it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks.This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol,which has the following two aspects of improvement:(1)In the route discovery process,a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a“Mark”bit that representing remaining energy of a node.(2)Based on(1),a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively.Simulation results demonstrate that compared with AODV and other existing routing protocols,proposed algorithm can reduce network energy consumption and balance node energy,thus extending the network lifetime.

Multipath Source Self Repair Routing Algorithm for Mobile Ad Hoc Networks

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.