| |
|
| |
IEEE Transactions On Mobile Computing In Submitted to IEEE Transactions on Mobile Computing
Abstract
Delay-tolerant networks (DTNs) have the potential to interconnect devices in regions that current networking technology cannot reach. To realize the DTN vision, routes must be found over multiple unreliable, intermittently-connected hops. In this paper we present a practical routing protocol that uses only observed information about the network. We designed a metric that estimates the average waiting time for each potential next hop. This learned topology information is distributed using a link-state routing protocol, where the link-state packets are "flooded" using ...
|
| |
http://www.cs.berkeley.edu/~kfall/extreme-talk.pdf In Presentation at UCSD (November 2001)
|
| |
|
| |
|
| |
IEEE Communications Surveys & Tutorials, Vol. 8, No. 1. (1st Quarter 2006), pp. 24-37.
|
| |
Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2005. 13th IEEE International Symposium on (2005), pp. 435-444.
Abstract
Mobility plays a major role in mobile ad hoc networks (MANETs) since it stresses networking tasks such as routing on one hand but aids to increase the network capacity and to overcome network partitioning on the other hand. To benefit from node mobility, a new class of MANET protocols and applications are designed to be delay-tolerant and mobility-aided. For delay-tolerant mobility-aided networking mobility on a large time-scale is a key feature. So far, in MANETs, the mobility is investigated on a ...
|
| |
INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, Vol. 3 (2005), pp. 1849-1862 vol. 3.
Abstract
Today's mobile, wireless, and ad-hoc communications often exhibit extreme characteristics challenging assumptions underlying the traditional way of end-to-end communication protocol design in the Internet. One specific scenario is Internet access from moving vehicles on the road as we are researching in the drive-thru Internet project. Using wireless LAN as a broadly available access technology leads to intermittent - largely unpredictable and usually short-lived - connectivity, yet providing high performance while available. To allow Internet applications to deal reasonably well with such ...
|
| |
In Proceedings of the IEEE INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies (March 2006)
|
| |
In INFOCOM 2005. Proceedings of the 24th IEEE Annual Joint Conference of the IEEE Computer and Communications Societies (29 April 2006)
Abstract
Because a delay tolerant network (DTN) can often be partitioned, the problem of routing is very challenging. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes' mobility patterns. We provide here an analysis and the large scale evaluation of this routing scheme in the context of ambient networking by replaying real ...
|
| |
INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, Vol. 1 (2005), pp. 398-408 vol. 1.
Abstract
Disruption-tolerant networks (DTNs) differ from other types of networks in that capacity is exclusively created by the movements of participants. This implies that understanding and influencing the participants' motions can have a significant impact on network performance. In this paper, we introduce the routing protocol MV, which learns structure in the movement patterns of network participants and uses it to enable informed message passing. We also propose the introduction of autonomous agents as additional participants in DTNs. These agents adapt their ...
|
| |
ACM SIGCOMM Computer Communication Review, Vol. 35, No. 3. (July 2005), pp. 69-72.
|
| |
In Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (August 2003), pp. 27-34.
|
| |
Abstract
We investigate the custody transfer mechanism proposed for enhancing reliability in delay-tolerant networks. This mechanism, which utilizes hop-by-hop transfer of reliable delivery responsibility, shares many features in common with a database transaction. By considering custody transfer in this light, we observe that it can cause the creation of duplicate message fragments within the network that ordinarily may pose no significant problem, but can be cause for concern if in-network processing... ...
|
| |
Lecture Notes in Computer Science, Vol. 3462 (May 2005), pp. 1180-1192.
Abstract
The incredible growth in the capabilities and functionality of mobile devices has enabled new applications to emerge. Due to the potential for node mobility, along with significant node heterogeneity, characteristics such as very large delays, intermittent links and high link error rates pose a new set of challenges. Along with these challenges, end-to-end paths are assumed not to exist and message relay approaches are often adopted. While message flooding happens to be a simple and robust solution for such cases, its ...
|
| |
In WDTN '05: Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking (2005), pp. 260-267.
|
| |
In WDTN '05: Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking (2005), pp. 268-275.
|
| |
INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Vol. 1 (2004)
Abstract
This paper reports on measurement results for the use of IEEE 802.11 networks in drive-thru scenarios: we have measured transmission characteristics for sending and receiving high data volumes using UDP and TCP in vehicles moving at different speeds that pass one or more IEEE 802.11 access points at the roadside. We discuss possibilities and limitations for the use of scattered WLAN cells by devices in fast moving vehicles and provide an analysis of the performance that can he expected for the ...
|
| |
IEEE Communications Magazine, Vol. 41, No. 6. (June 2003), pp. 128-136.
Abstract
Increasingly, network applications must communicate with counterparts across disparate networking environments characterized by significantly different sets of physical and operational constraints; wide variations in transmission latency are particularly troublesome. The proposed Interplanetary Internet, which must encompass both terrestrial and interplanetary links, is an extreme case. An architecture based on a "least common denominator" protocol that can operate successfully and (where required) reliably in multiple disparate environments would simplify the development and deployment of such applications. The Internet protocols are ill suited ...
|
| |
|
| |
|
| |
|
| |
ACM SIGCOMM Computer Communication Review In SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, Vol. 34, No. 4. (October 2004), pp. 145-158.
Abstract
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no contemporaneous end-to-end path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing end-to-end path. We propose a framework ...
|
| |
ACM SIGMOBILE Mobile Computing and Communications Review, Vol. 7, No. 3. (July 2003), pp. 19-20.
Abstract
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 routing protocol for such networks. ...
|
| |
Computer, Vol. 37, No. 1. (January 2004), pp. 78-83.
Abstract
DakNet provides extraordinarily low-cost digital communication, letting remote villages leapfrog past the expense of traditional connectivity solutions and begin development of a full-coverage broadband wireless infrastructure. What is the basis for a progressive, market-driven migration from e-governance to universal broadband connectivity that local users will pay for? DakNet, an ad hoc network that uses wireless technology to provide asynchronous digital connectivity, is evidence that the marriage of wireless and asynchronous service may indeed be the beginning of a road to universal ...
|
| |
Personal Communications, IEEE [see also IEEE Wireless Communications], Vol. 7, No. 2. (2000), pp. 66-71.
Abstract
Infostations provide a new way to look at the problem of providing high-data-rate wireless access. By allowing delayed message delivery, we can lift the constraint on ubiquitous coverage inherited from voice cellular systems. The reduction of coverage results in significant capacity gains, showing the possibility for low-cost broadband wireless data services. We give an overview of ongoing research on the Infostation concept ...
|
| |
In WDTN '05: Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking (August 2005), pp. 276-283.
|
| |
In WDTN '05: Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking (August 2005), pp. 252-259.
|
| |
In Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking (August 2005), pp. 244-251.
Abstract
Pocket Switched Networks (PSN) make use of both human mobility and local/global connectivity in order to transfer data between mobile users' devices. This falls under the Delay Tolerant Networking (DTN) space, focusing on the use of opportunistic networking. One key problem in PSN is in designing forwarding algorithms which cope with human mobility patterns. We present an experiment measuring forty-one humans' mobility at the Infocom 2005 conference. The results of this experiment are similar to our previous experiments in corporate and ...
|
| |
Mobile Adhoc and Sensor Systems Conference, 2005. IEEE International Conference on (2005), pp. 700-709.
|
| |
Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. 2004 First Annual IEEE Communications Society Conference on In Proceedings of the First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004 (October 2004), pp. 235-244.
Abstract
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from source to destination, or such a path is highly unstable and may break soon after it has been discovered. In this context, conventional routing schemes would fail. To deal with such networks we propose the use of an opportunistic hop-by-hop routing model. According to the model, a series of independent, local forwarding decisions are made, based on current connectivity and predictions ...
|
| |
In IWCMC '06: Proceeding of the 2006 international conference on Communications and mobile computing (July 2006), pp. 533-538.
Abstract
Sensor devices are being embedded in all sorts of items including vehicles, furniture but also animal and human bodies through health monitors and tagging techniques. The collection of the information generated by these devices is a challenging task as the data results in enormous amounts and the sensors have scarce resources (especially in terms of energy for the forwarding of the data). Fortunately, the data is often delay tolerant and its delivery to the sinks is, in most cases, not time ...
|
Search
