无线网络中基于DSDV的最大化吞吐量的协作路由算法

为最大化无线自组织网络的吞吐量,提出一种自适应的协作路由算法。在算法中,协作分集技术与路由选择相结合,通过在路由的每一跳选择最佳的中继节点协作发送节点传输信息来改善网络吞吐量。首先通过目的序列距离矢量路由协议（DSDV）初步建立最短路由路径,在每条链路的发送节点和接收节点根据邻节点表选出公共邻居节点,建立候选中继集合;进一步,每一跳根据链路吞吐量,在候选中继集合中自适应选择最多两个中继来协助发送节点进行传输,并根据选出的中继节点数动态分配节点发射功率。在保证系统发射功率一定的情况下,最大化网络吞吐量。仿真结果表明,在相同的发射功率下,相对于非协作路由DSDV算法,采用固定数量中继的协作路由算法提高了整个网络的吞吐量,而自适应的协作路由算法可进一步提高吞吐量;同时仿真了网络吞吐量与网络规模和节点最大移动速度的变化关系。      

Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding

Cooperation schemes form a key aspect of infrastructure-less wireless networks that allow nodes that cannot directly communicate to exchange information through the help of intermediate nodes. The most widely adopted approach is based on hop-by-hop forwarding at the network layer along a path to destination. Cooperative relaying brings cooperation to the physical layer in order to fully exploit wireless resources. The concept exploits channel diversity by using multiple radio units to transmit the same message. The underlying fundamentals of cooperative relaying have been quite well-studied from a transmission efficiency point of view, in particular with a single pair of source and destination. Results of its performance gain in a multi-hop networking context with multiple sources and destinations are, however, less available. In this paper, we provide an optimization approach to assess the performance gain of cooperative relaying vis-a-vis conventional multi-hop forwarding under arbitrary network topology. The approach joint optimizes packet routing and transmission scheduling, and generalizes classical optimization schemes for non-cooperative networks. We provide numerical results demonstrating that the gain of cooperative relaying in networking scenarios is in general rather small and decreases when network connectivity and the number of traffic flows increase, due to interference and resource reuse limitations. In addition to quantifying the performance gain, our approach leads to a new framework for optimizing routing and scheduling in cooperative networks under a generalized Spacial Time Division Multiple Access (STDMA) scheme.     

Cooperative Wireless Medium Access Exploiting Multi-Beam Adaptive Arrays and Relay Selection

Cooperative transmission among wireless network nodes can be exploited to resolve collisions and thereby enhance the network throughput. Incorporation of multi-beam adaptive array (MBAA) at a base station/access point (destination) receiver has been shown to improve the network performance. In this paper, we propose an efficient cooperative wireless medium access scheme that exploits novel relay selection methods in a network equipped with MBAA at the destination receiver. Unlike existing techniques that require the estimation of angles-of-arrival (AoAs), the proposed scheme uses the spatial correlation among users for simpler but more effective collision detection and resolution. We present two useful relay selection methods based on channel gain and spatial correlation. It is shown that the joint use of an effective relay selection method and an MBAA in a wireless network can significantly improve the uplink throughput. The throughput of the proposed scheme and its upper bound are analytically derived. Numerical and simulation results have demonstrated significant performance enhancement achieved by the proposed cooperative wireless medium access scheme.     

Cooperative quadrature physical layer network coding in wireless relay networks

This paper proposes a cooperative quadrature physical layer network coding (CQPNC) scheme for a dual‐hop cooperative relay network, which consists of two source nodes, one relay node and one destination node. All nodes in the network have one antenna, and the two source nodes transmit their signals modulated with quadrature carriers. In this paper, a cooperative quadrature physical layer network coded decode‐and‐forward (DF) relay protocol (CQPNC‐DF) is proposed to transmit the composite information from the two source nodes via the relay node to the destination node simultaneously to reduce the number of time slots required for a transmission. The proposed CQPNC‐DF relay protocol is compared with time‐division multiple‐access amplify‐and‐forward (TDMA‐AF), TDMA‐DF, cooperative network coded DF (CNC‐DF) and cooperative analog network coded AF (CANC‐AF) relay protocols to demonstrate its effectiveness in terms of bit error rate (BER) and system throughput under different propagation conditions. The simulation results reveal that the proposed CQPNC‐DF relay protocol can significantly improve the network performance. Compared with two TDMA schemes and CNC‐DF, the proposal can provide up to 100% and 50% throughput gains, respectively. Moreover, no matter what the scene, the proposed scheme always has the lowest BER in the low SNR region. Copyright © 2013 John Wiley & Sons, Ltd.     

