### Abstract

Maximizing the sum rate of a wireless network with multiple interfering links is an important and challenging problem in communication systems. This difficult non-convex problem has been approached from both an algorithmic perspective to achieve global optimality (e.g., using d.c. programming) and a relaxation perspective to obtain approximate solutions (e.g., high signal-to-noise-ratio approximation, binary power control, network symmetry, game-theoretic reformulation, etc.). It is generally agreed that 1) the global algorithms suffer from scalability issues and are more appropriate for problems of small instances; and 2) the solutions obtained based on maximizing the instantaneous performance are most likely suboptimal in practical fading wireless networks. In this work, we demonstrate that the sum rate can be efficiently optimized using the tool of stochastic geometry. In particular, we show that the average network sum rate can be derived in closed-form, taking into account both the random spatial distribution of the transmitters and the random Nakagami channel fading. An optimal contention density is further derived, which indicates the optimal number of supportable concurrent transmissions that attains the maximal sum rate. We discuss several applications of the derived results in interference-limited wireless systems.

Original language | English |
---|---|

Title of host publication | 2012 IEEE International Conference on Communications, ICC 2012 |

Pages | 5113-5117 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 2012 |

Externally published | Yes |

Event | 2012 IEEE International Conference on Communications, ICC 2012 - Ottawa, ON, Canada Duration: 10 Jun 2012 → 15 Jun 2012 |

### Other

Other | 2012 IEEE International Conference on Communications, ICC 2012 |
---|---|

Country | Canada |

City | Ottawa, ON |

Period | 10/6/12 → 15/6/12 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Networks and Communications
- Electrical and Electronic Engineering

### Cite this

*2012 IEEE International Conference on Communications, ICC 2012*(pp. 5113-5117). [6364272] https://doi.org/10.1109/ICC.2012.6364272

**Sum rate maximization in fading wireless networks using stochastic geometry.** / Shi, Yi; Dong, Xiaodai; Letaief, Khaled.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*2012 IEEE International Conference on Communications, ICC 2012.*, 6364272, pp. 5113-5117, 2012 IEEE International Conference on Communications, ICC 2012, Ottawa, ON, Canada, 10/6/12. https://doi.org/10.1109/ICC.2012.6364272

}

TY - GEN

T1 - Sum rate maximization in fading wireless networks using stochastic geometry

AU - Shi, Yi

AU - Dong, Xiaodai

AU - Letaief, Khaled

PY - 2012

Y1 - 2012

N2 - Maximizing the sum rate of a wireless network with multiple interfering links is an important and challenging problem in communication systems. This difficult non-convex problem has been approached from both an algorithmic perspective to achieve global optimality (e.g., using d.c. programming) and a relaxation perspective to obtain approximate solutions (e.g., high signal-to-noise-ratio approximation, binary power control, network symmetry, game-theoretic reformulation, etc.). It is generally agreed that 1) the global algorithms suffer from scalability issues and are more appropriate for problems of small instances; and 2) the solutions obtained based on maximizing the instantaneous performance are most likely suboptimal in practical fading wireless networks. In this work, we demonstrate that the sum rate can be efficiently optimized using the tool of stochastic geometry. In particular, we show that the average network sum rate can be derived in closed-form, taking into account both the random spatial distribution of the transmitters and the random Nakagami channel fading. An optimal contention density is further derived, which indicates the optimal number of supportable concurrent transmissions that attains the maximal sum rate. We discuss several applications of the derived results in interference-limited wireless systems.

AB - Maximizing the sum rate of a wireless network with multiple interfering links is an important and challenging problem in communication systems. This difficult non-convex problem has been approached from both an algorithmic perspective to achieve global optimality (e.g., using d.c. programming) and a relaxation perspective to obtain approximate solutions (e.g., high signal-to-noise-ratio approximation, binary power control, network symmetry, game-theoretic reformulation, etc.). It is generally agreed that 1) the global algorithms suffer from scalability issues and are more appropriate for problems of small instances; and 2) the solutions obtained based on maximizing the instantaneous performance are most likely suboptimal in practical fading wireless networks. In this work, we demonstrate that the sum rate can be efficiently optimized using the tool of stochastic geometry. In particular, we show that the average network sum rate can be derived in closed-form, taking into account both the random spatial distribution of the transmitters and the random Nakagami channel fading. An optimal contention density is further derived, which indicates the optimal number of supportable concurrent transmissions that attains the maximal sum rate. We discuss several applications of the derived results in interference-limited wireless systems.

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

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

U2 - 10.1109/ICC.2012.6364272

DO - 10.1109/ICC.2012.6364272

M3 - Conference contribution

AN - SCOPUS:84871979987

SN - 9781457720529

SP - 5113

EP - 5117

BT - 2012 IEEE International Conference on Communications, ICC 2012

ER -