EVALUATION OF ASSOCATION RULE-BASED ROUTING PROTOCOL FOR OPPNET

Renu Dalal, Manju Khari, Aakash Kumar, and Deepak K. Sharma

View Full Paper

References

  1. [1] K. Fall, A delay-tolerant network architecture for challenged internets, In Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2003, 27–34.
  2. [2] R. Dalal, Y. Singh, and M. Khari, A review on key management schemes in MANET, International Journal of Distributed and Parallel Systems, 3(4), 165, 2012.
  3. [3] R. Dalal, M. Khari, and Y. Singh, Different ways to achieve Trust in MANET, International Journal on AdHoc Networking Systems (IJANS), 2(2), 2012, 53–64.
  4. [4] R. Dalal, M. Khari, and Y. Singh, Survey of trust schemes on adhoc network, in International Conference on Computer Science and Information Technology (Springer, Berlin, Heidelberg, 2012), 170–180.
  5. [5] R. Dalal, M. Khari, and Y. Singh, Authenticity check to provide trusted platform in MANET (ACTP), in Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology, 2012, 647–655. 78
  6. [6] R. Dalal and M. Khari, The new approach to provide trusted platform in MANET, International Journal of Security, Privacy and Trust Management (IJSPTM), 1, 2012, 6.
  7. [7] Z. Zhang, Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges, IEEE Communications Surveys & Tutorials, 8(1), 2006, 24–37.
  8. [8] L. Lilien, Z. H. Kamal, V. Bhuse, and A. Gupta, Opportunistic networks: the concept and research challenges in privacy and security, Proc. of the WSPWN, 2006, 134–147.
  9. [9] S. Trifunovic et al., A decade of research in opportunistic networks: challenges, relevance, and future directions, IEEE Communications Magazine, 55(1), 2017, 168–173.
  10. [10] R. Dalal, and M. Khari, Empirical analysis of routing protocols in opportunistic network, in Research in Intelligent and Computing in Engineering (Springer, Singapore, 2021), 695–703.
  11. [11] A. Elwhishi and P.-H. Ho, Sarp-a novel multi-copy routing protocol for intermittently connected mobile networks, in Global Telecommunications Conference, GLOBECOM (IEEE, 2009), 1–7.
  12. [12] A. Vahdat, and D. Becker, Epidemic Routing for Partially Connected Ad Hoc Networks, 2000.
  13. [13] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, Spray and wait: an efficient routing scheme for intermittently connected mobile networks, in Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, 2005, 252–259.
  14. [14] M. Abbas, N. H. M. Yusof, and N. Fisal, Performance evaluation of Binary Spray and Wait OppNet protocol in the context of emergency scenario, in 2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops), 2013, 517–522.
  15. [15] A. Lindgren, A. Doria, and O. Schelen, Probabilistic routing in intermittently connected networks, in Service Assurance with Partial and Intermittent Resources (Springer, Berlin, Heidelberg, 2004), 239–254.
  16. [16] M. K. Denko (Ed.) Mobile Opportunistic Networks: Architectures, Protocols and Applications (CRC Press, 2016).
  17. [17] C. M. Huang, K. C. Lan, and C. Z. Tsai, A survey of opportunistic networks, in 22nd International Conference on Advanced Information Networking and Applications-Workshops (Aina Workshops), 2008, 1672–1677.
  18. [18] M. Musolesi, S. Hailes, and C. Mascolo, Adaptive routing for intermittently connected mobile ad hoc networks, in Sixth IEEE International Symposium on a World of wireless mobile and multimedia networks, Sixth IEEE International Symposium on IEEE.005. WoWMoM 2005, 2005, 183–189.
  19. [19] J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, Maxprop: Routing for vehicle-based disruption-tolerant networks, in Proceedings of the 25th IEEE International Conference on Computer Communications, INFOCOM 2006 (IEEE, 2006), 1–11.
  20. [20] S. Jain, K. Fall, and R. Patra, Routing in a delay tolerant network, in Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2004, 145–158.
  21. [21] K. Tan, Q. Zhang, and W. Zhu, Shortest path routing in partially connected ad hoc networks, in Global Telecommunications Conference, GLOBECOM 2003 (IEEE, Vol. 2, 2003), 1038–1042.
  22. [22] R. Ciobanu, C. Dobre, and V. Cristea, SPRINT: Social prediction-based opportunistic routing, in 2013 IEEE 14th International Symposium and Workshops: World of Wireless, Mobile and Multimedia Networks, 2013, 1–7.
  23. [23] C. Boldrini, M. Conti, J. Jacopini, and A. Passarella, Hibop: A history based routing protocol for opportunistic networks, In 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (IEEE, 2007), 1–12.
  24. [24] S. Kumaram, S. Srivastava, and D. K. Sharma, Neural networkbased routing protocol for opportunistic networks with intelligent water drop optimization, International Journal of Communication Systems, 33(8), 2020, e4368.
  25. [25] R. Agrawal, T. Imieliski, and A. Swami, Mining association rules between sets of items in large databases, in Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 1993, 207–216.
  26. [26] Q. Zhao, and S. S. Bhowmick, Association rule mining: A survey. Nanyang Technological University, Singapore, 2003, 135.
  27. [27] A. Kernen, J. Ott, and T. Krkkinen, The ONE simulator for DTN protocol evaluation, in Proceedings of the 2nd International Conference on Simulation Tools and Techniques, 2009, 1–10.
  28. [28] A. M. Mughal and K. Iqbal, Optimization of biomechanical sts movement with linear matrix inequalities, Mechatronic Systems and Control, 47(1), 2019, 1–11.
  29. [29] A. E. Jajarm, A. H. Abolmasoumi, and H. R. Momeni, Intelligent fuzzy improvement of non-singular terminal slidingmode control, Mechatronic Systems and Control, 47(1), 2019, 12–17.
  30. [30] H. Li, S. Zhang, J. Shi, and Y. Hu, Research and Design of Intelligent Learning System based on Recommendation Technology.

Important Links:

Go Back