面向WSN的自适应模糊功率控制算法研究

在无线传感器网络环境中存在干扰以及网络的动态变化等原因,传输可靠性问题成为保障网络服务性能的重要挑战之一。现有的研究方法基本没有考虑网络的动态性,节点能耗较高。为此,我们提出了一种面向WSN的自适应模糊功率控制算法DAFPC。该算法采用自适应模糊理论,并基于“输入-输出-反馈”机制,根据接收到的链路质量参数信息自适应地调整控制器,快速地调节发射功率。研究仿真结果表明,DAFPC算法能很好地适应网络的动态变化,有效地提高WSN的抗干扰性和传输可靠性,延长了网络的生存时间。     

适合无线传感器网络的自适应动态电压调节算法*

对于能量有限的传感器网络,在计算复杂度较高的应用中,节省CPU的能耗具有重要意义。针对以事件为驱动的无线传感器网络的任务模式,提出一种基于零散任务模型的自适应DVS算法——ADVS。ADVS算法根据CPU的任务量实时调整工作频率和电压,能在很大程度上降低CPU能耗的同时,保证任务的实时性要求。理论分析和实验结果表明,ADVS算法的实际节能效果接近理论分析值的80%左右,可在很大程度上延长节点的生命周期。     

基于灰色模型的无线传感器网络动态功耗管理研究

传感器节点能量受限是制约无线传感器网络使用寿命的关键因素,为了节约传感器网络的能量,提出了灰色模型的动态功耗管理(DPM)方法.该方法利用传感器节点上的历史数据应用灰色模型预测未来值,预测过程中可以动态调整预测参数,实现自适应预测,和小波自回归预测算法相比,提高了预测的准确性.基本思想是根据Sink节点上的数据来决定整...     

基于线性回归的无线传感器网络分布式数据采集优化策略

事件监测是无线传感器网络中最重要的应用之一,部署在监测区域内的传感器节点通过对感知数据信息的采集、处理和传输等基本操作完成具体的监测任务,在各种操作中,节点之间的数据传输是最消耗能量的.为了减少节点之间的通信数据量,达到降低网络能耗和延长网络生命周期的目的,该文提出了一种能量高效的基于线性回归的无线传感器网络分布式数据采集优化策略,通过应用线性回归分析方法构建感知数据模型,保持感知数据的特征,使节点仅传输回归模型的参数信息,代替传输实际监测的感知数据信息.仿真实验结果表明,文中提出的数据采集优化策略能通过较小的通信量有效地实现事件监测区域感知数据的预测和估计,降低网络的总能量消耗,延长网络的生命周期.     

一种基于受限网络的移动对象索引

为了有效地支持城市交通网络中移动对象的过去、现在和将来的轨迹查询,在基于模拟预测的位置表示模型基础上,提出了一种两层R树加上一个表结构的复合索引结构AUC(Adaptive Unit Compounding).根据城市交通网的特征,采用了一种带有环形交叉口的元胞自动机模型模拟移动对象的将来轨迹,并用线性回归和圆弧曲线拟合分别得到对象在规则路段和交叉口的轨迹预测方程;根据移动对象的运动特性,采用了一种新的自适应单元(AU)作为索引结构的基本单位.实验表明,AUC索引的查询和更新性能都要优于TPR树和TB树.     

无线传感器网络中一种混合动态自适应路由算法

针对无线传感器网络的节能以及能耗均衡问题，本文提出了一种无线传感器网络混合路由网络模型，将平面路由和层次路由有机地结合在一起，在数据获取阶段采用层次路由，而在数据传输过程中使用平面路由。同时，论文提出了一种基于该模型的动态成簇自适应路由算法HDAR（Hybrid Dynamic Adaptive Routing algorithm）。在算法中设计了基于现场数据的动态成簇机制来完成数据的收集，使用自适应的路由选择算法将数据传输回Sink节点。仿真结果表明HDAR协议在节能和能耗均衡方面达到了良好的效果。     

单节点的无线传感器网络数据传输优化策略

为了提高无线传感器网络（WSNs）节点能量的利用率,延长WSNs的生存时间,提出了一种单节点的WSNs数据传输优化策略.首先对WSNs结构进行分析,并建立单个传感器节点数据传输优化的数学模型;然后采用惩罚函数法对数据传输过程中的传感器节点能耗进行优化;最后在Matlab 2012平台对其进行仿真分析.结果表明：该方法可以根据环境能量的变化对传感器节点能耗进行自适应优化,提高了节点的累积数据传输总量,可以较好适应环境能量不确定性.     

