Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
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
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
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
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
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
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
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
| Hi-index | 0.00 |
This paper proposes a scenario based, adaptive and distributed clustering algorithm SCAM (Scenario-based Clustering Algorithm for Mobile ad hoc networks). A distributed algorithm based on (k, r) - Dominating Set is used for the selection of clusterheads and gateway nodes, here k is the minimum number of clusterheads per node in the network and r is the maximum number of hops between the node and the clusterhead. From among the k dominating nodes, the non-clusterhead node can select the most qualified dominating node as its clusterhead. The quality of the clusterhead is calculated based on various metrics, which include connectivity, stability and residual battery power. Long-term service as clusterhead depletes their energy, causing them to drop out of the network. Similarly, the clusterhead with relatively high mobility than its neighbours leads to frequent clusterhead election process. This perturbs the stability of the network and adversely affects the performance of the network. Load balancing among clusterheads and correct positioning of clusterhead in a cluster are also vital to increase the life span of the network. The proposed algorithm periodically calculates the quality of all dominating nodes and if it goes below the threshold level it resigns the job as clusterhead and sends this message to all other member nodes. Since these nodes have k dominating nodes within r - hop distance, it can choose the current best-qualified node as its clusterhead. SCAM uses techniques to maintain the cluster structure as stable as possible with less control messages.