skip to main content
10.1145/3056662.3056688acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicscaConference Proceedingsconference-collections
research-article

Algorithm for multicast opportunistic routing in wireless mesh networks

Published:26 February 2017Publication History

ABSTRACT

Multi-hop Wireless Mesh Networks (WMNs) is a promising new technique for communication with routing protocol designs being critical to the effective and efficient of these WMNs. A common approach for routing traffic in these networks is to select a minimal distance from source to destination as in wire-line networks. Opportunistic Routing(OR) makes use of the broadcasting ability of wireless network and is especially very helpful for WMN because all nodes are static. Our proposed scheme of Multicast Opportunistic Routing(MOR) in WMNs is based on the broadcast transmissions and Learning Au-tomata (LA) to expand the potential candidate nodes that can aid in the process of retransmission of the data. The receivers are required to be in sync with one another in order to avoid duplicated broadcasting of data which is generally achieved by formulating the forwarding candidates according to some LA based metric. The most adorable aspect of this protocol is that it intelligently "learns" from the past experience and improves its performance. The results obtained via this approach of MOR, shows that the proposed scheme outperforms with some existing sachems and is an improved and more effective version of opportunistic routing in mesh network.

References

  1. M. Ghasemi, M. Abdolahi , M. Bag-Mohammadi , A. Bohlooli, Adaptive multi-flow opportunistic routing using learning automata, Elsevier Ad Hoc Networks, Vol. 25, 2015, pp. 472--479. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Biswas, Robert Morris, ExOR: opportunistic multi-hop routing for wireless networks, ACM SIGCOMM Comput. Commun. Rev. 35 (4) (2005). October.Google ScholarGoogle Scholar
  3. S. Misra, V. Tiwari, Mohammad S. Obaidat, Lacas: learning automata-based congestion avoidance scheme for healthcare wireless sensor networks, IEEE J. Sel. Areas Commun, Vol. 27 (4) (2009), pp. 466--479. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. N. Kuma, N. Chilamkurti, J. Rodrigues, Learning Automata-based Opportunistic Data Aggregation and Forwarding scheme for alert generation in Vehicular Ad Hoc Networks, Computer Communications, Vol. 39, 2014, pp. 22--32. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. X. Cai, Y. He, C. Zhao, L. Zhu and C. Li, LSGO: Link State aware Geographic Opportunistic routing protocol for VANETs, EURASIP Journal on Wireless Communications and Networking, 2014. Google ScholarGoogle ScholarCross RefCross Ref
  6. E. Rozner, J. Seshadri, Y. Mehta, L. Qiu, SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks, IEEE Transactions on Mobile Computing, vol.8, no. 12, pp. 1622--1635, December 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Waharte, R. Boutaba, Y. Iraqi, B, Ishibashi, Routing protocols in wireless mesh networks: challenges and design considerations, Springer Science + Business Media, LLC 2006.Google ScholarGoogle Scholar
  8. N. Gazoni, V. Angelakis, V. A. Siris, A Framework for Opportunistic Routing in Multi-hop Wireless Networks, PE-WASUN'10, 2010,.Google ScholarGoogle Scholar
  9. J. Jun, Mihail L. Sichitiu, MRP: Wireless mesh networks routing protocol, Elsevier, Comput. Commun, 2008.Google ScholarGoogle Scholar
  10. A. Triviño-Cabrera, S. Cañadas-Hurtado, Survey on Opportunistic Routing in Multihop Wireless Networks, International Journal of Communication Networks and Information Security (IJCNIS) Vol. 3, No. 2, August 2011.Google ScholarGoogle Scholar
  11. R. Draves, J. Padhye, B. Zill, Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks, ACM MobiCom'04, 2004, Philadelphia, Pennsylvania, USA.Google ScholarGoogle Scholar
  12. Sanjit Biswas and Robert Morris, Opportunistic Routing in MultiHop Wireless Networks, ACM SIGCOMM Computer Communications Review 69 Volume 34, Number 1, 2004.Google ScholarGoogle Scholar
  13. A. Boukerche and A. Darehshoorzadeh, Opportunistic routing in wireless networks: Models, algorithms, and classifications, ACM Comput. Surv. 47, 2, Article 22, 2014, 36 pages.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. M. Tahooni , A. Darehshoorzadeh, A. Boukerche, Mobility-based Opportunistic Routing for Mobile Ad-Hoc Networks, ACM PE-WASUN'14, 2014.Google ScholarGoogle Scholar
  15. R. Bruno, M. Nurchis, Survey on diversity-based routing in wireless mesh networks: challenges and solutions, Comput. Commun. Vol. 33, 2010, pp. 269--282. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Y. Li, W. Chen, Z.L. Zhang, Optimal Forwarder List Selection in Opportunistic Routing, in: IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, 2009, pp. 670--675. Google ScholarGoogle ScholarCross RefCross Ref
  17. Yao H. Ho , Ai H. Ho and Kien A. Hua, Routing protocols for inter-vehicular networks: A comparative study in high mobility and large obstacles environment", Computer communication 31, pp.2767--2780,2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. H. Saleet ,R. Langar, K.Naik,Raouf Boutaba, Member, A. Nayak and N. Goel ,Intersection-Based Geographical Routing Protocol for VANETs: A Proposal and Analysis, IEEE Transaction on vehicular Technology,Vol.60, pp. 4560--4574, 2011. Google ScholarGoogle ScholarCross RefCross Ref
  19. M.A.L. Thathachar, P.S. Sastry, Varieties of learning automata: an overview, IEEE Trans. System, Man, Cybernet. - Part B: Cybernet. 32, 2002, pp. 711--722. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. D. Das, R. Misra and A. Raj "Approximating Geographic Routing using Coverage Tree Heuristics for Wireless Network", Wireless Networks (WINE), Springer US, Vol. 21. No. 4, 2015, pp. 1109--1118.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. D. Das and R. Misra, "Caching Algorithm for Fast Hand off using AP Graph with Multiple Vehicles for VANET", International Journal of Communication Networks and Distributed Systems (IJCNDS), Inderscience Publishers Switzerland,Vol. 14. No. 3, 2015, pp. 219--236Google ScholarGoogle Scholar

Index Terms

  1. Algorithm for multicast opportunistic routing in wireless mesh networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ICSCA '17: Proceedings of the 6th International Conference on Software and Computer Applications
      February 2017
      339 pages
      ISBN:9781450348577
      DOI:10.1145/3056662

      Copyright © 2017 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 26 February 2017

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader