Stable AODV Protocol in Mobile Ad-Hoc Network

2008

An ad-hoc network is a multi-hop wireless network where all nodes cooperatively maintain network connectivity without a centralized infrastructure. If these nodes change their positions dynamically, it is called a mobile ad-hoc network (MANET). Due to the limited transmission range of wireless nodes, as well as the rapid change in network topology, multiple network hops may be needed for one node to exchange data with another across the network. Thus, each mobile node operates not only as a host but also as a router, forwarding packets for other mobile nodes in the network that may not be within the transmission range of the source. Each node participates in an ad-hoc routing protocol that allows it to discover multi-hop paths through the network to any other node. Two conflicting requirements have to be kept in mind when designing a MANET routing algorithm-frequent topology updates are required because of mobility, yet, frequent updates result in higher message overhead and greater power loss. Different routing protocols use different metrics to dynamically determine the optimal path between the sender and the recipient. These cost parameters include number of hops, delay, link quality, location stability and power conservation. The aim of this paper is to classify and qualitatively describe different network routing algorithms, with particular emphasis on power-awareness. A few common routing protocols have been explored in detail and refinements proposed.

2011

The nodes in Mobile Ad Hoc Network (MANET) are mobile resulting in dynamic topology with high rate of link breakage and network partitions leading to interruptions in the ongoing communication. In contrast to wired network, MANET has increased possibility of packet loss and congestion resulting in energy consumption. Routing techniques help in path establishment for transmission. The existing routing protocols suffer from overhead causing energy loss which may be further aggravated by link failures. This survey discuss about the conventional routing protocols that are prime candidates for the study of overhead and link failure problems. And also reviewed the various approaches proposed in the literature to make conventional routing protocols energy efficient. Keywords-Ad hoc network; energy consumption; routing protocols; overhead; link

A mobile Ad hoc network (MANET) is a collection of wireless nodes that forms a network without central administration. The nodes in such kind of network serve as routers as well as hosts. The nodes can forward packets on behalf of other nodes and run user applications. The energy consumption of the nodes is a critical factor in the operation of a mobile ad hoc network. The existence of a node with low energy may degrade the performance of the system as the node participate in the route discovery phase, but due to low energy it does not forward the packet or it does not participate in message forwarding phase. Such type of node selection will degrade the system performance, minimizes the packet delivery ratio, and maximizes delay thus increasing energy consumption. So an important objective is to consider Energy Aware design of network protocols for Ad hoc network environment. The proposed scheme is incorporated with the route discovery phase of AODV and by simulation using NS/2 it is observed that the proposed algorithm is better than AODV in terms of packet delivery ratio and network lifetime.

Mobile ad-hoc network is the collection of node which dynamically forms a temporary network without the use of any existing network infrastructure or centralized administration. When the mobility in the network is high and the topology changes frequently the route maintenance overhead in AODV increases. Because nodes can move link breakages can occurs. Long path is more vulnerable to link breakages and requires high control overhead for its maintenance. In this paper we introduce a new modified AODV protocol. This new protocol uses stability factor of intermediate nodes to find the most sable neighbors and therefore most stable path. This new proposed protocol is SR-AODV (Stable Route AODV) protocol. We simulate both AODV and SR-AODV with ns-2 in similar scenario. We find that SR-AODV will show better performance than AODV.

Journal of Network and Systems Management, 2006

A novel routing protocol for wireless, mobile ad hoc networks is presented. This protocol incorporates features that enhance routing reliability, defined as the ability to provide almost 100% packet delivery rate. The protocol is based on a virtual structure, unrelated to the physical network topology, where mobile nodes are connected by virtual links and are responsible for keeping physical routes to their neighbors in the virtual structure. Routes between pairs of mobiles are set up by using information to translate virtual paths discovered in the virtual structure. Route discovery and maintenance are based on unicast messages travelling across virtual paths, with sporadic use of flooding protocol. Most floodings are executed in background using low priority messages. The routing protocol has been evaluated and compared with the Dynamic Source Routing protocol (DSR) by means of simulation. * Corresponding author 1 in the rest of the paper the terms mobile and node will be used as synonyms.

The mobile sensors or nodes in Mobile Ad hoc Network (MANET) are in motion continuously without any presence of any authorised administration or authority. The dynamic link in between sender to receiver is created through intermediate nodes. The routing protocol is used MANET is completely different from traditional wired and wireless routing protocols. In this research we proposed the reliable and scalable multipath routing with OLSR routing protocol in MANET to control congestion in dynamic network. The normal OLSR protocol is proactive in nature and store routing information in for communication. The updation in OLSR is multipath OLSR i.e. M-CML. The M-CML performance is better than OLSR because more than one route is available for data sending. In proposed congestion control routing scheme we slightly more improve the performance of OLSR through estimating the processing capability of mobile node and link capacity with queue management. The nodes and link between node has minimum load is select for routing the data in network. The heavy loaded shortest paths are ignores because the possibility of congestion is more. The proposed protocol is improves the packet receiving and minimized the routing overhead that is the sign of better network performance. The packet dropping is minimizes because of delay in network is also reduced. The performance of three protocols including proposed is evaluated in this research and in each metrics the proposed is more robust and reliable for communication. 1 Introduction: Wireless mobile ad-hoc sensor network are classified into two category infrastructure based and infrastructure less network it depends on the network behavior. While the base station present in the scenario that that type of the network form star topology and other side while each node capable to containing and managing route table and dynamical change the network topology it means network is infrastructure less [1]. Wireless mobile ad-hoc network offer number of advantages as compare to wired network because it's a self configure, distributed management, cost less communication and light weighted devices. However the key MANET attraction is greater mobility compared with wired solutions. Established path between senders to receiver's pair contains multiple intermediate nodes and each node takes the responsibility as a router. Route decision in mobile ad-hoc network [2] has been a difficult job because node mobility do not controlled by other nodes or devices. The

