File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Modified bipartite matching for multiobjective optimization: Application to antenna assignments in MIMO systems

TitleModified bipartite matching for multiobjective optimization: Application to antenna assignments in MIMO systems
Authors
KeywordsBipartite matching
Multi-objective optimization
Resource allocation
Issue Date2009
PublisherIEEE.
Citation
Ieee Transactions On Wireless Communications, 2009, v. 8 n. 3, p. 1349-1355 How to Cite?
AbstractBased on the Hungarian algorithm, the Kuhn-Munkres algorithm can provide the maximum weight bipartite matching for assignment problems. However, it can only solve the single objective optimization problem. In this paper, we formulate the multi-objective optimization (MO) problem for bipartite matching, and propose a modified bipartite matching (MBM) algorithm to approach the Pareto set with a low computational complexity and to dynamically select proper solutions with given constraints among the reduced matching set. In addition, our MBM algorithm is extended to the case of asymmetric bipartite graphs. Finally, we illustrate the application of MBM to antenna assignments in wireless multiple-input multiple-output (MIMO) systems for both symmetric and asymmetric scenarios, where we consider the multi-objective optimization problem with the maximization of the system capacity, total traffic priority, and long-term fairness among all mobile users. The simulation results show that MBM can effectively reduce the matching set and dynamically provide the optimized performance with different quality of service (QoS) requirements. © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/58726
ISSN
2015 Impact Factor: 2.925
2015 SCImago Journal Rankings: 2.340
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorSun, Fen_HK
dc.contributor.authorLi, VOKen_HK
dc.contributor.authorDiao, Zen_HK
dc.date.accessioned2010-05-31T03:35:49Z-
dc.date.available2010-05-31T03:35:49Z-
dc.date.issued2009en_HK
dc.identifier.citationIeee Transactions On Wireless Communications, 2009, v. 8 n. 3, p. 1349-1355en_HK
dc.identifier.issn1536-1276en_HK
dc.identifier.urihttp://hdl.handle.net/10722/58726-
dc.description.abstractBased on the Hungarian algorithm, the Kuhn-Munkres algorithm can provide the maximum weight bipartite matching for assignment problems. However, it can only solve the single objective optimization problem. In this paper, we formulate the multi-objective optimization (MO) problem for bipartite matching, and propose a modified bipartite matching (MBM) algorithm to approach the Pareto set with a low computational complexity and to dynamically select proper solutions with given constraints among the reduced matching set. In addition, our MBM algorithm is extended to the case of asymmetric bipartite graphs. Finally, we illustrate the application of MBM to antenna assignments in wireless multiple-input multiple-output (MIMO) systems for both symmetric and asymmetric scenarios, where we consider the multi-objective optimization problem with the maximization of the system capacity, total traffic priority, and long-term fairness among all mobile users. The simulation results show that MBM can effectively reduce the matching set and dynamically provide the optimized performance with different quality of service (QoS) requirements. © 2006 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofIEEE Transactions on Wireless Communicationsen_HK
dc.rightsIEEE Transactions on Wireless Communications. Copyright © IEEE.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectBipartite matchingen_HK
dc.subjectMulti-objective optimizationen_HK
dc.subjectResource allocationen_HK
dc.titleModified bipartite matching for multiobjective optimization: Application to antenna assignments in MIMO systemsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1536-1276&volume=8&issue=3&spage=1349&epage=1355&date=2009&atitle=Modified+bipartite+matching+for+multiobjective+optimization:+Application+to+antenna+assignments+in+MIMO+systemsen_HK
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/TWC.2009.071351en_HK
dc.identifier.scopuseid_2-s2.0-62949091439en_HK
dc.identifier.hkuros166650en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-62949091439&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume8en_HK
dc.identifier.issue3en_HK
dc.identifier.spage1349en_HK
dc.identifier.epage1355en_HK
dc.identifier.isiWOS:000264293200043-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridSun, F=8267663500en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK
dc.identifier.scopusauthoridDiao, Z=8415199800en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats