Authors
Abstract
To send the packets from source to destination node on optimum route in mobile network,
the router must find the path with minimum cost. If intermediate node has fialed, the routing
table will be updated and the path should be changed depending on this failure.
In traditional protocols, the packet is sent on the path with minimum number of hops and
this path is not always optimum, therefore the router selects the path depending on
computing cost for each link and send the packets on path with minimum consumption
energy, maximum capacity or minimum delay. If there is failure node in the path or no,
computing the optimum path in minimum cost is more suitable and efficient than the path
with minimum number of hops. Dijkastra's algorithm is used to find optimum path and
depending on this algorithm, routing table will be built.
Keywords
)
