A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Access and mobility of wireless PDA users
ACM SIGMOBILE Mobile Computing and Communications Review
The changing usage of a mature campus-wide wireless network
Proceedings of the 10th annual international conference on Mobile computing and networking
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
A socio-aware overlay for publish/subscribe communication in delay tolerant networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Designing mobility models based on social network theory
ACM SIGMOBILE Mobile Computing and Communications Review
Distributed community detection in delay tolerant networks
Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture
ACM SIGMOBILE Mobile Computing and Communications Review
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Are you moved by your social network application?
Proceedings of the first workshop on Online social networks
ContentPlace: social-aware data dissemination in opportunistic networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Exploiting Self-Reported Social Networks for Routing in Ubiquitous Computing Environments
WIMOB '08 Proceedings of the 2008 IEEE International Conference on Wireless & Mobile Computing, Networking & Communication
From opportunistic networks to opportunistic computing
IEEE Communications Magazine
An Exploratory Social Network Analysis of Academic Research Networks
INCOS '11 Proceedings of the 2011 Third International Conference on Intelligent Networking and Collaborative Systems
A Data Dissemination Algorithm for Opportunistic Networks
SYNASC '11 Proceedings of the 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Incentive-rewarding mechanism to stimulate activities in social networking services
International Journal of Network Management
Bluetooth and Wi-Fi wireless protocols: a survey and a comparison
IEEE Wireless Communications
| Hi-index | 0.00 |
Since uninterrupted connectivity has become such an important part of everyday life, the amount of energy consumed by the various devices used has increased considerably. We propose a way to limit this consumption by employing opportunistic networks, which are mainly composed of mobile devices that have no need for a static network infrastructure. They communicate when in range, using a store-carry-and-forward paradigm. We believe that opportunistic networks can be deployed in closed environments if there is a certainty that messages sent in the network eventually reach their destination. Therefore, we propose the addition of social data to existing opportunistic routing algorithms. We investigate our approach using two traces collected in different environments and we present an analysis of our findings. Most importantly, we show that by adding knowledge such as social links between participants, the performance of the opportunistic network can be improved.