A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Cluster-based Forwarding in Delay Tolerant Public Transport Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Opportunistic DTN routing with window-aware adaptive replication
Proceedings of the 4th Asian Conference on Internet Engineering
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
| Hi-index | 0.00 |
In these last few years we observed a tremendous raise in the field of personal communication and location- context-based services. Unfortunately, in regard to these kind of services, standard connectivity, such as 3G, is limited by scalability issues and its strictly pull-based service model. As an alternate solution, Delay-Tolerant Networks (DTN) have already been proposed as a way to obtain a scalable and efficient urban backbone by leveraging an already available public transportation system. To bound delay of DTNs when deploying in an urban environment the most cost-effective solution is the partial involvement of road-side infrastructure. This paper addresses the problem of infrastructure allocation in a real city environment by analyzing the topology and the timetable of a real urban setting to propose an algorithm suitable for reducing deployed equipment. By means of extensive simulations we show that, a very limited number of exchange points leads to a significant performance improvement and helps planning for a bounded delivery delay.