Power allocation of cooperative amplify-and-forward communications with multiple relays

Cooperative diversity is one of the most effective ways to mitigate the fading effect of wireless channels and obtain the spatial gain in wireless networks.In this paper,an optimal power allocation(OPA)scheme for a cooperative communication system using the amplify-and-forward(AF)transmit strategy with multiple relay users is proposed by minimizing the bit-error-rate(BER)at the destination under the constraint of the total transmit power of both the source user and the relay users.Simulation results indicate that the proposed power allocation method can achieve significant BER performance improvement than using the equal power allocation(EPA)scheme,while still attains low complexity.The system performance is improved significantly with the increasing of the number of relay users at high signal-noise ratio(SNR).However,at low SNR,the system performance decreases when the relay number increases.Thus,an adaptive relay selection scheme may be used to choose the appropriate relay numbers in different transmission scenarios to provide system performance improvement and keep the power allocation scheme with low complexity.     

Joint power allocation and multi-relay selection scheme based on system outage probability

An amplify-and-forward （AF） based multi-relay network is studied. In order to minimize the system outage probability with a required transmission rate, a joint power allocation （PA） and multi-relay selection scheme is proposed under both total and individual power constraints （TIPC）. In the proposed scheme, the idea of ordering is adopted to avoid exhaustive search without losing much system performance. Besides the channel quantity, the ordering algorithm proposed in this article also takes relays＇ maximal output ability into consideration, which is usually ignored in traditional relay ordering algorithms. In addition, simple power reallocation method is provided to avoid repetitive PA operation during the process of searching all possible relay subsets. By Adopting the idea of ordering and using the proposed power reallocation method lead to remarkable decrease of the computation complexity, making the scheme easier and more feasible to implement in practical communication scenarios. Simulations show that the proposed multi-relay selection scheme provides similar performance compared to the optimal scheme with optimal PA and exhaustive search （OPAES） but with much lower complexity.     

Cooperative Privacy Provisioning for Energy Harvesting Based Cognitive Multi-Relay Networks

In order to provide privacy provisioning for the secondary information,we propose an energy harvesting based secure transmission scheme for the cognitive multi-relay networks.In the proposed scheme,two secondary relays harvest energy to power the secondary transmitter and assist the secondary secure transmission without interfere the secondary transmission.Specifically,the proposed secure transmission policy is implemented into two phases.In the first phase,the secondary transmitter transmits the secrecy information and jamming signal through the power split method.After harvesting energy from a fraction of received radio-frequency signals,one secondary relay adopts the amplify-and-forward relay protocol to assist the secondary secure transmission and the other secondary relay just forwards the new designed jamming signal to protect the secondary privacy information and degrade the jamming interference at the secondary receiver.For the proposed scheme,we first analyze the average secrecy rate,the secondary secrecy outage probability,and the ergodic secrecy rate,and derive their closed-form expressions.Following the above results,we optimally allocate the transmission power such that the secrecy rate is maximized under the secrecy outage probability constraint.For the optimization problem,an AI based simulated annealing algorithm is proposed to allocate the transmit power.Numerical results are presented to validate the performance analytical results and show the performance superiority of the proposed scheme in terms of the average secrecy rate.     

Evolution Handoff Strategy for Real-Time Video Transmission over Practical Cognitive Radio Networks

The transmission delay of realtime video packet mainly depends on the sensing time delay(short-term factor) and the entire frame transmission delay(long-term factor).Therefore,the optimization problem in the spectrum handoff process should be formulated as the combination of microscopic optimization and macroscopic optimization.In this paper,we focus on the issue of combining these two optimization models,and propose a novel Evolution Spectrum Handoff(ESH)strategy to minimize the expected transmission delay of real-time video packet.In the microoptimized model,considering the tradeoff between Primary User’s(PU’s) allowable collision percentage of each channel and transmission delay of video packet,we propose a mixed integer non-linear programming scheme.The scheme is able to achieve the minimum sensing time which is termed as an optimal stopping time.In the macro-optimized model,using the optimal stopping time as reward function within the partially observable Markov decision process framework,the EHS strategy is designed to search an optimal target channel set and minimize the expected delay of packet in the long-term real-time video transmission.Meanwhile,the minimum expected transmission delay is obtained under practical cognitive radio networks’ conditions,i.e.,secondary user’s mobility,PU’s random access,imperfect sensing information,etc..Theoretical analysis and simulation results show that the ESH strategy can effectively reduce the transmission delay of video packet in spectrum handoff process.     

Enabling Energy Efficient Sensory Data Collection Using Multiple Mobile Sink

