CAJ | 학술논문

针对WSN中的以数据为中心的平面型存储算法没有考虑在数据传输过程中节点的能量消耗问题,考虑到节点数据的重要程度,赋予相应的优先级,在蛇形时隙的节能存储算法(SLPS)基础上,提出基于事件优先级和动态散列位置的蛇形时隙算法(P-SLPS).P-SLPS算法通过划分网格区域,将特定类型的数据存储在相应的网格中,通过定义事件优先级,将高优先级的事件存储在距离查询节点更近的网络区域,保证高优先级事件优先被搜索.根据监测节点和存储映射地址计算动态散列位置,将检测事件存储在同一优先级区域内离监测节点最近的存储网格.从网络生命周期和网络的节点存活数两方面进行仿真,结果表明P-SLPS算法在能量消耗方面低于SLPS算法,延长了无线传感网络的生命周期.
침대WSN중적이수거위중심적평면형존저산법몰유고필재수거전수과정중절점적능량소모문제,고필도절점수거적중요정도,부여상응적우선급,재사형시극적절능존저산법(SLPS)기출상,제출기우사건우선급화동태산렬위치적사형시극산법(P-SLPS).P-SLPS산법통과화분망격구역,장특정류형적수거존저재상응적망격중,통과정의사건우선급,장고우선급적사건존저재거리사순절점경근적망락구역,보증고우선급사건우선피수색.근거감측절점화존저영사지지계산동태산렬위치,장검측사건존저재동일우선급구역내리감측절점최근적존저망격.종망락생명주기화망락적절점존활수량방면진행방진,결과표명P-SLPS산법재능량소모방면저우SLPS산법,연장료무선전감망락적생명주기.
Against the data-centric planar storage algorithm in wireless sensor network(WSN)does not consider the node energy consumption in the process of data transmission,considering the importance of node data,this paper gives the corresponding data priority,and on the basis of snake-like power-saving algorithm,and proposes a snake-like power-saving(P-SLPS)algorithm which bases on event priority and dynamic hashing position. The P-SLPS algo-rithm could store the specific type of data in corresponding grid by the mesh area and store the high-priority event in the network area where near the query node to ensure the high-priority events can be searched.According to the monitor node and storage mapping position calculating dynamic hash mapping address,to store the monitor event in a storage grid which near the monitor node in the same priority area.From the network life cycle and the number of data survival to simulate,and the simulation result shows that in comprison with the SLPS algorithm,the P-SLPS al-gorithm reduces energy consumption and prolong the life cycle of wireless sensor networks.