arXiv subjects

Majid Gerami

Publications and source records attributed to Majid Gerami.

11 recordsLinked to original sources

arXiv2024

A Comprehensive Design Framework for UE-side and BS-Side RIS Deployments

Integrating reconfigurable intelligent surfaces (RISs) in emerging communication systems is a fast-growing research field that has recently earned much attention. While implementing RISs near the base station (BS), i.e., BS-side RIS, or user equipment (UE), i.e., UE-side RIS, exhibits optimum performance, understanding the differences between these two deployments in terms of the system design perspective needs to be clarified. Critical design parameters, such as RIS size, phase shift adjustment, control link, and element type (passive/active), require greater clarity across these scenarios. Overlooking the intricacies of such critical design parameters in light of 6G demands endangers practical implementation, widening the gap between theoretical insights and practical applications. In this regard, our study investigates the impact of each RIS deployment strategy on the anticipated 6G requirements and offers tailored RIS design recommendations to fulfill these forward-looking requirements. Through this, we clarify the practical distinctions and propose a comprehensive framework for differentiating between BS-side and UE-side RIS scenarios in terms of their design parameters. Highlighting the unique needs of each and the potential challenges ahead, we aim to fuse the theoretical underpinnings of RIS with tangible implementation considerations, propelling progress in both the academic sphere and the industry.

eess.SP↗

arXiv2024

A Simple Detection and Identification Scheme For Reconfigurable Intelligent Surfaces

Reconfigurable intelligent surface (RIS)-empowered communication is one of the promising physical layer enabling technologies for the sixth generation (6G) wireless networks due to their unprecedented capabilities in shaping the wireless communication environment. RISs are modeled as passive objects that can not transmit or receive wireless signals. While the passiveness of these surfaces is a key advantage in terms of power consumption and implementation complexity, it limits their capability to interact with the other active components in the network. Specifically, unlike conventional base stations (BSs), which actively identify themselves to user equipment (UEs) by periodically sending pilot signals, RISs need to be detected from the UE side. This paper proposes a novel RIS identification (RIS- ID) scheme, enabling UEs to detect and uniquely identify RISs in their surrounding environment. Furthermore, to assess the proposed RIS-ID scheme, we propose two performance metrics: the false and miss detection probabilities. These probabilities are analytically derived and verified through computer simulations, revealing the effectiveness of the proposed RIS-ID scheme under different operating scenarios.

eess.SP↗

arXiv2023

Plug-In RIS: A Novel Approach to Fully Passive Reconfigurable Intelligent Surfaces

This paper presents a promising design concept for reconfigurable intelligent surfaces (RISs), named plug-in RIS, wherein the RIS is plugged into an appropriate position in the environment, adjusted once according to the location of both base station and blocked region, and operates with fixed beams to enhance the system performance. The plug-in RIS is a novel system design, streamlining RIS-assisted millimeter-wave (mmWave) communication without requiring decoupling two parts of the end-to-end channel, traditional control signal transmission, and online RIS configuration. In plug-in RIS-aided transmission, the transmitter efficiently activates specific regions of the divided large RIS by employing hybrid beamforming techniques, each with predetermined phase adjustments tailored to reflect signals to desired user locations. This user-centric approach enhances connectivity and overall user experience by dynamically illuminating the targeted user based on location. By introducing plug-in RIS's theoretical framework, design principles, and performance evaluation, we demonstrate its potential to revolutionize mmWave communications for the limited channel state information (CSI) scenarios. Simulation results illustrate that plug-in RIS provides power/cost-efficient solutions to overcome blockage in the mmWave communication system and a striking convergence in average bit error rate and achievable rate performance with traditional full CSI-enabled RIS solutions.

eess.SP↗

arXiv2022

Configured Grant for Ultra-Reliable and Low-Latency Communications: Standardization and Beyond

