{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T02:35:34Z","timestamp":1777775734569,"version":"3.51.4"},"reference-count":56,"publisher":"Emerald","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,11,23]]},"abstract":"<jats:p>Wireless multi-hop networks have become an important part of many modern communication systems. Opportunistic routing aims to overcome the deficiencies of conventional routing on wireless multi-hop networks, by specifically utilizing wireless broadcast opportunities and receiver diversity. Opportunistic routing algorithms, which are specifically optimized to incorporate into the routing decisions a model of wireless transmission, take advantage of scheduling, multi-user, and receiver diversity gains and result in significant reduction in the expected cost of routing per packet. The ability of the algorithm to take advantage of the aspects of wireless transmission, however, depends on the scalability and the additional overhead associated with the opportunistic routing as well as the availability of side information regarding wireless channel statistics, topology, etc. This manuscript sheds light on the performance gains associated with incorporating into the routing strategy the nature of wireless transmission and devises algorithms and solutions to realize these gains in a scalable, practical, and low cost manner. This manuscript first provides an overview of various opportunistic distance-vector algorithms that have been developed to incorporate wireless transmission and routing opportunities. Furthermore, an optimal opportunistic distance metric is proposed whose construction follows from a dynamic programming characterization of the problem. The performance of the optimal routing is then examined against the performance of several other known routing algorithms. To allow for a scalable and distributed solution, the distributed computation of this optimal distance-metric is provided. The performance of a distributed implementation of the optimal opportunistic routing algorithm is also examined via simulation. In addition to the construction of the opportunistic schemes in centralized and distributed fashions, this manuscript also addresses how learning the wireless medium can be efficiently incorporated in the structure of routing algorithm. Finally, this manuscript examines the dynamic congestion-based distance metric and its performance against other congestion aware solutions in the literature.<\/jats:p>","DOI":"10.1561\/1300000021","type":"journal-article","created":{"date-parts":[[2016,11,23]],"date-time":"2016-11-23T09:29:59Z","timestamp":1479893399000},"page":"1-137","source":"Crossref","is-referenced-by-count":2,"title":["Opportunistic Routing in Wireless Networks"],"prefix":"10.1108","volume":"11","author":[{"given":"Tara","family":"Javidi","sequence":"first","affiliation":[{"name":"University of California , San Diego"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Van Buhler","sequence":"additional","affiliation":[{"name":"University of California , San Diego"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2016,11,23]]},"reference":[{"key":"2026032901021598400_ref001","unstructured":"Qualnet\n          . http:\/\/web.scalable-networks.com\/, 2015. [Online; accessed 3-March-2015]."},{"key":"2026032901021598400_ref002","unstructured":"Omnet++\n          . http:\/\/omnetpp.org\/, 2016. [Online; accessed 7-May-2016]."},{"key":"2026032901021598400_ref003","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/347057.347426","article-title":"Routing stability in congested networks: Experimentation and analysis","volume":"30","author":"Kalampoukas","year":"2000","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"2026032901021598400_ref004","volume-title":"WiOpt03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Net- works, Sophia-Antipolis, France","author":"Baras","year":"2003"},{"key":"2026032901021598400_ref005","author":"John","year":"1995"},{"issue":"3","key":"2026032901021598400_ref006","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TAC.1982.1102980","article-title":"Distributed dynamic programming","volume":"AC-27","author":"Bertsekas","year":"1982","journal-title":"IEEE Trans. Autom. Control"},{"key":"2026032901021598400_ref007","volume-title":"Data Networks","author":"Bertsekas","year":"1992"},{"key":"2026032901021598400_ref008","volume-title":"Dynamic Programming and Optimal Control, Vol. II","author":"Dimitri","year":"2007"},{"key":"2026032901021598400_ref009","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"Dimitri","year":"1997"},{"key":"2026032901021598400_ref010","volume-title":"Asilomar","author":"Bhorkar","year":"2010"},{"key":"2026032901021598400_ref011","first-page":"4834","article-title":"Exploring and exploiting routing opportunities in wireless ad-hoc networks","volume":"pages","author":"Bhorkar","year":"2009","journal-title":"Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC\/CCC 2009. Proceedings of the 48th IEEE Conference on"},{"key":"2026032901021598400_ref012","doi-asserted-by":"crossref","first-page":"3344","DOI":"10.1145\/1090191.1080108","article-title":"Opportunistic multi-hop routing for wireless networks","volume":"35","author":"Biswas","year":"2005","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"2026032901021598400_ref013","volume-title":"IP routing protocols: RIP, OSPF, BGP, PNNI and Cisco routing protocols","author":"Black","year":"2000"},{"key":"2026032901021598400_ref014","first-page":"671","article-title":"Packet routing in dynamically changing networks: A reinforcement learning approach.","volume":"page","author":"Boyan","year":"1994","journal-title":"NIPS"},{"key":"2026032901021598400_ref015","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971286","volume-title":"Probability","author":"Breiman","year":"1992"},{"key":"2026032901021598400_ref016","volume-title":"In Advances in Neural Information Processing Systems","author":"P.M.","year":"1996"},{"key":"2026032901021598400_ref017","volume-title":"ACM Mobicom","author":"De Couto","year":"2003"},{"key":"2026032901021598400_ref018","volume-title":"Proc. Asimolar Conf.","author":"Cui","year":"2013"},{"key":"2026032901021598400_ref019","author":"Dhillon","year":"2007"},{"key":"2026032901021598400_ref020","volume-title":"Introduction to Radio Propagation for Fixed and Mobile Communications","author":"Doble","year":"1996"},{"key":"2026032901021598400_ref021","volume-title":"ACM SIGCOMM","author":"Gollakota","year":"2008"},{"key":"2026032901021598400_ref022","volume-title":"Proc. Asimolar Conf.","author":"Gupta","year":"2007"},{"key":"2026032901021598400_ref023","first-page":"249","article-title":"Towards throughput and delay optimal routing for wireless ad-hoc networks","volume":"pages","author":"Gupta","year":"2007","journal-title":"Asilomar Conference"},{"key":"2026032901021598400_ref024","volume-title":"Proc. of 9th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","author":"Huang","year":"2011"},{"key":"2026032901021598400_ref025","volume-title":"Proceedings of the 11th annual international conference on Mobile computing and networking , Cologne, Germany","author":"Biswas","year":"2005"},{"key":"2026032901021598400_ref026","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1982.1095632","article-title":"A responsive distributed routing alorithm for computer networks","volume":"30","author":"Jaffe","year":"1982","journal-title":"IEEE Transactions on Communications"},{"key":"2026032901021598400_ref027","first-page":"22","article-title":"Exploiting path diversity in the link layer in wireless ad hoc networks","volume":"pages","author":"Jain","year":"2005","journal-title":"World of Wireless Mobile and Multimedia Networks"},{"key":"2026032901021598400_ref028","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1109\/TAC.2004.832204","article-title":"Sensitivity Analysis for Optimal Routing in Wireless Ad Hoc Networks in Presence of Error in Channel Quality Estimation","volume":"pages","author":"Javidi","year":"2004","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2026032901021598400_ref029","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1109\/CDC.1993.325119","volume":"1","author":"Tsitsiklis","year":"1993","journal-title":"Proceedings of the 32nd IEEE Conference on Decision and Control"},{"key":"2026032901021598400_ref030","first-page":"1","article-title":"A delay-minimizing routing strategy for wireless multi-hop networks","volume":"7","author":"Stamatiou","year":"2009","journal-title":"IEEE WiOpt"},{"key":"2026032901021598400_ref031","volume-title":"Smart Engineering Systems: Neural Networks, Fuzzy Logic, Data Mining, and Evolutionary Programming","author":"Shailesh Kumar and Risto Miikkulainen","year":"2000"},{"key":"2026032901021598400_ref032","first-page":"1310","article-title":"Cooperative Opportunistic Routing Using Transmit Diversity in Wireless Mesh Networks","volume":"pages","author":"Kurth","year":"2008","journal-title":"INFOCOM"},{"issue":"3","key":"2026032901021598400_ref033","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/TNET.2010.2094204","article-title":"On combining shortest-path and back-pressure routing over multihop wireless networks","volume":"19","author":"Shakkottai","year":"2011","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"4","key":"2026032901021598400_ref034","first-page":"4754","article-title":"Selection diversity forwarding in a multihop packet radio network with fading channel and capture","volume":"2","author":"Larsson","year":"2001","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"issue":"6","key":"2026032901021598400_ref035","doi-asserted-by":"crossref","first-page":"1541","DOI":"10.1109\/TNET.2007.896486","article-title":"Optimal scheduling and routing for maximum network throughput","volume":"15","author":"Leonardi","year":"2007","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032901021598400_ref036","first-page":"2302","article-title":"Stochastic routing in ad hoc wireless networks","volume":"3","author":"Lott","year":"2000","journal-title":"Proceedings of the 39th IEEE Conference on Decision and Control"},{"key":"2026032901021598400_ref037","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/TAC.2005.860280","article-title":"Stochastic routing in ad-hoc networks","volume":"51","author":"Lott","year":"2006","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2026032901021598400_ref038","volume-title":"Conference on Information Sciences and Systems (CISS)","author":"Neely","year":"2006"},{"key":"2026032901021598400_ref039","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"Puterman","year":"1994"},{"issue":"4","key":"2026032901021598400_ref040","doi-asserted-by":"crossref","first-page":"2175","DOI":"10.1109\/TIT.2011.2178152","article-title":"A general class of throughput optimal routing policies in multi-hop wireless networks","volume":"58","author":"Zhuang","year":"2012","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026032901021598400_ref041","first-page":"745","article-title":"Dynamic power allocation and routing for time varying wireless networks","volume":"1","author":"Modiano","year":"2003","journal-title":"INFOCOM 2003"},{"key":"2026032901021598400_ref042","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1016\/j.adhoc.2008.07.009","article-title":"Optimal backpressure routing for wireless networks with multi-receiver diversity","volume":"7","author":"Neely","year":"2009","journal-title":"Ad Hoc Networks (Elsevier)"},{"key":"2026032901021598400_ref043","volume-title":"Proc. of IEEE Workshops on Computational Advances in Multi-Channel Sensor Array Processing (CAMSAP)","author":"Javidi","year":"2013"},{"key":"2026032901021598400_ref044","volume-title":"In Advances in Neural Information Processing Systems, volume 10. MIT Press","author":"Parr","year":"1997"},{"key":"2026032901021598400_ref045","first-page":"340","article-title":"Convergence of ant routing algorithm via stochastic approximation and optimization","volume":"pages","author":"Purkayastha","year":"2007","journal-title":"IEEE Conf. on Decision and Control"},{"key":"2026032901021598400_ref046","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/98.760423","article-title":"A review of current routing protocols for ad-hoc mobile wireless networks","volume":"6","author":"Royer","year":"1999","journal-title":"IEEE Pers. Communications"},{"key":"2026032901021598400_ref047","volume-title":"Artificial Intelligence: A Modern Approach","author":"Russel","year":"2003"},{"key":"2026032901021598400_ref048","volume-title":"A Probability Path","author":"Resnick","year":"1998"},{"issue":"10","key":"2026032901021598400_ref049","doi-asserted-by":"crossref","first-page":"2307","DOI":"10.1109\/TAC.2008.2006820","article-title":"Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning","volume":"53","author":"Sarkar","year":"2008","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2026032901021598400_ref050","author":"Smith","year":"2008"},{"key":"2026032901021598400_ref051","volume-title":"Wireless Communications and Networks","author":"Stallings","year":"2004"},{"issue":"12","key":"2026032901021598400_ref052","doi-asserted-by":"crossref","first-page":"1936","DOI":"10.1109\/9.182479","article-title":"Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks","volume":"37","author":"Tassiulas","year":"1992","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2026032901021598400_ref053","volume-title":"WiOpt","author":"Xi","year":"2006"},{"issue":"1","key":"2026032901021598400_ref054","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TNET.2006.890121","article-title":"Hop-by-Hop Congestion Control Over a Wireless Multi-Hop Network","volume":"15","author":"Yi","year":"2007","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032901021598400_ref055","volume-title":"Information Theory and Applications Workshop","author":"Ying","year":"2008"},{"issue":"4","key":"2026032901021598400_ref056","article-title":"Geographic random forwarding (geraf) for ad hoc and sensor networks: Multihop performance","volume":"2","author":"Zorzi","year":"2003","journal-title":"IEEE Transactions on Mobile Computing"}],"container-title":["Foundations and Trends\u00ae in Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftnet\/article-pdf\/11\/1-2\/1\/11136312\/1300000021en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftnet\/article-pdf\/11\/1-2\/1\/11136312\/1300000021en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T18:13:43Z","timestamp":1777486423000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftnet\/article\/11\/1-2\/1\/1331385\/Opportunistic-Routing-in-Wireless-Networks"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,23]]},"references-count":56,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,11,23]]}},"URL":"https:\/\/doi.org\/10.1561\/1300000021","relation":{},"ISSN":["1554-057X","1554-0588"],"issn-type":[{"value":"1554-057X","type":"print"},{"value":"1554-0588","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,23]]}}}