基于移动代理的WSN压缩数据采集方法研究

为降低网络传输量、延长网络生命周期,提出了一种基于移动代理的无线传感器网络(WSN)压缩数据采集方法,将压缩感知更有效地应用到WSN的数据采集过程中.所提方法根据测量矩阵中的信息对网络中的节点进行分组投影,增加了单次投影的节点数量,自适应地将这些节点划分区域,并派遣移动代理进行分区采集,通过一种基于树的贪婪策略得到移动代理的最优访问路径.仿真表明,所提方法对比SPT(Hybrid-CS)、MSTP和MA-Greedy算法在网络传输量和能耗均衡度上的性能均有显著提升.由此,提出的算法可以有效降低网络通信量,均衡能耗负载,同时缓解测量次数对网络整体能耗的影响.     

用于移动汇聚节点的自适应数据采集策略

移动汇聚节点用于无线传感网络信息采集,可以提高网络能效性,延长网络生命期。研究了四轴飞行器携带 移动汇聚节点,该节点可采集地面无线传感网数据。通过分析汇聚节点空中移动特性,探讨了低功耗无线数据采集 时,移动轨迹、速率和高度与移动汇聚节点能够发送的数据量的之间的理论约束条件。在满足约束条件前提下,提出 基于数据量局部最优化策略,用以控制移动汇聚节点移动路径。在仿真环境中,详尽分析了这种数据采集策略下逗留 时间与移动轨迹、速度和高度等之间的关系,为这类应用莫定了理论基础。     

移动传感器网络中能量有效分簇算法

针对移动传感器网络中节点移动及能量有限问题,提出基于TDMA和事件触发的能量有效分簇算法。该算法以移动网络为应用背景,结合时分复用,通过分析簇头节点剩余能量及簇头节点移动进行分簇,以减少网络中簇重构次数,有效均衡系统中节点能耗,并延长网络生存时间。仿真结果表明:所提出方法相对CBVRP算法簇重构次数可减少6.0%,相对MCR算法网络生存时间提高了10%。     

移动传感网络汇聚节点动态选址

目前绝大多数汇聚节点选址策略都是基于静态传感器网络,但这些算法应用在移动传感器网络中有很大的局限性。本文提出了一种分布式和集中式的SCSN模型,该模型实现了结构意识自适应算法,能在移动传感网中动态实时的维护汇聚节点在Steiner中心位置。其基于边结构设计,实现了凸壳更新节点个数复杂度由 下降到 ,结合kalman滤波预测方法准确的预测汇聚节点的移动轨迹。实验对比了Steiner和其它几何中心更新的偏移量,结果表明Steiner有使汇聚节点具有高稳定低偏心的特征。     

一种能耗均衡的WSNs动态数据汇聚方法

无线传感器网络一般采用分簇路由协议实现数据的汇聚,这类协议要求Sink节点的位置固定,并通过节点间多跳接力传输,将数据汇聚到Sink节点。由于网络中不同节点承担中继的负载不同,这会导致某些负载过重的节点能量提早耗尽,从而形成网络空洞。虽然某些路由协议在网络能耗均衡方面做了一定的措施,但仍无法较好的解决该问题。为此提出一种能耗均衡的动态数据汇聚方法,该方法的汇聚节点(Sink)为可移动节点,为平衡网络能耗,利用网络节点的能量为Sink节点确定若干个数据汇聚位置。并结合TSP算法规划Sink节点的最佳移动路径,通过对该算法进行大量的仿真,并与现有的一些方案进行比较,验证了该算法在各种性能指标上的有效性。     

新型安全移动代理的路由算法设计

研究了安全移动路由算法设计的问题.针对目前代理在网络中进行漫游时,数据安全存在极大威胁,而现有的一些使用移动代理的路由算法或是没有考虑到代理的安全,或安全保护负担过重.为此,提出了一种基于安全移动代理的路由算法的设计思想,使用概率值来构造路由表,通过移动代理在网络节点间的迁移来发现网络状态,更新节点路由表.同时在网络节点处建立信任表,定期生成测试代理在虚拟空间中运行,并对其属性和关键数据进行检测以保证网络节点的可靠性,实现代理在网络中的安全.提出的算法还借助rasshopper 移动代理开发平台构造了一个简单网络模型,对其进行了仿真验证.算法提高了路由算法的效率,节约了网络的系统开销,有良好的运用前景.     

基于粒子滤波的移动传感器网络节点定位算法

根据移动传感器网络中节点定位的特性,对经典粒子滤波的采样策略、粒子加权策略和重采样策略进行改进和优化,提出一种新的移动节点定位算法PFNL.该算法克服了经典粒子滤波算法存在的粒子退化、采样枯竭等缺陷,从而降低节点定位过程中的计算开销和存储开销.仿真实验结果表明,PFNL算法在同等参数条件下的定位精度高于典型定位算法.     

一种累计多路径的移动自组网络路由策略