Energy-balanced multiple-sensor collaborative scheduling for maneuvering target tracking in wireless sensor networks

An energy-balanced multiple-sensor collaborative scheduling is proposed for maneuvering target tracking in wireless sensor networks (WSNs). According to the position of the maneuvering target, some sensor nodes in WSNs are awakened to form a sensor cluster for target tracking collaboratively. In the cluster, the cluster head node is selected to implement tracking task with changed sampling interval. The distributed interactive multiple model (IMM) filter is employed to estimate the target state. The estimat...     

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.     

A Proposed Hybrid Recurrent Neural Control System for Two Co-operating Robots

This paper discusses a model refernce adaptive (MRAC) position/force controller using proposed neural networks for two co-operating planar robots. The proposed neural network is a recurrent hybrid network. The recurrent networks have feedback connections and thus an inherent memory for dynamics, which makes them suitable for representing dynamic systems. A feature of the networks adopted is their hybrid hidden layer, which includes both linear and nonlinear neurons. On the other hand, the results of the case of a single robot under position control alone are presented for comparison. The results presented show the superior ability of the proposed neural network based model reference adaptive control scheme at adapting to changes in the dynamics parameters of robots.     

线型无线传感器网络中一种联合优化中继节点选择策略

在无线传感器网络中,时延与功耗性能往往是一对不可兼得的指标,如何优化和平衡这两个指标是路由和MAC算法中的难点.线型无线传感器网络由于拓扑结构的线型性,功耗-时延的均衡问题显得更加突出.基于线型无线传感器网络拓扑模型,理论分析了能耗最优传输距离,然后基于节点剩余能量,构建联合优化目标函数.进一步地,将数据包类型在时间敏感性方面分为紧急数据包和普通数据包,并相应调整发射功率,以便在当前通信范围内找到最优下一跳中继节点.最终提出了一个功率可调的时延-能耗自适应优化中继节点选择算法(LEARS).通过仿真实验将该算法与经典及类似算法比较,LEARS能够在保证紧急数据包传输实时性的同时,进一步降低网络的整体功耗,延长网络的生命周期.     

无线传感器网络自适应链路层FEC控制策略*

提出一种适用于无线传感器网络的自适应链路层FEC控制策略。该策略基于Kalman滤波器预测当前的网络状态,在数据链路层采用FEC控制机制,根据FEC能耗分析的自身特性自适应地调整FEC参数n,以便改善无线传感器网络的通信性能,并建立单跳无线传感器网络模型和能量模型。数学分析和仿真验证表明,该策略能够有效地提高无线传感器网络数据传输的可靠性,降低无线传感器网络的能量消耗。     

On query processing in wireless sensor networks using classes of quality of queries

This paper introduces the concept of quality of queries (QoQs) towards a more adaptive query processing in wireless sensor networks (WSNs). This approach aims at the intelligent consumption of the limited resources (energy and memory) available in these networks while still delivering a reasonable level of data quality as expected by client applications. In a nutshell, the concept of QoQ stipulates that the results of different queries injected into the same WSN can be tailored according to different criteria, in particular the levels of query result accuracy and energy consumption. For this purpose, four classes of QoQ (CoQoQ) are specified having in mind distinct requirements in terms of these criteria. To allow the implementation of these classes in a real WSN setting, a new novelty-detection based algorithm, referred to as AdaQuali (which stands for “ADAptive QUALIty control for query processing in WSN”), is also proposed in a manner as to control the sensor node activities through the dynamic adjustment of their rates of data collection and transmission. In order to validate the novel approach, simulations with a prototype implemented in Sinalgo have been conducted over real temperature data. The results achieved evidence the suitability of the proposal and point to gains of up to 66.76%, for different CoQoQ, in terms of reduction in energy consumption.     

An agent-assisted QoS-based routing algorithm for wireless sensor networks

Existing routing algorithms are not effective in supporting the dynamic characteristics of wireless sensor networks (WSNs) and cannot ensure sufficient quality of service in WSN applications. This paper proposes a novel agent-assisted QoS-based routing algorithm for wireless sensor networks. In the proposed algorithm, the synthetic QoS of WSNs is chosen as the adaptive value of a Particle Swarm Optimization algorithm to improve the overall performance of network. Intelligent software agents are used to monitor changes in network topology, network communication flow, and each node's routing state. These agents can then participate in network routing and network maintenance. Experiment results show that the proposed algorithm can ensure better quality of service in wireless sensor networks compared with traditional algorithms.     

