SECAN-Lab
   Home
   News

Projects
   SECAN-LAB
   Mesh Sequencer
   U-2010
   NARTUS
   EFIPSANS
   IRMA
   SECRICOM

The Group
   Members
   Publications
   Theses
   Teaching
   Presentations

Topics
   Mobile Computing
   Ad-Hoc Networks
   Ad-Hoc Protocols
   Mesh Computing
   Trust

Related Stuff
   L-101 Laboratory Systems
   AS28 Systems
   802.11 Network Simulator
   Internships
   Conferences
   Publications
   Standards
   Projects
   Links
   Partners
   OSTN

Miscellaneous
   Contact
   About
   Job Opportunities
   Search

Johnson1996

Dynamic Source Routing in Ad Hoc Wireless Networks

David B. Johnson, David A. Maltz
Computer Science Department
Carnegie Mellon University
5000 Forbes Avenue
Pittsburg, PA 15213-3891
dbj@cs.cmu.edu

Mobile Computing
Editors: Thomasz Imielinski, Hank Korth
Vol. 353
Chapter 5
pp. 153-181
Kluwer Academic Publishers, 1996

Paper:


see [Johnson2004] for latest internet draft
see [Johnson2001] for book article
see [Broch1998] for first internet draft

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.

Comments

Dynamic Source Routing (DSR)

BibTeX

@INCOLLECTION(Johnson1996,
   TITLE = {Dynamic Source Routing in Ad Hoc Wireless Networks},
   AUTHOR = {David B. Johnson and David A. Maltz},
   BOOKTITLE = {Mobile Computing},
   EDITOR = {Thomasz Imielinski and Hank Korth},
   PUBLISHER = {Kluwer Academic Publishers},
   VOLUME = {353},
   CHAPTER = {5},
   PAGES = {153-181},
   YEAR = {1996},
   URL = {http://www.ics.uci.edu/~atm/adhoc/paper-collection/johnson-dsr.pdf},
   FILE = {Johnson1996.pdf}
)


"Johnson1996" is mentioned on: Ad-Hoc Protocols (Classification) | Ad-Hoc Protocols (History) | Ad-Hoc-Papers | Broch1998 | Dynamic Source Routing | Johnson2001 | Johnson2004

(C) 2004-2006 University of Luxembourg, SECAN-Lab

Printable Version
VeryQuickWiki - HTML Export
Version: 2.7.1 (UniLux: 1.15.0 2006-01-19)
Modified: 2005-03-18 13:52:04
Exported: 2010-03-15 02:38:28