Exploiting Direct Links for Physical Layer Security in Multi-User Multi-Relay Networks

We present two physical layer secure transmission schemes for multi-user multi-relay networks, where the communication from M users to the base station is assisted by direct links and by N decode-and-forward relays. In this network, we consider that a passive eavesdropper exists to overhear the transmitted information, which entails exploiting the advantages of both direct and relay links for physical layer security enhancement. To fulfill this requirement, we investigate two criteria for user and relay selection and examine the achievable secrecy performance. Criterion I performs a joint user and relay selection, while Criterion II performs separate user and relay selections, with a lower implementation complexity. We derive a tight lower bound on the secrecy outage probability for Criterion I and an accurate analytical expression for the secrecy outage probability for Criterion II. We further derive the asymptotic secrecy outage probabilities at high transmit signal-to-noise ratios and high main-to-eavesdropper ratios for both criteria. We demonstrate that the secrecy diversity order is min (MN, M + N) for Criterion I, and N for Criterion II. Finally, we present numerical and simulation results to validate the proposed analysis, and show the occurrence condition of the secrecy outage probability floor

The κ− μ / Inverse Gamma Fading Model

Statistical distributions have been extensively used in modeling fading effects in conventional and modern wireless communications. In the present work, we propose a novel κ − µ composite shadowed fading model, which is based on the valid assumption that the mean signal power follows the inverse gamma distribution instead of the lognormal or commonly used gamma distributions. This distribution has a simple relationship with the gamma distribution, but most importantly, its semi heavy-tailed characteristics constitute it suitable for applications relating to modeling of shadowed fading. Furthermore, the derived probability density function of the κ − µ / inverse gamma composite distribution admits a rather simple algebraic representation that renders it convenient to handle both analytically and numerically. The validity and utility of this fading model are demonstrated by means of modeling the fading effects encountered in body centric communications channels, which have been known to be susceptible to the shadowing effect. To this end, extensive comparisons are provided between theoretical and respective real-time measurement results. It is shown that these comparisons exhibit accurate fitting of the new model for various measurement set ups that correspond to realistic communication scenarios.

The η − µ / Inverse Gamma Composite Fading Model

In this paper we propose a new composite fadingmodel which assumes that the mean signal power of an η−µ signalenvelope follows an inverse gamma distribution. The inversegamma distribution has a simple relationship with the gammadistribution and can be used to model shadowed fading due to itssemi heavy-tailed characteristics. To demonstrate the utility of thenew η−µ / inverse gamma composite fading model, we investigatethe characteristics of the shadowed fading behavior observed inbody centric communications channels which are known to besusceptible to shadowing effects, particularly generated by thehuman body. It is shown that the η−µ / inverse gamma compositefading model provided an excellent fit to the measurement data.Moreover, using Kullback-Leibler divergence, the η −µ / inversegamma composite fading model was found to provide a better fitto the measured data than the κ − µ / inverse gamma compositefading model, for the communication scenarios considered here.

Benefits and resource implications of family meetings for hospitalized palliative care patients: research protocol.

BACKGROUND:
Palliative care focuses on supporting patients diagnosed with advanced, incurable disease; it is 'family centered', with the patient and their family (the unit of care) being core to all its endeavours. However, approximately 30-50% of carers experience psychological distress which is typically under recognised and consequently not addressed. Family meetings (FM) are recommended as a means whereby health professionals, together with family carers and patients discuss psychosocial issues and plan care; however there is minimal empirical research to determine the net effect of these meetings and the resources required to implement them systematically. The aims of this study were to evaluate: (1) if family carers of hospitalised patients with advanced disease (referred to a specialist palliative care in-patient setting or palliative care consultancy service) who receive a FM report significantly lower psychological distress (primary outcome), fewer unmet needs, increased quality of life and feel more prepared for the caregiving role; (2) if patients who receive the FM experience appropriate quality of end-of-life care, as demonstrated by fewer hospital admissions, fewer emergency department presentations, fewer intensive care unit hours, less chemotherapy treatment (in last 30 days of life), and higher likelihood of death in the place of their choice and access to supportive care services; (3) the optimal time point to deliver FM and; (4) to determine the cost-benefit and resource implications of implementing FM meetings into routine practice.
METHODS:
Cluster type trial design with two way randomization for aims 1-3 and health economic modeling and qualitative interviews with health for professionals for aim 4.
DISCUSSION:
The research will determine whether FMs have positive practical and psychological impacts on the family, impacts on health service usage, and financial benefits to the health care sector. This study will also provide clear guidance on appropriate timing in the disease/care trajectory to provide a family meeting.

Wireless Networks with Energy Harvesting and Power Transfer: Joint Power and Time Allocation

In this letter, we consider wireless powered communication networks which could operate perpetually, as the base station (BS) broadcasts energy to the multiple energy harvesting (EH) information transmitters. These employ “harvest then transmit” mechanism, as they spend all of their energy harvested during the previous BS energy broadcast to transmit the information towards the BS. Assuming time division multiple access (TDMA), we propose a novel transmission scheme for jointly optimal allocation of the BS broadcasting power and time sharing among the wireless nodes, which maximizes the overall network throughput, under the constraint of average transmit power and maximum transmit power at the BS. The proposed scheme significantly outperforms “state of the art” schemes that employ only the optimal time allocation. If a single EH transmitter is considered, we generalize the optimal solutions for the case of fixed circuit power consumption, which refers to a much more practical scenario.

A Survey on Mobile Anchor Node Assisted Localization in Wireless Sensor Networks

