The resource allocation for device-to-device(D2D)multicast communications is investigated.To achieve fair energy efficiency(EE)among different multicast groups,the max-min fairness criterion is used as the optimizatio...The resource allocation for device-to-device(D2D)multicast communications is investigated.To achieve fair energy efficiency(EE)among different multicast groups,the max-min fairness criterion is used as the optimization criterion and the EE of D2D multicast groups are taken as the optimization objective function.The aim is to maximize the minimum EE for different D2D multicast groups under the constraints of the maximum transmit power and minimum transmit rate,which is modeled as a non-convex and mixed-integer fractional programming problem.Here,suboptimal resource allocation algorithms are proposed to solve this problem.First,channel assignment scheme is performed to assign channel to D2D multicast groups.Second,for a given channel assignment,iterative power allocation schemes with and without loss of cellular users’rate are completed,respectively.Simulation results corroborate the convergence performance of the proposed algorithms.In addition,compared with the traditional throughput maximization algorithm,the proposed algorithms can improve the energy efficiency of the system and the fairness achieved among different multicast groups.展开更多
The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and ap...The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid （DNA） molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using O（n^3） time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation.展开更多
基金Projects(61801237,61701255)supported by the National Natural Science Foundation of ChinaProject(SBH17024)supported by the Postdoctoral Science Foundation of Jiangsu Province,China+2 种基金Project(15KJB510026)supported by the Natural Science Foundation of the Jiangsu Higher Education Institutions,ChinaProject(BK20150866)supported by the Natural Science Foundation of Jiangsu Province,ChinaProjects(NY215046,NY217056)supported by the Introduction of Talent Fund of Nanjing University of Posts and Telecommunications,China
文摘The resource allocation for device-to-device(D2D)multicast communications is investigated.To achieve fair energy efficiency(EE)among different multicast groups,the max-min fairness criterion is used as the optimization criterion and the EE of D2D multicast groups are taken as the optimization objective function.The aim is to maximize the minimum EE for different D2D multicast groups under the constraints of the maximum transmit power and minimum transmit rate,which is modeled as a non-convex and mixed-integer fractional programming problem.Here,suboptimal resource allocation algorithms are proposed to solve this problem.First,channel assignment scheme is performed to assign channel to D2D multicast groups.Second,for a given channel assignment,iterative power allocation schemes with and without loss of cellular users’rate are completed,respectively.Simulation results corroborate the convergence performance of the proposed algorithms.In addition,compared with the traditional throughput maximization algorithm,the proposed algorithms can improve the energy efficiency of the system and the fairness achieved among different multicast groups.
文摘The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid （DNA） molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using O（n^3） time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation.
