Mobile-Service Based Max-Min Fairness Resource Scheduling for Heterogeneous Vehicular Networks

This paper investigates the resource scheduling for heterogeneous vehicular networks, where some moving vehicles are selected and scheduled as helping relays to assist information transmission between the roadside infrastructure and other moving vehicles. For such a system, we propose a mobile-service based max-min fairness resource scheduling scheme, where service amount which is more suitable for high mobility scenarios is adopted to characterize the information transmission capacity of the links and the max-min criteria is adopted to meet the fairness requirement of the moving vehicles. Simulation results demonstrate the effectiveness of our proposed scheme. It is shown that our proposed scheme archives higher throughput and better fairness compared with random scheduling scheme and non-relaying scheme.

Ada-FFL:Adaptive computing fairness federated learning

As the scale of federated learning expands,solving the Non-IID data problem of federated learning has become a key challenge of interest.Most existing solutions generally aim to solve the overall performance improvement of all clients;however,the overall performance improvement often sacrifices the performance of certain clients,such as clients with less data.Ignoring fairness may greatly reduce the willingness of some clients to participate in federated learning.In order to solve the above problem,the authors propose Ada-FFL,an adaptive fairness federated aggregation learning algorithm,which can dynamically adjust the fairness coefficient according to the update of the local models,ensuring the convergence performance of the global model and the fairness between federated learning clients.By integrating coarse-grained and fine-grained equity solutions,the authors evaluate the deviation of local models by considering both global equity and individual equity,then the weight ratio will be dynamically allocated for each client based on the evaluated deviation value,which can ensure that the update differences of local models are fully considered in each round of training.Finally,by combining a regularisation term to limit the local model update to be closer to the global model,the sensitivity of the model to input perturbations can be reduced,and the generalisation ability of the global model can be improved.Through numerous experiments on several federal data sets,the authors show that our method has more advantages in convergence effect and fairness than the existing baselines.

Fairness-Oriented Hybrid Precoding for Massive MIMO Maritime Downlink Systems with Large-Scale CSIT

Different from conventional cellular networks, a maritime communication base station(BS) has to cover a much wider area due to the limitation of available BS sites. Accordingly the performance of users far away from the BS is poor in general. This renders the fairness among users a challenging issue for maritime communications. In this paper, we consider a practical massive MIMO maritime BS with hybrid digital and analog precoding. Only the large-scale channel state information at the transmitter(CSIT) is considered so as to reduce the implementation complexity and overhead of the system. On this basis, we address the problem of fairness-oriented precoding design. A max-min optimization problem is formulated and solved in an iterative way. Simulation results demonstrate that the proposed scheme performs much better than conventional hybrid precoding algorithms in terms of minimum achievable rate of all the users, for the typical three-ray maritime channel model.

Max-Min Fair RIS-Aided Rate-Splitting Multiple Access for Multigroup Multicast Communications

Rate-splitting multiple access(RSMA)can cope with a wide range of propagation conditions in multigroup multicast communications through rate splitting optimization.To breakthrough the grouprate limited bottleneck,reconfigurable intelligent surface(RIS)technique can be introduced to assist wireless communications through enhancing the channel quality.In RIS-aided RSMA multigroup multicasting,how to provide fair and high-quality multiuser service under power and spectrum constraints is essential.In this paper,we propose a max-min fair RIS-aided rate-splitting multiple access(MMF-RISRSMA)scheme for multigroup multicast communications,where the rate fairness is obtained by maximizing the minimum group-rate.In doing so,we jointly optimize the beamformers,the rate splitting vector at the transmitter,as well as the phase shifts at RIS.To solve it,we divide the original optimization problem into two subproblems and alternately optimize the variables.The beamforming and rate splitting optimization subproblem is solved by using the successive convex approximation technique.The phase shift optimization subproblem is solved through the penalty function method to achieve a rank-one locally optimal solution.Simulations demonstrate that the proposed MMF-RIS-RSMA scheme can obtain significant performance gain in terms of the minimum group-rate.

Resource allocation based on fairness and QoS provisioning for OFDMA-WLAN system

To satisfy different service requirements of multiple users in the orthogo nal frequency division multiple access wireless local area network OFDMA-WLAN system downlink transmission a resource allocation algorithm based on fairness and quality of service QoS provisioning is proposed. Different QoS requirements are converted into different rate requirements to calculate the QoSs atisfaction level.The optimization object is revised as a fairness-driven resource optimization function to provide fairness. The complex resource allocation problem is divided into channel allocation and power assignment sub-problems. The sub-problems are solved by the bipartite graph matching and water-filling based method.Compared with other algorithms the proposed algorithm sacrifices less data rate for higher fairnes and QoS satisfaction.The sim ulation results show that the proposed algorithm is capableo fp rovi ding QoS and fairness and performs better in a tradeoff among QoS fairness and data rate.

