Faster Information Propagation on Highways: a Virtual MIMO Approach

In vehicular communications, traffic-related information should be spread over the network as quickly as possible to maintain a safe and reliable transportation system. This motivates us to develop more efficient information propagation schemes. In this paper, we propose a novel cluster-based cooperative information forwarding scheme, in which the vehicles opportunistically form virtual antenna arrays to boost one-hop transmission range and therefore accelerate information propagation along the highway. Both closed-form results of the transmission range gain and the improved Information Propagation Speed (IPS) are derived and verified by simulations. It is observed that the proposed scheme demonstrates the most significant IPS gain in moderate traffic scenarios, whereas too dense or too sparse vehicle density results in less gain. Moreover, it is also shown that increased mobility offers more contact opportunities and thus facilitates information propagation.Comment: IEEE 2014 Global Telecommunications Conference (GLOBECOM 2014) - Communication Theory Symposiu

Selective Combining for Hybrid Cooperative Networks

In this study, we consider the selective combining in hybrid cooperative networks (SCHCNs scheme) with one source node, one destination node and $N$ relay nodes. In the SCHCN scheme, each relay first adaptively chooses between amplify-and-forward protocol and decode-and-forward protocol on a per frame basis by examining the error-detecting code result, and $N_c$ ($1\leq N_c \leq N$) relays will be selected to forward their received signals to the destination. We first develop a signal-to-noise ratio (SNR) threshold-based frame error rate (FER) approximation model. Then, the theoretical FER expressions for the SCHCN scheme are derived by utilizing the proposed SNR threshold-based FER approximation model. The analytical FER expressions are validated through simulation results.Comment: 27 pages, 8 figures, IET Communications, 201

Cooperative medium access control based on spectrum leasing

Based on cooperative spectrum leasing, a distributed “win–win” (WW) cooperative framework is designed to encourage the licensed source node (SN) to lease some part of its spectral resources to the unlicensed relay node (RN) for the sake of simultaneously improving the SN’s achievable rate and for reducing the energy consumption (EC). The potential candidate RNs carry out autonomous decisions concerning whether to contend for a cooperative transmission opportunity, which could dissipate some of their battery power, while conveying their traffic in light of their individual service requirements. Furthermore, a WW cooperative medium-access-control (MAC) protocol is designed to implement the proposed distributed WW cooperative framework. Simulation results demonstrate that our WW cooperative MAC protocol is capable of providing both substantial rate improvements and considerable energy savings for the cooperative spectrum leasing system

Exploiting Diversity in Broadband Wireless Relay Networks

Fading is one of the most fundamental impairments to wireless communications. The standard approach to combating fading is by adding redundancy - or diversity - to help increase coverage and transmission speed. Motivated by the results in multiple-input multiple-output technologies, which are usually used at base stations or access points, cooperation commutation has been proposed to improve the performance of wireless networks which consist of low-cost single antenna devices. While the majority of the research in cooperative communication focuses on flat fading for its simplicity and easy analysis, in practice the underlying channels in broadband wireless communication systems such as cellular systems (UMTS/LTE) are more likely to exhibit frequency selective fading. In this dissertation, we consider a frequency selective fading channel model and explore distributed diversity techniques in broadband wireless relay networks, with consideration to practical issues such as channel estimation and complexity-performance tradeoffs. We first study a system model with one source, one destination and multiple decode-and-forward (DF) relays which share a single channel orthogonal to the source. We derive the diversity-multiplexing tradeoff (DMT) for several relaying strategies: best relay selection, random relay selection, and the case when all decoding relays participate. The best relay selection method selects the relay in the decoding set with the largest sum-squared relay-to-destination channel coefficients. This scheme can achieve the optimal DMT of the system at the expense of higher complexity, compared to the other two relaying strategies which do not always exploit the spatial diversity offered by the relays. Different from flat fading, we find special cases when the three relaying strategies have the same DMT. We further present a transceiver design and prove it can achieve the optimal DMT asymptotically. Monte Carlo simulations are presented to corroborate the theoretical analysis. We provide a detailed performance comparison of the three relaying strategies in channels encountered in practice. The work has been extended to systems with multiple amplify-and-forward relays. We propose two relay selection schemes with maximum likelihood sequential estimator and linear zero- forcing equalization at the destination respectively and both schemes can asymptotically achieve the optimal DMT. We next extend the results in the two-hop network, as previously studied, to multi-hop networks. In particular, we consider the routing problem in clustered multi-hop DF relay networks since clustered multi-hop wireless networks have attracted significant attention for their robustness to fading, hierarchical structure, and ability to exploit the broadcast nature of the wireless channel. We propose an opportunistic routing (or relay selection) algorithm for such networks. In contrast to the majority of existing approaches to routing in clustered networks, our algorithm only requires channel state information in the final hop, which is shown to be essential for reaping the diversity offered by the channel. In addition to exploiting the available diversity, our simple cross-layer algorithm has the flexibility to satisfy an additional routing objective such as maximization of network lifetime. We demonstrate through analysis and simulation that our proposed routing algorithm attains full diversity under certain conditions on the cluster sizes, and its diversity is equal to the diversity of more complicated approaches that require full channel state information. The final part of this dissertation considers channel estimation in relay networks. Channel state information is vital for exploiting diversity in cooperative networks. The existing literature on cooperative channel estimation assumes that block lengths are long and that channel estimation takes place within a fading block. However, if the forwarding delay needs to be reduced, short block lengths are preferred, and adaptive estimation through multiple blocks is required. In particular, we consider estimating the relay-to-destination channel in DF relay systems for which the presence of forwarded information is probabilistic since it is unknown whether the relay participates in the forwarding phase. A detector is used so that the update of the least mean square channel estimate is made only when the detector decides the presence of training data. We use the generalized likelihood ratio test and focus on the detector threshold for deciding whether the training sequence is present. We also propose a heuristic objective function which leads to a proper threshold to improve the convergence speed and reduce the estimation error. Extensive numerical results show the superior performance of using this threshold as opposed to fixed thresholds

