scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Buffer Dimensioning of DTN Replication-Based Routing Nodes

01 Jan 2013-IEEE Communications Letters (IEEE)-Vol. 17, Iss: 1, pp 123-126
TL;DR: This paper addresses the problem of quantifying the buffer size of DTN source nodes, under replication based routing protocol, using Markov modulated processes and large deviation techniques and is shown to exhibit a routing performance of an equivalent infinite buffer model.
Abstract: The crux of the Delay-Tolerant Network (DTN) routing architecture lies in the physical transportation of messages by the resource-bound nodes. This requires a demanding (node) buffer space for a seamless functioning of the routing protocols. An analytical instrument to systematically quantify this buffer space is vital to wield the buffer loss. Buffer dimensioning is therefore essential to design a practical and efficient DTN. In this letter, we address the problem of quantifying the buffer size of DTN source nodes, under replication based routing protocol, using Markov modulated processes and large deviation techniques. Our proposed dimensioned-buffer model is shown to exhibit a routing performance of an equivalent infinite buffer model. Furthermore, our analysis is validated via extensive simulation results.
Citations
More filters
Journal ArticleDOI
TL;DR: The paper introduces the concept of isotropic deliveries in delay tolerant networks which uses binary spray and wait forwarding strategy and shows the proposed incentive mechanism preventing selfish behaviour and guaranteeing more extra credits to the end-user.

18 citations

Journal ArticleDOI
TL;DR: Context-aware Energy Conserving Algorithm for routing (CECA) was proposed which employs QoS routing metrics like Inter-Meeting Time and residual energy and has been applied to IoT enabled smart mobile devices using different technologies with different microcontroller which resulted in an increased network lifetime, throughput and reduced control overhead and the end to end delay.
Abstract: Internet of Things (IoT) is the fast- growing technology, mostly used in smart mobile devices such as notebooks, tablets, personal digital assistants (PDA), smartphones, etc. Due to its dynamic nature and the limited battery power of the IoT enabled smart mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Existing algorithm does not concentrate about communication links and battery power/energy, but these node links are a very important factor for improving the quality of routing in IoT. In this paper, Context-aware Energy Conserving Algorithm for routing (CECA) was proposed which employs QoS routing metrics like Inter-Meeting Time and residual energy and has been applied to IoT enabled smart mobile devices using different technologies with different microcontroller which resulted in an increased network lifetime, throughput and reduced control overhead and the end to end delay. Simulation results show that, with respect to the speed of the mobile nodes from 2 to 10m/s, CECA increases the network lifetime, thereby increasing the average residual energy by 11.1% and increasing throughput there by reduces the average end to end delay by 14.1% over the Energy-Efficient Probabilistic Routing (EEPR) algorithm. With respect to the number of nodes increases from 10 to 100 nodes, CECA algorithms increase the average residual energy by16.1 % reduces the average end to end delay by 15.9% and control overhead by 23.7% over the existing EEPR.

12 citations


Cites methods from "Buffer Dimensioning of DTN Replicat..."

  • ...Depending on the condition, whether the node belongs to flow or not and in case if the flow is a node in, the total energy expenditure at a node due to another node in the network can be obtained by using equation 6[16]....

    [...]

  • ...This CECA can be implemented by using DSR (Dynamic Source Routing) protocol while the route discovery in the DSR protocol has been modified so as to enable the selection of the most energy conserving and stable routes by the source nodes itself [16]....

    [...]

Proceedings ArticleDOI
11 May 2015
TL;DR: The contributions of this paper can be summarized as the Delay Tolerant Reinforcement-Based routing solution and the Messages on oFfer incentive mechanism, a routing solution for user provided networks when the users have a prior interest in common.
Abstract: This paper investigates user provided networks. Such networks have become important research in the field of informatics engineering due to the recent popularity of smart phones. User provided networks are independent from traditional Internet service providers. Communication and information exchange between users occurs opportunistically, i.e., when the smart phones are close enough to exchange information. Most user provided networks are based on the radio standard IEEE 802.11, popularly known as ‘wi-fi’. However, some networks are based on other low range radio standards, such as Bluetooth and IEEE 802.15.4. User provided networks are important to the society when the traditional Internet service providers become unavailable. For example, this may occur in terrorist attacks, earthquakes, or even cyber attacks. In these emergency situations, when users have a greater interest in common, an efficient system for non-presencial information exchange is necessary. Such networks are also interesting in a social context, when users must be incentivized to share their resources (storage capacity, wireless connectivity and battery) to enable the exchange of information. This paper addresses both situations: i) networks whose users have a common interest and ii) networks whose users need to be encouraged to share resources. Basically, the contributions of this paper can be summarized as the Delay Tolerant Reinforcement-Based routing solution and the Messages on oFfer incentive mechanism. The first is a routing solution for user provided networks when the users have a prior interest in common. The second is an incentive mechanism to encourage users to exchange information. Both solutions showed excellent results in the simulation environment.