分层组播中INTER-SESSION FAIRNESS问题的分析与对策

通过一组实验结果分析现有分层多速率组播协议的速率控制机制中存在的会话间公平性问题,提出在组播分层解决方案中,以一种基于Max-Min公平性的速率分配计算算法,在网络状态改变时得到共存于网络环境中的各虚会话的公平速率分配集,并辅以二分法,对取值于连续数据集合上的速率分配集进行不同粒度上的离散化整合。实验结果表明该方案使得分层组播在保证会话间公平性的前提下,提高了流量控制的高效性和灵敏性。

期刊论文支撑数据FAIR原则的应用评估与案例分析

[目的/意义]FAIR原则在科技期刊的应用有助于增强期刊论文支撑数据的可发现、交互、共享与重用。评估FAIR实施情况有利于其推广实施,以期为我国期刊论文的支撑数据共享与重用提供有益参考。[方法/过程]本文在国外FAIR原则评估模型的基础上,综合考虑各模型的优势和指标设计特点,结合《数据分析与知识发现》期刊论文相关的科学数据特征,构建FAIR原则指标评价体系,基于该体系从4个维度分析调研结果,最后对中文期刊论文的支撑数据FAIR应用提出合理化建议与优化策略。[结果/结论]FAIR原则在期刊论文支撑数据的应用仍需进一步完善,科研人员的数据共享意识及对于FAIR原则的认知度远远不够,建议从宏观和微观两个层面推广FAIR原则及其实施,推动数据更加开放和可重用。

政府开放数据平台FAIR原则评估指标体系及实证研究

[目的/意义]评估政府开放数据平台FAIR原则的实施效果有助于平台规范标识符、统一元数据标准等,增强政府数据的发现、共享和重用。[方法/过程]采用网络调研法,借鉴国际代表性评估框架,结合调研构建面向政府开放数据平台的FAIR原则评估指标体系,并选取国内外8个样本平台作为案例,从可发现、可访问等4个维度展开评估分析,比较FAIR原则实施状况和差异。[结果/结论]从永久性标识符方案、元数据标准规范、数据使用许可等方面提出相应改进策略,完善国内政府开放数据平台数据管理规范,为后续相关平台的建设与利用提供理论指导和实践借鉴。

基于FAIR原则的数据期刊开放共享与关联模型研究

[目的/意义]为揭示数据论文与期刊论文关联出版的新形态,对目前数据期刊的开放共享、数据论文与期刊论文之间的关联进行研究,有助于推动科学数据的开放共享发展,促进科学数据的高效流通,使科学数据在多层维度释放数据价值。[方法/过程]基于FAIR原则,从元数据元素、文献服务等角度出发,构建数据流向视角下数据论文与期刊论文之间的互关联模型,分析数据论文与期刊论文之间的关联过程,并选取代表性数据期刊Data in Brief的数据论文为实例展开模型验证与实践参照。[结果/结论]本文基于“可访问”“可发现”对“开放共享”展开研究;基于“可互操作”和“可重用”对“关联”展开研究。通过构建理论模型、实例验证,厘清数据论文与期刊论文之间的关联模式以及验证理论模型的可行性与合理性。

DMMF: Dominant and Max-Min Fair Allocation in Satellite Networks

Resource allocation is crucial for satellite networks. In this paper, we propose a multi-resource fair allocation scheme, namely Dominant and Max-min Fair(DMMF), to efficiently and fairly allocate resources. It consists of two allocation stages, dominant resource fair(DRF) allocation stage and max-min fairness(MMF) allocation stage. The proposed DMMF scheme exhibits desirable properties, including share incentive, strategy proofness, envy freeness and Pareto optimality. Meanwhile, DMMF can improve the allocation efficiency and reach 100% allocation efficiency.

Proportional Fairness-Based Energy-Efficient Power Allocation in Downlink MIMO-NOMA Systems with Statistical CSI

In this paper, proportional fairness(PF)-based energy-efficient power allocation is studied for multiple-input multiple-output(MIMO) non-orthogonal multiple access(NOMA) systems. In our schemes, statistical channel state information(CSI) is utilized for perfect CSI is impossible to achieve in practice. PF is used to balance the transmission efficiency and user fairness. Energy efficiency(EE) is formulated under basic data rate requirements and maximum transmitting power constraints. Due to the non-convex nature of EE, a two-step algorithm is proposed to obtain sub-optimal solution with a low complexity. Firstly, power allocation is determined by golden section search for fixed power. Secondly total transmitting power is determined by fractional programming method in the feasible regions. Compared to the performance of MIMO-NOMA without PF constraint, fairness is obtained at expense of decreasing of EE.

