ABSTRACT
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.
- N. Bansal and Z. Liu, "Capacity, Delay and Mobility in Wireless Ad-Hoc Networks," IEEE INFOCOM'03, April 2003Google Scholar
- C, Bettstetter, "Smooth is Better than Sharp: A Random Mobility Model for Simulation of Wireless Networks," MSWiM, July 2001 Google ScholarDigital Library
- S. Cui, R. Madan, A. J. Goldsmith, and S. Lall, "Energy-delay Tradeoff for Data Collection in Sensor Networks," ICC'05, May 2005Google Scholar
- D. J. Goodman, J. Borràs, N.B. Mandayam, and R.D. Yates "INFOSTATIONS: A New System for Data and Messaging Services," IEEE VTC '97 2, 1997Google Scholar
- M. Grossglauser and D.N.C. Tse "Mobility increases the capacity of ad hoc wireless networks" IEEE/ACM Transactions on Networking 10, 2002 Google ScholarDigital Library
- J.D. Herdtner, E.K.P. Chong, "Scaling Laws in Ad Hoc Wireless Networks," http://www.math.colostate.edu/~estep/doe_multiscale/slides/herdtner.pdfGoogle Scholar
- R.R. Kompella and A.C. Snoeren, "Practical Lazy Scheduling in Wireless Sensor Networks," ACM Sensys, November 2003 % http://ramp.ucsd.edu/sparta/ACMSensys03.pdf Google ScholarDigital Library
- P. Nain, D. Towsley, B. Liu, and Z. Liu, "Properties of Random Direction Models," INRIA technical report RR-5284, July 2004Google Scholar
- C. Perkins, Ad Hoc Networking, Addison-Wesley, 2001 %, Upper Saddle River, NJGoogle Scholar
- R. Shah, S. Roy, S. Jain, and W. Brunette, "Data MULEs: Modeling a three-tier architecture for sparse sensor networks," IEEE SNPA Workshop, May 2003Google Scholar
- T. Small, "Modeling Trade-offs in Networks with Intermittent Connectivity," Cornell University PhD thesis, August 2005Google Scholar
- T. Small and Z.J. Haas, "The Shared Wireless Infostation Model -- A New Ad Hoc Networking Paradigm (or Where there is a Whale, there is a Way)," MobiHoc '03, June 2003%Annapolis, Maryland Google ScholarDigital Library
- A. Vahdat and D. Becker, "Epidemic routing for partially-connected ad hoc networks," Technical report, Duke University, 2000Google Scholar
- W. Zhao, M. Ammar, and E. Zegura, "A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks," MobiHoc '04, May 2004%) pp. 187 -- 198. Google ScholarDigital Library
Index Terms
- Resource and performance tradeoffs in delay-tolerant wireless networks
Recommendations
Evaluating the capacity of resource-constrained DTNs
IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computingDue to their low network connectivity, sparsely-connected networks can support delay-tolerant applications only. Thus, such communication environments are examples of Delay-Tolerant Networks (DTNs). While in some DTN connectivity is predictable (e.g., ...
A new networking model for biological applications of ad hoc sensor networks
In this paper, we introduce the Shared Wireless Infostation Model (SWIM), which extends the Infostation model by incorporating information replication, storage, and diffusion into a mobile ad hoc network architecture with intermittent connectivity. SWIM ...
Analysis of simple counting protocols for delay-tolerant networks
CHANTS '07: Proceedings of the second ACM workshop on Challenged networksMobile Wireless Delay-Tolerant Networks (DTNs) are wireless networks that suffer from intermittent connectivity, but enjoy the benefit of mobile nodes that can store and forward packets or messages, and can act as relays, bringing packets and messages ...
Comments