Abstract

A sensor graph network is a sensor network model organized according to graph network structure. Structural unit and signal propagation of core nodes are the basic characteristics of sensor graph networks. In sensor networks, network structure recognition is the basis for accurate identification and effective prediction and control of node states. Aiming at the problems of difficult global structure identification and poor interpretability in complex sensor graph networks, based on the characteristics of sensor networks, a method is proposed to firstly unitize the graph network structure and then expand the unit based on the signal transmission path of the core node. This method which builds on unit patulousness and core node signal propagation (called p-law) can rapidly and effectively achieve the global structure identification of a sensor graph network. Different from the traditional graph network structure recognition algorithms such as modularity maximization and spectral clustering, the proposed method reveals the natural evolution process and law of graph network subgroup generation. Experimental results confirm the effectiveness, accuracy and rationality of the proposed method and suggest that our method can be a new approach for graph network global structure recognition.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.