一种应用于桥载设备监控网络CSMA/CA机制算法

在机场桥载设备在线监测管理网络的现场应用测试中,针对网络突发事件中高优先级节点传输延时长,节点能耗利用率低的问题,采用基于优先级调度策略思想的网络节点能量优化机制,对网络MAC层协议中的CSMA/CA算法参数做出调整,达到数据快速传输的目的,利用NS2软件进行网络仿真,结果表明该方法提高了高优先级节点的信道访问率,均衡了网络能耗并延长了网络生命周期。     

数字、模拟无线混合网络视频节点设计

针对无线多媒体传感器网络广泛的应用前景和目前节点平台稀缺的情况,设计并研制了一种小型化的无线多媒体传感器网络节点。节点采用ADI公司的ADSP-BF561微处理器和Helicomm公司的基于Zigbee网络协议的无线收发模块IP-Link研制而成。在输入通道上可分别支持模拟图像传感器和数字图像传感器。输出通道具有多媒体传输通道和数据/命令传输通道,其中多媒体传输通道用于传输实时的模拟视频,数据/命令传输通道用于传输节点处理之后的有效数据以及接收来自上层网络的命令。     

基于改进免疫遗传算法的K覆盖异构传感器节点调度

为了实现无线传感器网络监测区域目标点的多重覆盖,设计了一种基于改进免疫遗传算法的异构传感器节点调度算法实现目标点的K重覆盖;首先,在传统的概率感知模型中加入剩余能量和感知能力因素,得到改进的概率感知模型,并设计了以最小化节点数并满足覆盖度约束的目标函数;然后,采用改进的免疫遗传算法对节点进行调度,最后,给出了具体的采用改进免疫遗传算法实现WSN异构节点调度的具体算法;仿真实验表明:文中方法能在满足K覆盖约束前提下实现监测区域的节点调度,与其他方法相比,活动节点数平均多7%,具有较长的网络生命周期和较少的网络能耗。     

基于DIJKSTRA的无线传感器网络分簇路由算法

为加快无线传感器网络最优路径搜索速度、减少路径寻优能量消耗和延长网络寿命,提出了基于改进的DIJKSTRA算法的无线传感器网络分簇路由算法;运用DIJKSTRA算法在无线传感器网络内以多跳接力的方式来搜寻从源节点到目的节点的最短路径;结合能耗优化策略,避免网络能耗热点问题,实现网络能耗均衡;通过与基于蚁群算法的路由算法对比分析,基于Dijkstra的网络分簇路由算法能优化网络分簇并建立较优传输路径,其快速收敛性能减缓了网络中簇头节点的能耗,延长了网络寿命,提高了网络鲁棒性。     

基于免疫蚁群优化的无线传感器网络节点调度研究

提出一种基于免疫优化蚁群算法(QIACO)的无线传感器网络节点调度策略方法;针对传统的蚁群算法在寻优过程中存在的收敛速度慢、容易出现停滞现象等缺陷,借鉴免疫系统的自我调节机制,提出了一种新的疫苗选取策略及疫苗接种方法,设计了基于免疫优化的蚁群算法,达到提高算法的收敛速度和避免停滞现象的发生;通过对MESA算法、蚁群算法、量子遗传算法和QIACO算法在负载均衡性分析、能耗均衡性分析和网络寿命分析进行仿真验证,提出的算法在无线传感器网络节点调度策略中效果最好,能有效地提高网络寿命。     

ISM频段无线热计量传感器网络节点模块的设计与开发

针对智能住宅建筑能效监管需求和现有热计量系统布线成本高、改造难度大的问题,将ISM频段无线收发芯片应用于无线热计量数据的传输过程中,对热计量传感器网络基本结构和工作原理进行了研究,开发了一种无线热计量数据传感器网络节点模块,设计了该节点模块的基本结构和主要电路,并重点介绍了其SPI接口连接方式及数据传输方法、无线收发芯片寄存器读写控制和热计量数据的无线收发过程。实验结果表明,所设计的无线热计量传感器网络节点模块在保证热计量数据稳定、可靠采集传输的同时,大大地增加了热计量传感器网络的灵活性和适用性,为住宅建筑能效数据的智能化采集、传输和管理提供了一种经济、高效的解决方法。     

