A lower bound for radio broadcast
Journal of Computer and System Sciences
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
On Computing Ad-hoc Selective Families
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Generalized framework for selectors with applications in optimal group testing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Almost optimal explicit selectors
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
| Hi-index | 0.00 |
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an interference in the area that is larger than the area, where the transmitted message can be received. For each node, there is an area, where a signal of its transmission is too low to be decoded by a receiver, but is strong enough to interfere with other incoming simultaneous transmissions. Such a setting is modelled by a newly proposed interference reachability graph that extends the standard graph model based on reachability graphs. Further, focusing on the information dissemination problem in bipartite interference reachability graphs, we introduce interference ad-hoc selective families as an useful combinatorial tool. They are a natural generalization of ad-hoc selective families. Adopting known algorithms and techniques, we show how to construct small interference ad-hoc selective families in the case when, for each node, the ratio of the only-interfering neighbors to the other neighbors is bounded. Finally, taking into account the maximum degree in an underlying interference reachability graph, we study the broadcasting problem in general radio networks.