Performance Analysis: Tree and Graph Based Topology Control Algorithms in Wireless Sensor Networks

A wireless sensor network is a wireless network consisting of spatially distributed autonomous devices that use sensor for monitoring and recording the physical conditions of the environment and organizing the collected data at storage node. Routing in wireless sensor network is a challenging task. This demand has led to a number of routing protocols which efficiently utilize the limited resources available at the sensor nodes. All these protocols usually find the minimum energy path. By using the minimum energy path deprives the nodes energy quickly and therefore the time taken to determine an alternate path increases. Instead of routing all the traffic along a single path that multipath routing schemes distribute traffic among multiple paths. Two criteria arise in shortest path routing that how many paths are needed and how to select these paths. Obviously, the number and the quality of the paths selected dictate the performance of a shortest path routing scheme. This shortest path topology control scheme is intended to provide a reliable transmission environment with low energy consumption, by efficiently utilizing the energy availability and also the received signal strength of the nodes to identify multiple routes to the destination. Simulation results shows that the energy efficient adaptive shortest path topology control scheme achieves much higher performance in wireless sensor networks.