Francesco De Pellegrini
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
Francesco De Pellegrini has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Eitan Altman
INRIA Sophia Antipolis France
4 shared publications - Daniele Miorandi
CREATE-NET
3 shared publications - Corrado Moiso
Telecom Italia
2 shared publications - Imrich Chlamtac
CREATE-NET
2 shared publications - Alan Frank T. Winfield
University of the West of England
1 shared publication - Alberto Coen-Porisini
Dipartimento di Scienze Teoriche ed Applicate, Università degli Studi dell’Insubria, Varese, Italy
1 shared publication
Latest Publications
- 11 May 2016
- Published by Springer Nature in Dynamic Games and Applications
- Vol. 6 (4) , 427-428
Dynamic Games in Novel Networks: Guest Editors’ Forewords
- 11 May 2016
- Published by Springer Nature in Dynamic Games and Applications
- Vol. 6 (4) , 427-428
Dynamic Games in Novel Networks: Guest Editors’ Forewords
- Open Access
- 4 November 2014
- Published by Springer Nature in Information Systems Frontiers
- Vol. 18 (4) , 665-677
A security-and quality-aware system architecture for Internet of Things
- 4 November 2014
- Published by Springer Nature in Information Systems Frontiers
- Vol. 18 (4) , 665-677
Open AccessA security-and quality-aware system architecture for Internet of Things
- 29 August 2012
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 17 (6) , 831-840
Trigger Detection Using Geographical Relation Graph for Social Context Awareness
- 29 August 2012
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 17 (6) , 831-840
Trigger Detection Using Geographical Relation Graph for Social Context Awareness
- 18 July 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 21 (2) , 482-494
Combined Optimal Control of Activation and Transmission in Delay-Tolerant Networks
Performance of a delay-tolerant network has strong dependence on the nodes participating in data transportation. Such networks often face several resource constraints especially related to energy. Energy is consumed not only in data transmission, but also in listening and in several signaling activities. On one hand these activities enhance the system's performance while on the other hand, they consume a significant amount of energy even when they do not involve actual node transmission. Accordingly, in order to use energy efficiently, one may have to limit not only the amount of transmissions, but also the amount of nodes that are active at each time. Therefore, we study two coupled problems: 1) the activation problem that determines when a mobile will turn on in order to receive packets; and 2) the problem of regulating the beaconing. We derive optimal energy management strategies by formulating the problem as an optimal control one, which we then explicitly solve. We also validate our findings through extensive simulations that are based on contact traces.
- 18 July 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 21 (2) , 482-494
Combined Optimal Control of Activation and Transmission in Delay-Tolerant Networks
Performance of a delay-tolerant network has strong dependence on the nodes participating in data transportation. Such networks often face several resource constraints especially related to energy. Energy is consumed not only in data transmission, but also in listening and in several signaling activities. On one hand these activities enhance the system's performance while on the other hand, they consume a significant amount of energy even when they do not involve actual node transmission. Accordingly, in order to use energy efficiently, one may have to limit not only the amount of transmissions, but also the amount of nodes that are active at each time. Therefore, we study two coupled problems: 1) the activation problem that determines when a mobile will turn on in order to receive packets; and 2) the problem of regulating the beaconing. We derive optimal energy management strategies by formulating the problem as an optimal control one, which we then explicitly solve. We also validate our findings through extensive simulations that are based on contact traces.
- 17 December 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 19 (1) , 1-13
Forward Correction and Fountain Codes in Delay-Tolerant Networks
Delay-tolerant ad hoc networks leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease delivery delay, the information to be delivered is replicated in the network. Our objective in this paper is to study a class of replication mechanisms that include coding in order to improve the probability of successful delivery within a given time limit. We propose an analytical approach that allows to quantify tradeoffs between resources and performance measures (energy and delay). We study the effect of coding on the performance of the network while optimizing parameters that govern routing. Our results, based on fluid approximations, are compared to simulations that validate the model.
- 17 December 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 19 (1) , 1-13
Forward Correction and Fountain Codes in Delay-Tolerant Networks
Delay-tolerant ad hoc networks leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease delivery delay, the information to be delivered is replicated in the network. Our objective in this paper is to study a class of replication mechanisms that include coding in order to improve the probability of successful delivery within a given time limit. We propose an analytical approach that allows to quantify tradeoffs between resources and performance measures (energy and delay). We study the effect of coding on the performance of the network while optimizing parameters that govern routing. Our results, based on fluid approximations, are compared to simulations that validate the model.
- Open Access
Dynamic control of Coding in Delay Tolerant Networks
Delay tolerant Networks (DTNs) leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease message delivery delay, the information to be transmitted is replicated in the network. We study replication mechanisms that include Reed-Solomon type codes as well as network coding in order to improve the probability of successful delivery within a given time limit. We propose an analytical approach that allows us to compute the probability of successful delivery. We study the effect of coding on the performance of the network while optimizing parameters that govern routing.
Open AccessDynamic control of Coding in Delay Tolerant Networks
Delay tolerant Networks (DTNs) leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease message delivery delay, the information to be transmitted is replicated in the network. We study replication mechanisms that include Reed-Solomon type codes as well as network coding in order to improve the probability of successful delivery within a given time limit. We propose an analytical approach that allows us to compute the probability of successful delivery. We study the effect of coding on the performance of the network while optimizing parameters that govern routing.
- 27 June 2009
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 14 (4) , 551
RoboComm Editorial
- 27 June 2009
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 14 (4) , 551
RoboComm Editorial
- Open Access
Forward Correction and Fountain codes in Delay Tolerant Networks
Delay tolerant Ad-hoc Networks make use of mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease delivery delay, the information that needs to be delivered is replicated in the network. Our objective in this paper is to study replication mechanisms that include coding in order to improve the probability of successful delivery within a given time limit. We propose an analytical approach that allows to quantify tradeoffs between resources and performance measures (energy and delay). We study the effect of coding on the performance of the network while optimizing parameters that govern routing. Our results, based on fluid approximations, are compared to simulations which validate the model
Open AccessForward Correction and Fountain codes in Delay Tolerant Networks
Delay tolerant Ad-hoc Networks make use of mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease delivery delay, the information that needs to be delivered is replicated in the network. Our objective in this paper is to study replication mechanisms that include coding in order to improve the probability of successful delivery within a given time limit. We propose an analytical approach that allows to quantify tradeoffs between resources and performance measures (energy and delay). We study the effect of coding on the performance of the network while optimizing parameters that govern routing. Our results, based on fluid approximations, are compared to simulations which validate the model
- 1 January 2008
- Published by European Alliance for Innovation n.o.
R-P2P a Data Centric DTN Middleware with Interconnected Throwboxes
- 1 January 2008
- Published by European Alliance for Innovation n.o.
R-P2P a Data Centric DTN Middleware with Interconnected Throwboxes