Distributed Contention Resolution in Wireless Networks

DOI10.1007/978-3-642-15763-9_16zbMath1290.68026MaRDI QIDQ3588302

Berthold Vöcking, Thomas Kesselheim

Publication date: 10 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15763-9_16

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68M14: Distributed systems

68M12: Network protocols

Related Items

Spanning Trees With Edge Conflicts and Wireless Connectivity, The Power of Oblivious Wireless Power, Unnamed Item, Token traversal in ad hoc wireless networks via implicit carrier sensing, Effective Wireless Scheduling via Hypergraph Sketches, Dynamic multiple-message broadcast: bounding throughput in the affectance model, Nearly optimal bounds for distributed wireless scheduling in the SINR model, Distributed wireless link scheduling in the SINR model, Improved algorithms for latency minimization in wireless networks, Distributed \((\varDelta + 1)\)-coloring in the physical model, Wireless capacity with arbitrary gain matrix, Conflict graphs and the SINR-capacity of the mean power scheme, Distributed multiple-message broadcast in wireless ad hoc networks under the SINR model, Computing large independent sets in a single round, Information dissemination in wireless ad-hoc networks under the weighted-TIM framework, Distributed bare-bones communication in wireless networks, Universal stability in multi-hop radio networks, Limitations of current wireless link scheduling algorithms, Deterministic protocols in the SINR model without knowledge of coordinates, Vertex coloring edge-weighted digraphs, Network design under general wireless interference, A maximum clique based approximation algorithm for wireless link scheduling under SINR model, Convergence Time of Power-Control Dynamics