基于自适应压缩感知的分簇式网络数据收集

分簇式传感器网络中基于混合压缩感知的数据收集方法可以有效减少数据传输量并均衡网络负载.但是,固定采样率因不能考虑信号的稀疏度在时间和空间上的变化,导致低采样率难以保证信号的重构质量,而高采样率又会造成资源浪费.针对此问题,基于数据线性程度分析提出了一种采样率自适应调整的分簇式网络数据收集方法.首先,Sink节点以簇为单位分析当前采样时刻与上一采样时刻重构数据的线性程度,以掌握数据变化趋势;然后,根据分析结果计算网络在下一采样时刻所需采样率及簇头节点所需观测值维数;最后利用数据传输树实现对簇头节点观测数目的自适应调节.仿真结果表明,与基于固定采样率的网络数据收集方法相比,该方法能够在增加少量反馈观测值维数所需的数据传输量的情况下有效提高压缩数据的重构精度.     

WSN中改进的基于压缩感知的分簇数据采集算法

WSNs中节点的能量受限,为节约网络节点的功耗,提出了一种将LEACH模型和CS理论相结合的基于节点时空相关性的压缩感知算法。LEACH算法对网络节点进行分簇并选择簇首,然后,采用CS理论对簇首节点进行采样,将采样后的数据通过多跳路由的方法传至远端的汇聚节点,最后,汇聚节点对来自簇首的少量数据采用重构算法以对原始信号进行精确恢复。仿真结果表明,该方法有效减小了数据传输量,降低了网络节点的功耗,延缓了网络寿命。     

时延受限的无线传感网中移动式能量补充

为了延长无线传感网的生存期,基于可充电的移动设备,研究设计了一种无线传感网中移动式能量补充的方法,移动节点可以在为传感器节点补充能量的同时收集数据.首先,通过将无线传感器网络监测区域分割为大小相同的子区域,该子区域内的节点组成一个簇;其次,以一个簇内的总能量为计算依据,设计移动节点的路径生成算法以确定能量高效的移动路线;最后,使用10种不同的随机网络拓扑图进行了仿真实验,以节点移动速度和时延为限制条件分别得到了对比数据.结果表明,本文提出的算法与NJNP(nearest-job-next with preemption)算法相比在时延相同的条件下(800 s),生存期提升了6 000 s左右,在节点速度5 m/s条件下生存期提升了将近14 000 s.证明本文所提方法有效地提高了充电效率,延长了网络的生存期,可用于大规模的无线传感器网络.     

基于无线传感器网络技术的山区高速公路边坡监测方案

基于2.4GHzZigBee通信协议的无线传感器网络技术设计的高速公路边坡稳定性实时监测系统方案,由自组多跳的多无线传感器节点构成数据采集传输簇群,通过GPRS模块将数据传输至远程监控中心辅助决策,对此已完成通讯测试和模拟组网调试,充分证明了该方案设计能够满足边坡稳定性实时监控的需要。     

移动Ad Hoc网络中基于可靠传输的节能机制

随着移动Ad Hoc网络的应用日趋广泛,如何有效节省移动节点的能量,提高网络生存时间成为了难题.针对现有的节能协议和机制很少考虑链路误码率的问题,分析了在端到端重传机制和逐跳重传机制下的理想能耗,定义了新的链路代价函数.仿真结果表明使用该机制的路由协议具有较好性能,在数据传输可靠性和能耗之间达到有效的平衡.     

基于无线传感器网络技术的山区高速公路边坡监测方案

基于2．4GHz ZigBee通信协议的无线传感器网络技术设计的高速公路边坡稳定性实时监测系统方案,由自组多跳的多无线传感器节点构成数据采集传输簇群,通过GPRS模块将数据传输至远程监控中心辅助决策,对此已完成通讯测试和模拟组网调试．充分证明了该方案设计能够满足边坡稳定性实时监控的需要。     

DV-HOP定位算法改进研究

节点定位是无线传感器网络中的关键技术之一．基于无线传感器网络中DV-HOP定位算法分析的基础上,提出了一种改进算法．该算法通过RSSI测距技术测量点到点的距离,并在多跳网络中对累加距离进行广播,最后在节点位置估计过程中引入了加权质心算法进行定位．实验结果表明,改进后算法复杂度低,定位精度有明显的提高．     

面向路基监测的WSN分簇自适应加权融合算法

