Dynamic Source Routing in Ad Hoc Wireless Networks

Abstract

An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host's wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.

A spatiotemporal communication protocol for wireless sensor networks

“…Reactive routing algorithms such as AODV [17] and DSR [10] maintain routing information for a small subset of possible destinations, namely, those currently in use. If no route is available for a new destination, a route discovery process is invoked.…”

“…Such protocols work well when traffic patterns do not fluctuate during a session. However, these protocols (e.g., [10]) are less successful when congestion patterns change rapidly compared to the session lifetime. When a route becomes congested, such protocols either suffer a delay or initiate another round of route discovery.…”

“…In our evaluation, we compare the performance of seven different routing algorithms: AODV [17], DSR [10], GF [20], GPSR [12], SPEED, SPEED-S, SPEED-T. We adopt both ad hoc routing protocols (AODV and DSR) and sensor network protocols (GF, GPSR).…”

“…We have implemented the SPEED protocol on the Berkeley motes platform with a code size of 6036 bytes (code is available at [10]). Three applications including data placement, target tracking, and CBR are built on top of SPEED.…”

A Novel Routing Algorithm in Wireless Ad Hoc Network

“…But the authentication anti-ruin ability, communication loads, speed etc. problem aren't yet solved effectively [1][2][3][4][5][6].…”