Cooperative diversity using per-user power control in the MAC channel

We consider a multiple access MAC fading channel with two users communicating with a common destination, where each user mutually acts as a relay for the other one as well as wishes to transmit its own information as opposed to having dedicated relays. We wish to evaluate the usefulness of relaying from the point of view of the system’s throughput (sum rate) rather than from the sole point of view of the user benefiting from the cooperation as is typically done. We do this by allowing a trade-off between relaying and fresh data transmission through a resource allocation framework. Specifically, We propose a cooperative transmission scheme allowing each user to allocate a certain amount of power for its own transmitted data while the rest is devoted to relaying. The underlying protocol is based on a modification of the so-called non-orthogonal amplify-and-forward (NAF) protocol Azarian et al. [18]. We develop capacity expressions for our scheme and derive the rate-optimum power allocation, in closed form for centralized and distributed frameworks. In the distributed scenario, partially statistical and partially instantaneous channel information is exploited.The centralized power allocation algorithm indicates that even in a mutual cooperation setting like ours, on any given realization of the channel, cooperation is never truly mutual, i.e. one of the users will always allocate zero power to relaying the data of the other one, and thus act selfishly. But in a distributed framework, our results indicate that the sum rate is maximized when both mobiles act selfishly.     

Latency minimization for IRS-assisted mobile edge computing networks

In this paper, we consider the latency minimization problem via designing intelligent reflecting surface (IRS)-assisted mobile edge computing (MEC) networks. For the scene when local users cannot complete all computing tasks independently, a common solution is transferring tasks to cloud servers. We consider that the MEC system contains multiple independent users, and each user sends task data to the base station in a partially offloaded manner. Our goal is to minimize the maximum latency for all users. The original problem is strongly non-convex, which caused difficulty to solve. We first introduce a new variable to transform the max–min problem into an alternative minimization problem, and then solve each optimization variable separately by the block coordinate descent method. Finally, our simulation experiments demonstrate that our proposed scheme obtain better performance with respect to other existing schemes.     

On the performance of a virtual user pairing scheme to efficiently utilize the spectrum of unpaired users in NOMA

This paper evaluates the performance of a virtual user pairing scheme that efficiently utilizes the spectrum of unpaired users in non-orthogonal multiple access (NOMA), termed as VP-NOMA. The scheme aims at utilizing the frequency bands of those users which remain unpaired due to the non-uniform distribution of users in a cellular area. We consider a case where the cell edge users are more than the cell center users, so that complete one-to-one correspondence does not exist between all cell center and cell edge users to be accommodated/paired using conventional NOMA (C-NOMA) user pairing. Thus, some cell edge users remain unpaired, and are served using conventional multiple access (OMA) schemes. In such scenario, VP-NOMA pairs a single cell center user with two or more clustered (closely located) cell edge users over non-overlapping frequency bands, thus enabling the cell center user to efficiently use the frequency bands of these previously unpaired cell edge users. Performance of VP-NOMA in terms of ergodic sum capacity (ESC), outage probability (OP), and outage sum capacity (OSC), is analyzed through comprehensive mathematical derivations and simulations for a generalized system model. Moreover, the mathematical analysis is validated through close concordance between analytical and simulation results of ESC, OP, and OSC.     

Optimal downlink power allocation in cellular networks

In this paper, we introduce a novel approach for power allocation in cellular networks. In our model, we use sigmoidal-like utility functions to represent different users’ modulation schemes. Each utility function is a representation of the probability of successfully transmitted packets per unit of power consumed by a user, when using a certain modulation scheme. We consider power allocation with utility proportional fairness policy, where the fairness among users is in utility percentage i.e. percentage of successfully transmitted packets of the corresponding modulation scheme. We formulate our power allocation optimization problem as a product of utilities of all users and prove that it is convex and therefore the optimal solution is tractable. We present a distributed algorithm to allocate base station powers optimally with priority given to users running lower modulation schemes while ensuring non-zero power allocation to users running higher modulation schemes. Our algorithm prevents fluctuation in the power allocation process and is capable of traffic and modulation dependent pricing policy. This can be used to flatten traffic and decrease the service price for users. We also compare our results with a benchmark algorithm and show that our algorithm performs better in allocating powers fairly to all users without dropping any user in order to maximize performance.     

