Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2507908.2507922acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
research-article

Agent-based multicast opportunistic routing protocol for wireless networks

Published: 03 November 2013 Publication History

Abstract

Opportunistic routing techniques achieve high throughput rates for the feeble and lossy links in wireless networks. Opportunistic Routing (OR) is a broadcast based technique widely used in Delay Tolerant Networks (DTNs) that uses the relay node negotiation and link attributes to forward the data in the network. Multiple retransmissions in opportunistic routing increase the communication overhead in the network. Hence, node scheduling and network coding techniques are used to reduce the rate of re-transmissions in the network. In this article, we present a novel approach using Agent-based Multicast Opportunistic Routing Protocol (Agent-based MORP) to reduce the load of the source node by re-establishing the links with multicast member nodes using opportunistic link attributes of the network. The proposed protocol elects the maximum trusted relay node as the agent node to transfer the long-awaited data packets towards the destination. Agent-based MORP uses the stateless approach, where the forwarding nodes are divided into probable relay regions, and the routing paths are established on demand. The proposed protocol limits the number of re-transmissions and saves the energy in the network. Simulation results indicate that the proposed Agent-based MORP reduces the control overhead and improves the performance of opportunistic routing in wireless networks.

References

[1]
H. Che-Jung, L. Huey-Ing and K. G. S. Winston, Opportunistic Routing - A review and the challenges ahead, Elsevier Journal of Computer Networks, 27 October 2011, 55(27), pp. 3592--3603.
[2]
C. Szymon, J. Michael, K. Sachin and K. Dina, Trading Structure for Randomness in Wireless Opportunistic Routing, In Proceedings of ACM International Conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM), Kyoto, Japan, 27-31 August 2007, pp. 169--180.
[3]
S. Sudipta, R. Shravan and B. Suman, Network Coding-Aware Routing in Wireless Networking, IEEE/ACM Transactions on Networking, August 2010,18(4),pp. 1158--1170.
[4]
Y. Yuan, Y. Hao, H. Y. W. Starsky, L. Songwu and A. William, ROMER: Resilient Opportunistic Mesh Routing for Wireless Mesh Networks, In Proceedings of IEEE First International Workshop on Wireless Mesh Networks (WIMESH), Santa Clara, CA, USA, 26 September 2005, pp. 1--9.
[5]
K. Dimitrios, W. Chih-Chun and H. Y. Charlie, CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments, In Proceedings of IEEE International Conference on Information Communication (INFOCOM), San Diego, CA, USA, 14-19 March 2010, pp. 1--9.
[6]
C. Ling-Jyh, Y. Chen-Hung, S. Tony, C. Yung-Chih and C. Hao-hua, A Hybrid Routing Approach for Opportunistic Networks, In Proceedings of ACM International SIGCOMM Workshop on Challenged Networks (CHANTS), Pisa, Italy, 11-15 September 2006, pp. 213--220.
[7]
C. Coskun, Improving the efficiency of multipath traffic via opportunistic traffic scheduling, Elsevier Journal of Computer Networks, 6 June 2007, 51(8), pp. 2181--2197.
[8]
H. Haifeng and Q. Zhu, Power Control Based Cooperative Opportunistic Routing In Wireless Sensor Networks, Springer Journal of Electronics (China), January 2009, 26(1), pp. 52--63.
[9]
H. Zimian, Y. Wenzhong and W. Youhua, OM: Opportunistic Multicast Routing For Mobile Ad Hoc Networks, In Proceedings of IEEE Second International Conference on Network Infrastructure and Digital Content (IC-NIDC), Beijing, China, 24-26 September 2010, pp. 634--638.
[10]
T. Fani and T. Vassilis, Routing for Opportunistic Networks Based on Probabilistic Erasure Coding, In Proceedings of Springer Tenth International Conference on Wired/Wireless Internet Communications, LNCS Vol. 7277, Island of Santorini, Greece, 6-8 June 2012, pp. 257--268.
[11]
C. Kwan-Wu and L. Darryn, ROAR: A Multi-rate Opportunistic AODV Routing Protocol for Wireless Ad-Hoc Networks, In Proceedings of Springer Fifth International Conference on Ad hoc Networks and Wireless (ADHOC-NOW), LNCS Vol. 4104, Ottawa, Canada, 17-19 August 2006, pp. 87--100.
[12]
R. Eric, H. Mi Kyung, Q. Lili and Z.Yin, Model-driven Optimization of Opportunistic Routing, In Proceedings of ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), San Jose, California, USA, 7-11 June 2011, pp. 269--280.
[13]
C. Dukhyun, C. Kideok, C. Nakjung, K. T. Taekyoung and C. Yanghee, A probabilistic and opportunistic flooding algorithm in wireless sensor networks, Elsevier Journal of Computer Communications, 15 February 2012, 35(4), pp. 500--506.
[14]
B. Wang, C. Huang, L. Li and W. Yang, Trust-based minimum cost opportunistic routing for Ad hoc networks, Elsevier Journal of Systems and Software, December 2011, 84(12), pp. 2107--2122.
[15]
W. Yunsheng and W. Jie, A dynamic multicast tree based routing scheme without replication in delay tolerant networks, Elsevier Journal of Parallel and Distributed Computing, 3 March 2012, 72(3), pp. 424--436.
[16]
B. Abdoulmenim and C. T. Chun, An Opportunistic Multicast Routing Protocol for Wireless Mesh Networks, In Proceedings of IEEE Thirty Seventh Annual International Conference on Local Computer Networks (LCN), Clearwater, Florida, USA, 22-25 October 2012, pp. 288--291.
[17]
K. Byeong-Gi, P. Yong-Jin, K. Won-Tae, L. Soo-Hyung and H. Kim Jae, Opportunistic Multicast Routing for Cyber Physical Systems, In Proceedings of IEEE Region 10 Conference (TENCON), Cebu, Philippines, 19-22 November 2012, pp. 1--6.
[18]
W. Kaimin, L. Xiao and X. Ke, A Survey of Social-Aware Routing Protocols in Delay Tolerant Networks: Applications, Taxonomy and Design-Related Issues, IEEE Communications Surveys & Tutorials, 3 May 2013, pp. 1--23.
[19]
D. Amir, C. A. Llorenc and P. Vicent, Modeling and comparison of candidate selection algorithms in opportunistic routing, Elsevier Journal of Computer Networks, 15 September 2011, 55(13), pp. 2886--2898.
[20]
M. Alessandro, M. Giacomo, S. Paolo and S. Julinda, Social-Aware Stateless Forwarding in Pocket Switched Networks, In Proceedings of IEEE International Conference on Information Communications (INFOCOM), Shanghai, China, 10-15 April 2011, pp. 251--255.

