Generic and efficient connectivity determination for IoT applications

Xingyu He, Zhiwei Peng, Jiangtao Wang, Guisong Yang

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)


Network connectivity, with its significant application value for data transmission and node cooperation, has drawn a great concern in recent years. Facing the heterogeneity and complexity of the IoT system, the connectivity determination between nodes in the network is a big challenge. In view of this, this article proposes a generic and efficient connectivity determination method for IoT applications. This method first characterizes the connectivity parameters of nodes, including the direct connection probabilities between nodes, the degree centrality, and the betweenness centrality of nodes, and based on them, then constructs a node connectivity random graph (NCRG) and splits the NCRG into separate components. Furthermore, it converts the connectivity between nodes located in different components into the connectivity between these components and provides an algorithm to determine their connectivity. Specifically, three testing rules are defined in the algorithm to rank the testing priorities of these components and testing edges between these components. The simulation results show that the proposed method can efficiently achieve high accuracy with less cost.

Original languageEnglish
Article number9015974
Pages (from-to)5291-5301
Number of pages11
JournalIEEE Internet of Things Journal
Issue number6
Early online date27 Feb 2020
Publication statusPublished - Jun 2020
Externally publishedYes


  • Connectivity determination
  • Network connectivity
  • Random graph
  • Testing rules

ASJC Scopus subject areas

  • Signal Processing
  • Information Systems
  • Hardware and Architecture
  • Computer Science Applications
  • Computer Networks and Communications


Dive into the research topics of 'Generic and efficient connectivity determination for IoT applications'. Together they form a unique fingerprint.

Cite this