Discrete Mathematics - Topics on domination
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
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
Wireless Communication Is in APX
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
Connectivity problem in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
The capacity of wireless networks
IEEE Transactions on Information Theory
Link scheduling in polynomial time
IEEE Transactions on Information Theory - Part 1
| Hi-index | 5.23 |
In this paper, we study the connectivity problem for wireless networks under the physical 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 fewer colors, corresponding to the number of frequencies or time slots, are necessary. We consider the interference 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 @a. We show that, when all transmitters use the same power, the number of colors needed is constant in one-dimensional grids if @a1 as well as in two-dimensional grids if @a2. For smaller path-loss exponents and two-dimensional grids we prove upper and lower bounds in the order of O(logn) and @W(logn/loglogn) for @a=2 and @Q(n^2^/^@a^-^1) for @a