Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

DMRUT-MCDS: Discovery Relationships in the Cyber-Physical Integrated Network

  • Lu, Hongliang (Science and Technology on Parallel and Distributed Processing Laboratory, School of Computer, National University of Defense Technology) ;
  • Cao, Jiannong (Department of Computing Hong Kong Polytechnic University Hung Hom) ;
  • Zhu, Weiping (International School of Software, Wuhan University) ;
  • Jiao, Xianlong (Science and Technology on Parallel and Distributed Processing Laboratory, School of Computer, National University of Defense Technology) ;
  • Lv, Shaohe (Science and Technology on Parallel and Distributed Processing Laboratory, School of Computer, National University of Defense Technology) ;
  • Wang, Xiaodong (Science and Technology on Parallel and Distributed Processing Laboratory, School of Computer, National University of Defense Technology)
  • Received : 2015.04.29
  • Published : 2015.12.31
⟨ Previous Next ⟩

Abstract

In recent years, we have seen a proliferation of mobile-network-enabled smart objects, such as smart-phones and smart-watches, that form a cyber-physical integrated network to connect the cyber and physical worlds through the capabilities of sensing, communicating, and computing. Discovery of the relationship between smart objects is a critical and nontrivial task in cyber-physical integrated network applications. Aiming to find the most stable relationship in the heterogeneous and dynamic cyber-physical network, we propose a distributed and efficient relationship-discovery algorithm, called dynamically maximizing remaining unchanged time with minimum connected dominant set (DMRUT-MCDS) for constructing a backbone with the smallest scale infrastructure. In our proposed algorithm, the impact of the duration of the relationship is considered in order to balance the size and sustain time of the infrastructure. The performance of our algorithm is studied through extensive simulations and the results show that DMRUT-MCDS performs well in different distribution networks.

Keywords

Acknowledgement

Supported by : National Natural Science Foundation of China

References

  1. Y. Huang et al., "Concurrent event detection for asynchronous consistency checking of pervasive context," in Proc. IEEE PerCom, 2009, pp. 1-9.
  2. V. Raychoudhury et al., "Context map for navigating the physical world," in Proc. IEEE PDP, 2012, pp. 146-153.
  3. F. L. Lewis, "Wireless sensor networks," Smart environments: technologies, protocols, and applications, pp. 11-46, 2004.
  4. D. Dong et al., "Distributed coverage in wireless ad hoc and sensor networks by topological graph approaches," IEEE Trans. Comput., vol. 61, no. 10, pp. 1417-1428, 2012. https://doi.org/10.1109/TC.2011.149
  5. B. Liang and Z. J. Haas, "Predictive distance-based mobility management for pcs networks," in Proc. IEEE INFOCOM, vol. 3, 1999, pp. 1377-1384.
  6. T. Camp, J. Boleng, and V. Davies, "A survey of mobility models for ad hoc network research," Wireless Commun. Mobile Comput., vol. 2, no. 5, pp. 483-502, 2002. https://doi.org/10.1002/wcm.72
  7. Z. Tao et al., "A data dissemination algorithm based on geographical quorum system in wireless sensor networks," in Proc. CNSR, 2009, pp. 317-324.
  8. I. Stojmenovic, M. Seddigh, and J. Zunic, "Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks," IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 1, pp. 14-25, 2002. https://doi.org/10.1109/71.980024
  9. J. Wu and H. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks," in Proc. ACM DIAL-M, 1999, pp. 7-14.
  10. L. Bao and J. J. Garcia-Luna-Aceves, "Topology management in ad hoc networks," in Proc. ACM MobiHoc, 2003, pp. 129-140.
  11. O. Schaudt and R. Schrader, "The complexity of connected dominating sets and total dominating sets with specified induced subgraphs," Inf. Process. Lett., vol. 112, no. 24, pp. 953-957, 2012. https://doi.org/10.1016/j.ipl.2012.09.002
  12. Z. Lin et al., "Constructing connected-dominating-set with maximum lifetime in cognitive radio networks," IEEE Trans. Comput., vol. Early Access Articles, no. 1, 2013.
  13. R. B. Bradford, "Relationship discovery in large text collections using latent semantic indexing," in Proc. LACS, 2006.
  14. F. Bu, Y. Hao, and X. Zhu, "Semantic relationship discovery with wikipedia structure," in Proc. IJCAI, AAAI Press, vol. 3, 2011, pp. 1770-1775.
  15. L. Yao, A. Haghighi, S. Riedel, and A. McCallum, "Structured relation discovery using generative models," in Proc. EMNLP, 2011, pp. 1456-1466.
  16. S. Narayana, G. Varma, and A. Govardhan, "Discovering relevant semantic associations using relationship weights," International J. Computer Appl., vol. 87, 2014.
  17. L. Yao et al., "A model for discovering correlations of ubiquitous things," in Proc. IEEE ICDM, 2013, pp. 1253-1258.
  18. W. Xu, C. Marsala, and B. Christophe, "Matching objects to user's queries in web of things' applications," in Proc. IEEE CIComms, Apr. 2013, pp. 31-38.
  19. S. Guha and S. Khuller, "Approximation algorithms for connected dominating sets," Algorithmica, vol. 20, no. 4, pp. 374-387, 1998. https://doi.org/10.1007/PL00009201
  20. L. Ruan et al., "A greedy approximation for minimum connected dominating sets," Theoretical Computer Science, vol. 329, no. 1, pp. 325-330, 2004. https://doi.org/10.1016/j.tcs.2004.08.013
  21. P.-J. Wan, K. M. Alzoubi, and O. Frieder, "Distributed construction of connected dominating set in wireless ad hoc networks," in Proc. IEEE INFOCOM, 2002, pp. 1597-1604.
  22. K. Sakai et al., "Timer-based cds construction in wireless ad hoc networks," IEEE Trans. Mobile Comput., vol. 10, no. 10, pp. 1388-1402, 2011. https://doi.org/10.1109/TMC.2010.244
  23. S. Basagni, C. Petrioli, and R. Petroccia, "Efficiently reconfigurable backbones for wireless sensor networks," Computer Commun., vol. 31, no. 4, pp. 668-698, 2008. https://doi.org/10.1016/j.comcom.2007.10.032