Aymen Hamrouni

Aymen Hamrouni

Auto-generated profile, based on publicly available information

Aymen Hamrouni

Department of Electrical Engineering (ESAT), WaveCore, Leuven, KU Leuven, Belgium

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
4 February 2020 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
AHAymen Hamrouni
Aymen Hamrouni
HGHakim Ghazzai
Hakim Ghazzai
MFMounir Frikha
Mounir Frikha
YMYehia Massoud
Yehia Massoud
The widespread use of advanced mobile devices has led to the emergence of a new class of mobile crowdsourcing called spatial mobile crowdsourcing (SMCS). The main feature of SMCS is the presence of spatial tasks that require workers to be physically present at a particular location for task fulfillment. These tasks usually take advantage of the built-in sensors in mobile devices by requesting environment sensing services. Because cameras are becoming the most common way for visual logging techniques and sensing in our daily lives, we propose, in this article, a photo-based SMCS framework for event reporting. The proposed framework allows event report requesters to solicit photos of ongoing events and keep track of any updates. We propose a full architecture in which we solve the SMCS recruitment problem using different fairness strategies in the presence of multiple events and reporters. Then, once submissions are received and before forwarding final responses to event requesters, we proceed with a data processing phase for data quality monitoring. In short, our event reporting platform helps requesters recruit ideal reporters, select highly relevant data from an evolving picture stream, and receive accurate responses. This solution mainly incorporates: 1) a strategic and generic recruitment algorithm for recruiting and scheduling suitable reporters to events; 2) a deep learning model that eliminates false submissions and ensures photo's credibility; and 3) an A-tree shape data structure model for clustering streaming pictures to reduce information redundancy and provide maximum event coverage. Experiment results investigate the performances of the proposed recruitment approach and show that our algorithm outperforms two other benchmarking approaches. Also, we conduct simulations to evaluate the strategies of the proposed recruitment algorithm, given different fairness levels among events. Data quality simulation results show effectiveness in reducing false submissions and delivering high-quality responses. Finally, framework implementation for real-world applications is provided.

3 June 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
AHAymen Hamrouni
Aymen Hamrouni
HGHakim Ghazzai
Hakim Ghazzai
TATurki Alelyani
Turki Alelyani
YMYehia Massoud
Yehia Massoud
Collaborative mobile crowdsourcing (CMCS) allows entities, e.g., local authorities or individuals, to hire a team of workers from the crowd of connected people, to execute complex tasks. In this article, we investigate two different CMCS recruitment strategies allowing task requesters to form teams of socially connected and skilled workers: 1) a platform-based strategy where the platform exploits its own knowledge about the workers to form a team and 2) a leader-based strategy where the platform designates a group leader that recruits its own suitable team given its own knowledge about its social network (SN) neighbors. We first formulate the recruitment as an integer linear program (ILP) that optimally forms teams according to four fuzzy-logic-based criteria: 1) level of expertise; 2) social relationship strength; 3) recruitment cost; and 4) recruiter’s confidence level. To cope with NP-hardness, we design a novel low-complexity CMCS recruitment approach relying on graph neural networks (GNNs), specifically graph embedding and clustering techniques, to shrink the workers’ search space and afterwards, exploiting a metaheuristic genetic algorithm to select appropriate workers. Simulation results applied on a real-world data set illustrate the performance of both proposed CMCS recruitment approaches. It is shown that our proposed low-complexity GNN-based recruitment algorithm achieves close performances to those of the baseline ILP with significant computational time saving and ability to operate on large-scale mobile crowdsourcing platforms. It is also shown that compared to the leader-based strategy, the platform-based strategy recruits a more skilled team but with lower SN relationships and higher cost.

10 February 2021 in IEEE Access
Verified
Journal Article
Open access
Hassana GanameHassana Ganame
Hassana Ganame
LYLiu Yingzhuang
Liu Yingzhuang
AHAymen Hamrouni
Aymen Hamrouni
HGHakim Ghazzai
Hakim Ghazzai
HCHua Chen
Hua Chen
With the ever-increasing traffic demand of wireless users, resulting from the huge deployment of Internet-of-Things (IoT) devices and the emergence of smart city applications requiring ultra-low latency networks, the Fifth Generation (5G) of cellular networks have been introduced as a revolutionary broadband technology to boost the quality of service of mobile users. In this paper, we investigate the planning process for a 5G radio access network having mmWave Micro Remote Radio Units (mRRUs) on top of sub-6 GHz Macro Remote Radio Units (MRRUs). We rely on proper channel models and link budgets as well as Urban Macro-cells (UMa) and Urban Micro-cells (UMi) characteristics to carefully formulate a 5G network planning optimization problem. We aim to jointly determine the minimum number of MRRUs and mRRUs to install and find their locations in a given geographical area while fulfilling coverage and user traffic demand constraints. In order to solve this planning process, we propose a two-step process where we first employ a low complexity meta-heuristic algorithm to optimize the locations of RRUs followed by an iterative elimination method to remove redundant cells. To evaluate the performances of this proposed approach, we conduct a comparative study using Accelerated Particle Swarm Optimization and Simulated Annealing. Simulations results using sub-6 GHz UMa and 28 GHz UMi demonstrate the ability of the proposed planning approach to achieve more than 98% coverage with minimum cell capacity outage rate, not exceeding the 2%, for different scenarios and illustrate the efficiency of the evolutionary algorithms in solving this NP-hard problem in reasonable running time.