Smart Relay Selection Scheme Based on Fuzzy Logic with Optimal Power Allocation and Adaptive Data Rate Assignment

In this paper fuzzy logic-based algorithm with improved process of relay selection is presented which not only allocate optimal power for transmission but also help in choosing adaptive data rate. This algorithm utilizes channel gain, cooperative gain and signal to noise ratio with two cases considered in this paper: In case-I nodes do not have their geographical location information while in case-II nodes are having their geographical location information. From Monte Carlo simulations, it can be observed that both cases improve the selection process along with data rate assignment and power allocation, but case-II is the most reliable with almost zero probability of error at the cost of computational complexity which is 10 times more than case-I

Cooperative Relaying In Power Line Environment: A Survey and Tutorial

Exchange of information is essential in any society and the demand for faster, cheaper, and secure communications is increasing every day. With other hi-tech initiatives like IPv6 and Internet-of-Things (IOT) already in the horizon, demand for broadband is set to escalate beyond its current level. Inherently laden in the challenges posed by this technology are fresh opportunities in terms of penetration of data services into rural communities and development of innovative strategies for more efficient use of the grid. Though still in its developmental phase/stage, Power Line Communication (PLC) has grown beyond theoretical fantasy to become a reality. The proofs are the readily available PLC systems that can be purchased off the shelfto achieve in-house networking and the much talked about, smart metering technology; generally regarded as the “new bride” in utilities industry. One of the biggest gains of PLC is its use of existing electrical cables, thereby eliminating cost of installation and maintenance of data cables. However, given that the power infrastructure was traditionally built to deliver electricity, data signals do suffer various forms of distortions and impairments as they transit it. This paper presents a tutorial on the deployed wireless system technique which is to be adapted to PLC scenario for the purpose of managing the available source energy for achieving reliable communication system. One of these techniques is the cooperative diversity. Its application and deployment in power line environment is explored. The improvement achieved through cooperative diversity in some PLC systems were presented along with the associated limitations. Finally, future areas of research which will further improve the reliability of PLC systems and reduce its power consumption during transmission is shown

POWER ALLOCATION ALGORITHM FOR MIMO BASED MULTI-HOP COOPERATIVE SENSOR NETWORK

Cooperative transmission is a new breed of wireless communication systems that enables the cooperating node in a wireless sensor network to share their radio resources by employing a distributed transmission and processing operation. This new technique offers substantial spatial diversity gains as the cooperating nodes help one another to send data over several independent paths to the destination node. In recent times, an extensive effort has been made to incorporate these systems in the future wireless networks like LTE (Long Term Evolution), IEEE 802.16j (Mobile Multi-hop Relay (MMR) Networks) and IEEE 802.16m (Mobile WiMAX Release 2 or WirelessMAN-Advanced). But, there are few technical issues which need to be addressed before this promising technique is integrated into future wireless networks. Among them, managing transmission power is a critical issue, which needs to be resolved to fully exploit the benefits of cooperative relaying. Optimal Power Allocation, is one such technique that optimally distributes the total transmission power between the source and relaying nodes thus saving a lot of power while maintaining the link quality. In the first part of the thesis, mathematical expressions of the received signals have been derived for different phases of cooperative transmission. Average-Bit-error-rate (ABER), has been taken as a performance metric to show the efficiency of cooperative relaying protocols. In the second part of this Chapter, a multi-hop framework has been presented for the power allocation algorithm with Amplify-and-Forward relaying protocol. The efficiency of the power allocation algorithm has been discussed with different scenarios i.e. First for a three node (2-Hop) wireless network configuration and then for a four node (3-Hop) wireless network configuration. The transmission scenarios (2-Hop and 3-Hop) have been further categorized into multiple cases on the basis of channel quality between source-to-destination, source-to-relay, relay-to-relay and relay-to-destination links.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format