Mobility-aware coded caching in D2D communication networks

In this paper, we consider a cache-enable device-to-device (D2D) communication network with user mobility and design a mobility-aware coded caching scheme to exploit multicasting opportunities for reducing network traffic. In addition to the static cache memory that can be used to reap coded caching gains, we assign a dynamic cache memory to mobile users such that users who never meet can still exchange contents via relaying. We consider content exchange as an information flow among dynamic cache memories of mobile users and leverage network coding to reduce network traffic. Specifically, we transfer our storage and broadcast problem into a network coding problem. By solving the formulated network coding problem, we obtain a dynamic content replacement and broadcast strategy. Numerical results verify that our algorithm significantly outperforms the random and greedy algorithms in terms of the amount of broadcasting data, and the standard Ford–Fulkerson algorithm in terms of the successful decoding ratio.     

Unsupervised LoS/NLoS identification in mmWave communication using two-stage machine learning framework

Identification of line-of-sight (LoS)/ non-LoS (NLoS) condition in millimeter wave (mmWave) communication is important for localization and unobstructed transmission between a base station (BS) and a user. A sudden obstruction in a link between a BS and a user can result in poorly received signal strength or termination of communication. Channel features obtained by the estimation of channel state information (CSI) of a user at the BS can be used for identifying LoS/NLoS condition. With the assumption of labeled CSI, existing machine learning (ML) methods have achieved satisfactory performance for LoS/NLoS identification. However, in a real communication environment, labeled CSI is not available. In this paper, we propose a two-stage unsupervised ML based LoS/NLoS identification framework to address the lack of labeled data. We conduct experiments for the outdoor scenario by generating data from the NYUSIM simulator. We compare the performance of our method with the supervised deep neural network (SDNN) in terms of accuracy and receiver characteristic curves. The proposed framework can achieve an accuracy of 87.4% and it outperforms SDNN. Further, we compare the performance of our method with other state-of-the-art LoS/NLoS identification schemes in terms of accuracy, recall, precision, and F1-score.     

Wireless Network Optimization for Federated Learning with Model Compression in Hybrid VLC/RF Systems

In this paper, the optimization of network performance to support the deployment of federated learning (FL) is investigated. In particular, in the considered model, each user owns a machine learning (ML) model by training through its own dataset, and then transmits its ML parameters to a base station (BS) which aggregates the ML parameters to obtain a global ML model and transmits it to each user. Due to limited radio frequency (RF) resources, the number of users that participate in FL is restricted. Meanwhile, each user uploading and downloading the FL parameters may increase communication costs thus reducing the number of participating users. To this end, we propose to introduce visible light communication (VLC) as a supplement to RF and use compression methods to reduce the resources needed to transmit FL parameters over wireless links so as to further improve the communication efficiency and simultaneously optimize wireless network through user selection and resource allocation. This user selection and bandwidth allocation problem is formulated as an optimization problem whose goal is to minimize the training loss of FL. We first use a model compression method to reduce the size of FL model parameters that are transmitted over wireless links. Then, the optimization problem is separated into two subproblems. The first subproblem is a user selection problem with a given bandwidth allocation, which is solved by a traversal algorithm. The second subproblem is a bandwidth allocation problem with a given user selection, which is solved by a numerical method. The ultimate user selection and bandwidth allocation are obtained by iteratively compressing the model and solving these two subproblems. Simulation results show that the proposed FL algorithm can improve the accuracy of object recognition by up to 16.7% and improve the number of selected users by up to 68.7%, compared to a conventional FL algorithm using only RF.     

Networks and emotion-driven user communities at popular blogs

Online communications at web portals represents technology-mediated user interactions, leading to massive data and potentially new techno-social phenomena not seen in real social mixing. Apart from being dynamically driven, the user interactions via posts is indirect, suggesting the importance of the contents of the posted material. We present a systematic way to study Blog data by combined approaches of physics of complex networks and computer science methods of text analysis. We are mapping the Blog data onto a bipartite network where users and posts with comments are two natural partitions. With the machine learning methods we classify the texts of posts and comments for their emotional contents as positive or negative, or otherwise objective (neutral). Using the spectral methods of weighted bipartite graphs, we identify topological communities featuring the users clustered around certain popular posts, and underly the role of emotional contents in the emergence and evolution of these communities.     

