Amir Darehshoorzadeh
ABSTRACT
Opportunistic Routing (OR) has been investigated in recent years as a way to increase the performance of multi-hop wireless networks by exploiting its broadcast nature. In contrast to traditional routing, where traffic is sent along pre-determined paths, in OR an ordered set of candidates is selected for each next-hop. Upon each transmission, the candidates coordinate such that the most priority one receiving the packet actually forward it. Most of the research in OR has been addressed to investigate candidate selection algorithms. In this paper we compare a selected group of algorithms that have been proposed in the literature. Our main conclusion is that optimality is obtained at a high computational cost, with a performance gain very similar to that of much simpler but non optimal algorithms. Therefore, we conclude that fast and simple OR candidate selection algorithms may be preferable in dynamic networks, where the candidate sets are likely to be updated frequently.
- MIT roofnet. http://pdos.csail.mit.edu/roofnet.Google Scholar
- The Network Simulator ns-2.Google Scholar
- F. Baccelli, B. Blaszczyszyn, and P. Muhlethaler. On the performance of time-space opportunistic routing in multihop mobile ad hoc networks. In WiOpt, pages 307--316, Apr. 2008.Google ScholarCross Ref
- S. Biswas and R. Morris. Opportunistic routing in multi-hop wireless networks. ACM SIGCOMM Computer Communication Review, 34(1):69--74, 2004. Google ScholarDigital Library
- S. Biswas and R. Morris. ExOR: opportunistic multi-hop routing for wireless networks. ACM SIGCOMM Computer Communication Review, 35(4):133--144, 2005. Google ScholarDigital Library
- L. Cerdà-Alabern, V. Pla, and A. Darehshoorzadeh. On the performance modeling of opportunistic routing. In MobiOpp '10: Proceedings of the Second International Workshop on Mobile Opportunistic Networking, pages 15--21, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- L. Cerdà-Alabern, V. Pla, and A. Darehshoorzadeh. On the maximum performance in opportunistic routing. In IEEE WoWMoM 2010, Montreal, Canada.Google Scholar
- S. Chachulski, M. Jennings, S. Katti, and D. Katabi. Trading structure for randomness in wireless opportunistic routing. In SIGCOMM, pages 169--180, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- D. S. J. De Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. Wireless Networks, 11(4):419--434, 2005. Google ScholarDigital Library
- H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli. Least-cost opportunistic routing. In Proceedings of 2007 Allerton Conference on Communication, Control, and Computing, 2007.Google Scholar
- H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli. Valuable detours: Least-cost anypath routing. submitted, http://icapeople.epfl.ch/grossglauser/publications.html, Mar. 2009. Google ScholarDigital Library
- D. Fuste-Vilella, J. Garcia-Vidal, and J. Morillo-Pozo. Cooperative forwarding in ieee 802.11-based manets. In Wireless Days, 2008. WD '08. 1st IFIP, pages 1--5, nov. 2008.Google ScholarCross Ref
- P. Larsson. Selection diversity forwarding in a multihop packet radio network with fading channel and capture. SIGMOBILE Mob. Comput. Commun. Rev., 5(4):47--54, 2001. Google ScholarDigital Library
- Y. Li, Y. an Liu, and P. Luo. Link probability based opportunistic routing metric in wireless network. In Communications and Mobile Computing. CMC '09. WRI International Conference on, volume 2, pages 308--312, 2009. Google ScholarDigital Library
- Y. Li, W. Chen, and Z.-L. Zhang. Optimal forwarder list selection in opportunistic routing. In Mobile Adhoc and Sensor Systems. MASS '09. IEEE 6th International Conference on, pages 670--675, oct. 2009.Google ScholarCross Ref
- J. Wu, M. Lu, and F. Li. Utility-based opportunistic routing in multi-hop wireless networks. In Distributed Computing Systems. ICDCS'08. The 28th International Conference on, pages 470--477, 2008. Google ScholarDigital Library
- Z. Zhong and S. Nelakuditi. On the efficacy of opportunistic routing. In SECON '07, pages 441--450, June 2007.Google ScholarCross Ref
- Z. Zhong, J. Wang, S. Nelakuditi, and G.-H. Lu. On selection of candidates for opportunistic anypath forwarding. SIGMOBILE Mob. Comput. Commun. Rev., 10(4):1--2, 2006. Google ScholarDigital Library
Index Terms
- Candidate selection algorithms in opportunistic routing
Recommendations
Mobility-based opportunistic routing for mobile ad-hoc networks
PE-WASUN '14: Proceedings of the 11th ACM symposium on Performance evaluation of wireless ad hoc, sensor, & ubiquitous networksOpportunistic Routing (OR) is an effective and enhanced routing scheme for wireless multihop environment. OR is an approach which selects a certain number of best forwarders (candidates) at each hop by taking the advantage of the broadcast nature of the ...
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 ...
Opportunistic routing in wireless ad hoc networks: upper bounds for the packet propagation speed
Special issue on stochastic geometry and random graphs for the analysis and designof wireless networksClassical routing strategies for mobile ad hoc networks operate in a hop by hop "push mode" basis: packets are forwarded on pre-determined relay nodes, according to previously and independently established link performance metrics (e.g., using hellos or ...
Comments