A Distributed Algorithm for Building Space Topology Matching

  • Yifan Wang
  • Qianchuan ZhaoEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 890)


Nowadays, distributed systems turn to be increasingly competitive with centralized systems, especially in the construction field. Thus, it is indispensable to design new effective distributed algorithms. In this work, a distributed algorithm focusing on the building space topology matching problem is proposed. In distributed control architectures, each floor is equipped with several Computing Process Nodes (CPNs) which play roles as controllers in the system. Our goal is to make every CPN in the building system acquire its own position on a designed CAD drawing. To achieve this, we utilize the geographic relationships among nodes. In the algorithm, each node compares its local topology features to the ones in the drawing and communicates with their neighborhoods. We prove that the topology matching problem can be solved by using this algorithm and derive the upper bound of the number of iterations. The experiments show that this algorithm works successfully in real designed buildings.


Distributed algorithm Building space topology matching CPN Geographic direction Topology feature 



This work was supported by the National Key Research and Development Project of China (No. 2017YFC0704100 entitled New generation intelligent building platform techniques, and 2016YFB0901900), the National Natural Science Foundation of China (No. 61425027), the 111 International Collaboration Program of China under Grant B06002, BP2018006 and Special fund of Suzhou-Tsinghua Innovation Leading Action (Project Number: 2016SZ0202).

We appreciate Dr. Ziyan Jiang and Ms. An Jiang from Tsinghua University, Beijing, China, for the helpful discussion and anonymous reviewers for constructive comments.


  1. 1.
    Jiang, Z., Dai, Y.: A decentralized, flat-structured building automation system. Energy Procedia 122, 68–73 (2017)CrossRefGoogle Scholar
  2. 2.
    Yao, X., Gong, D., Gu, Y.: Mathematic model of node matching based on adjacency matrix and evolutionary solutions. Phys. A 416, 354–360 (2014)CrossRefGoogle Scholar
  3. 3.
    Yao, X., Gong, D., Wang, P., et al.: Multi-objective optimization model and evolutional solution of network node matching problem. Phys. A 483, 495–502 (2017)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Tao, S., Wang, S.: An algorithm for weighted sub-graph matching based on gradient flows. Inf. Sci. 340–341, 104–121 (2016)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Fan, Y.J., Chen, L.F., Guo, G.D.: Graph similarity measure by matching global structure. J. Chin. Comput. Syst. 37, 1488 (2016)Google Scholar
  6. 6.
    McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symbolic Comput. 60, 94–112 (2014)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Mushtaha, E.S., Arar, M.S.: House typology from adjacency diagram theory to space orientation theory. Int. J. Civil Environ. Eng. 11(2), 60–66 (2011)Google Scholar
  8. 8.
    Zhao, Q., Jiang, Z.: Insect Intelligent Building (I2B): A new architecture of building control systems based on Internet of Things (IoT). In: Fang, Q., et al. (eds.) Advancements in Smart City and Intelligent Building, Advances in Intelligent Systems and Computing 890, Chap. 42 (2019)Google Scholar
  9. 9.
    Lynch, N.A: Distributed Algorithms. Morgan Kaufmann (1996)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Tsinghua National Laboratory for Information Science and Technology (TNList), Department of AutomationCenter for Intelligent and Networked Systems (CFINS), Tsinghua UniversityBeijingChina

Personalised recommendations