部署在铁路路基监测区域内的无线传感器网络（WSN）,由于节点能量和带宽等资源的限制,要求数据的采集、处理、传输满足低能耗、高效率和高可靠性. 本文提出面向智能监测的无线传感器网络分簇部署策略,在感兴趣的区域内部署尽量多的节点,并根据数量类型、环境特征等因素将网络以簇为单位进行划分. 以簇为单位,采用自适应加权数据融合处理技术,将采集的地温数据按照精度分别乘以权重值再进行平均值处理,有利于降低数据冗余度,提高数据准确度和采集效率. 仿真性能分析表明,该方法可以显著提高数据传输效率,降低网络能耗,延长网络生命周期.     

����·������WSN�ִ�����Ӧ��Ȩ�ں��㷨

部署在铁路路基监测区域内的无线传感器网络（WSN）,由于节点能量和带宽等资源的限制,要求数据的采集、处理、传输满足低能耗、高效率和高可靠性. 本文提出面向智能监测的无线传感器网络分簇部署策略,在感兴趣的区域内部署尽量多的节点,并根据数量类型、环境特征等因素将网络以簇为单位进行划分. 以簇为单位,采用自适应加权数据融合处理技术,将采集的地温数据按照精度分别乘以权重值再进行平均值处理,有利于降低数据冗余度,提高数据准确度和采集效率. 仿真性能分析表明,该方法可以显著提高数据传输效率,降低网络能耗,延长网络生命周期.     

基于半马尔科夫链的中小堤坝WSN节点能耗研究

无线传感器网络技术的引入,为中小型堤坝监测技术的发展提供了新思路。由于无线传感器网络节点采用电池供电,而堤坝环境中的数据监测条件比较苛刻,电源更换相对困难,无线传感器网络节点能耗的优化在延长整个无线传感器网络生命周期过程中显得尤为重要。本文介绍了无线传感器网络中节点能耗的主要分布,并提出了降低节点能量消耗的策略。借助半马尔可夫链理论建立了节点能耗的数学模型,分析了WSN节点的能耗情况,在保证正常数据通信的情况下,通过对节点状态的管理,延长节点的睡眠时间,从而达到降低整个网络能耗的目的。     

Priority based data reporting algorithm in wireless sensor networks

A cluster-based organization with two phases to separate priority calculation and network activity operations is developed. In the election-state phase, clusters are organized by those nodes with sufficient residual energy level (REL) that are distributed as evenly as possible in the network. For each network round, each node decides its role (such as, cluster header (CH) or a normal node) and its priority level for activity operation. The priority level also affects the active/sleep scheduling in the node. In the steady-state phase, the positive priority levels of active nodes determine their activity order to avoid transmission collision, and to reduce redundant data transmission and sensing coverage. Since the data reporting to the sink is usually performed by a CH delivery chain, subsidiary CHs are selected to assist with data delivery and to share the loading of CHs. The formulae for computing priority levels are analyzed and verified by the examples with valid parameters. The experimental results show that the two phases efficiently consume node energy and achieve energy savings.     

无线传感器网络中基于势能场的能量均衡模型

在无线传感器网中,现有的节能路由以找到能量消耗最小的路径为目标,导致围绕汇聚节点的能量空洞．网络能量均衡可以有效的利用和管理整个网络的节点能量,通过有效的分配网络负载,实现网络寿命的延长,网络效率的提高．本论文中提出了基于势能场的模型,建立了基于势能的路由,并且通过相位切换技术,达到局部和全局的能量均衡,从而延长无线传感器网络的使用寿命．     

Ad Hoc网络中基于移动Agent的密钥管理及认证

提出了在Ad Hoc网络中一种基于移动Agent的密钥管理及认证方法.移动Agent在网络中根据一定的运行策略进行移动,并不断地和所经历的节点进行数据交换,在此基础上形成一个节点信息矩阵表,矩阵表中包含了密钥信息.各节点使用其身份作为公钥,主密钥由各节点的私钥分享,从而形成基于身份的门限分布式密钥管理.该方法使用很少的Agent获得较多的全局信息并快速交换密钥信息,减少了系统的开销,具有很高的效率和鲁棒性.     

Network lifetime global optimization for multi-source and single-sink topology in wireless sensor networks