8 citations

Proceedings ArticleDOI
01 Mar 2020
TL;DR: This paper considers the problem of autonomously avoiding memory overflows in a Delay Tolerant Node, and proposes using Reinforcement Learning to automate buffer management given that it can easily measure the relative rates of data coming in and out of the DTN node.
Abstract: In order to effectively communicate with Earth from deep space there is a need for network automation similar to that of the Internet. The existing automated network protocols, such as TCP and IP, cannot work in deep space due to the assumptions under which they were designed. Specifically, protocols assume the existence of an end-to-end path between the source and destination for the entirety of a communication session and the path being traversable in a negligible amount of time. In contrast, a Delay Tolerant Network is a set of protocols that allows networking in environments where links suffer from high-delay or disruptions (e.g. Deep Space). These protocols rely on different assumptions such as time synchronization and suitable memory allocation. In this paper, we consider the problem of autonomously avoiding memory overflows in a Delay Tolerant Node. To that end, we propose using Reinforcement Learning to automate buffer management given that we can easily measure the relative rates of data coming in and out of the DTN node. In the case of detecting overflow, we let the autonomous agent choose between three actions: slowing down the client, requesting more resources from the Deep Space Network, or selectively dropping packets once the buffer nears capacity. Furthermore, we show that all of these actions can be realistically implemented in real-life operations given current and planned capabilities of Delay Tolerant Networking and the Deep Space Network. Similarly, we also show that using Reinforcement Learning for this problem is well suited to this application due to the number of possible states and variables, as well as the fact that large distances between deep space spacecraft and Earth prevent human-in-the-loop intervention.

8 citations


Cites methods from "Buffer Dimensioning of DTN Replicat..."

  • ...To overcome these limitations, References [7] and [8] study the problem of buffer dimensioning for an opportunistic DTN in which nodes move accordingly to random waypoint model....

    [...]

Journal ArticleDOI
TL;DR: Assessment of how fast a node buffer gets depleted under different routing algorithms, which will help in designing better buffer management techniques and routing algorithms is assessed.
Abstract: We perform a study on the buffer occupancy 1 1 The term buffer occupancy refers to the amount (or number) of data (or packets) present in the buffer. We shall be using the terms buffer occupancy and system size interchangeably as deemed fit. and its steady-state properties in a mobile opportunistic network (MON) for different forwarding strategies. Nodes in MON adhere to replication based strategy in order to ensure reliable delivery. Such replications occur in bulks during intermittent and very short contact events, which often lead to buffer congestion in the relay nodes, thereby affecting the network performance. The state-of-the-art on buffer management in MON relies on local information exchange to measure buffer occupancy, which leads to overhead. Therefore, to find the average buffer occupancy, we first study the aggregated bulk transfer size using real-life contact traces and find that it follows a log-normal distribution. Since the contact rate has been observed to follow a Poisson distribution, we model the packet arrival process in each node as a compound Poisson process. Furthermore, the departure process is modeled as packets dropped due to time-to-live expiry, which is shown to have an exponential distribution. Using the above model, we derive the steady-state probability distribution of buffer occupancy of an arbitrary node for three different classes of replication scheme, viz., epidemic routing, probabilistic routing, and time-varying probabilistic routing. The results of this paper help in assessing how fast a node buffer gets depleted under different routing algorithms, which will help in designing better buffer management techniques and routing algorithms.

8 citations


Cites methods from "Buffer Dimensioning of DTN Replicat..."

  • ...[9] use the technique of Markov modulated process and large deviations to find the queue size, which gives the same performance as (theoretical) infinite queue size....

    [...]

References
More filters
Amin Vahdat1
01 Jan 2000
TL;DR: This work introduces Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery and achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
Abstract: Mobile ad hoc routing protocols allow nodes with wireless adaptors to communicate with one another without any pre-existing network infrastructure. Existing ad hoc routing protocols, while robust to rapidly changing network topology, assume the presence of a connected path from source to destination. Given power limitations, the advent of short-range wireless networks, and the wide physical conditions over which ad hoc networks must be deployed, in some scenarios it is likely that this assumption is invalid. In this work, we develop techniques to deliver messages in the case where there is never a connected path from source to destination or when a network partition exists at the time a message is originated. To this end, we introduce Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery. The goals of Epidemic Routing are to: i) maximize message delivery rate, ii) minimize message latency, and iii) minimize the total resources consumed in message delivery. Through an implementation in the Monarch simulator, we show that Epidemic Routing achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.

4,355 citations


