Efficient topology construction from triangle soup

Author(s):  
Hayong Shin ◽  
J.C. Park ◽  
B.K. Choi ◽  
Y.C. Chung ◽  
Siyoul Rhee
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>


Author(s):  
Alla Sheffer ◽  
Ted Blacker ◽  
Jan Clements ◽  
Michel Bercovier

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 44559-44575
Author(s):  
Hong Guo ◽  
Jie Zhang ◽  
Yongli Zhao ◽  
Huibin Zhang ◽  
Jijun Zhao

2014 ◽  
Vol 15 ◽  
pp. 25-38 ◽  
Author(s):  
Bogdan Pavkovic ◽  
Andrzej Duda ◽  
Won-Joo Hwang ◽  
Fabrice Theoleyre

2013 ◽  
Vol 74 (2) ◽  
pp. 989-1004 ◽  
Author(s):  
Mahzeb Fiaz ◽  
Roomana Yousaf ◽  
Maryam Hanfi ◽  
Waqar Asif ◽  
Hassaan Khaliq Qureshi ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document