A Real Time Node Connectivity Algorithm for Synchronous Cyber Physical and IoT Network Systems
In a strongly connected network, for each network node n , the network connectivity metric can be defined as the smallest integer such that for every node m , there is a directed path of at most j links from m to n . In this paper, we propose a new algorithm to compute the connectivity metric for ev...
Saved in:
| Published in: | Proceedings of IEEE Southeastcon pp. 1 - 8 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
28.03.2020
|
| Subjects: | |
| ISSN: | 1558-058X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In a strongly connected network, for each network node n , the network connectivity metric can be defined as the smallest integer such that for every node m , there is a directed path of at most j links from m to n . In this paper, we propose a new algorithm to compute the connectivity metric for every node of a synchronous network so that each node can compute the value of its own connectivity. Each node is assumed to have a unique identifier and it knows the bound on the total number of nodes of the network. To verify the functionality of the proposed approach, we implemented the proposed algorithm with dynamic biographs for variable number of concurrent network nodes. Also, comprehensive illustration examples are provided. Finally, the simulation results illustrate that the proposed algorithm design has recorded an attractive result in terms of time complexity of order O(N) where N is the total number of concurrent nodes in the synchronous network. Hence, the proposed algorithm can be efficiently employed by real time synchronous communications of IoT networks and cyber physical systems. |
|---|---|
| ISSN: | 1558-058X |
| DOI: | 10.1109/SoutheastCon44009.2020.9249730 |