Dominating Sets and Spanning Tree based Clustering Algorithms for Mobile Ad hoc Networks
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2011, Vol 2, Issue 2
Abstract
The infrastructure less and dynamic nature of mobile ad hoc networks (MANET) needs efficient clustering algorithms to improve network management and to design hierarchical routing protocols. Clustering algorithms in mobile ad hoc networks builds a virtual backbone for network nodes. Dominating sets and Spanning tree are widely used in clustering networks. Dominating sets and Spanning Tree based MANET clustering algorithms were suitable in a medium size network with respect to time and message complexities. This paper presents different clustering algorithms for mobile ad hoc networks based on dominating sets and spanning tree.
Authors and Affiliations
R Krishnam Raju Indukuri , Suresh Varma Penumathsa
A Crypto-Steganography: A Survey
The two important aspects of security that deal with transmitting information or data over some medium like Internet are steganography and cryptography. Steganography deals with hiding the presence of a message and crypt...
Impacts of Unbalanced Test Data on the Evaluation of Classification Methods
The performance of a classifier in a supervised machine learning problem is popularly evaluated by using the accuracy, precision, recall, and F1-score. These parameters could evaluate very well classifiers in the case th...
Modelling & Designing Land Record Information System Using Unified Modelling Language
Automation of Land Records is one of the most important initiatives undertaken by the revenue department to facilitate the landowners of the state of Punjab. A number of such initiatives have been taken in different Sta...
Transforming Higher educational institution administration through ICT
The rapid development in Indian higher education sector has increased the focus on reforms in higher educational institution administration. Efficiency and accountability have become important elements, and the integrati...
scaleBF: A High Scalable Membership Filter using 3D Bloom Filter
Bloom Filter is extensively deployed data structure in various applications and research domain since its inception. Bloom Filter is able to reduce the space consumption in an order of magnitude. Thus, Bloom Filter is us...