Sara Berri
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
Sara Berri has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Arsenia Chorti
Équipes Traitement de l'Information et Systèmes (ETIS), UMR 8051, École Nationale Supérieure de l'Électronique et de ses Applications (ENSEA), Centre National de la Recherche Scientifique (CNRS), CY Cergy Paris University, Cergy, France
2 shared publications Houda Labiod
Institute Polytechnic of Paris, INFRES, Telecom Paris, Palaiseau, France
2 shared publications- Jun Zhang
Telecom ParisTech, University of Paris-Saclay, France
2 shared publications - Bac Trinh-Nguyen
ETIS UMR 8051/CY Paris University, ENSEA, CNRS
1 shared publication Brahim Bensaou
Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, SAR, Hong Kong
1 shared publication- Brahim Bensaou
Department of Computer Science and Engineering, The Hong Kong University of Science and Technology
1 shared publication
Latest Publications
- 13 October 2025
- Published by Springer Nature
- p. 55-72
A Framework for Global Trust and Reputation Management in 6G Networks
- 13 October 2025
- Published by Springer Nature
- p. 55-72
A Framework for Global Trust and Reputation Management in 6G Networks
- 19 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Networking Letters
- Vol. 6 (3) , 163-167
Efficient Online Slice Admission Control Scheme in Next Generation Networks
This paper proposes a slice admission control scheme to maximize profit and resource utilization. It considers an online scenario where the infrastructure provider (InP) does not have full knowledge of future requests and requests can renege after their waiting time is exceeded. Moreover, it employs a dynamic priority and a capacity sharing mechanism to buy back idle resources from already accepted slices. The performance evaluation demonstrates that the proposed algorithm yields about 26%, 7%, and 7.3% higher profit, acceptance rate and resource utilization gains over the state of the art schemes, respectively.
- 19 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Networking Letters
- Vol. 6 (3) , 163-167
Efficient Online Slice Admission Control Scheme in Next Generation Networks
This paper proposes a slice admission control scheme to maximize profit and resource utilization. It considers an online scenario where the infrastructure provider (InP) does not have full knowledge of future requests and requests can renege after their waiting time is exceeded. Moreover, it employs a dynamic priority and a capacity sharing mechanism to buy back idle resources from already accepted slices. The performance evaluation demonstrates that the proposed algorithm yields about 26%, 7%, and 7.3% higher profit, acceptance rate and resource utilization gains over the state of the art schemes, respectively.
- 13 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (10) , 18535-18545
Preserving Location-Privacy in Vehicular Networks via Reinforcement Learning
In vehicular networks, the benefits of jointly-optimizing data prefetching and caching with broadcast transmission scheduling and rate adaptation strategies at road-side units (RSUs) have already been demonstrated in the literature. Nevertheless, the effectiveness of the solution depends greatly on the accurate knowledge of vehicular trajectories. In practice, as specified in the standards, this is at odds with the important issue of privacy. One of the main contributions of this work is to address this issue by providing a scheme that jointly optimizes the throughput of broadcast-transmission scheduling from RSUs to vehicles, and the privacy of vehicles’ locations, by enabling them to disseminate obfuscated locations to the server from time to time. We formulate this problem as a reinforcement learning (RL) problem, where the vehicles learn when to report obfuscated locations, in order to maximize a utility that encompasses both the network capacity (related to vehicles’ throughput) and the level of privacy achieved. The proposed scheme is shown to consistently outperform alternative randomized schemes considered in past work, and in particular it proves to be robust against prediction errors of the future locations of the vehicles.
- 13 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (10) , 18535-18545
Preserving Location-Privacy in Vehicular Networks via Reinforcement Learning
In vehicular networks, the benefits of jointly-optimizing data prefetching and caching with broadcast transmission scheduling and rate adaptation strategies at road-side units (RSUs) have already been demonstrated in the literature. Nevertheless, the effectiveness of the solution depends greatly on the accurate knowledge of vehicular trajectories. In practice, as specified in the standards, this is at odds with the important issue of privacy. One of the main contributions of this work is to address this issue by providing a scheme that jointly optimizes the throughput of broadcast-transmission scheduling from RSUs to vehicles, and the privacy of vehicles’ locations, by enabling them to disseminate obfuscated locations to the server from time to time. We formulate this problem as a reinforcement learning (RL) problem, where the vehicles learn when to report obfuscated locations, in order to maximize a utility that encompasses both the network capacity (related to vehicles’ throughput) and the level of privacy achieved. The proposed scheme is shown to consistently outperform alternative randomized schemes considered in past work, and in particular it proves to be robust against prediction errors of the future locations of the vehicles.
- 1 April 2022
- Published by Elsevier in Vehicular Communications
- Vol. 34
Network slicing with load-balancing for task offloading in vehicular edge computing
- 1 April 2022
- Published by Elsevier in Vehicular Communications
- Vol. 34
Network slicing with load-balancing for task offloading in vehicular edge computing
- 1 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (4) , 4348-4358
Joint Content-Prefetching, Transmission Scheduling, and Rate Adaptation in Vehicular Networks
Content prefetching at road side units (RSUs) in vehicular networks can improve users’ experience by reducing the average data access latency. Prefetching algorithms proposed in the literature usually rely on a fixed modulation scheme, that corresponds to the lowest possible data rate for RSU-to-vehicles transmission. As a consequence, the network bandwidth is often inefficiently used. In this article, we propose to study the problem of efficient content broadcasting in vehicular networks and express it as a joint data-prefetching and broadcast transmission scheduling optimization problem, subject to cache size constraints and transmission rate adaptation constraints. In our study we consider a highway scenario covered by several RSUs, and take into account the deadline requirement of interactive applications. We express the problem as an integer linear programming problem, and solve it using a heuristic algorithm that determines: the content prefetching schedule, the broadcast transmission schedule and the rate adaptation schedule sequentially. Simulation results show that, i) it is beneficial to use adaptive rates to broadcast data instead of relying on single-rate with unicast transmissions; ii) using vehicular trajectories and content popularity in conjunction yields better results than simply relying on content popularity for content prefetching and caching; and iii) this holds even with inaccurately predicted vehicle locations and with delay-sensitive contents.
- 1 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (4) , 4348-4358
Joint Content-Prefetching, Transmission Scheduling, and Rate Adaptation in Vehicular Networks
Content prefetching at road side units (RSUs) in vehicular networks can improve users’ experience by reducing the average data access latency. Prefetching algorithms proposed in the literature usually rely on a fixed modulation scheme, that corresponds to the lowest possible data rate for RSU-to-vehicles transmission. As a consequence, the network bandwidth is often inefficiently used. In this article, we propose to study the problem of efficient content broadcasting in vehicular networks and express it as a joint data-prefetching and broadcast transmission scheduling optimization problem, subject to cache size constraints and transmission rate adaptation constraints. In our study we consider a highway scenario covered by several RSUs, and take into account the deadline requirement of interactive applications. We express the problem as an integer linear programming problem, and solve it using a heuristic algorithm that determines: the content prefetching schedule, the broadcast transmission schedule and the rate adaptation schedule sequentially. Simulation results show that, i) it is beneficial to use adaptive rates to broadcast data instead of relying on single-rate with unicast transmissions; ii) using vehicular trajectories and content popularity in conjunction yields better results than simply relying on content popularity for content prefetching and caching; and iii) this holds even with inaccurately predicted vehicle locations and with delay-sensitive contents.
- Open Access
- 3 June 2019
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2019 (1)
Efficient packet transmission in wireless ad hoc networks with partially informed nodes
- 3 June 2019
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2019 (1)
Open AccessEfficient packet transmission in wireless ad hoc networks with partially informed nodes
- 24 March 2016
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 50 (2) , 285-296
Security modeling of anad hocnetwork under the constraint of energy by an approach in two steps: Clustering-Evolutionary game
Ad hoc networks are subject to multiple challenges, particularly the problem of limited resources such as energy and vulnerability in terms of security. Indeed, the nodes are subject to various attacks and malicious actions. Thus, each mobile is confronted with a dilemma: cooperate to ensure security, in this case the node spend a part of its energy, or not cooperate which allows it to save energy but making the security of the network more vulnerable. In this work, we develop an approach which takes into account two conflicting objectives: contribute to network security while reducing energy consumption. The approach is based on alternating two steps: Clustering-Evolutionary game. The clustering step is performed by an algorithm that takes into account the energy constraint in election of cluster-heads. The interactions between each pair of cluster-heads, when exchanging data, in their contribution to the security of the network, are modeled as an evolutionary game which is the second step of the proposed approach.
- 24 March 2016
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 50 (2) , 285-296
Security modeling of anad hocnetwork under the constraint of energy by an approach in two steps: Clustering-Evolutionary game
Ad hoc networks are subject to multiple challenges, particularly the problem of limited resources such as energy and vulnerability in terms of security. Indeed, the nodes are subject to various attacks and malicious actions. Thus, each mobile is confronted with a dilemma: cooperate to ensure security, in this case the node spend a part of its energy, or not cooperate which allows it to save energy but making the security of the network more vulnerable. In this work, we develop an approach which takes into account two conflicting objectives: contribute to network security while reducing energy consumption. The approach is based on alternating two steps: Clustering-Evolutionary game. The clustering step is performed by an algorithm that takes into account the energy constraint in election of cluster-heads. The interactions between each pair of cluster-heads, when exchanging data, in their contribution to the security of the network, are modeled as an evolutionary game which is the second step of the proposed approach.