无线传感网络中的大多数应用均需要将无线传感节点收集的大量数据传输到基站以便进行数据处理或者存档,因而可以通过放置一定数目的存储节点来存储其临近节点发送的数据,如此可以减轻网络中的数据传输量,达到节能这个对于无线传感网络至关重要的目的.本文研究如何放置有限数目的存储节点,以使整个无线传感网络的能量消耗最小,这也就是存储节点配置问题.对存储节点配置问题进行规约,在这一过程中文章修正了已有算法在能量模型定义上的不足,证明无线传感网络中的存储节点配置为NP-hard问题;文章提出一个基于反向贪心策略的近似算法,并且证明了其最坏情况下的性能比为O(logn),其中n为网络中的传感节点数目.通过实验证明了这一算法的优良性能. Most applications in wireless sensor networks need to transmit large amounts of data collected by the wireless sensor nodes to the base station for data processing or archiving so that a certain number of storage nodes can be placed to store the data sent by their neighboring nodes. Reduce the amount of data transmission in the network and achieve energy saving, which is very important for wireless sensor networks.This paper studies how to place a limited number of storage nodes to minimize the energy consumption of the entire wireless sensor network, which is the storage node configuration Problem.Through the protocol specification of the storage node configuration problem, this paper modifies the deficiencies of the existing algorithms in the energy model definition and proves that the storage nodes in wireless sensor networks are configured as NP-hard problems. In this paper, The approximate algorithm of greedy strategy is proved, and its worst case performance ratio is proved to be O (logn), where n is the number of sensing nodes in the network. The performance of this algorithm is proved by experiments.