"Buffer Dimensioning of DTN Replicat..." refers background in this paper

  • ...Some of them are as follows: (i) when the relay nodes also replicate messages among themselves, then the corresponding protocol is called epidemic routing [3], and (ii) when the relay nodes resort to direct transmission forwarding scheme, then the corresponding routing protocol is called two-hop routing protocol [7]....

    [...]

  • ...While there are a few works such as [3] that study the average statistics of the node buffer, they are not helpful in bounding the buffer size....

    [...]

Proceedings ArticleDOI
22 Aug 2005
TL;DR: A new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination, which outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered.
Abstract: Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks fall into the general category of Delay Tolerant Networks. There are many real networks that follow this paradigm, for example, wildlife tracking sensor networks, military networks, inter-planetary networks, etc. In this context, conventional routing schemes would fail.To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention, which can significantly degrade their performance. Furthermore, proposed efforts to significantly reduce the overhead of flooding-based schemes have often be plagued by large delays. With this in mind, we introduce a new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination.Using theory and simulations we show that Spray and Wait outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered; its overall performance is close to the optimal scheme. Furthermore, it is highly scalable retaining good performance under a large range of scenarios, unlike other schemes. Finally, it is simple to implement and to optimize in order to achieve given performance goals in practice.

2,712 citations


"Buffer Dimensioning of DTN Replicat..." refers background in this paper

  • ...In the context of buffer space, much of the existing literature on DTN assumes either infinite buffer space [1] or finite (arbitrary) buffer space [2] of the nodes in its system model....

    [...]

Proceedings ArticleDOI
02 Mar 2009
TL;DR: This paper presents the Opportunistic Networking Environment (ONE) simulator specifically designed for evaluating DTN routing and application protocols, and shows sample simulations to demonstrate the simulator's flexible support for DTN protocol evaluation.
Abstract: Delay-tolerant Networking (DTN) enables communication in sparse mobile ad-hoc networks and other challenged environments where traditional networking fails and new routing and application protocols are required. Past experience with DTN routing and application protocols has shown that their performance is highly dependent on the underlying mobility and node characteristics. Evaluating DTN protocols across many scenarios requires suitable simulation tools. This paper presents the Opportunistic Networking Environment (ONE) simulator specifically designed for evaluating DTN routing and application protocols. It allows users to create scenarios based upon different synthetic movement models and real-world traces and offers a framework for implementing routing and application protocols (already including six well-known routing protocols). Interactive visualization and post-processing tools support evaluating experiments and an emulation mode allows the ONE simulator to become part of a real-world DTN testbed. We show sample simulations to demonstrate the simulator's flexible support for DTN protocol evaluation.

2,075 citations


"Buffer Dimensioning of DTN Replicat..." refers methods in this paper

  • ...The simulation is done with the popular DTN simulator namely Opportunistic Network Environment (ONE) simulator [11]....

    [...]

Journal ArticleDOI
Anwar Elwalid1, Debasis Mitra1
TL;DR: It is shown that for general Markovian traffic sources it is possible to assign a notional effective bandwidth to each source that is an explicitly identified, simply computed quantity with provably correct properties in the natural asymptotic regime of small loss probabilities.
Abstract: A prime instrument for controlling congestion in a high-speed network is admission control, which limits calls and guarantees a grade of service determined by delay and loss probability in the multiplexer. It is shown that for general Markovian traffic sources it is possible to assign a notional effective bandwidth to each source that is an explicitly identified, simply computed quantity with provably correct properties in the natural asymptotic regime of small loss probabilities. It is the maximal real eigenvalue of a matrix that is directly obtained from the source characteristics and the admission criterion, and for several sources it is simply additive. Both fluid and point process models are considered. Numerical results show that the acceptance set for heterogeneous classes of sources is closely approximated and conservatively bounded by the set obtained from the effective bandwidth approximation. The bandwidth-reducing properties of the leaky bucket regulator are exhibited numerically. >

759 citations

01 Jan 1993
TL;DR: In this paper, it is shown that for general Markovian trafJic sources, it is possible to assign a notional effective bandwidth to each source which is an explicitly identijied, simply computed quantity with provably correct properties in the natural asymptotic regime of small loss probabilities.
Abstract: The emerging high speed networks, notably the ATMbased Broadband-ISDN, are expected to integrate through statistical multiplexing large numbers of traflc sources having a broad range of burstiness characteristics. A prime instrument for controlling congestion in the network is admission control which limits calls and guarantees a grade of service determined by delay and loss probability in the multiplexel: We show, for general Markovian trafJic sources, that it is possible to assign a notional effective bandwidth to each source which is an explicitly identijied, simply computed quantity with provably correct properties in the natural asymptotic regime of small loss probabilities. It is the maximal real eigenvalue of a matrix which is directly obtained from the source characteristics and the admission criterion, and for several sources it is simply additive. We consider both fluid and point process models and obtain parallel results. Numerical results show that the acceptance set for heterogeneous classes of sources is closely approximated and conservatively bounded by the set obtained from the effective bandwidth approximation.

248 citations