描述了一种基于多路径移动自组网络按需路由策略.在移动自组网络,由于网络节点的移动性及拓扑结构的易变性,路由成为最受关注的问题.在以前的移动自组网络路由算法中,主要采用的是传统的单路径方式.最近,多路径方式也逐渐出现,因为相对单路径路由而言,多路径为移动自组网络提供的QoS支持更可行、更高效.鉴于现有的移动自组网络多路径策略未能为源节点提供充分的信息,提出了一种新型的移动自组网络多路径路由算法.该算法可以将路由信息保存在源节点中,并依此在源节点中采用替换路径或多路径并发的方式进行数据传输.     

基于RFID的传感器网络合作式充电和数据收集策略

能量限制是制约无线传感器网络发展的主要瓶颈之一,可充电无线传感器网络的出现对其发展起了巨大的作用.提出了一种基于RFID标签的无线传感器网络合作式无线充电和数据收集策略,根据通信方式的不同,具体提出了TBR和TDC两种方案,通过将网络中的节点进行分簇,并在单个簇内部署簇内移动读取器进行路径移动,对簇内的各个节点进行充电和数据收集;在簇间部署簇间移动读取器收集簇内读取器内的数据,并将数据传输给汇聚节点进行数据处理,通过分簇完成对节点充电和数据收集任务的分层处理.通过仿真验证,其结果表明合作式充电策略可应用在大型区域内部署的网络,并且保证所需的移动读取器数量最少,数据传输至汇聚节点的时延最短,TBR方案与TDC方案有效.     

无线传感器网络中基于移动锚节点的APIT的改进定位算法

针对APIT定位算法定位误差大,覆盖率低等缺点,提出了一种基于移动锚节点的改进的定位算法.在网络中引入移动锚节点,通过移动覆盖算法尽量使节点均匀分布,并提出了一种基于异构传感器网络的最佳节点数量的计算方法,另外引入了RSSI量化模型对APIT算法进行修正,解决了用APIT算法不能进行定位的问题.仿真结果表明,其与传统方...     

移动Sink的传感器网络路径优化策略

在无线传感器网络（WSNs）中引入移动 Sink 可以避免网络拥塞和能量空洞并降低网络能耗,但由于移动速度的限制导致时延较大。针对这一问题,提出了时延约束下的移动 Sink 路径优化策略,根据时延和网络能耗之间的关系设计了可调节的节点权重,通过模拟退火遗传算法得到最优节点权重,并依据此权重通过迭代得到汇聚节点和最佳移动路径。仿真结果表明：该策略能保证在满足时延约束的前提下降低网络能耗,且收敛速度快。     

具有移动sink 的无线传感器网络能量均衡分簇路由协议

提出了一种具有移动sink的无线传感器网络能量均衡分簇路由协议.将整个网络划分为若干个网格,每个网格采用簇头评判模型选出簇头,簇头负责收集簇内兴趣事件,进行数据融合后转发给移动sink.当sink在同一个网格内移动时,只需要将新位置通知当前网格的簇头;当sink移动到新的网格时,先将位置报告给新网格的簇头,然后由该簇头将位置信息分发给其他簇头.该协议能够有效地均衡节点的能量消耗,延长网络的生存时间.     

A honeycomb structure based data gathering scheme with a mobile sink for wireless sensor networks

With the widespread use of wireless sensor networks, more and more applications require energy efficient and low packet loss rate data collection methods. Recently, the concept of ‘mobile’ is introduced in various mechanisms to meet the needs of this kind. In this paper, a honeycomb structure based data gathering scheme, HSDG, is proposed for wireless sensor networks with a mobile sink. By partitioning the network into a honeycomb structure and giving each partition a direction value, every sensor node can obtain the latest location of the mobile sink dynamically with a small amount of broadcasting overhead. HSDG uncouples the moving strategy of mobile sink from the data forwarding mechanism, and three subscheme HSDG_RM, HSDG_DGM, and HSDG_EGM are proposed. Our schemes are investigated from average energy consumption, maintenance cost, packet loss rate and the number of packets collected. Compared with BTDG and ALURP, HSDG_DGM is the most energy efficient with a low packet loss rate.     

Energy efficient and QoS aware routing protocol for Clustered Wireless Sensor Network

In this paper, a protocol called Energy Efficient and QoS aware Routing (EEQR) protocol for Clustered Wireless Sensor Network is proposed. To ensure QoS for different traffic types, prioritization of data is done based on message type and content. To address energy efficiency (hotspot problem) and high end-to-end delay problem, a combination of mobile and static sink is used for data gathering. Delay sensitive message are sent through the static sink and delay tolerant message are send through the mobile sink. Consequently, EEQR incurs less end-to-end delay, is energy efficient as well as able to ensure QoS. To evaluate the performance of the proposed strategy, intensive simulations are carried out. Performance of the proposed strategy is compared with the static sink and mobile sinks strategies. The results demonstrated that EEQR has prolonged the network and coverage lifetime, as well as has improved the other QoS routing parameters, such as delay, packet loss ratio, and throughput.     

An algorithm on fairness verification of mobile sink routing in wireless sensor network

