A Support framework To Enable the Nodes to Adapt Their Routing Strategies

D. Madhavi Latha, K.N.S.L. Kumar

Abstract


An opportunistic routing algorithm adopts no awareness about the channel statistics and network, but practices a reinforcement learning framework in order to qualify the nodes to familiarize their routing strategies, and optimally activities the statistical opportunities and receiver diversity. The proposed arrangement utilizes a reinforcement learning framework to resourcefully route the packets level in the lack of dependable acquaintance about channel statistics and network model. The suggested routing scheme equally reports the issues of learning and routing in an opportunistic background, where the network assembly is considered by the transmission achievement chances.


References


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.

P. Larsson, “Selection diversity forwarding in a multihop packet radionetwork with fading channel and capture,†Mobile Comput. Commun.Rev., vol. 2, no. 4, pp. 47–54, Oct. 2001.

M. Zorzi and R. R. Rao, “Geographic random forwarding (GeRaF) forad hoc and sensor networks:Multihop performance,†IEEE Trans. MobileComput., vol. 2, no. 4, pp. 337–348, Oct.–Dec. 2003.

S. Biswas and R. Morris, “ExOR: Opportunistic multi-hop routing forwireless networks,†Comput. Commun. Rev., vol. 35, pp. 33–44, Oct.2005.

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

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

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

T. Javidi and D. Teneketzis, “Sensitivity analysis for optimal routingin 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.

J. N. Tsitsiklis, “Asynchronous stochastic approximation andQ-learning,†in Proc. 32nd IEEE Conf. Decision Control, Dec.1993, vol. 1, pp. 395–400.

J. Boyan and M. Littman, “Packet routing in dynamically changingnetworks: A reinforcement learning approach,†in Proc. NIPS, 1994,pp. 671–678.


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.

Â