Mobile sink is the challenging task for wireless sensor networks （WSNs）. In this paper we propose to design an efficient routing protocol for single mobile sink and multiple mobile sink for data gathering in WSN. In this process, a biased random walk method is used to determine the next position of the sink. Then, a rendezvous point selection with splitting tree technique is used to find the optimal data transmission path. If the sink moves within the range of the rendezvous point, it receives the gathered data and if moved out, it selects a relay node from its neighbours to relay packets from rendezvous point to the sink. Proposed algorithm reduces the signal overhead and improves the triangular routing problem. Here the sink acts as a vehicle and collect the data from the sensor. The results show that the proposed model effectively supports sink mobility with low overhead and delay when compared with Intelligent Agent-based Routing protocol （IAR） and also increases the reliability and delivery ratio when the number of sources increases.     

A Novel Floodless Service Discovery Mechanism Designed for Software-Defined Networking

The low-cost, self-configuration capability and ＂plug-and-play＂ feature of Ethernet establishes its dominant position in the local area networks （LAN）. However, it is hard to extend to large scale because of the legacy broadcast-based service discovery mechanism. Therefore, to solve this problem, a new split network architecture named Software-Defined Networking （SDN） is introduced in this paper, and a novel floodless service discovery mechanism （FSDM） for SDN is designed. For the FSDM, the widespread broadcast messages for Dynamic Host Configuration Protocol （DHCP） and Address Resolution Protocol （ARP） are considered especially, respectively. Then the DHCP relay and ARP proxy are proposed to handle DHCP broadcast messages and ARP broadcast messages, respectively. The proposed FSDM in this paper can eliminate flooding completely, reserve the auto- configuration characteristics. Particularly, there is no need to change the existing hardware, software and protocols of hosts for the proposed scheme. Finally, the simulation results are demonstrated to show that our proposed model allows redundant links existed in network and has the property of scalability, which can significantly reduce network traffic in data plane and control traffic in control plane, and decrease the overhead of control plane.     

Energy efficient HARQ scheme for wireless communication over block fading channel

Energy efficiency(EE) can be enhanced by retransmissions and combining in hybrid automatic repeat request(HARQ) system. However, it is difficult to optimize the transmit power of each retransmission when the accurate retransmission number and future channel state information(CSI) cannot be obtained. This paper proposes a simple energy efficient HARQ scheme for point-to-point wireless communication. In the proposed scheme, the conditional word error rate(WER) of each retransmission is fixed and the transmit power is adapted correspondingly. Three performance metrics are analyzed including average transmission number, throughput and EE. Compared with the conventional equal power HARQ scheme, the proposed scheme can significantly improve the EE and other two metrics under the same constraint of average transmit power or average energy consumption. Furthermore, it is found that, selecting a conditional WER which is slightly smaller than the optimal one is sufficient for practical implementation.     

Energy-efficient performance of cooperative relay network with joint sensing-transmission time duration and power allocation

A joint optimal sensing-transmission time duration and power allocation scheme has been proposed to maximize the energy efficiency for cooperative relay network.In particular,observing that the spectrum sensing and data transmission time duration lies within a strict interval,the joint optimal solutions of our proposed scheme are achieved by sequential optimization method.Numerical evaluation results reveal that the relay-assisted transmission using our proposed scheme significantly outperforms the non-relay transmission in terms of the network energy-efficiency.     

Dynamic subcarrier and power allocation based on cooperative game theory in symmetric cooperative OFDMA networks

In order to improve the efficiency and fairness of radio resource utilization,a scheme of dynamic cooperative subcarrier and power allocation based on Nash bargaining solution(NBS-DCSPA) is proposed in the uplink of a three-node symmetric cooperative orthogonal frequency division multiple access(OFDMA) system.In the proposed NBS-DCSPA scheme,resource allocation problem is formulated as a two-person subcarrier and power allocation bargaining game(SPABG) to maximize the system utility,under the constraints of each user’s maximal power and minimal rate,while considering the fairness between the two users.Firstly,the equivalent direct channel gain of the relay link is introduced to decide the transmission mode of each subcarrier.Then,all subcarriers can be dynamically allocated to the two users in terms of their selected transmission mode.After that,the adaptive power allocation scheme combined with dynamic subcarrier allocation is optimized according to NBS.Finally,computer simulation is conducted to show the efficiency and fairness performance of the proposed NBS-DCSPA scheme.     

Resource allocation for multiuser two-way OFDMA relay networks with user rate constraints

