Abstract:

High efficiency in answering spatiotemporal (ST) query can be achieved if ST information is organized in battlefield reasonably, which is conducive to military decisions and operations fast and successfully. Aiming at the distribution independency of ST data in battlefield environment, a distributed pear to pear ST  indexing  (P2PSTI) structure is proposed, in which the topology of nodes is constructed using a distributed Hash table (DHT), and ST  objects are mapped into 1 dimension space using the Hilbert curve. Thus, the localitypreserved characteristic of the Hilbert curve is sufficiently utilized to devise a high efficient query algorithm, which greatly reduces routing messages so that query performance is enhanced. Experimental results reveal that P2PSTI outperforms other related algorithms in query, and exhibits a low index maintaining cost as well as a good load balancing strategy.