Azimuth Tree-Based Self-organizing Protocol for Internet of Things

An azimuth tree-based network algorithm is proposed on a uniform random distribution of scattered points which is actually graph-based. In the proposed azimuth on a tree-based network, first tree is established through the algorithm for finding the weight function of the tree would constrain the number of points to be considered during azimuth routing, thereby limiting the search space, reducing time complexities, and inducing further optimizations. The idea behind our paper would be applying the azimuth algorithm on a selected number of points, which would be achieved through the efficient tree-based routing protocol. So, firstly, we would apply our tree-based protocol on the uniform random distribution of points. The limited number of points output by this algorithm would be fed as input to azimuth routing. And in the protocol proposed by us, the aggregation of data in this tree-based network helps in reducing the network load and the energy consumption. And this research work mainly revolves around the criteria to be taken into consideration for balancing factors like these and construct a tree-based network which is better in terms of both lifetime of the network and the successful routing of protocols. With the help of simulation implemented using C++ and then constructing its corresponding graph, we have shown how considering all the factors possible has improved the performance of tree-based network. And finally, a comparative analysis is done where our proposed model is compared to the already existing traditional routing protocols namely AODV, DSDV, LEACH, Azimuth-based algorithm.