Evaluating aggregation protocols for vehicular networks in simulation

Routing for vehicular networks has so far presented special challenges such as high node mobility and velocity, and until now there have been few experiments performed using real data. This thesis uses a dataset of 538 taxicabs driving around the San Francisco Bay Area to gather measurements about connectivity to lay down a framework with which to reason about these networks. Additionally. this thesis describes a simulation framework written in Python to perform rapid evaluation of aggregation protocols as well as simulations where a fraction of the cars are assumed to be internet access points.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2011

Author dc:creator

• Gollakota, Subha (Subha U.)

Advisor dc:contributor.advisor

• Hari Balakrishnan and Calvin Newport.

• Electrical Engineering and Computer Science.

Statement dc:rights

• 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/66421

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/66421