Uplink configured Grant allocation has been introduced in 3rd Generation Partnership Project New Radio Release 15. This is beneficial in supporting Ultra-Reliable and Low Latency Communication for industrial communication, a key Fifth Generation mobile communication usage scenario. This scheduling mechanism enables a user with periodic traffic to transmits its data readily and bypasses the control signaling entailed to scheduling requests and scheduling grants and provides low latency access. To facilitate ultra-reliable communication, the scheduling mechanism can allow users to transmit consecutive redundant transmissions in a pre-defined period. However, if the traffic is semi-deterministic, the current standardized configured grant allocation is not equipped to emulate the traffic as the configured grant's period is pre-configured and fixed. This article describes the recent advancements in the standardization process in Release 15 and 16 for configured grant allocation and the prospective solutions to accommodate semi-deterministic traffic behavior for configured grant allocations.

cs.NI↗

arXiv2020

Configured Grant for Semi-Deterministic Traffic for Ultra-Reliable and Low Latency Communications

Configured Grant-based allocation has been adopted in New Radio 3rd Generation Partnership Project Release 16. This scheme is beneficial in supporting Ultra-Reliable and Low Latency Communication for industrial communication, a key Fifth Generation mobile communication usage scenario. This scheduling mechanism enables a user with a periodic traffic to transmit its data readily and bypasses the signaling entailed to scheduling requests and scheduling grants; and provides low latency access. To facilitate ultra-reliable communication, the scheduling mechanism can allow the user to transmit redundant transmissions at consecutive repetition occasions in a pre-defined period. However, for the user with semi-deterministic traffic, the reliability and latency performance with Configured Grant-based allocation deteriorates. This can be due to, e.g., late data arrival in the buffer, and the user unable to transmit its repetitions, which leads to reliability degradation. To improve the Configured Grant reliability performance with semi-deterministic traffic, we consider various allocation designs utilizing, e.g., additional unlicensed spectrum, or flexible transmission in a Configured Grant period, or allowing time-gaps between the repetitions, etc. These enhancements could be a stepping-stone for Sixth Generation Configured Grant models.

cs.NI↗

arXiv2015

Secure Partial Repair in Wireless Caching Networks with Broadcast Channels

We study security in partial repair in wireless caching networks where parts of the stored packets in the caching nodes are susceptible to be erased. Let us denote a caching node that has lost parts of its stored packets as a sick caching node and a caching node that has not lost any packet as a healthy caching node. In partial repair, a set of caching nodes (among sick and healthy caching nodes) broadcast information to other sick caching nodes to recover the erased packets. The broadcast information from a caching node is assumed to be received without any error by all other caching nodes. All the sick caching nodes then are able to recover their erased packets, while using the broadcast information and the nonerased packets in their storage as side information. In this setting, if an eavesdropper overhears the broadcast channels, it might obtain some information about the stored file. We thus study secure partial repair in the senses of information-theoretically strong and weak security. In both senses, we investigate the secrecy caching capacity, namely, the maximum amount of information which can be stored in the caching network such that there is no leakage of information during a partial repair process. We then deduce the strong and weak secrecy caching capacities, and also derive the sufficient finite field sizes for achieving the capacities. Finally, we propose optimal secure codes for exact partial repair, in which the recovered packets are exactly the same as erased packets.

cs.IT↗

arXiv2014

Repair for Distributed Storage Systems in Packet Erasure Networks

Reliability is essential for storing files in many applications of distributed storage systems. To maintain reliability, when a storage node fails, a new node should be regenerated by a repair process. Most of the previous results on the repair problem assume perfect (error-free) links in the networks. However, in practice, especially in a wireless network, the transmitted packets (for repair) may be lost due to, e.g., link failure or buffer overflow. We study the repair problem of distributed storage systems in packet erasure networks, where a packet loss is modeled as an erasure. The minimum repair-bandwidth, namely the amount of information sent from the surviving nodes to the new node, is established under the ideal assumption of infinite number of packet transmissions. We also study the bandwidth-storage tradeoffs in erasure networks. Then, the use of repairing storage nodes (nodes with smaller storage space) is proposed to reduce the repair-bandwidth. We study the minimal storage of repairing storage nodes. For the case of a finite number of packet transmissions, the probability of successful repairing is investigated. We show that the repair with a finite number of packet transmissions may use much larger bandwidth than the minimum repair-bandwidth. Finally, we propose a combinatorial optimization problem, which results in the optimal repair-bandwidth for the given packet erasure probability and finite packet transmissions.

