Mohammed S. Elbamby

Mohammed S. Elbamby

Auto-generated profile, based on publicly available information

Mohammed S. Elbamby

Centre for Wireless Communications (CWC), University of Oulu, Oulu, Finland

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 June 2019 in Proceedings of the IEEE
Verified
Journal Article
Closed access
MEMohammed S. Elbamby
Mohammed S. Elbamby
CPCristina Perfecto
Cristina Perfecto
CLChen-Feng Liu
Chen-Feng Liu
JPJihong Park
Jihong Park
SSSumudu Samarakoon
Sumudu Samarakoon
MBMehdi Bennis
Mehdi Bennis
Edge computing is an emerging concept based on distributed computing, storage, and control services closer to end network nodes. Edge computing lies at the heart of the fifth-generation (5G) wireless systems and beyond. While the current state-of-the-art networks communicate, compute, and process data in a centralized manner (at the cloud), for latency and compute-centric applications, both radio access and computational resources must be brought closer to the edge, harnessing the availability of computing and storage-enabled small cell base stations in proximity to the end devices. Furthermore, the network infrastructure must enable a distributed edge decision-making service that learns to adapt to the network dynamics with minimal latency and optimize network deployment and operation accordingly. This paper will provide a fresh look to the concept of edge computing by first discussing the applications that the network edge must provide, with a special emphasis on the ensuing challenges in enabling ultrareliable and low-latency edge computing services for mission-critical applications such as virtual reality (VR), vehicle-to-everything (V2X), edge artificial intelligence (AI), and so on. Furthermore, several case studies where the edge is key are explored followed by insights and prospect for future work.

10 January 2020 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
CPCristina Perfecto
Cristina Perfecto
MEMohammed S. Elbamby
Mohammed S. Elbamby
Javier Del SerJavier Del Ser
Javier Del Ser
MBMehdi Bennis
Mehdi Bennis
Immersive virtual reality (VR) applications require ultra-high data rate and low-latency for smooth operation. Hence in this paper, aiming to improve VR experience in multi-user VR wireless video streaming, a deep-learning aided scheme for maximizing the quality of the delivered video chunks with low-latency is proposed. Therein the correlations in the predicted field of view (FoV) and locations of viewers watching 360° HD VR videos are capitalized on to realize a proactive FoV-centric millimeter wave (mmWave) physical-layer multicast transmission. The problem is cast as a frame quality maximization problem subject to tight latency constraints and network stability. The problem is then decoupled into an HD frame request admission and scheduling subproblems and a matching theory game is formulated to solve the scheduling subproblem by associating requests from clusters of users to mmWave small cell base stations (SBSs) for their unicast/multicast transmission. Furthermore, for realistic modeling and simulation purposes, a real VR head-tracking dataset and a deep recurrent neural network (DRNN) based on gated recurrent units (GRUs) are leveraged. Extensive simulation results show how the content-reuse for clusters of users with highly overlapping FoVs brought in by multicasting reduces the VR frame delay in 12%. This reduction is further boosted by proactiveness that cuts by half the average delays of both reactive unicast and multicast baselines while preserving HD delivery rates above 98%. Finally, enforcing tight latency bounds shortens the delay-tail as evinced by 13% lower delays in the 99th percentile.

12 July 2017 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Open access
MEMohammed S. Elbamby
Mohammed S. Elbamby
MBMehdi Bennis
Mehdi Bennis
WSWalid Saad
Walid Saad
MDMerouane Debbah
Merouane Debbah
MLMatti Latva-Aho
Matti Latva-Aho
In this paper, the problem of uplink (UL) and downlink (DL) resource optimization, mode selection, and power allocation is studied for wireless cellular networks under the assumption of in-band full duplex base stations, non-orthogonal multiple access (NOMA) operation, and queue stability constraints. The problem is formulated as a network utility maximization problem for which a Lyapunov framework is used to decompose it into two disjoint subproblems of auxiliary variable selection and rate maximization. The latter is further decoupled into a user association and mode selection (UAMS) problem and a UL/DL power optimization (UDPO) problem that are solved concurrently. The UAMS problem is modeled as a many-to-one matching problem whose goal is to associate users to small cell base stations and select transmission mode (half-/full-duplex and orthogonal/NOMA). Then, an algorithm is proposed to solve the problem by finding a pairwise stable matching. Subsequently, the UDPO problem is formulated as a sequence of convex problems and is solved using the concave-convex procedure. Simulation results demonstrate that the proposed scheme is effective in allocating UL and DL power levels after dynamically selecting the operating mode and the served users, under different traffic intensity conditions, network density, and self-interference cancellation capability. The proposed scheme is shown to achieve up to 63% and 73% of gains in UL and DL packet throughput, and 21% and 17% in UL and DL cell edge throughput, respectively, compared with the existing baseline schemes.

20 August 2018 in EURASIP Journal on Wireless Communications and Networking
Verified
Journal Article
Open access
PDF file
MEMohammed S. Elbamby
Mohammed S. Elbamby
MBMehdi Bennis
Mehdi Bennis
WSWalid Saad
Walid Saad
MLMatti Latva-Aho
Matti Latva-Aho
CHChoong Seon Hong
Choong Seon Hong
This paper studies the problem of task distribution and proactive edge caching in fog networks with latency and reliability constraints. In the proposed approach, user nodes (UNs) offload their computing tasks to edge computing servers (cloudlets). Cloudlets leverage their computing and storage capabilities to proactively compute and store cacheable computing results. In this regard, a task popularity estimation and caching policy schemes are proposed. Furthermore, the problem of UNs’ tasks distribution to cloudlets is modeled as a one-to-one matching game. In this game, UNs whose requests exceed a delay threshold use the notion of hedged-requests to enqueue their request in another cloudlet, and offload the task data to whichever is available first. A matching algorithm based on the deferred-acceptance matching is used to solve this game. Simulation results show that the proposed approach guarantees reliable service and minimal latency, reaching up to 50 and 65% reduction in the average delay and the 99th percentile delay, as compared to reactive baseline schemes.

13 February 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MAMohamed K. Abdel-Aziz
Mohamed K. Abdel-Aziz
MEMohammed S. Elbamby
Mohammed S. Elbamby
SSSumudu Samarakoon
Sumudu Samarakoon
MBMehdi Bennis
Mehdi Bennis
Cooperative multi-agent reinforcement learning (MARL) for navigation enables agents to cooperate to achieve their navigation goals. Using emergent communication, agents learn a communication protocol to coordinate and share information that is needed to achieve their navigation tasks. In emergent communication, symbols with no pre-specified usage rules are exchanged, in which the meaning and syntax emerge through training. Learning a navigation policy along with a communication protocol in a MARL environment is highly complex due to the huge state space to be explored. To cope with this complexity, this work proposes a novel neural network architecture, for jointly learning an adaptive state space abstraction and a communication protocol among agents participating in navigation tasks. The goal is to come up with an adaptive abstractor that significantly reduces the size of the state space to be explored, without degradation in the policy performance. Simulation results show that the proposed method reaches a better policy, in terms of achievable rewards, resulting in fewer training iterations compared to the case where raw states or fixed state abstraction are used. Moreover, it is shown that a communication protocol emerges during training which enables the agents to learn better policies within fewer training iterations.

23 August 2018
Verified
Book Chapter
Closed access
PDF file
MEMohammed S. Elbamby
Mohammed S. Elbamby
MBMehdi Bennis
Mehdi Bennis
Walid SaadWalid Saad
Walid Saad
MDMérouane Debbah
Mérouane Debbah
MLMatti Latva-Aho
Matti Latva-Aho