{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:43:06Z","timestamp":1740134586603,"version":"3.37.3"},"reference-count":9,"publisher":"Wiley","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61070203","61202484","20124307120033","B120608"],"award-info":[{"award-number":["61070203","61202484","20124307120033","B120608"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61070203","61202484","20124307120033","B120608"],"award-info":[{"award-number":["61070203","61202484","20124307120033","B120608"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Ministry of Education of China","doi-asserted-by":"crossref","award":["61070203","61202484","20124307120033","B120608"],"award-info":[{"award-number":["61070203","61202484","20124307120033","B120608"]}],"id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Excellent Graduate Innovation Foundation of NUDT","award":["61070203","61202484","20124307120033","B120608"],"award-info":[{"award-number":["61070203","61202484","20124307120033","B120608"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1155\/2013\/982713","type":"journal-article","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T19:01:48Z","timestamp":1385406108000},"page":"1-9","source":"Crossref","is-referenced-by-count":2,"title":["Hypergraph Modeling and Approximation Algorithms for the Minimum Length Link Scheduling in Multiuser MIMO Networks"],"prefix":"10.1155","volume":"2013","author":[{"given":"Hu","family":"Shen","sequence":"first","affiliation":[{"name":"Science and Technology on Parallel and Distributed Processing Laboratory, College of Computer, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaohe","family":"Lv","sequence":"additional","affiliation":[{"name":"Science and Technology on Parallel and Distributed Processing Laboratory, College of Computer, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0041-5006","authenticated-orcid":true,"given":"Xuan","family":"Dong","sequence":"additional","affiliation":[{"name":"Science and Technology on Parallel and Distributed Processing Laboratory, College of Computer, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junquan","family":"Deng","sequence":"additional","affiliation":[{"name":"Science and Technology on Parallel and Distributed Processing Laboratory, College of Computer, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Wang","sequence":"additional","affiliation":[{"name":"Science and Technology on Parallel and Distributed Processing Laboratory, College of Computer, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingming","family":"Zhou","sequence":"additional","affiliation":[{"name":"Science and Technology on Parallel and Distributed Processing Laboratory, College of Computer, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096405"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-009-0183-0"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.21215"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810646"},{"year":"1973","key":"10"},{"volume":"45","year":"1989","key":"11"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/2157.2158"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840398"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90246-6"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/982713.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/982713.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/982713.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,7,30]],"date-time":"2016-07-30T14:51:26Z","timestamp":1469890286000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/jam\/2013\/982713\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":9,"alternative-id":["982713","982713"],"URL":"https:\/\/doi.org\/10.1155\/2013\/982713","relation":{},"ISSN":["1110-757X","1687-0042"],"issn-type":[{"type":"print","value":"1110-757X"},{"type":"electronic","value":"1687-0042"}],"subject":[],"published":{"date-parts":[[2013]]}}}