### Abstract

The capacity of a wireless network could be considerably improved by employing directional antennas that are capable of illuminating multiple beams toward different directions. However, more beams from the same BS may lead to stronger inter-cell interference. In this paper, we consider coordinated beam scheduling schemes to mitigate the inter-cell interference. We first formulate this problem as a combinatorial optimization problem. We then reveal that the complexity of this problem hinges upon a single scalar termed as degree of constraint (DoC), which is related to the degree of conflict a beam is subject to. If the DoC is at least three, the general beam scheduling problem is NP-hard. If DoC is smaller than three, which corresponds to a relevant subclass of the beam scheduling problem arising in practice, this problem can be solved in polynomial time. We propose an optimal beam scheduling algorithm based on the auction method to this particular subclass of problem. This algorithm is of low complexity and is well suited for distributed implementations. We then extend the auction algorithm to solve the general multi-cell beam scheduling problem. The performance of the proposed algorithms is finally assessed through extensive simulation studies.

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

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

DOIs | |

Publication status | Published - 2011 Sep 2 |

Event | 2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan Duration: 2011 Jun 5 → 2011 Jun 9 |

### Other

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

Country | Japan |

City | Kyoto |

Period | 11/6/5 → 11/6/9 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Networks and Communications
- Electrical and Electronic Engineering

### Cite this

*2011 IEEE International Conference on Communications, ICC 2011*[5962730] https://doi.org/10.1109/icc.2011.5962730

}

*2011 IEEE International Conference on Communications, ICC 2011.*, 5962730, 2011 IEEE International Conference on Communications, ICC 2011, Kyoto, Japan, 11/6/5. https://doi.org/10.1109/icc.2011.5962730

**Distributed beam scheduling in multi-cell networks via auction over competitive markets.** / Yang, Kai; Calin, Doru; Chae, Chan Byoung; Yiu, Simon.

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

TY - GEN

T1 - Distributed beam scheduling in multi-cell networks via auction over competitive markets

AU - Yang, Kai

AU - Calin, Doru

AU - Chae, Chan Byoung

AU - Yiu, Simon

PY - 2011/9/2

Y1 - 2011/9/2

N2 - The capacity of a wireless network could be considerably improved by employing directional antennas that are capable of illuminating multiple beams toward different directions. However, more beams from the same BS may lead to stronger inter-cell interference. In this paper, we consider coordinated beam scheduling schemes to mitigate the inter-cell interference. We first formulate this problem as a combinatorial optimization problem. We then reveal that the complexity of this problem hinges upon a single scalar termed as degree of constraint (DoC), which is related to the degree of conflict a beam is subject to. If the DoC is at least three, the general beam scheduling problem is NP-hard. If DoC is smaller than three, which corresponds to a relevant subclass of the beam scheduling problem arising in practice, this problem can be solved in polynomial time. We propose an optimal beam scheduling algorithm based on the auction method to this particular subclass of problem. This algorithm is of low complexity and is well suited for distributed implementations. We then extend the auction algorithm to solve the general multi-cell beam scheduling problem. The performance of the proposed algorithms is finally assessed through extensive simulation studies.

AB - The capacity of a wireless network could be considerably improved by employing directional antennas that are capable of illuminating multiple beams toward different directions. However, more beams from the same BS may lead to stronger inter-cell interference. In this paper, we consider coordinated beam scheduling schemes to mitigate the inter-cell interference. We first formulate this problem as a combinatorial optimization problem. We then reveal that the complexity of this problem hinges upon a single scalar termed as degree of constraint (DoC), which is related to the degree of conflict a beam is subject to. If the DoC is at least three, the general beam scheduling problem is NP-hard. If DoC is smaller than three, which corresponds to a relevant subclass of the beam scheduling problem arising in practice, this problem can be solved in polynomial time. We propose an optimal beam scheduling algorithm based on the auction method to this particular subclass of problem. This algorithm is of low complexity and is well suited for distributed implementations. We then extend the auction algorithm to solve the general multi-cell beam scheduling problem. The performance of the proposed algorithms is finally assessed through extensive simulation studies.

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

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

U2 - 10.1109/icc.2011.5962730

DO - 10.1109/icc.2011.5962730

M3 - Conference contribution

AN - SCOPUS:80052176515

SN - 9781612842332

BT - 2011 IEEE International Conference on Communications, ICC 2011

ER -