Cooperative Strategies and Achievable Rate for Tree Networks With Optimal Spatial Reuse

In this paper, a low-complexity cooperative protocol that significantly increases the average throughput of multihop upstream transmissions for wireless tree networks is developed and analyzed. A system in which transmissions are assigned to nodes in a collision free, spatial time division fashion is considered. The suggested protocol exploits the broadcast nature of wireless networks where the communication channel is shared between multiple adjacent nodes within interference range. For any upstream end-to-end flow in the tree, each intermediate node receives information from both one-hop and two-hop neighbors and transmits only sufficient information such that the next upstream one-hop neighbor will be able to decode the packet. This approach can be viewed as the generalization of the classical three node relay channel for end-to-end flows in which each intermediate node becomes successively source, relay and destination. The achievable rate for any regular tree network is derived and an optimal schedule that realizes this rate in most cases is proposed. Our protocol is shown to dramatically outperform the conventional scheme where intermediate nodes simply forward the packets hop by hop. At high signal-to-noise ratio (SNR), it yields approximately 66% throughput gain for practical scenarios.     

Orthogonal frequency division multiple access resource allocation in mobile multihop relay networks using an adaptive frame structure

For wireless mobile multihop relay (MMR) networks, we have chosen orthogonal frequency division multiple access (OFDMA) and time division duplex as a multiple access scheme and a duplex communication technique, respectively. We have also selected nontransparent relay stations (nt‐RSs) as relay nodes to extend the MMR network coverage. Through the nt‐RSs, far‐off subscriber stations (SSs) or hidden SSs can communicate with a base station (BS) that is connected to backhaul networks. In these MMR networks, the way in which a BS and nt‐RSs use OFDMA resources (e.g., OFDMA symbols and subcarriers) and share them might reduce system capacity and network throughput. Therefore, we proposed a new adaptive OFDMA frame structure for both the BS and the nt‐RSs. The proposed scheme is the first approach that incorporates the adaptive technique for wireless MMR networks. Based on the proposed adaptive OFDMA frame structure, an adaptive OFDMA resource allocation for SSs within a BS as well as nt‐RSs was proposed. To derive the maximum OFDMA resource that nt‐RSs can be assigned and to synchronize access zones and relay zones between a superior station and its subordinate nt‐RSs, three properties are introduced: a data relay property, a maximum balance property, and a relay zone limitation property. In addition, we propose max‐min and proportional fairness schemes of the proposed adaptive frame structure. Our numerical analysis and simulations show that the proposed OFDMA allocation scheme performs better than the nonadaptive allocation scheme in terms of network throughput and fairness especially in the asymmetric distribution of subscriber stations between access zones and relay zones in the MMR networks. Copyright © 2011 John Wiley & Sons, Ltd.     

Performance analysis of multihop cellular network with fixed channel assignment

Multihop cellular network (MCN) has been proposed to incorporate the flexibility of ad hoc networks into traditional single-hop cellular networks (SCNs). The performance analysis of MCN through analytical models is not trivial because the classic Erlang B formula no longer applies to MCN where multihop transmission is allowed. In this paper, we first propose a clustered MCN (cMCN) architecture with the use of dedicated information ports (DIPs), which are deployed wireless ports functioning as central controllers for multihop users. The proposed cMCN can be considered as a complement of the existing cellular network. Then, we study the feasibility of modeling time division multiple access (TDMA)-based cMCN with fixed channel assignment (FCA) scheme for uplink transmission. An exact multi-dimensional Markov chain model to analyze the performance of cMCN with FCA is developed. Furthermore, an approximated model which results in reduced complexity is also presented. The analytical results from both models are matched with the simulation results closely. The results show that cMCN with the proposed FCA scheme can reduce the call blocking probability significantly as compared to SCNs with either the conventional FCA or a dynamic channel assignment (DCA) scheme.     

Performance of new relay selection scheme for buffer-assisted multihop decode-and-forward networks

In this paper, a new relay selection scheme is proposed to reduce the end-to-end packet delivery delay for buffer-assisted multihop decode-and-forward cooperative networks. The proposed method selects a relay node having more packets in the associated buffer and relay's proximity to the destination node. Mathematical expressions for the outage probability and average packet delay in Rician fading are obtained by modeling the system as a Markov chain. The proposed relay selection scheme has less packet delay as compared to the max-link relay selection scheme with marginally higher outage probability. Thus, the proposed relay selection scheme is a good alternative to low latency wireless applications.     

