Routing packets opportunistically is an essential part of multihop ad hoc wireless sensor networks. The existing routing techniques are not adaptive opportunistic. In this paper we have proposed an adaptive opportunistic routing scheme that routes packets opportunistically in order to ensure that packet loss is avoided. Learning and routing are combined in the framework that explores the optimal routing possibilities. In this paper we implemented this Reinforced learning framework using a customer simulator. The experimental results revealed that the scheme is able to exploit the opportunistic to optimize routing of packets even though the network structure is unknown.

 

Published In : IJCSN Journal Volume 2, Issue 5

Date of Publication : 01 October 2013

Pages : 19 - 23

Figures : 07

Tables : 01

Publication Link : ijcsn.org/IJCSN-2013/2-5/IJCSN-2013-2-5-22.pdf

 

 

 

G.Srinivas Rao : received his B Tech in Computer Science and Engineering from Jawaharlal Nehru Technological University, Hyderabad, A.P, INDIA. in 2010 and pursing M.Tech in GMRIT, Rajam, A.P, India. His area of interest is Wireless Networks.

A.V. Ramana : obtained the MCA Degree from Andhra University ,Visakhapatnam ,A.P ,India. Obtained M.E degree from Anna Univeristy . He is presently working as Assistant Professor in GMR Institute of Technology, Rajam, AP, India. His area of interest is Mobile Networks and wireless Networks.

 

 

 

 

 

 

 

 

 

 

Reinforcement Learning

Network

Opportunistic Routing

Wireless Sensor Networks

 

 

 

 

 

In this paper we implemented Adaptive Opportunistic routing proposed by Bhorkar et al. [8] using a Java custom simulator. Though zero knowledge is assumed about the channel statistics and topology, the scheme is capable of exploring and exploiting adaptive opportunistic routing possibilities in order to reduce the average per-packet cost. This is achieved by providing rewards to the nodes that perform well in packet routing. The proposed simulator is capable of demonstrating the proof of concept with respect to opportunistic routing. The empirical results revealed that the distributed nature of algorithm along with reward system has produced best results in routing of packets.

 

 

 

 

 

 

 

 

 

[1] M. Zorzi and R. R. Rao, “Geographic random forwarding (GeRaF) for ad hoc and sensor networks:Multihop performance,” IEEE Trans. Mobile Comput., vol. 2, no. 4, pp. 337–348, Oct.–Dec. 2003.

[2] S. Biswas and R. Morris, “ExOR: Opportunistic multihop routing for wireless networks,” Comput. Commun.Rev., vol. 35, pp. 33–44, Oct. 2005.

[3] S. Jain and S. R. Das, “Exploiting path diversity in the link layer in wireless ad hoc networks,” in Proc. 6th IEEE WoWMoM, Jun. 2005, pp. 22–30.

[4] C. Lott and D. Teneketzis, “Stochastic routing in ad hoc networks,” IEEE Trans. Autom. Control, vol. 51, no. 1, pp. 52–72, Jan. 2006.

[5] E. M. Royer and C. K. Toh, “A review of current routing protocols for ad hoc mobile wireless networks,” IEEE Pers. Commun., vol. 6, no. 2, pp. 46–55, Apr. 1999.

[6] P. Larsson, “Selection diversity forwarding in a multihop packet radio network with fading channel and capture,” Mobile Comput. Commun. Rev., vol. 2, no. 4, pp. 47–54, Oct. 2001.

[7] T. Javidi and D. Teneketzis, “Sensitivity analysis for optimal routing in wireless ad hoc networks in presence of error in channel quality estimation,” IEEE Trans. Autom. Control, vol. 49, no. 8, pp. 1303–1316, Aug. 2004.

[8] Abhijeet A. Bhorkar, Mohammad Naghshvar, , Tara Javidi, and Bhaskar D. Rao, Fellow., 2012. “Adaptive Opportunistic Routing for Wireless Ad Hoc Networks”. IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 20, NO. 1, FEBRUARY 2012.