Azzedine Boukerche
Skip Abstract Section
Abstract
Opportunistic Routing (OR) is a new promising paradigm that has been proposed for wireless networks. OR has gained a lot of attention from the research communities for its ability to increase the performance of wireless networks. It benefits from the broadcast characteristic of wireless mediums to improve network performance. The basic function of OR is its ability to overhear the transmitted packet and to coordinate among relaying nodes. In OR, a candidate set is a potential group of nodes that is selected as the next-hop forwarders. Hence, each node in OR can use different potential paths to send packets toward the destination. Any of the candidates of a node that have received the transmitted packet may forward it. The decision of choosing the next forwarder is made by coordination between candidates that have successfully received the transmitted packet. In OR, by using a dynamic relay node to forward the packet, the transmission reliability and network throughput can be increased. In this article, we explain the fundamental idea of OR and its important issues by providing some examples. We then categorize each of the important issues and explain them in detail. Furthermore, we illustrate different protocols from each category and compare their benefits and drawbacks. Finally, some potential directions for future research in OR is explained.
- R. Ahlswede, Ning Cai, S.-Y. R. Li, and R. W. Yeung. 2000. Network information flow. IEEE Transactions on information Theory 46, 4 (July 2000), 1204--1216. Google Scholar
Digital Library
- Muhammad Mehran Ajmal, Sajjad A. Madani, Tahir Maqsood, Kashif Bilal, Babar Nazir, and Khizar Hayat. 2013. Coordinated opportunistic routing protocol for wireless mesh networks. Computers and Electrical Engineering 39, 6, 2442--2453. Google ScholarDigital Library
- I. F. Akyildiz and Xudong Wang. 2005. A survey on wireless mesh networks. Communications Magazine, IEEE 43, 9 (Sept. 2005), S23--S30. Google ScholarDigital Library
- I. F. Akyildiz and Xudong Wang. 2009. Wireless Mesh Networks. John Wiley & Sons Ltd.Google Scholar
- Sanjit Biswas and Robert Morris. 2004. Opportunistic routing in multi-hop wireless networks. ACM SIGCOMM Computer Communication Review 34, 1 (2004), 69--74. Google ScholarDigital Library
- Sanjit Biswas and Robert Morris. 2005. ExOR: Opportunistic multi-hop routing for wireless networks. ACM SIGCOMM Computer Communication Review 35, 4 (2005), 133--144. Google ScholarDigital Library
- Azzedine Boukerche. 2004. Performance evaluation of routing protocols for ad hoc wireless networks. Mobile Networks and Applications 9, 4 (2004), 333--342. Google ScholarDigital Library
- Azzedine Boukerche. 2008. Algorithms and Protocols for Wireless Sensor Networks. Vol. 62. John Wiley & Sons. Google ScholarDigital Library
- Azzedine Boukerche and Sajal K. Das. 2003. Congestion control performance of R-DSDV protocol in multihop wireless ad hoc networks. Wireless Networks 9, 3 (2003), 261--270. Google ScholarDigital Library
- Azzedine Boukerche, Sajal K. Das, and Alessandro Fabbri. 2001. Analysis of a randomized congestion control scheme with {DSDV} routing in ad hoc wireless networks. Journal of Parallel and Distributed Computing 61, 7 (2001), 967--995. Google ScholarDigital Library
- Azzedine Boukerche, Dionysios Efstathiou, and Sotiris Nikoletseas. 2012. Direction-based adaptive data propagation for heterogeneous sensor mobility. Journal of Parallel and Distributed Computing 72, 6 (2012), 778--790. Google ScholarDigital Library
- Azzedine Boukerche and Steve Rogers. 2001. Performance of GZRP ad hoc routing protocol. Journal of Interconnection Networks 2, 1 (2001), 31--48.Google ScholarCross Ref
- Azzedine Boukerche, B. Turgut, N. Aydin, M. Z. Ahmad, L. Bölöni, and D. Turgut. 2011. Routing protocols in ad hoc networks: A survey. Computer Networks 55, 13 (Sept. 2011), 3032--3080. Google ScholarDigital Library
- Raffaele Bruno and Maddalena Nurchis. 2010. Survey on diversity based routing in wireless mesh networks: Challenges and solutions. Computer Communications 33, 3 (2010), 269--282. Google ScholarDigital Library
- A. S. Cacciapuoti, M. Caleffi, and L. Paura. 2010. Optimal constrained candidate selection for opportunistic routing. In IEEE GLOBECOM. 1--5.Google Scholar
- Llorenç Cerdà-Alabern, Amir Darehshoorzadeh, and Vicent Pla. 2010. On the maximum performance in opportunistic routing. In Proceedings of the 2010 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WOWMOM'10). IEEE Computer Society, Washington, DC, 1--8. Google ScholarDigital Library
- Llorenç Cerdà-Alabern, Amir Darehshoorzadeh, and Vicent Pla. 2013. Optimum node placement in wireless opportunistic routing networks. Ad Hoc Networks 11, 8 (2013), 2273--2287. Google ScholarDigital Library
- Llorenç Cerdà-Alabern, Vicent Pla, and Amir Darehshoorzadeh. 2010. On the performance modeling of opportunistic routing. In Proceedings of the 2nd International Workshop on Mobile Opportunistic Networking (MobiOpp'10). ACM, New York, NY, 15--21. Google ScholarDigital Library
- Szymon Chachulski, Michael Jennings, Sachin Katti, and Dina Katabi. 2007. Trading structure for randomness in wireless opportunistic routing. In Proceedings of the 2007 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM'07). ACM, New York, NY, 169--180. Google ScholarDigital Library
- Wing-Cheong Lau Chun-Pong Luk and On-Ching Yue. 2009. Opportunistic routing with directional antennas in wireless mesh networks. In IEEE INFOCOM. 2886--2890.Google Scholar
- Amir Darehshoorzadeh. 2012. Opportunistic Routing in Wireless Mesh Networks. Ph.D. Dissertation. Universitat Politècnica de Catalunya. Barcelona Tech, Barcelona, Spain.Google Scholar
- Amir Darehshoorzadeh, Mohammed Almulla, Azzedine Boukerche, and Sonny Chaiwala. 2013. On the number of candidates in opportunistic routing for multi-hop wireless networks. In Proceedings of the 11th ACM International Symposium on Mobility Management and Wireless Access (MobiWac'13). ACM, New York, NY, 9--16. Google ScholarDigital Library
- Amir Darehshoorzadeh and Azzedine Boukerche. 2014. Opportunistic routing protocols in wireless networks: A performance comparison. In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC'14).Google ScholarCross Ref
- Amir Darehshoorzadeh and Llorenç Cerdà-Alabern. 2010. Candidate selection algorithms in opportunistic routing. In Proceedings of the 5th ACM Workshop on Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks (PM2HW2N). ACM, New York, NY, 48--54. Google ScholarDigital Library
- Amir Darehshoorzadeh and Llorenç Cerdà-Alabern. 2011. A new multicast opportunistic routing protocol for wireless mesh networks. In Networking Workshops. 62--72. Google ScholarDigital Library
- Amir Darehshoorzadeh and L. Cerdà-Alabern. 2012. Distance progress based opportunistic routing for wireless mesh networks. In Proceedings of the 2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC'12). 179--184.Google Scholar
- Amir Darehshoorzadeh and Llorenç Cerdà-Alabern. 2013. Multicast delivery using opportunistic routing in wireless mesh networks. International Journal of Ad Hoc and Ubiquitous Computing (2013). Retrieved from http://www.inderscience.com/info/ingeneral/forthcoming.php?jcode=IJAHUC.Google Scholar
- Amir Darehshoorzadeh, Llorenç Cerdà-Alabern, and Vicent Pla. 2011. Modeling and comparison of candidate selection algorithms in opportunistic routing. Computer Networks 55, 13 (2011), 2886--2898. Google ScholarDigital Library
- Douglas S. J. De Couto, Daniel Aguayo, John Bicket, and Robert Morris. 2005. A high-throughput path metric for multi-hop wireless routing. Wireless Networks 11, 4 (2005), 419--434. Google ScholarDigital Library
- Richard Draves, Jitendra Padhye, and Brian Zill. 2004. Routing in multi-radio, multi-hop wireless mesh networks. In Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom'04). ACM, New York, NY, 114--128. Google ScholarDigital Library
- H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli. 2007. Least-cost opportunistic routing. In Proceedings of 2007 Allerton Conference on Communication, Control, and Computing, 994--1001.Google Scholar
- H. Dubois-Ferriére, M. Grossglauser, and M. Vetterli. 2011. Valuable detours: Least-Cost anypath routing. IEEE/ACM Transactions on Networking 19, 2 (April 2011), 333--346. Google ScholarDigital Library
- Dionysios Efstathiou, Ioannis Kotsogiannis, and Sotiris Nikoletseas. 2011. Energy balanced data propagation in wireless sensor networks with diverse node mobility. In Proceedings of the 9th ACM International Symposium on Mobility Management and Wireless Access (MobiWac'11). ACM, New York, NY, 163--166. Google ScholarDigital Library
- Holger Füßler, Jörg Widmer, Michael Käsemann, Martin Mauve, and Hannes Hartenstein. 2003. Contention-based forwarding for mobile ad hoc networks. Ad Hoc Networks 1, 4 (2003), 351--369.Google ScholarCross Ref
- E. Ghadimi, O. Landsiedel, P. Soldati, and M. Johansson. 2012. A metric for opportunistic routing in duty cycled wireless sensor networks. In Proceedings of the 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON'12). 335--343.Google Scholar
- Shiming He, Dafang Zhang, Kun Xie, Xiaan Bi, Hong Qiao, Bin Zeng, and others. 2013. A candidate forwarder set based channel assignment for opportunistic routing in multi-radio wireless mesh networks. In Advances in Wireless Sensor Networks. Springer, 103--116.Google Scholar
- Che-Jung Hsu, Huey-Ing Liu, and Winston Khoon Guan Seah. 2011. Opportunistic routing: A review and the challenges ahead. Computer Networks 55, 15 (2011), 3592--3603. Google ScholarDigital Library
- Shweta Jain and Samir R. Das. 2008. Exploiting path diversity in the link layer in wireless ad hoc networks. Ad Hoc Networks 6, 5 (2008), 805--825. Google ScholarDigital Library
- Brad Karp and H. T. Kung. 2000. GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MobiCom'00). ACM, New York, NY, 243--254. Google ScholarDigital Library
- Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, and Jon Crowcroft. 2006. XORs in the air: Practical wireless network coding. In Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM'06). ACM, New York, NY, 243--254. Google ScholarDigital Library
- Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, and Jon Crowcroft. 2008. XORs in the air: Practical wireless network coding. IEEE/ACM Transactions on Networks 16, 3 (2008), 497--510. Google ScholarDigital Library
- Uichin Lee, Kevin C. Lee, and Mario Gerla. 2009. TO-GO: TOpology-assist geo-opportunistic routing in urban vehicular grids. In Proceedings of the 6th International Conference on Wireless On-Demand Network Systems and Services (WONS'09). 11--18. Google ScholarDigital Library
- Dimitrios Koutsonikolas, Y. Charlie Hu, and Chih Chun Wang. 2008. XCOR: Synergistic interflow network coding and opportunistic routing. In ACM MobiCom'08 SRC, 1--3.Google Scholar
- Peter Larsson. 2001. Selection diversity forwarding in a multihop packet radio network with fading channel and capture. SIGMOBILE Mobile Computing Communication Review 5, 4 (2001), 47--54. Google ScholarDigital Library
- Rafael Laufer, H. Dubois-Ferriere, and L. Kleinrock. 2009. Multirate anypath routing in wireless mesh networks. In IEEE INFOCOM. 37--45.Google Scholar
- Rafael Laufer, P. B. Velloso, L. F. M. Vieira, and L. Kleinrock. 2012. PLASMA: A new routing paradigm for wireless multihop networks. In Proceedings of the IEEE INFOCOM 2012. 2706--2710.Google Scholar
- Tan Le and Yong Liu. 2010. Opportunistic overlay multicast in wireless networks. In GLOBECOM. 1--5.Google Scholar
- Ming Li, Wenjing Lou, and Kai Zeng. 2009b. OppCast: Opportunistic broadcast ofwarning messages in VANETs with unreliable links. In Proceedings of the IEEE 6th International Conference on Mobile Adhoc and Sensor Systems (MASS'09). 534--543.Google Scholar
- Yanhua Li, Yuan an Liu, and Pengkui Luo. 2009. Link probability based opportunistic routing metric in wireless network. In Proceedings of the WRI International Conference on Communications and Mobile Computing (CMC'09), Vol. 2. 308--312. Google ScholarDigital Library
- Yanhua Li, Wei Chen, and Zhi-Li Zhang. 2009a. Optimal forwarder list selection in opportunistic routing. In Proceedings of the IEEE 6th International Conference on Mobile Adhoc and Sensor Systems (MASS'09). 670--675.Google ScholarCross Ref
- Yanhua Li and Zhi-Li Zhang. 2010. Random walks on digraphs: A theoretical framework for estimating transmission costs in wireless routing. In Proceedings of the 29th Conference on Information Communications (INFOCOM'10). IEEE, 2775--2783. Google ScholarDigital Library
- Yunfeng Lin, Baochun Li, and Ben Liang. 2008. CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding. In Proceedings of the IEEE International Conference on Network Protocols (ICNP'08). 13--22. Google ScholarDigital Library
- Haitao Liu, Baoxian Zhang, H. Mouftah, Xiaojun Shen, and Jian Ma. 2009. Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions. Communications Magazine, IEEE 47, 12 (Dec. 2009), 103--109. Google ScholarDigital Library
- Mingming Lu and Jie Wu. 2009. Opportunistic routing algebra and its applications. In IEEE INFOCOM. 2374--2382.Google Scholar
- Chun-Pong Luk, Wing-Cheong Lau, and On-Ching Yue. 2008. An analysis of opportunistic routing in wireless mesh network. In Proceedings of the 2008 IEEE International Conference on Communications (ICC'08). 2877--2883.Google ScholarCross Ref
- Teerawat Issariyakul and Ekram Hossain. 2008. Introduction to Network Simulator NS2, edition 1. Springer. Google ScholarDigital Library
- Charles E. Perkins, Elizabeth M. Belding-Royer, and S. Das. 2003. RFC 3561: Ad hoc On-Demand Distance Vector (AODV) Routing. (July 2003). Google ScholarDigital Library
- RoofNet. MIT Roofnet. 2002. Retrieved from http://pdos.csail.mit.edu/roofnet.Google Scholar
- E. Rozner, J. Seshadri, Y. Mehta, and Lili Qiu. 2009. SOAR: Simple opportunistic adaptive routing protocol for wireless mesh networks. IEEE Transactions on Mobile Computing 8, 12 (Dec. 2009), 1622--1635. Google ScholarDigital Library
- Rahul C. Shah, Sven Wietholter, Adam Wolisz, and Jan M. Rabaey. 2005. When does opportunistic routing make sense? In Proceedings of the 3rd IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'05). IEEE Computer Society, Washington, DC, 350--356. Google ScholarDigital Library
- Nirwan Ansari Sumet Prabhavat, Hiroki Nishiyama, and Nei Kato. 2012. On load distribution over multipath networks. Communications Surveys Tutorials, IEEE 14, 3, 662--680.Google Scholar
- Yang Wenzhong, Zhang Zhenyu, Wang Bo, and Wu Xiaohong. 2010. A reliable multicast for MANETs based on opportunistic routing. In Proceedings of the 2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM'10). 1--4.Google Scholar
- Cedric Westphal. 2006. Opportunistic routing in dynamic ad hoc networks: The OPRAH protocol. In Proceedings of the 2006 IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS'06). 570--573.Google ScholarCross Ref
- J. Wu, M. Lu, and F. Li. 2008. Utility-based opportunistic routing in multi-hop wireless networks. In Proceedings of the 28th International Conference on Distributed Computing Systems (ICDCS'08). 470--477. Google ScholarDigital Library
- Yan Yan, Baoxian Zhang, H. T. Mouftah, and Jian Ma. 2008. Practical coding-aware mechanism for opportunistic routing in wireless mesh networks. In Proceedings of the IEEE International Conference on Communications (ICC'08). 2871--2876.Google ScholarCross Ref
- Y. Yan, B. Zhang, J. Zheng, and J. Ma. 2010. CORE: A coding-aware opportunistic routing mechanism for wireless mesh networks {Accepted from Open Call}. Wireless Communications, IEEE 17, 3 (June 2010), 96--103. Google ScholarDigital Library
- Shengbo Yang, Feng Zhong, Chai Kiat Yeo, Bu Sung Lee, and Jeff Boleng. 2009b. Position based opportunistic routing for robust data delivery in MANETs. In Proceedings of the 28th IEEE Conference on Global Telecommunications (GLOBECOM'09). IEEE Press, Piscataway, NJ, 1325--1330. Google ScholarDigital Library
- Z. Yang, K. Zeng, and W. Lou. 2009a. FSA: A fast coordination scheme for opportunistic routing. In Proceedings of the 2009 IEEE International Conference on Communications. IEEE, 1--5. Google ScholarDigital Library
- Y. Yuan, H. Yang, S. H. Y. Wong, S. Lu, and W. Arbaugh. 2005. ROMER: Resilient opportunistic mesh routing for wireless mesh networks. In Proceedings of the IEEE Workshop on Wireless Mesh Networks (WiMesh'05), 1--9.Google Scholar
- Kai Zeng, Wenjing Lou, Jie Yang, and Donald R. Brown. 2008. On throughput efficiency of geographic opportunistic routing in multihop wireless networks. Mobile Networks and Applications 12, 5--6 (April 2008), 347--357. Google ScholarDigital Library
- Kai Zeng, Wenjing Lou, Jie Yang, and Donald R. Brown, III. 2007b. On throughput efficiency of geographic opportunistic routing in multihop wireless networks. Mobile Network Applications 12 (December 2007), 347--357. Issue 5. Google ScholarDigital Library
- Kai Zeng, Wenjing Lou, and Yanchao Zhang. 2007a. Multi-rate geographic opportunistic routing in wireless ad hoc networks. In Proceedings of the 2007 Military Communications Conference (MILCOM'07). IEEE. 1--7.Google ScholarCross Ref
- Kai Zeng, Zhenyu Yang, and Wenjing Lou. 2009. Location-aided opportunistic forwarding in multirate and multihop wireless networks. IEEE Transactions on Vehicular Technology 58, 6 (July 2009), 3032--3040.Google Scholar
- Zifei Zhong and S. Nelakuditi. 2007. On the efficacy of opportunistic routing. In Proceedings of the 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON'07). 441--450.Google Scholar
- Zifei Zhong, Junling Wang, Srihari Nelakuditi, and Guor-Huar Lu. 2006. On selection of candidates for opportunistic anypath forwarding. SIGMOBILE Mobile Computer Communication Review 10, 4 (2006), 1--2. Google ScholarDigital Library
- M. Zorzi and R. R. Rao. 2003. Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Multihop performance. IEEE Transactions on Mobile Computing 2, 4 (Oct.-Dec. 2003), 337--348. Google ScholarDigital Library
- A. Zubow, M. Kurth, and J.-P. Redlich. 2008. Considerations on forwarder selection for opportunistic protocols in wireless networks. In Proceedings of the 14th European Wireless Conference. 1--7.Google ScholarCross Ref
Index Terms
- Opportunistic Routing in Wireless Networks: Models, Algorithms, and Classifications
Recommendations
Efficient Algorithm for Routing in Dynamic Wireless Networks
ICCCNT '16: Proceedings of the 7th International Conference on Computing Communication and Networking TechnologiesOpportunistic Routing (OR) is a new encouraging routing technique that is an efficient and enhanced routing scheme for wireless networks. It is an approach which takes a certain number of best forwarder nodes (i.e., candidate nodes) at each hop by ...
Opportunistic Routing in Wireless Multi-hop Networks: A Tutorial
MASCOTS '14: Proceedings of the 2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication SystemsOpportunistic Routing (OR) [1] is a new promising paradigm, which has been proposed as a way to increase the performance of wireless networks by exploiting its broadcast nature. It benefits from the broadcast characteristic of wireless mediums to ...
On the number of candidates in opportunistic routing for multi-hop wireless networks
MobiWac '13: Proceedings of the 11th ACM international symposium on Mobility management and wireless accessOpportunistic Routing (OR) is a new paradigm that has been investigated as a new way to improve the performance of multihop wireless networks by exploiting the broadcast nature of the wireless medium. In contrast to traditional routing, in OR an ordered ...
Comments