cs.IT↗

arXiv2014

Exact Optimized-cost Repair in Multi-hop Distributed Storage Networks

The problem of exact repair of a failed node in multi-hop networked distributed storage systems is considered. Contrary to the most of the current studies which model the repair process by the direct links from surviving nodes to the new node, the repair is modeled by considering the multi-hop network structure, and taking into account that there might not exist direct links from all the surviving nodes to the new node. In the repair problem of these systems, surviving nodes may cooperate to transmit the repair traffic to the new node. In this setting, we define the total number of packets transmitted between nodes as repair-cost. A lower bound of the repaircost can thus be found by cut-set bound analysis. In this paper, we show that the lower bound of the repair-cost is achievable for the exact repair of MDS codes in tandem and grid networks, thus resulting in the minimum-cost exact MDS codes. Further, two suboptimal (achievable) bounds for the large scale grid networks are proposed.

cs.IT↗

arXiv2013

Optimized-Cost Repair in Multi-hop Distributed Storage Systems with Network Coding

In distributed storage systems reliability is achieved through redundancy stored at different nodes in the network. Then a data collector can reconstruct source information even though some nodes fail. To maintain reliability, an autonomous and efficient protocol should be used to repair the failed node. The repair process causes traffic and consequently transmission cost in the network. Recent results found the optimal trafficstorage tradeoff, and proposed regenerating codes to achieve the optimality. We aim at minimizing the transmission cost in the repair process. We consider the network topology in the repair, and accordingly modify information flow graphs. Then we analyze the cut requirement and based on the results, we formulate the minimum-cost as a linear programming problem for linear costs. We show that the solution of the linear problem establishes a fundamental lower bound of the repair-cost. We also show that this bound is achievable for minimum storage regenerating, which uses the optimal-cost minimum-storage regenerating (OCMSR) code. We propose surviving node cooperation which can efficiently reduce the repair cost. Further, the field size for the construction of OCMSR codes is discussed. We show the gain of optimal-cost repair in tandem, star, grid and fully connected networks.

cs.IT↗

arXiv2013

Decentralized Minimum-Cost Repair for Distributed Storage Systems

There have been emerging lots of applications for distributed storage systems e.g., those in wireless sensor networks or cloud storage. Since storage nodes in wireless sensor networks have limited battery, it is valuable to find a repair scheme with optimal transmission costs (e.g., energy). The optimal-cost repair has been recently investigated in a centralized way. However a centralized control mechanism may not be available or is very expensive. For the scenarios, it is interesting to study optimal-cost repair in a decentralized setup. We formulate the optimal-cost repair as convex optimization problems for the network with convex transmission costs. Then we use primal and dual decomposition approaches to decouple the problem into subproblems to be solved locally. Thus, each surviving node, collaborating with other nodes, can minimize its transmission cost such that the global cost is minimized. We further study the optimality and convergence of the algorithms. Finally, we discuss the code construction and determine the field size for finding feasible network codes in our approaches.

cs.IT↗

arXiv2013

Repair for Distributed Storage Systems with Erasure Channels

We study the repair problem of distributed storage systems in erasure networks where the packets transmitted from surviving nodes to the new node might be lost. The fundamental storage-bandwidth tradeoff is calculated by multicasting analysis in erasure networks. The optimal tradeoff bound can be asymptotically achieved when the number of transmission (packets) goes to infinity. For a limited number of transmission, we study the probability of successful regenerating. Then, we investigate two approaches of increasing the probability of successful regenerating, namely, by connecting more surviving nodes or by increasing the storage space of nodes. Using more nodes may pose larger delay and in certain situation it might not be possible to connect to more nodes too. We show that in addition to reducing repair bandwidth, increasing storage space can also increase reliability for repair.

cs.IT↗