Performance Comparison of Time Slot Allocation Schemes in TDD-CDMA Multihop Cellular Networks

Today, high-speed multimedia services are becoming one of the most challenging demands of cellular subscribers. Many approaches have been proposed during last decade and still there are many ongoing researches aiming to provide higher speed and higher quality services for users. Multihop cellular network (MCN) is a promising solution to this problem. MCNs offer high-speed communication to mobile stations which are far from their base stations by relaying their data in a multihop connection. Moreover, TDD-CDMA networks are proven to be able to accommodate the asymmetric traffic generated by applications such as Internet browsers or multimedia applications. These types of traffic are most of the time biased towards uplink or downlink. In this paper we deploy multihop relaying in TDD-CDMA networks in order to provide high data rate connections targeting for multimedia applications. We propose time slot allocation schemes for TDD-CDMA MCNs and compare them with conventional schemes used in TDD-CDMA single-hop cellular networks in terms of users’ data rate and maximum capacity in different symmetric and asymmetric traffic scenarios. Results of this study show that our proposed schemes can provide higher data rate as well as capacity and outperform other conventional schemes.     

The scalable lightwave network

In principle, an optical network employing wavelength routing, wavelength reuse, and multihop packet switching is modularly scalable to very large configurations in both the hardware and software sense. As such, it is a viable architecture for a new ATM-based telecommunications infrastructure The network architecture considered for a new, scalable, broadband telecommunications infrastructure is based on (1) the use of wavelength division multiplexing (WDM) and wavelength routing; (2) the translation of signals from one wavelength to another at the access stations; and (3) the use of multihop ATM packet switching. These principles permit networks to be built whose size is essentially unlimited     

EM channel characteristics and their impact on MAC layer performance in underwater surveillance networks

Wireless communications and multihop networking based on electromagnetic (EM) radios have been considered as an alternative to acoustic communications in seawater because in typical applications for networked underwater sensing, EM waves are much less susceptible to multipath distortion and environmental noise. In this paper, we discuss the characteristics of EM channels in seawater and derive a novel EM signal propagation model. Based on the propagation model, we implement in the QualNet network simulator an EM underwater surveillance network for studying the impact of these unique characteristics of underwater EM channels on the media access control (MAC) layer performance. Both a single‐hop network model and a multihop network model are simulated. Simulation results show that the carrier sense multiple access without or with acknowledgement (CSMAWithoutACK or CSMAWithACK, respectively) has advantages over ALOHA and multiple access with collision avoidance in terms of packet average delay, packet delivery ratio, and MAC scheme overhead. In the multihop network model, the use of CSMAWithoutACK significantly reduces the packet average delay and the MAC scheme overhead, and both CSMAWithoutACK and CSMAWithACK achieve more than 90% packet delivery ratio. Therefore, CSMAWithoutACK (with no handshaking via request‐to‐send and clear‐to‐send control packets) is the most appropriate MAC protocol to be used in multihop EM‐based underwater surveillance networks. © Her Majesty the Queen in Right of Canada 2014. Reproduced with the permission of the Minister of Industry Canada     

Resource scheduling scheme with QoS support in two-hop relay-enhanced OFDMA systems

As the system performance is obviously improved by introducing the concept of relay into the traditional orthogonal frequency division multiple access(OFDMA)systems,resource scheduling in relay-enhanced OFDMA systems is worthy of being studied carefully.To solve the optimization problem of achieving the maximum throughput while satisfying the quality of service(QoS)and guaranteeing the fairness of users,a novel resource scheduling scheme with QoS support for the downlink of two-hop relay-enhanced OFDMA systems is proposed.The proposed scheme,which is considered both in the first time sub-slot between direct link users and relay stations,and the second time sub-slot among relay link users,takes QoS support into consideration,as well as the system throughput and the fairness for users.Simulation results show that the proposed scheme has good performance in maximizing system throughput and guaranteeing the performance in the service delay and the data loss rate.     

Channel and queue aware joint relay selection and resource allocation for MISO-OFDMA based user-relay assisted cellular networks

