Basilis Mamalis
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
Research Subjects
Basilis Mamalis has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Grammati Pantziou
Department of Informatics and Computer Engineering, University of West Attica, Athens, Greece
12 shared publications - Charalampos Konstantopoulos
Department of Informatics, University of Piraeus, Piraeus, Greece
7 shared publications - Damianos Gavalas
Department of Product and Systems Design Engineering, University of the Aegean, Syros, Greece
7 shared publications - Marios Perlitis
Democritus University of Thrace University Campus 69100 Komotini Greece
3 shared publications - Apostolos Anagnostopoulos
University of West Attica, Athens, Greece
2 shared publications - Charalampos Konstantopoulos
Computer Technology Institute Patras Greece
1 shared publication
Latest Publications
- Open Access
- 9 November 2026
- Published by MDPI AG in Algorithms
- Vol. 19 (11) , 975
Stability and Trust-Aware Multi-Hop Vehicular Clustering with Parent Persistence
This study specifies a multi-hop vehicular clustering algorithm combining a stability factor (SF), parent persistence under a hysteresis margin, trust-gated parent eligibility and road-side-unit (RSU)-assisted maintenance. Five stateful implementations are compared across four scenarios with 20 paired seeds per condition. Counting singleton heads, SF’s CH tenure is longest on the baseline and high-inflow highways (restricted mean to 120 s: about 52 s versus 21–37 s), but not on the low-inflow highway or the urban arterial. This head-level advantage does not extend to cluster affiliation. SF’s urban direct-parent persistence (70.19 s) exceeds MCSC and Center-based but not Weighted-MR (90.95 s). SF has higher root-change rates in ten of sixteen contrasts and shorter fixed-root membership persistence in thirteen. In a controlled study, composite SF reduces root changes relative to mobility-only scoring by 9–11 per 1000 vehicle-seconds at h = 0.08, versus 133–313 from the margin. Degree-only contrasts confound scoring with effective retention. Nominal trust filtering reduces the dropped-attempt fraction from 15.62% to 0.37%, but erroneous penalties still reduce honest-parent eligibility.
- 9 November 2026
- Published by MDPI AG in Algorithms
- Vol. 19 (11) , 975
Open AccessStability and Trust-Aware Multi-Hop Vehicular Clustering with Parent Persistence
This study specifies a multi-hop vehicular clustering algorithm combining a stability factor (SF), parent persistence under a hysteresis margin, trust-gated parent eligibility and road-side-unit (RSU)-assisted maintenance. Five stateful implementations are compared across four scenarios with 20 paired seeds per condition. Counting singleton heads, SF’s CH tenure is longest on the baseline and high-inflow highways (restricted mean to 120 s: about 52 s versus 21–37 s), but not on the low-inflow highway or the urban arterial. This head-level advantage does not extend to cluster affiliation. SF’s urban direct-parent persistence (70.19 s) exceeds MCSC and Center-based but not Weighted-MR (90.95 s). SF has higher root-change rates in ten of sixteen contrasts and shorter fixed-root membership persistence in thirteen. In a controlled study, composite SF reduces root changes relative to mobility-only scoring by 9–11 per 1000 vehicle-seconds at h = 0.08, versus 133–313 from the margin. Degree-only contrasts confound scoring with effective retention. Nominal trust filtering reduces the dropped-attempt fraction from 15.62% to 0.37%, but erroneous penalties still reduce honest-parent eligibility.
- Open Access
- 24 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 55-60
A Comparative Study of Virtual Machine Allocation Policies in Cloud Computing Environments
- 24 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 55-60
Open AccessA Comparative Study of Virtual Machine Allocation Policies in Cloud Computing Environments
- Open Access
Steady and Energy-Efficient Multi-Hop Clustering for Flying Ad-Hoc Networks (FANETs)
Flying Ad-hoc Networks (FANETs), formed by Unmanned Aerial Vehicles (UAVs), represent an emerging and promising communication paradigm. These networks face unique challenges due to UAVs high mobility, limited energy resources, and dynamic topology. In this work, we propose a novel multi-hop clustering algorithm aimed at creating stable, energy-efficient clusters in FANET environments. The proposed solution enhances cluster longevity and communication efficiency through mobility-aware clustering, energy-centric cluster head (CH) selection, and a ground station(GS)-assisted cluster maintenance management mechanism. First, steady multi-hop clusters are constructed, having CHs with not only high stability and high energy but also with steady and high-energy neighboring areas, and then a proper GS-assisted cluster maintenance mechanism is applied. Experimental results, based on extended simulations, demonstrate that our approach outperforms existing schemes significantly, in terms of cluster stability, communication overhead, and security resilience.
Open AccessSteady and Energy-Efficient Multi-Hop Clustering for Flying Ad-Hoc Networks (FANETs)
Flying Ad-hoc Networks (FANETs), formed by Unmanned Aerial Vehicles (UAVs), represent an emerging and promising communication paradigm. These networks face unique challenges due to UAVs high mobility, limited energy resources, and dynamic topology. In this work, we propose a novel multi-hop clustering algorithm aimed at creating stable, energy-efficient clusters in FANET environments. The proposed solution enhances cluster longevity and communication efficiency through mobility-aware clustering, energy-centric cluster head (CH) selection, and a ground station(GS)-assisted cluster maintenance management mechanism. First, steady multi-hop clusters are constructed, having CHs with not only high stability and high energy but also with steady and high-energy neighboring areas, and then a proper GS-assisted cluster maintenance mechanism is applied. Experimental results, based on extended simulations, demonstrate that our approach outperforms existing schemes significantly, in terms of cluster stability, communication overhead, and security resilience.
- Open Access
- 13 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 370-376
Smart Forest Fire Monitoring and Detection System using Microservices and Container-based Virtualization
- 13 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 370-376
Open AccessSmart Forest Fire Monitoring and Detection System using Microservices and Container-based Virtualization
- Open Access
A Combined Environmental Monitoring Framework based on WSN Clustering and VANET Edge Computation Offloading
Wireless Sensor Networks (WSN) and Vehicular Ad-hoc Networks (VANET) have been extensively used in IoT applications for environmental monitoring, especially in rural and agricultural areas. In this paper we present a novel combined approach which uses both WSN and VANET clustered structures for the efficient gathering and processing of environmental parameters in long eNodeB/RSU-enabled roads/highways, which cross large rural areas. The former (WSNs) is used for traditional sensing and data gathering, whereas the latter (VANET) is used for both (a) performing intermediate processing based on modern edge computation offloading techniques, and (b) propagating the data (either raw data or computed results) to the residing eNodeB/RSUs. Extended experimental measurements, taken via the combined use of SUMO and Veins simulation platforms (and focusing in the air quality monitoring experimental case), demonstrate the high efficiency and scalability of the presented approach over very large deployment areas.
Open AccessA Combined Environmental Monitoring Framework based on WSN Clustering and VANET Edge Computation Offloading
Wireless Sensor Networks (WSN) and Vehicular Ad-hoc Networks (VANET) have been extensively used in IoT applications for environmental monitoring, especially in rural and agricultural areas. In this paper we present a novel combined approach which uses both WSN and VANET clustered structures for the efficient gathering and processing of environmental parameters in long eNodeB/RSU-enabled roads/highways, which cross large rural areas. The former (WSNs) is used for traditional sensing and data gathering, whereas the latter (VANET) is used for both (a) performing intermediate processing based on modern edge computation offloading techniques, and (b) propagating the data (either raw data or computed results) to the residing eNodeB/RSUs. Extended experimental measurements, taken via the combined use of SUMO and Veins simulation platforms (and focusing in the air quality monitoring experimental case), demonstrate the high efficiency and scalability of the presented approach over very large deployment areas.
- Open Access
- 24 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 185-192
Smart Waste Management Using Microservices and Container-based Virtualization
- 24 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 185-192
Open AccessSmart Waste Management Using Microservices and Container-based Virtualization
- Open Access
Improved Task Scheduling for Virtual Machines in the Cloud based on the Gravitational Search Algorithm
The rapid and convenient provision of the available computing resources is a crucial requirement in modern cloud computing environments. However, if only the execution time is taken into account when the resources are scheduled, it could lead to imbalanced workloads as well as to significant under-utilisation of the involved Virtual Machines (VMs). In the present work a novel task scheduling scheme is introduced, which is based on the proper adaptation of a modern and quite effective evolutionary optimization method, the Gravitational Search Algorithm (GSA). The proposed scheme aims at optimizing the entire scheduling procedure, in terms of both the tasks execution time and the system (VMs) resource utilisation. Moreover, the fitness function was properly selected considering both the above factors in an appropriately weighted function in order to obtain better results for large inputs. Sufficient simulation experiments show the efficiency of the proposed scheme, as well as its excellence over related approaches of the bibliography, with similar objectives.
Open AccessImproved Task Scheduling for Virtual Machines in the Cloud based on the Gravitational Search Algorithm
The rapid and convenient provision of the available computing resources is a crucial requirement in modern cloud computing environments. However, if only the execution time is taken into account when the resources are scheduled, it could lead to imbalanced workloads as well as to significant under-utilisation of the involved Virtual Machines (VMs). In the present work a novel task scheduling scheme is introduced, which is based on the proper adaptation of a modern and quite effective evolutionary optimization method, the Gravitational Search Algorithm (GSA). The proposed scheme aims at optimizing the entire scheduling procedure, in terms of both the tasks execution time and the system (VMs) resource utilisation. Moreover, the fitness function was properly selected considering both the above factors in an appropriately weighted function in order to obtain better results for large inputs. Sufficient simulation experiments show the efficiency of the proposed scheme, as well as its excellence over related approaches of the bibliography, with similar objectives.
- Open Access
- 25 November 2022
- Published by Association for Computing Machinery (ACM)
- p. 175-180
A Cluster-based Virtual Edge Computation Offloading Scheme for MEC-enabled Vehicular Networks
- 25 November 2022
- Published by Association for Computing Machinery (ACM)
- p. 175-180
Open AccessA Cluster-based Virtual Edge Computation Offloading Scheme for MEC-enabled Vehicular Networks
- Open Access
- 25 November 2022
- Published by Association for Computing Machinery (ACM)
- p. 329-334
An Indicative Demanding Teaching Scenario for Primary Education with the Support of a Multi-layer Fog Computing Architecture
Fog computing is a new, modern type of computing that distributes some of the storage, estimation, and processing constraints of cloud computing closer to the edge of the network. The impact of Cloud and Fog Computing in an educational context is now more important than ever. This paper presents innovative designed services of fog computing techniques in the educational sector. An original educational scenario is described, based on innovative fog computing techniques and the appropriate use of online collaborative learning tools. The aim of the paper is to propose an appropriate fog-based architecture to support education in Primary and Secondary Education as well as to provide appropriate recommendations and present some indicative education scenarios implemented based on the use of cloud and fog computing. The proposed scenario is properly documented, while specific implementation issues are presented and analyzed.
- 25 November 2022
- Published by Association for Computing Machinery (ACM)
- p. 329-334
Open AccessAn Indicative Demanding Teaching Scenario for Primary Education with the Support of a Multi-layer Fog Computing Architecture
Fog computing is a new, modern type of computing that distributes some of the storage, estimation, and processing constraints of cloud computing closer to the edge of the network. The impact of Cloud and Fog Computing in an educational context is now more important than ever. This paper presents innovative designed services of fog computing techniques in the educational sector. An original educational scenario is described, based on innovative fog computing techniques and the appropriate use of online collaborative learning tools. The aim of the paper is to propose an appropriate fog-based architecture to support education in Primary and Secondary Education as well as to provide appropriate recommendations and present some indicative education scenarios implemented based on the use of cloud and fog computing. The proposed scenario is properly documented, while specific implementation issues are presented and analyzed.
- Open Access
A Hybrid Multi-GPU Implementation of Simplex Algorithm with CPU Collaboration
The simplex algorithm has been successfully used for many years in solving linear programming (LP) problems. Due to the intensive computations required (especially for the solution of large LP problems), parallel approaches have also extensively been studied. The computational power provided by the modern GPUs as well as the rapid development of multicore CPU systems have led OpenMP and CUDA programming models to the top preferences during the last years. However, the desired efficient collaboration between CPU and GPU through the combined use of the above programming models is still considered a hard research problem. In the above context, we demonstrate here an excessively efficient implementation of standard simplex, targeting to the best possible exploitation of the concurrent use of all the computing resources, on a multicore platform with multiple CUDA-enabled GPUs. More concretely, we present a novel hybrid collaboration scheme which is based on the concurrent execution of suitably spread CPU-assigned (via multithreading) and GPU-offloaded computations. The experimental results extracted through the cooperative use of OpenMP and CUDA over a notably powerful modern hybrid platform (consisting of 32 cores and two high-spec GPUs, Titan Rtx and Rtx 2080Ti) highlight that the performance of the presented here hybrid GPU/CPU collaboration scheme is clearly superior to the GPU-only implementation under almost all conditions. The corresponding measurements validate the value of using all resources concurrently, even in the case of a multi-GPU configuration platform. Furthermore, the given implementations are completely comparable (and slightly superior in most cases) to other related attempts in the bibliography, and clearly superior to the native CPU-implementation with 32 cores.
Open AccessA Hybrid Multi-GPU Implementation of Simplex Algorithm with CPU Collaboration
The simplex algorithm has been successfully used for many years in solving linear programming (LP) problems. Due to the intensive computations required (especially for the solution of large LP problems), parallel approaches have also extensively been studied. The computational power provided by the modern GPUs as well as the rapid development of multicore CPU systems have led OpenMP and CUDA programming models to the top preferences during the last years. However, the desired efficient collaboration between CPU and GPU through the combined use of the above programming models is still considered a hard research problem. In the above context, we demonstrate here an excessively efficient implementation of standard simplex, targeting to the best possible exploitation of the concurrent use of all the computing resources, on a multicore platform with multiple CUDA-enabled GPUs. More concretely, we present a novel hybrid collaboration scheme which is based on the concurrent execution of suitably spread CPU-assigned (via multithreading) and GPU-offloaded computations. The experimental results extracted through the cooperative use of OpenMP and CUDA over a notably powerful modern hybrid platform (consisting of 32 cores and two high-spec GPUs, Titan Rtx and Rtx 2080Ti) highlight that the performance of the presented here hybrid GPU/CPU collaboration scheme is clearly superior to the GPU-only implementation under almost all conditions. The corresponding measurements validate the value of using all resources concurrently, even in the case of a multi-GPU configuration platform. Furthermore, the given implementations are completely comparable (and slightly superior in most cases) to other related attempts in the bibliography, and clearly superior to the native CPU-implementation with 32 cores.