Network-coding-based Cooperative V2V Communication in Vehicular Cloud Networks

Chinacom 2018 - 13th EAI International Conference on Communications and Networking in China, 23-25 October 2018, Chengdu, ChinaThis is the author accepted manuscript. the final version is available from Springer Verlag via the DOI in this recordWe investigate the potential of applying cooperative relaying and network coding techniques to support vehicle-to-vehicle (V2V) communication in vehicular cloud networks (VCN). A reuse-mode MIMO content distribution system with multiple sources, multiple relays, and multiple destinations under Nakagami-m fading is considered. We apply a class of finite field network codes in the relays to achieve high spatial diversity in an efficient manner and derive the system communication error probability that the destinations fail to recover the desired source messages. The results show that our method can improve the performance over conventional data transmission solutions

Novel precoded relay-assisted algorithm for cellular systems

Cooperative schemes are promising solutions for cellular wireless systems to improve system fairness, extend coverage and increase capacity. The use of relays is of significant interest to allow radio access in situations where a direct path is not available or has poor quality. A data precoded relay-assisted scheme is proposed for a system cooperating with 2 relays, each equipped with either a single antenna or 2-antenna array. However, because of the half-duplex constraint at the relays, relaying-assisted transmission would require the use of a higher order constellation than in the case when a continuous link is available from the BS to the UT. This would imply a penalty in the power efficiency. The simple precoding scheme proposed exploits the relation between QPSK and 16-QAM, by alternately transmitting through the 2 relays, achieving full diversity, while significantly reducing power penalty. Analysis of the pairwise error probability of the proposed algorithm with a single antenna in each relay is derived and confirmed with numerical results. We show the performance improvements of the precoded scheme, relatively to equivalent distributed SFBC scheme employing 16-QAM, for several channel quality scenarios. Copyright © 2010 Sara Teodoro, et al.European project CODIVPortuguese project CADWINPortuguese project AGILEFC

Novel precoded relay-assisted algorithm for cellular systems

Cooperative schemes are promising solutions for cellular wireless systems to improve system fairness, extend coverage and increase capacity. The use of relays is of significant interest to allow radio access in situations where a direct path is not available or has poor quality. A data precoded relay-assisted scheme is proposed for a system cooperating with 2 relays, each equipped with either a single antenna or 2-antenna array. However, because of the half-duplex constraint at the relays, relaying-assisted transmission would require the use of a higher order constellation than in the case when a continuous link is available from the BS to the UT. This would imply a penalty in the power efficiency. The simple precoding scheme proposed exploits the relation between QPSK and 16-QAM, by alternately transmitting through the 2 relays, achieving full diversity, while significantly reducing power penalty. Analysis of the pairwise error probability of the proposed algorithm with a single antenna in each relay is derived and confirmed with numerical results. We show the performance improvements of the precoded scheme, relatively to equivalent distributed SFBC scheme employing 16-QAM, for several channel quality scenarios. Copyright © 2010 Sara Teodoro, et al.European project CODIVPortuguese project CADWINPortuguese project AGILEFC

Novel precoded relay-assisted algorithm for cellular systems

Cooperative schemes are promising solutions for cellular wireless systems to improve system fairness, extend coverage and increase capacity. The use of relays is of significant interest to allow radio access in situations where a direct path is not available or has poor quality. A data precoded relay-assisted scheme is proposed for a system cooperating with 2 relays, each equipped with either a single antenna or 2-antenna array. However, because of the half-duplex constraint at the relays, relaying-assisted transmission would require the use of a higher order constellation than in the case when a continuous link is available from the BS to the UT. This would imply a penalty in the power efficiency. The simple precoding scheme proposed exploits the relation between QPSK and 16-QAM, by alternately transmitting through the 2 relays, achieving full diversity, while significantly reducing power penalty. Analysis of the pairwise error probability of the proposed algorithm with a single antenna in each relay is derived and confirmed with numerical results. We show the performance improvements of the precoded scheme, relatively to equivalent distributed SFBC scheme employing 16-QAM, for several channel quality scenarios. Copyright © 2010 Sara Teodoro, et al.European project CODIVPortuguese project CADWINPortuguese project AGILEFC

Data-precoded algorithm for multiple-relay-assisted systems

