Marc Ibrahim

Marc Ibrahim

Auto-generated profile, based on publicly available information

Marc Ibrahim

Saint Joseph University of Beirut

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
27 March 2015 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
MHMelhem El Helou
Melhem El Helou
MIMarc Ibrahim
Marc Ibrahim
Samer LahoudSamer Lahoud
Samer Lahoud
KKKinda Khawam
Kinda Khawam
DMDany Mezher
Dany Mezher
Bernard CousinBernard Cousin
Bernard Cousin
When several radio access technologies (e.g., HSPA, LTE, WiFi, and WiMAX) cover the same region, deciding to which one mobiles connect is known as the Radio Access Technology (RAT) selection problem. To reduce network signaling and processing load, decisions are generally delegated to mobile users. Mobile users aim to selfishly maximize their utility. However, as they do not cooperate, their decisions may lead to performance inefficiency. In this paper, to overcome this limitation, we propose a network-assisted approach. The network provides information for the mobiles to make more accurate decisions. By appropriately tuning network information, user decisions are globally expected to meet operator objectives, avoiding undesirable network states. Deriving network information is formulated as a semi-Markov decision process (SMDP), and optimal policies are computed using the Policy Iteration algorithm. Also, and since network parameters may not be easily obtained, a reinforcement learning approach is introduced to derive what to signal to mobiles. The performances of optimal, learning-based, and heuristic policies, such as blocking probability and average throughput, are analyzed. When tuning thresholds are pertinently set, our heuristic achieves performance very close to the optimal solution. Moreover, although it provides lower performance, our learning-based algorithm has the crucial advantage of requiring no prior parameterization.

24 December 2015 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
MYMohamad Yassin
Mohamad Yassin
MAMohamed A. AboulHassan
Mohamed A. AboulHassan
Samer LahoudSamer Lahoud
Samer Lahoud
MIMarc Ibrahim
Marc Ibrahim
DMDany Mezher
Dany Mezher
ESEssam A. Sourour
Essam A. Sourour

1 December 2010
Verified
Conference Paper
Closed access
MIMarc Ibrahim
Marc Ibrahim
KKKinda Khawam
Kinda Khawam
STSamir Tohme
Samir Tohme
Nowadays networks are characterized by the abundance of diverse Radio Access Interfaces (RAI) in the same operating area. The various wireless interfaces can belong to the same Radio Access Technology or not. In such a scenario, a mobile user will be able to select selfishly one of the available radio interfaces in order to enhance its own performance. Therefore, the radio access selection policy is vital and must be designed astutely to avoid resource wastage. In this paper, the RAI selection process is apprehended as a congestion game which is a class of noncooperative games in which users share a common set of limited resources. The cost sustained by a given user depends upon the congestion impact inflected by other users sharing the same resource. Devising distributed resource sharing schemes that optimize user air interface selection depends crucially on the existence of Nash equilibria for the modelling congestion games. In this paper, we model the downlink access for three main broadband technologies (WiMAX, WiFi and 3.5G HSDPA) and study the existence of pure Nash equilibria for various multi-RAI scenarios involving those technologies.

1 June 2011
Verified
Conference Paper
Closed access
KKKinda Khawam
Kinda Khawam
MIMarc Ibrahim
Marc Ibrahim
JCJohanne Cohen
Johanne Cohen
Samer LahoudSamer Lahoud
Samer Lahoud
STSamir Tohme
Samir Tohme
Nowadays, with the abundance of diverse air interfaces in the same operating area, advanced Radio Resource Management (RRM) is vital to take advantage of the available system resources. In such a scenario, a mobile user will be able to connect concurrently to different wireless access networks. In this paper, we consider the downlink of a hybrid network with two broadband Radio Access Technologies (RAT): WiMAX and WiFi. Two approaches are proposed to load balance the traffic of every user between the two available RATs: an individual approach where mobile users selfishly strive to improve their performance and a global approach where resource allocation is made in a way to satisfy all mobile users. We devise for the individual approach a fully distributed resource management scheme portrayed as a non-cooperative game. We characterize the Nash equilibriums of the proposed RRM game and put forward a decentralized algorithm based on replicator dynamics to achieve those equilibriums. In the global approach, resources are assigned by the system in order to enhance global performances. For the two approaches, we show that after convergence, each user is connected to a single RAT which avoids costly traffic splitting between available RATs.

1 April 2012
Verified
Conference Paper
Closed access
FMFarah Moety
Farah Moety
MIMarc Ibrahim
Marc Ibrahim
Samer LahoudSamer Lahoud
Samer Lahoud
KKKinda Khawam
Kinda Khawam
In wireless heterogeneous networks, one of the most challenging problems is Radio Access Technology (RAT) selection that must be designed to avoid resource wastage. In this paper we adopt a hybrid model for RAT selection where the system allocates the downlink traffic between two different technologies in order to enhance global performance. We study the case of an integrated hybrid Wireless Local Area Network environment where the challenge we face is the high computational complexity necessary to obtain the global optimal solution. Therefore, we propose four distributed heuristic algorithms for RAT selection, where two of them are based on the distance between the user and the access points (APs), namely, distance based and probabilistic distance based algorithms. While the two others schemes are based on the peak rate that each user receives from these APs (peak rate based and probabilistic peak rate based algorithms). Results show that the proposed algorithms give efficient results compared to the optimal one depending on the spatial users distribution. Moreover these algorithms have a low computational complexity which makes them more advantageous compared to the optimal scheme in presence of a large number of users.

1 September 2017
Verified
Conference Paper
Closed access
KBKaren Boulos
Karen Boulos
MHMelhem El Helou
Melhem El Helou
MIMarc Ibrahim
Marc Ibrahim
KKKinda Khawam
Kinda Khawam
HSHadi Sawaya
Hadi Sawaya
SMSteven Martin
Steven Martin
Cloud Radio Access Network (C-RAN) is an evolution in base station architecture. The key concept is to break down the conventional base station into a Base Band Unit (BBU) and a Remote Radio Head (RRH). While BBUs are pooled in a cloud data center, RRHs are distributed across multiple sites. In this context, resource utilization can be enhanced through statistical multiplexing: many RRHs may be clustered and associated with a single BBU. In this paper, RRH clustering is formulated as a Set Partitioning Problem, considering inter-cluster interferences. Optimal and heuristic solutions are derived to reduce network power consumption with minimum throughput requirements. Simulation results show that our interference-aware solutions outperform the no-clustering method, where only one RRH is associated with each BBU, and the interference-unaware Bin Packing algorithm. Moreover, our heuristic achieves performance very close to the optimal solution.