Ad hoc (MANET) is a kind of unique networks in which the topology of network is continuously being changed due to motion of nodes and also the fact that it is a wireless network. Today, many researches are being carried out on Ad hoc due to their wide use in urban societies especially in earthquake stricken regions and also military areas. Since the nodes of this type of networks are able to move, then the challenges of these networks are continuous changing of network topology and error of nodes which may lead to interruption of data transferring between nodes. In current methods, most volume of data is transferred through a high QOS route. Thus, the possibility of finishing the energy of engaged nodes may cut the relation of nodes which in turn leads to network collapsing. In this paper, we propose a new approach for data transferring with respect to service quality, communication capabilities and processing specifications of nodes issues. Our object is to recognize those routs whose capabilities and characteristics introduce them as backbone routs for routing and data transferring in network. We design a mechanism by which the processes of routing and data transferring are carried out through distribution of traffic across network regarding current traffic of network and processing levels of nodes. Numerical computations and simulations reveal that this method increases the speed of reliable data transferring and decreases end to end delay and making an optimum balance in the energy to be consumed by nodes. All these advantages will lead to increasing network lifetime.

American Journal of Applied Sciences, 2010

A mobile ad hoc network is a self-configuring network of mobile nodes connected by wireless links. As the nodes are free to move randomly, topology of the network may change rapidly and unpredictably. As a result, intermediate nodes in the communication routes tend to lose connection with each other during the communication process. In order to repair a broken link, an end-toend (from source to destination) route discovery is typically performed to establish a new route for communication. The mechanism results in huge communication overhead and long delay in completion of the communication. So, it is rational to locally repair a link, as much as possible, than to discover a whole new route. Approach: In the present article, we proposed a Link Stability and Node Energy Conscious (LSNEC) local route repair scheme for mobile ad hoc networks. In case of breakage of a link from node n a to another node n b in between a communication session, LSNEC instructs n a to broadcast a ROUTE-REPAIR message within its radio-range specifying n b or any successor of n b in the broken route, as a desirable destination. If any node residing within the radio-range of n a has an already established single/multi-hop path to any one of those destinations mentioned in the ROUTE-REPAIR message, it sends a REPAIR-ACK message back to n a . Attributes of REPAIR-ACK include the identification number (s) of the destination (s) as well as identification numbers, geographical positions (in terms of latitude and longitude), radio-ranges and residual energies of nodes present in the associated path to that destination along with the intuitively computed stability of links between the consecutive nodes. The stability is computed depending upon relative velocities of the involved nodes, distance between them and the history of survival of the link. The optimal path is chosen depending upon the residual energy of nodes, stability of links and number of hops in that path. Results: In simulations we compared the LSNEC embedded versions of the protocols Ad hoc On-demand Distance Vector routing (AODV) and Associatively Based Routing (ABR) with their ordinary versions as well as PATCH and "Quick Local Repair" scheme (to be referred to as QLR subsequently in this study) embedded versions. Both PATCH and QLR are wellknown local repairing schemes for ad hoc networks. It is found that, LSNEC-AODV dramatically saves 57% control overhead compared to ordinary AODV, 32.7% compared to PATCH-AODV and 36.3% compared to QLR-AODV. Similarly, LSNEC-ABR saves 29.3% control overhead than ordinary ABR, 10.7% than PATCH-ABR and 12.8% than QLR-ABR. Accordingly decrease the power consumption of network nodes and delay in recovery. Conclusion: The simulation results emphatically illustrated the performance benefit of our proposed scheme LSNEC compared to the other state-of-the-art local routerepair schemes, in respect of control overhead, overall energy consumption of the network, data packet delivery ratio and route recovery delay. LSNEC has its application wherever an ad hoc network is used. Please note that ad hoc networks are extremely useful in military and other tactical applications such as emergency rescue, exploration missions and other scenarios w here cellular infrastructure is unavailable.

The First Annual Mediterranean Ad Hoc …, 2002

In this paper, we describe the Optimized Link State Routing Protocol (OLSR) [19],[20], a proactive routing protocol for Mobile Ad-hoc NETworks (MANETs). We evaluate its performance through exhaustive simulations using the Network Simulator 2 (ns2) [1], and compare with other ad-hoc protocols, specifically the Ad-hoc On-Demand Distance Vector (AODV) [4] routing protocol and the Dynamic Source Routing (DSR) [5] protocol. We study the protocols under varying conditions (node mobility, network density) and with varying traffic (TCP, UDP, different number of connections/streams) to provide a qualitative assessment of the applicability of the protocols in different scenarios. * Thomas Heide Clausen may also be contacted at MindPass Center for

2011

A Mobile Ad Hoc Networks (MANETs) is a group of mobile nodes which cooperate in forwarding packets in a multi-hop fashion without any centralized administration. One of its key challenges is routing. Many routing protocols for MANET have been proposed and the protocols can be classified as proactive routing and on demand routing protocols. This paper uses ns-2 as the simulation tool, 802.11 as the wireless MAC protocol, and AODV & DSDV as the routing protocol. We present the traces of communication between different mobile nodes using Routing Protocols in MANETs. To compare the performance of Proactive and Reactive routing protocol, we have to analyze the simulation results by graphical manner and trace file based on QoS metrics such as Throughput, Drop, Delay, Jitter etc. Here, we have analyzed the simulation result by traces files only. The performance differentials have been analyzed based on network load, mobility, and network size. INDEX TERMS DSDV, AODV, MANET, QoS, Network Si...