A Distributed Community-based Routing Algorithms for Opportunistic Networks

DOI

10.2991/amcce-17.2017.27How to use a DOI?

Keywords

Opportunistic networks, routing algorithms, distributed communities, message transmission, cross-layer listening mechanism

Abstract

According to the problem that there are redundant control overheads in community partitioning phase and the large transmission delay and the low success rate in transmission phase in the community-based opportunistic network, we propose EDCRA (Efficient Distributed Community-based Routing Algorithms for opportunistic networks). By distinguishing the community of the encounter node is single-node community or multi-node community, EDCRA simplify the interaction flow of the encounter node merging into other community in the community partitioning phase. And through the efficient cross-layer listening mechanism, the node carrying message find eligible forwarding nodes in its neighbor nodes in the data transmission phase, so that the message can be forwarded to the destination community more efficiently. Simulation results show that the performance of EDCRA algorithm is higher than that of CR and Bubble Rap in terms of control overhead, average end-to-end delay and transmission success rate.

Copyright

© 2017, 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  - Zhi Ren
AU  - HongWei Cao
AU  - Yong Zhang
AU  - Yanan Zhao
PY  - 2017/03
DA  - 2017/03
TI  - A Distributed Community-based Routing Algorithms for Opportunistic Networks
BT  - Proceedings of the 2017 2nd International Conference on Automation, Mechanical Control and Computational Engineering (AMCCE 2017)
PB  - Atlantis Press
SP  - 152
EP  - 156
SN  - 2352-5401
UR  - https://doi.org/10.2991/amcce-17.2017.27
DO  - 10.2991/amcce-17.2017.27
ID  - Ren2017/03
ER  -