Resource and performance tradeoffs in delay-tolerant wireless networks

By Tara Small, Zygmunt J. Haas. WDTN '05, 2005

392 citations recorded by the source corpus.

Wireless and mobile network technologies often impose severe limitations on the availability of resources, resulting in poor and often unsatisfactory performance of the commonly used wireless networking protocols. For instance, power and memory/storage constraints of miniaturized network nodes reduce the throughput capacity and increase the network latency. Through various approaches and technological advances, researchers attempt to somehow compensate for such hardware limitations. However, this is not always necessary. Sometimes, the required performance of such networks does not need to adhere to the level of services that would be required for performance-critical applications. For example, for some applications of sensor networks, minimal latency is not a critical factor and it could be traded off for a more limited resource, such as energy or throughput. Such networks are termed delay-tolerant networks. Thus, to reduce the energy expenditure, transmission range of such sensor nodes would be quite short, leading to network topologies in which the average number of neighbors of the network nodes is very small. If the sensor nodes are mobile, then most of the time a node has <u>no</u> neighbors; only infrequently another node migrates into its neighborhood. This means that the classical networking approach of store-and-forward would not work well, as there is nearly never an intact path between a source and a destination. Several routing protocols have been proposed for this type of networking environment, one example is the Shared Wireless Infostation Model (SWIM), where a packet propagates through the network by being copied (rather than forwarded) from a node to a node, as links are sporadically created. The goal is that one of the copies of the packet reaches the destination. SWIM is an example of the way that non-critical performance could be traded off for insufficient resources, such as the tradeoffs between energy, delay, storage, capacity, and processing complexity. In this paper, we examine some of these tradeoffs, exposing the ways in which resources could be saved by compromising on the level of performance, as to satisfy the particular limitations of network technologies.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/4d5d2ddb3a6d62aa3b35a3588033d743a49944d8

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Message ferry route design for sparse ad hoc networks with mobile nodes (2006, background): “A number of routing schemes exist for DTNs [1, 3, 5, 10, 11, 14, 16, 26, 21, 23, 24, 29].”
Controlled sink mobility for prolonging wireless sensor networks lifetime (2008, background): “The data MULE architecture is effective for energy conservation in delay tolerant networks [39].”
MORA routing and capacity building in disruption-tolerant networks (2008, background): “Schemes also exist that use network coding [39], or restrict the number of copies of a packet [33,30,37,25].”
Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case (2008, background): “We assume Random Direction mobility.”
Evaluating Mobility Pattern Space Routing for DTNs (2005, background): “[22] propose an analyti cal study of existing trade-offs between resources consumptio n such as energy, throughput, buffers and the performance in term of latency.”
Performance modeling of epidemic routing (2006, background): “Variations of epidemic routing have recently been proposed that exploit this trade-off between delivery delay and resource consumption, including K-hop schemes [9, 3], probabilistic forwarding [8, 4], and spray-and-wait [12, 11].”
Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case (2008, background): “Additionally, there also exist some efforts to analyze the performance of 2hop schemes using redundant copies [ 25 ,39].”
Performance analysis of mobility-assisted routing (2006, background): “Such networks are often collectively referred to as Delay Tolerant Networks (DTN) [1].”
Practical Routing in Delay-Tolerant Networks (2005, background): “Small and Haas show that, the more aggressively the death certificates are propagated, the less storage is required at each node [14], while Harras and Almeroth show that the more aggressive strategies transmit more messages [18].”
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility (2007, background): “To make our point more clear, consider for example the " Spray and Wait " scheme [17], [18] in such a scenario.”