Congestion and starvation will occur among some nodes due to the emerging serious unfairness, which is derived from the limited communication capabilities of all nodes and sink or in the case of a mobile sink moving to a new place. The problem to be solved is to balance the network and keep the fairness for all nodes. For this purpose, this paper focuses on verifying the fairness of mobile sink routing based on both state and action, which is realized mainly by composing Labeled Kripke Transition Systems (LKTS). First, an approach is presented by LKTS to model node behaviors. Second, a notion of Fair Computational Tree Logic (CTL) is introduced to describe the fairness formulae in branching time transitions, and four kinds of fairness assumptions are defined for fairness verification. Moreover, in order to avoid the problem of state-space explosion, Bounded model Checking to explore states and transitions on-the-fly until a witness is found, while Strong Connected Components algorithm is used to pick up fair paths under fairness constraints of Fair CTL. The experimental results show the superiority of our method by the savings in memory and time consumptions during the mobile sink routing process.     

Particle swarm optimization based clustering algorithm with mobile sink for WSNs

Wireless sensor networks with fixed sink node often suffer from hot spots problem since sensor nodes close to the sink usually have more traffic burden to forward during transmission process. Utilizing mobile sink has been shown as an effective technique to enhance the network performance such as energy efficiency, network lifetime, and latency, etc. In this paper, we propose a particle swarm optimization based clustering algorithm with mobile sink for wireless sensor network. In this algorithm, the virtual clustering technique is performed during routing process which makes use of the particle swarm optimization algorithm. The residual energy and position of the nodes are the primary parameters to select cluster head. The control strategy for mobile sink to collect data from cluster head is well designed. Extensive simulation results show that the energy consumption is much reduced, the network lifetime is prolonged, and the transmission delay is reduced in our proposed routing algorithm than some other popular routing algorithms.     

A farmland multimedia data collection method using mobile sink for wireless sensor networks

Wireless sensor networks are applied to collect the information about farmland required to achieve unmanned agriculture. The major purpose of the deployed sensors is to collect data. However, if the data collected by the sensors are too large, such as an image, sensors quickly become unavailable. In this paper, a novel method for collecting image data from deployed sensors by using a mobile sink is proposed. Unlike the existing data gathering methods, in which sensors deliver data to a sink via long distance transmission, in the proposed method the mobile sink walks within the region of interest (ROI) to harvest the data. A virtual-grid method is proposed to determine the visiting locations of the mobile sink. An algorithm to eliminate redundant locations that uses set-conjunction operations is also proposed for reducing the number of unnecessary visiting locations. In addition, a cross-edge adjusting trajectory scheduling (CATS) algorithm is proposed to reduce the moving distance of the mobile sink. Simulation results show that the proposed virtual-grid method can effectively reduce the number of visiting locations by about 15–20 % as compared to the cluster-centroid method. The CATS algorithm can also shorten the moving distance of the mobile sink by about 25 % as compared to that of a heuristic minimum spanning tree method.     

传感器网络中基于移动sink最优穿越路径的高效数据收集算法

移动sink数据收集研究主要集中在轨迹固定的移动策略。为此,建立了移动sink穿越路径可控条件下的数据收集模型,并提出一种最优路径穿越的移动sink数据收集算法(OTP-TS)。算法利用局部Voronoi网格将连续路径问题离散化,以收集数据量、系统能耗为衡量指标,结合禁忌搜索算法,实现系统数据量最大化和网络能耗最小化穿越。理论分析和实验结果表明,该算法很好地解决了移动sink在可控移动轨迹情况中数据收集的最优路径穿越问题。     

An improved ant colony optimization-based approach with mobile sink for wireless sensor networks

Traditional wireless sensor networks (WSNs) with one static sink node suffer from the well-known hot spot problem, that of sensor nodes near the static sink bear more traffic load than outlying nodes. Thus, the overall network lifetime is reduced due to the fact some nodes deplete their energy reserves much faster compared to the rest. Recently, adopting sink mobility has been considered as a good strategy to overcome the hot spot problem. Mobile sink(s) physically move within the network and communicate with selected nodes, such as cluster heads (CHs), to perform direct data collection through short-range communications that requires no routing. Finding an optimal mobility trajectory for the mobile sink is critical in order to achieve energy efficiency. Taking hints from nature, the ant colony optimization (ACO) algorithm has been seen as a good solution to finding an optimal traversal path. Whereas the traditional ACO algorithm will guide ants to take a small step to the next node using current information, over time they will deviate from the target. Likewise, a mobile sink may communicate with selected node for a relatively long time making the traditional ACO algorithm delays not suitable for high real-time WSNs applications. In this paper, we propose an improved ACO algorithm approach for WSNs that use mobile sinks by considering CH distances. In this research, the network is divided into several clusters and each cluster has one CH. While the distance between CHs is considered under the traditional ACO algorithm, the mobile sink node finds an optimal mobility trajectory to communicate with CHs under our improved ACO algorithm. Simulation results show that the proposed algorithm can significantly improve wireless sensor network performance compared to other routing algorithms.