Dynamic SOURCE Routing (DSR) is a Routing minutes for Wireless mesh network. It is similar to the AODV minutes, since the routes are only then looked for if a computer has a concrete connecting desire (reactive routes).

A remarkable optimization from DSR is that the computers, which pass the utilizable data on must not have Routingtabellen. Instead a list of all destination addresses is packed into each package. This sounds pedantic in the first moment, however the necessity for the passing on computers reduces to have always current Routingtabellen. This reduces the transmission of Routingdaten substantially and the passing on computers can more simply developed to be (small hardware requirement) and have also no large memory for the Routingtabellen to possess.

Participant the belauschen local network network, in order to get to further routing information. This is possible, since in each transferred message a list with addresses of other knots is. Beyond that they recognize route inquiries, route errors and information of other computers, which they once can use later.

DSR has similar minutes for finding routes as AODV. In small, radio net works less charged to capacity two minutes have a similar performance behavior. If extent of utilization is higher against it, DSR causes only about 1/3 data arising. The DSR knots get a great many information by Belau network traffic and must so the net with less own route desires load.

On the other side that causes for the Belau problem that much information is collected and older - current no longer - information recognized and from the Routingtabellen to be removed to have.

The optimization of the internal Routingtabellen in the DSR minutes is momentarily (2005) an area of active research. The result could be an algorithm like the left State Routing minutes, only that the Routing data are determined by the Belau data traffic.

Much further information to similar ad-hoc minutes stands on the English Wikipedia side.

Left

• IETF Draft description of minutes to DSR
• Summary page of one of the DSR authors
• open piconet a SOURCE implementation
• ad-hoc minutes on en.wikipedia

References

For the first time DSR mentioned in:

David B. Johnson. Routing in Ad Hoc network OF mobile of host. Proceedings OF the Workshop on mobile Computing of system and Applications, pp. 158-163, IEEE computer Society, Santa Cruz, APPROX., December 1994.

Many improvements of DSR were already realized - e.g. DSRFLOW.

Articles in category "Dynamic SOURCE Routing"

We found here 18 articles.

Related Websites

We found here 6 related websites.

• DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad ...
  The Dynamic Source Routing protocol DSR is a simple and efficient routing protocol designed specifically for use in multi hop wireless ad hoc networks of ...


• DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad ...
  the possibility of a more dynamic source routing scheme [Garbee 1987]. ... Dynamic Source Routing protocol (DSR) is an important component of such a system. ...


• Dynamic Source Routing in Ad Hoc Wireless Networks
  Dynamic Source Routing in Ad Hoc Wireless Networks. Presenter: Ed Hua. ECE 794. Mar. 5, 2003. 2. DSR OVERVIEW. DSR is a reactive routing protocol for ad hoc ...


• Dynamic Source Routing in Ad Hoc Wireless Networks - Johnson ...
  An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized ...


• Dynamic Source Routing Protocol
  The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of ...


• IETF MANET Working Group David B. Johnson, Rice University ...
  Johnson, et al Expires 19 January 2005 [Page 3] INTERNET-DRAFT The Dynamic Source Routing Protocol 19 July 2004 2. Assumptions The DSR protocol as described ...