Load balancing the GRID ad-hoc routing protocol
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 n...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
Massachusetts Institute of Technology
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/27082 |
id |
ndltd-MIT-oai-dspace.mit.edu-1721.1-27082 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-MIT-oai-dspace.mit.edu-1721.1-270822019-05-02T16:00:59Z Load balancing the GRID ad-hoc routing protocol Bloom, Rebecca S. (Rebecca Spangenthal), 1981- Dina Katabi and David Karger. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. 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. 2005-09-06T21:39:06Z 2005-09-06T21:39:06Z 2003 2003 Thesis http://hdl.handle.net/1721.1/27082 56820547 en_US 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 47 leaves 1999448 bytes 2002995 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
topic |
Electrical Engineering and Computer Science. |
spellingShingle |
Electrical Engineering and Computer Science. Bloom, Rebecca S. (Rebecca Spangenthal), 1981- Load balancing the GRID ad-hoc routing protocol |
description |
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. |
author2 |
Dina Katabi and David Karger. |
author_facet |
Dina Katabi and David Karger. Bloom, Rebecca S. (Rebecca Spangenthal), 1981- |
author |
Bloom, Rebecca S. (Rebecca Spangenthal), 1981- |
author_sort |
Bloom, Rebecca S. (Rebecca Spangenthal), 1981- |
title |
Load balancing the GRID ad-hoc routing protocol |
title_short |
Load balancing the GRID ad-hoc routing protocol |
title_full |
Load balancing the GRID ad-hoc routing protocol |
title_fullStr |
Load balancing the GRID ad-hoc routing protocol |
title_full_unstemmed |
Load balancing the GRID ad-hoc routing protocol |
title_sort |
load balancing the grid ad-hoc routing protocol |
publisher |
Massachusetts Institute of Technology |
publishDate |
2005 |
url |
http://hdl.handle.net/1721.1/27082 |
work_keys_str_mv |
AT bloomrebeccasrebeccaspangenthal1981 loadbalancingthegridadhocroutingprotocol |
_version_ |
1719032797319921664 |