Design of failure aware and energy efficient node discovery system in wireless sensor network

In the recent years, wireless sensor networks (WSNs) have gained increasing attention from both the actual users and research community. Wireless sensor networks are mostly used to continuously collect data from the environment. Because of energy constraints on battery-powered nodes, it is crucial to minimize communication. To coordinate their operation, it is necessary to maintain a strongly connected network topology at all times. However, a failure of the node may cause the network to partition into disjoint blocks and thus, violate such a connectivity goal. A major constraint in designing many such types of networks is energy. The most important solution to energy consumption in proposed system is neighbor node discovery and formulate an efficient protocol with which the nodes can estimate the exact information of their neighbors. In this paper we first reduce the energy consumption on sensor nodes and packets delivered to the destination by using Select Most Trusted Routing(SMTR) algorithm so that, data delivery rate is increase. The results can be obtained in routing form where each hop described the path from which packet transmitted. The design work consist of generation of network scenario and connectivity, generation of routing path analysis and shortest path calculation. C# is used for simulating the results.