User-relay assisted orthogonal frequency division multiple access (OFDMA) networks are cost-effective solutions to meet the growing capacity and coverage demands of the next generation cellular networks. These networks can be used with multiple antennas technology in order to obtain a diversity gain to combat signal fading and to obtain more capacity gain without increasing the bandwidth or transmit power. Efficient relay selection and resource allocation are crucial in such a multi-user, multi-relay and multi-antenna environment to fully exploit the benefits of the combination of user-relaying and multiple antennas technology. Thus, we propose a channel and queue aware joint relay selection and resource allocation algorithm for multiple-input single-output (MISO)-OFDMA based user-relay assisted downlink cellular networks. Since, the proposed algorithm is not only channel but also queue-aware, the system resources are allocated efficiently among the users. The proposed algorithm for the MISO-OFDMA based user-relay assisted scheme is compared to existing MISO-OFDMA based non-relaying and fixed relay assisted schemes and it is also compared with the existing single-input single-output (SISO)-OFDMA based user-relay assisted scheme. Simulation results revealed that the proposed scheme outperforms the existing schemes in terms of cell-edge users’ total data rate, average backlog and average delay.     

TDD-CDMA系统中一种新的多用户干扰抑制方案

传统的多用户处理是在上行进行的,本文提出了应用于TDD-CDMA系统中下行方向的一种多用户处理方案.在TDD-CDMA系统中,可以利用上行信道参数对下行信道参数做出估计.本文提出了一种实时利用信道参数来降低CDMA中的多用户干扰的方法.在该方案中,其多用户处理的基本思路是通过优化系统的多用户扩频码字和解扩码字来降低多用户干扰.为了达到最大的信干比,本文提出了系统扩频码选择的优化准则,它能够充分利用信道的特性.本文根据一定的迭代算法给出优化问题的解.数值分析结果表明,采用上述方案的CDMA系统相对于采用Gold码的系统能够极大地降低多用户干扰,提高信干比.     

Packet scheduling for OFDMA based relay networks

The combination of relay networks with orthogonal frequency division multiple access （OFDMA） has been proposed as a promising solution for the next generation wireless system. Considering different traffic classes and user quality of service （QoS）, three efficient scheduling algorithms are introduced in such networks. The round-robin （RR） algorithm in relay networks serves as a performance benchmark. Numerical results show that the proposed algorithms achieve significant improvement on system throughput and decrease system packet loss rate, compared with the RR and absence of relaying system （traditional network）. Furthermore, comparisons have been carried out among the three proposed algorithms.     

Wireless network coding in slotted aloha with two-hop unbalanced traffic

This paper deals with two representative unbalanced traffic cases for two-hop wireless relay access systems employing network coding and a slotted ALOHA protocol. Network coding is a recent and highly regarded technology for capacity enhancement with multiple unicast and multisource multicast networks. We have analyzed the performance of network coding on a two-hop wireless relay access system employing the slotted ALOHA under a balanced bidirectional traffic. The relay nodes will generally undergo this unbalanced multidirectional traffic but the impact of this unbalanced traffic on network coding has not been analyzed. This paper provides closed-form expressions for the throughput and packet delay for two-hop unbalanced bidirectional traffic cases both with and without network coding even if the buffers on nodes are unsaturated. The analytical results are mainly derived by solving queueing systems for the buffer behavior at the relay node. The results show that the transmission probability of the relay node is a design parameter that is crucial to maximizing the achievable throughput of wireless network coding in slotted ALOHA on two-hop unbalanced traffic cases. Furthermore, we show that the throughput is enhanced even if the traffic at the relay node is unbalanced.     

Performance evaluation of a joint CDMA/NC-PRMA protocol forwireless multimedia communications

A joint code division multiple access and noncollision packet reservation multiple access (CDMA/NC-PRMA) technique is proposed and investigated as an uplink protocol for the third-generation (3G) mobile systems. Being the underlying time division multiple access (TDMA) architecture of the CDMA transmissions, NC-PRMA enables the base station (BS) to have a centralized control over the slot allocation policy. In order to reduce the multiple access interference (MAI) variation in a CDMA transmission, two different slot assignment schemes, referred to as load-balancing (LB) and power-grouping (PG) schemes, are proposed and evaluated. Simulation results show that considerable improvement can be achieved over the joint CDMA/PRMA scheme, in which the MAI variation is reduced by way of a dynamic permission probability for contending terminals. Especially when an imperfect power control mechanism is considered, the proposed PG assignment scheme achieves significant performance advantages     

Joint resource allocation,routing and CAC for uplink OFDMA networks with cooperative relaying

