无线传感器网络一种不相交路径路由算法

无线传感器网络经常被用来采集物理数据,监测环境变化.由于低功耗无线通信不确定性、链路质量不稳定性以及节点失效等问题,传感器网络很容易导致路由数据包丢失.为了提高网络路由的可靠性,人们提出多路径路由算法.多路径路由中源节点到目的节点的多条路径可能含有公共节点,或者公共边,如果公共节点或者公共链路失效,则这个数据包也丢失,因此又有人提出不相交多路径路由算法.不相交多路径路由算法又分为链路不相交多路径路由算法和节点不相交多路径路由算法.提出了一种不相交路径路由算法,可以将感知节点采集到的数据通过不相交路径传送到汇聚节点,提高路由的可靠性.而且,这个算法还可以很方便地应用到多Sink节点的网络当中.该路由算法用到的路由表大小为|K|,其中|K|表示路径数.算法的运行时间复杂度是O(|L|),其中|L|表示网络中的边数.     

Energy-efficient topology control algorithm for maximizing network lifetime in wireless sensor networks with mobile sink

Uneven energy consumption is an inherent problem in wireless sensor networks characterized by multi-hop routing and many-to-one traffic pattern. Such unbalanced energy dissipation can significantly reduce network lifetime. In this paper, we study the problem of prolonging network lifetime in large-scale wireless sensor networks where a mobile sink gathers data periodically along the predefined path and each sensor node uploads its data to the mobile sink over a multi-hop communication path. By using greedy policy and dynamic programming, we propose a heuristic topology control algorithm with time complexity O(n(m + n log n)), where n and m are the number of nodes and edges in the network, respectively, and further discuss how to refine our algorithm to satisfy practical requirements such as distributed computing and transmission timeliness. Theoretical analysis and experimental results show that our algorithm is superior to several earlier algorithms for extending network lifetime.     

Ant colony optimization based sensor deployment protocol for wireless sensor networks

Sensor deployment is one of the most important issues in wireless sensor networks, because an efficient deployment scheme can reduce the deployment cost and enhance the detection capability of the wireless sensor networks. In addition, it can enhance the quality of monitoring in wireless sensor networks by increasing the coverage area. Ant colony optimization (ACO) algorithm provides a natural and intrinsic way of exploration of search space for multiple knapsack problem (MKP). In this work, we consider the problem of sensor deployment to achieve complete coverage of the service region and maximize the lifetime of the network. We model the deployment problem as the multiple knapsack problem. Based on ACO algorithm, we proposed a deployment scheme to prolong the network lifetime, while ensuring complete coverage of the service region. The simulations show that our algorithm can prolong the lifetime of the network.     

传感器网络中多节点协商可逆的数字水印算法

数字水印技术已被用于保障传感器网络所采集数据的完整性与正确性,已有的无线传感器网络中的水印技术几乎都是不可逆的,因而嵌入的水印会对采集的数据具有一定的破坏。为此,将传统的基于差分扩展的可逆水印算法引入到无线传感器网络,并结合无线传感器网络节点协同工作的特点,将已有基于差分扩展的可逆水印算法发展为多节点协商可逆的数字水印算法。该算法针节点结构松散、自身防御能力弱等问题将整体水印分为一定数目的片段,并由各组节点进行随机化处理使所有的片段呈随机性分布,以增加共谋攻击的难度。同时在节点和终端间用一对同步的随机序列发生器解决了对数据的新鲜性鉴别的问题。     

A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks

Wireless sensor networks (WSNs) with nodes spreading in a target area have abilities of sensing, computing, and communication. Since the GPS device is expensive, we used a small number of fixed anchor nodes that are aware of their locations to help estimate the locations of sensor nodes in WSNs. To efficiently route sensed data to the destination (the server), identifying the location of each sensor node can be of great help. We adopted a range-free color-theory based dynamic localization (CDL) [Shen-Hai Shee, Kuochen Wang, I.L. Hsieh, Color-theory-based dynamic localization in mobile wireless sensor networks, in: Proceedings of Workshop on Wireless, Ad Hoc, Sensor Networks, August 2005] approach, to help identify the location of each sensor node. Since sensor nodes are battery-powered, we propose an efficient color-theory-based energy efficient routing (CEER) algorithm to prolong the life time of each sensor node. The uniqueness of our approach is that by comparing the associated RGB values among neighboring nodes, we can efficiently choose a better routing path with energy awareness. Besides, the CEER has no topology hole problem. Simulation results have shown that our CEER algorithm can save up to 50–60% energy than ESDSR [Mohammed Tarique, Kemal E. Tepe, Mohammad Naserian, Energy saving dynamic source routing for ad hoc wireless networks, in: Proceedings of Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, April 2005, pp. 305–310] in mobile wireless sensor networks. In addition, the latency per packet of CEER is 50% less than that of ESDSR.     

