TY - GEN
T1 - A knowledge-based multiplayer collaborative routing in opportunistic networks
AU - Deng, Xiaoheng
AU - Chen, Huan
AU - Cai, Ruting
AU - Zeng, Feng
AU - Xu, Guangquan
AU - Zhang, Honggang
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/8
Y1 - 2019/8
N2 - Wireless opportunistic networks are self-organizing networks which communication devices suffer from intermittent connectivity or disconnections. Users in such networks carry the messages while they are moving, and forward them when encounter with other ones. The existing two types of routings in opportunistic networks have their own shortcomings. The forwarding-based approach can reduce cost but cannot guarantee the latency and delivery probability. The flooding-based approach have higher efficiency but consume a large amount of resource. Therefore, how to make a trade off between the two schemes is a challenge issue. So in this paper, we propose a new routing named Knowledge-based Multiplayer Collaborative (KBMC) Routing. In KBMC, we take some useful knowledge into consideration, such as energy consumption, delivery probability, node velocity, message carrying time. Then using the Nash bargaining game theory to construct a proper utility function in order to decide which message can delivery to which node. That can avoid random and blindfold forwarding, save the network resources. We determine the number of copies of the message by computing activity function based on the knowledge to limit flooding. Through extensive simulations, we demonstrate that our proposed KBMC performs better compared to some classical protocols in terms of overhead, average latency, delivery probability and average hops.
AB - Wireless opportunistic networks are self-organizing networks which communication devices suffer from intermittent connectivity or disconnections. Users in such networks carry the messages while they are moving, and forward them when encounter with other ones. The existing two types of routings in opportunistic networks have their own shortcomings. The forwarding-based approach can reduce cost but cannot guarantee the latency and delivery probability. The flooding-based approach have higher efficiency but consume a large amount of resource. Therefore, how to make a trade off between the two schemes is a challenge issue. So in this paper, we propose a new routing named Knowledge-based Multiplayer Collaborative (KBMC) Routing. In KBMC, we take some useful knowledge into consideration, such as energy consumption, delivery probability, node velocity, message carrying time. Then using the Nash bargaining game theory to construct a proper utility function in order to decide which message can delivery to which node. That can avoid random and blindfold forwarding, save the network resources. We determine the number of copies of the message by computing activity function based on the knowledge to limit flooding. Through extensive simulations, we demonstrate that our proposed KBMC performs better compared to some classical protocols in terms of overhead, average latency, delivery probability and average hops.
KW - Knowledge-based
KW - Nash bargaining game
KW - Opportunistic networks
UR - https://www.scopus.com/pages/publications/85075130955
UR - https://www.scopus.com/pages/publications/85075130955#tab=citedBy
U2 - 10.1109/DASC/PiCom/CBDCom/CyberSciTech.2019.00019
DO - 10.1109/DASC/PiCom/CBDCom/CyberSciTech.2019.00019
M3 - Conference contribution
AN - SCOPUS:85075130955
T3 - Proceedings - IEEE 17th International Conference on Dependable, Autonomic and Secure Computing, IEEE 17th International Conference on Pervasive Intelligence and Computing, IEEE 5th International Conference on Cloud and Big Data Computing, 4th Cyber Science and Technology Congress, DASC-PiCom-CBDCom-CyberSciTech 2019
SP - 16
EP - 21
BT - Proceedings - IEEE 17th International Conference on Dependable, Autonomic and Secure Computing, IEEE 17th International Conference on Pervasive Intelligence and Computing, IEEE 5th International Conference on Cloud and Big Data Computing, 4th Cyber Science and Technology Congress, DASC-PiCom-CBDCom-CyberSciTech 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 17th IEEE International Conference on Dependable, Autonomic and Secure Computing, IEEE 17th International Conference on Pervasive Intelligence and Computing, IEEE 5th International Conference on Cloud and Big Data Computing, 4th Cyber Science and Technology Congress, DASC-PiCom-CBDCom-CyberSciTech 2019
Y2 - 5 August 2019 through 8 August 2019
ER -