Time scales and delay-tolerant routing protocols
Proceedings of the third ACM workshop on Challenged networks
Analysis and design of mobile Wireless Social Model
Computer Communications
Probabilistic routing in on-body sensor networks with postural disconnections
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
Routing for disruption tolerant networks: taxonomy and design
Wireless Networks
Modeling on-body DTN packet routing delay in the presence of postural disconnections
EURASIP Journal on Wireless Communications and Networking - Special issue on opportunistic and delay tolerant networks
ACM SIGMOBILE Mobile Computing and Communications Review
| Hi-index | 0.00 |
Because a delay-tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes' mobility patterns. We provide here an analysis and a large-scale evaluation of routing schemes using MobySpace by replaying real mobility traces. The specific MobySpace evaluated is based on the frequency of visits of nodes to each possible location. We present simulation results for single-copy and multi-copy routing strategies that use MobySpace as a means to route bundles or to control flooding. We show that routing based on MobySpace can achieve good performance compared to a number of common algorithms. Copyright © 2007 John Wiley & Sons, Ltd.