Optimization of Cooperative RelayingMolecular Communications for Nanomedical Applications

Recently,nano-systems based on molecular communications via diffusion(MCvD)have been implemented in a variety of nanomedical applications,most notably in targeted drug delivery system(TDDS)scenarios.Furthermore,because the MCvD is unreliable and there exists molecular noise and inter symbol interference(ISI),cooperative nano-relays can acquire the reliability for drug delivery to targeted diseased cells,especially if the separation distance between the nano transmitter and nano receiver is increased.In this work,we propose an approach for optimizing the performance of the nano system using cooperative molecular communications with a nano relay scheme,while accounting for blood flow effects in terms of drift velocity.The fractions of the molecular drug that should be allocated to the nano transmitter and nano relay positioning are computed using a collaborative optimization problem solved by theModified Central Force Optimization(MCFO)algorithm.Unlike the previous work,the probability of bit error is expressed in a closed-form expression.It is used as an objective function to determine the optimal velocity of the drug molecules and the detection threshold at the nano receiver.The simulation results show that the probability of bit error can be dramatically reduced by optimizing the drift velocity,detection threshold,location of the nano-relay in the proposed nano system,and molecular drug budget.

Broadband ＆ Digital Content-Couple Subscriber Cooperative Relaying Networks for Uplink Transmission using Hierarchical Game Approach

Cooperation allows wireless network users to benefit from various gains such as an in- crease in the achieved rate or an improvement in the bit error rate. In the paper, we propose a distributed Hierarchical Game （HG） theoretic framework over multi-user cooperative communication networks to stimulate cooperation and improve the network performance. First, we study a two- user decision making game in the OFDMA based subscriber cooperative relaying network, in which subscribers transmit their own data in the first phase, while helping to retransmit their partner＇s or choosing to freeride in the second phase. Instead of consulting to a global optimal solution, we decouple the cooperation resource allocation into two level subproblems： a user level Nash game for distributed cooperation decision and a Base Station （BS） level coalition game for centralized resource allocation. In the proposed HG algorithm, where mutual cooperation is preferred and total payoff is transferable, we prove it converges to a unique optimal equilibrium and resolve the subcarrier as-signment and power allocation among the couples. Besides, we discuss the existence of the publishing and rewarding coefficients in order to encourage cooperation. Then, we extend the HG to multi-user cases by coupling among subscribers according to the location information. The simulation results show that the proposed scheme with the distributed HG game achieves a well tradeoff between fairness and efficiency by improving the transmission efficiency of adverse users and outperforms those employing centralized schemes.

Multi-user Symmetric Cooperation Based on Nash Bargaining Solution in Cooperative Relay Networks

This paper presents a symmetric cooperation strategy for cooperative relay networks with multiple users. The multi-user symmetric cooperation model and the relay selection algorithm are proposed. Then, the time slot allocation problem is cast into a bargaining problem, and the optimal time slot allocation solution is obtained by Nash bargaining solution （NBS）. Moreover, we also consider the implementations of the cooperation strategy, i.e., the grouping and admission control algorithm. Simulation results show that users can obtain larger rates under the symmetric cooperation strategy than the non-cooperative case.

Wireless Mesh Networks and Cooperative Relaying Technologies

The Wireless Mesh Network (WMN) has become a focus in research of wireless broadband communications . In a switching technologies - based wireless Mesh network, the entire network is regarded as an IP subnet, so it cannot be applied in situations where large coverage is required . The use of cooperative relaying technologies can improve the transmission rate and reliability of wireless link; while the wireless Mesh network, once integrated with cooperative relaying technologies and routing technologies , can improve its spectrum efficiency and cover a wide area . However, there are many problems to be solved with respect to standardization, key technologies research and industrialization. Therefore , the application of cooperative relaying technologies in wireless Mesh networks is still a great challenge .

DIVERSITY-AND-MULTIPLEXING TRADEOFF AND THROUGHPUT OF SUPERPOSITION CODING RELAYING STRATEGY

While the Network Coding cooperative relaying (NC-relaying) has the merit of high spectral efficiency,Superposition Coding relaying (SC-relaying) has the merit of high throughput. In this paper,a novel concept,coded cooperative relaying,is presented,which is a unified scheme of the NC-relaying and SC-relaying. For the SC-relaying strategy which can be considered one-way coded relaying scheme with multi-access channel,the close-form solution of the outage probabilities of the basic signal and additional signal are obtained firstly. Secondly,the Diversity-and-Multiplexing Tradeoff (DMT) characteristics of basic signal and additional signal are investigated entirely as well as the optimal close-form solutions. The compared numerical analysis shows the evaluation error of throughput based on the close-form solution is about 0.15 nats,which is within the acceptable error range. Due to the mutual effect between the both source signals,the available maximal values of the two multiplexing gains are less than 1.

