Construction of routing tree and node discovery in wireless networks

The primary goal is to have an assured data delivery between the source and destination. Previously data delivery failures constantly occur in wireless applications due to node movements. The conventional route reconstruction method is designed to mitigate the effects of topology change, but it utilizes a large amount of resources. In this prototype we construct the regularity in node mobility patterns and ensure that transmission of data between the nodes is efficient. The positions of the routers are designed and tree topology is constructed so that all nodes movements are directed towards the root of the tree. First deploy the nodes in a network then calculate the maximum in degree node to find out coordinator node and finally construct the tree in order to send the data to the destination. Implement the capacity calculation if in- degree node numbers are the same in any two nodes. Further the best node is calculated if the capacity of both the nodes is same and node trustworthiness is calculated using the recommendation system.