2026-09-21T10:43:18Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/81204 2023-07-11 col_2142_5131 col_2142_8888 com_2142_5130 com_2142_8887 com_2142_234

U of I Only Loui, Michael C. Das, Bevan Narayan 2015-09-25T20:10:03Z 2015-09-25T20:10:03Z 10000-01-01 1997 1997 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. Made available in DSpace on 2015-09-25T20:10:03Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9812572.pdf: 8585772 bytes, checksum: 174721b589bde11402a726d21ed64598 (MD5) Previous issue date: 1997 Embargo set by: Seth Robbins for item 82485 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs 173 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997. http://hdl.handle.net/2142/81204 (MiAaPQ)AAI9812572 eng Computer Science Spanning Tree Algorithms for Connectivity and Routing in Communication Networks text Electrical Engineering Electrical Engineering University of Illinois at Urbana-Champaign Dissertation Ph.D.