Integration of α-fairness with DEA based resource allocation model

How to allocate a resource efficiently and fairly attracts the attention of both researchers and practitioners. Data envelopment analysis（DEA） has been brought to bear on its solution. The existing literature applies Gini coefficient to measure the fairness in the resource allocation process. However, the Gini coefficient is inapplicable in many applications. This paper proposes a novel centralized resource allocation model based on DEA that considers both the efficiency and the fairness. This paper adopts a notion of fairness, namely α-fairness that is well studied in welfare economics and is of practical significance. The new model integratesα-fairness with DEA to support resource allocation decisions. It aids decision makers in making a trade-off between the efficiency and the fairness. An illustrative application is used to validate the proposed approach.

Power Splitting Based SWIPT in Network-Coded Two-Way Networks with Data Rate Fairness:An Information-Theoretic Perspective

This paper investigates the simultaneous wireless information and powertransfer(SWIPT) for network-coded two-way relay network from an information-theoretic perspective, where two sources exchange information via an SWIPT-aware energy harvesting(EH) relay. We present a power splitting(PS)-based two-way relaying(PS-TWR) protocol by employing the PS receiver architecture. To explore the system sum rate limit with data rate fairness, an optimization problem under total power constraint is formulated. Then, some explicit solutions are derived for the problem. Numerical results show that due to the path loss effect on energy transfer, with the same total available power, PS-TWR losses some system performance compared with traditional non-EH two-way relaying, where at relatively low and relatively high signalto-noise ratio(SNR), the performance loss is relatively small. Another observation is that, in relatively high SNR regime, PS-TWR outperforms time switching-based two-way relaying(TS-TWR) while in relatively low SNR regime TS-TWR outperforms PS-TWR. It is also shown that with individual available power at the two sources, PS-TWR outperforms TS-TWR in both relatively low and high SNR regimes.

政策文本视角下我国国家科学数据中心FAIR化特征初探

[目的/意义]对我国国家科学数据中心数据政策的FAIR化特征进行探索,为我国数据中心的数据管理政策制定和工作优化提供初步参考。[方法/过程]综合运用网络调研和文本挖掘的方法,使用KH Coder内容挖掘软件对20家数据中心的79部数据政策进行量化文本分析。通过对FAIR原则在政策文本中的出现频次和高相似词汇的分析,揭示FAIR原则在各个数据中心、不同类型政策文本中表现出的关注度差异与语义特征。[结果/结论]数据中心的数据政策已体现了一定的FAIR原则理念,但对每项FAIR原则的关注度不均衡;不同类型的数据政策关注FAIR原则的不同方面,共性在于对可发现原则和可互操作原则比较关注;对元数据给予了重点关注。[创新/价值]建议数据中心在数据政策制定中突出“元数据”在数据全生命周期管理中的作用,推动“数据增值驱动”的数据政策体系构建,并立足我国科学数据管理实际,适度引入FAIR原则。

A Fairness Resource Allocation Algorithm for Coverage and Capacity Optimization in Wireless Self-Organized Network

