[1] 谭志, 张卉. 基于节点间覆盖关系的改进DV-Hop算法[J]. 北京邮电大学学报, 2014, 37(1):35-38. Tan Zhi, Zhang Hui. Improved DV-Hop localization algorithm based on coverage of nodes[J]. Journal of Beijing University of Posts and Telecommunications, 2014, 37(1):35-38.
[2] Zhong Ziguo, He Tian. RSD:a metric for achieving range-free localization beyond connectivity[J]. IEEE Transactions on Parallel & Distributed Systems, 2011, 22(11):1943-1951.
[3] Fouss F, Pirotte A, Renders J M, et al. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation[J]. IEEE Transactions on Knowledge & Data Engineering, 2007, 19(3):355-369.
[4] Gong Jibing, Gao Xiaoxia, Cheng Hong, et al. Integrating a weighted-average method into the random walk framework to generate individual friend recommendations[J]. Science China Information Sciences, 2017, 60(11):110-104.
[5] Liu Weiping, Lu Linyuan. Link prediction based on local random walk[J]. A Letters Journal Exploring the Frontiers of Physics, 2010, 89(5):58007-58012.
[6] Cao M, Zhang H, Park J, et al. Going the distance for protein function prediction:a new distance metric for protein interaction networks[J]. PLoS One, 2013, 8(10):e76339.
[7] Chen Pengpeng, Yin Yuqing, Gao Shouwan, et al. Localization with graph diffusion property[J]. Sensors, 2017, 17(7):1636.
[8] Niculescu D, Nath B. DV based positioning in Ad hoc networks[J]. Telecommunication Systems, 2003, 22(1):267-280.
[9] Zhong Ziguo, He Tian. Achieving range-free localization beyond connectivity[C]//International Conference on Embedded Networked Sensor Systems. Berkeley:ACM, 2009:281-294.
[10] Savarese C, Rabaey J M, Langendoen K. Robust positioning algorithms for distributed ad-hoc wireless sensor networks[C]//General Track of the Conference on USENIX Technical Conference. USENIX Association, Monterey:ACM, 2002:317-327. |