|
|
 |
| |
|
|
|
Shortest Paths Routing Problem in MANETs |
|
|
|
PP: 1885-1891 |
|
|
|
doi:10.18576/amis/100530
|
|
|
|
Author(s) |
|
|
|
Hamdy H. El-Sayed,
|
|
|
|
Abstract |
|
|
| The need for communication services is rapidly increasing, because the mobile communication service is synonymous with
an ideal communication style realizing communication anytime, anywhere and with anyone. The availability of a path depends on the
number of links and the reliability of each link forming the path. Many routing metrics in terms of number of links have been proposed,
such as the shortest path routing. Shortest path routing selects a path having minimum cost to forward the data to the destination node.
Shortest path routing algorithm selection depends on direct traffic form source to destination, maximizing the network performance
and minimizing the cost. Performance of the network can be enhanced through shortest path routing but it also depends upon the
functionality of the routing protocol and the parameters that are selected for the shortest path routing. The primary goal of such an adhoc
network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a
timely manner. Route construction should be done with a minimum of cost, overhead and bandwidth consumption. Some of researchers
explored the concept of shortest path routing over ad hoc network. Each one uses his own parameters with different topology. No one
uses all parameters. In this paper, we will discuss the solutions ideas that have been proposed by them. |
|
|
|
|
|
|
|