基于分布式视频编码的低能耗视频传感器节点研究

在无线多媒体传感器网络中,如何提高节点能源的利用率,延长整个网络的生命周期是当前迫切需要解决的关键问题。从视频数据处理和传输能耗的角度出发,对分布式视频编码(DVC)基础理论及视频传感器节点的能耗模型进行分析和研究。通过实验仿真的方式将H.264帧内编码方案同DVC方案进行比较,实验结果表明了DISCOVER-DVC方案在节点节能方面的优势。最后基于DISCOVER-DVC算法,在S3C6410硬件平台和嵌入式Linux操作系统平台之上完成视频传感器节点设计,来降低节点能耗,提高节点生命周期。     

一种无线视频传感器节点协作跟踪方法

由于网络通信带宽以及节点能量等因素限制,信息的有效获取与能耗的平衡优化是无线视频传感器网络近期研究的热点,面向目标跟踪的无线视频传感器网络实现节能的关键在于节点的高效协作;文章目的在于研究一种无线视频传感器节点协作跟踪方法,通过综合考虑目标跟踪效果和节点能耗等因素,采用自适应混合高斯算法进行背景建模,分布式均值漂移算法进行目标跟踪,并构建一种基于效能函数的最优节点选择方法;实验结果显示该方法能在真实场景下高效地进行目标跟踪。     

一种面向监测区域的链路质量和覆盖保证的节点调度算法

为了降低监测区域能耗总开销和减少网络传输时延,保证监测区域网络链路质量、实现网络的全面覆盖和延长网络生命周期,设计了一种基于扫描线和节点自适应调整苏醒时隙的节点调度方案。首先,定义了系统模型即网络假设和调度目标;然后判断网络是否实现当完全覆盖,当不能全面覆盖时,通过调整部分节点的感知半径来实现网络的全面覆盖;当链路质量过差导致传输延迟过大时,通过设计从源节点到目标节点的增加节点苏醒时隙,并根据节点的剩余能量和传输延迟阈值来减少数据传输次数以降低传输延迟。在NS2环境下进行实验,结果表明：文中方法能有效地实现传感器网络监测区域的全面覆盖,降低网络的传输延迟和提高网络的生命周期,与其他节点调度相比,具有很强的优越性和实用性。     

基于ZigBee的煤矿井下甲烷浓度检测系统设计

针对传统煤矿井下甲烷浓度采用工业总线检测方法的不灵活和存在盲点等问题,本文提出了一种基于ZigBee的煤矿井下甲烷浓度检测系统。系统采用ZigBee协议栈构建无线传感器通讯网络,该网络的终端节点感知和采集矿井甲烷的浓度,并将浓度数据通过无线传输至协调器,协调器再经过串口传输到地面的监控中心。详细介绍了检测系统的软硬件设计,并对系统进行了测试验证。     

无线传感器网络中继节点布居算法的研究

本文表述的是在该应用背景下引入多约束条件, 并采用枚举法与贪婪寻优算法相结合的方法, 解决了在可以作为中继节点设置位置的预设中继节点位置集合内, 合理选择中继节点设置位置以及既存网络因添加新传感器节点所引起的中继节点追加的问题. 仿真实验表明, 本文提出的中继节点布居与追加优化算法能够保证多约束条件下网络的容错性. 同时提出的基于最小网络距离因子评价标准, 有效提高了中继节点布居算法的能效性.     

The power of choice in growing trees

The “power of choice” has been shown to radically alter the behavior of a number of randomized algorithms. Here we explore the effects of choice on models of random tree growth. In our models each new node has k randomly chosen contacts, where k > 1 is a constant. It then attaches to whichever one of these contacts is most desirable in some sense, such as its distance from the root or its degree. Even when the new node has just two choices, i.e., when k = 2, the resulting tree can be very different from a random graph or tree. For instance, if the new node attaches to the contact which is closest to the root of the tree, the distribution of depths changes from Poisson to a traveling wave solution. If the new node attaches to the contact with the smallest degree, the degree distribution is closer to uniform than in a random graph, so that with high probability there are no nodes in the tree with degree greater than O(log log N). Finally, if the new node attaches to the contact with the largest degree, we find that the degree distribution is a power law with exponent -1 up to degrees roughly equal to k, with an exponential cutoff beyond that; thus, in this case, we need k ≫ 1 to see a power law over a wide range of degrees.     

