Routing In Mobile Ad Research Articles

DESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS

Routing in Mobile Ad hoc Networks (MANETs) is a challenging task due to the dynamic nature of the network topology and resource constraints. Due to communication over wireless channel, participating nodes also experience interference and bandwidth constraints. Therefore it is essential to develop a robust and efficient routing protocol for MANETs. This research paper involves design and development of a multipath routing protocol for MANETs, called Load Sharing Multipath Routing (LS-MPR) uses dual polarized directional antenna to enhance network efficiency and provide load balancing. LS-MPR is an on-demand multipath routing protocol, which selects best possible multiple paths based on ascending order of hop count and availability of common polarization between neighboring mobile nodes. The performance of the LS-MPR is compared with that Ad-hoc On Demand Distance Vector (AODV) and Dynamic Source Routing (DSR). The network performance is checked with and without node mobility, throughput, Packet Delivery Ratio (PDR), least jitter, low interference and low end-to-end delay. Directional antenna is a very efficient and low cost smart antenna technology. It can achieve better performance, higher throughput, and better resource utilization with omnidirectional antennas multi-path routing cannot be exploited very well since packets routed on one of the paths cause an interference zone that typically encompasses the other paths and thereby limits the number of packets routed on these paths.

Trust Based Routing to Improve Network Lifetime of Mobile Ad Hoc Networks

Mobile Ad hoc Network is an impromptu wireless network consisting of mobile, self governing independent nodes. Routing in Mobile Ad hoc Networks has been a major concern due to its dynamic topology, lossy and unreliable links. In traditional routing, a single specific node is selected in prior as the potential next-hop forwarder for a packet. Unlike traditional routing, a category of routing technique termed Opportunistic Routing exploits the broadcast nature of wireless medium to compensate the unreliability of the packet transmissions in the channel. In Opportunistic Routing, one among the set of candidate nodes is selected as the potential next-hop forwarder using metrics like number of transmissions in a link, link error probability, cost, etc., for packet transmission. For selection and prioritization of candidates that ensures minimum number of transmissions from source to destination node, whilst improving the lifetime of the network on determining the residual battery energy, a new metric is proposed. This metric helps in improving the network lifetime considering the transmission powers in terms of the fraction of residual battery powers. Further, as nodes in mobile ad hoc networks are susceptible to attacks, a trust model based on direct, as well as indirect trust degrees from similar trusted neighbours is integrated in order to overcome the vulnerability due to attacks by malicious/selfish nodes and to provide reliable packet transmissions. Fading of trust is incorporated with a perspective to ensure the uncertainty of trust with time until it is updated.

Mitigating the impact of node mobility using mobile backbone for heterogeneous MANETs

Routing in Mobile Ad hoc Network (MANET) has been an active research area in the past few years. It is observed that as the mobility of nodes increases, the performance of existing cluster based routing protocols tends to deteriorate rapidly. Although many mobility based clustering schemes have been proposed to address this problem, majority of these proposals assume the movement of nodes follows group mobility. In this paper, we propose a new cluster based routing protocol FASTR which utilizes mobile backbone to mitigate the impact of node mobility for networks with high node mobility and low group mobility. Our scheme eliminates the delay caused by cluster head election and enables nodes to start communication immediately after joining a cluster. Through simulation and analysis, our protocol is shown to possess good scalability, incur lower control overhead and achieve higher packet delivery ratio than existing OLSR and HOLSR routing protocols for various node mobility. Furthermore, unlike other proactive routing protocols, the control overhead of FASTR is shown to be independent of node mobility and consume less network resources than HOLSR and OLSR.

Routing in Mobile Ad hoc Network: A Review

This goal of this paper is to provide a review on various architectures available for routing in Mobile Ad hoc Networks. Mobile Ad hoc networks (MANET) are wireless networks which are infrastructure less in nature. There is no central access point in MANET, each node is able to move in any direction and has the ability to act as a router also. In order to make fast and easy communication between nodes various routing protocols have been proposed. Routing protocols can be categorized under various categories. Here, in this paper the routing protocols have been divided under following major categories: Unicast routing protocols, QoS based routing protocols, power aware routing protocols, secure routing protocols, location based routing protocols.

CORMAN: A Novel Cooperative Opportunistic Routing Scheme in Mobile Ad Hoc Networks

