Abstract:Time reversal (TR) is a promising technique that exploits multipaths for achieving energy focusing in high-frequency wideband communications. In this letter, we focus on a TR scheme facilitated by a reconfigurable intelligent surface (RIS) which, due to the higher frequency and large array aperture, operates in the near-field region. The proposed scheme enriches the propagation environment for the TR in such weak scattering conditions and does not need channel knowledge for the RIS configuration. Specifically, the RIS is employed to create multiple virtual propagation paths that are required to efficiently apply the TR. We derive a performance bound for the proposed scheme under near-field modeling through the received signal-to-noise ratio (SNR) and we examine how various system design parameters affect the performance. We observe that a linear RIS topology maximizes the number of resolvable paths. It is also demonstrated that the proposed scheme improves the SNR, while for a large number of elements it can outperform the conventional passive beamforming at the RIS.
Abstract:In this paper, we investigate the performance of multiple-input multiple-output (MIMO) fading channels assisted by a reconfigurable intelligent surface (RIS), through the employment of partition-based RIS schemes. The proposed schemes are implemented without requiring any channel state information knowledge at the transmitter side; this characteristic makes them attractive for practical applications. In particular, the RIS elements are partitioned into sub-surfaces, which are periodically modified in an efficient way to assist the communication. Under this framework, we propose two low-complexity partition-based schemes, where each sub-surface is adjusted by following an amplitude-based or a phase-based approach. Specifically, the activate-reflect (AR) scheme activates each sub-surface consecutively, by changing the reflection amplitude of the corresponding elements. On the other hand, the flip-reflect (FR) scheme adjusts periodically the phase shift of the elements at each sub-surface. Through the sequential reconfiguration of each sub-surface, an equivalent parallel channel in the time domain is produced. We analyze the performance of each scheme in terms of outage probability and provide expressions for the achieved diversity-multiplexing tradeoff. Our results show that the asymptotic performance of the considered network under the partition-based schemes can be significantly enhanced in terms of diversity gain compared to the conventional case, where a single partition is considered. Moreover, the FR scheme always achieves the maximum multiplexing gain, while for the AR scheme this maximum gain can be achieved only under certain conditions with respect to the number of elements in each sub-surface.
Abstract:In this paper, a cooperative protocol is investigated for a multi-hop network consisting of relays with buffers of finite size, which may operate in different communication modes. The protocol is based on the myopic decode-and-forward strategy, where each node of the network cooperates with a limited number of neighboring nodes for the transmission of the signals. Each relay stores in its buffer the messages that were successfully decoded, in order to forward them through the appropriate channel links, based on its supported communication modes. A complete theoretical framework is investigated that models the evolution of the buffers and the transitions at the operations of each relay as a state Markov chain (MC). We analyze the performance of the proposed protocol in terms of outage probability and derive an expression for the achieved diversity-multiplexing tradeoff, by using the state transition matrix and the related steady state of the MC. Our results show that the proposed protocol outperforms the conventional multi-hop relaying scheme and the system's outage probability as well as the achieved diversity order depend on the degree of cooperation among neighboring nodes and the communication model that is considered for every relay of the network.