Title :
Modified bipartite matching for multiobjective optimization
Author :
Sun, Fanglei ; Li, Victor O K ; Diao, Zhifeng
Author_Institution :
Univ. of Hong Kong, Pokfulam
fDate :
Oct. 30 2007-Nov. 2 2007
Abstract :
In graph theory, the Hungarian algorithm can provide the maximum weighted bipartite matching for assignment problems. In this paper, a modified bipartite matching (MBM) algorithm is proposed for multiobjective optimization. This algorithm can be widely used to solve the weighted bipartite matching problem with multiobjective optimization. We illustrate the application of MBM to antenna assignments in wireless MIMO system. The simulation results show that MBM enjoys low computational complexity and maximizes the system capacity, while keeping the fairness among mobile users.
Keywords :
MIMO systems; graph theory; mobile antennas; optimisation; radio access networks; Hungarian algorithm; MIMO system; antenna assignments; graph theory; mobile users; modified bipartite matching; multiobjective optimization; system capacity; Bipartite graph; Computational complexity; Graph theory; MIMO; Optimization methods; Quality of service; Sun; Throughput; Transmitting antennas; Wireless communication;
Conference_Titel :
TENCON 2007 - 2007 IEEE Region 10 Conference
Conference_Location :
Taipei
Print_ISBN :
978-1-4244-1272-3
Electronic_ISBN :
978-1-4244-1272-3
DOI :
10.1109/TENCON.2007.4428865
