A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
How Small Labels Create Big Improvements
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
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 multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Social network analysis on data diffusion in delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
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
Routing in socially selfish delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A sociability-based routing scheme for delay-tolerant networks
EURASIP Journal on Wireless Communications and Networking - Special issue on opportunistic and delay tolerant networks
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
IEEE Transactions on Mobile Computing
Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks
IEEE Transactions on Parallel and Distributed Systems
SEDUM: Exploiting Social Networks in Utility--Based Distributed Routing for DTNs
IEEE Transactions on Computers
Analysis of a Hypercube-Based Social Feature Multipath Routing in Delay Tolerant Networks
IEEE Transactions on Parallel and Distributed Systems
SGBR: A Routing Protocol for Delay Tolerant Networks Using Social Grouping
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
The routing efficiency in delay tolerant networks is degraded due to intermittent connection and high latency. Additionally, socially selfish nodes in social networks refuse to provide message forwarding service since there are limited resources. To solve these problems, an improved routing algorithm based on the social link awareness is proposed. In this algorithm, multiple social features of the nodes' behaviors are utilized to quantify the nodes pairs' social links. The social links of the nodes pairs are computed based on their encounter history. These social links can be used to construct the friendship communities of the nodes. The intra-community and inter-community forwarding mechanisms are implemented to raise the successful delivery ratio with low overhead and decrease the transmission delay. Simulation results show that the proposed algorithm shortens the routing delay and increases the successful delivery ratio, thereby improving the routing efficiency.