Routing algorithm based on social relations in opportunistic networks
- 1 December 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7, 146-149
- https://doi.org/10.1109/iccwamtip.2015.7493963
Abstract
In this paper, we design a social-relations-based routing algorithm (SRBRA). Firstly, by analyzing the real-time data from mobile nodes in the network, we summarize and extract factors that affect social relations between these mobile nodes. Then make inference and evaluation for the complexity and dynamic of these factors from multiple angles, calculate the social-relations values between each sensor node from these factors. Finally, based on the values of social relations, we sort out the network topology information of the neighbours, and select the best next hop relay node for information routing. Simulation experiments show that SRBRA is cost effective and has high delivery ratio.Keywords
This publication has 2 references indexed in Scilit:
- Routing protocols for opportunistic networksJournal of Computer Applications, 2010
- Probabilistic routing in intermittently connected networksACM SIGMOBILE Mobile Computing and Communications Review, 2003