Log Likelihood Ratio-Based Relaying for Distributed Turbo Codes

A distributed turbo codes（ DTC） scheme with log likelihood ratio（ LLR）-based threshold at the relay for a two-hop relay networks is proposed. Different from traditional DTC schemes,the retransmission scheme at the relay,where imperfect decoding occurs,is considered in the proposed scheme. By employing a LLR-based threshold at the relay in the proposed scheme,the reliability of decoder-LLRs can be measured. As a result,only reliable symbols will be forwarded to the destination and a maximum ratio combiner（ MRC） is used to combine signals received from both the source and the relay. In order to obtain the optimal threshold at the relay,an equivalent model of decoderLLRs is investigated,so as to derive the expression of the bit error probability（ BEP） of the proposed scheme under binary phase shift keying（ BPSK） modulation. Simulation results demonstrate that the proposed scheme can effectively mitigate error propagation at the relay and also outperforms other existing methods.

Modified Cooperative Subchannel Allocation Algorithms and PSO Based Power Allocation for an Alamouti Decode and Forward Relaying Protocol in Multiuser OFDMA Systems

The present work is a discussion on the performance analysis of Modified Cooperative Subchannel Allocation (CSA) Algorithms which is used in Alamouti Decoded and Forward (Alamouti DF) Relaying Protocol for wireless multi-user Orthogonal Frequency Division Multiplexing Access (OFDMA) systems. In addition, the performance of approximate Symbol Error Rate (SER) for the Alamouti DF Relaying Protocol with the Cooperative Maximum Ratio Combining Technique (C-MRC) is analyzed and compared with SER upper bound. The approximate SER is asymptotically tight bound at higher Signal-to-Noise Ratio (SNR). From the asymptotic tight bound approximate SER, Particle Swarm Optimization (PSO) based Power Allocation (PA) is determined for the Alamouti DF Relaying Protocol. The simulation results suggested that the Modified Throughput based Subchannel Allocation Algorithm achieved an improved throughput of 6% to 33% compared to that of existing cooperative diversity protocol. Further, the Modified Fairness based Subchannel Allocation Algorithm rendered fairness of 7.2% to 17% among the multiuser against the existing cooperative diversity protocol.

Energy Efficiency in ARQ-Based Multi-Hop Systems and the Tradeoff with Throughput

The minimum energy per bit(EPB)as the energy efficiency(EE)metric in an automatic retransmission request(ARQ)based multi-hop system is analyzed under power and throughput constraints.Two ARQ protocols including type-I(ARQ-I)and repetition redundancy(ARQ-RR)are considered and expressions for the optimal power allocation(PA)are obtained.Using the obtained optimal powers,the EE-throughput tradeoff(EETT)is analyzed and the EETT closed-form expressions for both ARQ protocols and in arbitrary average channel gain values are obtained.It is shown that how different throughput requirements,especially the high levels,affect the EE performance.Additionally,asymptotic analysis is made in the feasible high throughput values and lower and upper EETT bounds are derived for ARQ-I protocol.To evaluate the EE a distributed PA scenario,as a benchmark,is presented and the energy savinggain obtained from the optimal PA in comparison with the distributed PA for ARQ-I and ARQ-RR protocols is discussed in different throughput values and node locations.

Adaptive Relay Selection Scheme for Minimization of the Transmission Time

As the installation of small cells increases,the use of relay also increases.The relay operates as a base station as well as just an amplifier.As the roles and types of relays become more diverse,appropriate relay selection technology is an effective way to improve communication performance.Many researches for relay selection have been studied to secure the reliability of relay communication.In this paper,the relay selection scheme is proposed for a cooperative system using decode-and-forward(DF)relaying scheme in the mobile communication system.To maintain the transmission rate,the proposed scheme classifies a candidate group considering the outage probability of multiple relays.For the applicable candidate group,the proposed scheme selects the relay considering the amount of data allocated to each user.Therefore,the proposed scheme defines the unit transmission time through each user’s data and relay capacity.Finally,the proposed scheme selects a relay that minimizes the total transmission time through the relay transmission time that calculates the unit transmission time for all users.With this adaptive relay selection scheme,an optimal relay can be assigned for each user.For the same transmission rate and the amount of data,the proposed scheme improves the performance of transmission time and reliability.Simulation results show that the proposed scheme reduces the total transmission time for the same amount of data and signal to noise ratio(SNR).

