The Industrial Internet of Things (IIoT) enables industries to build large interconnected systems utilizing various technologies that require high data rates. Terahertz (THz) communication is envisioned as a candidate technology for achieving data rates of several terabits-per-second (Tbps). Despite this, establishing a reliable communication link at THz frequencies remains a challenge due to high pathloss and molecular absorption. To overcome these limitations, this paper proposes using intelligent reconfigurable surfaces (IRSs) with THz communications to enable future smart factories for the IIoT. In this paper, we formulate the power allocation and joint IIoT device and IRS association (JIIA) problem, which is a mixed-integer nonlinear programming (MINLP) problem. Furthermore, the JIIA problem aims to maximize the sum rate with imperfect channel state information (CSI). To address this non-deterministic polynomial-time hard (NP-hard) problem, we decompose the problem into multiple sub-problems, which we solve iteratively. Specifically, we propose a Gale-Shapley algorithm-based JIIA solution to obtain stable matching between uplink and downlink IRSs. We validate the proposed solution by comparing the Gale-Shapley-based JIIA algorithm with exhaustive search (ES), greedy search (GS), and random association (RA) with imperfect CSI. The complexity analysis shows that our algorithm is more efficient than the ES.

Terahertz (THz) communication is envisioned as one of the candidate technologies for future wireless communications to enable achievable data rates of up to several terabits per second (Tbps). However, the high pathloss and molecular absorption in THz band communications often limit the transmission range. To overcome these limitations, this paper proposes intelligent reconfigurable surface (IRS)-aided THz networks with imperfect channel state information (CSI). Specifically, we present an angle-based trigonometric channel model to facilitate the performance evaluation of IRS-aided THz networks. In addition, to maximize the sum rate, we formulate the transmitter (Tx)-IRS-receiver (Rx) matching problem, which is a mixed-integer nonlinear programming (MINLP) problem. To address this non-deterministic polynomial-time hard (NP-hard) problem, we propose a Gale-Shapley algorithm-based solutions to obtain stable matching between transmitters and IRSs, and receivers and IRSs, in the first and second sub-problems, respectively. The impact of the transmission power, the number of IRS elements, and the network area on the sum rate are investigated. Furthermore, the proposed algorithm is compared to an exhaustive search, nearest association, greedy search, and random allocation to validate the proposed solution. The complexity and convergence analysis demonstrate that the computational complexity of our algorithm is lower than that of the ES method.

The focus of research efforts in cognitive radio networks (CRNs) has primarily remained confined to maximizing the utilization of the discovered resources. However, it is also important to enhance the user satisfaction in CRNs by finding a suitable match between the secondary users and the idle channels available from the primary network while taking into consideration not only the quality of service (QoS) requirements of the secondary users but the quality of the channels as well. In this work, the Gale Shapley matching theory was applied to find the best match, so that the most suitable channels from the available pool were allocated that satisfy the QoS requirements of the secondary users. Before applying matching theory, two objective functions were defined from the secondary user’s perspective as well as from the channel’s perspective. The objective function of secondary users is the weighted sum of the data rate of the secondary users and the probability of reappearance of the primary user on the channel. Whereas, the objective function of the channel is the maximum utilization of the channel. The weight factors included in the objective functions allow for diverse service classes of secondary users (SUs) or varying channel quality characteristics. The objective functions were used in developing the preference lists for the secondary users and the idle channels. The preference lists were then used by the Gale Shapely matching algorithm to determine the most suitably matched SU-channel pairs. The performance of the proposed scheme was evaluated using Monte–Carlo simulations. The results show significant improvement in the overall satisfaction of the secondary users with the proposed scheme in comparison to other contemporary techniques. Further, the impact of changing the weight factors in the objective functions on the secondary user’s satisfaction and channel utilization was also analyzed.

Blind-spots, where wireless signals do not reach within the coverage range, often emerge in a dynamic environment due to obstacles, geographical location or mobility of cellular users (CUs). Thus greatly reducing the overall system performance in terms of coverage and throughput. Relay-aided cognitive Device to Device (cD2D) communication system underlying the 5G cellular network can help mitigate blind-spots. Cognitive capability helps D2D users to acquire the spectrum opportunistically for proximity communication and establish a semi-independent network underlying the 5G network, which not only offloads 5G-New Radio (NR) base station but also enhances the overall system performance. In this work, we have developed a relay-aided cognitive D2D network that helps CUs falling into the blind-spots to retain access to the 5G network and increase wireless coverage. Relay selection requires mutual consent between the relay and the device in the blind-spot. The in-coverage devices are tempted to act as relays through incentive-based mechanism. For enhanced system performance a suitable match among the devices in blind-spots and the relays is required. cD2D enabled relay selection algorithm (cDERSA) is proposed in this work, in which a cognitive D2D user (cDU), which is a CU falling in the blind-spot, establishes a relayed cD2D link to access 5G-NR gNodeB. All cDUs as well as the tempted relays, i.e. cognitive D2D relays (cDRs), first scan their surroundings for devices capable of D2D communication and based on multi-criteria objective functions, build a priority table. A stable marriage problem is formulated and solved using a unique, stable, distributed, and efficient matching algorithm based on the Gale-Shapley algorithm. A new incentive mechanism is also developed to keep relays motivated to share their resources. Simulation is performed and their results show improvement in throughput and average user satisfaction, which validates our proposed cDERSA.