76
43

Towards Tight Bounds for Local Broadcasting

Abstract

We consider the local broadcasting problem in the SINR model, which is a basic primitive for gathering initial information among nn wireless nodes. Assuming that nodes can measure received power, we achieve an essentially optimal constant approximate algorithm (with a log2n\log^2 n additive term). This improves upon the previous best O(logn)O(\log n)-approximate algorithm. Without power measurement, our algorithm achieves O(logn)O(\log n)-approximation, matching the previous best result, but with a simpler approach that works under harsher conditions, such as arbitrary node failures. We give complementary lower bounds under reasonable assumptions.

View on arXiv
Comments on this paper

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.