Abstract
Opportunistic Routing (OR) has been proposed to improve the efficiency of unicast protocols in wireless networks. In contrast to traditional routing, instead of preselecting a single specific node to be the next-hop forwarder, an ordered set of nodes (referred to as candidates) is selected as the next-hop potential forwarders. In this paper, we propose a new multicast routing protocol based on OR for wireless mesh networks, named Multicast OR Protocol (MORP). We compare our proposal with the well known ODMRP Multicast protocol. Our results show that Multicast-OR outperforms ODMRP, reducing the number of transmissions and increasing the packet delivery ratio.
Chapter PDF
Similar content being viewed by others
References
MIT roofnet, http://pdos.csail.mit.edu/roofnet
Biswas, S., Morris, R.: Opportunistic routing in multi-hop wireless networks. ACM SIGCOMM Computer Communication Review 34(1), 69–74 (2004)
Biswas, S., Morris, R.: ExOR: opportunistic multi-hop routing for wireless networks. ACM SIGCOMM Computer Communication Review 35(4), 133–144 (2005)
Cerdà-Alabern, L., Pla, V., Darehshoorzadeh, A.: On the performance modeling of opportunistic routing. In: MobiOpp 2010: Second International Workshop on Mobile Opportunistic Networking, pp. 15–21. ACM, New York (2010)
Cerdá-Alabern, L., Pla, V., Darehshoorzadeh, A.: On the maximum performance in opportunistic routing. In: IEEE WoWMoM 2010, Montreal, Canada (2010)
Chachulski, S., Jennings, M., Katti, S., Katabi, D.: Trading structure for randomness in wireless opportunistic routing. In: SIGCOMM, pp. 169–180. ACM, New York (2007)
Darehshoorzadeh, A., Cerdà-Alabern, L.: Candidate selection algorithms in opportunistic routing. In: PM2HW2N 2010: 5th ACM Workshop on Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks, pp. 48–54. ACM, New York (2010)
De Couto, D.S.J., Aguayo, D., Bicket, J., Morris, R.: A high-throughput path metric for multi-hop wireless routing. Wireless Networks 11(4), 419–434 (2005)
Dubois-Ferriére, H., Grossglauser, M., Vetterli, M.: Least-cost opportunistic routing. In: Allerton Conference on Communication, Control, and Computing (2007)
Dubois-Ferriére, H., Grossglauser, M., Vetterli, M.: Valuable detours: Least-cost anypath routing. IEEE/ACM Transactions on Networking 19(2), 333–346 (2011)
Koutsonikolas, D., Hu, Y., Wang, C.-C.: Pacifier: High-throughput, reliable multicast without “crying babies” in wireless mesh networks. In: IEEE INFOCOM 2009, pp. 2473–2481 (2009)
Le, T., Liu, Y.: Opportunistic overlay multicast in wireless networks. In: GLOBECOM, pp. 1–5 (2010)
Lee, S.-J., Gerla, M., Chiang, C.-C.: On-demand multicast routing protocol. In: IEEE Wireless Communications and Networking Conference, WCNC 1999, vol. 3, pp. 1298–1302 (1999)
Li, Y., Chen, W., Zhang, Z.-L.: Optimal forwarder list selection in opportunistic routing. In: IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS 2009, pp. 670–675 (October 2009)
Naderan-Tahan, M., Darehshoorzadeh, A., Dehghan, M.: Odmrp-lr: Odmrp with link failure detection and local recovery mechanism. In: Eighth IEEE/ACIS International Conference on Computer and Information Science, ICIS 2009, pp. 818–823 (June 2009)
Zeng, X., Bagrodia, R., Gerla, M.: GloMoSim: A Library for Parallel Simulation of Large-Scale Wireless Networks. In: 12th Workshop on Parallel and Distributed Simulation (PADS 1998), pp. 154–161. IEEE Computer Society, Los Alamitos (1998)
Zhong, Z., Nelakuditi, S.: On the efficacy of opportunistic routing. In: SECON 2007, pp. 441–450 (June 2007)
Zhong, Z., Wang, J., Nelakuditi, S., Lu, G.-H.: On selection of candidates for opportunistic anypath forwarding. SIGMOBILE Mob. Comput. Commun. Rev. 10(4), 1–2 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 IFIP International Federation for Information Processing
About this paper
Cite this paper
Darehshoorzadeh, A., Cerdà-Alabern, L. (2011). A New Multicast Opportunistic Routing Protocol for Wireless Mesh Networks. In: Casares-Giner, V., Manzoni, P., Pont, A. (eds) NETWORKING 2011 Workshops. NETWORKING 2011. Lecture Notes in Computer Science, vol 6827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23041-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-23041-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23040-0
Online ISBN: 978-3-642-23041-7
eBook Packages: Computer ScienceComputer Science (R0)