The link quality variation of wireless channels has been a challenging issue in data communications until recent explicit exploration in utilizing this characteristic. The same broadcast transmission may be perceived significantly differently, and usually independently, by receivers at different geographic locations. Furthermore, even the same stationary receiver may experience drastic link quality fluctuation over time. The combination of link-quality variation with the broadcasting nature of wireless channels has revealed a direction in the research of wireless networking, namely, cooperative communication. Research on cooperative communication started to attract interests in the community at the physical layer but more recently its importance and usability have also been realized at upper layers of the network protocol stack. In this article, we tackle the problem of opportunistic data transfer in mobile ad hoc networks. Our solution is called Cooperative Opportunistic Routing in Mobile Ad hoc Networks (CORMAN). It is a pure network layer scheme that can be built atop off-the-shelf wireless networking equipment. Nodes in the network use a lightweight proactive source routing protocol to determine a list of intermediate nodes that the data packets should follow en route to the destination. Here, when a data packet is broadcast by an upstream node and has happened to be received by a downstream node further along the route, it continues its way from there and thus will arrive at the destination node sooner. This is achieved through cooperative data communication at the link and network layers. This work is a powerful extension to the pioneering work of ExOR. We test CORMAN and compare it to AODV, and observe significant performance improvement in varying mobile settings.

Position-Based Multicast Routing in Mobile Ad hoc Networks: An Analytical Study

With the prevalence of multimedia applications and the potential commercial usage of Mobile Ad hoc Networks (MANETs) in group communications, Quality of Service (QoS) support became a key requirement. Recently, some researchers studied QoS multicast issues in MANETs. Most of the existing QoS multicast routing protocols are designed with flat topology and small networks in mind. In this paper, we investigate the scalability problem of these routing protocols. In particular, a Position-Based QoS Multicast Routing Protocol (PBQMRP) has been developed. PBQMRP builds a source multicast tree guided by the geographic information of the mobile nodes, which helps in achieving more efficient multicast delivery. This protocol depends on the location information of the multicast members which is obtained using a location service algorithm. A virtual backbone structure has been proposed to perform this location service with minimum overhead and this structure is utilized to provide efficient packet transmissions in a dynamic mobile Ad hoc network environment. The performance of PBQMRP is evaluated by performing both quantitative analysis and extensive simulations. The results show that the used virtual clustering is very useful in improving scalability and outperforms other clustering schemes. Compared to On-Demand Multicast Routing Protocol (ODMRP), PBQMRP achieves competing packet delivery ratio and significantly lower control overhead.

Design and Implementation of Multi-Path Routing in Mobile Ad hoc Networks

Wireless Networking is an emerging technology that will allow users to access information and services regardless of their geographic position. In contrast to infrastructure based networks, in wireless Ad hoc Networks, all nodes are Mobile and can be connected dynamically in an arbitrary manner. All nodes of these networks behave as routers and take part in discovery and maintenance of routes to other nodes in the network. This feature presents a great challenge to the design of a routing scheme since link bandwidth is very limited and the network topology changes as users roam. This paper investigates the behavior of existing traditional routing algorithms and proposes and implements a new routing approach for Ad hoc wireless networks. The design and evaluation of multiple descriptions coding for multimedia transport over Mobile Ad hoc Networks. Instead of transporting data through a single communication pipe, the data is split up into multiple streams, which each take a different route through the network. This document explains the basics of Multi-path routing and provides an overview and comparison of Multi-path routing protocols which may be suited for the use of multiple description coding.

A Simulation-based Performance Analysis of Multicast Routing in Mobile Ad hoc Networks

In an earlier work, we had proposed an algorithm, referred to as OptTreeTrans, to determine a sequence of long-living stable multicast trees for mobile ad hoc networks (MANETs) such that the number of tree transitions is the theoretical minimum. In this paper, we study the performance of representatives from three different classes of on-demand source-tree based distributed multicast routing protocols vis-a-vis the centralized OptTreeTrans algorithm with respect to metrics such as the multicast tree lifetime, number of links per multicast tree and the hop count per source-receiver path. Appropriately, the distributed routing protocols considered are the minimum-links based BandwidthEfficient Multicast Routing Protocol (BEMRP), minimum hop-based Multicast Ad Hoc On-Demand Distance Vector (MAODV) routing protocol and the stability-oriented Associativity-Based Ad hoc Multicast (ABAM) routing protocol. Simulation results reveal a tradeoff between the three metrics: we observe that the three classes of distributed multicast routing protocols discover trees that have significantly smaller lifetime than those discovered using OptTreeTrans; on the other hand, the number of links per multicast tree and the hop count per source-receiver path incurred by the stable mobile multicast trees of OptTreeTrans are relatively larger than those discovered by the three classes of distributed multicast routing protocols.

Improvement in Network Lifetime for On-Demand Routing in Mobile Ad hoc Networks using either On-Demand Recharging or Transmission Power Control or Both