To achieve the higher resource efficiency, Coverage and Capacity Optimization(CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network(SON). In this paper, a novel CCO scheme is proposed to maximize utility function of the integrated coverage and capacity. It starts with the analysis on the throughput proportional fairness(PF) algorithm and then proposes the novel Coverage and Capacity Proportional Fairness(CCPF) allocation algorithm along with a proof of the algorithms convergence. This proposed algorithm is applied in a coverage capacity optimization scheme which can guarantee the reasonable network capacity by the coverage range accommodation. Next, we simulate the proposed CCO scheme based on telecom operators' real network data and compare with three typical resource allocation algorithms: round robin(RR), proportional fairness(PF) and max C/I. In comparison of the PF algorithm, the numerical results show that our algorithm increases the average throughput by 1.54 and 1.96 times with constructed theoretical data and derived real network data respectively.

A Universal Fairness Evaluation Framework for Resource Allocation in Cloud Computing

In cloud computing,fairness is one of the most significant indicators to evaluate resource allocation algorithms,which reveals whether each user is allocated as much as that of all other users having the same bottleneck.However,how fair an allocation algorithm is remains an urgent issue.In this paper,we propose Dynamic Evaluation Framework for Fairness(DEFF),a framework to evaluate the fairness of an resource allocation algorithm.In our framework,two sub-models,Dynamic Demand Model(DDM) and Dynamic Node Model(DNM),are proposed to describe the dynamic characteristics of resource demand and the computing node number under cloud computing environment.Combining Fairness on Dominant Shares and the two sub-models above,we finally obtain DEFF.In our experiment,we adopt several typical resource allocation algorithms to prove the effectiveness on fairness evaluation by using the DEFF framework.

A New Fairness-Oriented Packet Scheduling Scheme with Reduced Channel Feedback for OFDMA Packet Radio Systems

In this paper, we propose a flexible and fairness-oriented packet scheduling approach for 3GPP UTRAN long term evolution (LTE) type packet radio systems, building on the ordinary proportional fair (PF) scheduling principle and channel quality indicator (CQI) feedback. Special emphasis is also put on practical feedback reporting mechanisms, including the effects of mobile measurement and estimation errors, reporting delays, and CQI quantization and compression. The performance of the overall scheduling and feedback re-porting process is investigated in details, in terms of cell throughput, coverage and resource allocation fairness, by using extensive quasistatic cellular system simulations in practical OFDMA system environment with frequency reuse of 1. The performance simulations show that by using the proposed modified PF ap-proach, significant coverage improvements in the order of 50% can be obtained at the expense of only 10-15% throughput loss, for all reduced feedback reporting schemes. This reflects highly improved fairness in the radio resource management (RRM) compared to other existing schedulers, without essentially com-promising the cell capacity. Furthermore, we demonstrate the improved functionality increase in radio re-source management for UE’s utilizing multi-antenna diversity receivers.

A Discrimination Index Based on Jain's Fairness Index to Differentiate Researchers with Identical H-index Values

Purpose:This paper proposes a discrimination index method based on the Jain’s fairness index to distinguish researchers with the same H-index.Design/methodology/approach:A validity test is used to measure the correlation of D-offset with the parameters,i.e.H-index,the number of cited papers,the total number of citations,the number of indexed papers,and the number of uncited papers.The correlation test is based on the Saphiro-Wilk method and Pearson’s product-moment correlation.Findings:The result from the discrimination index calculation is a two-digit decimal value called the discrimination-offset(D-offset),with a range of D-offset from 0.00 to 0.99.The result of the correlation value between the D-offset and the number of uncited papers is 0.35,D-offset with the number of indexed papers is 0.24,and the number of cited papers is 0.27.The test provides the result that it is very unlikely that there exists no relationship between the parameters.Practical implications:For this reason,D-offset is proposed as an additional parameter for H-index to differentiate researchers with the same H-index.The H-index for researchers can be written with the format of“H-index:D-offset”.Originality/value:D-offset is worthy to be considered as a complement value to add the H-index value.If the D-offset is added in the H-index value,the H-index will have more discrimination power to differentiate the rank of the researchers who have the same H-index.

A Method for Assessing the Fairness of Health Resource Allocation Based on Geographical Grid

The assessment of the fairness of health resource allocation is an important part of the study for the fairness of social development.The data used in most of the existing assessment methods comes from statistical yearbooks or field survey sampling.These statistics are generally based on administrative areas and are difficult to support a fine-grained evaluation model.In response to these problems,the evaluation method proposed in this paper is based on the query statistics of the geographic grid of the target area,which are more accurate and efficient.Based on the query statistics of hot words in the geographic grids,this paper adopts the maximum likelihood estimation method to estimate the population in the grid region.Then,according to the statistical yearbook data of Hunan province,the estimated number and actual number of hospitals in each grid are analyzed and compared to measure the fairness of health resource allocation in the target region.Experiments show that the geographical grid population assessment based on hot words is more accurate and close to the actual value.The estimated average error is only about 17.8 percent.This method can assess the fairness of health resource allocation in any scale,and is innovative in data acquisition and evaluation methods.

A New Multi-Resource Allocation Mechanism： A Tradeoff between Fairness and Efficiency in Cloud Computing

This paper addresses multi-resource fair allocation: a fundamental research topic in cloud computing. To improve resource utilization under well-studied fairness constraints, we propose a new allocation mechanism called Dominant Resource with Bottlenecked Fairness(DRBF), which generalizes Bottleneck-aware Allocation(BAA) to the settings of Dominant Resource Fairness(DRF). We classify users into different queues by their dominant resources. The goals are to ensure that users in the same queue receive allocations in proportion to their fair shares while users in different queues receive allocations that maximize resource utilization subject to well-studied fairness properties such as those in DRF. Under DRBF, no user 1) is worse off sharing resources than dividing resources equally among all users; 2) prefers the allocation of another user; 3) can improve their own allocation without reducing other users' allocations; and(4) can benefit by misreporting their resource demands. Experiments demonstrate that the proposed allocation policy performs better in terms of high resource utilization than does DRF.