Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Priority aware grouping-based multihop routing scheme for RIS-assisted wireless networks

Lakshmikanta Sau, Priyadarshi Mukherjee, Sasthi C. Ghosh

TL;DR

This work tackles delay-constrained D2D mmWave communication aided by RISs by introducing a priority-aware, grouping-based multihop routing framework that exploits spatial correlation and idle intermediate users as relays. The method replaces the classic LRD rule with a rate- and delay-aware selection process that includes grouping of RIS elements, discrete phase shifts, adaptive modulation, and a beta-based scheduling metric to determine next hops. Theoretical rate expressions, group-selection criteria, and delay bounds are provided, along with comprehensive numerical results showing improvements in data throughput, energy consumption, and energy efficiency over benchmarking schemes. The findings highlight the practical viability of jointly leveraging RIS groupings and active IUs to achieve reliable, energy-efficient, and low-latency communications in RIS-assisted networks.

Abstract

Reconfigurable intelligent surfaces (RISs) is a novel communication technology that has been recently presented as a potential candidate for beyond fifth-generation wireless communication networks. In this paper, we propose a priority-aware user traffic-dependent grouping-based multihop routing scheme for a RIS-assisted millimeter wave (mmWave) device-to-device (D2D) communication network with spatially correlated channels. Specifically, the proposed scheme exploits the priority of the users (based on their respective delay-constrained applications) and the aspect of spatial correlation in the narrowly spaced reflecting elements of the RISs. Here, based on the other users in the neighborhood, their respective traffic characteristics, and the already deployed RISs in the surroundings, we establish a multihop connection for information transfer from one of the users to its intended receiver. In this context, we take into account the impact of considering practical discrete phase shifts at the RIS patches instead of its ideal continuous counterpart. Moreover, we also claim and demonstrate that the existing classic least remaining distance (LRD)-based approach is not always the optimal solution. Finally, numerical results demonstrate the advantages of the proposed strategy and that it significantly outperforms the existing benchmark schemes in terms of system performance metrics such as data throughput, energy consumption, as well as energy efficiency.

Priority aware grouping-based multihop routing scheme for RIS-assisted wireless networks

TL;DR

This work tackles delay-constrained D2D mmWave communication aided by RISs by introducing a priority-aware, grouping-based multihop routing framework that exploits spatial correlation and idle intermediate users as relays. The method replaces the classic LRD rule with a rate- and delay-aware selection process that includes grouping of RIS elements, discrete phase shifts, adaptive modulation, and a beta-based scheduling metric to determine next hops. Theoretical rate expressions, group-selection criteria, and delay bounds are provided, along with comprehensive numerical results showing improvements in data throughput, energy consumption, and energy efficiency over benchmarking schemes. The findings highlight the practical viability of jointly leveraging RIS groupings and active IUs to achieve reliable, energy-efficient, and low-latency communications in RIS-assisted networks.

Abstract

Reconfigurable intelligent surfaces (RISs) is a novel communication technology that has been recently presented as a potential candidate for beyond fifth-generation wireless communication networks. In this paper, we propose a priority-aware user traffic-dependent grouping-based multihop routing scheme for a RIS-assisted millimeter wave (mmWave) device-to-device (D2D) communication network with spatially correlated channels. Specifically, the proposed scheme exploits the priority of the users (based on their respective delay-constrained applications) and the aspect of spatial correlation in the narrowly spaced reflecting elements of the RISs. Here, based on the other users in the neighborhood, their respective traffic characteristics, and the already deployed RISs in the surroundings, we establish a multihop connection for information transfer from one of the users to its intended receiver. In this context, we take into account the impact of considering practical discrete phase shifts at the RIS patches instead of its ideal continuous counterpart. Moreover, we also claim and demonstrate that the existing classic least remaining distance (LRD)-based approach is not always the optimal solution. Finally, numerical results demonstrate the advantages of the proposed strategy and that it significantly outperforms the existing benchmark schemes in terms of system performance metrics such as data throughput, energy consumption, as well as energy efficiency.
Paper Structure (25 sections, 42 equations, 8 figures, 2 tables)

This paper contains 25 sections, 42 equations, 8 figures, 2 tables.

Table of Contents

  1. Introduction
  2. System Model
  3. Network Topology
  4. Channel Model
  5. User Traffic Characterization
  6. Proposed strategy
  7. Achievable Rate Characterization of Grouping-based RIS
  8. Group Selection Criteria at an RIS
  9. Scheduling Strategy at the IU
  10. When $c=0$
  11. When $c=1$
  12. Adaptive Modulation at the Intermediate Users
  13. Next Hop Selection Criteria
  14. Illustrative Example for Proposed Strategy
  15. Analysis of the Proposed Scheduling Strategy
  16. ...and 10 more sections

Figures (8)

  • Figure 1: System Model
  • Figure 2: Flowchart of the proposed strategy.
  • Figure 3: Impact of (a) Number of groups, (b) Patch spacing, and (c) Number of patches in a group on achievable data rate.
  • Figure 4: Trajectories for both the proposed framework and LRD-based approach; $\Box$ denotes RIS and $\Delta$ denotes IU.
  • Figure 5: Performance trade-off investigation.
  • ...and 3 more figures

Theorems & Definitions (4)

  • Remark 1
  • Remark 2
  • Remark 3
  • Remark 4