Search

Interference is a serious problem in wireless communications. In a wireless network, the signal sent by a terminal will be received by all its neighboring nodes. If a neighbor (except the destinations) is receiving data from some other terminals at the same time, the signals will collide, and the useful signal will be destroyed, which may result in transmission failure. Previous solutions to this problem focused on the avoidance of signal collisions through careful medium access control (MAC) and/or scheduling. However, this needs some sophisticated protocols and may waste system resources such as bandwidth. In this paper, we shall put forward some practical schemes to recover the useful signal from the collided signals for different types of wireless channels; thus, the throughput and network efficiency can greatly be increased. The proposed schemes are based on the network coding technique and performed on the physical layer. One feature of our schemes is that neither strict synchronization nor power control is needed among the different terminals; thus, it is very fit for distributed networks. Simulation results will show that the bit error rate (BER) of the recovered signal by our developed schemes is almost the same as that of the signal with no collision, which proves their efficiency in eliminating the interference. Index Terms--Block fading, network coding, scheduling, time variant, wireless network.

In this paper, the performance of using a square array of four antennas for selection combining (SC) and maximal-ratio combining (MRC) of Nakagami correlated signals is investigated. The closed form of average output signal-to-noise ratio and bit error rate (BER) for SC with arbitrary four correlated branches is derived; the expression of BER with MRC is also derived by utilizing the characteristic function method. Two models for the angle of arrival (AOA), i.e., uniform and truncated Gaussian, are considered in the system performance evaluation. The effects of correlation coefficients and fading factor on the system performance are investigated through numerical examples, which show that the uniformly distributed AOA system outperforms the truncated Gaussian-distributed counterpart with small angular spread. The degradation of system performance in the presence of one-antenna failure is also investigated. Index Terms--AOA, correlated Nakagami fading channel, diversity gain, one-antenna failure, square arranged antenna array.

Platooning is a critical technology to realize autonomous driving. Each vehicle in platoons adopts the IEEE 802.11p standard to exchange information through communications to maintain the string stability of platoons. However, one vehicle in platoons inevitably suffers from a disturbance resulting from the leader vehicle acceleration/deceleration, wind gust and uncertainties in a platoon control system, i.e., aerodynamics drag and rolling resistance moment etc. Disturbances acting on one vehicle may inevitably affect the following vehicles and cause that the spacing error is propagated or even amplified downstream along the platoon, i.e., platoon string instability. In this case, the connectivity among vehicles is dynamic, resulting in the performance of 802.11p in terms of packet delay and packet delivery ratio being time-varying. The effect of the string instability would be further deteriorated once the time-varying performance of 802.11p cannot satisfy the basic communication requirement. Unlike the existing works which only analyze the steady performance of 802.11p in vehicular networks, we will focus on the impact of disturbance and construct models to analyze the time-dependent performance of 802.11p-based platooning communications. The effectiveness of the models is validated through simulation results. Moreover, the time-dependent performance of 802.11p is analyzed through numerical results and it is validated that 802.11p is able to satisfy the communication requirement under disturbance. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a three-node two-way relaying network over fading channels. The stability of this system is first discussed. Three protocols are then investigated in this work in terms of throughput, including the opportunistic digital network coding (ODNC) scheduling protocol, the physical network coding (PNC) protocol, and the cooperation protocol of DNC with direct link (CDNC-DL). For the first two protocols, we assume that the direct link is not available. For the third protocol, the direct link is available and can support data rates. The problems of maximizing the long-term totally fair optimal throughput with the three protocols, with respect to the stability constraints, are formulated and solved by allocating power resources with respect to channel fluctuations. To complement this work, optimal time resource allocation for each phase of the three protocols as well as the associated end-to-end throughput are investigated. In the end, it is shown in simulation that ODNC performs better than the conventional DNC and that CDNC-DL outperforms the other two proposed protocols as long as the direct link is in relatively good condition. [ABSTRACT FROM PUBLISHER]

In this paper, we analyze the outage probability of space–time network coding (STNC) in a distributed cooperative relaying system, where multiple sources transmit their information to a common destination with the help of multiple decode-and-forward (DF) relays in timedivision multiple-access (TDMA) mode. We first derive an exact closed-form expression of the outage probability for STNC with an arbitrary number of relays for independent but not necessarily identically distributed (i.n.i.d.) Rayleigh fading channels. With the developed result, we discuss the impact of the transmit SNR, the outage threshold, the number of relays, the nonorthogonal codes, and the relay position on the system performance. [ABSTRACT FROM PUBLISHER]