A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Discrete Mathematics - Topics on domination
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
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
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
Virtual backbones in wireless ad hoc networks
Virtual backbones in wireless ad hoc networks
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The capacity of wireless networks
IEEE Transactions on Information Theory
Constant density spanners for wireless ad-hoc networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Construction of virtual backbone on growth-bounded graph with variable transmission range
WSEAS Transactions on Computers
Traffic-adaptive, flow-specific medium access control for wireless networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Self-stabilizing routing algorithms for wireless ad-hoc networks
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Structuring unreliable radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
An Automatic Presence Service for Low Duty-Cycled Mobile Sensor Networks
Mobile Networks and Applications
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Desynchronization with an artificial force field for wireless networks
ACM SIGCOMM Computer Communication Review
Constructing efficient rotating backbones in wireless sensor networks using graph coloring
Computer Communications
| Hi-index | 0.00 |
We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of Unit Disk Graphs which are known to realistically model wireless networks. Our distributed algorithms take into account the loss of messages due to contention from simultaneous interfering transmissions in the wireless medium. We present randomized distributed algorithms for (conflict-free) Distance-2 coloring, dominating set construction, and connected dominating set construction in Unit Disk Graphs. The coloring algorithm has a time complexity of O(Δ log2n) and is guaranteed to use at most O(1) times the number of colors required by the optimal algorithm. We present two distributed algorithms for constructing the (connected) dominating set; the former runs in time O(Δ log 2n) and the latter runs in time O(log 2n). The two algorithms differ in the amount of local topology information available to the network nodes. Our algorithms are geared at constructing Well Connected Dominating Sets (WCDS) which have certain powerful and useful structural properties such as low size, low stretch and low degree. In this work, we also explore the rich connections between WCDS and routing in ad hoc networks. Specifically, we combine the properties of WCDS with other ideas to obtain the following interesting applications: An online distributed algorithm for collision-free, low latency, low redundancy and high throughput broadcasting. Distributed capacity preserving backbones for unicast routing and scheduling.