论文部分内容阅读
以数据为中心的存储是无线传感器网络一个热门的研究领域,包含了数据传播、数据存储和数据查询.地理路由协议GPSR(Greedy Perimeter Stateless Routing)是一种应用在数据为中心存储的经典路由算法,采用了贪心转递算法和周界转递算法来存储和查询数据.在数据为中心存储中,数据根据名称映射到地理位置上.因为目标位置上往往没有节点存在,GPSR采用周界转递算法进行数据包的存储或查询.本文定量的分析了数据为中心存储中周界转递造成的系统资源浪费,提出了一种逼近地理位置路由算法ALGPSR.并在NS2上进行了仿真与GPSR进行了比较,结果证明ALGPSR能有效地减少数据查询和存储的系统开销.
Data-centric storage is a hot research area of wireless sensor networks, including data transmission, data storage and data query.Grid Routing Peripheral Routing (GPSR) is a classical routing algorithm used in data-centric storage , The greedy transfer algorithm and the perimeter transfer algorithm are used to store and query data.In the data-centric storage, the data is mapped to the geographical location by name.Because there are often no nodes at the target location, GPSR uses perimeter delivery Algorithm to store or query the data packet.This paper quantitatively analyzes the waste of system resources caused by perimeter transmission in the data-centric storage, and proposes a routing algorithm ALGPSR which is approximate to the geographic location.And the simulation and GPSR are performed on NS2 The results show that ALGPSR can effectively reduce the data query and storage overhead.