Abstract | ||
---|---|---|
In this paper, we propose skip Delaunay network (SDN), which is a scalable geographic network that connects computational entities or nodes in a 2D space by constant P2P hop counts. SDN has a hybrid structure of hierarchical logical networks and Delaunay networks, both of which are generated by P2P communications among nodes. It enables, GeoUnicast to specified points, Geo Multicast to regions, as well as range queries with log(N) hop counts. We propose an autonomous generation algorithm of SDN and evaluate network parameters and geocast parameters of SDN by numerical simulations. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1109/C5.2008.13 | Poitiers |
Keywords | Field | DocType |
delaunay network,scalable geographic network,skip delaunay network,p2p communication,network parameter,generating skip delaunay network,p2p hop count,computational entity,p2p geocasting,hierarchical logical network,autonomous generation algorithm,hop count,generic algorithm,p2p,numerical simulation,range query,geocast | Computer science,Range query (data structures),Computer network,Peer to peer computing,Multicast,Hop (networking),Geocast,Delaunay triangulation,Distributed computing,Scalability | Conference |
ISBN | Citations | PageRank |
978-0-7695-3115-1 | 3 | 0.45 |
References | Authors | |
13 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shinji Tsuboi | 1 | 6 | 0.89 |
Tomoteru Oku | 2 | 3 | 0.45 |
Masaaki Ohnishi | 3 | 74 | 9.89 |
Shinichi Ueshima | 4 | 45 | 15.31 |