Cooperative relay to improve diversity in cognitive radio networks

Recent studies demonstrated that dynamic spectrum access can improve spectrum utilization significantly by allowing secondary unlicensed users to dynamically share the spectrum that is not used by the primary licensed users. Cognitive radio was proposed to promote the spectrum utilization by opportunistically exploiting the existence of spectrum ?holes.? Meanwhile, cooperative relay technology is regarded widely as a key technology for increasing transmission diversity gain in various types of wireless networks, including cognitive radio networks. In this article, we first give a brief overview of the envisioned applications of: cooperative relay technology to CRNs, cooperative transmission of primary traffic by secondary users, cooperative transmission between secondary nodes to improve spatial diversity, and cooperative relay between secondary nodes to improve spectrum diversity. As the latter is a new direction, in this article we focus on this scenario and investigate a simple wireless network, where a spectrum-rich node is selected as the relay node to improve the performance between the source and the destination. With the introduction of cooperative relay, many unique problems should be considered, especially the issue for relay selection and spectrum allocation. To demonstrate the feasibility and performance of cooperative relay for cognitive radio, a new MAC protocol was proposed and implemented in a universal software radio peripheral-based testbed. Experimental results show that the throughput of the whole system is greatly increased by exploiting the benefit of cooperative relay.     

协同分集和截断ARQ在单中继无线网的使用：一种交互层研究

该文着重研究了无编码两跳中继网中考虑各节点的最大传输次数受限时的一种交互层协同设计,提出了两种类型的简单自适应中继协同策略以探索一种合并的空间分集与时间分集.分析与计算机仿真表明:在非对称的多跳无线网和块衰落信道下,尽管基于截断ARQ (Automatic Repeat Request)的重传将带来一定的平均吞吐量下降,但该协同策略在实现有效的天线与能量共享的同时,也显著地改善了系统的帧误码性能.     

An efficient MAC protocol with cooperative retransmission in mobile ad hoc networks

In emerging wireless networks, cooperative retransmission is employed to replace packet retransmission between a pair of sender and receiver with poor channel condition. A cooperative MAC protocol which utilizes such benefit is proposed in this paper to improve the network performance in mobile ad hoc networks. In the proposed protocol, relay nodes between sender and receiver are used if the sender cannot communicate with the receiver reliably. Furthermore, the receiver may also stop forwarding the received data frame if the frame is received by the next‐hop receiver on the route to the final destination node. Simulation results show that the proposed protocol outperforms previous works in terms of increased transmission reliability and reduced delay time. Copyright © 2010 John Wiley & Sons, Ltd.     

Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks

We develop and analyze space-time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a manner that the destination terminal can average the fading, even though it is unknown a priori which terminals will be involved. In particular, a source initiates transmission to its destination, and many relays potentially receive the transmission. Those terminals that can fully decode the transmission utilize a space-time code to cooperatively relay to the destination. We demonstrate that these protocols achieve full spatial diversity in the number of cooperating terminals, not just the number of decoding relays, and can be used effectively for higher spectral efficiencies than repetition-based schemes. We discuss issues related to space-time code design for these protocols, emphasizing codes that readily allow for appealing distributed versions.     

Exploiting cooperative relays to enhance the performance of energy-harvesting systems over Nakagami-<Emphasis Type="Italic">m</Emphasis> fading channels

