The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Discrete Mathematics - Topics on domination
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
A fast algorithm for generalized network location problems
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
Multicluster, mobile, multimedia radio network
Wireless Networks
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
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
Multicast operation of the ad-hoc on-demand distance vector routing protocol
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility
MobiHoc '00 Proceedings of the 1st 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
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Topology management in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & 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
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Application-specific protocol architectures for wireless networks
Application-specific protocol architectures for wireless networks
Multi-level hierarchies for scalable ad hoc routing
Wireless Networks
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
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
IEEE Communications Magazine
Flooding in wireless ad hoc networks
Computer Communications
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
Bounded-distance multi-coverage backbones in wireless sensor networks
Proceedings of the 2007 ACM symposium on Applied computing
A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
SCAM: scenario-based clustering algorithm for mobile ad hoc networks
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
A self-stabilizing k-clustering algorithm for weighted graphs
Journal of Parallel and Distributed Computing
Self-stabilizing (k,r)-clustering in wireless ad-hoc networks with multiple paths
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
An uncapacitated facility location based cluster hierarchy scheme on wireless sensor networks
WSEAS TRANSACTIONS on COMMUNICATIONS
An efficient mesh-based multicast routing protocol in mobile ad hoc networks
Wireless Communications & Mobile Computing
Self-stabilizing (k,r)-clustering in clock rate-limited systems
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the maximum distance from nodes to their cluster-heads. This problem is similar to computing a (k,r)-dominating set, (k,r)-DS, of the network. (k,r)-DS is defined as the problem of selecting a minimum cardinality vertex set D of the network such that every vertex u not in D is at a distance smaller than or equal to r from at least k vertices in D. In mobile ad hoc networks (MANETs), clusters should be computed distributively, because the topology may change frequently. We present the first centralized and distributed solutions to the (k,r)-DS problem for arbitrary topologies. The centralized algorithm computes a (k.ln@D)-approximation, where @D is the largest cardinality among all r-hop neighborhoods in the network. The distributed approach is extended for clustering applications, while the centralized is used as a lower bound for comparison purposes. Extensive simulations are used to compare the distributed solution with the centralized one. As a case study, we propose a novel multi-core multicast protocol that applies the distributed solution for the election of cores. The new protocol is compared against PUMA, one of the best performing multicast protocols for MANETS. Simulation results show that the new protocol outperforms PUMA on the context of static networks.