基于KL-散度的智能电网用户特征提取方法

智能电网技术的发展,使得传统电力系统的规模及复杂度大大增加,同时产生了大量的用电数据,如何有效利用数据挖掘技术,从这些海量数据中挖掘出有潜在价值的信息,成为了当前电力系统分析中的一个挑战性问题。首先根据不同的时间段,将用户的用电数据进行划分,在分析每段时间内用户用电数据的基础上,采用KL-divergence（KL-散度）方法衡量用户差异,并结合基于密度改进的K-means算法,给出了一种新的用户特征提取算法,用以描述电网用户的特征差异,从而实现针对不同类别用户制定不同电力营销策略,这在一定程度上能够提高企业经济效益。最后,算例仿真结果表明,所给出的用户特征提取算法在计算的时间效率和准确性上,较传统方法都有了明显的提升。     

VisAct: a visualization design system based on semantic actions

Current visualization design toolkits help users to explore data and create visualizations. However, most of these systems do not record the executed actions during the visualization construction process with semantic context. In this paper, we present VisAct, a visualization design system based on semantic actions, that helps average users to construct visualizations step by step. Our system contributes a set of action-based visualization components and a high-level grammar for semantic actions. VisAct also guides the visualization construction process and provides an action tracker for history management and data collection. We demonstrate the usability of VisAct by visualizations and a plugin application. Finally, we conduct a user study to evaluate the efficiency and effectiveness of our system.     

Optimal power allocation for maximizing the energy efficiency of NOMA enabled full-duplex coordinated direct and relay transmission (CDRT) system with SWIPT

In this paper, we investigate the energy efficiency (EE) performance of non-orthogonal multiple access (NOMA) enabled full-duplex (FD) coordinated direct and relay transmission (CDRT) system (i.e., NOMA-FD-CDRT system). Firstly, we consider a two-user scenario, where the base station (BS) can directly communicate with the near user, while it requires the help of a dedicated FD relay node to communicate with the far user. In the second part, we consider that there are two near users and two far users in the system. To improve the EE, we consider integrating the simultaneous wireless information and power transfer (SWIPT) technique at the FD relay. We formulate an analytical expression for the overall EE of the SWIPT-assisted NOMA-FD-CDRT system. We determine optimal power allocation (OPA) for the downlink users at the BS that maximizes the EE. An iterative algorithm based on Dinkelbach method is proposed to determine the OPA vector. With the help of detailed numerical and simulation investigations, it is demonstrated that the proposed OPA can provide significant enhancement of EE of the considered SWIPT-assisted NOMA-FD-CDRT system.     

Robust secrecy rate maximization in IRS-assisted cognitive radio networks

In this paper, we focus on the secrecy rate maximization problem in intelligent reflecting surface (IRS)-assisted cognitive radio (CR) networks. In order to improve the security, there is a common scheme to add artificial noise (AN) to the transmitted signal, which is also applied in this paper. Further, in CR networks, the secondary users always cannot obtain accurate channel state information (CSI) about the primary user and eavesdropper. By taking jointly design for the IRS phase shift matrix, the transmitted beamforming of the secondary base station (BS), and the covariance matrix of AN, our objective is to maximize the minimal secrecy rate of all secondary users. Due to the serious coupling among the designed variables, it cannot be solved by conventional methods. We propose an alternating optimization (AO) algorithm. In simulation results, we apply primary users and secondary users randomly distributed in the communication area, which numerically demonstrate the superiority of our proposed scheme.     

移动计算环境下远程用户体验数据挖掘方法研究

在移动计算环境下,通过对远程用户的体验数据优化挖掘,满足远程用户的个性化需求,提高对远程用户QoS服务质量。传统的数据挖掘方法采用显著特征关联信息提取算法,当远程用户体验数据之间的差异性特征不明显时,挖掘的准确性不好。提出一种基于关联用户自适应链路跟踪补偿的移动计算环境下远程用户体验数据挖掘模型,进行远程用户体验数据挖掘模型的总体设计和数据结构特征分析,对采集的远程用户体验数据进行非线性时间序列分解,对数据序列通过自相关特征匹配和特征压缩实现挖掘数据的指向性信息优化提取,采用关联用户自适应链路跟踪补偿方法实现对数据挖掘误差的控制和补偿,提高了数据挖掘的准确性和有效性。仿真结果表明,采用该挖掘方法进行移动计算环境下远程用户体验数据挖掘的准确度高,实时性较好,满足了移动远程用户的个性化需求,提高了对用户服务的针对性。     

