File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Multiobjective optimized bipartite matching for resource allocation

TitleMultiobjective optimized bipartite matching for resource allocation
Authors
Sun, FLi, VOKDiao, Z
Issue Date2007
PublisherIEEE.
Citation
Iscit 2007 - 2007 International Symposium On Communications And Information Technologies Proceedings, 2007, p. 666-671 How to Cite?
DOI: http://dx.doi.org/10.1109/ISCIT.2007.4392101
AbstractThe Hungarian algorithm can provide the maximum weighted bipartite matching for assignment problems. However it can only solve the single objective weight optimization problem. In this paper, a modified bipartite matching (MBM) algorithm is proposed to solve the weighted bipartite matching problem with multiobjective optimization. In addition, our MBM algorithm is applicable to asymmetric bipartite graph, which is common in resource allocation problems. We illustrate the application of MBM to antenna assignments in wireless multipleinput multiple-output (MIMO) systems for both symmetric and asymmetric scenarios. The simulation results show that MBM enjoys low computational complexity and maximizes the system capacity, while keeping the fairness among mobile users. © 2007 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/57278
ISBN
978-142440977-8
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorSun, Fen_HK
dc.contributor.authorLi, VOKen_HK
dc.contributor.authorDiao, Zen_HK
dc.date.accessioned2010-04-12T01:31:37Z-
dc.date.available2010-04-12T01:31:37Z-
dc.date.issued2007en_HK
dc.identifier.citationIscit 2007 - 2007 International Symposium On Communications And Information Technologies Proceedings, 2007, p. 666-671en_HK
dc.identifier.isbn978-142440977-8-
dc.identifier.urihttp://hdl.handle.net/10722/57278-
dc.description.abstractThe Hungarian algorithm can provide the maximum weighted bipartite matching for assignment problems. However it can only solve the single objective weight optimization problem. In this paper, a modified bipartite matching (MBM) algorithm is proposed to solve the weighted bipartite matching problem with multiobjective optimization. In addition, our MBM algorithm is applicable to asymmetric bipartite graph, which is common in resource allocation problems. We illustrate the application of MBM to antenna assignments in wireless multipleinput multiple-output (MIMO) systems for both symmetric and asymmetric scenarios. The simulation results show that MBM enjoys low computational complexity and maximizes the system capacity, while keeping the fairness among mobile users. © 2007 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofISCIT 2007 - 2007 International Symposium on Communications and Information Technologies Proceedingsen_HK
dc.rights©2007 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.titleMultiobjective optimized bipartite matching for resource allocationen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ISCIT.2007.4392101en_HK
dc.identifier.scopuseid_2-s2.0-46749110486en_HK
dc.identifier.hkuros152531-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-46749110486&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage666en_HK
dc.identifier.epage671en_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