The multi-source and single-sink (MSSS) topology in wireless sensor networks (WSNs) is defined as a network topology, where all of nodes can gather, receive and transmit data to the sink. In energy-constrained WSNs with such a topology, the joint optimal design in the physical, medium access control (MAC) and network layers is considered for network lifetime maximization (NLM). The problem of integrating multi-layer information to compute NLM, which involves routing flow, link schedule and transmission power, is formulated as a non-linear optimization problem. Specially under time division multiple access (TDMA) scheme, this problem can be transformed into a convex optimization problem. To solve it analytically we make use of the property that local optimization is global optimization in convex problem. This allows us to exploit the Karush-Kuhn-Tucker (KKT) optimality conditions to solve it and obtain analytical solution expression, i.e., the globally optimal network lifetime (NL). NL is derived as a function of number of nodes, their initial energy and data rate arrived at them.Based on the analysis of analytical approach, it takes the influence of data rates, link access and routing method over NLM into account. Moreover, the globally optimal transmission schemes are achieved by solution set during analytical approach and applied to algorithms in TDMA-based WSNs aiming at NLM on OMNeT<++> to compare with other suboptimal schemes.     

移动无线传感器网络节点定位算法研究

文章针对移动无线传感器网络中节点定位的问题,提出利用一个移动锚节点结合DV-Hop算法来对节点进行定位的方法,该算法与静态网络中DV-Hop定位算法相比节约了网络成本,仿真实验表明,该算法的定位误差和定位覆盖率可以满足大多数应用。     

An Adaptive Scheme for Neighbor Discovery in Mobile Ad Hoc Networks

The neighbor knowledge in mobile ad hoc networks is important information. However, the accuracy of neighbor knowledge is paid in terms of energy consumption. In traditional schemes for neighbor discovery, a mobile node uses fixed period to send HELLO messages to notify its existence. An adaptive scheme was proposed. The objective is that when mobile nodes are distributed sparsely or move slowly, fewer HELLO messages are needed to achieve reasonable accuracy, while in a mutable network where nodes are dense or move quickly, they can adaptively send more HELLO messages to ensure the accuracy. Simulation results show that the adaptive scheme achieves the objective and performs effectively.     

视角受限传感器网络强栅栏覆盖判定算法

栅栏覆盖研究如何分配网络时空资源来确保移动目标穿越监控区域时被监测．本文通过视角受限节点传感方向的调整,设计一种分布式算法以判定网络能否提供强栅栏覆盖．算法主要思想是利用节点及邻居节点的物理位置关系构建强／弱栅栏对．另外,本文设计贪心策略优先选择邻居节点数多的候选节点构建强栅栏路径．仿真实验证明：本算法可以较小代价判定并改善网络强栅栏覆盖性能．     

Research on Improved Low-Energy Adaptive Clustering Hierarchy Protocol in Wireless Sensor Networks

In wireless sensor networks (WSNs), due to the limited battery power of the sensor nodes, the communication energy consumption is the main factor to affect the lifetime of the networks. A reasonable design of the communication protocol can effectively reduce the energy consumption of the network system. Based on low-energy adaptive clustering hierarchy (LEACH), an improved LEACH protocol in WSNs is proposed. In order to optimize the cluster head (CH) election in the cluster setup phase, the improved LEACH takes into account a number of factors, including energy consumption of communication between nodes, remaining energy of the nodes, and the distance between nodes and base station (BS). In the steady phase, one-hop routing and multiple-hop routing are combined to transmit data between CHs to improve energy efficiency. The forward CH is selected as relay node according to the values of path cost. The simulation results show that the proposed algorithm performs better in balancing network energy consumption, and it can effectively improve the data transmission efficiency and prolong the network lifetime, as compared with LEACH, LEACH-C (LEACH-centralized) and NDAPSO-C (an adaptive clustering protocol based on improved particle swarm optimization) algorithms.     

无线传感器网络中能量有效分簇路由算法

由于无线传感器节点的电源能量有限,提出了一种能量有效分簇路由算法(EECRA).该算法是基于最小能量的数据转发并运用于簇内路由中,簇头由基站根据节点的剩余能量和簇头之间的距离来选定,为了减小簇头节点的能量开销,簇头之间采用了多跳中继的方式将采集的数据发送到基站.仿真结果证明:该算法与LEACH协议相比,不仅提高了网络寿命,同时节点的能耗均衡性、网络扩展性和可靠性都大大的提高.