¹Department of Information Science and Engineering, Yanshan University, Qinhuangdao, 066004, China; The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province, Yanshan University, Qinhuangdao 066004, China; Data Industry Research Lab, Qinhuangdao, 066004, China

---

Abstract—A new node selection algorithm is proposed to solve the node selection problem for peer-to-peer network in 3D virtual scene. First of all, according to the restrictions of the user’s viewing field, the data availability cardinality of the candidate node is larger by setting the priority for the area of interest. Then calculate the effective value through the two performance of node. Finally, user selects the node whose effective value is lager to connect to obtain data. Simulations results show that the algorithm compared to other algorithms, improves effectively the success ratio of requesting data and system throughput, and reduces the based latency for user to obtain data.

Index Terms—3D virtual scene, peer-to-peer, area of interest, node selection algorithm

[PDF]

Cite: Xiaoying Gu, Yongshan Liu, Xuefang Yan, "Node Selection Algorithm for Peer-to-Peer Network in 3D Virtual Scene," Journal of Software vol. 9, no. 6, pp. 1509-1513, 2014.