多等级通信半径的无源传感器网络中的覆盖问题

无源传感器网络是近年来兴起的一种新型的网络结构,可用于解决传统无线传感器网络能量有限、寿命受限的问题.在无源传感器网络中,每个无源传感器节点配备有能量收集模块,可以从周围环境中获取能量.由于周围环境中的能量是无限的,这样,从能量的角度来讲,无源传感器网络的网络寿命是无限的.这样就解决了传统无线传感器网络寿命受限的问题.然而,由于周围环境中的能量源具有能量低、分布不均匀等特点,导致无源传感器网络中的覆盖问题比传统的无线传感器网络中的覆盖问题更加复杂.为了解决无源传感器网络中的覆盖问题,同时也为了让无源节点更有效地利用环境中的能量,考虑了一种具有多等级通信半径的无源节点,并提出了基于多等级通信半径的无源传感器网络中的覆盖问题.证明了这个问题是NP-Hard问题.提出一种基于贪心策略的近似算法,解决了这个问题,并证明了该算法的近似比.同时,采用模拟实验的方式验证了该算法的性能.根据实验结果,该算法是有效且可靠的.     

分布式布谷鸟算法在无线传感器网络布局优化中的应用

在无线传感器网络中,传感器节点的部署通常具有随机性。随机布局的无线传感器网络存在着节点利用率低,传感器网络覆盖率小等问题。为了解决无线传感器布局问题,提出了基于分布式布谷鸟算法的无线传感器网络覆盖优化算法,利用布谷鸟算法对传感器节点的布局进行优化,同时采用分布式计算提高算法的计算速度。实验表明,该算法对无线传感器网络的布局具有很好的优化效果,而且比布谷鸟算法具有更快的计算速度。     

Approximation schemes for load balanced clustering in wireless sensor networks

Clustering sensor nodes is an efficient technique to improve scalability and life time of a wireless sensor network (WSN). However, in a cluster based WSN, the leaders (cluster heads) consume more energy due to some extra load for various activities such as data collection, data aggregation, and communication of the aggregated data to the base station. Therefore, balancing the load of the cluster heads is a crucial issue for the long run operation of the WSNs. In this paper, we first present a load balanced clustering scheme for wireless sensor networks. We show that the algorithm runs in O(nlogn) time for n sensor nodes. We prove that the algorithm is optimal for the case in which the sensor nodes have equal load. We also show that it is a polynomial time 2-approximation algorithm for the general case, i.e., when the sensor nodes have variable load. We finally improve this algorithm and propose a 1.5-approximation algorithm for the general case. The experimental results show the efficiency of the proposed algorithm in terms of the load balancing of the cluster heads, execution time, and the network life.     

一种无线传感器网络蚁群优化路由算法

如何在资源受限的无线传感器网络中进行高效的数据路由是无线传感器网络研究的热点之一.将蚁群优化算法(ACO)应用于无线传感器网络的路由,提出一种无线传感器网络蚁群优化路由算法.该算法利用蚁群的自组织、自适应和动态寻优能力进行网络优化路径的建立与维护,采用Stigmergy的概念来减少控制信息的流量,以实现网络数据的高效传输.仿真分析表明,该算法和DD算法相比在传输延时方面性能相当,在路由代价方面效果显著.另外,该算法还具有可靠性高、适应性强等优点,并能够根据需要实现网络的拥堵控制和能量均衡等综合优化.     

An efficient intruder detection algorithm against sinkhole attacks in wireless sensor networks