Rapid self-organised initiation of ad hoc sensor networks close above the percolation threshold

This work shows potentials for rapid self-organisation of sensor networks where nodes collaborate to relay messages to a common data collecting unit (sink node). The study problem is, in the sense of graph theory, to find a shortest path tree spanning a weighted graph. This is a well-studied problem where for example Dijkstra’s algorithm provides a solution for non-negative edge weights. The present contribution shows by simulation examples that simple modifications of known distributed approaches here can provide significant improvements in performance. Phase transition phenomena, which are known to take place in networks close to percolation thresholds, may explain these observations. An initial method, which here serves as reference, assumes the sink node starts organisation of the network (tree) by transmitting a control message advertising its availability for its neighbours. These neighbours then advertise their current cost estimate for routing a message to the sink. A node which in this way receives a message implying an improved route to the sink, advertises its new finding and remembers which neighbouring node the message came from. This activity proceeds until there are no more improvements to advertise to neighbours. The result is a tree network for cost effective transmission of messages to the sink (root). This distributed approach has potential for simple improvements which are of interest when minimisation of storage and communication of network information are a concern. Fast organisation of the network takes place when the number k of connections for each node (degree) is close above its critical value for global network percolation and at the same time there is a threshold for the nodes to decide to advertise network route updates.     

Enhancing network lifespan in wireless sensor networks using deep learning based Graph Neural Network

Inadequate energy of sensors is one of the most significant challenges in the development of a reliable wireless sensor network (WSN) that can withstand the demands of growing WSN applications. Implementing a sleep-wake scheduling scheme while assigning data collection and sensing chores to a dominant group of awake sensors while all other nodes are in a sleep state seems to be a potential way for preserving the energy of these sensor nodes. When the starting energy of the nodes changes from one node to another, this issue becomes more difficult to solve. The notion of a dominant set-in graph has been used in a variety of situations. The search for the smallest dominant set in a big graph might be time-consuming. Specifically, we address two issues: first, identifying the smallest possible dominant set, and second, extending the network lifespan by saving the energy of the sensors. To overcome the first problem, we design and develop a deep learning-based Graph Neural Network (DL-GNN). The GNN training method and back-propagation approach were used to train a GNN consisting of three networks such as transition network, bias network, and output network, to determine the minimal dominant set in the created graph. As a second step, we proposed a hybrid fixed-variant search (HFVS) method that considers minimal dominant sets as input and improves overall network lifespan by swapping nodes of minimal dominating sets. We prepared simulated networks with various network configurations and modeled different WSNs as undirected graphs. To get better convergence, the different values of state vector dimensions of the input vectors are investigated. When the state vector dimension is 3 or 4, minimum dominant set is recognized with high accuracy. The paper also presents comparative analyses between the proposed HFVS algorithm and other existing algorithms for extending network lifespan and discusses the trade-offs that exist between them. Lifespan of wireless sensor network, which is based on the dominant set method, is greatly increased by the techniques we have proposed.     

回归的能源有效网络大数据流汇聚算法研究

为了降低传感器网络数据流汇聚时的能源消耗,提出了一种基于回归的能源有效数据流汇聚算法。首先,将传感器节点分为活跃节点和能源有效节点。然后,以活跃节点为中心点将所有节点进行聚类,并应用回归方法通过活跃节点的数据流对能源有效节点的数据进行预测。接下来,通过节点预测值的累积误差不断修正活跃节点集。最后,应用活跃节点的数据流信息对能源有效节点的数据进行预测。实验表明,本文提出的算法与其它相关算法相比具有更好的预测准确性。     

Rewiring dynamical networks with prescribed degree distribution for enhancing synchronizability

