{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:41:01Z","timestamp":1762004461761,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-0905037","CNS-1017647"],"award-info":[{"award-number":["CNS-0905037","CNS-1017647"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"abstract":"<jats:p>Opportunistic routing utilizes the broadcast nature of wireless networks, significantly promoting the unicast throughput. Many variations of opportunistic routing designs have been proposed, although all of the current designs consistently rely on all of the topology information to construct forwarder lists and process data forwarding, which indeed restricts the application in large-scale wireless networks, where collecting global optimal information is very costly. In this paper, we propose the localized opportunistic routing (LOR) protocol, which utilizes the distributed minimum transmission selection (MTS-B) algorithm to partition the topology into several nested close-node-sets (CNSs) using local information. LOR can locally realize the optimal opportunistic routing for a large-scale wireless network with low control overhead cost. Since it does not use global topology information, LOR highlights an interesting tradeoff between the global optimality of the used forwarder lists and scalability inferred from the incurred overhead. Extensive simulation results show that LOR dramatically improves performances over extremely opportunistic routing (ExOR) and MAC-independent opportunistic routing protocol (MORE), which are two well-known designs from the literature, in terms of control overhead, end-to-end delay, and throughputs. It also exhibits promising performance in vehicular ad hoc networks (VANETs).<\/jats:p>","DOI":"10.1109\/tvt.2012.2237045","type":"journal-article","created":{"date-parts":[[2012,12,31]],"date-time":"2012-12-31T19:10:09Z","timestamp":1356981009000},"page":"2253-2263","source":"Crossref","is-referenced-by-count":25,"title":["Trading Optimality for Scalability in Large-Scale Opportunistic Routing"],"prefix":"10.1109","volume":"62","author":[{"given":"Yanhua","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abedelaziz","family":"Mohaisen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Li","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2007.4292856"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195515"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916634"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.897962"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/MCSA.1999.749281"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2007.901869"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/T-WC.2008.071239"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2005.1423333"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935200"},{"journal-title":"The NS-2 Manual The VINT Project","year":"2003","author":"fall","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.876204"},{"journal-title":"RFC 1058 Routing information protocol","year":"1988","author":"hedrick","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2009.11"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.24"},{"journal-title":"Mobile Computing","year":"1996","author":"johnson","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1080139.1080141"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/345910.345953"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MVT.2007.912927"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MOBHOC.2009.5336939"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72606-7_16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1282380.1282400"},{"key":"ref27","first-page":"13","article-title":"CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding","author":"lin","year":"2008","journal-title":"Proc ICNP"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/1090191.1080108","article-title":"ExOR: Opportunistic routing in multi-hop wireless networks","author":"biswas","year":"2005","journal-title":"Proc ACM Sigcomm"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288113"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.248176"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/938998.939000"},{"key":"ref8","article-title":"Least-cost opportunistic routing","author":"dubois-ferriere","year":"2007","journal-title":"Allerton Conf Commun Control Comput"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/778445.778446"},{"key":"ref2","first-page":"290","article-title":"Weak state routing for large scale dynamic networks","author":"acer","year":"2007","journal-title":"Proc ACM MobiCom"},{"journal-title":"Simulation of Urban Mobility (SUMO)","year":"0","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298330"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2009.4917786"},{"key":"ref22","first-page":"74","article-title":"Random walks on digraphs, the generalized digraph Laplacian and the degree of asymmetry","author":"li","year":"2010","journal-title":"Proc WAW"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462109"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2191158"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.708890"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5683488"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.57"}],"container-title":["Vehicular Technology, IEEE Transactions on"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/iel5\/25\/6530672\/06399622.pdf?arnumber=6399622","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/25\/6530672\/06399622.pdf?arnumber=6399622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T13:40:40Z","timestamp":1640266840000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6399622\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,6]]}},"URL":"https:\/\/doi.org\/10.1109\/tvt.2012.2237045","relation":{},"ISSN":["0018-9545"],"issn-type":[{"type":"print","value":"0018-9545"}],"subject":[],"published":{"date-parts":[[2013,6]]}}}