This paper investigates a time-switching energy-harvesting system in which a source communicates with a destination via energy-constrained amplify-and-forward relays. To exploit the benefit of using multiple relays, we propose a relay scheduling called consecutive relay selection (CRS), which allows all relays to assist the source-to-destination communication, to improve the transmission efficiency of the time-switching policy. The partial relay selection (PRS) is examined for performance comparison. The selected relay in the PRS protocol is considered in two cases: in one, it is selected based on the first-hop channel gains (PRS-1 protocol), and in the other, it is selected based on the second-hop channel gains (PRS-2 protocol). For performance evaluation, the analytical expressions of the outage probability and throughput for Nakagami-m fading channel are derived. Our results show that the CRS protocol outperforms the PRS protocol in terms of throughput, the PRS-1 protocol achieves better performance than the PRS-2 protocol. Moreover, we discuss the effects of various key system parameters on system performance, such as the energy-harvesting ratio, source transmission rate, and locations of relays, to provide insights into the various design choices.     

Energy-Aware Routing Algorithm for Wireless Sensor Networks with Optimal Relay Detecting

Efficient and reliable routing plays a key role in wireless sensor networks in which routing design with regard to network availability and node lifetime needs to be deliberately considered. When multi-hop relay transmission is frequently applied to reduce a source node’s energy consumption and improve network capacity, a key issue affecting the nodes’ participation in the transmission is the problem of suitably determining the next hop in order to prolong each node’s lifetime and to maintain the energy-balancing of the whole network. In this study, we propose an energy-aware routing scheme by taking the Cauchy operator, node’s residual energy and routing distance into account. Based on Cauchy inequation, we achieve a relationship between the routing distance and the energy usage in the routing. By fixing a relay selection parameter and then identifying the next hop appropriately, we obtain a balancing energy-aware routing algorithm. Numerical results are provided to verify the lifetime and equilibrium of the energy distribution by comparing with them with those of a traditional approach.     

Optimal power‐aware relay placement for cooperative wireless sensor networks

We study the problem of optimizing the symbol error probability (SEP) performance of cluster‐based cooperative wireless sensor networks. Recent studies in literature show that an efficient relay selection protocol based on simple geographical information of the nodes to execute cooperative diversity can significantly improve the SEP performance at the destination of such networks. As well, similar line of research on optimal power allocation (for the source and relay nodes) can be found in literature. However, to achieve the best SEP performance at the destination of a cooperative wireless sensor network, joint optimization of power allocation and relay placement should be accomplished. To this aim, we reformulate the SEP of a multi‐hop cooperative communication in a general form and optimize transmitted power level and relay placement simultaneously. This analysis is developed for both amplify‐and‐forward and decode‐and‐forward relaying protocols. Simulation results demonstrate that the proposed joint optimization can effectively improve the SEP performance of the network. Copyright © 2013 John Wiley & Sons, Ltd.     

An efficient MAC protocol for cooperative diversity in mobile ad hoc networks

Cooperative diversity is proposed to combat the detrimental effects of channel fading. In this paper, we investigate the effectiveness of cooperative diversity in interference limited ad hoc networks. The negative effects due to relay blocking on the network throughput are investigated. We show that the relay blocking problem is mainly dependent on the relay selection criterion. To overcome this problem, we propose a new cooperative diversity technique based on a modified IEEE 802.11 Medium Access Control (MAC) protocol. The throughput performance of the proposed MAC protocol is analyzed using a random structured network where nodes are assumed to be equipped with multiple antennas. In our simulations, we consider both single‐ and multiple‐relay scenarios over fading channels. Copyright © 2007 John Wiley & Sons, Ltd.     

Multi-hop routing with cooperative transmission: a cross-layer approach

Cooperative diversity techniques have received a lot of attention recently due to their ability to provide spatial diversity in fading wireless environment without the requirement of implementing multiple antenna on the same device. It increases link reliability, provides higher capacity, reduces transmit power, and extends transmission range for the same level of performance and modulation rate. In this paper, we study the achievable gain of cooperative communications from a wireless cross-layer point of view in multi hop networks. We propose two routing algorithms applicable for wireless ad hoc networks. First, we propose an edge node based on a greedy cooperative routing (ENBGCR) algorithm, where we modify the geographic routing algorithm to incorporate the cooperative transmission and extend the coverage range of the nodes. The main objective of ENBGCR algorithm is to minimize the number of hops that messages transverse to reach their destination. Then the energy-efficient cooperative routing algorithm is proposed to minimize the end-to-end total transmission power subject to end-to-end target data rate. Simulation results for both algorithms show that the proposed strategies have great improvement in terms of delay and power saving respectively for the same quality of service requirement as compared to traditional algorithms.     

