Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Peoplerank: social opportunistic forwarding
INFOCOM'10 Proceedings of the 29th conference on Information communications
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
Message forwarding in opportunistic networks, is a challenging problem owing to the high dynamics of the embedded network. Different from most of the work targeting at this problem, instead of inferring people's movement from context or social knowledge, this paper studies utilizing online public information to learn node's mobility and facilitate the message forwarding for opportunistic networks, including human centered sensor networks. A calendar based message forwarding scheme is proposed on the basis of the online public calendar data to discover path which is a node sequence from source node to destination node where pair of adjacent nodes share overlapped time and location. Message relay occurs when the adjacent nodes have contact with each other during the overlapped time. By forwarding messages along the determined path in opportunistic networks, we could achieve message delivery with extremely low resource consumption. The evaluation results show that it is very promising to support the message forwarding in opportunistic networks by exploring useful online public information such as public calendars.