Spanning Tree Algorithms for Connectivity and Routing in Communication Networks
Das, Bevan Narayan
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/81204
Description
Title
Spanning Tree Algorithms for Connectivity and Routing in Communication Networks
Author(s)
Das, Bevan Narayan
Issue Date
1997
Doctoral Committee Chair(s)
Loui, Michael C.
Department of Study
Electrical Engineering
Discipline
Electrical Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
Abstract
Finally, we present a family of routing algorithms for ad hoc networks that use a spine infrastructure to coordinate routing and topology updates. The spine is an approximate minimum connected dominating set. The family of routing algorithms includes a basic algorithm, in which each spine node has a local copy of G; a hierarchical algorithm, which scales well with network size; and a partial-information algorithm, which explores the tradeoff of route optimality versus the amount of overhead. We present worst-case analyses and simulation results that show how well the spine routing algorithms maintain shortest-path or near-shortest-path routes with reasonable overhead, even when nodes move frequently.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
