Title: Application of Dijkstra’s Algorithm in Wireless Communication System
Abstract: This paper presents the implementation of Dijkstra's algorithm to find the shortest path in real time especially in wireless communication network. Wireless communication network consists a large number of sensor nodes (transmit and receiving proto-col nodes) scattered in an environment to collect the protocol regarding the environment. Every sensor node has a specific range to send the protocol to the destination so the protocol is sent by nodes through the use of routing algorithm (shortest path algorithm). The suitable algorithm should be accurate operation, stability, simplicity, equity and optimality which all characteristics are present in the Dijkstra's algorithm. The most important feature of these sensor networks is the presence of dynamic topo-logy and which leads the mobility of the nodes. This mobility needs a routing capable of adapting to these changes. This makes the weak protocol to travel and hence fading occurs. So using of Dikstra's algorithm will solve the problem of fading in wireless communication system