Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
Parallel symmetry-breaking in sparse graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel (&Dgr;+1)-coloring of constant-degree graphs
Information Processing Letters
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Locality in distributed graph algorithms
SIAM Journal on Computing
Scheduling algorithms for multi-hop radio networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Fast distributed algorithms for Brooks-Vizing colourings
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection
IEEE Transactions on Parallel and Distributed Systems
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Fast distributed graph coloring with O(&Dgr;) colors
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A transmission control scheme for media access in sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Randomized initialization protocols for radio networks
Handbook of wireless networks and mobile computing
Experimental analysis of simple, distributed vertex coloring algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Weak Communication in Radio Networks
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Some simple distributed algorithms for sparse networks
Distributed Computing
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed 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
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Broadcasting in udg radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Ad hoc networks beyond unit disk graphs
Wireless Networks
On the effect of the deployment setting on broadcasting in Euclidean radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Self-stabilizing population protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Link Scheduling in Local Interference Models
Algorithmic Aspects of Wireless Sensor Networks
Coloring unstructured wireless multi-hop networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Modelling and verification of the LMAC protocol for wireless sensor networks
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Self-stabilizing routing algorithms for wireless ad-hoc networks
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Deploying wireless networks with beeps
DISC'10 Proceedings of the 24th international conference on Distributed computing
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Distributed game-theoretic vertex coloring
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Radio network distributed algorithms in the unknown neighborhood model
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Self-stabilizing population protocols
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Distributed ($#916;+1)-coloring in the physical model
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Survey: Distributed algorithm engineering for networks of tiny artifacts
Computer Science Review
Towards tight bounds for local broadcasting
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
Distributed computing with advice: information sensitivity of graph coloring
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Distributed constraint optimisation for resource limited sensor networks
Science of Computer Programming
Operations Research
Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
During and immediately after their deployment, ad hoc and sensor networks lack an efficient communication scheme rendering even the most basic network coordination problems difficult. Before any reasonable communication can take place, nodes must come up with an initial structure that can serve as a foundation for more sophisticated algorithms. In this paper, we consider the problem of obtaining a vertex coloring as such an initial structure. We propose an algorithm that works under the unstructured radio network model. This model captures the characteristics of newly deployed ad hoc and sensor networks, i.e. asynchronous wake-up, no collision-detection, and scarce knowledge about the network topology. Our algorithm produces a correct coloring with O(Δ) colors in time O(Δ log n) with high probability in a unit disk graph, where n and Δ are the number of nodes in the network and the maximum degree, respectively. Furthermore, the number of locally used colors depends only on the local node density.