用于智能电网的有差别射频充电传感器网络

针对应用于智能电网中的无线传感器网络(WSNs)节点能量受限问题,分析了基于无线射频充电技术的为传感器节点充电技术,改进了可持续无线充电传感器网络(SWRSNs),提出有差别射频充电传感器网络(DRRSNs)技术,增加节点的优先级设置,建立整数线性规划模型,用CPLEX求解模型确定标志性节点位置。求解数据表明:节点获得的能量平均提高105%,高优先级节点比低优先级节点平均多获得43%的能量,提高了节点的寿命,保证了WSNs的可靠性,但是路径访问效率平均降低了14%。     

Adaptive hinging hyperplanes and its applications in dynamic system identification

The model of adaptive hinging hyperplanes (AHH) is proposed in this paper. It is based on multivariate adaptive regression splines (MARS) and generalized hinging hyperplanes (GHH) and shares attractive properties of the two. By making a modification to the basis function of MARS, AHH shows linear property in each subregion. The AHH model is actually a special case of the GHH model, which has a universal representation capability for continuous piecewise linear functions. The approximation ability of the AHH model is proved. The AHH algorithm is developed similar to the MARS algorithm. It is adaptive and can be executed efficiently, hence has power and flexibility to model unknown relationships. The AHH procedure is applied to identifying two dynamic systems and its potential is illustrated.     

Study on the algorithm for smart community sensor network routing with adaptive optimization via cluster head election

To reduce the uneven energy consumption for the data transmission and extend network life of intelligent community sensor network, an adaptive routing optimized algorithm for intelligent community sensor networks with cluster head election is proposed. In this algorithm, a three-dimensional clustering method adapted to the structure of intelligent community sensor network is proposed. The three-dimensional clustering method uses the cluster head election mechanism based on minimizing the total transmission loss to optimize the energy of the intelligent community sensor network. Second, an adaptive ant colony propagation method is proposed to solve the problem of intercluster data propagation after clustering. With the best path finding algorithm of ant colony algorithm, energy balance routing with lower energy loss and lower packet error rate is proposed. Finally, the simulation results show that the algorithm has better performance in reducing energy consumption and delay, improving transmission efficiency and node survival time.     

一种基于城市交通网络的移动对象全时态索引

高效地管理移动对象以支持查询是一个重要课题.为了支持在城市交通网络上的移动对象过去、现在和将来位置查询,提出了一种新的索引技术.首先提出基于模拟预测的位置表示模型来改进对移动对象将来运动轨迹的预测精度;其次根据城市交通网的特征,设计了一种全新的动态结构自适应单元(AU),将其开发为一个基于R树的索引结构(current-Au);最后在AU的基础上进行扩展(past-AU)使其支持移动对象历史轨迹查询并且避免了大量的死空间.实验证明,AU索引优于传统的TPR树和TB树索引.     

DLRDG: distributed linear regression-based hierarchical data gathering framework in wireless sensor network

For many applications in wireless sensor network (WSN), the gathering of the holistic sensor measurements is difficult due to stringent constraint on network resources, frequent link, indeterminate variations in sensor readings, and node failures. As such, sensory data extraction and prediction technique emerge to exploit the spatio-temporal correlation of measurements and represent samples of the true state of the monitoring area at a minimal communication cost. In this paper, we present DLRDG strategy, a distributed linear regression-based data gathering framework in clustered WSNs. The framework can realize the approximate representation of original sensory data by less than a prespecified threshold while significantly reducing the communication energy requirements. Cluster-head (CH) nodes in WSN maintain linear regression model and use historical sensory data to perform estimation of the actual monitoring measurements. Rather than transmitting original measurements to sink node, CH nodes communicate constraints on the model parameters. Relying on the linear regression model, we improved the CH node function of representative EADEEG (an energy-aware data gathering protocol for WSNs) protocol for estimating the energy consumption of the proposed strategy, under specific settings. The theoretical analysis and experimental results show that the proposed framework can implement sensory data prediction and extracting with tolerable error bound. Furthermore, the designed framework can achieve more energy savings than other schemes and maintain the satisfactory fault identification rate on case of occurrence of the mutation sensor readings.