An Advanced AOI-Cast Algorithm Based on PCA

Yan Wang

doi:10.4028/www.scientific.net/AMR.945-949.2523

Paper Titles

Ensemble Learning in Data Mining of Fetal Cardiotocograms
p.2505

Analysis of LED Light Source Energy Consumption for Lighting System Optimized by BP Neural Network Based on Genetic Algorithm
p.2509

Combination Forecasting Method Based on IOWA Operator and Application
p.2515

Research and Implement of an Improved Frame-Slotted ALOHA Anti-Collision Algorithm
p.2519

An Advanced AOI-Cast Algorithm Based on PCA
p.2523

Fuzzy Adaptive Direct Generalized Predictive Control Algorithm in the Application of AWC Control
p.2529

Main Clutch Teaching System Designed on PLC
p.2533

Observer-Based Control of a Class of Switched Fuzzy Systems
p.2539

Switching Control for a Class of Discrete-Time Switched Fuzzy Systems Based on LMI
p.2543

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 945-949An Advanced AOI-Cast Algorithm Based on PCA

An Advanced AOI-Cast Algorithm Based on PCA

Abstract:

Voronoi-based Overlay Network (VON) has been proposed that promises to maintain high overlay topology consistency in a bandwidth-efficient manner. VoroCast constructs a spanning tree across all AOI neighbors based on Voronoi diagrams, while FiboCast dynamically adjusts the messaging range by a Fibonacci sequence. VoroCast improves the AOI scalability of P2P-based NVEs. However, one potential drawback of the schemes is that the child node degrees are only based on peers' positions, but not node capacities. Since each node in VoroCast has different capacity, packet loss will be unavoidable. VoroCast may lead to lower multicast efficiency in AOI. To these problems, an Advanced AOI-cast algorithm based on PCA is presented. In the algorithm, node capacity is related to node CPU (c), node bandwidth (b) and node memory (m), and the node capacity is calculated according to the PCA. An undirected graph is formed through all the nodes in the AOI and the edge weights are calculated by the Gaussian function. Through the prim algorithm, to generate the minimum spanning tree of the weighted undirected graph, and the minimum spanning tree is used as the final multicast tree. The message is delivered through the multicast tree. The simulation results show that the algorithm gains a greater improvement on multicast efficiency, and achieves better scalability.

You might also be interested in these eBooks

Advances in Manufacturing Science and Engineering V

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 945-949)

Pages:

2523-2526

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.945-949.2523

Citation:

Cite this paper

Online since:

June 2014

Authors:

Yan Wang*

Keywords:

Multicast Tree, Node Capacity, PCA, Peer-to-Peer (P2P), Voronoi-Based Overlay Network (VON)

Export:

RIS, BibTeX

Price:

Permissions:

Request Permissions

* - Corresponding Author

References

[1] S. Hu, J. Chen, and T. Chen. VON: a scalable peer-to-peer network for virtual environments. IEEE Network, 20(4): 22-31, (2006).

DOI: 10.1109/mnet.2006.1668400

Google Scholar

[2] I. T. Jolliffe. Principal Component Analysis. Springer Series in Statistics, Berlin: Springer, (1986).

Google Scholar

[3] Man-Chun Li, Shun-Yun Hu, Kuan-Ta Chen: Deployment Issues of Voronoi Self-Organizing Overlays. Self-Adaptive and Self-Organizing Systems (SASO), 2011 Fifth IEEE International Conference on: 216 – 217, (2011).

DOI: 10.1109/saso.2011.35

Google Scholar

[4] VAST Project. http: /vast. sourceforge. net.

Google Scholar