Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp013f462788v
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorJamieson, Kyle-
dc.contributor.authorQian, Hansen-
dc.date.accessioned2016-06-30T16:07:39Z-
dc.date.available2016-06-30T16:07:39Z-
dc.date.created2016-04-29-
dc.date.issued2016-06-30-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp013f462788v-
dc.description.abstractUse of wireless communication is steadily rising, forcing users to balance both cellular and Wi-Fi options. The latter option o ers higher bandwidth and faster speeds, but su ers from poor roaming: moving between Wi-Fi networks still leads to dropped connections and a poor experience. Existing research has proposed solutions from updating the 802.11 spec- i cation to using MultipathTCP; however, these all require that client devices have updated software supporting the solution. We believe there is room for a wireless system that automat- ically transitions clients between access points with no reconnection and no delay, allowing clients to always connect with the closest. Initial tests show that this system does allow for 4x higher TCP throughput especially as a client devices moves from one access point to an- other, compared to a control test that tried to maintain a connection to the original AP. With further development, this solution can eventually help improve Wi-Fi roaming performance, allowing for applications in high-speed scenarios, such as metropolitan subway tunnels.en_US
dc.format.extent47 pages*
dc.language.isoen_USen_US
dc.titleWi-Fi Goes to Town: A Predictive, Re-association Free System for Wi-Fi Roaming across Access Pointsen_US
dc.typePrinceton University Senior Theses-
pu.date.classyear2016en_US
pu.departmentComputer Scienceen_US
pu.pdf.coverpageSeniorThesisCoverPage-
Appears in Collections:Computer Science, 1988-2020

Files in This Item:
File SizeFormat 
Qian_Hansen_2016_Thesis.pdf1 MBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.