Generating Skip Delaunay Network for P2P Geocasting

Tsuboi, S.; Oku, Tatsuo; Ohnishi, Masato; Ueshima, Shinichi

doi:10.1109/c5.2008.13

Cited by 7 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Node discoveries for far distance are performed by multi-hop forwarding to the closer node. Range retrievals are also possible by the greedy routing [10] or the compass routing [7].…”

Section: Delaunay Overlay Networkmentioning

confidence: 99%

An Examination of Sensor Data Collection Method for Spatial Interpolation on Hierarchical Delaunay Overlay Network

Shinomiya

Teranishi

Harumoto

et al. 2010

2010 Eleventh International Conference on Mobile Data Management

View full text Add to dashboard Cite

Geographical contour lines are often used for the analysis of the sensor data distribution on wide area. In this paper, we propose a method to reconstruct contour lines by collecting sensor data from widely distributed sensors. In this case, it is redundant to collect all sensors from wide area since geographically closed sensors sense similar data. We propose a sensor data collection method for peer-to-peer sensor network to realize spatial interpolation of sensor data. In our proposal, we assume hierarchical Delaunay overlay network (HDOV) to collect sensor data uniformly. In addition, using structure of HDOV, more local sensor data is collected that affect on the spatial interpolation. By this mechanism, redundant sensor data to reconstruct geographical contour lines is reduced. The simulation result shows that our proposal can reconstruct accurate geographical contour lines, reducing target node and message numbers for data collection.

show abstract

“…Node discoveries for far distance are performed by multi-hop forwarding to the closer node. Range retrievals are also possible by the greedy routing [10] or the compass routing [7].…”

Section: Delaunay Overlay Networkmentioning

confidence: 99%

An Examination of Sensor Data Collection Method for Spatial Interpolation on Hierarchical Delaunay Overlay Network

Shinomiya

Teranishi

Harumoto

et al. 2010

2010 Eleventh International Conference on Mobile Data Management

View full text Add to dashboard Cite

show abstract

“…To overcome such a weakness of Delaunay networks, several methods have been proposed in the literature, such as the introduction of hierarchical structure to the overlay and a hybrid with other network topology. 17,18 The routing in such hierarchical networks generally consists of three phases; namely (1) the routing to a gateway peer participating in both upper and lower layers through a path in the lower later, (2) the routing to a gateway peer closest to the destination through a path in the upper layer, and (3) the routing to the destination through the lower layer. The performance of such a three-phase routing is affected by the ratio of peers participating in the upper layer; namely if it is too small, it takes long time before reaching the gateway and if it is too large, it takes long time for the routing in the upper layer.…”

Section: S Fujitamentioning

confidence: 99%

“…In fact, the improvement of the routing performance is attained by the hyper-cubic shortcut links, and the fact that the underlying graph is organized according to DT is not used except for the calculation of the intersection of Voronoi regions with the given bands. 13 Skip Delaunay Network (SDN) 18 proposed by the same authors is a more explicit extension of the skip graph. Recall that the basic idea of skip graph is to assign a random bit sequence to each peer as the ID and to construct ring structure defined by the lexicographical order of IDs in a hierarchical manner.…”

Section: Hierarchical Delaunay Networkmentioning

confidence: 99%

Three-Tier Delaunay Network as a Topology for Peer-to-Peer Overlay

Fujita

2019

J. Inter. Net.

View full text Add to dashboard Cite

This paper considers the problem of improving the routing performance of hierarchical Delaunay networks. Delaunay network is a network topology for peer-to-peer systems based on the Delaunay triangulation of a set of points associated with a set of peers. It is known that Delaunay networks have a favorable property as a topology for peer-to-peer systems such that a greedy routing scheme always delivers a given message to its destination without encountering a dead-end. The key idea used in the proposed method is to apply a hash function to the address of participant peers. More concretely, by applying a hash function to the coordinate point of the peers and by associating several points to each peer, we could realize an overlay so that the number of hops to the destination in the original network could be significantly reduced.

show abstract

“…Efficiency decreases in exchange for a decreased average hop count, since the additional messages are redundant. Tsuboi et al [17] recently proposed Skip Delaunay Network (SDN), which is a hierarchy of DTs and enables a unicast and a geocast protocol with log(N ) hop counts. Their geocast protocol (GeoMulticast) delivers a message to a rectangular region.…”

Section: Node Outdegree and Hop Countmentioning

confidence: 99%