Auction-Based Distributed Resource Allocation for Cooperation Transmission in Wireless Networks

Cooperative transmission can greatly improve communication system performance by taking advantage of the broadcast nature of wireless channels. Most previous work on resource allocation for cooperation transmission is based on centralized control. In this paper, we propose two share auction mechanisms, the SNR auction and the power auction, to distributively coordinate the resource allocation among users. We prove the existence, uniqueness and effectiveness of the auction results. In particular, the SNR auction leads to a fair resource allocation among users, and the power auction achieves a solution that is close to the efficient allocation.Comment: To appear in the Proceedings of the IEEE IEEE Global Communications Conference (GLOBECOM), Washington, DC, November 26 - 30, 200

Auction-based Resource Allocation for Multi-relay Asynchronous Cooperative Networks

Resource allocation is considered for cooperative transmissions in multiple-relay wireless networks. Two auction mechanisms, SNR auctions and power auctions, are proposed to distributively coordinate the allocation of power among multiple relays. In the SNR auction, a user chooses the relay with the lowest weighted price. In the power auction, a user may choose to use multiple relays simultaneously, depending on the network topology and the relays' prices. Sufficient conditions for the existence (in both auctions) and uniqueness (in the SNR auction) of the Nash equilibrium are given. The fairness of the SNR auction and efficiency of the power auction are further discussed. It is also proven that users can achieve the unique Nash equilibrium distributively via best response updates in a completely asynchronous manner.Comment: To appear in the Proceedings of the 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, Las Vegas, NV, March 30 to April 4, 200

Communication Theoretic Data Analytics

Widespread use of the Internet and social networks invokes the generation of big data, which is proving to be useful in a number of applications. To deal with explosively growing amounts of data, data analytics has emerged as a critical technology related to computing, signal processing, and information networking. In this paper, a formalism is considered in which data is modeled as a generalized social network and communication theory and information theory are thereby extended to data analytics. First, the creation of an equalizer to optimize information transfer between two data variables is considered, and financial data is used to demonstrate the advantages. Then, an information coupling approach based on information geometry is applied for dimensionality reduction, with a pattern recognition example to illustrate the effectiveness. These initial trials suggest the potential of communication theoretic data analytics for a wide range of applications.Comment: Published in IEEE Journal on Selected Areas in Communications, Jan. 201

Energy Efficient User Association and Power Allocation in Millimeter Wave Based Ultra Dense Networks with Energy Harvesting Base Stations

Millimeter wave (mmWave) communication technologies have recently emerged as an attractive solution to meet the exponentially increasing demand on mobile data traffic. Moreover, ultra dense networks (UDNs) combined with mmWave technology are expected to increase both energy efficiency and spectral efficiency. In this paper, user association and power allocation in mmWave based UDNs is considered with attention to load balance constraints, energy harvesting by base stations, user quality of service requirements, energy efficiency, and cross-tier interference limits. The joint user association and power optimization problem is modeled as a mixed-integer programming problem, which is then transformed into a convex optimization problem by relaxing the user association indicator and solved by Lagrangian dual decomposition. An iterative gradient user association and power allocation algorithm is proposed and shown to converge rapidly to an optimal point. The complexity of the proposed algorithm is analyzed and the effectiveness of the proposed scheme compared with existing methods is verified by simulations.Comment: to appear, IEEE Journal on Selected Areas in Communications, 201

Decentralized Beamforming Design for Intelligent Reflecting Surface-enhanced Cell-free Networks

Cell-free networks are considered as a promising distributed network architecture to satisfy the increasing number of users and high rate expectations in beyond-5G systems. However, to further enhance network capacity, an increasing number of high-cost base stations (BSs) are required. To address this problem and inspired by the cost-effective intelligent reflecting surface (IRS) technique, we propose a fully decentralized design framework for cooperative beamforming in IRS-aided cell-free networks. We first transform the centralized weighted sum-rate maximization problem into a tractable consensus optimization problem, and then an incremental alternating direction method of multipliers (ADMM) algorithm is proposed to locally update the beamformer. The complexity and convergence of the proposed method are analyzed, and these results show that the performance of the new scheme can asymptotically approach that of the centralized one as the number of iterations increases. Results also show that IRSs can significantly increase the system sum-rate of cell-free networks and the proposed method outperforms existing decentralized methods.Comment: 5 pages, 6 figure

