Simona Viorica Halunga

Dr. Simona Viorica Halunga

Department of Telecommunications, University Politehnica of Bucharest, Bucharest
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
15 August 2024 in IEEE Access
Verified
Journal Article
Open access
Seyed Salar SefatiSeyed Salar Sefati
Seyed Salar Sefati
AHAsim Ul Haq
Asim Ul Haq
NINidhi
Nidhi
Razvan CraciunescuRazvan Craciunescu
Razvan Craciunescu
Simona Viorica HalungaSimona Viorica Halunga
Simona Viorica Halunga
Octavian FratuOctavian Fratu
Octavian Fratu
The transition to 6th Generation (6G) cellular networks offers significant improvements over 5th Generation (5G), enhancing data transfer, reducing latency, and improving network reliability. Advanced Multiple-Input Multiple-Output (MIMO) technology in 6G boosts network efficiency, particularly benefiting Ultra-Reliable Low-Latency Communications (URLLC). This paper reviews literature on resource management in the Internet of Things (IoT) within the 6G context. We categorize the study into four segments: network-aware resource management, dynamic resource allocation, predictive resource distribution based on traffic and architecture, and energy-centric resource allocation considering IoT device mobility and location. We provide a detailed perspective on current research and highlight future research avenues. Key contributions include a comparative study of IoT resource management techniques, an overview of resource management across LTE, 5G, and 6G networks, insights into applications like Intelligent Transportation Systems (ITS), Industrial IoT (IIoT), and Mobile CrowdSensing (MCS), and an emphasis on upcoming challenges. We emphasize the crucial role of efficient resource management in IoT, particularly in the 6G landscape.

1 October 2024 in Smart Cities
Verified
Journal Article
Open access
PDF file
Seyed Salar SefatiSeyed Salar Sefati
Seyed Salar Sefati
Razvan CraciunescuRazvan Craciunescu
Razvan Craciunescu
BABahman Arasteh
Bahman Arasteh
Simona Viorica HalungaSimona Viorica Halunga
Simona Viorica Halunga
Octavian FratuOctavian Fratu
Octavian Fratu
ITIrina Tal
Irina Tal
Smart cities increasingly rely on the Internet of Things (IoT) to enhance infrastructure and public services. However, many existing IoT frameworks face challenges related to security, privacy, scalability, efficiency, and low latency. This paper introduces the Blockchain and Federated Learning for IoT (BFLIoT) framework as a solution to these issues. In the proposed method, the framework first collects real-time data, such as traffic flow and environmental conditions, then normalizes, encrypts, and securely stores it on a blockchain to ensure tamper-proof data management. In the second phase, the Data Authorization Center (DAC) uses advanced cryptographic techniques to manage secure data access and control through key generation. Additionally, edge computing devices process data locally, reducing the load on central servers, while federated learning enables distributed model training, ensuring data privacy. This approach provides a scalable, secure, efficient, and low-latency solution for IoT applications in smart cities. A comprehensive security proof demonstrates BFLIoT’s resilience against advanced cyber threats, while performance simulations validate its effectiveness, showing significant improvements in throughput, reliability, energy efficiency, and reduced delay for smart city applications.

28 June 2022 in Sensors
Verified
Journal Article
Open access
PDF file
Seyed Salar SefatiSeyed Salar Sefati
Seyed Salar Sefati
Simona Viorica HalungaSimona Viorica Halunga
Simona Viorica Halunga
The rapid development of Cloud Computing (CC) has led to the release of many services in the cloud environment. Service composition awareness of Quality of Service (QoS) is a significant challenge in CC. A single service in the cloud environment cannot respond to the complex requests and diverse requirements of the real world. In some cases, one service cannot fulfill the user’s needs, so it is necessary to combine different services to meet these requirements. Many available services provide an enormous QoS and selecting or composing those combined services is called an Np-hard optimization problem. One of the significant challenges in CC is integrating existing services to meet the intricate necessities of different types of users. Due to NP-hard complexity of service composition, many metaheuristic algorithms have been used so far. This article presents the Artificial Bee Colony and Genetic Algorithm (ABCGA) as a metaheuristic algorithm to achieve the desired goals. If the fitness function of the services selected by the Genetic Algorithm (GA) is suitable, a set of services is further introduced for the Artificial Bee Colony (ABC) algorithm to choose the appropriate service from, according to each user’s needs. The proposed solution is evaluated through experiments using Cloud SIM simulation, and the numerical results prove the efficiency of the proposed method with respect to reliability, availability, and cost.

5 January 2023 in Electronics
Verified
Journal Article
Open access
PDF file
OBOmayma BELKADI
Omayma BELKADI
Alexandru VulpeAlexandru Vulpe
Alexandru Vulpe
YLYassin Laaziz
Yassin Laaziz
Simona Viorica HalungaSimona Viorica Halunga
Simona Viorica Halunga
Traffic classification plays an essential role in network security and management; therefore, studying traffic in emerging technologies can be useful in many ways. It can lead to troubleshooting problems, prioritizing specific traffic to provide better performance, detecting anomalies at an early stage, etc. In this work, we aim to propose an efficient machine learning method for traffic classification in an SDN/cloud platform. Traffic classification in SDN allows the management of flows by taking the application’s requirements into consideration, which leads to improved QoS. After our tests were implemented in a cloud/SDN environment, the method that we proposed showed that the supervised algorithms used (Naive Bayes, SVM (SMO), Random Forest, C4.5 (J48)) gave promising results of up to 97% when using the studied features and over 95% when using the generated features.

27 November 2023 in Vehicular Communications
Verified
Journal Article
Open access
CZCiprian Zamfirescu
Ciprian Zamfirescu
RIRadu Iugulescu
Radu Iugulescu
RCRăzvan Crăciunescu
Răzvan Crăciunescu
AVAlexandru Vulpe
Alexandru Vulpe
FLFrank Y. Li
Frank Y. Li
Simona Viorica HalungaSimona Viorica Halunga
Simona Viorica Halunga

6 January 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
BABahman Arasteh
Bahman Arasteh
KAKeyvan Arasteh
Keyvan Arasteh
FKFarzad Kiani
Farzad Kiani
Seyed Salar SefatiSeyed Salar Sefati
Seyed Salar Sefati
Octavian FratuOctavian Fratu
Octavian Fratu
Erfan Babaee TirkolaeeErfan Babaee Tirkolaee
Erfan Babaee Tirkolaee
The process of software development is incomplete without software testing. Software testing expenses account for almost half of all development expenses. The automation of the testing process is seen to be a technique for reducing the cost of software testing. An NP-complete optimization challenge is to generate the test data with the highest branch coverage in the shortest time. The primary goal of this research is to provide test data that covers all branches of a software unit. Increasing the convergence speed, the success rate, and the stability of the outcomes are other goals of this study. An efficient bioinspired technique is suggested in this study to automatically generate test data utilizing the discretized Bat Optimization Algorithm (BOA). Modifying and discretizing the BOA and adapting it to the test generation problem are the main contributions of this study. In the first stage of the proposed method, the source code of the input program is statistically analyzed to identify the branches and their predicates. Then, the developed discretized BOA iteratively generates effective test data. The fitness function was developed based on the program’s branch coverage. The proposed method was implemented along with the previous one. The experiments’ results indicated that the suggested method could generate test data with about 99.95% branch coverage with a limited amount of time (16 times lower than the time of similar algorithms); its success rate was 99.85% and the average number of required iterations to cover all branches is 4.70. Higher coverage, higher speed, and higher stability make the proposed method suitable as an efficient test generation method for real-world large software.