loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth International Conference on Creating, Connecting and Collaborating through Computing (C5'06)
Autonomous Generation of Spherical P2P Delaunay Network for Global Internet Applications
University of California, Berkeley, California USA
January 26-January 27
ISBN: 0-7695-2563-6
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.
Index Terms:
Sphere, P2P, Virtual Collaborative Space, locationaware data handling, Incremental method, distributive cooperation, Serverless, Computational geometry
Citation:
Hiroaki Kato, Takayuki Eguchi, Masaaki Ohnishi, Shinichi Ueshima, "Autonomous Generation of Spherical P2P Delaunay Network for Global Internet Applications," c5, pp.184-191, Fourth International Conference on Creating, Connecting and Collaborating through Computing (C5'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.