In this paper, we propose a joint resource allocation, routing, and connection admission control (CAC) scheme for uplink transmission in orthogonal frequency division multiple access (OFDMA) relay networks with cooperative relaying. For cooperative relaying, relay station can relay uplink data from mobile station (MS) to base station with cooperation of the MS using transmit diversity. Transmit diversity can be achieved by virtual MISO via distributed space–time coding. The proposed scheme jointly allocates OFDMA resources and selects path for each user with CAC to maximize the upink throughput of cooperative OFDMA relay networks. The basic OFDMA resource unit is considered as a resource element which is one subcarrier over one OFDMA symbol. An efficient multi-choice multi-dimensional knapsack (MMKP) algorithm is presented for the proposed scheme. The proposed MMKP algorithm provides a unified framework which is applicable to OFDMA networks with and without cooperative relaying. We evaluate the performance of the proposed scheme with and without cooperative relaying in a hilly terrain with heavy tree density by using OPNET-based simulation. We show that the cooperative relaying improve the uplink system throughput compared with non-cooperative relaying, and the proposed scheme outperforms the conventional link quality-based scheme in both cooperative and non-cooperative relay networks.     

一种多跳无线网扩频码分配算法

在多跳分组无线网中使用码分多址(CDMA)技术可以明显地降低隐终端问题对网络造成的影响.码分配是多跳无线网中使用CDMA的基本问题.码分配的目的在于提高扩频码的空间重用、降低分组冲突以及反映网络的动态变化.本文提出了一种多跳无线网扩频码分配算法,证明了其正确性并与其它算法比较了复杂度.与以往的算法追求降低码的数目不同,本算法是假设扩频码的数目有一定的冗余,寻求算法的方便、快捷和低通信开销.     

Relay Placement for Coverage Extension in Cellular Wireless Networks Under Composite Fading Model

In relay-assisted cellular networks, mobile stations are connected to base station through two or more single-hop communication links, where the intermediate nodes act as relay stations (RSs). The focus of this paper is on two-hop relay assisted cellular networks, where optimal relay placement is a crucial issue for achieving maximum extension of the cell coverage. However, the location of RS has significant impact on signal-to-interference plus noise ratio (i.e., SINR) and outage probability experienced on the access and backhaul links. Moreover, the frequency re-use factor also has significant influence on the SINR. In this paper, we develop analytical models for computing the SINR and outage probability performance of a two-hop relay assisted cellular network for both downlink (DL) as well as uplink (UL) transmission scenarios, considering the impact of path loss, shadowing, Nakagami fading and co-channel interference. We then investigate optimal placement of RS while satisfying the required criterion on probability of correct decoding, initially by considering the DL scenario alone and then by considering both DL and UL scenarios jointly. Through extensive evaluations, we report the impact of realistic propagation models on outage probability, optimal relay position and the cell coverage radius. Further, the model can be used to find the impact of co-channel re-use factor on optimal relay positioning in two-hop cellular networks.     

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.     

Capacity Maximization for OFDM Two-Hop Relay System With Separate Power Constraints

The combination of a multihop relay system and orthogonal frequency-division multiplexing (OFDM) modulation is a promising way to increase the capacity and coverage area. For the OFDM two-hop relay system with separate power constraints, joint subcarrier matching and power allocation is considered in this paper, which uses the “decode-and-forward” relay strategy. The aforementioned problem can be formulated as a mixed binary integer programming problem, which is prohibitive when trying to find the global optimum. By separating the subcarrier matching and the power allocation, the optimal scheme, i.e., the optimal joint subcarrier matching and power allocation, is presented in this paper. After that, a suboptimal scheme with less complexity is also proposed, which can also be used to better understand the effects of power allocation. Simulation results show that the capacity of the optimal scheme is almost equivalent to the upper bound of the system capacity, and the capacity of the suboptimal scheme is close to that of the optimal scheme. In addition, simulation results also show that the one-to-one subcarrier matching is almost optimal, although it simplifies the system architecture.      

A Multichannel TDMA MAC Protocol to Reduce End‐to‐End Delay in Wireless Mesh Networks

Supporting QoS over multihop wireless mesh networks is difficult because end‐to‐end delay increases quickly with the increasing number of hops. This paper introduces a novel multichannel time‐division multiple‐access media access control (McTMAC) protocol that can help to efficiently reduce delay over multihop networks. Performance evaluation results demonstrate that McTMAC outperforms existing alternative protocols. The max‐delay can be reduced by as much as 60% by using McTMAC.     

Hierarchical micro-mobility management in high-speed multihop access networks

1 Introduction A wireless multihop network or Ad-hoc network [1, 2] is a network of independent mobile hosts without any network infrastructure or connection to base stations. In many application areas, however, Internet connectivity and access to service…