Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
Engaging the Public through Mass-Scale Multimedia Networks
IEEE MultiMedia
How small labels create big improvements
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs
IEEE Transactions on Mobile Computing
Writing on the clean slate: Implementing a socially-aware protocol in Haggle
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Congestion aware data dissemination in social opportunistic networks
ACM SIGMOBILE Mobile Computing and Communications Review
Fair content dissemination in participatory DTNs
Ad Hoc Networks
| Hi-index | 0.00 |
Social network based forwarding algorithms for opportunistic networks, such as Pocket Switched Networks, are primarily concerned with throughput and efficiency. In this paper we seek to improve our understanding of how forwarding based on a heuristic that favours connectivity causes unfair load distribution, which in turn leads to congestion. We propose a number of metrics, that help balance the load distribution and actively prevent congestion. We optimise and filter existing metrics such as Centrality and Similarity, and introduce Availability and Performance feedback mechanisms. We state a preliminary Utility formula that combines our observations allowing us to select a suitable next hop. We present initial modelling results showing that our refinement techniques improve the balance of load distribution, reducing the stress on individual nodes.