Laser safety primer outline for industrial/medical users

Laser safety standards are detailed technical documents arising from the complexity of the different mechanisms, depending on the parameters of the laser beam, by which lasers interact with living tissue. As a result, their interpretation by non-expert laser users, who are concerned about safety issues, can cause many difficulties. Based on experience in advising industrial and medical laser users, we have developed a primer which (i) provides step-by-step guidance in the interpretation and use of the laser safety standards, and (ii) explains how to calculate the laser irradiance (on the retina or the skin) to which the user may be subjected in typical situations. A computer program has also been developed which, through a series of questions and answers, guides the user through the calculation of the maximum permissible exposure level and the nominal optical hazard distance for the application of interest. The overall package should be particularly useful to laser safety officers and users of lasers for research applications, as an independent check on safety calculations. It also provides a useful complement to the many worked examples in the laser safety standards.     

HF spectrum activity prediction model based on HMM for cognitive radio applications

Although most of the research on Cognitive Radio is focused on communication bands above the HF upper limit (30 MHz), Cognitive Radio principles can also be applied to HF communications to make use of the extremely scarce spectrum more efficiently. In this work we consider legacy users as primary users since these users transmit without resorting to any smart procedure, and our stations using the HFDVL (HF Data+Voice Link) architecture as secondary users. Our goal is to enhance an efficient use of the HF band by detecting the presence of uncoordinated primary users and avoiding collisions with them while transmitting in different HF channels using our broad-band HF transceiver.A model of the primary user activity dynamics in the HF band is developed in this work to make short-term predictions of the sojourn time of a primary user in the band and avoid collisions. It is based on Hidden Markov Models (HMM) which are a powerful tool for modelling stochastic random processes and are trained with real measurements of the 14 MHz band.By using the proposed HMM based model, the prediction model achieves an average 10.3% prediction error rate with one minute-long channel knowledge but it can be reduced when this knowledge is extended: with the previous 8 min knowledge, an average 5.8% prediction error rate is achieved.These results suggest that the resulting activity model for the HF band could actually be used to predict primary users activity and included in a future HF cognitive radio based station.     

Performance enhancement in the cell-free massive MIMO SWIPT system with active eavesdropping

This paper investigates the secure transmission for simultaneous wireless information and power transfer (SWIPT) in the cell-free massive multiple-input multiple-output (MIMO) system. To develop green communication, legitimate users harvest energy by the hybrid time switching (TS) and power splitting (PS) strategy in the downlink phase, and the harvested energy can provide power to send uplink pilot sequences for the next time slot. By in-built batteries, the active eavesdropper can send the same pilots with the wiretapped user, which results in undesirable correlations between the channel estimates. Under these scenarios, we derive the closed-form expressions of average harvested energy and achievable rates, and propose an iterative power control (PC) scheme based on max–min fairness algorithm with energy and secrecy constraints (MMF-ESC). This scheme can ensure the uniform good services for all users preserving the distributed architecture advantage of cell-free networks, while meeting the requirements of energy harvested by legitimate users and network security against active eavesdroppers. Besides, continuous approximation, bisection and path tracking are jointly applied to cope with the high-complexity and non-convex optimization. Numerical results demonstrate that MMF-ESC PC scheme can effectively increase the achievable rate and the average harvested energy of each user, and decrease the eavesdropping rate below the threshold. Moreover, the results also reveal that PS strategy is superior in harvesting energy in terms of more stringent network requirements for average achievable rates or security.     

On the Age of Information in a Two-User Multiple Access Setup

