Dynamic Source Routing
Dynamic Source Routing (DSR) is a routing protocol for wireless mesh networks . It is similar to the AODV protocol, as the routes are only searched for when a computer has a specific connection request (reactive routing).
A notable optimization of DSR is that the computers that forward the payload do not need to have routing tables. Instead, a list of all destination addresses is packed into each packet. At first, this sounds cumbersome, but it reduces the need for the forwarding computers to always have up-to-date routing tables. This significantly reduces the transmission of routing data and the forwarding computers can be of a simpler structure (lower hardware requirements) and do not have to have a large memory for the routing tables.
Participants eavesdrop on the local network traffic in order to obtain further routing information. This is possible because there is a list of addresses of other nodes in every transmitted message. In addition, they recognize route requests, route errors and information from other computers. You can use these yourself later.
DSR has a similar protocol for finding routes as AODV . In small, less busy radio networks , the two protocols have a similar performance behavior. On the other hand, if the load is higher, DSR only causes about 1/3 of the data volume. The DSR nodes receive a lot of information by eavesdropping on the network traffic and therefore have to burden the network with fewer route requests of their own.
On the other hand, eavesdropping causes the problem that a lot of information is collected and older - outdated - information must be recognized and removed from the routing tables.
Individual evidence
DSR was first mentioned in:
- David B. Johnson. Routing in Ad Hoc Networks of Mobile Hosts. Proceedings of the Workshop on Mobile Computing Systems and Applications, pp. 158-163, IEEE Computer Society, Santa Cruz, CA, December 1994.
Many improvements to DSR have already been implemented - e.g. B. DSRFLOW .