An Opportunity Networks Routing Algorithm Based On Social Model
- DOI
- 10.2991/isrme-15.2015.151How to use a DOI?
- Keywords
- opportunistic networks; opportunistic routing; social; relationship degree
- Abstract
In this paper, an opportunity networks routing algorithm, which is suitable a certain social model, is proposed based on social. In this algorithm, the relationship degree between nodes is computed based on the social nature; and the central of nodes is computed based on the level of activity in opportunity networks. An opportunity networks routing algorithm ComOR, which achieves selective forwarding data packets by using the central and relationship degree of nodes,is proposed. Simulation results show that the routing algorithm significantly reduce the consumption of buffer space of equipments and effectively reduce the count of forwarding data packets compared with the present algorithms.In a word,ComOR improves the packets delivery rate and performances stably.
- Copyright
- © 2015, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Zhuo Tian AU - Baicheng Li PY - 2015/04 DA - 2015/04 TI - An Opportunity Networks Routing Algorithm Based On Social Model BT - Proceedings of the 2015 International Conference on Intelligent Systems Research and Mechatronics Engineering PB - Atlantis Press SP - 748 EP - 751 SN - 1951-6851 UR - https://doi.org/10.2991/isrme-15.2015.151 DO - 10.2991/isrme-15.2015.151 ID - Tian2015/04 ER -