A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
An adaptive generalized transmission protocol for ad hoc networks
Mobile Networks and Applications
Asynchronous Multimedia Multihop Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Abbreviated Dynamic Source Routing: Source Routing with Non-Unique Network Identifiers
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
Wireless mesh networks: a survey
Computer Networks and ISDN Systems
Impact of libre software tools and methods in the robotics field
5-WOSSE Proceedings of the fifth workshop on Open source software engineering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Everyware: The Dawning Age of Ubiquitous Computing
Everyware: The Dawning Age of Ubiquitous Computing
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Ad Hoc Networking
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
A cautionary perspective on cross-layer design
IEEE Wireless Communications
| Hi-index | 0.00 |
Any device we want to connect to a global network, e.g. Internet, should have a unique global identifier. However, the size of this identifier can be an unacceptable overhead for devices with limited resources (sensors, toys, disposable devices, micro-robots, etc.), because conventional protocols use full addresses to transmit, process, and store the data required for routing. The usual solution for such devices is to limit the address space to 1 or 2 bytes, but this sacrifices the global unicity of the identifiers. The proposal presented in this article enables devices with limited resources to use reduced addresses that globally identify hosts. We propose the use of abbreviated addresses for routing. We have developed a new protocol named ADSR that takes advantage of these new addresses. This protocol is a modified version of DSR based on the use of abbreviated addresses. The abbreviation procedure can lead to two different nodes having the same address, which we will term collision. ADSR allows rather than avoids collisions. The foundations of this protocol, and some results of an implementation are also presented in this article.