Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
A new networking model for biological applications of ad hoc sensor networks
IEEE/ACM Transactions on Networking (TON)
Application protocol design considerations for a mobile internet
Proceedings of first ACM/IEEE international workshop on Mobility in the evolving internet architecture
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
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
Pervasive and Mobile Computing
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs
IEEE Transactions on Mobile Computing
Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations
IEEE Transactions on Mobile Computing
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
DTN: an architectural retrospective
IEEE Journal on Selected Areas in Communications
Research challenges towards the Future Internet
Computer Communications
| Hi-index | 0.00 |
Opportunistic networks are one of the most promising evolutions of the traditional Mobile Ad Hoc Networks paradigm. Communications in an opportunistic network rely on the mobility of the users: each message is handed over from node to node, making hop-by-hop decisions to select the node that is better suited for bringing the message closer to its destination. Algorithms exploiting social-awareness are emerging as one of the most efficient categories of forwarding algorithms. However we are currently lacking analytical models able to characterize the performance of social-aware forwarding in opportunistic networks. In this paper we start to fill this gap by proposing an analytical model for the expected number of hops and the expected delay experienced by messages when delivered in an opportunistic social-aware fashion. The model is then used to characterize how the expected delay experienced by messages varies with the different social structures in the network of the users.