CAJ | 학술논문

在无线传感器网络中引入移动Sink来解决.静态无线传感器网络(所有节点均为静止)存在的能量空洞、冗余覆盖和热点等问题.传感器节点将数据发送给汇聚节点(CP, collection point),移动Sink访问CP节点收集数据.提出了一种最短移动距离最小能耗的路径优化模型(MEMD).证明了该模型是一个 NP-hard 问题,给出了一种基于效用的贪心启发式方法用于确定最佳的CP 节点队列.为了在规定的最大传输延时的范围内访问尽可能多的 CP 节点,提出了一种基于 CP 节点访问概率的路径选择算法.通过模拟实验以及实验床的真实数据,提出的算法能很好地在满足延时要求的同时节约网络的能量.
재무선전감기망락중인입이동Sink래해결.정태무선전감기망락(소유절점균위정지)존재적능량공동、용여복개화열점등문제.전감기절점장수거발송급회취절점(CP, collection point),이동Sink방문CP절점수집수거.제출료일충최단이동거리최소능모적로경우화모형(MEMD).증명료해모형시일개 NP-hard 문제,급출료일충기우효용적탐심계발식방법용우학정최가적CP 절점대렬.위료재규정적최대전수연시적범위내방문진가능다적 CP 절점,제출료일충기우 CP 절점방문개솔적로경선택산법.통과모의실험이급실험상적진실수거,제출적산법능흔호지재만족연시요구적동시절약망락적능량.
There inevitably exist some serious problems such as energy hole, overlapping and hot spots in static wireless sensor networks which are composed by all static sensors. The mobile Sink (MS) was used to reduce the energy con-sumption of static sensor nodes through a collection-based approach in which a subset of nodes served as the data collec-tion points (CP) that buffer data originated from sensors and transferred these data to MS when it arrived. An optimiza-tion model named min-energy min-distance (MEMD) of MS’ moving path was introduced and proved this model was NP-hard. A heuristic algorithm was developed combining MS and CPs selection to enable a flexible trade-off between energy consumption and data delivery latency. Furthermore, a probabilistic path selection (PPS) algorithm to make the MS visit as much as possible sensors was proposed. The experimental and simulating results show monotonic decrease of data delivery latency for greater limits on the energy consumption and vice versa.