This paper studies the resource allocation for a multi-user two-way amplify-and-forward (AF) relay network over orthogonal frequency-division multiplexing (OFDM) technology,where all users communicate with their pre-assigned partners.Using convex optimization techniques,an optimal solution tominimize the total transmit power while satisfy each user-pair’s data rate requirements is proposed.We divide the resource allocation problem into two subproblems:(1) power optimization within user-pair and relay in each subcarrier.(2) optimal subcarrier allocation and sum power assignment among N parallel OFDM subcarriers.Closed-form expressions of the power among user-pair and relay can be obtained in subproblem (1),and so the proposed algorithm decreases the variable dimensionality of the objective function to reduce the complexity of this optimization problem.To solve it,a three-step suboptimal approach is proposed to assign the resources to user-pairs:Firstly,decompose each user-pair into two sub user-pairs which have one-way and two-way relaying transmission modes.Secondly,allocate the subcarriers to the new mode user-pairs and assign the transmit power to each carrier.Thirdly,distribute the assigned power to three nodes allocated in the subcarrier.Simulation results demonstrate the significant power is saved with the proposed solutions,as compared to a fixed subcarrier allocation.     

An Efficient Multi-hop Broadcast Protocol for Emergency Messages Dissemination in VANETs

Black-burst based multi-hop broadcast protocols are effective means to disseminate Emergency messages (EMs) in Vehicular ad hoc networks (VANETs). However, Clear to broadcast (CTB) collision will happen and reduce propagation speed. Aiming at this problem, we propose a Black-burst and multi-channel based multi-hop broadcast (BMMB) protocol. Vehicles with multiple antennas can transmit and sense black-burst at different channels simultaneously based on multi-channel technol-ogy. Compared with existing black-burst based methods, BMMB shortens the iterative procedure to find out the optimal segment. Only one relay vehicle can be rapidly se-lected within the optimal segment without CTB collision. BMMB enables alternative broadcast methods, i.e., uni-directional broadcast and multi-directional broadcast for straight roads and intersections respectively. Theoretical analysis is done for performance evaluation of BMMB, and simulation results demonstrate that BMMB performs better in terms of average one-hop delay and propagation speed.     

A Street Broadcast Reduction Scheme (SBR) to Mitigate the Broadcast Storm Problem in VANETs

In urban vehicular wireless environments, several vehicles can send warning messages and so every vehicle within the transmission range will receive the broadcast transmission, possibly rebroadcasting these messages to other vehicles. This increases the number of vehicles receiving the traffic warning messages. Hence, redundancy, contention, and packet collisions due to simultaneous forwarding (usually known as the broadcast storm problem), can occur. In the past, several approaches have been proposed to solve the broadcast storm problem in wireless networks such as Mobile ad hoc Networks MANETs. In this paper, we present Street Broadcast Reduction SBR, a novel scheme that mitigates the broadcast storm problem in VANETs. SBR also reduces the warning message notification time and increases the number of vehicles that are informed about the alert.     

Analysis and Design of Warning Delivery Service in Intervehicular Networks

This paper focuses on inter-vehicular networks providing warning delivery service. As soon as a danger is detected, the propagation of a warning message is triggered, with the aim of guaranteeing a safety area around the point in which the danger is located. Multiple broadcast cycles can be generated so that a given lifetime of the safety area is guaranteed. The service is based on multi-hop ad hoc inter-vehicular communications with a probabilistic choice of the relay nodes. The scenario we consider consists of high speed streets, such as highways, in which vehicles exhibit one-dimensional movements along the direction of the road. We propose an analytical model for the study of this service and derive performance indices such as the probability that a vehicle is informed, the average number of duplicate messages received by a vehicle and the average delay. Moreover, we use the model to discuss system design issues, which include the proper setting of the forwarding probability at each vehicle, so that a given probability to receive the warning can be guaranteed to all vehicles in the safety area. The model is validated against simulation results. Since it is very accurate, the model can be instrumental to the performance evaluation and design of broadcasting techniques in inter-vehicular networks.     

Multiantenna Bidirectional Broadcast Channels— Optimal Transmit Strategies

We consider a three-node network where a relay node establishes a bidirectional communication between the two other nodes using a spectrally efficient decode-and-forward protocol. In the first phase we have the classical multiple-access channel where both nodes transmit a message to the relay node, which then decodes the messages. In the second phase the relay broadcasts a re-encoded composition of them based on the network coding idea. This means that each receiving node uses the same data stream to infer on its intended message. We characterize the optimal transmit strategy for the broadcast phase where either the relay node or the two other nodes are equipped with multiple antennas. Our main result shows that beamforming into the subspace spanned by the channels is always an optimal transmit strategy for the multiple-input single-output bidirectional broadcast channel. Thereby, it shows that correlation between the channels is advantageous. Moreover, this leads to a parametrization of the optimal transmit strategy which specifies the whole capacity region. In retrospect the results are intuitively clear since the single-beam transmit strategy reflects the single stream processing due to the network coding approach.     

