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

Toh1997

Associativity-Based Routing For Ad-Hoc Mobile Networks

Chai-Keong Toh
University of Cambridge Computer Laboratory
New Museums Site
Cambridge CB2 3QG, United Kingdom

Wireless Personal Communications Journal
Special Issue on Mobile Networking and Computing Systems
Vol. 4, No. 2
pp. 103-139
Kluwer Academic Publishers, March 1997

Citeseer:


Paper:


see [Toh1996] for original paper
see [Toh1999] for internet draft

Abstract

This paper presents a new, simple and bandwidth-efficient distributed routing protocol for ad-hoc mobile networks. Unlike the conventional distributed routing algorithms, our protocol does not attempt to consistently maintain routing information in every nodes. In an ad-hoc mobile network where mobile hosts are acting as routers and where routes are made inconsistent by mobile hosts movement, we employ a new associativity-based routing scheme where routes a route is selected based on nodes having associativity states that imply periods of stability. In this manner, the routes selected are likely to be long-lived and hence there is no need to restart frequently, resulting in higher attainable throughput. The association property also allows the integration of ad-hoc routing into a BS-oriented Wireless LAN environment, providing the fault tolerance in times of base stations (BSs) failures. The protocol is free from loops, deadlock and packet duplicates and has scalable memory requirements. Simulation results obtained reveal that shorter and better routes can be discovered during route re-constractions.

Keywords

Ad-Hoc Mobile Networks, Associatitity-Based Routing, Neighbour-Aware Mobile Computing

Comment

Associativity-Based Routing (ABR)

BibTeX

@INCOLLECTION(Toh1997,
   TITLE = {Associativity-Based Routing For Ad-Hoc Mobile Networks},
   AUTHOR = {Chai-Keong Toh},
   BOOKTITLE = {Wireless Personal Communications Journal, Special Issue on Mobile Networking and Computing Systems},
   PUBLISHER = {Kluwer Academic Publishers},
   VOLUME = {4},
   NUMBER = {2},
   PAGES = {103-139},
   MONTH = {March},
   YEAR = {1997},
   URL = {http://citeseer.ist.psu.edu/cache/papers/cs/24964/http:zSzzSzusers.ece.gatech.eduzSz~cktohzSzso_new.pdf/associativity-based-routing-for.pdf},
   FILE = {Toh1997.pdf}
)


"Toh1997" is mentioned on: Ad-Hoc Protocols (Classification) | Ad-Hoc Protocols (History) | Ad-Hoc-Papers | Associativity-Based Routing | Toh1996 | Toh1999

(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: 2006-01-09 18:07:23
Exported: 2010-03-18 02:38:32