Design a Proposed Algorithm for Reliable Data Delivery for High Dynamic MANET

Transcription

1 Design a Proposed Algorithm for Reliable Data Delivery for High Dynamic MANET Rashmi Saini 1 and Vinit Lohan 2 1 M.Tech. Student, Department of CSE, VCE, Rohtak, Haryana (India) 2 Assistant Professor, Department of CSE, VCE, Rohtak, Haryana (India) Abstract In this paper we will design such kind of proposed algorithm that will very beneficial for reliable data delivery for high dynamic MANET. The algorithm is based on Candidate Selection and Opportunistic Routing for delivery of data across networks. The aim of this is to propose Position-based Opportunistic Routing (POR) protocol to deliver data packets in highly dynamic mobile ad hoc networks. Keywords: Reliable Data Delivery, Candidate Selection, MANET. Introduction The problem of delivering data packets for highly dynamic mobile ad hoc networks in a reliable and timely manner is addressed. Most existing ad hoc routing protocols are susceptible to node mobility, especially for large-scale networks. Driven by this issue, we propose an efficient Position-based Opportunistic Routing (POR) protocol which takes advantage of the stateless property of geographic routing and the broadcast nature of wireless medium. When a data packet is sent out, some of the neighbor nodes that have overheard the transmission will serve as forwarding candidates, and take turn to forward the packet if it is not relayed by the specific best forwarder within a certain period of time. By utilizing such in-the-air backup, communication is maintained without being interrupted. The additional latency incurred by local route recovery is greatly reduced and the duplicate relaying caused by packet reroute is also decreased. In the case of communication hole, a Virtual Destination-based Void Handling (VDVH) scheme is further proposed to work together with POR. Literature Review A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Josh Broch David A. Maltz David B. Johnson Yih-Chun Hu Jorjeta Jetcheva 71 An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Due to the limited transmission range of wireless network interfaces, multiple network "hops" may be needed for one node to exchange data with another across the network. In recent years, a variety of new routing protocols targeted specifically at this environment have been developed, but little performance information on each protocol and no realistic performance comparison between them is available. This paper presents the results of a detailed packet-level simulation comparing four multi-hop wireless ad hoc network routing protocols that cover a range of design choices: DSDV, TORA, DSR, and AODV. We have extended the ns-2 network simulator to accurately model the MAC and physical-layer behavior of the IEEE wireless LAN standard, including a realistic wireless transmission channel model, and present the results of simulations of networks of 50 mobile nodes. The Effect of Mobility-induced Location Errors on Geographic Routing in Mobile Ad Hoc and Sensor Networks: Analysis and Improvement using Mobility Prediction. Dongjin Son, Ahmed Helmy, Bhaskar Krishnamachari, Department of Electrical Engineering, University of Southern California. Geographic routing has been introduced in mobile ad hoc networks and sensor networks. Under ideal settings, it has been proved to provide drastic performance improvement over strictly address-centric routing schemes. While geographic routing has been shown to be correct and efficient when location information is accurate, its performance in the face of location errors is not well understood. In this paper, we study the effect of inaccurate location information caused by node mobility under a rich set of scenarios and mobility models. We identify two main problems, named LLNK and LOOP that are caused by mobility-induced location errors. Based on analysis via ns -2 simulations, we propose two mobility prediction schemes --- neighbor location prediction (NLP) and destination