A data-precoded relay-assisted (RA) scheme is proposed for a system cooperating with multiple relay nodes (RNs), each equipped with either a single-antenna or a two-antenna array. The classical RA systems using distributed space-time/frequency coding algorithms, because of the half-duplex constraint at the relays, require the use of a higher order constellation than in the case of a continuous link transmission from the base station to the user terminal. This implies a penalty in the power efficiency. The proposed precoding algorithm exploits the relation between QPSK and 4 L -QAM, by alternately transmitting through L relays, achieving full diversity, while significantly reducing power penalty. This algorithm explores the situations where a direct path (DP) is not available or has poor quality, and it is a promising solution to extend coverage or increase system capacity. We present the analytical derivation of the gain obtained with the data-precoded algorithm in comparison with distributed space-frequency block code (SFBC) ones. Furthermore, analysis of the pairwise error probability of the proposed algorithm is derived and confirmed with numerical results. We evaluate the performance of the proposed scheme and compare it relatively to the equivalent distributed SFBC scheme employing 16-QAM and non-cooperative schemes, for several link quality scenarios and scheme configurations, highlighting the advantages of the proposed scheme

Mapping geographical inequalities in access to drinking water and sanitation facilities in low-income and middle-income countries, 2000-17

Background Universal access to safe drinking water and sanitation facilities is an essential human right, recognised in the Sustainable Development Goals as crucial for preventing disease and improving human wellbeing. Comprehensive, high-resolution estimates are important to inform progress towards achieving this goal. We aimed to produce high-resolution geospatial estimates of access to drinking water and sanitation facilities. Methods We used a Bayesian geostatistical model and data from 600 sources across more than 88 low-income and middle-income countries (LMICs) to estimate access to drinking water and sanitation facilities on continuous continent-wide surfaces from 2000 to 2017, and aggregated results to policy-relevant administrative units. We estimated mutually exclusive and collectively exhaustive subcategories of facilities for drinking water (piped water on or off premises, other improved facilities, unimproved, and surface water) and sanitation facilities (septic or sewer sanitation, other improved, unimproved, and open defecation) with use of ordinal regression. We also estimated the number of diarrhoeal deaths in children younger than 5 years attributed to unsafe facilities and estimated deaths that were averted by increased access to safe facilities in 2017, and analysed geographical inequality in access within LMICs. Findings Across LMICs, access to both piped water and improved water overall increased between 2000 and 2017, with progress varying spatially. For piped water, the safest water facility type, access increased from 40.0% (95% uncertainty interval [UI] 39.4-40.7) to 50.3% (50.0-50.5), but was lowest in sub-Saharan Africa, where access to piped water was mostly concentrated in urban centres. Access to both sewer or septic sanitation and improved sanitation overall also increased across all LMICs during the study period. For sewer or septic sanitation, access was 46.3% (95% UI 46.1-46.5) in 2017, compared with 28.7% (28.5-29.0) in 2000. Although some units improved access to the safest drinking water or sanitation facilities since 2000, a large absolute number of people continued to not have access in several units with high access to such facilities (>80%) in 2017. More than 253 000 people did not have access to sewer or septic sanitation facilities in the city of Harare, Zimbabwe, despite 88.6% (95% UI 87.2-89.7) access overall. Many units were able to transition from the least safe facilities in 2000 to safe facilities by 2017; for units in which populations primarily practised open defecation in 2000, 686 (95% UI 664-711) of the 1830 (1797-1863) units transitioned to the use of improved sanitation. Geographical disparities in access to improved water across units decreased in 76.1% (95% UI 71.6-80.7) of countries from 2000 to 2017, and in 53.9% (50.6-59.6) of countries for access to improved sanitation, but remained evident subnationally in most countries in 2017. Interpretation Our estimates, combined with geospatial trends in diarrhoeal burden, identify where efforts to increase access to safe drinking water and sanitation facilities are most needed. By highlighting areas with successful approaches or in need of targeted interventions, our estimates can enable precision public health to effectively progress towards universal access to safe water and sanitation. Copyright (C) 2020 The Author(s). Published by Elsevier Ltd.Peer reviewe

Joint Linear Processing for an Amplify-and-Forward MIMO Relay Channel with Imperfect Channel State Information

The problem of jointly optimizing the source precoder, relay transceiver, and destination equalizer has been considered in this paper for a multiple-input-multiple-output (MIMO) amplify-and-forward (AF) relay channel, where the channel estimates of all links are assumed to be imperfect. The considered joint optimization problem is nonconvex and does not offer closed-form solutions. However, it has been shown that the optimization of one variable when others are fixed is a convex optimization problem which can be efficiently solved using interior-point algorithms. In this context, an iterative technique with the guaranteed convergence has been proposed for the AF MIMO relay channel that includes the direct link. It has been also shown that, for the double-hop relay case without the receive-side antenna correlations in each hop, the global optimality can be confirmed since the structures of the source precoder, relay transceiver, and destination equalizer have closed forms and the remaining joint power allocation can be solved using Geometric Programming (GP) technique under high signal-to-noise ratio (SNR) approximation. In the latter case, the performance of the iterative technique and the GP method has been compared with simulations to ensure that the iterative approach gives reasonably good solutions with an acceptable complexity. Moreover, simulation results verify th