Overcoming the Limitations of Classical Routing Algorithms by d-adaptOR Algorithm

B. Rakesh*, Allu Jhansi**
* Assistant Professor, Department of Computer Science and Systems Engineering, Sree Vidyanikethan Engineering College (Autonomous), Tirupati, India.
** UG Scholar, Department of Computer Science and Systems Engineering, Sree Vidyanikethan Engineering College (Autonomous), Tirupati, India.
Periodicity:October - December'2016
DOI : https://doi.org/10.26634/jwcn.5.3.10345

Abstract

Many routing algorithms were proposed in wireless ad hoc networks. The main disadvantage of those algorithms is, we need to have reliable knowledge about the network, and also expected average per packet reward criterion is also high. In this paper, the authors have discussed about d-AdaptOR algorithm which doesn't need reliable knowledge about the network structure and channel statistics. This scheme reduces the average per packet reward criterion. This scheme is also advantageous than the classical routing algorithms when we want to broadcast a packet. In this scheme, the next relay node depending upon Estimated Best Score (EBS) has been selected. This algorithm explores and exploits the opportunities in the network. This scheme jointly tackles the problem of learning and routing in an opportunistic context, where the network model is characterized by the transmission success probabilities.

Keywords

Routing, Adaptive, EBS, Reinforcement Learning, Opportunistic

How to Cite this Article?

Rakesh, B., and Jhansi, A. (2016). Overcoming the Limitations of Classical Routing Algorithms by d-adaptOR Algorithm. i-manager's Journal on Wireless Communication Networks, 5(3), 15-20. https://doi.org/10.26634/jwcn.5.3.10345

References

[1]. Abhijeet A. Bhorkar, Mohammad Naghshvar, Tara Javidi and Bhaskar D. Rao, (2012). “Adaptive Opportunistic Routing for Wireless Adhoc Networks”. IEEE/ACM Transactions on Networking, Vol.20, No.1, pp.243-256.
[2]. C. Lott and D. Teneketzis, (2000). “Stochastic routing in th ad hoc wireless networks”. In Proc. 39 IEEE Conf. Decision Control, Vol.3, pp.2302-2307.
[3]. P. Larsson, (2001). “Selection diversity forwarding in a multi hop packet radio network with fading channel and capture”. Mobile Comput. Commun. Rev., Vol.2, No.4, pp.47-54.
[4]. M. Zorzi and R.R. Rao, (2003). “Geographic Random Forwarding (GeRaF) for ad hoc and sensor networks: Multihop performance”. IEEE Trans. Mobile Comput., Vol.2, No.4, pp.337-348.
[4]. M. Zorzi and R.R. Rao, (2003). “Geographic Random Forwarding (GeRaF) for ad hoc and sensor networks: Multihop performance”. IEEE Trans. Mobile Comput., Vol.2, No.4, pp.337-348.
[6]. S. Jain and S. R. Das, (2005). “Exploiting path diversity th in the link layer in wireless ad hoc networks”. In Proc. 6 IEEE WoWMoM, pp.22-30.
[7]. C. Lott and D. Teneketzis, (2006). “Stochastic routing in ad hoc networks”. IEEE Trans. Autom. Control, Vol.51, No.1, pp.52-72.
[8]. E.M. Royer and C.K. Toh, (1999). “A review of current routing protocols for ad hoc mobile wireless networks”. IEEE Pers.Commun., Vol.6, No.2, pp.46-55.
[9]. T. Javidi and D. Teneketzis, (2004). “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.
[10]. J. N. Tsitsiklis, (1993). “Asynchronous stochastic nd approximation and Q-learning”. In Proc. 32 IEEE Conf. Decision Control, Vol.1, pp.395-400.
[11]. P. Gupta and T. Javidi, (2007). “Towards throughput and delay optimal routing for wireless ad hoc networks”. In Proc. Asilomar Conf., pp.249-254.
[12]. M.J. Neely, (2006). “Optimal back pressure routing for wireless networks with multi-receiver diversity”. In Proc. CISS, pp.18-25.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Online 15 15

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.