2 location prediction (DLP) to mitigate these problems. Simulation results show noticeable improvement under all mobility models used in our study. Under the settings we examine, our schemes achieve up to 27% improvement in packet delivery and 37% reduction in network resource wastage on average without incurring any additional communication or intense computation. ExOR: Opportunistic MultiHop Routing for Wireless Networks Sanjit Biswas and Robert Morris, M.I.T. Computer Science and Artifical Intelligence Laboratory This paper describes ExOR, an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multi-hop wireless networks. ExOR chooses each hop of a packet's route after the transmission for that hop, so that the choice can re ect which intermediate nodes actually received the transmission. This deferred choice gives each transmission multiple opportunities to make progress. As a result ExOR can use long radio links with high loss rates, which would be avoided by traditional routing. ExOR increases a connection's throughput while using no more network capacity than traditional routing. ExOR's design faces the following challenges. The nodes that receive each packet must agree on their identities and choose one forwarder. The agreement protocol must have low overhead, but must also be robust enough that it rarely forwards a packet zero times or more than once. Finally, ExOR must choose the forwarder with the lowest remaining cost to the ultimate destination. Measurements of an implementation on a 38-node b test-bed show that ExOR increases throughput for most node pairs when compared with traditional routing. For pairs between which traditional routing uses one or two hops, ExOR's robust acknowledgments prevent unnecessary retransmissions, increasing throughput by nearly 35%. For more distant pairs, ExOR takes advantage of the choice of forwarders to provide throughput gains of a factor of two to four. Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski Michael Jennings Sachin Katti Dina Katabi, MIT CSAIL Opportunistic routing is a recent technique that achieves high throughput in the face of lossy wireless links. The current opportunistic routing protocol, ExOR, ties the MAC with routing, imposing a strict schedule on routers access to the medium. Although the scheduler delivers opportunistic gains, it misses some of the inherent features of the MAC. For example, it prevents spatial reuse and thus may underutilize the 72 wireless medium. It also eliminates the layering abstraction, making the protocol less amenable to extensions to alternate traffic types such as multicast. This paper presents MORE, a MAC-independent opportunistic routing protocol. MORE randomly mixes packets before forwarding them. This randomness ensures that routers that hear the same transmission do not forward the same packets. Thus, MORE needs no special scheduler to coordinate routers and can run directly on top of Experimental results from a 20-node wireless testbed show that MORE s median unicast throughput is 22% higher than ExOR, and the gains rise to 45% over ExOR when there is a chance of spatial reuse. For multicast,more s gains increase with the number of destinations, and are % greater than ExOR. SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks Eric Rozner, University of Texas at Austin; Jayesh Seshadri, VMware; Yogita Ashok Mehta, Google; Lili Qiu, University of Texas at Austin Multihop wireless mesh networks are becoming a new attractive communication paradigm owing to their low cost and ease of deployment. Routing protocols are critical to the performance and reliability of wireless mesh networks. Traditional routing protocols send traffic along predetermined paths and face difficulties in coping with unreliable and unpredictable wireless medium. In this paper, we propose a Simple Opportunistic Adaptive Routing protocol (SOAR) to explicitly support multiple simultaneous flows in wireless mesh networks. SOAR incorporates the following four major components to achieve high throughput and fairness: (i) adaptive forwarding path selection to leverage path diversity while minimizing duplicate transmissions, (ii) priority timerbased forwarding to let only the best forwarding node forward the packet, (iii) local loss recovery to efficiently detect and retransmit lost packets, and (iv) adaptive rate control to determine an appropriate sending rate according to the current network conditions. We implement SOAR in both NS-2 simulation and an 18-node wireless mesh testbed. Our extensive evaluation shows that SOAR significantly outperforms traditional routing and a seminal opportunistic routing protocol, ExOR, under a wide range of scenarios. Problem Statement Traditional topology-based MANET routing protocols (e.g., DSDV, AODV, DSR) are quite susceptible to node mobility. One of the main reasons is due to the predetermination of an end-to-end route before data transmission. Owing to the constantly and even fast changing network topology, it is very

3 difficult to maintain a deterministic route. The discovery and recovery procedures are also time and energy consuming. Once the path breaks, data packets will get lost or be delayed for a long time until the reconstruction of the route, causing transmission interruption. Problem Solution A novel Position-based Opportunistic Routing (POR) protocol is proposed, in which several forwarding candidates cache the packet that has been received using MAC interception. If the best forwarder does not forward the packet in certain time slots, suboptimal candidates will take turn to forward the packet according to a locally formed order. In this way, as long as one of the candidates succeeds in receiving and forwarding the packet, the data transmission will not be interrupted. Potential multi-paths are exploited on the fly on a per-packet basis, leading to POR s excellent robustness. Existing System Geographic routing (GR) uses location information to forward data packets, in a hop-by-hop routing fashion. However, GR is very sensitive to the inaccuracy of location information. Greedy forwarding is used to select next hop forwarder with the largest positive progress toward the destination while void handling mechanism is triggered to route around communication voids. If the node moves out of the sender s coverage area, the transmission will fail. In GPSR, the MAC-layer failure feedback is used to offer the packet another chance to reroute. Due to the broadcast nature of the wireless medium, a single packet transmission will lead to multiple receptions. The concept of such multicast-like routing strategy has already been demonstrated in opportunistic routing. However, most of them use link-state style topology database to select and prioritize the forwarding candidates. The batching used in these protocols also tends to delay packets and is not preferred for many delay sensitive applications. Location-aided opportunistic routing has been proposed which directly uses location information to guide packet forwarding. However, it is still designed for static mesh networks and focuses on network throughput while the robustness brought upon by opportunistic forwarding has not been well exploited. Disadvantages Router discovery cost is high Duplicate relay caused by packet re-router is decreased If the node moves out of the sender s coverage area, the transmission will fail. Proposed System A novel Position-based Opportunistic Routing (POR) protocol is proposed, in which several forwarding candidates cache the packet that has been received using MAC interception. If the best forwarder does not forward the packet in certain time slots, suboptimal candidates will take turn to forward the packet according to a locally formed order. We propose a position-based opportunistic routing mechanism which can be deployed without complex modification to MAC protocol and achieve multiple reception without losing the benefit of collision avoidance provided by Virtual Destination-based Void Handling (VDVH) scheme in which the advantages of greedy forwarding (e.g., large progress per hop) and opportunistic routing can still be achieved while handling communication voids. Advantages Potential multipaths are exploited on the fly on a perpacket basis, leading to POR s excellent robustness. The concept of in-the-air backup significantly enhances the robustness of the routing protocol and reduces the latency and duplicate forwarding caused by local route repair. Proposed Algorithm Candidate Selection ListN : Neighbor List ListC : Candidate List, initialized as an empty list 73

