Skip to main content
Log in

Opportunistic Routing in Presence of Selfish Nodes for MANET

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Opportunistic Routing protocols use broadcast nature of wireless communication to improve packet delivery from source to destination in mobile ad hoc network (MANET). In traditional routing protocols for MANET, each node uses the best neighbor for forwarding packet to destination. In opportunistic routing, a node selects and prioritizes multiple nodes which can act as potential packet forwarders. Similar to traditional routing protocols, opportunistic routing assumes that all nodes participating in the network are honest and cooperative. However, this is practically difficult in an open MANET. Few nodes participating in the network may behave selfishly; these nodes drop packets and do not offer service to other nodes. Such behavior exhibited by the nodes may cause a collapse of MANET communication. The selfish behavior attack is addressed by researchers for many existing MANET routing protocols. There are just a few works, which address selfish nodes attack for opportunistic routing protocols. The paper proposes an opportunistic routing protocol which can overcome the presence of selfish nodes. The proposed protocol discovers reliable candidate nodes for packet forwarding using a new metric called ‘path goodness’. The path goodness metric takes into account trustworthiness of the nodes on a path to the destination. The protocol decides trustworthiness of the nodes using packet forwarding behavior of the nodes. The work is a trust based extension of CORMAN opportunistic routing protocol. Simulation results show that, the proposed opportunistic routing protocol improves the packet delivery ratio by approximately 10 % in the presence of selfish nodes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. Perkins, C. E., & Royer, E. M. (1999). Ad hoc on-demand distance vector routing. In Proceedings of workshop mobile computing systems and applications, pp. 90–100.

  2. Johnson, D. B., Maltz, D. A., & Broch, J. (2001). DSR: The dynamic source routing protocol for multihop wireless ad hoc networks. In Ad hoc networking, (pp. 139–172). Reading: Addison-Wesley.

  3. Marina, M. K., & Das, S. R. (2001). On-demand multipath distance vector routing in ad hoc networks. In Ninth international conference on network protocols, pp. 14–23.

  4. Biswas, S., & Morris, R. (2005). ExOR: Opportunistic multi-hop routing for wireless networks. In Proceedings of conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM ’05), ACM, New York, NY, USA, pp. 133–144.

  5. Liu, H., Zhang, B., Mouftah, H. T., Shen, X., & Ma, J. (2009). Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions. IEEE Communications Magazine, 47(12), 103–109.

    Article  Google Scholar 

  6. Du, X., Liu, Y.-A., Liu, K.-M., Tang, B.-H., & Chen, X. (2013). Throughput oriented forwarders selection analysis for opportunistic routing in wireless mesh network. The Journal of China Universities of Posts and Telecommunications, ISSN 1005–8885. 20(2), 73–78.

  7. Hsu, C.-J., Liu, H.-I., & Seah, W. K. G. (2011). Opportunistic routing: A review and the challenges ahead. Computer Networks, ISSN 1389–1286, 55(15), 3592–3603.

  8. Wang, Z., Chen, Y., & Li, C. (2012). CORMAN: A novel cooperative opportunistic routing scheme in mobile ad hoc networks. IEEE Journal on Selected Areas in Communications, 30(2), 289–296.

    Article  Google Scholar 

  9. Djahel, S., Nait-abdesselam, F., & Zhang, Z. (2011). Mitigating packet dropping problem in mobile ad hoc networks: Proposals and challenges. IEEE Communications Surveys & Tutorials, 13(4), 658–672.

    Article  Google Scholar 

  10. Li, X., Jia, Z., Zhang, P., Zhang, R., & Wang, H. (2010). Trust-based on-demand multipath routing in mobile ad hoc networks. IET Information Security, 4(4), 212–232.

    Article  MathSciNet  Google Scholar 

  11. Xia, H., Jia, Z., Ju, L., & Zhu, Y. (2011). Trust management model for mobile ad hoc network based on analytic hierarchy process and fuzzy theory. IET Wireless Sensor Systems, 1(4), 248–266.

    Article  Google Scholar 

  12. Zhao, H., Yang, X., & Li, X. (2013). Trust management in cyclic mobile ad hoc networks. IEEE Transactions on Vehicular Technology, 62(6), 2792–2806.

    Article  Google Scholar 

  13. Rozner, E., Seshadri, J., Mehta, Y., & Qiu, L. (2009). SOAR: Simple opportunistic adaptive routing protocol for wireless mesh networks. IEEE Transactions on Mobile Computing, 8(12), 1622–1635.

    Article  Google Scholar 

  14. Bo, W., Chuanhe, H., Layuan, L., & Wenzhong, Y. (2011). Trust-based minimum cost opportunistic routing for ad hoc networks. Journal of Systems and Software, 84(12), 2107–2122, ISSN 0164-1212.

  15. Zhong, Z., & Nelakuditi, S. (2007, June). On the efficacy of opportunistic routing. In 4th annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks, SECON ’07, pp. 441–450, 18–21.

  16. Zeng, K., Yang, Z., & Lou, W. (2009). Location-aided opportunistic forwarding in multirate and multihop wireless networks. IEEE Transactions on Vehicular Technology, 58(6), 3032–3040.

    Article  Google Scholar 

  17. Zuo, J., Dong, C., Nguyen, H. V., Ng, S. X., Yang, L.-L., & Hanzo, L. (2014). Cross-layer aided energy-efficient opportunistic routing in ad hoc networks. IEEE Transactions on Communications, 62(2), 522–535.

  18. Mao, X., Tang, S., Li, X., & Ma, H. (2011). Energy-efficient opportunistic routing in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 22(11), 1934–1942.

    Article  Google Scholar 

  19. Shen, H., Bai, G., Tang, Z., & Zhao, L. (2014). QMOR: QoS-aware multi-sink opportunistic routing for wireless multimedia sensor networks. Wireless Personal Communications Journal, 75, 1307–1330.

    Article  Google Scholar 

  20. Li, F., & Jie, W. (2010). Uncertainty modeling and reduction in MANETs. IEEE Transactions on Mobile Computing, 9(7), 1035–1048.

    Article  Google Scholar 

  21. Myung, J., & Lee, W. (2012). Eliminating duplicate forwarding in wireless opportunistic routing. IEEE Communications Letters, 16(4), 510–513.

    Article  Google Scholar 

  22. Ajmal, M. M., Madani, S. A., Maqsood, T., Bilal, K., Nazir, B., & Hayat, K. (2013). Coordinated opportunistic routing protocol for wireless mesh networks. Computers & Electrical Engineering, ISSN 0045–7906, 39(8), 2442–2453.

  23. Othmana, J. B., & Mokdadb, L. (2010). Enhancing data security in ad hoc networks based on multipath routing. Elsevier Journal of Parallel Distributed Computing, 70, 309–316.

    Article  Google Scholar 

  24. El Defrawy, K., & Tsudik, G. (2011). ALARM: Anonymous location-aided routing in suspicious MANETs. IEEE Transactions on Mobile Computing, 10(9), 1345–1358.

    Article  Google Scholar 

  25. Gunasekaran, M., & Premalatha, K. (2013). TEAP: Trust-enhanced anonymous on-demand routing protocol for mobile ad hoc networks. IET Information Security, 7(3), 203–211.

    Article  Google Scholar 

  26. Cordasco, J., & Wetzel, S. (2008). Cryptographic versus trust-based methods for manet routing security. Electronic Notes in Theoretical Computer Science, 197(2), 131–140.

    Article  Google Scholar 

  27. Zhizhong, J., Chuanhe, H., Liya, X., Bo, W., Xi, C., & Xiying, F. (2012, October). A trusted opportunistic routing algorithm for VANET. In Third International Conference on Networking and Distributed Computing (ICNDC), pp. 86–90.

  28. Wang, Z., Chen, Y., & Li, C. (2014). PSR: A lightweight proactive source routing protocol for mobile ad hoc networks. IEEE Transactions on Vehicular Technology, 63(2), 859–868.

    Article  Google Scholar 

  29. Li, Y., Chen, W., & Zhang, Z. L. (2009). Optimal forwarder list selection in opportunistic routing. In IEEE 6th international conference on mobile adhoc and sensor systems, MASS’09, pp. 670–675.

  30. http://www.isi.edu/nsnam/ns/.

  31. Fouchal, H., Hunel, P., & Ramassamy, C. (2014). Towards efficient deployment of wireless sensor networks. Special issue paper in Security and Communication Networks. New York: Wiley.

  32. Darehshoorzadeh, A., Cerd-Alabern, L., & Pla, V. (2011, September). Modeling and comparison of candidate selection algorithms in opportunistic routing. Computer Networks, ISSN 1389–1286, 55(13), 2886–2898.

  33. Sun, Y., Han, Z., & Liu, K. J. R. (2008). Defense of trust management vulnerabilities in distributed networks. IEEE Communications Magazine, 46(2), 112–119.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sandeep A. Thorat.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Thorat, S.A., Kulkarni, P.J. Opportunistic Routing in Presence of Selfish Nodes for MANET. Wireless Pers Commun 82, 689–708 (2015). https://doi.org/10.1007/s11277-014-2247-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-014-2247-4

Keywords

Navigation