Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
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
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
SimBetAge: utilizing temporal changes in social networks for pocket switched networks
Proceedings of the 1st ACM workshop on User-provided networking: challenges and opportunities
Social-Greedy: a socially-based greedy routing algorithm for delay tolerant networks
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
On Nodal Encounter Patterns in Wireless LAN Traces
IEEE Transactions on Mobile Computing
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Quantitative measurement and method for detecting anti-community structures in complex networks
International Journal of Wireless and Mobile Computing
Detecting community structure in bipartite networks based on matrix factorisation
International Journal of Wireless and Mobile Computing
Hi-index | 0.00 |
A Mobile Social Network MSN is defined as a mobile network that uses social relationships to determine node communication. Many wireless networks including ad hoc networks do not reflect a real world deployment because of routing implementation difficulties. However, with the enormous use of Social Network Sites SNSs including Twitter and Facebook, MSNs can be exploited to make routing easier. Although there has been some research effort devoted to routing using these networks, the MSN routing protocols proposed in the literature suffer from either a low delivery ratio or high memory requirements. This paper presents a new routing protocol status for MSNs which has excellent performance in terms of delivery ratio and memory requirements. It employs the online status of a node to make forwarding decisions. Status has a low overhead ratio, low average delay and low computational complexity at the node level.