ACM Computing Surveys (CSUR)
Multicluster, mobile, multimedia radio network
Wireless Networks
Memory space requirements for self-stabilizing leader election protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilization
Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
K-clustering in wireless ad hoc networks
Proceedings of the second ACM international workshop on Principles of mobile computing
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Self-Stabilizing Neighborhood Synchronizer in Tree Networks
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Self-Stabilization in Self-Organized Multihop Wireless Networks
ICDCSW '05 Proceedings of the Second International Workshop on Wireless Ad Hoc Networking - Volume 09
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Route preserving stabilization
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Efficiently reconfigurable backbones for wireless sensor networks
Computer Communications
Robust self-stabilizing weight-based clustering algorithm
Theoretical Computer Science
A self-stabilizing k-clustering algorithm for weighted graphs
Journal of Parallel and Distributed Computing
Robust self-stabilizing clustering algorithm
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a fixed infrastructure. Fast self-reconfiguration and power efficiency are very important property on any sensor network management. The clustering problem consists in partitioning network nodes into groups called clusters, thus giving at the network a hierarchical organization. Clustering increases the scalability and the energy efficiency of communication among the sensors. A self-stabilizing algorithm, regardless of the initial system state, converges to a set of states that satisfy the problem specification without external intervention. Due to this property, self-stabilizing algorithms are adapted highly dynamic networks. In this paper we present a Self-stabilizing Clustering Algorithm for Ad hoc sensor network. Our algorithm adapts faster than other algorithms to topology changes.