Results 221 to 230 of about 6,134 (254)
Some of the next articles are maybe not open access.

Vector Routing for Delay Tolerant Networks

2008 IEEE 68th Vehicular Technology Conference, 2008
Recently, much research work has paid attention to delay tolerant networks (DTNs), which are networks with a frequent occurrences of network partitioning. Since the successful establishment of an end-to-end path between source and destination nodes is not guaranteed in these networks, routing is a challenging issue.
Hyunwoo Kang, Dongkyun Kim
openaire   +1 more source

The Antarctic Delay Tolerant Network

2022 IEEE Symposium on Computers and Communications (ISCC), 2022
Adrià Mallorquí   +2 more
openaire   +1 more source

Custodial Multicast in Delay Tolerant Networks

2007 4th IEEE Consumer Communications and Networking Conference, 2007
Although custodial transmission of multicast bundles would be a desirable capability to have in Delay-Tolerant Networks (DTNs), support for custodial multicast transmission was omitted from the Bundle Protocol Specification because of its complexity.
Susan Symington   +2 more
openaire   +1 more source

Forward Secure Delay-Tolerant Networking

Proceedings of the 12th Workshop on Challenged Networks, 2017
Delay-Tolerant Networks exhibit highly asynchronous connections often routed over many mobile hops before reaching its intended destination. The Bundle Security Protocol has been standardized providing properties such as authenticity, integrity, and confidentiality of bundles using traditional Public-Key Cryptography.
Signe Rüsch   +3 more
openaire   +1 more source

Efficient Broadcasting in Delay Tolerant Networks

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference, 2008
Delay tolerant networks are a class of networks characterized by intermittent connectivity, long delays, and noncontemporaneous end-to-end paths between nodes. Standard Internet protocols do not fare well in these situations and special protocols have been developed to handle routing, broadcasting and other mechanisms for transporting data.
Appu Goundan   +2 more
openaire   +1 more source

Delay Tolerant Networks

2016
A class of Delay Tolerant Networks (DTN), which may violate one or more of the assumptions regarding the overall performance characteristics of the underlying links in order to achieve smooth operation, is rapidly growing in importance but may not be well served by the current end-to-end TCP/IP model. Delay Tolerant Networks: Protocols and Applications
openaire   +1 more source

Delay tolerant podcasting with network coding

2010 IFIP Wireless Days, 2010
We present a new protocol for information dissemination in intermittently connected networks. The objective of the protocol is to disseminate a piece of information, a podcast episode in our scenario, to a subset of nodes of the network by exploiting the random opportunistic contacts occurring among them.
BERALDI, ROBERTO, M. Hussein Alnuweiri
openaire   +2 more sources

Delay tolerant handover for heterogeneous networks

39th Annual IEEE Conference on Local Computer Networks, 2014
Intermittent connectivity is one major challenge for mobile nodes that move between different networks. Existing handover procedures are able to maintain the connectivity, if the communication ranges of the networks overlap. Otherwise, the connection will be lost.
Peggy Begerow   +4 more
openaire   +1 more source

Scalable routing in delay tolerant networks

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, 2007
The non-existence of an end-to-end path poses a challenge inadapting the traditional routing algorithms to delay tolerantnetworks (DTNs). Previous works include centralized rout-ing approaches based on deterministic mobility, ferry-basedrouting with deterministic or semi-deterministic mobility, flooding-based approaches for networks with general ...
Cong Liu 0001, Jie Wu 0001
openaire   +1 more source

E-Scheme in Delay-Tolerant Networks

2008
Delay Tolerant Networks (DTNs) are characterized by very long delay paths and frequent network partitions. In this paper, a novel E-Scheme is proposed which can be utilized by most of the existing routing approaches that employ the `probability to deliver' metric. Providing there are n opportunities, the E-Scheme is to let the first (ni¾?
Zhi-Ting Lin   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy