{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:05Z","timestamp":1750307525386,"version":"3.41.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2010,1,21]],"date-time":"2010-01-21T00:00:00Z","timestamp":1264032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOBILE Mob. Comput. Commun. Rev."],"published-print":{"date-parts":[[2010,1,21]]},"abstract":"<jats:p>Whirlpool Ad-hoc Routing Protocol (WARP) is a dynamic data collection protocol for wireless sensor networks. Compared to existing protocols, WARP offers order of magnitude improvements in reliability, efficiency, and routing stretch for a moving data sink. When the sink moves, nearby WARP nodes stop forwarding data directly towards the sink. Instead, they speculatively disseminate data packets along loops centered at the last location of the sink. The loop radius progressively increases searching more widely until the sink is found. Finally, WARP embeds a few bits of control information in data packets and aggressively suppresses control packets to further improve its efficiency.<\/jats:p>\n          <jats:p>We have implementedWARP in TinyOS and evaluated it against the Collection Tree Protocol (CTP) [2], the state-of-art collection protocol for WSNs. For a mobile sink, WARP had significantly better reliability and efficiency, achieving over 90% reliability for a wide range of speeds and data rates, compared to below 10% reliability of CTP.<\/jats:p>","DOI":"10.1145\/1710130.1710141","type":"journal-article","created":{"date-parts":[[2010,1,26]],"date-time":"2010-01-26T14:01:38Z","timestamp":1264514498000},"page":"50-53","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Poster abstract"],"prefix":"10.1145","volume":"13","author":[{"given":"Jung Woo","family":"Lee","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Branislav","family":"Kusy","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip","family":"Levis","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,1,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251990.1253396"},{"key":"e_1_2_1_2_1","unstructured":"TEP 123: Collection Tree Protocol. http:\/\/www.tinyos.net\/tinyos-2.x\/doc\/.  TEP 123: Collection Tree Protocol. http:\/\/www.tinyos.net\/tinyos-2.x\/doc\/."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1769087.1769105"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2002.1020231"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11669463_12"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of IEEE Workshop on Modeling and Optimization in Mobile Ad hoc and Wireless Networks (WiOpt)","author":"Jain S.","year":"2004","unstructured":"S. Jain , R. Shah , W. Brunette , G. Borriello , and S. Roy . Exploiting mobility for energy efficient data collection in sensor networks . In Proceedings of IEEE Workshop on Modeling and Optimization in Mobile Ad hoc and Wireless Networks (WiOpt) , 2004 . S. Jain, R. Shah,W. Brunette, G. Borriello, and S. Roy. Exploiting mobility for energy efficient data collection in sensor networks. In Proceedings of IEEE Workshop on Modeling and Optimization in Mobile Ad hoc and Wireless Networks (WiOpt), 2004."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11502593_20"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080829.1080858"}],"container-title":["ACM SIGMOBILE Mobile Computing and Communications Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1710130.1710141","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1710130.1710141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:02Z","timestamp":1750249382000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1710130.1710141"}},"subtitle":["whirlpool ad-hoc routing protocol"],"short-title":[],"issued":{"date-parts":[[2010,1,21]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,1,21]]}},"alternative-id":["10.1145\/1710130.1710141"],"URL":"https:\/\/doi.org\/10.1145\/1710130.1710141","relation":{},"ISSN":["1559-1662","1931-1222"],"issn-type":[{"type":"print","value":"1559-1662"},{"type":"electronic","value":"1931-1222"}],"subject":[],"published":{"date-parts":[[2010,1,21]]},"assertion":[{"value":"2010-01-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}