Thamir Rashed; Emad Shehab; Dalia Kamal
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 routingtable ...
Read More ...
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 routingtable 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 andthis path is not always optimum, therefore the router selects the path depending oncomputing cost for each link and send the packets on path with minimum consumptionenergy, 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 pathwith minimum number of hops. Dijkastra's algorithm is used to find optimum path anddepending on this algorithm, routing table will be built.