4 ND : Destination Node Base : Distance between current node and ND Step 5: If when the Source Node transmitting packet, trigger node, which send warning message for un-delivery of data packets Step 1: if find (ListN;N D ) then Step 6: Then void handling is adopted Step 2: Step 3: Step 4: Step 5: Step 6: Step 7: Step 8: Step 9: next_hop- ND return end if For i 0 to length(listn) do ListN[i].dist dist(listn[i],nd) end for ListN.sort() next hop ListN[0] Step 10: for i 1 to length[listn] do Step 11: if dist(listn[i];nd) >= base or length(listc) = N Step 12: then Step 13: break Step 14: else if dist(listn[i], listn[0]) < R=2 then Step 15: ListC.add(ListN[i]) Step 16: end if Step 17: end for Candidate Selection and Opportunistic Routing Step 1: Step 2: Step 3: Step 4: Mobile Adhoc Network is constructed with n number of nodes. Nodes are aware of their direct neighbors. The one-hop neighbors of all the mobile nodes are identified For a sender node S, candidate relay node is selected, by checking the distance to the destination node D. Sender Node S checks for next hop node and forwarding node. Step 7: Step 8: Scope Virtual destination node D is assigned to collect the data packet temporarily. Then from virtual destination, the packets are forwarded to the real destination, once the destination nodes retains its availability. Mobile ad hoc networks (MANETs) have gained a great deal of attention because of its significant advantages brought about by multihop, infrastructure-less transmission. However, due to the error prone wireless channel and the dynamic network topology, reliable data delivery in MANETs, especially in challenged environments with high mobility remains an issue. References [1] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva, A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols, Proc. ACM MobiCom, pp , [2] M. Mauve, A. Widmer, and H. Hartenstein, A Survey on Position-Based Routing in Mobile Ad Hoc Networks, IEEE Network, vol. 15, no. 6, pp , Nov./Dec [3] D. Chen and P. Varshney, A Survey of Void Handling Techniques for Geographic Routing in Wireless Networks, IEEE Comm. Surveys and Tutorials, vol. 9, no. 1, pp , Jan.-Mar [4] D. Son, A. Helmy, and B. Krishnamachari, The Effect of Mobility Induced Location Errors on Geographic Routing in Mobile Ad Hoc Sensor Networks: Analysis and Improvement Using Mobility Prediction, IEEE Trans. Mobile Computing, vol. 3, no. 3, pp , July/Aug [5] B. Karp and H.T. Kung, GPSR: Greedy Perimeter Stateless Routing for Wireless Networks, Proc. ACM MobiCom, pp , [6] S. Biswas and R. Morris, EXOR: Opportunistic Multi- Hop Routing for Wireless Networks, Proc. ACM SIGCOMM, pp , [7] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, Trading Structure for Randomness in Wireless Opportunistic Routing, Proc. ACM SIGCOMM, pp ,

5 [8] E. Rozner, J. Seshadri, Y. Mehta, and L. Qiu, SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks, IEEE Trans. Mobile Computing, vol. 8, no. 12, pp , Dec [9] A. Balasubramanian, R. Mahajan, A. Venkataramani, B.N. Levine, and J. Zahorjan, Interactive WiFi Connectivity for Moving Vehicles, Proc. ACM SIGCOMM, pp , [10] K. Zeng, Z. Yang, and W. Lou, Location-Aided Opportunistic Forwarding in Multirate and Multihop Wireless Networks, IEEE Trans. Vehicular Technology, vol. 58, no. 6, pp , July