Localization is one of the key technologies in Wireless Sensor Networks (WSNs), since it provides fundamental support for many location-aware protocols and applications. Constraints on cost and power consumption make it infeasible to equip each sensor node in the network with a Global Position System (GPS) unit, especially for large-scale WSNs. A promising method to localize unknown nodes is to use mobile anchor nodes (MANs), which are equipped with GPS units moving among unknown nodes and periodically broadcasting their current locations to help nearby unknown nodes with localization. A considerable body of research has addressed the Mobile Anchor Node Assisted Localization (MANAL) problem. However to the best of our knowledge, no updated surveys on MAAL reflecting recent advances in the field have been presented in the past few years. This survey presents a review of the most successful MANAL algorithms, focusing on the achievements made in the past decade, and aims to become a starting point for researchers who are initiating their endeavors in MANAL research field. In addition, we seek to present a comprehensive review of the recent breakthroughs in the field, providing links to the most interesting and successful advances in this research field.

Full-Duplex Spectrum Sharing in Cooperative Single Carrier Systems

We propose cyclic prefix single carrier full-duplex transmission in amplify-and-forward cooperative spectrum sharing networks to achieve multipath diversity and full-duplex spectral efficiency. Integrating full-duplex transmission into cooperative spectrum sharing systems results in two intrinsic problems: 1) the residual loop interference occurs between the transmit and the receive antennas at the secondary relays and 2) the primary users simultaneously suffer interference from the secondary source (SS) and the secondary relays (SRs). Thus, examining the effects of residual loop interference under peak interference power constraint at the primary users and maximum transmit power constraints at the SS and the SRs is a particularly challenging problem in frequency selective fading channels. To do so, we derive and quantitatively compare the lower bounds on the outage probability and the corresponding asymptotic outage probability for max–min relay selection, partial relay selection, and maximum interference relay selection policies in frequency selective fading channels. To facilitate comparison, we provide the corresponding analysis for half-duplex. Our results show two complementary regions, named as the signal-to-noise ratio (SNR) dominant region and the residual loop interference dominant region, where the multipath diversity and spatial diversity can be achievable only in the SNR dominant region, however the diversity gain collapses to zero in the residual loop interference dominant region.

Secure Transmission in Cooperative Relaying Networks with Multiple Antennas

We investigate the secrecy performance of dualhop amplify-and-forward (AF) multi-antenna relaying systems over Rayleigh fading channels, by taking into account the direct link between the source and destination. In order to exploit the available direct link and the multiple antennas for secrecy improvement, different linear processing schemes at the relay and different diversity combining techniques at the destination are proposed, namely, 1) Zero-forcing/Maximal ratio combining (ZF/MRC), 2) ZF/Selection combining (ZF/SC), 3) Maximal ratio transmission/MRC (MRT/MRC) and 4) MRT/Selection combining (MRT/SC). For all these schemes, we present new closed-form approximations for the secrecy outage probability. Moreover, we investigate a benchmark scheme, i.e., cooperative jamming/ZF (CJ/ZF), where the secrecy outage probability is obtained in exact closed-form. In addition, we present asymptotic secrecy outage expressions for all the proposed schemes in the high signal-to-noise ratio (SNR) regime, in order to characterize key design parameters, such as secrecy diversity order and secrecy array gain. The outcomes of this paper can be summarized as follows: a) MRT/MRC and MRT/SC achieve a full diversity order of M + 1, ZF/MRC and ZF/SC achieve a diversity order of M, while CJ/ZF only achieves unit diversity order, where M is the number of antennas at the relay. b) ZF/MRC (ZF/SC) outperforms the corresponding MRT/MRC (MRT/SC) in the low SNR regime, while becomes inferior to the corresponding MRT/MRC (MRT/SC) in the high SNR. c) All of the proposed schemes tend to outperform the CJ/ZF with moderate number of antennas, and linear processing schemes with MRC attain better performance than those with SC.

Multiuser dual-hop relaying over hybrid RF/FSO links

The performance of multiuser dual-hop relaying over mixed radio frequency/free-space optical (RF/FSO) links is investigated. RF links are used for the simultaneous data transmission from m single-antenna sources to the relay, which is equipped with n ≥ m receive antennas and a photo-aperture transmitter. The relay operates under the decode-and-forward protocol and utilizes the popular ordered V-BLAST technique to successively decode each user's transmitted stream. A common norm-based ordering approach is adopted, where the streams are decoded in an ascending order. After the V-BLAST decoding, the relay retransmits the initial information to the destination, which is equipped with a photo-detector, via a point-to-point FSO link in m consecutive timeslots. Analytical expressions for the end-to-end outage probability and average symbol error probability of each user are derived. Some engineering insights are manifested, such as the diversity order, the impact of the pointing error displacement on the FSO link and the severity on the turbulence-induced channel fading.

Secure Multiple Amplify-and-Forward Relaying with Co-Channel Interference

We investigate the impact of co-channel interference on the security performance of multiple amplify-and-forward (AF) relaying networks, where N intermediate AF relays assist the data transmission from the source to the destination. The relays are corrupted by multiple co-channel interferers, and the information transmitted from the relays to destination can be overheard by the eavesdropper. In order to deal with the interference and wiretap, the best out of N relays is selected for security enhancement. To this end, we derive a novel lower bound on the secrecy outage probability (SOP), which is then utilized to present two best relay selection criteria, based on the instantaneous and statistical channel information of the interfering links. For these criteria and the conventional maxmin criterion, we quantify the impact of co-channel interference and relay selection by deriving the lower bound on the SOP. Furthermore, we derive the asymptotic SOP for each criterion, to explicitly reveal the impact of transmit power allocation among interferers on the secrecy performance, which offers valuable insights into practical design. We demonstrate that all selection criteria achieve full secrecy diversity order N, while the proposed in this paper two criteria outperform the conventional max-min scheme.