Differentially Private Wireless Federated Learning Using Orthogonal Sequences

We propose a privacy-preserving uplink over-the-air computation (AirComp) method, termed FLORAS, for single-input single-output (SISO) wireless federated learning (FL) systems. From the perspective of communication designs, FLORAS eliminates the requirement of channel state information at the transmitters (CSIT) by leveraging the properties of orthogonal sequences. From the privacy perspective, we prove that FLORAS offers both item-level and client-level differential privacy (DP) guarantees. Moreover, by properly adjusting the system parameters, FLORAS can flexibly achieve different DP levels at no additional cost. A new FL convergence bound is derived which, combined with the privacy guarantees, allows for a smooth tradeoff between the achieved convergence rate and differential privacy levels. Experimental results demonstrate the advantages of FLORAS compared with the baseline AirComp method, and validate that the analytical results can guide the design of privacy-preserving FL with different tradeoff requirements on the model convergence and privacy levels.Comment: 33 pages, 5 figure

Individual prognosis at diagnosis in nonmetastatic prostate cancer: Development and external validation of the PREDICT Prostate multivariable model.

BACKGROUND: Prognostic stratification is the cornerstone of management in nonmetastatic prostate cancer (PCa). However, existing prognostic models are inadequate-often using treatment outcomes rather than survival, stratifying by broad heterogeneous groups and using heavily treated cohorts. To address this unmet need, we developed an individualised prognostic model that contextualises PCa-specific mortality (PCSM) against other cause mortality, and estimates the impact of treatment on survival. METHODS AND FINDINGS: Using records from the United Kingdom National Cancer Registration and Analysis Service (NCRAS), data were collated for 10,089 men diagnosed with nonmetastatic PCa between 2000 and 2010 in Eastern England. Median follow-up was 9.8 years with 3,829 deaths (1,202 PCa specific). Totals of 19.8%, 14.1%, 34.6%, and 31.5% of men underwent conservative management, prostatectomy, radiotherapy (RT), and androgen deprivation monotherapy, respectively. A total of 2,546 men diagnosed in Singapore over a similar time period represented an external validation cohort. Data were randomly split 70:30 into model development and validation cohorts. Fifteen-year PCSM and non-PCa mortality (NPCM) were explored using separate multivariable Cox models within a competing risks framework. Fractional polynomials (FPs) were utilised to fit continuous variables and baseline hazards. Model accuracy was assessed by discrimination and calibration using the Harrell C-index and chi-squared goodness of fit, respectively, within both validation cohorts. A multivariable model estimating individualised 10- and 15-year survival outcomes was constructed combining age, prostate-specific antigen (PSA), histological grade, biopsy core involvement, stage, and primary treatment, which were each independent prognostic factors for PCSM, and age and comorbidity, which were prognostic for NPCM. The model demonstrated good discrimination, with a C-index of 0.84 (95% CI: 0.82-0.86) and 0.84 (95% CI: 0.80-0.87) for 15-year PCSM in the UK and Singapore validation cohorts, respectively, comparing favourably to international risk-stratification criteria. Discrimination was maintained for overall mortality, with C-index 0.77 (95% CI: 0.75-0.78) and 0.76 (95% CI: 0.73-0.78). The model was well calibrated with no significant difference between predicted and observed PCa-specific (p = 0.19) or overall deaths (p = 0.43) in the UK cohort. Key study limitations were a relatively small external validation cohort, an inability to account for delayed changes to treatment beyond 12 months, and an absence of tumour-stage subclassifications. CONCLUSIONS: 'PREDICT Prostate' is an individualised multivariable PCa prognostic model built from baseline diagnostic information and the first to our knowledge that models potential treatment benefits on overall survival. Prognostic power is high despite using only routinely collected clinicopathological information.The Urology Foundatio