This work considers a two-user multiple access channel in which both users have Age of Information (AoI)-oriented traffic with different characteristics. More specifically, the first user has external traffic and cannot control the generation of status updates, and the second user monitors a sensor and transmits status updates to the receiver according to a generate-at-will policy. The receiver is equipped with multiple antennas and the transmitters have single antennas; the channels are subject to Rayleigh fading and path loss. We analyze the average AoI of the first user for a discrete-time first-come-first-served (FCFS) queue, last-come-first-served (LCFS) queue, and queue with packet replacement. We derive the AoI distribution and the average AoI of the second user for a threshold policy. Then, we formulate an optimization problem to minimize the average AoI of the first user for the FCFS and LCFS with preemption queue discipline to maintain the average AoI of the second user below a given level. The constraints of the optimization problem are shown to be convex. It is also shown that the objective function of the problem for the first-come-first-served queue policy is non-convex, and a suboptimal technique is introduced to effectively solve the problem using the algorithms developed for solving a convex optimization problem. Numerical results illustrate the performance of the considered optimization algorithm versus the different parameters of the system. Finally, we discuss how the analytical results of this work can be extended to capture larger setups with more than two users.     

Binary power allocation for cognitive radio networks with centralized and distributed user selection strategies

Motivated by the desire for efficient spectral utilization, we present a novel algorithm based on binary power allocation for sum rate maximization in Cognitive Radio Networks (CRN). At the core lies the idea of combining multi-user diversity gains with spectral sharing techniques and consequently maximizing the secondary user sum rate while maintaining a guaranteed quality of service (QoS) to the primary system. We consider a cognitive radio network consisting of multiple secondary transmitters and receivers communicating simultaneously in the presence of the primary system. Our analysis treats both uplink and downlink scenarios. We first present a distributed power allocation algorithm that attempts to maximize the throughput of the CRN. The algorithm is simple to implement, since a secondary user can decide to either transmit data or stay silent over the channel coherence time depending on a specified threshold, without affecting the primary users’ QoS. We then address the problem of user selection strategy in the context of CRN. Both centralized and distributed solutions are presented. Simulation results carried out based on a realistic network setting show promising results.     

CEPS: An Open Access MATLAB Graphical User Interface (GUI) for the Analysis of Complexity and Entropy in Physiological Signals

Background: We developed CEPS as an open access MATLAB^® GUI (graphical user interface) for the analysis of Complexity and Entropy in Physiological Signals (CEPS), and demonstrate its use with an example data set that shows the effects of paced breathing (PB) on variability of heart, pulse and respiration rates. CEPS is also sufficiently adaptable to be used for other time series physiological data such as EEG (electroencephalography), postural sway or temperature measurements. Methods: Data were collected from a convenience sample of nine healthy adults in a pilot for a larger study investigating the effects on vagal tone of breathing paced at various different rates, part of a development programme for a home training stress reduction system. Results: The current version of CEPS focuses on those complexity and entropy measures that appear most frequently in the literature, together with some recently introduced entropy measures which may have advantages over those that are more established. Ten methods of estimating data complexity are currently included, and some 28 entropy measures. The GUI also includes a section for data pre-processing and standard ancillary methods to enable parameter estimation of embedding dimension m and time delay τ (‘tau’) where required. The software is freely available under version 3 of the GNU Lesser General Public License (LGPLv3) for non-commercial users. CEPS can be downloaded from Bitbucket. In our illustration on PB, most complexity and entropy measures decreased significantly in response to breathing at 7 breaths per minute, differentiating more clearly than conventional linear, time- and frequency-domain measures between breathing states. In contrast, Higuchi fractal dimension increased during paced breathing. Conclusions: We have developed CEPS software as a physiological data visualiser able to integrate state of the art techniques. The interface is designed for clinical research and has a structure designed for integrating new tools. The aim is to strengthen collaboration between clinicians and the biomedical community, as demonstrated here by using CEPS to analyse various physiological responses to paced breathing.     

On the security of K-tier heterogeneous cellular networks

Motivated by recent developments in heterogeneous cellular networks and physical-layer security, we aim to characterize the fundamental limits of secure communication in networks. Based on a general model in which both transmitters and receivers are randomly scattered in space, we model the locations of K-tier base stations, users, and potential eavesdroppers as independent two-dimensional Poisson point processes. Using the proposed model, we analyze the achievable secrecy rates for an arbitrarily located mobile user. Assuming that the cell selection is based on achievable-secrecy-rate threshold, we obtain approximations for: (a) secrecy coverage probability and (b) average secrecy load per tier. We also investigate how the network performance is affected by secrecy rate threshold, eavesdropper density, and different access strategies are analyzed, respectively. Finally, our theoretical claims are confirmed by the numerical results.