HGHesham El Gamal

Hesham El Gamal

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Hesham El Gamal has a total of 53 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The Impact of Stealthy Attacks on Smart Grid Performance: Tradeoffs and Implications

    by Yara Abdallah, Zizhan Zheng, Ness B. Shroff, Hesham El Gamal, Tarek M. El-Fouly

    The smart grid is envisioned to significantly enhance the efficiency of energy consumption, by utilizing two-way communication channels between consumers and operators. For example, operators can opportunistically leverage the delay tolerance of energy demands in order to balance the energy load over time, and hence, reduce the total operational cost. This opportunity, however, comes with security threats, as the grid becomes more vulnerable to cyber-attacks. In this paper, we study the impact of such malicious cyber-attacks on the energy efficiency of the grid in a simplified setup. More precisely, we consider a simple model where the energy demands of the smart grid consumers are intercepted and altered by an active attacker before they arrive at the operator, who is equipped with limited intrusion detection capabilities. We formulate the resulting optimization problems faced by the operator and the attacker and propose several scheduling and attack strategies for both parties. Interestingly, our results show that, as opposed to facilitating cost reduction in the smart grid, increasing the delay tolerance of the energy demands potentially allows the attacker to force increased costs on the system. This highlights the need for carefully constructed and robust intrusion detection mechanisms at the operator.

  • Proactive Content Download and User Demand Shaping for Data Networks

    by John Tadrous, Atilla Eryilmaz, Hesham El Gamal

    In this paper, we propose and study optimal proactive resource allocation and demand shaping for data networks. Motivated by the recent findings on the predictability of human behavior patterns in data networks, and the emergence of highly capable handheld devices, our design aims to smooth out the network traffic over time and minimize the data delivery costs. Our framework utilizes proactive data services as well as smart content recommendation schemes for shaping the demand. Proactive data services take place during the off-peak hours based on a statistical prediction of a demand profile for each user, whereas smart content recommendation assigns modified valuations to data items so as to render the users' demand less uncertain. Hence, our recommendation scheme aims to boost the performance of proactive services within the allowed flexibility of user requirements. We conduct theoretical performance analysis that quantifies the leveraged cost reduction through the proposed framework. We show that the cost reduction scales at the same rate as the cost function scales with the number of users. Furthermore, we prove that demand shaping through smart recommendation strictly reduces the incurred cost even below that of proactive downloads without recommendation.


  • Open Access

    Using Network Coding to Achieve the Capacity of Deterministic Relay Networks with Relay Messages

    by Ahmed A. Zewail, Yahya Mohasseb, Mohammed Nafie, Hesham El Gamal

    In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network which consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a relay as it may exchange private messages with the other network nodes. First, we develop an upper bound on the capacity region based on the notion of a single sided genie. In the course of the achievability proof, we also derive the deterministic capacity of a 4-user relay network (without private messages at the relay). The capacity achieving schemes use a combination of two network coding techniques: the Simple Ordering Scheme (SOS) and Detour Schemes (DS). In the SOS, we order the transmitted bits at each user such that the bi-directional messages will be received at the same channel level at the relay, while the basic idea behind the DS is that some parts of the message follow an indirect path to their respective destinations. This paper, therefore, serves to show that user cooperation and network coding can enhance throughput, even when the users are not directly connected to each other.

  • Open Access

    Achievable Degrees of Freedom Region of the MIMO Relay Networks using the Detour Schemes

    by Ahmed A. Zewail, M. Nafie, Y. Mohasseb, H. EL Gamal

    In this paper, we study the degrees of freedom (DoF) of the MIMO relay networks. We start with a general Y channel, where each user has $M_i$ antennas and aims to exchange messages with the other two users via a relay equipped with $N$ antennas. Then, we extend our work to a general 4-user MIMO relay network. Unlike most previous work which focused on the total DoF of the network, our aim here is to characterize the achievable DoF region as well. We develop an outer bound on the DoF region based on the notion of one sided genie. Then, we define a new achievable region using the Signal Space Alignment (SSA) and the Detour Schemes. Our achievable scheme achieves the upper bound for certain conditions relating $M_i$'s and $N$.

  • Opportunistic Secrecy with a Strict Delay Constraint

    by Karim Khalil, O. Ozan Koyluoglu, Hesham El Gamal, Moustafa Youssef

    We investigate the delay limited secrecy capacity of the flat fading channel under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main and eavesdropper channel gains. Here, upper and lower bounds on the delay limited secrecy capacity are derived, and shown to be tight in the high signal-to-noise ratio (SNR) regime. In the second scenario, only the main channel CSI is assumed to be available at the transmitter where, remarkably, we establish the achievability of a non-zero delay-limited secure rate, for a wide class of channel distributions, with a high probability. In the two cases, our achievability arguments are based on a novel two-stage key-sharing approach that overcomes the secrecy outage phenomenon observed in earlier works.


  • Open Access

    The Deterministic Multicast Capacity of 4-Node Relay Networks

    by Ahmed A. Zewail, M. Nafie, Y. Mohasseb, H. El Gamal

    In this paper, we completely characterize the deterministic capacity region of a four-node relay network with no direct links between the nodes, where each node communicates with the three other nodes via a relay. Towards this end, we develop an upper bound on the deterministic capacity region, based on the notion of a one-sided genie. To establish achievability, we use the detour schemes that achieve the upper bound by routing specific bits via indirect paths instead of sending them directly.

  • Open Access

    On the Diversity Gain Region of the Z-interference Channels

    by Mohamed S. Nafea, Karim G. Seddik, Mohammed Nafie, Hesham El Gamal

    In this work, we analyze the diversity gain region (DGR) of the single-antenna Rayleigh fading Z-Interference channel (ZIC). More specifically, we characterize the achievable DGR of the fixed-power split Han-Kobayashi (HK) approach under these assumptions. Our characterization comes in a closed form and demonstrates that the HK scheme with only a common message is a singular case, which achieves the best DGR among all HK schemes for certain multiplexing gains. Finally, we show that generalized time sharing, with variable rate and power assignments for the common and private messages, does not improve the achievable DGR.

  • On Secrecy Capacity Scaling in Wireless Networks

    by O. Ozan Koyluoglu, Can Emre Koksal, Hesham El Gamal

    This paper studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes with intensities λ and λe, respectively. It is shown that, as long as λe/λ = o((logn)-2), almost all of the nodes achieve a perfectly secure rate of Ω(1/√n) for the extended and dense network models. Therefore, under these assumptions, securing the network does not entail a loss in the per-node throughput. The achievability argument is based on a novel multihop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Second, an ergodic fading model with n source-destination pairs and ne eavesdroppers is considered. Employing the ergodic interference alignment scheme with an appropriate secrecy precoding, each user is shown to achieve a constant positive secret rate for sufficiently large n. Remarkably, the scheme does not require eavesdropper CSI (only the statistical knowledge is assumed) and the secure throughput per node increases as we add more legitimate users to the network in this setting. Finally, the effect of eavesdropper collusion on the performance of the proposed schemes is characterized.


  • Open Access

    The Two-Way Wiretap Channel: Achievable Regions and Experimental Results

    by Aly El Gamal, O. Ozan Koyluoglu, Moustafa Youssef, Hesham El Gamal

    This work considers the two-way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and receive simultaneously, we obtain new achievable secrecy rate regions based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half-duplex case, where a user can only transmit or receive on any given degree of freedom, we introduce the idea of randomized scheduling and establish the significant gain it offers in terms of the achievable secrecy sum-rate. We further develop an experimental setup based on a IEEE 802.15.4-enabled sensor boards, and use this testbed to show that one can exploit the two-way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve.