【摘要】 以数据为中心的存储是无线传感器网络一个热门的研究领域,包含了数据传播、数据存储和数据查询.地理路由协议GPSR(Greedy Perimeter Stateless Routing)是一种应用在数据为中心存储的经典路由算法,采用了贪心转递算法和周界转递算法来存储和查询数据.在数据为中心存储中,数据根据名称映射到地理位置上.因为目标位置上往往没有节点存在,GPSR采用周界转递算法进行数据包的存储或查询.本文定量的分析了数据为中心存储中周界转递造成的系统资源浪费,提出了一种逼近地理位置路由算法ALGPSR.并在NS2上进行了仿真与GPSR进行了比较,结果证明ALGPSR能有效地减少数据查询和存储的系统开销.更多还原

【Abstract】 The data-centric storage including data dissemination,data storage and data query is a hot area of research in wireless sensor netw orks.GPSR(Greedy the Perimeter Stateless Routing) protocol w hich used in the DCS is a classic routing algorithm.it uses Greedy mode and Perimeter mode to store and query data.DCS sensor netw orks store data by names,the name is hashed to a geographic location w ith a hash function.As the result,destination locations of data packets are usually empty and perimeter forw arding occur in almost every event insertion and query.In this paper,w e first analytically evaluate the overhead of perimeter forw arding in DCS,w e then describe our proposed Approximate Location Greedy Perimeter Stateless Routing scheme.We use ns2 simulator to validate its efficiency,results show s it can significantly reduce overhead of data stores and queries compare to GPSR.更多还原