{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/66421"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/66421","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Evaluating aggregation protocols for vehicular networks in simulation","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_html":"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_has_math":false,"creators":["Gollakota, Subha (Subha U.)"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Hari Balakrishnan and Calvin Newport."],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011","date_published":"2011","updated_at":"2026-07-22T22:21:03Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/66421","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Hari Balakrishnan and Calvin Newport."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Gollakota, Subha (Subha U.)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2011-10-17T21:24:08Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2011-10-17T21:24:08Z"]},{"key":"dc:date.issued","label":"Date","values":["2011"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/66421"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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)."]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Evaluating aggregation protocols for vehicular networks in simulation"]}]}],"canonical_facts":{"dc:contributor.advisor":["Hari Balakrishnan and Calvin Newport."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Gollakota, Subha (Subha U.)"],"dc:date.accessioned":["2011-10-17T21:24:08Z"],"dc:date.available":["2011-10-17T21:24:08Z"],"dc:date.issued":["2011"],"dc: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)."],"dc:description.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."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/66421"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Evaluating aggregation protocols for vehicular networks in simulation"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:03Z"}