scholarly journals A Regional Network Topology Construction Algorithm Based On Sampling Measurement

2021 ◽  
Vol 1861 (1) ◽  
pp. 012025
Author(s):  
Zhiyuan Tao ◽  
Yan Liu
2013 ◽  
Author(s):  
Justyna K. Rzucidlo ◽  
Paige L. Roseman ◽  
Paul J. Laurienti ◽  
Dale Dagenbach

2021 ◽  
Author(s):  
Waltenegus Dargie

<div>Self-organizing protocols and algorithms require knowledge of the underlying topology of the network. The topology can be represented by a graph or an adjacency matrix. In most practical cases, establishing the topology prior to a deployment is not possible because the exact placement of nodes and the existence of a reliable link between any two individual nodes cannot guaranteed. Therefore, this task has to be carried out after deployment. If the network is stand-alone and certain aspects are fixed (such as the identity of the base station, the size of the network, etc.), the task is achievable. If, however, the network has to interact with other systems -- such as Unmanned Aerial Vehicles (UAVs) or mobile robots -- whose operation is affected by environmental factors, the task can be difficult to achieve. In this paper we propose a dynamic topology construction algorithm, assuming that the network is a part of a joint deployment and does not have a fixed based station.</div>


2010 ◽  
Vol 97-101 ◽  
pp. 3397-3402 ◽  
Author(s):  
Guang Yang ◽  
Wei Jun Liu ◽  
Wei Wang ◽  
Lan Yun Qin

Constructing the topology of STL file efficiently is a key factor to improve the efficiency of slicing algorithm. In this paper a topology construction algorithm based on Standard Template Library set containers and a rapid slicing algorithm are developed. The algorithm developed removes a large number of redundant vertices, and only calculates intersection per triangular facet with slice plane once, and attains another point of intersection directly from the adjacent relations. In addition, the algorithm can reduce the times of traversing and sorting for the triangular facets, and also the times of calculation of intersection in the slicing processes, which results in the simplification of the process of constructing the slice contour, consequently the efficiency of the slicing algorithm is improved.


2014 ◽  
Vol 590 ◽  
pp. 586-590 ◽  
Author(s):  
Hui Qun Yang ◽  
Gui Jun Liu ◽  
Ting Wang

To efficiently construct the topology of STL file is one of the key factors to improve efficiency of slicing algorithm. In this paper a topology construction algorithm based on triangle facets ring and a rapid slicing algorithm are developed, in which the flag variables are defined to reduce search range when slicing. Then the algorithm can reduce the times of traversing and sorting for the triangle facets and the times of calculation intersection in the slicing processes, and it also can simplify the process of constructing the slice contour so as to improve the efficiency of the slicing algorithm.


2013 ◽  
Vol 765-767 ◽  
pp. 1254-1258
Author(s):  
Ai Xia Zhou ◽  
Lian Feng Gao ◽  
Jing Feng ◽  
Li Yu ◽  
Xue Yan Zhang

In order to meet the special needs of military applications, network users were classified according to characteristics of users and a hierarchical behavior-controllable P2P network topology construction was designed. In the new construction, different information has different circulation range and the survivability and expansion characteristics of the P2P network were made full use.


Sign in / Sign up

Export Citation Format

Share Document