Multi-hop amplify-and-forward relaying cooperation in the presence of I/Q imbalance

In this paper, multi-hop cooperative networks implementing channel state information (CSI)-assisted amplify-and-forward (AF) relaying in the presence of in-phase and quadrature-phase (I/Q) imbalance are investigated. We propose a compensation algorithm for the I/Q imbalance. The performance of the multi-hop CSI-assisted AF cooperative networks with and without compensation for I/Q imbalance in Nakagami-m fading environment is evaluated in terms of average symbol error probability. Numerical results are provided and show that the proposed compensation method can effectively mitigate the impact of I/Q imbalance.

Dual-hop amplify-and-forward cooperative relaying in the presence of Tx and Rx in-phase and quadrature-phase imbalance

In this study, dual-hop channel state information-assisted amplify-and-forward (AF) cooperative systems in the presence of in-phase and quadrature-phase (I/Q) imbalance, which refers to the mismatch between components in the I and Q branches, are investigated. First, the authors analyse the performance of the considered AF cooperative protocol without compensation for the I/Q imbalance as the benchmark. Then, a compensation algorithm for the I/Q imbalance is proposed, which makes use of the received signals at the destination, from the source and the relay nodes, together with their conjugations to detect the transmitted signal. Moreover, the authors study the considered AF cooperative system implemented with the opportunistic relay selection and the proposed compensation mechanism for the I/Q imbalance. The performance of the AF cooperative system under study is evaluated in terms of average symbol error probability, which is derived by considering transmission in a Rayleigh fading environment. Numerical results are provided and show that the proposed compensation algorithm can efficiently mitigate the effect of the I/Q imbalance. On the other hand, it is observed that the AF cooperative system with opportunistic relay selection acquires a performance gain beyond that without relay selection.

Unicast and broadcast throughput maximization in amplify-and-forward relay networks

Cooperative communication (CC) offers an efficient and low-cost way to achieve spatial diversity by forming a virtual antenna array among single-antenna nodes that cooperatively share their antennas. It has been well recognized that the selection of relay nodes plays a critical role in the performance of CC. Most existing relay selection strategies focus on optimizing the outage probability or energy consumption. To fill in the vacancy of research on throughput improvement via CC, we study the relay selection problem with the objective of optimizing the throughput in this paper. For unicast, it is a P problem, and an optimal relay selection algorithm is provided with a correctness proof. For broadcast, we show the challenge of relay selection by proving it nonprobabilistic hard (NP-hard). A greedy heuristic algorithm is proposed to effectively choose a set of relay nodes that maximize the broadcast throughput. Simulation results show that the proposed algorithms can achieve high throughput under various network settings.

Comparison between nanofiltration and forward osmosis in the treatment of dye solutions

