Journal of Systems Engineering and Electronics ›› 2011, Vol. 33 ›› Issue (9): 2019-2024.doi: 10.3969/j.issn.1001-506X.2011.09.19

• 系统工程 • 上一篇    下一篇


葛斌, 唐九阳, 张翀, 汤大权, 肖卫东   

  1. 国防科学技术大学信息系统工程重点实验室, 湖南 长沙 410073
  • 出版日期:2011-09-17 发布日期:2010-01-03

Distributed spatiotemporal indexing using P2P in battlefield environment

GE Bin, TANG Jiu-yang, ZHANG Chong, TANG Da-, XIAO Wei-dong   

  1. Science and Technology on Information Systems Engineering Laboratory, National University of  Defense Technology, Changsha 410073, China
  • Online:2011-09-17 Published:2010-01-03


对时空信息进行合理组织可以高效完成时空查询,从而快速支持军事决策和行动的顺利完成。针对战场环境中时空数据的分布独立性,各节点的自治性、动态性及协作性,提出了分布式基于对等计算的时空索引(pear to pear spatio temporal indexing, P2PSTI)结构,该索引基于分布式哈希表(distributed Hash table, DHT)技术组织节点的拓扑结构,采用Hilbert曲线将时空对象映射到一维空间,并利用该曲线的局部保持特性设计了高效的查询算法,大大降低了路由消息数量,提高了时空查询性能。实验结果表明,P2PSTI查询性能好,索引维护代价低,负载均衡策略效果明显。


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.