A Secure Message Transmission Scheme in an Extended Network of Crossed Cubes

DOI

10.2991/cnct-16.2017.105How to use a DOI?

Keywords

Extended network of crossed cubes, Secure message transmission scheme, Independent spanning trees, Vertex-disjoint paths.

Abstract

Secure message transmission schemes in interconnection networks can be achieved by constructing multiple vertex-disjoint paths or independent spanning trees. The extended network of crossed cube (ECC for short) has the advantages such as easy to be deployed and low ratio between number of vertices and diameter. In this paper, we have studied a secure message transmission scheme in ECC by constructing independent spanning trees in and proposed a constructive algorithm with the time complexity , where is the number of . Furthermore, the maximum length of the vertex-disjoint paths between any two vertices is shown to be +3. In addition, simulation of vertex-disjoint paths based on JUNG has also been discussed.

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  - Bao-lei CHENG
AU  - Ting PAN
AU  - Jian-xi FAN
AU  - Jing-ya ZHOU
AU  - Zhao LIU
PY  - 2016/12
DA  - 2016/12
TI  - A Secure Message Transmission Scheme in an Extended Network of Crossed Cubes
BT  - Proceedings of the International Conference on Computer Networks and Communication Technology (CNCT 2016)
PB  - Atlantis Press
SP  - 757
EP  - 764
SN  - 2352-538X
UR  - https://doi.org/10.2991/cnct-16.2017.105
DO  - 10.2991/cnct-16.2017.105
ID  - CHENG2016/12
ER  -