Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Smooth is better than sharp: a random mobility model for simulation of wireless networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Wearable Computers as Packet Transport Mechanisms in Highly-Partitioned Ad-Hoc Networks
ISWC '01 Proceedings of the 5th IEEE International Symposium on Wearable Computers
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Erasure-coding based routing for opportunistic networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Resource and performance tradeoffs in delay-tolerant wireless networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
A new networking model for biological applications of ad hoc sensor networks
IEEE/ACM Transactions on Networking (TON)
Exploiting mobility for energy efficient data collection in wireless sensor networks
Mobile Networks and Applications
Delay and capacity trade-offs in mobile ad hoc networks: a global perspective
IEEE/ACM Transactions on Networking (TON)
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
The Impact of Cooperative Nodes on the Performance of Vehicular Delay-Tolerant Networks
Mobile Networks and Applications
Hi-index | 0.00 |
Due 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., scheduled), in others, connectivity is created randomly. For instance, to save battery power, nodes in a sensor network may be programmed to follow a pre-arranged sleep patterns, or may enter the sleep state opportunistically. In a sparsely-connected network, source-to-destination route discovery cannot be implemented, since at any particular time, there rarely exists a connected path between the source node and the destination node. Consequently, the conventional approaches to implement network routing do not work and new methods are needed. Flooding (as implemented, for example, using epidemic routing) could be used to spread information through the network. With multiple copies of each packet in the network, the time to offload the data to the destination can be significantly reduced, but at the expense of increased energy and storage utilization. However, in some DTNs, network resources may be limited, for instance due to physical constraints of the network devices. In this paper, we consider the implications of the limited network resources, such as limited communication bandwidth, on the performance and the capacity of a DTN.In particular, leveraging from our previous work on DTN, we use the Shared Wireless Infostation Model (SWIM) to derive a strategy to mathematically represent a DTN, which allows us to evaluate the network throughput capacity, while including a variety of restrictions on network resources. Using this mathematical model derived here, will allow the network designers to adjust the allocated network resources, as to trade off system performance and system resources, while achieving the required network capacity.