Time Division Broadcast Research Articles

Performance analysis of switch‐and‐stay combining in two‐way relay systems with analog network coding and time‐division broadcast protocols

AbstractIn this paper, we consider switch‐and‐stay combining (SSC) in two‐way relay systems with two amplify‐and‐forward relays, one of which is activated to assist the information exchange between the two sources. The system operates in either analog network coding (ANC) protocol where the communication is only achieved with the help of the active relay or time‐division broadcast (TDBC) protocol where the direct link between two sources can be utilized to exploit more diversity gain. In both cases, we study the outage probability and bit error rate (BER) for Rayleigh fading channels. In particular, we derive closed‐form lower bounds for the outage probability and the average BER, which remain tight for different fading conditions. We also present asymptotic analysis for both the outage probability and the average BER at high signal‐to‐noise ratio. It is shown that SSC can achieve the full diversity order in two‐way relay systems for both ANC and TDBC protocols with proper switching thresholds. Copyright © 2014 John Wiley & Sons, Ltd.

Performance analysis of bidirectional cloud networks with imperfect channel state information

SummaryWith the rapid growth of cloud computing services, there is an increasing need to expand applications across data centers. In these paradigms, common information exchange between two data centers can be assisted via one or more substrate nodes, which correspond to bidirectional relaying communication. In this paper, we investigate the performance of time division broadcast (TDBC) protocol in bidirectional cloud networks in the presence of channel estimation errors (CEEs). The tight asymptotic expressions for individual and system outage probabilities are first presented in closed‐form. It is shown that CEE causes outage probability to remain fixed even if the channel is noiseless. Then, the symbol error rate performance for TDBC protocol with M‐ary Phase Shift Keying and M‐ary quadrature amplitude modulation signals is analyzed. Simulation results validate the accuracy of our analytical results. Furthermore, comparison of signal‐to‐noise ratio gap ratio shows that TDBC protocol is less sensitive to the effect of CEE than analog network coding protocol. Copyright © 2014 John Wiley & Sons, Ltd.

