Multicluster, mobile, multimedia radio network
Wireless Networks
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Topology management in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A heuristic method for large-scale multi-facility location problems
Computers and Operations Research
Peer management domain agents architecture for MANET management
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Self-organize management of mobile adhoc networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
| Hi-index | 0.00 |
The paper describes the application of the theory of selfcriticality to the problem of self-organization in mobile ad hoc networks. It specifically addresses the problem of clustering into optimum size groups using only local information available at the nodes, identify clusterheads for the clusters. Self-organized criticality is defined as the ability of a system to evolve in such a way as to approach a critical point and then maintain itself at that point. The algorithm described in this paper enables the clusters to dynamically reconfigure themselves when the topology changes significantly with minimum overhead.