Critical power for asymptotic connectivity Export

@proceedings{citeulike:1557463, abstract = {In wireless data networks the range of each transmitter, and thus its power level, needs to be high enough to reach the intended receivers, while being low enough to avoid generating interference for other receivers on the same channel. If the nodes in the network are assumed to cooperate, perhaps in a distributed and decentralized fashion, in routing each others' packets, as is the case in ad hoc wireless networks, then each node should transmit with just enough power to guarantee connectivity of the overall network. Towards this end, we determine the critical power at which a node in the network needs to transmit in order to ensure that the network is connected with probability one as the number of nodes in the network goes to infinity. Our main result is this: if n nodes are located randomly, uniformly i.i.d., in a disc of unit area in \ℜ² and each node transmits at a power level so as to cover an area of \πr²=(log n + c(n))/n, then the resulting network is asymptotically connected with probability one if and only if c(n)\→+\∞}, author = {Gupta, P. and Kumar, P. R.}, booktitle = {Decision and Control, 1998. Proceedings of the 37th IEEE Conference on}, citeulike-article-id = {1557463}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/CDC.1998.760846}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=760846}, day = {06}, doi = {10.1109/CDC.1998.760846}, journal = {Decision and Control, 1998. Proceedings of the 37th IEEE Conference on}, keywords = {connectivity, network, power\_control, wireless}, month = {August}, pages = {1106--1110 vol.1}, posted-at = {2009-10-29 17:38:20}, priority = {2}, title = {Critical power for asymptotic connectivity}, url = {http://dx.doi.org/10.1109/CDC.1998.760846}, volume = {1}, year = {2002} }

TY - CONF ID - citeulike:1557463 L3 - citeulike-article-id:1557463 N2 - In wireless data networks the range of each transmitter, and thus its power level, needs to be high enough to reach the intended receivers, while being low enough to avoid generating interference for other receivers on the same channel. If the nodes in the network are assumed to cooperate, perhaps in a distributed and decentralized fashion, in routing each others' packets, as is the case in ad hoc wireless networks, then each node should transmit with just enough power to guarantee connectivity of the overall network. Towards this end, we determine the critical power at which a node in the network needs to transmit in order to ensure that the network is connected with probability one as the number of nodes in the network goes to infinity. Our main result is this: if n nodes are located randomly, uniformly i.i.d., in a disc of unit area in ℜ² and each node transmits at a power level so as to cover an area of πr²=(log n + c(n))/n, then the resulting network is asymptotically connected with probability one if and only if c(n)→+∞ JF - Decision and Control, 1998. Proceedings of the 37th IEEE Conference on EP - 1110 vol.1 TI - Critical power for asymptotic connectivity VL - 1 T2 - Decision and Control, 1998. Proceedings of the 37th IEEE Conference on SP - 1106 KW - connectivity KW - network KW - power_control KW - wireless AU - Gupta, P AU - Kumar, PR PY - 2002/08/06/ UR - http://dx.doi.org/10.1109/CDC.1998.760846 ER -