一种多源协作网络的分布式功率分配与中继选择算法

该文针对多源-多中继放大转发协作通信网络,以最小化系统总功率为目标,在保证系统满足一定中断概率的前提下,提出了一种分布式功率分配与中继选择算法.算法由源节点自主选择为其转发信息的中继节点,并引入定时器,通过竞争方式避免了分布式所导致的中继选择冲突.中继收到来自源节点的信号后,只需根据转发门限自主判断是否进行转发,从而完成传输.仿真结果表明该分布式算法能够有效降低传输所需要的总发射功率.并且与集中式控制所获得的最优中继选择与功率分配算法相比性能相近,但所提分布式算法显著降低了系统的控制开销.     

A Water-Wave Broadcast Scheme for Emergency Messages in VANET

Vehicular Ad Hoc Network (VANET) is an emerging new technology and a promising platform for the intelligent transportation system. The most important application of VANET is disseminating emergency messages to drivers in case of dangerous events. The effectiveness depends on the design of a broadcast scheme. A simple broadcast scheme encounters many problems such as broadcast storm, connection hole, building shadow, and intersection problems. In this paper, we propose an efficient broadcast scheme that simulates water wave propagation to spread emergency messages. This scheme provides warning services with both space and time constraints. Most existing broadcast schemes provide inadequate strategies for limiting the time period of a warning. We verified the performance of our proposed scheme in a simulated street environment with vehicle movements to show the superiority of this scheme in high broadcast coverage areas.     

Interference-aware node access scheme in UAV-aided VANET

In vehicular Ad Hoc network (VANET),frequent link handovers and channel interference can lead to increased transmission delay and decreased network throughput.To address the issues,unmanned aerial vehicle (UAV) were introduced to cooperate with vehicles and construct UAV-assisted air-ground integrated VANET.An interference-aware node access scheme was proposed.The node access problem was formulated as a multi-objective optimization problem considering link transmission rate,link handovers and transmit power.Then the optimization problem was decomposed into two convex optimization sub-problems by dual decomposition method,the sub-problem jointly optimizes handovers and link transmission rate while the sub-problem optimizes the transmit power based on link reliability.Finally,simulation results show that the proposed mechanism can effectively improve data delivery ratio,average end-to-end delay and network throughput.     

A reliable transmission protocol for ZigBee-based wireless patient monitoring

Patient monitoring systems are gaining their importance as the fast-growing global elderly population increases demands for caretaking. These systems use wireless technologies to transmit vital signs for medical evaluation. In a multihop ZigBee network, the existing systems usually use broadcast or multicast schemes to increase the reliability of signals transmission; however, both the schemes lead to significantly higher network traffic and end-to-end transmission delay. In this paper, we present a reliable transmission protocol based on anycast routing for wireless patient monitoring. Our scheme automatically selects the closest data receiver in an anycast group as a destination to reduce the transmission latency as well as the control overhead. The new protocol also shortens the latency of path recovery by initiating route recovery from the intermediate routers of the original path. On the basis of a reliable transmission scheme, we implement a ZigBee device for fall monitoring, which integrates fall detection, indoor positioning, and ECG monitoring. When the triaxial accelerometer of the device detects a fall, the current position of the patient is transmitted to an emergency center through a ZigBee network. In order to clarify the situation of the fallen patient, 4-s ECG signals are also transmitted. Our transmission scheme ensures the successful transmission of these critical messages. The experimental results show that our scheme is fast and reliable. We also demonstrate that our devices can seamlessly integrate with the next generation technology of wireless wide area network, worldwide interoperability for microwave access, to achieve real-time patient monitoring.     

Synchronous multicast and broadcast service in multi-rate IEEE 802.16j WiMAX relay network

IEEE 802.16j Mobile Multihop Relay Standard defines multi-hop relay operation in a WiMAX system. It uses a novel synchronous multicast and broadcast transmission mechanism to achieve macro diversity. With the newly introduced synchronous delivery constraint, the multicast data delivery algorithm should be designed differently to enhance system performance. This paper provides Multi-Rate Selection Algorithm (MRSA) for multicast and broadcast (MBS) data delivery. It could reduce the data distribution delay from the BS to all the RSs. Besides, we also propose the path selection algorithm to further improve the effectiveness of MRSA. Our simulation results show that using MRSA with our shortest-path path selection algorithm, the delay for data delivery in 802.16j MBS system could be greatly reduced. The proposed scheme could achieve the performance closed to the optimal solutions. To the authors’ best knowledge, this is the first research work to investigate the IEEE 802.16j multicast and broadcast problem.