Show simple item record

dc.contributor.authorLee, Jung Woo
dc.contributor.authorKusy, Branislav
dc.contributor.authorAzim, Tahir
dc.contributor.authorShihada, Basem
dc.contributor.authorLevis, Philip
dc.date.accessioned2015-04-08T13:09:46Z
dc.date.available2015-04-08T13:09:46Z
dc.date.issued2010
dc.identifier.citationLee, J. W., Kusy, B., Azim, T., Shihada, B., & Levis, P. (2010). Whirlpool routing for mobility. Proceedings of the Eleventh ACM International Symposium on Mobile Ad Hoc Networking and Computing - MobiHoc ’10. doi:10.1145/1860093.1860112
dc.identifier.doi10.1145/1860093.1860112
dc.identifier.urihttp://hdl.handle.net/10754/350282
dc.description.abstractWe present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP's design is that data traffic can use an existing routing gradient to efficiently probe the topology, repair the routing gradient, and communicate these repairs to nearby nodes. Using simulation, controlled testbeds, and real mobility experiments, we find that using the data plane for topology maintenance is highly effective due to the incremental nature of mobility updates. WARP leverages the fact that converging flows at a destination make the destination have the region of highest traffic. We provide a theoretical basis for WARP's behavior, defining an "update area" in which the topology must adjust when a destination moves. As long as packets arrive at a destination before it moves outside of the update area, WARP can repair the topology using the data plane. Compared to existing protocols, such as DYMO and HYPER, WARP's packet drop rate is up to 90% lower while sending up to 90% fewer packets.
dc.publisherAssociation for Computing Machinery (ACM)
dc.relation.urlhttp://portal.acm.org/citation.cfm?doid=1860093.1860112
dc.rights© ACM, 2010. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing at http://doi.acm.org/10.1145/1860093.1860112
dc.titleWhirlpool routing for mobility
dc.typeConference Paper
dc.contributor.departmentComputer Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentNetworks Laboratory (NetLab)
dc.identifier.journalProceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '10
dc.conference.date20 September 2010 through 24 September 2010
dc.conference.name11th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2010
dc.conference.locationChicago, IL
dc.eprint.versionPost-print
dc.contributor.institutionStanford University, Stanford, CA, USA
dc.contributor.institutionCSIRO ICT Centre, Brisbane, Australia
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)
kaust.personShihada, Basem
refterms.dateFOA2018-06-13T16:50:09Z


Files in this item

Thumbnail
Name:
hoc25m-lee.pdf
Size:
2.721Mb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record