Channel Adaptive Routing Research Articles

Routing Mechanism in Mobile Ad hoc Network with Improved Security and Channel Adaptivity under Fading

Mobile Ad Hoc Network is a type of wireless network without a fixed topology consist a set of self organized nodes which are randomly, frequently and unpredictably mobile. In MANETs packet transmission is affected by radio link fluctuations. Hop count is a simple routing metric that calculate the distance between a source and destination on the number of routers in the path. Routing protocols for ad hoc networks have less channel fading. The minimum hop count is not enough for a routing protocol to achieve a good performance. MANET is an open environment and it is susceptible to many security attacks due to dynamic topology and lack of centralized monitoring authority. Anonymous routing protocols conceal the identities about the route, source and destination to provide security and privacy from intruder’s attacks. So in this paper, channel adaptive protocol with improved node security, extensions to a multipath routing protocol to accommodate channel fading and node security is introduced. The resulting protocol is referred to as Channel Adaptive routing protocol with node security (CARNS). Using channel state information (CSI), a preemptive handoff strategy is applied to maintain reliable and stable connections. Paths are reusable, rather than simply regarding them as useless. In this paper we provide performance analysis of CARNS, as well as comparison between CARNS with AODV and AOMDV. The simulation results which confirms the improved network performance of CARNS, both in terms of node security and channel fading.

Implementation of CA-AOMDV Protocol using ANN

Mobile Ad Hoc network is a self-organizing infrastructure less network where the nodes are responsible for routing the packets. MANET has dynamic topology which allows nodes to join and leave the network at any time. This paper proposes a channel adaptive routing protocol which extends AOMDV routing protocol to accommodate channel fading. The proposed Channel Aware AOMDV protocol uses channel average nonfading duration to select stable links for route discovery. The main objective of this paper is to demonstrate approximation capability of artificial neural network. Feed forward network architecture with back propagation algorithm is used. Depending upon the size of database number of hidden layers and number of neurons in hidden layer are decided. Number of neurons in hidden layer is varied and effect on percentage deviation in the output parameter is observed. Depending upon nature of input and output parameters synthesis and analysis artificial neural network (ANN) models are trained.

Channel Fading Detection in Manets with Hand off Strategy

In wireless mobile ad hoc networks (MANETs), packet transmission is impaired by radio link fluctuations. This paper proposes a novel channel adaptive routing protocol which extends the Ad hoc On- Demand Multipath Distance Vector (AOMDV) routingprotocol to accommodate channel fading. Specifically, the proposed Channel-Aware AOMDV (CA-AOMDV) uses the channel averagenonfading duration as a routing metric to select stable links for path discovery, and applies a preemptive handoff strategy to maintainreliable connections by exploiting channel state information. Using the same information, paths can be reused when they become available again, rather than being discarded. We provide new theoretical results for the downtime and lifetime of a live-die-live multiplepath system, as well as detailed theoretical expressions for common network performance measures, providing useful insights into thedifferences in performance between CA-AOMDV and AOMDV. Simulation and theoretical results show that CA-AOMDV has greatly improved network performance

Channel-Aware Routing in MANETs with Route Handoff

In wireless mobile ad hoc networks (MANETs), packet transmission is impaired by radio link fluctuations. This paper proposes a novel channel adaptive routing protocol which extends the Ad hoc On-Demand Multipath Distance Vector (AOMDV) routing protocol to accommodate channel fading. Specifically, the proposed Channel-Aware AOMDV (CA-AOMDV) uses the channel average nonfading duration as a routing metric to select stable links for path discovery, and applies a preemptive handoff strategy to maintain reliable connections by exploiting channel state information. Using the same information, paths can be reused when they become available again, rather than being discarded. We provide new theoretical results for the downtime and lifetime of a live-die-live multiple path system, as well as detailed theoretical expressions for common network performance measures, providing useful insights into the differences in performance between CA-AOMDV and AOMDV. Simulation and theoretical results show that CA-AOMDV has greatly improved network performance over AOMDV.

A quantitative comparison of ad hoc routing protocols with and without channel adaptation

To efficiently support tetherless applications in ad hoc wireless mobile computing networks, a judicious ad hoc routing protocol is needed. Much research has been done on designing ad hoc routing protocols and some well-known protocols are also being implemented in practical situations. However; one major imperfection in existing protocols is that the time-varying nature of the wireless channels among the mobile-terminals is ignored; let alone exploited. This could be a severe design drawback because the varying channel quality can lead to very poor overall route quality in turn, resulting in low data throughput. Indeed, better performance could be achieved if a routing protocol dynamically changes the routes according to the channel conditions. In this paper, we first propose two channel adaptive routing protocols which work by using an adaptive channel coding and modulation scheme that allows a mobile terminal to dynamically adjust the data throughput via changing the amount of error protection incorporated. We then present a qualitative and quantitative comparison of the two classes of ad hoc routing protocols. Extensive simulation results indicate that channel adaptive ad hoc routing protocols are more efficient in that shorter delays and higher rates are achieved, at the expense of a higher overhead in route set-up and maintenance.

Information efficiency of multihop packet radio networks with channel-adaptive routing

This paper analyzes the benefit of adaptive routing based on knowledge of the channel state information in multihop, ad hoc wireless networks that use direct-sequence code-division multiple access. Cross-layer, channel-adaptive routing exploits the inherent spatial diversity of multihop wireless networks to select links with favorable channel conditions. The information efficiency, an extension of a previously used measure called expected progress, is used to evaluate performance. Results show that, combined with adaptive modulation, adaptive routing can improve performance in ad hoc networks by a factor of four to five in channels with Rayleigh fading and lognormal shadowing. The lack of position information in the routing decision would reduce performance by 25%. New approaches to channel-adaptive routing that enable rapid adaptivity to channel conditions are discussed.

Information efficiency of multihop packet radio networks with channel-adaptive routing

Information efficiency of multihop packet radio networks with channel-adaptive routing