TY - JOUR
T1 - Context-aware multimedia broadcast and multicast service area planning in 4G networks
AU - Hwang, Ren Hung
AU - Huang, Chi Fu
AU - Lin, Cheng Hsien
AU - Chung, Chih Yang
N1 - Publisher Copyright:
© 2015 Elsevier B.V.
PY - 2015/6/15
Y1 - 2015/6/15
N2 - With the increasing demand for multimedia transmissions, Multimedia Broadcast/Multicast Service (MBMS) has been standardized by 3GPP to confront the new challenges. In the MBMS system, a group of adjacent base stations (BSs) can form a multimedia broadcast single-frequency network (MBFSN) area, hereinafter referred to as MBSA, and are synchronized to collaboratively transmit multimedia data. By forming a MBSA, the MBMS users can avoid excessive inter-cell handovers as well as have better radio efficiency at the cell-edge. This paper studies the MBSA planning (MBSAP) problem under the constraints that each BS can supply only a limited number of video programs. With the information of the probability of user handover and popularity of video programs, MBSAP seeks to maximize the total system rewards by simultaneously: (1) arranging a list of video programs served by each BS, and (2) organizing BSs into a set of MBSAs. In this paper, the MBSAP problem is formulated as an Integer Linear Programming (ILP) problem. We also propose a genetic algorithm (GA) based algorithm and a Fusion-and-Refinement (FUSE) algorithm due to the high computational complexity of ILP. Simulation results show that the performance of GA and FUSE are competitive to that of ILP.
AB - With the increasing demand for multimedia transmissions, Multimedia Broadcast/Multicast Service (MBMS) has been standardized by 3GPP to confront the new challenges. In the MBMS system, a group of adjacent base stations (BSs) can form a multimedia broadcast single-frequency network (MBFSN) area, hereinafter referred to as MBSA, and are synchronized to collaboratively transmit multimedia data. By forming a MBSA, the MBMS users can avoid excessive inter-cell handovers as well as have better radio efficiency at the cell-edge. This paper studies the MBSA planning (MBSAP) problem under the constraints that each BS can supply only a limited number of video programs. With the information of the probability of user handover and popularity of video programs, MBSAP seeks to maximize the total system rewards by simultaneously: (1) arranging a list of video programs served by each BS, and (2) organizing BSs into a set of MBSAs. In this paper, the MBSAP problem is formulated as an Integer Linear Programming (ILP) problem. We also propose a genetic algorithm (GA) based algorithm and a Fusion-and-Refinement (FUSE) algorithm due to the high computational complexity of ILP. Simulation results show that the performance of GA and FUSE are competitive to that of ILP.
KW - Genetic algorithm
KW - MBSFN area planning
KW - Multicast broadcast service
KW - Multimedia broadcast/multicast service
UR - http://www.scopus.com/inward/record.url?scp=84930089778&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2015.02.010
DO - 10.1016/j.comcom.2015.02.010
M3 - Article
AN - SCOPUS:84930089778
VL - 64
SP - 33
EP - 43
JO - Computer Communications
JF - Computer Communications
SN - 0140-3664
ER -