Incremental Construction of Delaunay Overlaid Network for Virtual Collaborative Space

Ohnishi, Masato; Nishide, Ryo; Ueshima, Shinichi

doi:10.1109/c5.2005.15

Cited by 25 publications

(33 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Section 2 gives an overview of the existing Delaunay overlay construction method [2]. Section 3 describes the convergence principle and implementation guidelines.…”

mentioning

confidence: 99%

“…These were never described in Ref. [2]. And, the Delaunay overlay a network construction method that uses detour overlay paths.…”

mentioning

confidence: 99%

“…We call such a network a partially reachable network (PRN). Delaunay overlay construction method [2] cannot be applied to PRN. This paper proposes a new Delaunay overlay construction method that networks wireless links by local control messages.…”

mentioning

confidence: 99%

“…But, existing method [2] assumes that a lower layer network is a complete reachable network (CRN), namely, a network in which arbitrary nodes can communicate with each other. An IP network is an example of a CRN-type low-layer network.…”

mentioning

confidence: 99%

“…1 may not work since the method has all nodes sending a location advertisement message to all nodes, and the wireless link capacity may be inadequate for the quantity of messages. We studied adapting a Delaunay overlay network construction method [2] that uses spatial location information with the wireless mesh network. This method can construct a network (having reachability) by locally exchanging few control messages.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Incremental Distributed Construction Method of Delaunay Overlay Network on Detour Overlay Paths

Ohnishi

Inoue

Harai

2013

Journal of Information Processing

View full text Add to dashboard Cite

Abstract:In wide-area disaster situations, wireless mesh networks lose data communication reachability among arbitrary pairs of base stations due to the loss of routing information propagation and synchronization. This paper uses a Delaunay overlay approach to propose a distributed networking method in which detour overlay paths are incrementally added to a wireless mesh network in wide-area disaster situations. For this purpose, the following functions are added to each base station for wireless multi-hop communication: obtaining the spatial location, exchanging spatial location messages between base stations, transferring data based on spatial locations of base stations. The proposed method always constructs a Delaunay overlay network with detour paths on the condition that a set of wireless links provides a connected graph even if it does not initially provide reachability among arbitrary base stations in the connected graph. This is different from the previous method that assumes a connected graph and reachability. This paper therefore also shows a new convergence principle and implementation guidelines that do not interfere with the existing convergence principle. A simulation is then used to evaluate the detour length and table size of the proposed method. It shows that the proposed method has scalability. This scalability provides adaptable low-link quality and increases the number of nodes in wide-area disaster situations.

show abstract

“…Section 2 gives an overview of the existing Delaunay overlay construction method [2]. Section 3 describes the convergence principle and implementation guidelines.…”

mentioning

confidence: 99%

“…These were never described in Ref. [2]. And, the Delaunay overlay a network construction method that uses detour overlay paths.…”

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Incremental Distributed Construction Method of Delaunay Overlay Network on Detour Overlay Paths

Ohnishi

Inoue

Harai

2013

Journal of Information Processing

View full text Add to dashboard Cite

show abstract

AOI‐cast in distributed virtual environments: an approach based on delay tolerant reverse compass routing

Ricci

Genovali

Carlini

et al. 2012

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThis paper presents a novel Area Of Interest (AOI)‐cast algorithm for distributed virtual environments targeted to Delaunay‐based P2P overlays. The algorithm exploits the mathematical properties of Delaunay triangulations to build a spanning tree supporting the notification of the events generated by a peer to the other ones located in its AOI. The spanning tree is computed by the reversing compass routing, a routing algorithm proposed for geometric networks. Our approach presents a set of novel features. First, it requires only the knowledge of the peer's neighbors, so that the amount of traffic load on the P2P overlay is minimized. Second, we prove that, for circular shaped AOI, the algorithm builds a spanning tree covering all and only the peers of the AOI. Finally, our approach takes into account the possible inconsistencies among the local views of the peers, because the network latency, by introducing a tolerance threshold in the reverse compass routing. We present a set of simulations considering both synthetic data and real data traces taken from a real multiplayer game, which show the effectiveness of our proposal. Copyright © 2012 John Wiley & Sons, Ltd.

show abstract

Multidimensional range queries on hierarchical Voronoi overlays

Ferrucci

Ricci

Albano

et al. 2016

Journal of Computer and System Sciences

View full text Add to dashboard Cite

The definition of a support for multi-attribute range queries is mandatory for highly distributed systems. Even if several solutions have been proposed in the last decade, most of them do not meet the requirements of recent platforms, like IoT or smart cities. The paper presents an approach that builds a multidimensional Voronoi graph by exploiting the attributes of the objects published by a node. Our solution overcomes the curse of dimensionality issue affecting Voronoi Tessellations in high dimensional spaces by defining a Voronoi hierarchy. The paper formally defines the structure, analysis the complexity of the operations and presents experimental results

show abstract

Incremental Construction of Delaunay Overlaid Network for Virtual Collaborative Space

Cited by 25 publications

References 21 publications

Incremental Distributed Construction Method of Delaunay Overlay Network on Detour Overlay Paths

Incremental Distributed Construction Method of Delaunay Overlay Network on Detour Overlay Paths

AOI‐cast in distributed virtual environments: an approach based on delay tolerant reverse compass routing

Multidimensional range queries on hierarchical Voronoi overlays

Contact Info

Product

Resources

About