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.
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 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.Google Scholar
Index Terms
- Agent-based multicast opportunistic routing protocol for wireless networks
Recommendations
A weight-based clustering multicast routing protocol for mobile ad hoc networks
In mobile ad hoc networks, the mobile nodes can move arbitrarily without any centralised management mechanism. The topology of these networks can be very dynamic due to the mobility of mobile nodes. Under such changeable network topology, multicasting ...
Heuristic Routing Protocol Research on Opportunistic Networks
HPCC '12: Proceedings of the 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and SystemsOpportunistic network is a kind of ad hoc networks which exploits the nodes' meeting opportunities to transmit messages. Routing protocols have a great impact on the efficiency of data transmitting in opportunistic networks, but common routing protocols ...
Exploring optimised route selection strategy in tree- and mesh-based multicast routing in MANETs
Mobile ad hoc networks are collections of mobile nodes with dynamism forming a momentary network, with no pre-existing network infrastructure or centralised administration. Disaster relief, education and armed forces are widespread situations where ...
Comments