In a wireless sensor network, multiple nodes would send sensor readings to a base station for further processing. It is known that such a many-to-one communication is highly vulnerable to a sinkhole attack, where an intruder attracts surrounding nodes with unfaithful routing information, and then performs selective forwarding or alters the data passing through it. A sinkhole attack forms a serious threat to sensor networks, particularly considering that the sensor nodes are often deployed in open areas and of weak computation and battery power.In this paper, we present a novel algorithm for detecting the intruder in a sinkhole attack. The algorithm first finds a list of suspected nodes through checking data consistency, and then effectively identifies the intruder in the list through analyzing the network flow information. The algorithm is also robust to deal with multiple malicious nodes that cooperatively hide the real intruder. We have evaluated the performance of the proposed algorithm through both numerical analysis and simulations, which confirmed the effectiveness and accuracy of the algorithm. Our results also suggest that its communication and computation overheads are reasonably low for wireless sensor networks.     

无线传感器网络中非均匀的节点布置

在无线传感器网络中,传感器节点将收集到的数据传输到簇头,经簇头聚合后数据包以多跳方式发送到基站。靠近基站的节点,因转发的数据较多而提早死亡,出现所谓的能量空洞问题。为此,对无线传感器网络中节点的能耗情况进行了研究,提出了一种非均匀的节点布置算法,得出了一个布置传感器节点的密度函数,在靠近基站的区域内布置较多的节点。仿真实验表明,非均匀的节点布置算法能有效延长网络的生命周期。     

基于蚁群算法的多路径多约束QoS路由研究

多路径多约束服务质量（Quality of Service,QoS）路由问题是无线传感器网络的核心问题之一,由于网络拓扑的不断变化及链路的固有的不精确性,解决这个问题具有很大的挑战性。首先给出无线传感器网络中QoS路由问题描述及调和蚁群算法（Ant Colony Optimization,ACO）的基本算法步骤及其特点。然后在分析了蚁群算法应用于QoS路由问题的可能性的基础上,给出了调和蚁群算法解决多路径多约束QoS问题的算法。最后通过仿真实例得到满意的结果。     

考虑级联失效的有向WSNs节点重要度评估模型

针对无线传感器网络中关键节点失效引发网络快速崩溃的问题,考虑节点之间存在相互作用且相互作用具有方向性的特征,建立有向网络级联失效模型,推导节点失效后引起的负载震荡状态值.基于经典的PageRank算法,利用失效节点引发的邻居节点平均负载震荡状态值定义节点的初始重要度值,建立节点度择优的分配规则改进PageRank算法的平均分配规则,结合节点层级结构,建立考虑级联失效的有向传感器网络节点重要性分析方法.最后,通过仿真实验验证算法的有效性.实验证明,该方法能有效地评估了有向无线传感器网络节点的重要性,而且当对判定出的关键节点进行保护时,该方法判定关键节点的网络抗毁性明显较强.     

Adaptive clustering in wireless sensor networks by mining sensor energy data

Clustering has been well received as one of the effective solutions to enhance energy efficiency and scalability of large-scale wireless sensor networks. The goal of clustering is to identify a subset of nodes in a wireless sensor network, then all the other nodes communicate with the network sink via these selected nodes. However, many current clustering algorithms are tightly coupled with exact sensor locations derived through either triangulation methods or extra hardware such as GPS equipment. However, in practice, it is very difficult to know sensor location coordinates accurately due to various factors such as random deployment and low-power, low-cost sensing devices. Therefore, how to develop an adaptive clustering algorithm without relying on exact sensor location information is a very important yet challenging problem. In this paper, we try to address this problem by proposing a new adaptive clustering algorithm for energy efficiency of wireless sensor networks. Compared with other work having been done in this area, our proposed adaptive clustering algorithm is original because of its capability to infer the location information by mining wireless sensor energy data. Furthermore, based on the inferred location information and the remaining (residual) energy level of each node, the proposed clustering algorithm will dynamically change cluster heads for energy efficacy. Simulation results show that the proposed adaptive clustering algorithm is efficient and effective for energy saving in wireless sensor networks.     

能量捕获无线传感器网络中速率自适应路由算法