Colour removal and the flux behaviour of nanofiltration (NF-DOW FILMTEC-NF245) and forward osmosis (FO-a flat sheet cellulose triacetate membrane with a woven embedded backing support) membranes were investigated in this study. The NF membrane was employed to perform dye removal experiments with aqueous solutions containing 15 g/L of NaCl and different concentrations of Acid Green 25, Remazol Brilliant Orange FR and Remazol Blue BR dyes. The increase in dye concentration resulted in a decline in water permeability and an increase in colour removal. When the concentrations of dye solutions varied from 250 to 1000 mg/L, at 0.8 bar of trans-membrane pressure, the NF system exhibited a steady permeate flux of more 30 L/m2h and a colour removal of more than 99%; salt rejection was more than 20.0%. Furthermore, the FO system possessed high dye rejection efficiency (almost 100%), with low permeate flux of around 2.0 L/m2h, when using dye solutions as feed streams and seawater as draw stream. The mode of operation (either FO or pressure retarded osmosis (PRO) did not change the flux significantly but PRO mode always produced higher fluxes than FO mode under the operating conditions used in this study. While both NF and FO can be used to reduce the volume of effluent containing dyes from textile industries, the energy spent in NF on applied pressure can be substituted by the osmotic pressure of draw solution in FO when concentrated draw solutions such as sea water or reverse osmosis concentrate are readily available.

Optimal Design of a Hybrid Membrane System Combining Reverse and Forward Osmosis for Seawater Desalination

In this work we study Forward Osmosis (FO) as an emerging desalination technology, and its capability to replace totally or partially Reverse Osmosis (RO) in order to reduce the great amount of energy required in the current desalination plants. For this purpose, we propose a superstructure that includes both membrane based desalination technologies, allowing the selection of only one of the technologies or a combination of both of them seeking for the optimal configuration of the network. The optimization problem is solved for a seawater desalination plant with a given fresh water production. The results obtained show that the optimal solution combines both desalination technologies to reduce not only the energy consumption but also the total cost of the desalination process in comparison with the same plant but operating only with RO.

Referral patterns in a global store-and-forward telemedicine system

We examined the nature of the referral patterns in the email telemedicine network operated by the Swinfen Charitable Trust with a view to informing long-term resource planning. Over the first six years of operation, 62 hospitals from 19 countries registered with the Trust in order to be able to refer cases for specialist advice; 55 of these hospitals (89%) actually referred cases during this period. During the first six years of operation, nearly 1000 referrals were submitted and answered, from a wide range of specialty areas. Between July 2002 and March 2005 the referral rate rose from 127 to 318 cases per year. The median length of time required to provide a specialist's response was 2.3 days during the first 12 months and 1.8 days during the last 12 months. Five hospitals submitted cases for more than four years (together sending a total of 493 cases). Their activity data showed a trend to declining referral rates over the four-year period, which may represent successful knowledge transfer. There is some evidence that over the last three years the growth in demand has been exponential, while the growth in resources available (i.e. specialists) has been linear, a situation which cannot continue for very long before demand outstrips supply.

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. 

Achievable rate and error performance of an amplify and forward multi-way relay network in the presence of imperfect channel estimation

In this paper, we investigate the impact of channel estimation error on the achievable common rate and error performance of amplify and forward (AF) multi-way relay networks (MWRNs). Assuming lattice codes with large dimensions, we provide the analytical expressions for the end-to-end SNR at the users and obtain upper bounds on the achievable common rate for an AF MWRN. Moreover, considering binary phase shift keying (BPSK) modulation as the simplest case of lattice codes, we obtain the average bit error rate (BER) for a user in an AF MWRN. The analysis shows that the average BER is a linearly increasing function and the achievable common rate is a linearly decreasing function of the channel estimation error. On the other hand, the average BER decreases and the achievable common rate increases with increasing correlation between the true and the estimated channel. Also, we observe that the AFprotocol is robust against increasing number of users in terms of error performance. We show that when the decoding user has better channel conditions compared to other users, AF relaying gives a better error performance and common rate. Finally, simulation results are provided to verify the validity of our analysis.

Slotted cooperative communication in half duplex relay networks

In cooperative communication systems, several wireless communication terminals collaborate to form a virtual-multiple antenna array system and exploit the spatial diversity to achieve a better performance. This thesis proposes a practical slotted protocol for cooperative communication systems with half-duplex single antennas. The performance of the proposed slotted cooperative communication protocol is evaluated in terms of the pairwise error probability and the bit error rate. The proposed protocol achieves the multiple-input single-output performance bound with a novel relay ordering and scheduling strategy.

DMT of Wireless Networks: An overview

The e�cient operation of single-source, single-sink wireless network is considered with the diversity-multiplexing gain tradeo� (DMT) as the measure of performance. Whereas in the case of a point-to-point MIMO channel the DMT is determined by the fading statistics, in the case of a network, the DMT is additionally, a function of the time schedule according to which the network is operated, as well as the protocol that dictates the mode of operation of the intermediate relays.In general, it is only possible at present, to provide upper bounds on the DMT of the network in terms of the DMT of the MIMO channel appearing across cuts in the network. This paper presents a tutorial overview on the DMT of half-duplex multi-hop wireless networks that also attempts to identify where possible, codes that achieve the DMT.For example, it is shown how one can construct codes that achieve the DMT of a network under a given schedule and either an amplify-and-forward or decode-and-forward protocol. Also contained in the paper,are discussions on the DMT of the multiple-access channel as well as the impact of feedback on the DMT of a MIMO channel.

Asymptotically optimal cooperative wireless networks without constellation expansion

In this work, we construct a unified family of cooperative diversity coding schemes for implementing the orthogonal amplify-and-forward and the orthogonal selection-decode-and-forward strategies in cooperative wireless networks. We show that, as the number of users increases, these schemes meet the corresponding optimal high-SNR outage region, and do so with minimal order of signaling complexity. This is an improvement over all outage-optimal schemes which impose exponential increases in signaling complexity for every new network user. Our schemes, which are based on commutative algebras of normal matrices, satisfy the outage-related information theoretic criteria, the duplex-related coding criteria, and maintain reduced signaling, encoding and decoding complexities