5 October 2022 in IEEE Access
Verified
Journal Article
Open access
AHAymen Hamrouni
Aymen Hamrouni
Abdullah KhanforAbdullah Khanfor
Abdullah Khanfor
HGHakim Ghazzai
Hakim Ghazzai
YMYehia Massoud
Yehia Massoud
Adopting Internet-of-things (IoT) in large-scale environments such as smart cities raises compatibility and trustworthiness challenges, hindering conventional service discovery and network navigability processes. The IoT network is known for its highly dynamic topology and frequently changing characteristics (e.g., the devices’ status, such as battery capacity and computational power); traditional methods fail to learn and understand the evolving behavior of the network to enable real-time and context-aware service discovery in such diverse and large-scale topologies of IoT networks. The Social IoT (SIoT) concept, which defines the relationships among the connected objects, can be exploited to extract established relationships between devices and enable trustworthy and context-aware services. In fact, SIoT expresses the possible connections that devices can establish in the network and reflect compatibility, trustworthiness, and so on. In this paper, we investigate the service discovery process in SIoT networks by proposing a low-complexity context-aware Graph Neural Network (GNN) approach to enable rapid and dynamic service discovery. Unlike the conventional graph-based techniques, the proposed approach simultaneously embeds the devices’ features and their SIoT relations. Our simulations on a real-world IoT dataset show that the proposed GNN-based approach can provide more concise clusters compared to traditional techniques, namely the Louvain and Leiden algorithms. This allows a better IoT network learning and understanding and also, speeds up the service lookup search space. Finally, we discuss implementing the GNN-assisted context-service discovery processes in novel smart city IoT-enabled applications.

1 June 2020
Verified
Conference Paper
Closed access
AKAbdullah Khanfor
Abdullah Khanfor
AHAymen Hamrouni
Aymen Hamrouni
HGHakim Ghazzai
Hakim Ghazzai
YYYe Yang
Ye Yang
YMYehia Massoud
Yehia Massoud
Spatial Mobile Crowdsourcing (SMCS) can be leveraged by exploiting the capabilities of the Social Internet-of-Things (SIoT) to execute spatial tasks. Typically, in SMCS, a task requester aims to recruit a subset of IoT devices and commission them to travel to the task location. However, because of the exponential increase of IoT networks and their diversified devices (e.g., multiple brands, different communication channels, etc.), recruiting the appropriate devices/workers is becoming a challenging task. To this end, in this paper, we develop a recruitment process for SMCS platforms using automated SIoT service discovery to select trustworthy workers satisfying the requester requirements. The method we purpose includes mainly two stages: 1) a worker filtering stage, aiming at reducing the workers’ search space to a subset of potential trustworthy candidates using the Louvain community detection algorithm (CD) applied to SIoT relation graphs. Next, 2) a selection process stage that uses an Integer Linear Program (ILP) to determine the final set of selected devices/workers. The ILP maximizes a worker efficiency metric incorporating the skills/specs level, recruitment cost, and trustworthiness level of the recruited IoT devices. Selected experiments analyze the performance of the proposed CD-ILP algorithm using a real-world dataset and show its superiority in providing an effective recruitment strategy compared to an existing stochastic algorithm.

9 March 2020 in IEEE Access
Verified
Journal Article
Open access
AHAymen Hamrouni
Aymen Hamrouni
HGHakim Ghazzai
Hakim Ghazzai
YMYehia Massoud
Yehia Massoud
Spatial mobile crowdsourcing (SMCS) enables a task requester to commission workers to physically travel to specific locations to perform a set of spatial assignments (i.e., tasks are related to a specific geographical location besides time). To efficiently perform such tasks and guarantee the best possible quality of returned results, optimizing the worker recruitment and task assignment processes must be conducted. Because both workers and task requesters impose certain criteria, this procedure is not obvious. To tackle this issue, we propose a novel formulation of the SMCS recruitment where task matching and worker scheduling are jointly optimized. A Mixed Integer Linear Program (MILP) is first developed to optimally maximize the quality of matching measured as a weighted score function of different recruitment metrics while determining the trajectory of each selected worker executing tasks. To cope with NP-hardness, we propose a heuristic SMCS recruitment approach allowing the achievement of sub-optimal matching and recruitment solution by iteratively solving a weighted bipartite graph problem. Simulation results illustrate the performance of the SMCS framework for selected scenarios and show that our proposed SMCS recruitment algorithm outperforms an existing greedy recruitment approach. Moreover, compared to the optimal MILP solution, the proposed SMCS recruitment approach achieves close results with significant computational time saving.