The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Delay Tolerant Networks (DTN) is a kind of sparse Ad Hoc networks in which no contemporaneous path exists between any two nodes most of the time. Multicasting in DTN is a desirable feature for applications where some form of group communication is in demand. In this paper, we propose a multicast protocol for DTN: ECAM (Epidemic-based Controlled Flooding and Adaptive Multicast for Delay Tolerant Networks)...
Communication networks are traditionally assumed to be connected. However, in delay and disruption tolerant networks(DTN), there are many unconventional difficulties, such as intermittent connectivity, large delay and may never have an end-to-end contemporaneous path, a node has to store-and-carry messages for a long time, until a new forwarding opportunity arises. Because every node needs to store...
In disruption tolerant networks, aggressive packet forwarding scheme like flooding has a major drawback in terms of network congestion. In this paper, we proposed a new routing algorithm, called adaptive randomized epidemic routing (ARER). ARER dynamically adjusts the forwarding probability for each message according to a new metric, replications density. Meanwhile, ARER arranges the forwarding sequence...
Delay tolerant networks (DTNs) use a store-carry-forward communication model relying on the mobility of nodes because a persistent end-to-end path from source to destination generally does not exist. Epidemic routing is a typical protocol in which data can be replicated along multiple opportunistic paths. With the advent of network coding, it is intuitive that data can not only be replicated, but...
In Disruption Tolerant Networks, simply flooding packet scheme has a major drawback in terms of network congestion. This paper proposes a new routing algorithm, called Adaptive Priority Routing with Ack_mechanism (APRA). APRA arranges the forwarding sequence and the dropping sequence based on their assigned priority. The priority is determined by the TTL, Delivery Predictability, and Replication Density...
In disruption tolerant networks, aggressive packet forwarding scheme like flooding has a major drawback in terms of network congestion. In this paper, we proposed a new routing algorithm, called directional forward routing (DFR). DFR caches the position information of neighbors, and selects the appropriate relays according to the directional angles among these neighbors and the destination. Meanwhile,...
Epidemic Routing is an original and effective multicopy routing algorithm in disruption tolerant networks. However, its performance degrades significantly when network resources are limited. In this paper, we proposed a new routing scheme, called Weighted Epidemic Routing (WER). WER appropriately arranges the priority of messages for forwarding or deleting through assigning a weight for each of them...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.