Cooperative willingness perception based routing algorithm in opportunistic network

DOI

10.2991/icamcs-16.2016.178How to use a DOI?

Keywords

opportunistic networks, cooperative willingness, social relation, routing algorithm

Abstract

There is a cooperative willingness perception based routing algorithm is proposed in this paper. The average duration of messages forwarding is utilized to measure the cooperative willingness between nodes; moreover combining with the parameter of contact probability between nodes, the relay node can be selected reasonably. Further, in order to maximize the utility of network resources, message priority is considered. Results show that the proposed algorithm can effectively improve network performance.

Copyright

© 2016, 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/).

Download article (PDF)

TY  - CONF
AU  - Yi Xie
AU  - Ke Pan
AU  - Jie Shen
AU  - Huiping Yang
PY  - 2016/06
DA  - 2016/06
TI  - Cooperative willingness perception based routing algorithm in opportunistic network
BT  - Proceedings of the 2016 5th International Conference on Advanced Materials and Computer Science
PB  - Atlantis Press
SP  - 875
EP  - 878
SN  - 2352-5401
UR  - https://doi.org/10.2991/icamcs-16.2016.178
DO  - 10.2991/icamcs-16.2016.178
ID  - Xie2016/06
ER  -