Counting sort is a simple, stable and efficient sorting algorithm with linear running time, which is a fundamental building block for many applications. Counting sort algorithm has been widely used in data processing systems, because of its high efficiency, fast speed and stable nature. Therefore, a thorough study of its time complexity is required. This paper presents a modified version of counting sort E-Counting Sort with some efficiency improvements. An analysis of the E-Counting sort algorithm in comparison with original counting sort algorithm clearly shows that E-Counting sort algorithm having a reduced time complexity approximately to half of the original one. The new version can be applied to many real world applications providing the required result as efficient and as effective as original counting sort without affecting its real nature and improve the efficiency of application program.
In this paper, a proposal for OLSR protocol based upon Boltzmann learning algorithm is made. The main focus is to tune OLSR by using Boltzmann learning algorithm. The proposed work deals with the standardized OLSR routing protocol, to make it more reliable, more energy efficient and more adaptable to the rapidly changing network topology and infrastructure. This article therefore provides a simple mechanism for dynamic adoption of mobile nodes based on Boltzmann learning algorithm with OLSR. Then the paper provides a mathematical proof how Boltzmann Learning can be used in MANETs using OLSR.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.