Mobility

Probabilistic Routing Using Queuing Theory for MANETs

Download Now Free registration required

Executive Summary

Mobile ad-hoc networks pose real difficulty in finding the multihop shortest paths because of continuous changing positions of the nodes. Traditional ad-hoc routing protocols are proposed to find multi-hop routes based on shortest path routing algorithms, which cannot effectively adapt to time-varying radio links and network topologies of Ad-hoc networks. In this paper, the authors proposed an enhanced routing algorithm, which uses probabilistic approach for the stability of the neighboring nodes in finding and maintaining the routing paths in Ad-hoc networks.

  • Format: PDF
  • Size: 383 KB