2026-09-18T21:09:51Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/270822022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Dina Katabi and David Karger.
Bloom, Rebecca S. (Rebecca Spangenthal), 1981-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-09-06T21:39:06Z
2005-09-06T21:39:06Z
2003
2003
http://hdl.handle.net/1721.1/27082
56820547
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.
Includes bibliographical references (leaves 47-48).
Grid is a mobile ad hoc routing system with significantly better scaling properties than previously designed protocols in networks with a uniform distribution of nodes. It achieves scalability by building a distributed location database in which memory requirements are apportioned fairly to all nodes in the network. In networks of spatially non-uniform node distribution, however, a small fraction of the nodes need to store a disproportionate amount of location information, posing a significant problem for nodes with limited memory such as small handheld devices. We propose a new location service to improve the scalability of Grid while preserving its fundamental design. Our new service, GLS2, ensures protocol correctness despite limited memory constraints. To preserve high success rate and improve query path efficiency, GLS2 applies a new location query algorithm which allows nodes to drop location information if necessary. Simulated tests demonstrate that GLS2's efficiency and correctness are preserved in situations of limited memory as well as those of extremely uneven node distributions while still achieving proper load-balancing.
by Rebecca S. Bloom.
M.Eng.
47 leaves
1999448 bytes
2002995 bytes
application/pdf
application/pdf
en_US
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Load balancing the GRID ad-hoc routing protocol
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="6cbaddb3-901b-429a-8a70-b05444ac4b1b">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>en_US</Language>
<Title>Load balancing the GRID ad-hoc routing protocol</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2003</PublicationDate>
<Authors>
<Author>
<DisplayName>Bloom, Rebecca S. (Rebecca Spangenthal), 1981-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Grid is a mobile ad hoc routing system with significantly better scaling properties than previously designed protocols in networks with a uniform distribution of nodes. It achieves scalability by building a distributed location database in which memory requirements are apportioned fairly to all nodes in the network. In networks of spatially non-uniform node distribution, however, a small fraction of the nodes need to store a disproportionate amount of location information, posing a significant problem for nodes with limited memory such as small handheld devices. We propose a new location service to improve the scalability of Grid while preserving its fundamental design. Our new service, GLS2, ensures protocol correctness despite limited memory constraints. To preserve high success rate and improve query path efficiency, GLS2 applies a new location query algorithm which allows nodes to drop location information if necessary. Simulated tests demonstrate that GLS2's efficiency and correctness are preserved in situations of limited memory as well as those of extremely uneven node distributions while still achieving proper load-balancing.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>