Abbreviated dynamic source routing; protocolo DSR abreviado para máquinas con pocos recursos

Abstract

DSR in one of the best known protocols for datagram routing in ad-hoc networks. It uses source routing, soeach datagram must carry the addresses of all the machines in its path. Under some circunstances, specially with the use of IPv6, headers size can become very big. In this paper we propose ADSR protocol, a modification of DSR that drastically reduces its headers size by using abbreviated addresses for the routing. This mechanism can lead to two different nodes having the same address, fact that we coll a collision and analyce in this work. We will also show some results about this protocol performance obtained by simulations implemented using the ns-2 network simulator