Distributed estimation of global parameters in delay-tolerant networks

Guerrieri, Alessio; Carreras, Iacopo; Pellegrini, Francesco De; Miorandi, Daniele; Montresor, Alberto

doi:10.1016/j.comcom.2010.01.019

Cited by 18 publications

(10 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, we extend the approach in [15] leveraging stochastic approximation algorithms because they overcome the explicit estimation of network parameters. In fact, such an estimation is per se a difficult task in disconnected systems [16]. Furthermore, we observe that this operation becomes critical in the case of multiple classes of mobiles since a number of such estimates would be required.…”

Section: Related Work and Contributionmentioning

confidence: 99%

Online Algorithms for Adaptive Optimization in Heterogeneous Delay Tolerant Networks

Chahin¹,

Pellegrini²,

El-Azouzi³

et al. 2013

ICST Trans Mobile Comm Appl

View full text Add to dashboard Cite

Delay Tolerant Networks (DTNs) are an emerging type of networks which do not need a predefined infrastructure. In fact, data forwarding in DTNs relies on the contacts among nodes which may possess different features, radio range, battery consumption and radio interfaces. On the other hand, efficient message delivery under limited resources, e.g., battery or storage, requires to optimize forwarding policies. We tackle optimal forwarding control for a DTN composed of nodes of different types, forming a so-called heterogeneous network. Using our model, we characterize the optimal policies and provide a suitable framework to design a new class of multi-dimensional stochastic approximation algorithms working for heterogeneous DTNs. Crucially, our proposed algorithms drive online the source node to the optimal operating point without requiring explicit estimation of network parameters. A thorough analysis of the convergence properties and stability of our algorithms is presented.

show abstract

Section: Related Work and Contributionmentioning

confidence: 99%

Online Algorithms for Adaptive Optimization in Heterogeneous Delay Tolerant Networks

Chahin¹,

Pellegrini²,

El-Azouzi³

et al. 2013

ICST Trans Mobile Comm Appl

View full text Add to dashboard Cite

show abstract

“…Furthermore, the authors show that when the parameters are unknown it is still possible to obtain a policy that converges to the optimal one by using some adaptive autotuning mechanism. Extensions of such adaptive mechanism are proposed in [14].…”

Section: Related Workmentioning

confidence: 99%

Algorithms to Find Two-Hop Routing Policies in Multiclass Delay Tolerant Networks

Basilico

Cesana

Gatti

2016

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-Most of the literature on delay tolerant networks (DTNs) focuses on optimal routing policies exploiting a priori knowledge about nodes mobility traces. For the case in which no a priori knowledge is available (very common in practice), apart from basic epidemic routing, the main approaches focus on controlling two-hop routing policies. However, these latter results commonly employ fluid approximation techniques, which, in principle, do not provide any theoretical bound over the approximation ratio. In our work, we focus on the case without a priori mobility knowledge and we provide approximation algorithms with theoretical guarantees that can be applied to cases where the number of hops allowed in the routing process is arbitrary. Our approach is rather flexible allowing us to address heterogeneous mobility patterns and transmission technologies, to consider explicitly the signaling and transmission costs, and to include also nodes discarding packets after a local timeout. We then provide a comprehensive performance evaluation of our algorithms, showing that two-hop routing provides the best tradeoff between delay and energy and that, in this case, they find solutions very close to the optimal ones with a low overhead. Finally, we compare our methods against some state-of-the-art approaches by means of a DTN simulation environment in realistic settings.

show abstract

“…By assigning a 1 or 0 to the initial weight of one or all of the nodes, the algorithm either sums or averages. Finally, Guerrieri et al [8] studied the performance of both an averaging-based gossiping algorithm and three variations on a token collecting algorithm in delay-tolerant networks.…”

Section: Related Workmentioning

confidence: 99%

Gossip-Based Counting in Dynamic Networks

2012

View full text Add to dashboard Cite

Abstract. We propose Gossipico, a gossip algorithm to average, sum or find minima and maxima over node values in a large, distributed, and dynamic network. Unlike previous work, Gossipico provides a continuous estimate of, for example, the number of nodes, even when the network becomes disconnected. Gossipico converges quickly due to the introduction of a beacon mechanism that directs messages to an autonomously selected beacon node. The information spread through the network shows a percolation-like phase-transition and allows information to propagate along near-shortest paths. Simulations in various different network topologies (ranging in size up to one million nodes) illustrate Gossipico's robustness against network changes and display a near-optimal count time. Moreover, in a comparison with other related gossip algorithms, Gossipico displays an improved and more stable performance over various classes of networks.

show abstract

Distributed estimation of global parameters in delay-tolerant networks

Abstract: Abstract

Cited by 18 publications

References 29 publications

Online Algorithms for Adaptive Optimization in Heterogeneous Delay Tolerant Networks

Online Algorithms for Adaptive Optimization in Heterogeneous Delay Tolerant Networks

Algorithms to Find Two-Hop Routing Policies in Multiclass Delay Tolerant Networks

Gossip-Based Counting in Dynamic Networks

Contact Info

Product

Resources

About