In this paper, we present an algorithm for enhancing synchronizability of dynamical networks with prescribed degree distribution. The algorithm takes an unweighted and undirected network as input and outputs a network with the same node-degree distribution and enhanced synchronization properties. The rewirings are based on the properties of the Laplacian of the connection graph, i.e., the eigenvectors corresponding to the second smallest and the largest eigenvalues of the Laplacian. A term proportional to the eigenvectors is adopted to choose potential edges for rewiring, provided that the node-degree distribution is preserved. The algorithm can be implemented on networks of any sizes as long as their eigenvalues and eigenvectors can be calculated with standard algorithms. The effectiveness of the proposed algorithm in enhancing the network synchronizability is revealed by numerical simulation on a number of sample networks including scale-free, Watts-Strogatz, and Erdo?s-Re?nyi graphs. Furthermore, a number of network's structural parameters such as node betweenness centrality, edge betweenness centrality, average path length, clustering coefficient, and degree assortativity are tracked as a function of optimization steps.     

Detection of influential nodes with multi-scale information

The identification of influential nodes in complex networks is one of the most exciting topics in network science. The latest work successfully compares each node using local connectivity and weak tie theory from a new perspective. We study the structural properties of networks in depth and extend this successful node evaluation from single-scale to multi-scale. In particular, one novel position parameter based on node transmission efficiency is proposed, which mainly depends on the shortest distances from target nodes to high-degree nodes. In this regard, the novel multi-scale information importance (MSII) method is proposed to better identify the crucial nodes by combining the network's local connectivity and global position information. In simulation comparisons, five state-of-the-art algorithms, i.e. the neighbor nodes degree algorithm (NND), betweenness centrality, closeness centrality, Katz centrality and the k-shell decomposition method, are selected to compare with our MSII. The results demonstrate that our method obtains superior performance in terms of robustness and spreading propagation for both real-world and artificial networks.     

一种基于势博弈的无线传感器网络拓扑控制算法

在实际的应用中,无线传感器网络常常由大量电池资源有限的传感器节点组成.如何降低网络功耗,最大化网络生存时间,是传感器网络拓扑控制技术的重要研究目标.随着传感节点的运行,节点的能量分布可能越来越不均衡,需要在考虑该因素的情况下,动态地调整节点的网络负载以均衡节点的能耗,达到延长网络生存时间的目的.该文引入博弈理论和势博弈的概念,综合考虑节点的剩余能量和节点发射功率等因素,设计了一种基于势博弈的拓扑控制模型,并证明了该模型纳什均衡的存在性.通过构造兼顾节点连通性和能耗均衡性的收益函数,以确保降低节点功耗的同时维持网络的连通性.通过提高邻居节点的平均剩余能量值以实现将剩余能量多的节点选择作为自身的邻居节点,提高节点能耗的均衡性.在此基础上,提出了一种分布式的能耗均衡拓扑控制算法.理论分析证明了该算法能保持网络的连通性.与现有基于博弈理论的DIA算法和MLPT算法相比,本算法形成的拓扑负载较重、剩余能量较小的瓶颈节点数量较少,节点剩余能量的方差较小,网络生存时间更长.     

一种无线传感器网络健壮性可调的能量均衡拓扑控制算法

无线传感器网络中, 应用环境的干扰导致节点间距不能被准确度量. 所以利用以节点间距作为权重的闭包图(EG)模型构建的拓扑没有考虑环境的干扰, 忽略了这部分干扰带来的能耗, 缩短了网络生存时间. 针对无线传感器网络拓扑能量不均的特点和EG模型的缺陷, 首先引入节点度调节因子, 建立通信度量模型和节点实际生存时间模型; 其次量化网络节点度, 从而获取满足能量均衡和网络生命期最大化需求的节点度的取值规律; 然后利用该取值规律和函数极值充分条件解析推导出网络最大能量消耗值和最长生存时间, 并获得最优节点度; 最后基于以上模型提出一种健壮性可调的能量均衡拓扑控制算法. 理论证明该拓扑连通且为双向连通. 仿真结果说明网络能利用最优节点度达到较高的健壮性, 保证信息可靠传输, 且算法能有效平衡节点能耗, 提高网络健壮性, 延长网络生命周期.