2006 | OriginalPaper | Chapter
Indexing Moving Objects on Road Networks in P2P and Broadcasting Environments
Authors : Hye-Young Kang, Jung-Soo Kim, Ki-Joune Li
Published in: Web and Wireless Geographical Information Systems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Scalability is one of the crucial problems in realizing massively distributed systems such as ubiquitous computing. In this paper, we focus on indexing methods in massively distributed environments. A number of work on indexing in P2P, like CAN and Chord, have been devoted to overcome this problem. The lengths of routing path are
$O(dn^{\frac{1}{d}})$
for CAN and
O
(log
n
) for Chord, which are in fact the cost of search, where there are
n
nodes. In this paper, we propose an alternative indexing scheme not only relying on P2P but also on broadcasting environments. The contributions of this paper include firstly the reduction of routing path to nearly
O
(1) for road-oriented query by using broadcasting, and secondly handling the mobility of nodes on road networks.