Distributed clustering algorithm for finding virtual backbone in ad hoc networks

Authors:
B. Paul;S. V. Rao
Affiliations:
Department of Computer Science & Engineering, Indian Institute of Technology, Guwahati, Guwahati, Assam, India;Department of Computer Science & Engineering, Indian Institute of Technology, Guwahati, Guwahati, Assam, India
Venue:
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Year:
2005

Citing 11
Cited 0

Unit disk graphs

Discrete Mathematics - Topics on domination
Multicluster, mobile, multimedia radio network

Wireless Networks
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
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks

Wireless Networks
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Adaptive clustering for mobile wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

An important objective in designing a protocol is to save scarce resources like energy and bandwidth, and avoid the broadcast storm problem [1]. One way of addressing these problems is by forming a small virtual backbone. In this paper, we present a distributed clustering algorithm for forming a small backbone in ad-hoc network, based on connected dominating set. The time and message complexity of the algorithm is in O(n).