Reduction the Effect of Mobility in Link Transmitting Using Efficient DSR Route Cache for MANETs
Authors: Ayoob A. Ayoob, Norrozila Sulaiman, Muamer N. Mohammed
Title: Reduction the Effect of Mobility in Link Transmitting Using Efficient DSR Route Cache for MANETs
Journal: Journal of Advances in Computer Networks,
Volume, Issue No. Page No.: Vol. 2, No. 4, Pg. No. 254-260.
Month, Year: December 2014
1. INTRODUCTION:
The approach of route cache in DSR protocol is used to stock a route that is learned from the source node and to avoid needless route discovery operation in each time the data packet is to be transmitted. It is needs to start again the route discovery mechanism in reactive on demand routing protocols, as it is very costly in
…show more content…
The route cache may be containing the stale routes which can affect for the performance of DSR protocol. The stale routes in the route cache of DSR protocol may take several adverse effects such as long delay, packet loss. Route cache can be divided to the three different strategies cache structure, cache capacity and cache timeout.
The DSR (Dynamic Source Routing) routing protocol dependent on the cache memory for every node to store the routing path from source to destination. It is a new algorithm using DSR routing cache technique to improve the routing between mobile nodes to reduction the effect of mobility in link transmitting that can solve link broken problem.
2. PREVIOUS WORK DONE:
[W. Lou and Y. Fang 2002] proposed that the stale route in the cache of the DSR can be removed by the Adaptive link cache procedure and then compare it with the path of cache structure. [B. Y. He, 2002] proposed “Active Packet" to resolve the problem of stale route in cache route in DSR protocol. It depends on the link cache structure, which the active packet travels around the network, and gathers routing information that has found by network topology. [J. Chen 2010] proposed Tiding Active Packets (TAP) to improve the active packet method. [A. K. Dwivedi 2009] describe the comparison of the Active Packet and Route Error RERR flooding of TAP
In the location-based routing, sensor nodes are distributed randomly in an interesting area. They are positioned mostly by utilizing of Global position system. The distance among the sensor nodes is evaluated by the signal strength obtained from those nodes and coordinates are computed by interchanging information among neighbouring nodes. Location-based routing networks are;
AODV are utilized, instead of broadcasting data packets, S start off a route discovery protocol that requires broadcasting smaller Route Request
In simulated network the source node designated as1 initiates the routing procedure by sending RREQ or Route Request message to its surrounding nodes. The RREQ message sent by the source node is denoted in the color green. The other RREQ messages are shown in cyan, yellow, black etc. The source node 1 is sending the RREQ message to its neighbour nodes 5, 6, 9, 11 and 13 and the links are formed shown by the green line. Every time node 5,6,9,11,13 is sending the RREQ message to its neighbour and the links are formed.
(c) Denial of Service with modified source routes: This attack is possible against DSR which uses source routes and works as follows - in figure 3.3, assume that a shortest path exists from S to X. Also assume that C and X cannot hear each other, that nodes B and C cannot hear each other, [17]and that M is a malicious node attempting a denial-of-service attack. Suppose S sends a data packet to X with the source route S-A-B-C-D-X. If M intercepts this packet, removes D from the list and forwards it to C, C will attempt to forward this packet to X which is not possible since C cannot hear X. Thus M has successfully launched a DoS attack on X.[17]
All vehicles transmit a 200-byte safety message at 10Hz with data rate of 6 Mbps. All vehicles attempt to continuously route 64-byte packets at an application rate of 2.048 Kbps to one of 10 other vehicles, selected as sink vehicles. The antenna height AHk of each vehicle is 1.5m. Transmit power is set to 10 dBm and the transmission range for safety message packet delivery is 145 m. For each experiment PCAP trace file per node is enabled. The routing statistics are gathered and compared for each experiment, i-e, with NS2 mobility trace file and with PySNS3. The simulation parameters for performance evaluation of PySNS3 are shown in Table III. In order to calculate packet delivery ratio (PDR), we must count; i) the packets that are actually received, and ii) the transmitted packets that are expected to be received. Both are relative to a specified (circular) coverage area shown in Fig. 6. Let's assume that the transmission range of vehicle A, is in meters, such that TRA > dAB. Where, dAB is distance between A and B, and dBC is the distance between B and
DSDV is a proactive, hop-by-hop distance vector routing protocol where the routing table is maintained by each and every network node. The routing table consists of all the nodes required to reach destination also including the nodes to which packets are not sent. The routing table is kept updated at every time after each entry. In order to avoid the routing loops, DSDV uses the concept of sequence numbers to maintain the originality of route at all times. For the network in figure. 1 below, the routing table for node A can be seen in table. 1 which contains information about all possible paths reachable by node A, along with the next hop, number of hops and sequence number.
This protocol use Dijkstra algorithm. It maintains a complex data base, also called as link state database, which contains full information about the remote routers and the exact network topology. The goal from this protocol is to provide similar information about network connection to each router, so each router can calculate the best route to each network this is happen when each router generates information about itself and pass these information to other routers in the network so each router make a copy of this information without changing it.
In order to evaluate the performance of the proposed DCHS algorithm, we compare MILP with the energy consumption and delay constrained routing protocol.
Unfortunately, it is a big overhead to maintain routing tables in the mobile ad hoc network
Justice Antonin Scalia practiced law at the law offices of Jones, Day, Cockley, and Reavis in Cleveland, Ohio for six years, but he later decided to teach law rather than practice it, and in 1967 he became a professor of Law at the University of Virginia. Scalia’s role in public service began in 1972 when President Nixon appointed him as general counsel for the Office of Telecommunications Policy where he helped formulate regulations for the cable television industry, and in 1974, after the Watergate scandal, he was appointed Assistant Attorney General for the Office of Legal Council in 1974. After his short career in public service, Nino took other positions in different conservative organizations and became professor of law at the University
Societies are built on a hierarchy. There is a leader, an upper class, a middle class, and a lower class. This representation of human society is built by our natural need for a leader no matter how tyrannical. George Orwell firmly exposes and attacks this flaw of human nature in his allegorical novel, Animal Farm. In Animal Farm Orwell displays situations mirroring that of the Russian Revolution, and how it failed to produce the utopia that was promised out of the revolution. George Orwell, before writing the novel, was disillusioned by the Communist revolution, a revolution that promised to provide all its people with a government that owned everything, but in turn was owned by the people. Orwell quickly concluded that all revolutions will fail, as the Russian Revolution did, because those who attain power are then corrupted by it. In this view of revolutionary efforts Orwell presents his views on human nature as a whole, that humans are unable to maintain an utopia, unable to abstain for consuming power, and that humans will subjugate and oppress one another if given the power to do so.
Suicide is the leading cause of deaths of adolescents in Australia. In 2005, it was estimated that deaths caused by suicide was accounted for one- fifth of deaths among teenagers (Life communications, 2012) in 2012 it was estimated that 1,901 (16.8 per 100,000) males and 634 females (5.6 per 100,000) lives were lost due to suicide, which roughly calculates to seven deaths a day that’s caused suicide (Lifeline, 2010) and those who committed suicide seventy five percent were males while the other twenty five percent were females. In Australia between 2009 and 2013 the highest suicide rates among the adolescent male and females were found in the Northern Territory (17.6 per 100,000) then Tasmania (14.0 per 100,000) followed by Western Australia (13.4 per 100,000, Queensland (13.3 per 100,000), South Australia (11.9 per 100,000), Victoria (9.4 per 100,000), Australian Capital Territory (9.1 per 100,000) lastly New South Wales with the lowest suicide rates in Australia (9.1 per 100,000) (Hunter Institute of Mental Health, nd). This essay will look at the common sense view, sociological imagination, social causes and factors that contribute to and eventually lead to youth suicide in Australia, and the functionalist theorist point of view.
The current solution as TCP/IP becomes inefficient and subjects to certain problems. An example of this, to search for content, the content must be mapped to a host, and then DNS translates the host name to the location i.e. IP address. The two-step mapping incurs access overhead. Security is an issue since the security coupled to the host. The host becomes a target for security attacks. Also IP is stateless so they cannot be caching capability; the same request would be made times, this lead to unnecessary bandwidth usage. This prompted the research into move the architecture from a host-centric to information-centric.
DMMEs are predicted to optimize routing paths for a majority of routed traffic [6]. This is because during any given time more than 60% of the users in the network are non-mobiles. DMMEs are also expected to reduce tunneling overhead and network signaling loads, Lastly, the single point of failure issue in is expected to be eradicated with DMMEs since the management is distributed at the ARs instead of being managed at the same entity [5]. I will discuss some in-depth approaches that help provide these functionalities and optimizations.
DSR is a reactive protocol and therefore doesn’t use periodic updates of routing information. It computes the routes whenever needed and then maintains them. The distinguishing feature of Dynamic Source Routing (DSR) is the use of source routing technique in which the sender of a packet determines the complete sequence of nodes through which the packet has to pass. The sender lists this route in the packet’s header, to identify each forwarding “hop” by the address of the next node to which to transmit the packet on its way to the destination node There are two basic steps of DSR protocol: (i) Route discovery and (ii) Route maintenance. Every node in the network maintains a cache to store latest discovered paths. Before a node sends a packet, it first checks the cache whether there is an entry for