Nearly Optimal Local Broadcasting in the SINR Model with Feedback

DOI10.1007/978-3-319-25258-2_12zbMath1476.68016OpenAlexW2296053248MaRDI QIDQ3460714

Leonid Barenboim, David Peleg

Publication date: 8 January 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25258-2_12

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Distributed bare-bones communication in wireless networks ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing

Cites Work

• On local broadcasting schedules and CONGEST algorithms in the SINR model
• A log-star distributed maximal independent set algorithm for growth-bounded graphs
• Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
• The Locality of Distributed Symmetry Breaking
• Simple Distributed Δ + 1 Coloring in the SINR Model
• Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks
• Distributed Graph Coloring: Fundamentals and Recent Developments
• Coloring unstructured wireless multi-hop networks
• Local Broadcasting with Arbitrary Transmission Power in the SINR Model

This page was built for publication: Nearly Optimal Local Broadcasting in the SINR Model with Feedback