Simone Silvestri
Research Subjects
Research Interests
Simone Silvestri has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Annalisa Massini
Department of Computer Science, Sapienza University of Rome, Rome, Italy
4 shared publications - Novella Bartolini
Computer Science Department, Sapienza University of Rome, Rome, Italy
4 shared publications - Tiziana Calamoneri
Computer Science Department, Sapienza University of Rome, Rome, Italy
2 shared publications - Emanuele Guido Fusco
Sapienza University of Rome
1 shared publication - Giancarlo Bongiovanni
Department of Computer Science University of Rome "Sapienza" Italy
1 shared publication - Novella Bartolini
Department of Computer Science University of Rome "Sapienza" Italy
1 shared publication
Latest Publications
- 24 December 2011
- Published by Springer Nature in Wireless Networks
- Vol. 18 (4) , 381-399
P&P: an asynchronous and distributed protocol for mobile sensor deployment
- 24 December 2011
- Published by Springer Nature in Wireless Networks
- Vol. 18 (4) , 381-399
P&P: an asynchronous and distributed protocol for mobile sensor deployment
- 29 June 2010
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 16 (1) , 134-145
On Adaptive Density Deployment to Mitigate the Sink-Hole Problem in Mobile Sensor Networks
- 29 June 2010
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 16 (1) , 134-145
On Adaptive Density Deployment to Mitigate the Sink-Hole Problem in Mobile Sensor Networks
- Open Access
P&P protocol: local coordination of mobile sensors for self-deployment
The use of mobile sensors is of great relevance for a number of strategic applications devoted to monitoring critical areas where sensors can not be deployed manually. In these networks, each sensor adapts its position on the basis of a local evaluation of the coverage efficiency, thus permitting an autonomous deployment. Several algorithms have been proposed to deploy mobile sensors over the area of interest. The applicability of these approaches largely depends on a proper formalization of rigorous rules to coordinate sensor movements, solve local conflicts and manage possible failures of communications and devices. In this paper we introduce P&P, a communication protocol that permits a correct and efficient coordination of sensor movements in agreement with the PUSH&PULL algorithm. We deeply investigate and solve the problems that may occur when coordinating asynchronous local decisions in the presence of an unreliable transmission medium and possibly faulty devices such as in the typical working scenario of mobile sensor networks. Simulation results show the performance of our protocol under a range of operative settings, including conflict situations, irregularly shaped target areas, and node failures.
Open AccessP&P protocol: local coordination of mobile sensors for self-deployment
The use of mobile sensors is of great relevance for a number of strategic applications devoted to monitoring critical areas where sensors can not be deployed manually. In these networks, each sensor adapts its position on the basis of a local evaluation of the coverage efficiency, thus permitting an autonomous deployment. Several algorithms have been proposed to deploy mobile sensors over the area of interest. The applicability of these approaches largely depends on a proper formalization of rigorous rules to coordinate sensor movements, solve local conflicts and manage possible failures of communications and devices. In this paper we introduce P&P, a communication protocol that permits a correct and efficient coordination of sensor movements in agreement with the PUSH&PULL algorithm. We deeply investigate and solve the problems that may occur when coordinating asynchronous local decisions in the presence of an unreliable transmission medium and possibly faulty devices such as in the typical working scenario of mobile sensor networks. Simulation results show the performance of our protocol under a range of operative settings, including conflict situations, irregularly shaped target areas, and node failures.
- Open Access
Self-* overload control for distributed web systems
Unexpected increases in demand and most of all flash crowds are considered the bane of every web application as they may cause intolerable delays or even service unavailability. Proper quality of service policies must guarantee rapid reactivity and responsiveness even in such critical situations. Previous solutions fail to meet common performance requirements when the system has to face sudden and unpredictable surges of traffic. Indeed they often rely on a proper setting of key parameters which requires laborious manual tuning, preventing a fast adaptation of the control policies. We contribute an original Self-* Overload Control (SOC) policy. This allows the system to self-configure a dynamic constraint on the rate of admitted sessions in order to respect service level agreements and maximize the resource utilization at the same time. Our policy does not require any prior information on the incoming traffic or manual configuration of key parameters. We ran extensive simulations under a wide range of operating conditions, showing that SOC rapidly adapts to time varying traffic and self-optimizes the resource utilization. It admits as many new sessions as possible in observance of the agreements, even under intense workload variations. We compared our algorithm to previously proposed approaches highlighting a more stable behavior and a better performance.
Open AccessSelf-* overload control for distributed web systems
Unexpected increases in demand and most of all flash crowds are considered the bane of every web application as they may cause intolerable delays or even service unavailability. Proper quality of service policies must guarantee rapid reactivity and responsiveness even in such critical situations. Previous solutions fail to meet common performance requirements when the system has to face sudden and unpredictable surges of traffic. Indeed they often rely on a proper setting of key parameters which requires laborious manual tuning, preventing a fast adaptation of the control policies. We contribute an original Self-* Overload Control (SOC) policy. This allows the system to self-configure a dynamic constraint on the rate of admitted sessions in order to respect service level agreements and maximize the resource utilization at the same time. Our policy does not require any prior information on the incoming traffic or manual configuration of key parameters. We ran extensive simulations under a wide range of operating conditions, showing that SOC rapidly adapts to time varying traffic and self-optimizes the resource utilization. It admits as many new sessions as possible in observance of the agreements, even under intense workload variations. We compared our algorithm to previously proposed approaches highlighting a more stable behavior and a better performance.
- 20 January 2009
- Published by Springer Nature in Wireless Networks
- Vol. 16 (3) , 607-625
Push & Pull: autonomous deployment of mobile sensors for a complete coverage
- 20 January 2009
- Published by Springer Nature in Wireless Networks
- Vol. 16 (3) , 607-625
Push & Pull: autonomous deployment of mobile sensors for a complete coverage