能量捕获无线传感器网络是无源感知技术中非常重要的一类,它能够有效解决节点能量受限的问题,保持网络运行的持续性.现有的路由方法并未充分利用节点的能量捕获特性,也没有考虑到链路的成功收包率和节点的传输速率.为进一步提高网络的性能,提出了一种结合链路成功收包率的速率自适应路由算法.通过对节点的剩余能量和链路的成功收包率进行建模,给出了一个节点可作为路由中继节点所需要满足的两个条件;基于优化方程,为传输路径上的每一跳节点自适应配置时延最小化的传输速率;提出路由发现步骤来找出端到端传输时延最小的传输路径.实验结果表明,相比于固定传输速率的路由算法,所提算法所得到的传输路径具有较低的端到端传输时延和较高的吞吐率.     

一种ZigBee无线传感器网络拓扑发现算法

ZigBee无线传感器网络(WSN)不同于有线网络,由于无法直接观察到其网络结构和设备部署情况,因此不利于对ZigBee WSN进行管理和控制。为解决该问题,提出一种针对ZigBee WSN的拓扑发现算法(ZigBeeTopo),确定网络中的活跃节点以及节点之间的相互关系,设计WSN拓扑管理模块,实现ZigBee网络拓扑的可视化。测试结果表明,该算法能正确发现多种WSN拓扑。     

无线传感器网络中2-连通k-支配的容错连通支配集构造

无线传感器网络可采用连通支配集的虚拟骨干技术使平面网络层次化,但传感器节点的失效和链路的断裂会导致网络失败,虚拟骨干网最好具有容错性好、可靠性高的特性.对此,提出具有容错性的2-连通 -支配集的构造算法,以节点自身和邻域信息分布式地构造 -支配节点,利用最小生成树和块-割点图将 -支配节点2-连通.理论分析和实验仿真表明此算法具有较好的算法性能比,在中等规模网络中会产生更少的具有容错性的 -支配节点,可节省传感器节点的能量消耗和网络的通信开销.     

带时延约束的连通目标覆盖最大化生命周期问题

在无线传感器网络中,如何确保网络服务质量（如覆盖、连通）同时最大化网络生命周期是研究的热点和难点.在延时敏感的应用（如火灾、爆炸等灾害监测）中,传感器节点必须在有限的时间内传送它们的数据到汇聚节点.为了研究这种应用下的连通目标覆盖,提出了一种带时延约束的连通目标覆盖问题(DCCTC).首先,将DCCTC建模成为限高的最大覆盖树问题(HLMCT),并证明它是NP-Complete的.然后,设计了一种快速启发式算法HLCWGC求解HLMCT问题.仿真实验和理论证明,HLCWGC在时延约束下获得的网络生命周期比已有的算法要好.具有较高的应用价值和理论意义.     

传感器网络分布式数据流的频繁项集挖掘算法

研究无线传感器网络中数据流频繁项集挖掘问题。针对集中式的静态数据流频繁项集挖掘方法不能在传感器网络中直接使用这一特点,提出基于传感器网络的分布式数据流的频繁项集挖掘算法FIMVS。该算法基于FPtree快速挖掘出传感器节点上单一数据流的局部频繁项集,然后通过路由将其在无线传感器网络里逐层上传合并,在Sink节点上汇聚后,采用自顶向下的高效剪枝策略挖掘出全局频繁项集。实验结果表明,该算法能有效地大幅度减少候选项集,降低无线传感器网络中的通信量,并有较高的时间和空间效率。     

无线传感器网络无标度容错拓扑的连锁故障诊断算法

针对随机节点故障所引发的连锁故障问题,为了尽可能地降低连锁故障对无线传感器网络所造成的损害,提出了一种无线传感器网络无标度容错拓扑的连锁故障诊断算法,该算法基于单一节点故障时负载重新分配给相邻节点的情况,提出一种连锁故障下的负载再分配模型,分析了单一节点故障时所产生的连锁故障规模。采用相邻节点的连锁故障诊断算法来研究传感器网络的负载参数和连锁故障规模之间的关系,尽可能地减少连锁故障所带来的节点损失。仿真结果表明,该算法有效地抑制了由于负载过大所引发的连锁负载效应,在减少网络节点的损失上起到了较好的效果。