Temporal distance metrics for social network analysis
Proceedings of the 2nd ACM workshop on Online social networks
Characterising temporal distance and reachability in mobile and online social networks
ACM SIGCOMM Computer Communication Review
Social roles for opportunistic forwarding
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Privacy-enhanced opportunistic networks
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Decongesting opportunistic social-based forwarding
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Analysing information flows and key mediators through temporal centrality metrics
Proceedings of the 3rd Workshop on Social Network Systems
Similarity analysis and modeling in mobile societies: the missing link
Proceedings of the 5th ACM workshop on Challenged networks
Congestion aware data dissemination in social opportunistic networks
ACM SIGMOBILE Mobile Computing and Communications Review
Proceedings of the 2011 ACM Symposium on Applied Computing
How much off-center are centrality metrics for routing in opportunistic networks
CHANTS '11 Proceedings of the 6th ACM workshop on Challenged networks
Rethinking opportunistic routing using space syntax
CHANTS '11 Proceedings of the 6th ACM workshop on Challenged networks
Centrality-driven scalable service migration
Proceedings of the 23rd International Teletraffic Congress
Privacy-enhanced social-network routing
Computer Communications
Gauging human mobility characteristics and its impact on mobile routing performance
International Journal of Sensor Networks
Modelling social-aware forwarding in opportunistic networks
PERFORM'10 Proceedings of the 2010 IFIP WG 6.3/7.3 international conference on Performance Evaluation of Computer and Communication Systems: milestones and future challenges
Practical privacy-aware opportunistic networking
BCS-HCI '11 Proceedings of the 25th BCS Conference on Human-Computer Interaction
Proceedings of the 10th international conference on Mobile systems, applications, and services
Proceedings of the 18th annual international conference on Mobile computing and networking
Adaptive user anonymity for mobile opportunistic networks
Proceedings of the seventh ACM international workshop on Challenged networks
Mobile social networks: state-of-the-art and a new vision
International Journal of Communication Systems
Social-tie based content retrieval for delay-tolerant mobile ad-hoc networks
Proceedings of the 8th ACM MobiCom workshop on Challenged networks
Opportunistic message routing using multi-layer social networks
Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systems
ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult due to the fact that the network graph is rarely (if ever) connected. A key challenge is to find a route that can provide good delivery performance and low end-to-end delay in a disconnected network graph where nodes may move freely. We cast this challenge as an information flow problem in a social network. This paper presents social network analysis metrics that may be used to support a novel and practical forwarding solution to provide efficient message delivery in disconnected delay-tolerant MANETs. These metrics are based on social analysis of a node's past interactions and consists of three locally evaluated components: a node's "betweenness" centrality (calculated using ego networks) and a node's social 'similarity' to the destination node and a node's tie strength relationship with the destination node. We present simulations using three real trace data sets to demonstrate that by combining these metrics delivery performance may be achieved close to Epidemic Routing but with significantly reduced overhead. Additionally, we show improved performance when compared to PRoPHET Routing.