Impact of residual transmit RF impairments on energy harvesting relay selection systems

In this paper, we study the impact of residual transmit radio-frequency impairments (RTRIs) on a dual-hop energy-harvesting system in which a source and a destination both having multiple antennas communicate to each other with the help of single-antenna amplify-and-forward (AF) relays. The source and destination employ maximum ratio transmission (MRT) and maximal ratio combining (MRC), respectively, to exploit the benefits of using multiple antennas. To simplify the system complexity, we propose two partial relay selection (PRS) schemes (RSSs) that maximise the combined channel gains of the first hop (PRS-1 scheme) and the second hop (PRS-2 scheme), respectively. Both time-switching relaying (TSR) and power-splitting relaying (PSR) protocols are examined. In order to evaluate the system performance, the analytical expressions for outage probability and ergodic capacity are derived, and then the throughput expressions for delay-limited and delay-tolerant transmission modes are formulated. The analytical results are validated by Monte Carlo simulations. Our results show that: (1) The impact of RTRI can be significantly reduced by increasing the number of antennas and relays. (2) The PRS-1 scheme outperforms the PRS-2 scheme. (3) In the delay-limited mode, the TSR protocol performs better than the PSR protocol at high impairment levels, whereas in the delay-tolerant mode, the throughput of the PSR protocol is superior to that of the TSR protocol.     

End-to-End Link Reliable Energy Efficient Multipath Routing for Mobile Ad Hoc Networks

Among the many multipath routing protocols, the AOMDV is widely used in highly dynamic ad hoc networks because of its generic feature. Since the communicating nodes in AOMDV are prone to link failures and route breaks due to the selection of multiple routes between any source and destination pair based on minimal hop count which does not ensure end-to-end reliable data transmission. To overcome such problems, we propose a novel node disjoint multipath routing protocol called End-to-End Link Reliable Energy Efficient Multipath Routing (E2E-LREEMR) protocol by extending AOMDV. The E2E-LREEMR finds multiple link reliable energy efficient paths between any source and destination pair for data transmission using two metrics such as Path-Link Quality Estimator and Path-Node Energy Estimator. We evaluate the performance of E2E-LREEMR protocol using NS 2.34 with varying network flows under random way-point mobility model and compare it with AOMDV routing protocol in terms of Quality of Service metrics. When there is a hike in network flows, the E2E-LREEMR reduces 30.43 % of average end-to-end delay, 29.44 % of routing overhead, 32.65 % of packet loss ratio, 18.79 % of normalized routing overhead and 12.87 % of energy consumption. It also increases rather 10.26 % of packet delivery ratio and 6.96 % of throughput than AOMDV routing protocol.     

Performance analysis of multi-user diversity in heterogeneous cooperative communication systems

The heterogeneous cooperative relaying technique can be utilized to complete the hierarchical convergence for the multi-radio access networks, where the single heterogeneous cooperative relay is selected and the maximal-ratio combining (MRC) scheme is utilized to achieve the cooperative diversity gain. In order to evaluate performances of the hierarchical convergence mechanism, this paper theoretically investigates the key factors of the multi-user diversity (MUD) gain, the heterogeneous cooperative diversity gain and the large scale fading of the first and second links. The tight closed-form expressions in terms of the outage probability and the average symbol error rate are derived for evaluating how and with what factors impact on the system performance. The analytical and simulation results show that the number of heterogeneous cooperative relay nodes (HCRNs)M and the number of destination stations (DSs)K have great impacts on performances, and the order of outage probability is (M + 1)K. The large scale fading ratio of the first hop to the second hop also has a big impact on performances. Thus in the real network, we can utilize advanced radio resource management schemes to achieve a high multi-user diversity, instead of configuring too many HCRNs for the heterogeneous cooperative diversity gain. Furthermore, we can guarantee the transmission quality between the BS and HCRNs via the network planning to optimize the overall network performance.     

