Concurrent face traversal for efficient geometric routing

Clouser, Thomas; Miyashita, M.; Nesterenko, Mikhail

doi:10.1016/j.jpdc.2012.01.009

Cited by 6 publications

(8 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a result of simulation in the environment of Matlab, the characteristics were obtained that allow to conduct the comparative analysis of the algorithm of determining virtual coordinates using the Ricci flow (HRF) and some other geometric-topological routing algorithms [8][9]. The results are shown in Figure 4, prove that GRF is the best of all geometric routing algorithms.…”

Section: Way Of the Topology Representation Of Service Networkmentioning

confidence: 94%

Synthesis of distributed service-oriented structures cloud networks is based on algorithm for determining hyperbolic virtual coordinates

Strykhalyk

Shpur

Demydov

et al. 2015

The Experience of Designing and Application of CAD Systems in Microelectronics

View full text Add to dashboard Cite

Modern distributed service-oriented networks are complex heterogeneous systems. This includes cloud network. To solve synthesis problems of distributed service-oriented structures an algorithm of conformal mapping topology that is based on the definition of hyperbolic virtual coordinates has been proposed. This algorithm requires less iterations than other methods and is able to provide guaranteed delivery of data and decreasing of ratio between the number of iterations and nodes in the process of intensive rapid convergence.

show abstract

Section: Way Of the Topology Representation Of Service Networkmentioning

confidence: 94%

Synthesis of distributed service-oriented structures cloud networks is based on algorithm for determining hyperbolic virtual coordinates

Strykhalyk

Shpur

Demydov

et al. 2015

The Experience of Designing and Application of CAD Systems in Microelectronics

View full text Add to dashboard Cite

show abstract

“…ProgressFace [ 25 ] and Concurrent Face Routing (CFR) [ 26 ] have improved the performance and efficiency of early face routing by modifying how to forward the message instead of adjusting how to change the face. ProgressFace alleviates the problem of too many hops being taken if messages are forwarded in the wrong direction due to the unbalanced deployment of the nodes.…”

Section: Related Workmentioning

confidence: 99%

Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs

Cho

Yim

Kim

2017

Sensors

View full text Add to dashboard Cite

Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult. For message forwarding in networks, a planar graph is used to prevent looping, and because long edges are removed by planarization and the resulting planar graph is composed of short edges, and messages are forwarded along multiple nodes connected by them even though they can be forwarded directly. To solve this, face routing using information on all nodes within 2-hop range was adopted to forward messages directly to the farthest node within radio range. However, as the density of the nodes increases, network performance plunges because message transfer nodes receive and process increased node information. To deal with this problem, we propose a new face routing using the planar graphs of neighboring nodes to improve transfer efficiency. It forwards a message directly to the farthest neighbor and reduces loads and processing time by distributing network graph construction and planarization to the neighbors. It also decreases the amount of location information to be transmitted by sending information on the planar graph nodes rather than on all neighboring nodes. Simulation results show that it significantly improves transfer efficiency.

show abstract

“…ProgressFace [16] and Concurrent Face Routing (CFR) [17] have improved the performance and efficiency of early face routing by modifying how to forward the message instead of adjusting how to change the face. ProgressFace alleviates the problem of too many hops being taken if messages are forwarded in the wrong direction due to the unbalanced deployment of the nodes.…”

Section: Related Workmentioning

confidence: 99%

Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs

Cho

Yim

Kim

2017

Preprint

View full text Add to dashboard Cite

Abstract:Face routing has been adopted in wireless sensor networks (WSNs) where topological 1 changes occur frequently or maintaining full network information is difficult. For message forwarding 2 in networks, a planar graph is used to prevent looping, and because long edges are removed by 3 planarization and the resulting planar graph is composed of short edges, messages are forwarded 4 along multiple nodes connected by them even though they can be forwarded directly. To solve this, 5 face routing using information on all nodes within 2-hop range was adopted to forward messages 6 directly to the farthest node within radio range. However, as the density of the nodes increases, 7 network performance plunges because message transfer nodes receive and process increased node

show abstract

Concurrent face traversal for efficient geometric routing

Cited by 6 publications

References 16 publications

Synthesis of distributed service-oriented structures cloud networks is based on algorithm for determining hyperbolic virtual coordinates

Synthesis of distributed service-oriented structures cloud networks is based on algorithm for determining hyperbolic virtual coordinates

Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs

Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs

Contact Info

Product

Resources

About