Bargaining Game Theoretic Power Control in Selfish Cooperative Relay Networks

Wireless cooperative communications require appropriate power allocation （PA） between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information for each other, but each user node has the incentive to consume his power solely to decrease its own symbol error rate （SER） at the receiver. In this paper, we propose a fair and efficient PA scheme for the decode-and-forward cooperation protocol in selfish cooperative relay networks. We formulate this PA problem as a two-user cooperative bargaining game, and use Nash bargaining solution （NBS） to achieve a win-win strategy for both partner users. Simulation results indicate that the NBS is fair in that the degree of cooperation of a user only depends on how much contribution its partner can make to decrease its SER at the receiver, and efficient in the sense that the SER performance of both users could be improved through the game.

Energy Efficiency Analysis of Cellular Networks with Cooperative Relays via Stochastic Geometry

Cooperative relaying is a promising technology that can improve the spectral and energy efficiency of cellular networks. However, the deployed relays consume a lot of energy and system resources. To improve the energy efficiency of the relay-assisted cellular networks, this paper considers the use of energy harvesting(EH) on relay nodes. A random sleeping strategy is also introduced in macro base stations(MBS) as a possible method to reduce energy consumption. In this paper, an analytical model is proposed to investigate the energy efficiency of cellular networks with EH relays and sleep mode strategy. Numerical results confirm a significant energy efficiency gain of the proposed networks comparing to the cellular networks with non-EH relays and MBSs without sleep mode strategy. The effects of the density and transmit power of MBSs on energy efficiency are also given through simulations.

A Beamforming Technique Using Rotman Lens Antenna for Wireless Relay Networks

Rotman lens,which is a radio frequency beam-former that consists of multiple input and multiple output beam ports,can be used in industrial,scientific,and medical applications as a beam steering device.The input ports collect the signals to be propagated through the lens cavity toward the output ports before being transmitted by the antenna arrays to the destination in order to enhance the error performance by optimizing the overall signal to noise ratio(SNR).In this article,a low-cost Rotman lens antenna is designed and deployed to enhance the overall performance of the conventional cooperative communication systems without needing any additional power,extra time or frequency slots.In the suggested system,the smart Rotman lens antennas generate a beam steering in the direction of the destination to maximize the received SNR at the destination by applying the proposed optimal beamforming technique.The suggested optimal beamforming technique enjoys high diversity,as well as,low encoding and decoding complexity.Furthermore,we proved the advantages of our suggested strategy through both theoretical results and simulations using Monte Carlo runs.The Monte Carlo simulations show that the suggested strategy enjoys better error performance compared to the current state-of-the-art distributed multiantenna strategies.In addition,the bit error rate(BER)curves drawn from the analytical results are closely matching to those drawn from our conducted Monte Carlo simulations.

An Adaptive Power Allocation Scheme for Performance Improvement of Cooperative SWIPT NOMA Wireless Networks

Future wireless networks demand high spectral efficiency,energy efficiency and reliability.Cooperative non-orthogonal multiple access(NOMA)with simultaneous wireless information and power transfer(SWIPT)is considered as one of the novel techniques to meet this demand.In this work,an adaptive power allocation scheme called SWIPT based adaptive power allocation(SWIPT-APA-NOMA)is proposed for a power domain NOMA network.The proposed scheme considers the receiver sensitivity of the end users while calculating the power allocation coefficients in order to prevent wastage of power allocated to user in outage and by offering priority to any one of the users to use maximum harvested power.A detailed analysis on the bit error rate(BER)performance of the proposed scheme is done and closed form expression is obtained.Simulations have been carried out with various parameters that influence the receiver sensitivity and the results show that the network achieves better outage and BER performance using the proposed scheme.It is found that the proposed scheme leads to a ten-fold decrease in transmit power for the same error performance of a fixed power allocation scheme.Further,it offers 96.06%improvement in the capacity for a cumulative noise figure and fading margin of 10 dB.

SINR-balancing based cooperative spectrum sharing scheme for MIMO cognitive radio systems

In order to improve the system capacity of the primary user （PU） and secondary user （SU） of multiple-input-multiple-output （MIMO） cognitive radio （CR） system, a signal to interference plus noise ratio balancing （SINR-balancing） posed, in which PU leases a fraction of based cooperative spectrum sharing （CSS） scheme is proits transmission time to SU in exchange for the SU relaying the PU＇ s data cooperatively. The SINR-balancing based corresponding beamforming vectors are designed and time-division is also optimized for the proposed scheme. Simulation results show that compared to conventional opportunistic spectrum sharing （OSS） scheme, the proposed CSS scheme can effectively enhance the system performance of both PU and SU and provide an effective cooperation mechanism for PU and SU to determine whether to request cooperation.

