Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
A lower bound for radio broadcast
Journal of Computer and System Sciences
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed 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
Fast distributed algorithm for convergecast in ad hoc geometric radio networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
The worst-case capacity of wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
SINR diagrams: towards algorithmically usable SINR models of wireless networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
Unit disk graph and physical interference model: Putting pieces together
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
A Note on Uniform Power Connectivity in the SINR Model
Algorithmic Aspects of Wireless Sensor Networks
The capacity of wireless networks
IEEE Transactions on Information Theory
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
multi-channel assignment for communication in radio networks
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Wireless connectivity and capacity
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model
Theoretical Computer Science
Bounding interference in wireless ad hoc networks with nodes in random position
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Constant-approximation for optimal data aggregation with physical interference
Journal of Global Optimization
Improved minimum latency aggregation scheduling in wireless sensor networks under the SINR model
International Journal of Sensor Networks
| Hi-index | 0.00 |
We study the complexity of the following connectivity problem in wireless networks: for a given placement of n nodes in the plane, the goal is to compute a channel and power assignment that forms strongly connected communication structure spanning all nodes. The complexity measure is the total number of assigned channels, and the goal is to minimize this number. We work with two signal inference models: Geometric Radio Networks (GRN) and Signal to Interference Plus Noise Ratio (SINR). We show a generic polynomial-time transformation from the wide class of separable assignments in GRN to assignments in the SIRN model. This transformation preserves asymptotic complexity, i.e., the number of channels used in the assignments. In this way we show an assignment, constructed in polynomial-time, guarantying connectivity in the SINR model by using only O(log n) channels, which is an improvement over the best previous result O(log2 n) presented in [21].