MMMohammed Mahyoub

Mohammed Mahyoub

*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


Mohammed Mahyoub has a total of 24 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • STARS: Stability-Aware SFC Orchestration and Associations in LEO Satellite Networks

    by Mohammed Mahyoub, Wael Jaafar, Sami Muhaidat, Halim Yanikomeroglu

    Low Earth orbit (LEO) satellite networks present critical challenges for security function chain (SFC) orchestra-tion and associations due to rapid topology changes, resource volatility, and heterogeneous service requirements that render conventional SFC optimization approaches ineffective. To tackle this issue, we introduce here STARS, an optimization framework that fundamentally transforms the sequential time-window optimization for SFC orchestration and satellite association through three techniques: 1) Stability-aware regularization that penal-izes configuration changes across time windows, thus reducing handovers by 54% and security function migrations by 33%; 2) Temporal decoupling that leverages solutions from prior time windows as warm-start seeds and dynamic repairing using real-time visibility constraints; and 3) Hierarchical decoupling that separates satellite association and SFC placement into computationally efficient stages, thus reducing time complexity. Through rigorous formulation as a mixed-integer non-linear programming (MINLP) and simulation-based evaluation, STARS achieves a 57% reduction in optimization solution time, a 7% reduction in the load of deployed security function instances, and efficient CPU utilization (9.81% increase) compared to benchmark schemes. STARS delivers these substantial benefits without any degradation in end-to-end delay. Note that the reported performance values are based on our specific system parameter choices and simulation setup and may not be universally representative. The co-design of stability mechanisms and decoupling strategies establishes STARS as a new paradigm for resilient satellite network optimization, balancing optimality, continuity, and computational tractability under high LEO satellite dynamicity.


  • Visibility-Aware User Association and Resource Allocation in Multi-Slice LEO Satellite Networks

    by Mohammed Mahyoub, Halim Yanikomeroglu, Gunes Karabulut Kurt, Stephane Martel

    The low Earth orbit (LEO) satellite megaconstellation can provide ubiquitous coverage and high-performance connectivity, supporting multi-slice applications with various key performance indicator (KPI) requirements. However, due to the dynamic nature of LEO satellites, limited resources, and the diverse demands of different slices, managing user association (UA) and resource allocation becomes an increasingly challenging task in areas with overlapping satellite coverage. This paper proposes a joint optimization model for UA and resource allocation in satellite networks (SLSNs). Based on mixed-integer non-linear programming (MILP), our model minimizes the total propagation delay and optimizes the demand satisfaction ratio (DSR) using a Max-Min approach to ensure each slice meets its unique throughput requirements. In addition, a visibility-aware component is incorporated to prioritize longer satellite visibility, reduce handovers, and improve network stability. Due to the computational complexity of the MILP model, we propose a heuristic-based balanced association with delay-aware bandwidth distribution (B-DAD) approach. B-DAD operates in two phases: the initial UA phase selects satellites based on a combined metric of delay, load, and visibility duration, while the residual bandwidth distribution phase reallocates unused bandwidth among associated users proportionally. Extensive simulations demonstrate that our approaches significantly improve DSR, propagation delays, transmission delays, and network stability compared to the widely adopted benchmark maximum sum of data rate (Max-SR) and Greedy methods under varying elevation angles. Our findings highlight the effectiveness of the MILP model in achieving optimal solutions and the efficiency of B-DAD as a scalable alternative for large-scale scenarios.


  • Open Access

    Joint Satellite Association and SFC Placement with Stability Optimization in LEO Satellite Networks

    by Mohammed Mahyoub, Wael Jaafar, Sami Muhaidat, Halim Yanikomeroglu

    Low Earth orbit (LEO) mega-constellations enable global, low-latency connectivity but challenge the security function chain (SFC) orchestration due to fast-changing visibility, resource volatility, and heterogeneous quality of service (QoS) requirements. To tackle this issue, we present in this paper SATStab, a stability-aware orchestration framework that co-designs: (i) stability-regularized objectives penalizing configuration churn across time windows; (ii) temporal decoupling with visibility-aware repair and warm starts; and (iii) hierarchical decoupling that separates fast association decisions from slower SFC placement and resource allocation. We formulate SATStab as a mixed-integer non-linear programming (MINLP) problem and evaluate it with realistic LEO dynamics. We solve it through a two-stage approach, where in the first stage, we optimize satellite-user associations while in the second stage, we optimize SFC placements. Through extensive simulations, we show that, relative to a monolithic MINLP, SATStab reduces user-satellite handovers by 54.3%, satellite-ground station (GS) re-associations by 59.3%, and SFC migrations by 32.7%, while cutting solution time by 56.8% without degrading end-to-end (E2E) delay. These results prove the efficiency of SATStab in terms of resource orchestration and resilience.

  • Open Access

    STARS: Stability-Aware SFC Orchestration and Associations in LEO Satellite Networks

    by Mohammed Mahyoub, Wael Jafar, Sami Muhaidat, Halim Yanikomeroglu

    Low Earth orbit (LEO) satellite networks present critical challenges for security function chain (SFC) orchestration and associations due to rapid topology changes, resource volatility, and heterogeneous service requirements that render conventional SFC optimization approaches ineffective. To tackle this issue, we introduce here STARS, an optimization framework that fundamentally transforms the sequential time-window optimization for SFC orchestration and satellite association through three techniques: (1) Stability-aware regularization that penalizes configuration changes across time windows, thus reducing handovers by 54% and security function migrations by 33%; (2) Temporal decoupling that leverages solutions from prior time windows as warm-start seeds and dynamic repairing using real-time visibility constraints; and (3) Hierarchical decoupling that separates satellite association and SFC placement into computationally efficient stages, thus reducing time complexity. Through rigorous formulation as a mixed-integer non-linear programming (MINLP) and simulation-based evaluation, STARS achieves a 57% reduction in optimization solution time, a 7% reduction in the load of deployed security function instances, and efficient CPU utilization (9.81% increase) compared to benchmark schemes. STARS delivers these substantial benefits without any degradation in end-to-end delay. Note that the reported performance values are based on our specific system parameter choices and simulation setup and may not be universally representative. The co-design of stability mechanisms and decoupling strategies establishes STARS as a new paradigm for resilient satellite network optimization, balancing optimality, continuity, and computational tractability under high LEO satellite dynamicity.

  • Open Access

    A Security‐Aware Network Function Sharing Model for 5G Slicing

    by Mohammed Mahyoub, AbdulAziz AbdulGhaffar, Emmanuel Alalade, Ashraf Matrawy

    Sharing Virtualized Network Function (VNFs) among different slices in Fifth Generation (5G) is a potential strategy to simplify the system implementation and utilize 5G resources efficiently. In this paper, we propose a security‐aware VNF sharing model for 5G networks. The proposed optimization model satisfies the service requirements of various slices, enhances slice security by isolating their critical VNFs, and enhances resource utilization of the underlying physical infrastructure. The model tries to systematically decide on the sharing of a particular VNF based on two groups of constraints; the first group of constraints is the common assignment constraints used in the existing literature. The second group is the novel security constraints that we propose in this work; the maximum traffic allowed to be processed by the VNF and the exposure of VNF to procedures sourced by untrusted users or access networks. This sharing problem is formalized to allow for procedure‐level modeling that satisfies the requirements of slice requests in 5G systems. The model is tested using standard VNFs and procedures of the 5G system rather than generic ones. The numerical results of the model show the benefits and costs of applying the security constraints along with the network performance in terms of different metrics. The results show that the proposed security constraints significantly enhance the protection of the network slices with an overhead in the number of VNFs ranging from 6.67% to 80%, depending on the configuration used. These results underscore the trade‐off between enhanced security and resource utilization.


  • Cybersecurity Challenge Analysis of Work-From-Anywhere (WFA) and Recommendations Guided by a User Study

    by Mohammed Mahyoub, Ashraf Matrawy, Kamal Isleem, Olakunle Ibitoye

    Many organizations were forced to quickly transition to the work-from-anywhere (WFA) model as a necessity to continue with their operations and remain in business despite the restrictions imposed during the COVID-19 pandemic. Many decisions were made in a rush, and cybersecurity decency tools were not in place to support this transition. In this article, we first attempt to uncover some challenges and implications related to the cybersecurity of the WFA model. Second, we conducted an online user study to investigate the readiness and cybersecurity awareness of employers and their employees who shifted to work remotely from anywhere. The user study questionnaire addressed different resilience perspectives of individuals and organizations. The collected data includes 45 responses from remotely working employees of different organizational types: Universities, government, private, and nonprofit organizations. Despite the importance of security training and guidelines, it was surprising that many participants had not received them. A robust communication strategy is necessary to ensure that employees are informed and updated on security incidents that the organization encounters. In addition, there is an increased need to pay attention to the security-related attributes of employees, such as their behavior, awareness, and compliance. Finally, we outlined best practice recommendations and mitigation tips guided by the study results to help individuals and organizations resist cybercrime and fraud and mitigate WFA-related cybersecurity risks.


  • Open Access

    Assessing Contiki-NG's Reliability for RPL-based Trickle Algorithm in IoT Networks

    by Mohammed Mahyoub, Ashraf Mahmoud

    The IPv6 Routing Protocol for LLNs (RPL) is fundamental to the Internet of Things (IoT), providing essential routing capabilities for devices operating in constrained environments. At the heart of RPL's efficiency is the Trickle Algorithm (TA), designed to optimize the dissemination of control messages across networks, balancing timely updates with the imperative to conserve bandwidth and energy. This paper focuses on validating the implementation of the TA within the Latest version of Contiki-OS (Contiki-NG), a leading experimental platform for IoT networks. By comparing the results of theoretical models with practical simulations of Contiki-NG, we aim to determine the reliability of the Contiki-NG representation of the TA behaviour. Our analysis reveals a high degree of agreement between theoretical expectations and simulated results, underscoring Contiki-NG's robustness as a simulation tool for IoT research. The findings affirm the precision of Contiki-NG implementation and highlight the platform's value in facilitating the development and testing of IoT protocols. By ensuring the reliability of these simulations, our work strengthens the confidence of the IoT research community in using Contiki-NG as a foundation for exploring innovative solutions to the unique challenges of IoT networks.

  • Open Access

    Risk-aware Slicing-based Security Functions Allocation in LEO Satellite Networks

    by Mohammed Mahyoub, Sami Muhaidat, Halim Yanikomeroglu, Gunes Karabulut Kurt

    The integration of low Earth orbit (LEO) satellite communication into 6G networks promises a transformative impact on global connectivity by expanding coverage to remote regions and enhancing service reliability. However, this new infrastructure also introduces significant security challenges due to its expansive attack surface. To address this concern, we propose a dynamic security functions allocation (SFA) model that optimizes the allocation of security functions (SFs) across satellites while considering computational resource limitations, dynamic topology changes, and the visibility constraints of satellite constellations. Our model leverages the flexibility of 6G network slicing (NS) to share non-critical SFs between slices, reducing resource overhead while maintaining essential security demands. To minimize the risk of sharing highly sensitive SFs between slices, our model employs a nonlinear penalty, which prioritizes minimizing risk by aggressively penalizing high-risk SFs sharing. This dynamic risk management framework assesses the probability and impact of security breaches, ensuring that SFs are shared only when the security risk is acceptable, balancing resource efficiency and security. By dynamically adapting to the network's operational conditions, our approach provides a robust framework for efficient and secure satellite communication in 6G networks. Simulation results demonstrate the model's flexibility in managing trade-offs across key network performance metrics.

  • Open Access

    Visibility-Aware User Association and Resource Allocation in Multi-Slice LEO Satellite Networks

    by Mohammed Mahyoub, Halim Yanikomeroglu, Gunes Karabulut Kurt, Stephane Martel

    The low Earth orbit (LEO) satellite megaconstellation can provide ubiquitous coverage and high-performance connectivity, supporting multi-slice applications with various key performance indicator (KPI) requirements. However, due to the dynamic nature of LEO satellites, limited resources, and the diverse demands of different slices, managing user association (UA) and resource allocation becomes an increasingly challenging task in areas with overlapping satellite coverage. This paper proposes a joint optimization model for UA and resource allocation in multi-slice LEO satellite networks (SLSNs). Based on mixed-integer non-linear programming (MILP), our model minimizes the total propagation delay and optimizes the demand satisfaction ratio (DSR) using a Max-Min approach to ensure each slice meets its unique throughput requirements. In addition, a visibility-aware component is incorporated to prioritize longer satellite visibility, reduce handovers, and improve network stability. Due to the computational complexity of the MILP model, we propose a heuristic-based balanced association with delay-aware bandwidth distribution (B-DAD) approach. B-DAD operates in two phases: the initial UA phase selects satellites based on a combined metric of delay, load, and visibility duration, while the residual bandwidth distribution phase reallocates unused bandwidth among associated users proportionally. Extensive simulations demonstrate that our approaches significantly improve DSR, propagation delays, transmission delays, and network stability compared to the widely adopted benchmark maximum sum of data rate (Max-SR) method under varying elevation angles. Our findings highlight the effectiveness of the MILP model in achieving optimal solutions and the efficiency of B-DAD as a scalable alternative for large-scale scenarios.