Opportunistic Routing (OR) is the latest strategy of routing in wireless sensor networks in which the nearer node to the target is selected for transferring the data. OR may immensely enhance the performance parameters like efficiency, throughput, and reliability by selecting best next hop in Opportunistic Protocol. In OR, a candidate set is chosen which serves the purpose of a potential group of nodes for packet forwarding. This paper presents the literature review of various opportunistic routing protocols. The tabular representation of various OR protocols on the basis of End-to-End delay, energy Efficiency, packet duplication and forwarding list selection is depicted in this paper. The comparative analysis of various opportunistic routing protocols has been given in this paper.

Wireless Sensor Networks, Routing, Opportunistic Routing

[1] I. F. Akyildiz and I. H. Kasimoglu, “Wireless sensor and actor q networks : research challenges qq,” vol. 2, pp. 351–367, 2004.
[2] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks : a survey,” vol. 38, pp. 393–422, 2002.
[3] J. N. Al-Karaki and a. E. Kamal, “Routing Techniques in Wireless Sensor Networks: A Survey,” IEEE Wirel. Commun., vol. 11, no. 6, pp. 6–28, 2004.
[4] C. M. Huang, K. C. Lan, and C. Z. Tsai, “A survey of opportunistic networks,” Proc. - Int. Conf. Adv. Inf. Netw. Appl. AINA, pp. 1672–1677, 2008.
[5] S. Biswas and R. Morris, “Opportunistic routing in multi-hop wireless networks,” SIGCOMM Comput. Commun. Rev., vol. 34, no. 1, pp. 69–74, 2004.
[6] A. P. Mazumdar and A. S. Sairam, “PBFS: A technique to select forwarders in opportunistic routing,” IEEE Reg. 10 Annu. Int. Conf. Proceedings/TENCON, no. i, pp. 149–153, 2011.
[7] D. S. J. D. E. Couto, D. Aguayo, J. Bicket, and R. Morris, “A High-Throughput Path Metric for Multi-Hop Wireless Routing,” pp. 419–434, 2005.
[8] M. Zorzi and R. R. Rao, “Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Multihop performance,” IEEE Trans. Mob. Comput., vol. 2, no. 4, pp. 337–348, 2003.
[9] Y. Li, W. Chen, and Z. L. Zhang, “Optimal forwarder list selection in opportunistic routing,” 2009 IEEE 6th Int. Conf. Mob. Adhoc Sens. Syst. MASS ’09, pp. 670–675, 2009.
[10] Y. Liu, L. X. Cai, and X. S. Shen, “Spectrum-aware opportunistic routing in multi-hop cognitive radio networks,” IEEE J. Sel. Areas Commun., vol. 30, no. 10, pp. 1958–1968, 2012.
[11] X. Mao, S. Member, S. Tang, and S. Member, “Energy-Efficient Opportunistic Routing in Wireless Sensor Networks,” vol. 22, no. 11, pp. 1934–1942, 2011.
[12] “Multi-Channel Opportunistic Routing in Multi-Hop Wireless Networks.” [Online]. Available: https://edoc.hu-berlin.de/handle/18452/3119. [Accessed: 05-Feb-2018].
[13] X. Zhang and B. Li, “Optimized Multipath Network Coding in LossyWireless Networks,” Ieee J. Sel. Areas Commun., vol. 27, no. 5, pp. 622–634, 2009.
[14] E. Rozner, J. Seshadri, Y. A. M. Mehta, and L. Qiu, “{SOAR}: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks,” IEEE Trans. Mob. Comput., vol. 8, no. 12, pp. 1622–1635, 2009.
[15] Y. Yuan, H. Yang, S. H. Y. Wong, S. Lu, and W. Arbaugh, “ROMER : Resilient Opportunistic Mesh Routing for Wireless Mesh Networks,” IEEE 1st Work. Wirel. mesh networks, 2005.