You are here

reduced overhead routing protocol for ad hoc wireless networks

Download pdf | Full Screen View

Date Issued:
2000
Summary:
This document describes the Reduced Overhead Routing (ROR) protocol for use in mobile wireless ad hoc networks. The protocol is highly bandwidth-efficient. The protocol has three distinguishing features: First, it maintains, for each destination, multiple paths. Second, routing table updates are localized. Updates are initiated only when the update table is not empty and the update frequency has not exceeded a specified rate. Third, ROR uses threshold routing technique; it allows an intermediate node to deliver data packet via a longer sub-optimal route that is within the distance. To prevent frequent updates, at most one update is initiated every predefined period of time. A node transmits each update with propagation radius that is determined on the basis of node's network region using a novel probabilistic technique. Threshold routing and localized probabilistic updates greatly reduce routing overhead and network congestion and improve bandwidth efficiency.
Title: A reduced overhead routing protocol for ad hoc wireless networks.
0 views
0 downloads
Name(s): Ibriq, Jamil
Florida Atlantic University, Degree grantor
Wu, Jie, Thesis advisor
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Issuance: monographic
Date Issued: 2000
Publisher: Florida Atlantic University
Place of Publication: Boca Raton, Fla.
Physical Form: application/pdf
Extent: 101 p.
Language(s): English
Summary: This document describes the Reduced Overhead Routing (ROR) protocol for use in mobile wireless ad hoc networks. The protocol is highly bandwidth-efficient. The protocol has three distinguishing features: First, it maintains, for each destination, multiple paths. Second, routing table updates are localized. Updates are initiated only when the update table is not empty and the update frequency has not exceeded a specified rate. Third, ROR uses threshold routing technique; it allows an intermediate node to deliver data packet via a longer sub-optimal route that is within the distance. To prevent frequent updates, at most one update is initiated every predefined period of time. A node transmits each update with propagation radius that is determined on the basis of node's network region using a novel probabilistic technique. Threshold routing and localized probabilistic updates greatly reduce routing overhead and network congestion and improve bandwidth efficiency.
Identifier: 9780599873391 (isbn), 12703 (digitool), FADT12703 (IID), fau:9585 (fedora)
Collection: FAU Electronic Theses and Dissertations Collection
Note(s): College of Engineering and Computer Science
Thesis (M.S.)--Florida Atlantic University, 2000.
Subject(s): Mobile computing
Computer networks
Wireless communication systems
Held by: Florida Atlantic University Libraries
Persistent Link to This Record: http://purl.flvc.org/fcla/dt/12703
Sublocation: Digital Library
Use and Reproduction: Copyright © is held by the author, with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder.
Use and Reproduction: http://rightsstatements.org/vocab/InC/1.0/
Host Institution: FAU
Is Part of Series: Florida Atlantic University Digital Library Collections.