AOI-cast by compass routing in delaunay based DVE overlays

This paper presents a AOI cast strategy for P2P Distributed Environments which is exploited to notify the position updates of a peer P, i.e. its heartbeats, to all the peers located in its Area of Interest. An algorithm for the construction of a spanning tree covering all the peers is presented. The algorithm exploits the properties of Delaunay Triangulations to reduce the traffic load on the P2P overlay. The paper presents a set of formal results which hold when the AOI is a circular area and the root of the tree is at the center of the area. The algorithm is then refined to take into account possible inconsistencies among the local views of the peers due to the latency of the underlying network. A set of experimental results are presented.