Corrections to “Performance Analysis of Cognitive Spectrum Sharing With Time Division Broadcast Protocol” [Feb 14 305-308

We provide corrections of the published paper (ibid., vol. 18, no. 2, pp. 305-308, Feb. 2014). The corrections are mainly in few expressions, which were presented with mistakes in the referenced paper. These corrections therefore do not affect the results and the insights presented in that paper.

차량 간 통신에서 주기적 메시지를 위한 속도 기반의 자가 구성형 시분할 브로드캐스팅 방법

차량 간 통신을 이용한 안전 서비스 제공을 위해서 차량 간에 서로의 위치정보 획득이 중요한 이슈가 되고 있다. 이를 위해서 주기적으로 메시지를 발생 시키고 주변 차량의 위치 변화를 감지하여 운전자에게 안전 서비스를 제공한다. 하지만 차량의 밀도가 높은 환경에서 주기적인 위치정보 메시지의 잦은 발생으로 인해 네트워크 채널이 포화 상태가 되어 송/수신에 문제가 발생한다. 본 논문은 시분할 슬롯을 이용하여 브로드캐스팅하며 차량의 속도를 이용하여 도로 위 차량 밀도를 예측하여 시분할 슬롯의 수, 전파세기를 조절하여 향상된 통신 상태를 만드는 방법을 제안한다. 네트워크 시뮬레이터를 통한 성능 평가 결과, 기존의 경쟁 모드에서 브로드캐스팅 했을 때 보다 수신율은 약 40%의 향상 보여주었고 채널 접근 시간은 10ms에서 0.23ms 로 감소한 것을 확인 할 수 있었다. For vehicle safety-related services using wireless communications, reliable collection of various driving informations transmitted periodically by neighbor vehicles is the most important. Every host vehicle analyses them to estimate a potential dangerous situation in a very short time and warns drivers to prevent an accident. However tremendous amount of periodic messages can cause the wireless communication in chaos and the services not in safe. In this paper, we propose a time-division broadcasting protocol to mitigate the communication congestion. It utilizes the received information of vehicle velocity and location, i.e. vehicle traffic density on a road to adjust the number of time slots in a given broadcasting period, and transmission power. The simulation results show that message reception ratio is changed to approximately 40% and channel access time also decreased from 10ms to 0.23ms.

Performance Analysis of Cognitive Spectrum Sharing with Time Division Broadcast Protocol

We investigate the performance of a cognitive spectrum sharing system where a best selected secondary user (SU) assists two-way communication between two primary users (PUs) by employing time division broadcast over Rayleigh channels. We derive tight lower-bound expressions for the overall outage probability (OOP) of both the primary and secondary systems of the considered scheme. We also provide valuable insights into the achievable diversity order, cell coverage, and optimal power allocation factor to ensure spectrum sharing. Numerical and simulation results corroborate the theoretical analysis and illustrate the effectiveness of the considered scheme.

Two-Way Relaying Cooperative Wireless Networks: Resource Allocation and Performance Analysis

Abstract Relay-based cooperative wireless networks have been widely considered one of the cost-effective solutions to meet the demands in future wireless networks. In order to maximize the overall sum-rate while maintaining proportional fairness among users, we investigate different resource allocation algorithms in two-way relay networks with analog network coding (ANC) protocol and time division broadcast (TDBC) protocol. The algorithms investigated are different from traditional proportional fairness schemes in terms of fairness and computational complexity as we have applied Access Proportional Fairness (APF) and Minimum Rate Proportional Fairness (MRPF) along with load balancing at the relays. A MATLAB simulation has been performed and simulation results show the effectiveness of these algorithms.

A channel estimation based opportunistic scheduling scheme in wireless bidirectional networks

Generally speaking, there are two assumptions in the previous bidirectional networks. The first one is assuming that no direct transmission paths exist between the source and destination nodes due to high shadow fading or large separation. The second one is assuming that either channel parameters are pre-established or perfect global channel state information (CSI) can be obtained by the relay nodes. In this paper, we get rid of these limitations and estimate channel gains for both analog network coding (ANC) and time division broadcasting (TDBC) schemes based on outage probability. As the channel gain of each link varies from time to time in wireless networks, we first estimate the channel gain according to outage probability, then propose an opportunistic scheduling scheme to optimize the sum rate values by maximizing the minimum link transmission rate. Simulation results are presented to demonstrate the effectiveness of our channel estimation scheme, and the performance of our proposed opportunistic scheduling scheme is compared with the round robin scheduling (RRS) scheme for both ANC and TDBC schemes.

Outage Probability of TDBC Protocol in Multiuser Two-Way Relay Systems with Nakagami-m Fading

This paper considers a multiuser two-way relay system with time division broadcast (TDBC) protocol, where multiple end-sources compete to exchange information with another end-source through the help of a single half-duplex amplify-and-forward (AF) relay. We derive a tight closed-form lower bound for the system outage probability over Nakagami-m fading channels with integer fading parameters. An asymptotic expression for the outage probability in high signal-to-noise ratio (SNR) regime is also obtained. Numerical results corroborate the theoretical analysis.

An Opportunistic Protocol Employing Independent Codebooks for Bidirectional Cooperative Networks

We propose an opportunistic source selection (OSS) protocol employing independent (channel) codebooks (OSS-IC), which outperforms any existing bidirectional-coded decode-and-forward (DF) protocols at high signal-to-noise ratios (SNRs). We derive the expressions of the mutual information, exact outage probability, and asymptotic outage probability for the OSS-IC protocol. We also derive a closed-form and tight approximation for the outage probability. Then, we show that the ideal relay location is the midpoint between two end-sources. Furthermore, we analytically prove that the OSS-IC protocol provides the best outage performance at high SNRs, compared with any known bidirectional-coded DF protocols, including time-division broadcast (TDBC) and physical-layer network coding (PNC). Finally, we quantify the gains of OSS-IC over those protocols at high SNRs.

Sum-Rate Optimization in a Two-Way Relay Network with Buffering

A Relay Station (RS) uses a buffer to store and process the received data packets before forwarding them. Recently, the buffer has been exploited in one-way relaying to opportunistically schedule the two different links according to their channel quality. The intuition is that, if the channel to the destination is poor, then RS stores more data from the source, in order to use it when the channel to the destination is good. We apply this intuition to the case of half-duplex two-way relaying, where the interactions among the buffers and links become more complex. We investigate the sum-rate maximization problem in the Time Division Broadcast (TDBC): the users send signals to the RS in different time slots, the RS decodes and stores messages in the buffers. For downlink transmission, the RS re-encodes and sends using the optimal broadcast strategy. The operation in each time slot is not determined in advance, but depends on the channel state information (CSI). We derive the decision function for adaptive link selection with respect to CSI using the Karush-Kuhn-Tucker (KKT) conditions. The thresholds of the decision function are obtained under Rayleigh fading channel conditions. The numerical results show that the sum-rate of the adaptive link selection protocol with buffering is significantly larger compared to the reference protocol with fixed transmission schedule.

Decode‐and‐forward two‐way relaying protocol with one retransmission

SUMMARYThis paper investigates the decode‐and‐forward two‐way relaying channel without direct link and proposes a protocol based on the physical‐layer network coding (PNC) protocol. The proposed protocol (termed ORT) introduces one retransmission into PNC, aiming at enhancing its outage performance. To manifest the merits of ORT, we compare it with PNC and the time‐division broadcast (TDBC) protocol, in terms of outage performance, expected rate, and diversity‐multiplexing tradeoff (DMT). Firstly, we derive the outage probability of the three protocols and then the expected rate. Secondly, asymptotic analysis is conducted to shed light on the diversity and coding gains. Finally, the DMT is obtained for the three protocols. The numerical results reveal the following: (i) that ORT performs better than PNC in both outage and expected rate performance when the nodes transmit with different powers. However, it has the same DMT performance with PNC; (ii) that ORT possesses improved DMT performance over TDBC whereas its expected rate is only better than the latter at medium to high signal‐to‐noise ratio. Copyright © 2012 John Wiley & Sons, Ltd.

Performance Tradeoffs in Amplify-and-Forward Bidirectional Network Beamforming

We study and compare the performance of two bidirectional network beamforming schemes, namely the multiple access broadcast channel (MABC) strategy and the time division broadcast channel (TDBC) protocol, using joint optimal power control and beamforming design. To do so, we first design two TDBC-based bidirectional network beamformers, through minimization of the total power consumed in the whole network subject to quality of service (QoS) constraints, for the two cases with and without a direct link between the two transceivers. The corresponding power minimization problems are carried out over the transceiver transmit powers as well as relay beamforming weights, thus resulting in a jointly optimal power allocation and beamforming criterion. We devise optimal second-order cone programming based solutions as well as fast gradient-based solutions to these problems. We then use these solutions to compare the performance of the underlying TDBC-based approach to that of the MABC-based technique. This comparison is important because the TDBC approach appears to have certain advantages which can be exploited towards improving the performance of two-way network beamforming. These advantages include the additional degrees of freedom as well as the possibility of benefitting from the availability of a direct link between the two transceivers. Interestingly, in the absence of a direct link between the two transceivers, we show that when the QoS constraints are imposed to meet certain given probabilities of uncoded error [or, equivalently, to meet certain signal-to-noise ratio (SNR) constraints], these two schemes perform closely in terms of the minimum total transmit power. However, when the QoS constraints are used to guarantee certain given rates, the MABC-based scheme outperforms the TDBC counterpart. In the case when a direct link exists between the two transceivers, the TDBC-based approach can outperform the MABC-based method, even for rate satisfying QoS constraints, provided that the direct link is strong enough.

Performance analysis of time division broadcast protocol with incremental relaying and symmetric users

SUMMARYThis paper investigates two‐way relaying with direct link transmission. We propose to combine incremental relaying (IR) with the time division broadcast protocol (TDBC) to form a new scheme, termed TDBC‐IR, to increase the spectral efficiency of TDBC. Assuming half‐duplex decode‐and‐forward relaying, the performance of three protocols, that is, TDBC, TDBC‐IR, and physical‐layer network coding (PNC), are studied and compared, in terms of outage probability, expected rate (ER), and diversity‐multiplexing tradeoff. First, we reveal that the outage probability performance of TDBC‐IR is the same as that of TDBC and better than that of PNC. Second, we compare the ER and diversity‐multiplexing tradeoff performance of the three protocols based on the derived outage probability. The numerical results reveal that (1) the ER of TDBC‐IR is greater than that of TDBC and PNC in the whole signal‐to‐noise ratio (SNR) region, that is TDBC‐IR has improved spectral efficiency performance; (2) the ER performance of TDBC is better than PNC in the low SNR region but worse in the high SNR region; (3) the maximum achievable diversity order of TDBC‐IR and TDBC are both two whereas that of PNC is one; (4) the maximum achievable multiplexing gain of TDBC‐IR is one, which is better than TDBC (its maximum achievable is 2/3) and achieves the maximum of PNC (its maximum achievable is one). Copyright © 2012 John Wiley & Sons, Ltd.

Two Birds with One Stone: Exploiting Direct Links for Multiuser Two-Way Relaying Systems

This Letter proposes a mechanism to combine multiuser diversity (MUD) and incremental relaying in a multiuser two-way relaying system, where one end-source exchanges messages with one out of N available end-sources by using a half-duplex amplify-and-forward (AF) relay. Outage analysis for the proposed scheme is carried out and, compared with the time division broadcast (TDBC) protocol, reveals that it not only realizes full diversity order (N+1) but also achieves improved expected spectral efficiency. Also, it is indicated that the expected spectral efficiency of the proposed scheme approaches that of the analog network coding (ANC) protocol in high signal-to-noise ratio (SNR) regime. Furthermore, the finite-SNR diversity-multiplexing tradeoff (DMT) is examined, from which the superiority of the proposed scheme to TDBC is confirmed as well. Other insightful comparisons in terms of the outage performance are presented that show the practical usefulness of our multiuser two-way relaying framework.

Performance Analysis of Two-User Cooperative Multiple Access Systems With DF Relaying and Superposition Modulation

In this paper, a two-user cooperative multiple access (CMA) system is considered. Using the superposition modulation scheme, we propose a low-complexity suboptimal detector at the destination to achieve the performance close to that of the optimal maximum-likelihood sequence detector (MLSD). For independent and non-identically distributed (i.n.d.) Rayleigh-faded channels, we derive error decision regions and present the exact bit-error rate (BER) expression in an integral form, which is validated by simulation results. We also approximate the decision regions and obtain the BER bound in closed form. Another efficient transmission scheme, i.e., the time-division broadcast (TDBC) protocol operating in three time slots, is also considered and analyzed. BER results show that the superposition modulation outperforms the others and can achieve both full diversity order and high coding gain.

Broadcasting info-pages to sensors: efficiency versus energy conservation

In sensor networks applied to monitoring applications, individual sensors may perform preassigned or on-demand tasks, or missions. Data updates (info-pages) may be sent to sensors from a command center, via a time-division broadcast channel. Sensors are normally put in sleep mode when not actively listening, in order to conserve energy in their batteries. Hence, a schedule is required that specifies when sensors should listen for updates and when they should sleep. The performance of such a schedule is evaluated based on data-related costs and sensor-related costs. Data-related costs reflect the obsoleteness of current sensor data, or the delay while sensors wait for updated instructions. Sensor-related costs reflect the energy that sensors consume while accessing the broadcast channel and while switching between the active and sleeping modes (rebooting). Our goal is a schedule with the minimum total cost. Previous related work has explored data-related costs, but listening cost has been addressed only under the assumption that the rebooting operation is free. This paper formulates a new cost model, which recognizes the cost of sensor rebooting. We derive an optimal schedule for the single-sensor setting. We proceed to consider schedules of multiple sensors; we formulate a mathematical program to find an optimal fractional schedule for this setting and provide a solution to the lower bound. Several heuristics for scheduling multiple sensors are introduced and analyzed, and various tradeoffs among the cost factors are demonstrated.

Outage Probability and Optimum Combining for Time Division Broadcast Protocol

Time division broadcasting (TDBC) is a well-known bidirectional protocol. In this protocol, two sources exchange information with the help of a relay terminal. For amplify-and-forward (AF)-based TDBC, we first derive a tight lower bound of the outage probability in closed-form, and it is very close to the exact outage probability in the whole signal-to-noise ratio (SNR) range irrespective of the values of channel variances. Using the tight lower bound, diversity-multiplexing tradeoff of the TDBC protocol is obtained for finite-SNR. Furthermore, we investigate how to optimize the TDBC protocol; specifically, an optimum method to combine the received signals at the relay terminal is developed. This method minimizes the outage probability and maximizes the total mutual information of the TDBC protocol at the same time.

Relay Selection with ANC and TDBC Protocols in Bidirectional Relay Networks

We study relay selection (RS) with the analog network coding (ANC) and time division broadcast (TDBC), which are two major amplify-and-forward (AF)-based protocols in bidirectional relay networks. We consider a bidirectional network consisting of two different end-sources and multiple relays, where each terminal has a single antenna and operates in a half-duplex mode. In this network, a single best relay is selected depending on channel conditions to help bidirectional communication between the two end-sources. Specifically, we first consider RS schemes for the ANC and TDBC protocols based on a max-min criterion to minimize the outage probabilities. Then, for the RS in the ANC protocol, we derive a closed-form expression of the outage probability; for the RS in the TDBC protocol, we derive a one-integral form of the outage probability and its lower bound in closed-form. Numerical results confirm that the closed-form expression of the ANC protocol and the one-integral form of the TDBC protocol are very accurate, and that the closed-form lower bound of the TDBC protocol is also tight.

Performance Analysis of Bidirectional Communication Protocols Based on Decode-and-Forward Relaying

We study and compare the performance of three very typical bidirectional communication protocols based on the decode-and-forward relaying: time-division broadcast (TDBC), physical-layer network coding (PNC), and opportunistic source selection (OSS). We first derive the exact closed-form outage probabilities for the PNC and OSS protocols and an exact but one-integral form outage probability for the TDBC protocol. To gain more insight, we also derive closed-form asymptotic outage probability expressions for all protocols, with which we obtain further analytical results on the asymptotic optimal power allocation, the asymptotic optimal relay location, and the performance gain of the OSS protocol over the TDBC protocol in the high signal-to-noise ratio (SNR) regime. Finally, we study the diversity-multiplexing tradeoff (DMT) for each protocol both in the finite and infinite SNR regimes.