Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Load balancing the GRID ad-hoc routing protocol

Load balancing the GRID ad-hoc routing protocol

Thumbnail Image
Download
Name

56820547-MIT.pdf

Description
Full printable version
Size

2.67 MB

Format

Adobe PDF

Checksum (MD5)

45050f26ed3fdf56bdffb3ec4dc4dacb

Author(s)
Bloom, Rebecca S. (Rebecca Spangenthal), 1981-
Advisor(s)
Dina Katabi and David Karger.
Date Issued
2003
Publisher
Massachusetts Institute of Technology
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.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.
Includes bibliographical references (leaves 47-48).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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
Persistent DSpace Link
http://hdl.handle.net/1721.1/27082
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.