Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Sending messages to mobile users in disconnected ad-hoc wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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
On the behavior of communication links of a node in a multi-hop mobile environment
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
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
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)
Performance modeling of network coding in epidemic routing
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Quality of Service in mobile ad hoc networks: a survey
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
In an intermittent-connectivity network, there rarely exists a connected path between a source node and its destination. These networks arise frequently when each node has a limited transmission range, such as a communication network between separated villages or a surveillance network with a large geographical span. One method of addressing the low connectivity of the network uses redundancy. A node generates and stores data; upon reaching the communication range of another node, it replicates the data to it. Multiple copies of the packet decrease the time to offload the data to the destination, but increase the energy and storage used in the system. In this paper, we quantify the resource-delay trade-off and the throughput capacity for intermittent-connectivity networks with Quality of Service restrictions such as limited communication bandwidth. Many routing protocols have been proposed for these intermittent-connectivity networks. Using the Shared Wireless Infostation Model as an example strategy, we mathematically represent the intermittent-connectivity network and adjust the model to include a Quality of Service constraint. By completely defining a mathematical model, we allow network designers control over system performance through the adjustment of allocated resources such as communication bandwidth, fraction of time a node spends in sleep mode, or required reliability of packet offloading.