Cited By

View all
  • (2023)Efficacious implementation of deep Q-routing in opportunistic networkSoft Computing10.1007/s00500-023-08442-z27:14(9459-9477)Online publication date: 22-May-2023
  • (2022)Routing Protocols in an Opportunistic Network: A SurveyComputer Networks, Big Data and IoT10.1007/978-981-19-0898-9_14(185-195)Online publication date: 22-May-2022
  • (2022)Peculiar Effectual Approach: Q-Routing in Opportunistic NetworkProceedings of International Conference on Industrial Instrumentation and Control10.1007/978-981-16-7011-4_58(609-615)Online publication date: 15-Feb-2022

Index Terms

  1. Agent-based multicast opportunistic routing protocol for wireless networks

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    HP-MOSys '13: Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systems
    November 2013
    98 pages
    ISBN:9781450323727
    DOI:10.1145/2507908
    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]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 03 November 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. agent-based routing
    2. multicast routing protocols
    3. opportunistic networks
    4. success packet transmission-reception
    5. wireless ad hoc networks

    Qualifiers

    • Research-article

    Conference

    MSWiM '13
    Sponsor:

    Acceptance Rates

    HP-MOSys '13 Paper Acceptance Rate 13 of 35 submissions, 37%;
    Overall Acceptance Rate 13 of 35 submissions, 37%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 23 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Efficacious implementation of deep Q-routing in opportunistic networkSoft Computing10.1007/s00500-023-08442-z27:14(9459-9477)Online publication date: 22-May-2023
    • (2022)Routing Protocols in an Opportunistic Network: A SurveyComputer Networks, Big Data and IoT10.1007/978-981-19-0898-9_14(185-195)Online publication date: 22-May-2022
    • (2022)Peculiar Effectual Approach: Q-Routing in Opportunistic NetworkProceedings of International Conference on Industrial Instrumentation and Control10.1007/978-981-16-7011-4_58(609-615)Online publication date: 15-Feb-2022

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media