Connectivity problem in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
Algorithms for scheduling with power control in wireless networks
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Minimum latency data aggregation in the physical interference model
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
On the capacity of oblivious powers
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Minimum latency data aggregation in the physical interference model
Computer Communications
Distributed backbone structure for algorithms in the SINR model of wireless networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed in some area, we seek to build a directed strongly connected communication graph, and compute an edge coloring of this graph such that the transmitter-receiver pairs in each color class can communicate simultaneously. Depending on the interference model, more or less colors, corresponding to the number of frequencies or time slots, are necessary. We consider the SINR model that compares the received power of a signal at a receiver to the sum of the strength of other signals plus ambient noise . The strength of a signal is assumed to fade polynomially with the distance from the sender, depending on the so-called path-loss exponent 驴.We show that, when all transmitters use the same power, the number of colors needed is constant in one-dimensional grids if 驴 1 as well as in two-dimensional grids if 驴 2. For smaller path-loss exponents and two-dimensional grids we prove upper and lower bounds in the order of $\mathcal{O}(\log n)$ and 驴(logn/loglogn) for 驴= 2 and 驴(n 2/驴驴 1) for 驴regular coloring of $\mathcal{O}(\log n)$ colors guarantees connectivity, while 驴(loglogn) colors are required for any coloring.