Devised Opportunistic Routing With Congestion Control Policy in Wireless Adhoc Networks

Devised Opportunistic Routing With Congestion Control Policy in Wireless Adhoc Networks

  IJCOT-book-cover
 		 International Journal of Computer & Organization Trends  (IJCOT)          
 
© 2017 by IJCOT Journal
Volume - 7 Issue - 5
Year of Publication : 2017
Authors :  Roopalakshmi S, Noor Basha, Anil Kumar

Citation

Roopalakshmi S, Noor Basha, Anil Kumar "Devised Opportunistic Routing With Congestion Control Policy in Wireless Adhoc Networks", International Journal of Computer & organization Trends (IJCOT), V7(5):19-23 Sep - Oct 2017, ISSN:2249-2593, www.ijcotjournal.org. Published by Seventh Sense Research Group.

Abstract

The rapid advances in wireless Ad-hoc environment enables a profound of users. The data transmission via multi-hop networks creates huge traffic in opportunistic routing. To overcome from this issue, a devised opportunistic routing with congestion control policy is studied. We have proposed OR based DTMC scheme that deals with behavioral study of cooperative and non-cooperative nodes. The task of opportunistic routing is to deliver the packets in reliable and secured manner. The objective is to design routing protocols that supports noncooperative nodes of wireless environment. We estimate packet drop ratio to observe the action of nodes and detect the congestion establishing nodes. The set of each node is selected and various parameters are considered to improve the possibility of delivering packets to their final endpoint. An experimental outcome shows the efficacy of the proposed system.

References

[1] C. Lott and D. Teneketzis, “Stochastic routing in ad hoc wireless networks,” in Proc. 39th IEEE Conf. Decision Control, 2000, vol. 3, pp. 2302–2307, vol. 3.
[2] 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.
[3] 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.
[4] M. Zorzi and R. R. Rao, “Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance,” IEEE Transactions on Mobile Computing, vol. 2, no. 4, 2003.
[5] S. Biswas and R. Morris, “ExOR: Opportunistic Multi hop Routing for Wireless Networks,” ACM SIGCOMM Computer Communication Review, vol. 35, pp. 3344, October 2005.
[6] C. Lott and D. Teneketzis, “Stochastic routing in ad hoc networks,” IEEE Trans. Autom. Control, vol. 51, no. 1, pp. 52–72, Jan. 2006.
[7] 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.
[8] 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.
[9] J. N. Tsitsiklis, “Asynchronous stochastic approximation and Q-learning,” in Proc. 32nd IEEE Conf. Decision Control, Dec. 1993, vol. 1, pp. 395–400.
[10] J. Boyan and M. Littman, “Packet routing in dynamically changing networks: A reinforcement learning approach,” in Proc. NIPS, 1994, pp. 671–678.
[11] J. W. Bates, “Packet routing and reinforcement learning: Estimating shortest paths in dynamic graphs,” 1995, unpublished.

Keywords
Wireless Adhoc networks, Multi-hop networks, Opportunistic routing, Non-Cooperative nodes and Packet drop ratio.