Performance Measurement Using Different Shortest Path Techniques in Wireless Sensor Network

Computers are being essential part of our daily lives. Different solutions came into existence for exchanging information. One of the suited networks based on wireless standard is wireless sensor networks (WSN). These networks comprise of nodes which are randomly distributed in any environment. They operate over radio frequency and possess a number of characteristics features. Some of the constraints include energy management, deployment and security. As energy is the main key constraint, shortest path algorithms aim at consumption of minimum amount of energy. In this paper, we measure performance of different shortest path algorithms such as Dijkstra's, Bellman Ford, Distance vector, Random node selection etc. Formulation of results has been carried out over MATLAB.