2026-09-18T22:58:36Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/664212022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Hari Balakrishnan and Calvin Newport.
Gollakota, Subha (Subha U.)
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2011-10-17T21:24:08Z
2011-10-17T21:24:08Z
2011
2011
http://hdl.handle.net/1721.1/66421
755241685
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).
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.
by Subha Gollakota.
M.Eng.
85 p.
eng
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.
Evaluating aggregation protocols for vehicular networks in simulation
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="2bdac358-a73e-4225-976e-e2316a5f34c1">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Evaluating aggregation protocols for vehicular networks in simulation</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2011</PublicationDate>
<Authors>
<Author>
<DisplayName>Gollakota, Subha (Subha U.)</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>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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>