The transport layer: tutorial and survey
ACM Computing Surveys (CSUR)
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing using potentials: a dynamic traffic-aware routing algorithm
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Evaluating contacts for routing in highly partitioned mobile networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
DTLSR: delay tolerant routing for developing regions
Proceedings of the 2007 workshop on Networked systems for developing regions
Mobility entropy and message routing in community-structured delay tolerant networks
Proceedings of the 4th Asian Conference on Internet Engineering
PWave: a multi-source multi-sink anycast routing framework for wireless sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Controlled potential-based routing for large-scale wireless sensor networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Controlled and self-organized routing for large-scale wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
In delay (or disruption) tolerant networks(DTNs), the physical network is partitioned and the topology changes by node contacts. In most cases, there are no globally synchronized topology information available, which makes routing in DTNs challenging. To enable message routing without topology, we take potential-based routing(PBR) approach. We define potential-based message forwarding (PBMF) model and potential field construction method, which can be implemented in autonomously and distributed manner. We also discuss message overflow phenomenon, which should be considered in the deployment phase. This work assumes forwarding-based message delivery because of its lightweightness in delivery management. We developed a prototype system and evaluated (1) the behavior of potential-field and message delivery and (2) the model of message overflow. We also carried out a 100-node scale simulation and found that compared to epidemic routing, (3) about 50% of delivery was performed within three times of the best delivery latency and (4) the usage of message storage was reduced to 1%.