Computer Science – Information Theory
Scientific paper
2012-02-28
Computer Science
Information Theory
5 pages, 4 figures, submitted to IEEE ISIT 2012
Scientific paper
Consider a wireless network of transmitter-receiver pairs. The transmitters adjust their powers to maintain a particular SINR target in the presence of interference from neighboring transmitters. In this paper we analyze the optimal power vector that may achieve this target in the presence of randomness in the network. Specifically, we start from a regular grid of transmitter-receiver pairs and randomly turn-off a finite fraction of them. We apply concepts from random matrix theory to evaluate the asymptotic mean optimal power per link, as well as its variance. Our analytical results show remarkable agreement with numerically generated networks, not only in one-dimensional network arrays but also in two dimensional network geometries. Remarkably, we observe that the optimal power in random networks does not go to infinity in a continuous fashion as in regular grids. Rather, beyond a certain point, no finite power solution exists.
Bambos Nicholas
Moustakas Aris L.
No associations
LandOfFree
Power Optimization on a Network: The effects of randomness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Power Optimization on a Network: The effects of randomness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Power Optimization on a Network: The effects of randomness will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-522641