A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Removing randomness in parallel computation without a processor penalty
Journal of Computer and System Sciences
Proceedings of the 7th annual international conference on Mobile computing and networking
Time synchronization in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Dominating-set-based routing in ad hoc wireless networks
Handbook of wireless networks and mobile computing
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Spine routing in ad hoc networks
Cluster Computing
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
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
An efficient distributed algorithm for constructing small dominating sets
Distributed Computing - Special issue: Selected papers from PODC '01
On the capacity improvement of ad hoc wireless networks using directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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
Connected Dominating Set and its Induced Position-less Sparse Spanner For Mobile Ad Hoc Networks
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Distributed algorithms for coloring and domination in wireless ad hoc networks
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
The capacity of wireless networks
IEEE Transactions on Information Theory
Topology management for public safety networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Duty-cycle-aware minimum-energy multicasting in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We present fast distributed local control connected dominating set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CDSTop which take into account the effect of wireless interference and the consequent loss of messages during the execution of the algorithm. These algorithms produce a CDS of constant size and constant stretch ratio with high probability, and converge in polylogarithmic running time. Specifically, algorithm CDSColor requires the nodes to know (estimates of) the maximum degree @D and the size of the network n and converges in O(@Dlog^2n) time. Algorithm CDSTop requires the nodes to know their three-hop topology and (an estimate of) the network size n and converges in O(log^2n) time. To the best of our knowledge, these are the first distributed interference-aware CDS algorithms for wireless ad hoc networks which break the linear running-time barrier.