Results 1 - 10 of 1,345,930

Probabilistic Routing in Intermittently Connected Networks

by Anders Lindgren, Avri Doria, Olov Schelen - SIGMOBILE Mobile Computing and Communication Review , 2004
"... In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does ..."
Abstract - Cited by 633 (6 self) - Add to MetaCart
In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts

Probabilistic Routing in Intermittently Connected Networks

by unknown authors
"... Abstract—In this paper we consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. Ther ..."
Abstract - Add to MetaCart
Abstract—In this paper we consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts

Poster: Probabilistic Routing in Intermittently Connected Networks

by Anders Lindgren, Avri Doria, Olov Schelén - SIGMOBILE Mobile Computing and Communication Review , 2003
"... We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts. We propose a probabilistic r ..."
Abstract - Cited by 10 (1 self) - Add to MetaCart
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts. We propose a probabilistic

Quality of Service and Capacity in Constrained Intermittent-Connectivity Networks

by Tara Small, Zygmunt J. Haas - IEEE Transactions on Mobile Computing
"... Abstract—In an intermittent-connectivity network, there rarely exists a connected path between a source node and its destination. These networks arise frequently when each node has a limited transmission range, such as a communication network between separated villages or a surveillance network with ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
Abstract—In an intermittent-connectivity network, there rarely exists a connected path between a source node and its destination. These networks arise frequently when each node has a limited transmission range, such as a communication network between separated villages or a surveillance network

Modeling tradeoffs in intermittent-connectivity networks

by Michelle Small, Tara Michelle Small, Ph. D , 2005
"... Wireless and mobile network technologies often impose severe resource limitations, resulting in poor and often unsatisfactory performance of the commonly used wire-less networking protocols. For instance, power and memory/storage constraints of miniaturized network nodes reduce the throughput and in ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Wireless and mobile network technologies often impose severe resource limitations, resulting in poor and often unsatisfactory performance of the commonly used wire-less networking protocols. For instance, power and memory/storage constraints of miniaturized network nodes reduce the throughput

Broadcast Delay of Epidemic Routing in Intermittently Connected Networks

by Philippe Jacquet, Bernard Mans, Georgios Rodolakis , 2009
"... We analyze the performance of epidemic routing in large-scale intermittently connected networks, under a random geometric graph model and for different mobility parameters (such as the random-waypoint, random walk and Brownian motion models). We derive a generic scaling law on the delay, which prov ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We analyze the performance of epidemic routing in large-scale intermittently connected networks, under a random geometric graph model and for different mobility parameters (such as the random-waypoint, random walk and Brownian motion models). We derive a generic scaling law on the delay, which

Worst-case Latency of Broadcast in Intermittently Connected Networks

by Mikael Asplund, Simin Nadjm-tehrani
"... Abstract Worst-case latency is an important characteristic of information dissemina-tion protocols. However, in sparse mobile ad hoc networks where end-to-end connectivity cannot be achieved and store-carry-forward algorithms are needed, such worst-case anal-yses have not been possible to perform on ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
on real mobility traces due to lack of suitable models. We propose a new metric called delay expansion that reflects connectivity and reachability properties of intermittently connected networks. Using the delay expansion, we show how bounds on worst-case latency can be derived for a general class

Retiring replicants: Congestion control for intermittently-connected networks

by Nathanael Thompson, Samuel C. Nelson, Mehedi Bakht, Tarek Abdelzaher, Robin Kravets - In IEEE Infocom , 2010
"... Abstract—The widespread availability of mobile wireless devices offers growing opportunities for the formation of temporary networks with only intermittent connectivity. These intermittently-connected networks (ICNs) typically lack stable end-to-end paths. In order to improve the delivery rates of t ..."
Abstract - Cited by 17 (3 self) - Add to MetaCart
Abstract—The widespread availability of mobile wireless devices offers growing opportunities for the formation of temporary networks with only intermittent connectivity. These intermittently-connected networks (ICNs) typically lack stable end-to-end paths. In order to improve the delivery rates

Probabilistic Routing Protocol for Intermittently Connected Networks

by E. Davies, S. Grasic , 2010
"... draft-irtf-dtnrg-prophet-08 This document is a product of the Delay Tolerant Networking Research Group and has been reviewed by that group. No objections to its publication as an RFC were raised. This document defines PRoPHET, a Probabilistic Routing Protocol using History of Encounters and Transiti ..."
Abstract - Add to MetaCart
and Transitivity. PRoPHET is a variant of the epidemic routing protocol for intermittently connected networks that operates by pruning the epidemic distribution tree to minimize resource usage while still attempting to achieve the best case routing capabilities of epidemic routing. It is intended for use in sparse

Back-pressure routing for intermittently connected networks

by Jung Ryu, Lei Ying, Sanjay Shakkottai
"... Abstract—We study a mobile wireless network where groups or clusters of nodes are intermittently connected via mobile “carriers” (the carriers provide connectivity over time among different clusters of nodes). Over such networks (an instantiation of a delay tolerant network), it is well-known that t ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
Abstract—We study a mobile wireless network where groups or clusters of nodes are intermittently connected via mobile “carriers” (the carriers provide connectivity over time among different clusters of nodes). Over such networks (an instantiation of a delay tolerant network), it is well
Results 1 - 10 of 1,345,930