Given a fixed energy budget for the operation of a mobile ad hoc network (MANET), on-demand recharging is the technique of charging the nodes initially with identical, but reduced energy level called the recharge quantum, and then recharging the nodes with the recharge quantum of energy whenever the energy level at a node goes below a threshold level. Transmission power control is the technique of adjusting the transmission power at a sender node depending on the distance to the receiver node. The high-level contribution of this paper is a simulation-based analysis of the network lifetime obtained for each of the following four scenarios: [a] No power control, No on-demand recharging; [b] Power control, but no on-demand recharging; [c] On-demand recharging, but no power control and [d] Both power control and on-demand recharging. Network lifetime is defined as the time of first node failure due to the exhaustion of energy level at the node and the inability to further charge the node. The on-demand routing protocols studied are: Dynamic Source Routing (DSR), Flow-Oriented Routing Protocol (FORP) and the Min-Max Battery Cost Routing (MMBCR) algorithm run on the top of DSR. We illustrate the improvement obtained in network lifetime as we transition from scenarios [a] through [d]. Simulation results illustrate that scenarios involving on-demand recharging ([c] and [d]) yield a higher network lifetime than scenarios [a] and [b]. When we operate the network with both on-demand recharging and power control, we obtain the maximum improvement in network lifetime. The percentage of the supplied energy that has been consumed in the network at the time of first node failure for each of the four scenarios and the three routing protocols is also measured to illustrate the effectiveness of on-demand recharging in maximizing the usage of the available energy budget.

Associativity-Based On-Demand Multi-Path Routing In Mobile Ad Hoc Networks

This paper is primarily concerned with multi-path routing in Mobile Ad hoc Networks (MANETs). We propose a novel associativity-based on-demand source routing protocol for MANETs that attempts to establish relatively stable path(s) between the source and the destination. We introduce a new notion for gauging the temporal and spatial stability of nodes, and hence the paths interconnecting them. The proposed protocol is compared with other unipath (DSDV and AODV) and multi-path (AOMDV) routing protocols. We investigate the performance in terms of throughput, normalized routing overhead, packet delivery ratio etc. All on-demand protocols show good performance in mobile environments with less traffic overhead compared to proactive approaches, but they are prone to longer end-to-end delays due to route discovery and maintenance.

A New QoS Routing Scheme Based on Bandwidth Consumption for MANETs

Quality of Service (QoS) routing in Mobile Ad hoc NETworks (MANETs) is hard to achieve because the network topology tends to change constantly in a dynamic network. In this paper, we propose an effective QoS routing scheme to satisfy the required service demand and adapt to the dynamic changes in network resources. This novel approach of Application-Level QoS Routing Scheme (ALRS) comprises three significant features: (1) Estimation of consumed bandwidth on each node by using 2-hop neighbors' traffic information, (2) Route construction combined with admission control on each application session with (1), and (3) Route maintenance based on (1) and (2). By using our proposed ALRS scheme the availability of bandwidth is greatly improved for high-load communications, such as multimedia applications. By computer simulation we confirmed that ALRS increases the delivery ratio by up to 50% and decreases delay by less than one-fourth of the existing traditional method.

DNA cryptography: a novel paradigm for secure routing in Mobile Ad hoc Networks (MANETs)

Ad hoc networks do not necessarily rely on fixed infrastructure for the communication amongst its various nodes and this poses new challenges for the necessary architecture they apply. In addition, ad hoc networks are often designed for specific environments and may have to operate with full availability in difficult situations making them vulnerable as compared to traditional networks. In this paper, we propose a novel secure ad hoc routing protocol that uses pseudo DNA cryptography. The presented work deals with the assumptions, length analysis and evaluation of pseudo DNA algorithm, which can be implemented for securing Ad hoc Networks.

A loop-based approach in clustering and routing in Mobile Ad hoc NETworks

The effects of UV intensity and turbidity on selected microbial indicator inactivation were investigated. Results showed that UV disinfection was effective in killing all the selected microbial indicators, the resistance order of the microorganisms was as follows: MS-2 coliphage > Bacillus subtilis > E. coli > Staphylococcus aureus and Candida albicans. UV intensity had influence on the inactivation of all the microorganisms, high UV disinfection efficency was obtained with higher UV intensity. Turbidity had impact on the bacteria inactivation rate, but there was no evidence that turbidity had any negative contribution to MS-2 coliphage. Under the same UV dosage, higher UV intensity could overcome the negative influence of turbidity on UV performance, enhanced microorganism inactivation effect in turbidity water.

Energy efficient broadcast routing in mobile ad hoc networks

AbstractIn this paper, we address the problem of broadcast routing in mobile ad hoc networks from the viewpoint of energy efficiency. In an ad hoc wireless network, each node runs on a local energy source which has a limited energy lifespan. Thus, energy conservation is a critical issue in ad hoc networks. One approach for energy conservation is to establish routes which require lowest total energy consumption. This optimization problem is referred as the minimum‐energy broadcast routing problem (MEBRP). In this paper, we propose new efficient algorithms for the construction of energy‐efficient trees for broadcast in mobile ad hoc networks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy‐efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEBRP. Copyright © 2004 John Wiley & Sons, Ltd.