A stream layered cooperative relay multicast scheme and capacity analysis in cellular systems

It is widely believed that cooperative relay technologies can improve the throughput of multicasting in mobile cellular networks significantly, however, the mobility of the relay terrninals may cause frequent relay link outage. This paper proposes a stream layered cooperative relay scheme to deal with this problem. In order to study the characteristics of layered relay channels in the scheme, the capacity region is determined based on a single and a multi relay abstract model with streams layering. Besides, to satisfy the cellular network scenario, the results are extended to a wireless Gaussian channel model. The analysis and simulation results show that the scheme guarantees the continuity of the multicast streams, and maintains the high bandwidth of relay channel, with a slight loss on system capacity.

Dynamic selection scheme for cooperative relay under high mobility environment

The mobility of relay has great influence on the performance of a cooperative relay system.This paper proposes a dynamic selection scheme under the amplify-and-forward communication mode in high mobility environment,based on the estimation of channels and the power allocation for each relay node by comparing it with the pre-set threshold.This scheme is used to choose the cooperative relay dynamically for a multiple relay scenario.Simulation results show that this proposed relay selection scheme decreases the outage probability effectively,maintains system capacity well,and improves the performance of the relay system.

An efficient multi-relay selection scheme in cooperative communication system

Cooperative relaying has played an important role in rapid evolution of wireless communications.The cooperative performance strongly depends on the selected relays.In this paper,we concentrate on relay selection in amplify-and-forward(AF)cooperative communication system,and an optimal multi-relay selection scheme is put forward to minimize the average symbol error rate(SER)of the system.Firstly,for the minimum average SER,on the basis of the statistic channel information,we define a parameter named equivalent channel gain which describes the channel status of two phases in the cooperative process.Then,under the constraint of equal power allocation,an optimal relay selection scheme is proposed in ascending order of equivalent channel gain(ECG).The scheme implies that the suitable number of relay nodes should be selected under the different signal-to-noise ratio(SNR)ranges to minimize the average SER.Computer simulation results show that the average SER rate of the proposed scheme is lower than these of the other schemes.

High throughput relay policy in wireless cooperative relaying networks based on stochastic control theory

This paper proposes a distributed relay and modulation and coding scheme （MCS） selection in wireless cooperative relaying networks where the adaptive modulation and coding （AMC） scheme is applied. First-order finite-state Markov channels （FSMCs） are used to model the wireless channels and make prediction. The objective of the relay policy is to select one relay and MCS among different alternatives in each time-slot according to their channel state information （CSI） with the goal of maximizing the throughput of the whole transmission period. The procedure of relay and MCS selection can be formulated as a discounted Markov decision chain, and the relay policy can be obtained with recent advances in stochastic control algorithms. Simulation results are presented to show the effectiveness of the proposed scheme.

Energy-efficient joint relay node selection and power allocation over multihop relaying cellular networks toward LTE-Advanced

Cooperative relaying is emerging as an effective technology to fulfill requirements on high data rate coverage in next-generation cellular networks, like long term evolution-advanced （LTE-Advanced）. In this paper, we propose a distributed joint relay node （RN） selection and power allocation scheme over multihop relaying cellular networks toward LTE-Advanced, taking both the wireless channel state and RNs＇ residual energy into consideration. We formulate the multihop relaying cellular network as a restless bandit system. The first-order finite-state Markov chain is used to characterize the time-varying channel and residual energy state transitions. With this stochastic optimization formulation, the optimal policy has indexability property that dramatically reduces the computational complexity. Simulation results demonstrate that the proposed scheme can efficiently enhance the expected system reward, compared with other existing algorithms.

Relaying strategy for peer-to-peer content distribution based on genetic algorithm

This article proposes a cooperative relaying strategy to efficiently utilize the relaying resources of Interact service providers （ISPs）, speedup distribution and save server bandwidth costs. ISPs cooperatively relay for each other, and peers assist in distributing and fetching the content as near as possible. Base on the fluid model, a constrained model is derived to get optimized global distribution performance in the channel-based system with limited relaying resources. The multi-objectives of the model are minimizing the average distribution time and the distribution time of the slowest channel. Genetic algorithm （GA） is designed to solve the optimization problem. The relaying strategy based on GA can be run periodically to update the allocation policy of ISPs. The distribution performance of the relaying strategy is analyzed in the experiments and results show that GA can provide proper solutions for various network topologies.