Optimal scheduling of coordinated multipoint transmissions in cellular networks

Abstract

SummaryIn this paper, we study the optimal scheduling problem in coordinated multipoint (CoMP) transmission-based cellular networks. We consider joint transmission and coordinated scheduling together in CoMP transmission-based cellular networks and develop an optimization framework to compute the optimal max-min throughput and the optimal scheduling of the transmissions to the users. The optimization problem is found to be a complex linear program with number of variables in (N K ) for a cellular network of N users and K cells.We solve the optimization problem for several network instances using an optimization tool. The numerical results show that the optimal CoMP transmission provides a significant throughput gain over a traditional transmission. We find that in optimal scheduling the fraction time of coordinated scheduling is higher than that of joint transmission. To solve the optimization problem without any optimization tool, we propose a heuristic algorithm. The performance of the heuristic algorithm is evaluated and found to be provided throughput around 97% of the optimal throughput. Further, we extend the optimization framework to study joint scheduling and power allocation (JSPA) problem in CoMP transmission-based cellular networks. We numerically solve the JSPA problem for the network instances and demonstrate that the optimal power allocation at the base stations is not binary for a significant fraction of time of scheduling.However, the gain in max-min throughput by the optimal JSPA technique over the optimal scheduling technique is not significant.

A scheduler for SCADA-based multi-source fusion systems

“…The proposals that focus on resource that are connected through a communications network [11,23,36,38,46,47,50] do not seem easy to adapt because they depend on a variety of parameters that are highly dependent on the network and difficult to extrapolate to other contexts, e.g., signal strength or waveform. The proposals that focus on general resources [3,5,35,49,56,57,60] might be applicable by mapping each rendez-vous onto a shared resource for which the agents have to compete; the problem is that they were not designed to deal with resources that must be shared by two or more agents.…”

“…The idea to enforce fairness using a scheduler was soon adopted in the context of distributed systems [48] , where fairness is used to ensure that no resource remains idle forever or that no agent can starve forever. In the context of information fusion, there are some proposals that focus on resources that can be accessed by means of specificpurpose IoT networks [38,47] or general-purpose communication networks [11,23,36,46,50] ; there are also some proposals that deal with arbitrary resources [3,5,35,49,56,57,60] . Regarding agents, there are several proposals that focus on allocating them to the data centres [12] , the machines [22,31,41,55,58,59] , or the cores [14,24,43] that have more computing power available, since this helps prevent starvation.…”

Joint Power Allocation for Coordinated Multi-Point Diversity Transmission in Rayleigh Fading Channels

“…To derive the LQA CTP power expression in the conditionγ 1 ≥γ 2 , we first derive the boundary point. Givenγ 1 , we obtain Equation 7after substituting the boundary point condition (i.e., P * 2 = 0) into Equation (6).…”

“…Many studies on CoMP transmission technology have been conducted [3][4][5][6]. For CoMP transmission technology, expanded researches have been conducted recently such as the joint transmission techniques with adaptive modulation [3], spectrum resource allocation method for CoMP transmissions [4], as well as fundamental researches have been conducted steadily such as the coordinated beamforming techniques [5], the determination techniques of a CTP set [6]. In the context of wireless green communication [7], the total coordination point power (TCPP) over all CTPs in the cooperating set for a targeted UE could be constrained to a certain level [8][9][10].…”