On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Connectivity-Based k-Hop Clustering in Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 7 - Volume 7
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
On Constructing k-Connected k-Dominating Set in Wireless Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Limiting the impact of mobility on ad hoc clustering
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
A Distributed Weighted Clustering Algorithm for Mobile Ad Hoc Networks
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
IEEE Transactions on Parallel and Distributed Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
SCAM: scenario-based clustering algorithm for mobile ad hoc networks
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The construction of stable and adaptive clusters providing good performance and faster convergence rate with minimal overhead is a challenging task in Mobile Ad hoc Networks (MANETs). This paper proposes a clustering technique for MANETs, which is distributed, dominating set based, weighted and adaptive to changes in the topology called Distributed Scenario-based Clustering Algorithm for Mobile ad hoc networks (DSCAM). The election of clusterheads and gateway nodes is based on (k, r) − Dominating set, where ks the minimum number of clusterheads per node in the network and r is the maximum number of hops between a node and its clusterhead. After selecting clusterheads, affiliation of other nodes with the clusterhead is decided based on the quality of clusterhead, which is a function of connectivity, stability, residual battery power andtransmission rate. Among the k dominating nodes, nonclusterhead nodes select the most qualified node as its clusterhead. DSCAM creates stable clusters with less overhead and maximizes the life span of the network. Theperformance of this algorithm is evaluated throughsimulation and the results are encouraging.