Distributed Information Storage and Retrieval in 3-D Sensor Networks With General Topologies
Distributed Information Storage and Retrieval in 3-D Sensor Networks With General Topologies
复制标题
DOI：
10.1109/tnet.2014.2317809
复制
发表时间：
2015-08
期刊：
影响因子：
--
通讯作者：
Yang Yang-Yang;Miao Jin;Yao Zhao;Hongyi Wu
中科院分区：
文献类型：
--
作者：
Yang Yang-Yang;Miao Jin;Yao Zhao;Hongyi Wu
以数据为中心的分布式网内处理旨在减少通信所消耗的能量，并建立一个自包含的数据存储、检索、聚合和查询传感器系统，该系统更多地关注数据本身，而不是单个网络节点的身份。基于双规则的方案支持有效的以网络中数据为中心的信息存储和检索，特别是对于聚集数据，因为在网络中生成的具有不同类型的所有数据可以沿着沿着任何单个检索曲线方便地检索。以前的双统治为基础的研究集中在二维（2-D）的无线传感器网络中的2-D平面设置假设。随着人们对在三维空间部署无线传感器的兴趣日益增加，在一般的三维传感器网络中设计基于双规则的方法是一项紧迫而又具有根本挑战性的工作，因为基于双规则的方案通常具有比其他分布式网络中以数据为中心的处理方案更困难的几何约束。在这项研究中，我们提出了一个地理位置无关的双规则为基础的方法，一般的三维传感器网络可能复杂的拓扑结构和几何形状。在不知道地理位置和距离界限的情况下，查询简单地沿着沿着简单的曲线行进，保证成功地检索跨网络的具有一种或不同类型的跨时间和空间的聚合数据。大量的仿真和比较表明，该方案具有成本低，流量负载均衡。
Distributed in-network data-centric processing aims to reduce energy consumed for communication and establish a self-contained data storage, retrieval, aggregation, and query sensor system that focuses more on the data itself rather than the identities of the individual network nodes. Double-ruling-based schemes support efficient in-network data-centric information storage and retrieval, especially for aggregated data, since all data with different types generated in a network can be conveniently retrieved along any single retrieval curve. Previous double-ruling-based research focuses on two-dimensional (2-D) wireless sensor networks where a 2-D planar setting is assumed. With increasing interests in deploying wireless sensors in three-dimensional (3-D) space for various applications, it is urgent yet fundamentally challenging to design double-ruling-based approach in general 3-D sensor networks because double-ruling-based schemes in general have much harder geometric constraints than other distributed in-network data-centric processing schemes. In this research, we propose a geographic location-free double-ruling-based approach for general 3-D sensor networks with possibly complicated topology and geometric shapes. Without the knowledge of the geographic location and the distance bound, a query simply travels along a simple curve with the guaranteed success to retrieve aggregated data through time and space with one or different types across the network. Extensive simulations and comparisons show the proposed scheme with low cost and a balanced traffic load.