A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 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
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)
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
ContentPlace: social-aware data dissemination in opportunistic networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
The effects of node cooperation level on routing performance in delay tolerant networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
LocalCom: a community-based epidemic forwarding scheme in disruption-tolerant networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocols, which are representatives of social-oblivious and social-aware forwarding. In particular, we consider a recently introduced stateless, social-aware forwarding protocol using interest similarity between individuals, and the well-known BinarySW protocol, which is optimal within a certain class of stateless, social-oblivious forwarding protocols. We compare both from the theoretical and experimental point of view the asymptotic performance of Interest-Based (IB) forwarding and BinarySW under two mobility scenarios, modeling situations in which pairwise meeting rates between nodes are either independent of or correlated to the similarity of their interests.