TY - GEN

T1 - A note on uniform power connectivity in the SINR model

AU - Avin, Chen

AU - Lotker, Zvi

AU - Pasquale, Francesco

AU - Pignolet, Yvonne Anne

N1 - Funding Information:
Zvi Lotker and Francesco Pasquale were partially supported by a gift from Cisco Reseach Center.

PY - 2009/12/1

Y1 - 2009/12/1

N2 - 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 and Ω(logn/loglogn) for α= 2 and Θ(n 2/α- 1) for α< 2 respectively. If nodes are distributed uniformly at random on the interval [0,1], a regular coloring of colors guarantees connectivity, while Ω(log logn) colors are required for any coloring.

AB - 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 and Ω(logn/loglogn) for α= 2 and Θ(n 2/α- 1) for α< 2 respectively. If nodes are distributed uniformly at random on the interval [0,1], a regular coloring of colors guarantees connectivity, while Ω(log logn) colors are required for any coloring.

UR - http://www.scopus.com/inward/record.url?scp=77049090286&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-05434-1_12

DO - 10.1007/978-3-642-05434-1_12

M3 - Conference contribution

AN - SCOPUS:77049090286

SN - 3642054331

SN - 9783642054334

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 116

EP - 127

BT - Algorithmic Aspects of Wireless Sensor Networks - 5th International Workshop, ALGOSENSORS 2009, Revised Selected Papers

T2 - 5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS 2009

Y2 - 10 July 2009 through 11 July 2009

ER -