Evaluating aggregation protocols for vehicular networks in simulation
Name
755241685-MIT.pdf
Description
Full printable version
Size
4.18 MB
Format
Adobe PDF
Checksum (MD5)
abee7cbb0575b3eeaefc824a2733fb2f
Author(s)
Gollakota, Subha (Subha U.)
Advisor(s)
Hari Balakrishnan and Calvin Newport.
Date Issued
2011
Publisher
Massachusetts Institute of Technology
Abstract
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.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 83-85).
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.
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.
Persistent DSpace Link
