The Community for Technology Leaders
Creating, Connecting and Collaborating through Computing, International Conference on (2006)
University of California, Berkeley, California USA
Jan. 26, 2006 to Jan. 27, 2006
ISBN: 0-7695-2563-6
pp: 184-191
Hiroaki Kato , Kansai University, Japan
Takayuki Eguchi , Kansai University, Japan
Masaaki Ohnishi , Kansai University, Japan
Shinichi Ueshima , Kansai University, Japan
This paper proposes an algorithm for autonomous generation of spherical Delaunay network in P2P settings for global Internet applications. In our algorithm, nodes work as autonomous computers, sites, sensors, etc, and all nodes generate a local network according the proximity and geometry of neighboring nodes, while all nodes cooperatively and incrementally generate global spherical network. We also show an algorithm for nodes to divide a sphere into their governing areas autonomously. Our approach is applicable to various Internet-based geographical applications including world-wide virtual collaborative space and scalable P2P repository for location-aware data, geo-databases, and so on.
Sphere, P2P, Virtual Collaborative Space, locationaware data handling, Incremental method, distributive cooperation, Serverless, Computational geometry

H. Kato, M. Ohnishi, S. Ueshima and T. Eguchi, "Autonomous Generation of Spherical P2P Delaunay Network for Global Internet Applications," 2006 4th International Conference on Creating, Connecting and Collaborating through Computing(C5), Berkeley, CA, 2006, pp. 184-191.
100 ms
(Ver 3.3 (11022016))