doi: 10.4304/jsw.9.6.1509-1513
Node Selection Algorithm for Peer-to-Peer Network in 3D Virtual Scene
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
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.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Mar 01, 2024 News!
Vol 19, No 1 has been published with online version [Click]