Mobile and wireless networks
An approximation algorithm for clustering graphs with dominating diametral path
Information Processing Letters
A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
Multicluster, mobile, multimedia radio network
Wireless Networks
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Assigning codes in wireless networks: bounds and scaling properties
Wireless Networks
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
K-clustering in wireless ad hoc networks
Proceedings of the second ACM international workshop on Principles of mobile computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Extremal Properties of Three-Dimensional Sensor Networks with Applications
IEEE Transactions on Mobile Computing
Randomized Initialization of a Wireless Multihop Network
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 09
Efficient and robust protocols for local detection and propagation in smart dust networks
Mobile Networks and Applications
Ad Hoc Networking
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
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 |
Ad hoc networks consist of wireless hosts that communicate without the need of any fixed infrastructure. A k-clustering protocol is an algorithm in which the wireless network is divided into non-overlapping sub networks, referred to as clusters, and where every node of a sub network is at most k hops from a distinguished station called the clusterhead. Clustering is commonly used in ad hoc networks in order to limit the amount of routing information stored and maintained at individual nodes. In our setting, a large number n of distinguishable stations (e.g. sensors) are randomly deployed in a given area of size |${\mathcal S}$| We assume that the nodes use synchronous radio transmissions and any pair of nodes u and v are able to communicate if they are within a distance less than their transmitting range of each other. Moreover, if more than two neighbors of a node u transmit simultaneously, u is assumed to receive no message (collision). Under these assumptions, we propose and analyze efficient and fully distributed algorithms for the k-clustering problem.