Hypergraph modeling and approximation algorithms for the minimum length link scheduling in multiuser MIMO networks
type: Item
instance of: scholarly article
title: Hypergraph modeling and approximation algorithms for the minimum length link scheduling in multiuser MIMO networks
zbMATH Open document ID: 1397.90193
DOI: 10.1155/2013/982713
author: Hu Shen
author: Shaohe Lv
author: Xuan Dong
author: J. Q. Deng
author: Xingming Zhou
author: Xiaodong Wang
published in: Journal of Applied Mathematics
publication date: 2018-10-10T00:00:00Z
review text: Summary: This paper investigates the problem of the minimum length link scheduling (MLLS) in multiuser MIMO (MU-MIMO) networks. Generally, in the networks with MU-MIMO capability, the number of concurrent transmissions can be as large as that of antenna elements at the receiver. As a result, link interference is no longer binary but demonstrates a strong correlation among multiple links, which cannot be captured by the conventional conflict graph interference model. Hence, we propose a novel hypergraph interference model, which can accurately and efficiently characterize the relationship of multiple interferences induced by concurrent transmissions, and provide a tractable formalization of the minimum length link scheduling in MU-MIMO networks (MU-MIMO MLLS). Afterwards, we prove that the MU-MIMO MLLS problem is NP-hard and introduce two approximation algorithms to find the near-optimal feasible schedule. Finally, extensive simulation experiments are presented.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 6950973
Wikidata QID: Q59007327
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/982713
OpenAlex ID: W2120541373
description: scientific article; zbMATH DE number 6950973