Energy-balanced cooperative routing in multihop wireless networks

Cooperative communication (CC) allows multiple nodes to simultaneously transmit the same packet to the receiver so that the combined signal at the receiver can be correctly decoded. Since the CC can reduce the transmission power and extend the transmission coverage, it has been considered in minimum energy routing protocols to reduce the total energy consumption. However, previous research on cooperative routing only focuses on minimizing the total energy consumption from the source node to the destination node, which may lead to the unbalanced energy distribution among nodes. In this paper, we aim to study the impact of cooperative routing on balancing the energy distribution among nodes. By introducing a new routing scheme which carefully selects cooperative relay nodes and assigns their transmission power, our cooperative routing method can balance the remaining energy among neighboring nodes to maximize the lifetime of the network. Simulation results demonstrate that the proposed cooperative routing algorithm significantly balances the energy distribution and prolongs the lifetime of the network.     

提高蜂窝网络中数据分发效率的D2D协作转发算法

Device-to-Device(D2D)通信是一种移动终端在蜂窝通信系统的控制下使用授权频段进行点到点通信的新型技术。通过允许接收终端间的数据转发,D2D通信可以用来提高蜂窝网络中的数据分发效率。现有的终端间转发算法,没有充分考虑D2D链路的差异,很难实现频谱资源的高效利用。为此,该文提出了一种基于多跳中继的D2D协作转发算法,包括多播和单播两个模式。该算法根据D2D链路质量自适应地选择最优的中继、路由及传输跳数,能够充分利用D2D链路的多信道分集增益。仿真结果表明,该文所提出的算法能够显著地提高D2D转发的资源利用率,进而提升数据分发业务的吞吐量。     

Performance of Transmit Antenna Selection and Maximal-Ratio Combining in Dual Hop Amplify-and-Forward Relay Network over Nakagami-m Fading Channels

In this paper, we study end-to-end performance of transmit antenna selection (TAS) and maximal ratio combining (MRC) in dual hop amplify-and-forward relay network in flat and asymmetric Nakagami-m fading channels. In the network, source and destination communicate by the help of single relay and source-destination link is not available. Source and destination are equipped with multiple antennas, and relay is equipped with single antenna. TAS and MRC are used for transmission at the source and reception at the destination, respectively. The relay simply amplifies and forwards the signal sent by the source to the destination by using channel state information (CSI) based gain or fixed gain. By considering relay location, for CSI based and fixed relay gains, we derive closed-form cumulative distribution function, moments and moment generating function of end-to-end signal-to-noise ratio, and closed-form symbol error probability expression. Moreover, asymptotical outage probability and symbol error probability expressions are also derived for both CSI based and fixed gains to obtain diversity order of the network. Analytical results are validated by the Monte Carlo simulations. Results show that diversity order is minimum of products of fading parameter and number of antennas at the end in each hop. In addition, for optimum performance the relay must be closer to the source when the diversity order of the first hop is smaller than or equal to that of the second hop.     

On the Throughput Capacity of Cooperative Multi-hop Wireless Ad hoc Networks with Multi-flow

Cooperative relaying techniques are known to provide spatial diversity for wireless fading channels. In contrast to non-cooperative transmission (direct transmission), they increase link reliability, provide higher capacity, reduce transmit power, and extend transmission range. Mostly the gains of cooperative relaying are shown for single flow scenarios in the absence of inter-flow interference. In this paper we study the effect of inter-flow interference on the capacity of cooperative networks in multi-hop multi-flow settings. We used the conflict graph to model the interference and find the additional constraints introduced due to cooperative transmission by using the concept of cliques on the conflict graph, which can be used to capture the interference relation among links. We formulated the multi-commodity flow problem for network capacity using linear programming, and employed a clique based analysis of the conflict graph to compute interference constraints. It is observed that the throughput drops significantly when cooperative transmissions are used in the network. We also found that the hop counts increase when cooperative links are used that is due to avoiding interfering links, which results in losing the benefits of shortest-path routing.