The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Access and mobility of wireless PDA users
ACM SIGMOBILE Mobile Computing and Communications Review
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
PeopleNet: engineering a wireless virtual social network
Proceedings of the 11th annual international conference on Mobile computing and networking
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models
DTN routing strategies using optimal search patterns
Proceedings of the third ACM workshop on Challenged networks
A Context and Content-Based Routing Protocol for Mobile Sensor Networks
EWSN '09 Proceedings of the 6th European Conference on Wireless Sensor Networks
Predict and relay: an efficient routing in disruption-tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Multicasting in delay tolerant networks: a social network perspective
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations
IEEE Transactions on Mobile Computing
Replication routing in DTNs: a resource allocation approach
IEEE/ACM Transactions on Networking (TON)
Routing in socially selfish delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A reaction-diffusion model for epidemic routing in sparsely connected MANETs
INFOCOM'10 Proceedings of the 29th conference on Information communications
Hi-index | 0.00 |
Delay-tolerant networks (DTNs) are wireless networks where connectivity is sporadic because of node mobility, wireless signal blockage, sleep schedules, and power outages. The absence of contemporary routes between nodes can significantly delay message delivery. To accomplish data delivery in such challenging environments, researchers have proposed the use of store-carry-forward protocols, according to which a node stores a message and carries it until a forwarding opportunity arises by encountering another appropriate node. Since the encounter duration follows the power-law or exponential distribution mostly being short, the message exchange mechanism should avoid message losses. In this paper, we propose a communication capacity-based message exchange mechanism (CCME) that extends the existing DTN routing protocols. With CCME, the communication capacity is estimated by using both predicted encounter duration and communication bandwidth. Predicting encounter duration and estimating communication bandwidth are challenging issues. In this paper, we mainly focus on predicting encounter duration. We present a statistical method of predicting encounter duration to show the baseline for encounter duration estimation, and propose a real-time estimation mechanism for encounter duration. Our mechanism can be fine-tuned either to minimize the average delivery delay or to maximize the average delivery rate. The simulation results show that CCME successfully approximates the communication capacity. The performance of the existing protocols increases significantly with CCME.