Dominating Sets and Spanning Tree based Clustering Algorithms for Mobile Ad hoc Networks

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

Keywords

Related Articles

Agent-Based Co-Modeling of Information Society and Wealth Distribution

With empirical studies suggesting that information technology influence wealth distribution in different ways, and with economic interactions and information technology adoption being two complex phenomena, there is a ne...

Impact of Android Phone Rooting on User Data Integrity in Mobile Forensics

Modern cellular phones are potent computing de-vices, and their capabilities are constantly progressing. The Android operating system (OS) is widely used, and the number of accessible apps for Android OS phones is unprec...

Android Application to Assess Smartphone Accelerometers and Bluetooth for Real-Time Control

Modern smart phones have evolved into sophisticated embedded systems, incorporating hardware and software features that make the devices potentially useful for real-time control operations. An object-oriented Android app...

Statistical Implicative Similarity Measures for User-based Collaborative Filtering Recommender System

This paper proposes a new similarity measures for User-based collaborative filtering recommender system. The similarity measures for two users are based on the Implication intensity measures. It is called statistical imp...

A Novel Broadcast Scheme DSR-based Mobile Adhoc Networks

Traffic classification seeks to assign packet flows to an appropriate quality of service (QoS). Despite many studies that have placed a lot of emphasis on broadcast communication, broadcasting in MANETs is still a proble...

Download PDF file
  • EP ID EP102907
  • DOI -
  • Views 91
  • Downloads 0

How To Cite

R Krishnam Raju Indukuri, Suresh Varma Penumathsa (2011). Dominating Sets and Spanning Tree based Clustering Algorithms for Mobile Ad hoc Networks. International Journal of Advanced Computer Science & Applications, 2(2), 75-81. https://europub.co.uk/articles/-A-102907