{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T15:31:22Z","timestamp":1762875082458,"version":"3.41.0"},"reference-count":3,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2006,10,1]],"date-time":"2006-10-01T00:00:00Z","timestamp":1159660800000},"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":[[2006,10]]},"abstract":"<jats:p>\n            Opportunistic routing schemes that exploit the broadcast nature of wireless transmissions for selecting the best next-hop at that instant among a set of candidates are being actively explored [1-3]. These schemes which we refer to as opportunistic\n            <jats:italic>any-path<\/jats:italic>\n            forwarding (OAPF), reduce the number of transmissions needed for reliable packet delivery.\n          <\/jats:p>","DOI":"10.1145\/1215976.1215978","type":"journal-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:52:18Z","timestamp":1175802738000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":82,"title":["On selection of candidates for opportunistic anypath forwarding"],"prefix":"10.1145","volume":"10","author":[{"given":"Zifei","family":"Zhong","sequence":"first","affiliation":[{"name":"Univ. of South Carolina, Columbia, SC"}]},{"given":"Junling","family":"Wang","sequence":"additional","affiliation":[{"name":"Univ. of South Carolina, Columbia, SC"}]},{"given":"Srihari","family":"Nelakuditi","sequence":"additional","affiliation":[{"name":"Univ. of South Carolina, Columbia, SC"}]},{"given":"Guor-Huar","family":"Lu","sequence":"additional","affiliation":[{"name":"Univ. of Minnesota, Minneapolis, MN"}]}],"member":"320","published-online":{"date-parts":[[2006,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/972374.972387"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"S. Biswas \"Opportunistic Routing in Multi-hop Wireless Networks \" MS Thesis MIT 2005.  S. Biswas \"Opportunistic Routing in Multi-hop Wireless Networks \" MS Thesis MIT 2005.","DOI":"10.1145\/972374.972387"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/972374.972388"}],"container-title":["ACM SIGMOBILE Mobile Computing and Communications Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1215976.1215978","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1215976.1215978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:16Z","timestamp":1750278136000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1215976.1215978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":3,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["10.1145\/1215976.1215978"],"URL":"https:\/\/doi.org\/10.1145\/1215976.1215978","relation":{},"ISSN":["1559-1662","1931-1222"],"issn-type":[{"type":"print","value":"1559-1662"},{"type":"electronic","value":"1931-1222"}],"subject":[],"published":{"date-parts":[[2006,10]]},"assertion":[{"value":"2006-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}