监测无线传感器网络休眠调度算法

休眠调度设计是无线传感器网络一种重要的通信节能方法。针对监测典型应用,为了实现长时间的监测应用要求,充分利用冗余部署提供的能量资源,提出了一种能量相关的分布式自适应休眠调度算法。算法利用极大独立集构建思想,结合节点层次级别、实时的能量消耗、连通度等信息动态选择连通支配节点集作为网络骨干,使得网络活跃节点数量最小化。仿真试验分析表明,算法能够有效地利用冗余节点提供的能量资源,扩展了网络的生命周期。     

Energy Efficient Opportunistic Routing with Sleep Scheduling in Wireless Sensor Networks

Wireless Personal Communications - The network life of wireless sensor networks (WSNs) relies on the limited energy of non-rechargeable batteries used at the sensor node. Hence, maximum energy...     

基于粒子群的无线传感网络节点休眠调度算法

针对传统节点休眠调度算法中覆盖率低、活跃节点数量多以及能量消耗不均匀的问题,基于可信信息覆盖模型,提出一种基于粒子群优化算法(Particle Swarm Optimization,PSO)的无线传感网络节点休眠调度算法.算法充分利用可信信息覆盖模型的优势构建最优的可信信息覆盖集合和簇头候选集合,从可信信息覆盖集合和簇...     

一种无线传感器网络的自适应休眠调度算法

针对数字航道观测场景变化以及传感器节点能量有限的特点,提出一种将无线传感器网络用于数字航道观测时的自适应休眠调度算法.该算法能感知数字航道观测场景的变化,并据此调整节点的状态.仿真结果表明提出的算法与已有的休眠调度算法对比,更加适应观测场景的变化,从而延长网络生命周期.     

一种基于休眠调度策略的无线传感网络分簇协议

文中设计了一种基于休眠调度策略的无线传感网络分簇协议.该协议计算出簇首最佳比例和网络瞬时剩余能量,采用固定簇首数目与剩余能量估计的方法对网络进行分簇,在成簇后的数据传送阶段采用蚁群算法计算出节点的唤醒概率,最后通过仿真实验与LEACH、SEP协议进行了比较.实验结果表明:该协议在对目标保持较好探测效果的前提下能更均匀的消耗网络的能量,从而延长网络的生命周期.     

Data Fault Detection in Wireless Sensor Networks Using Machine Learning Techniques

Wireless Personal Communications - Wireless Sensor Network (WSN) is a wireless network that consists of spatially distributed autonomous devices with sophisticated subsystem called sensors to...     

3-Dimensional Manifold and Machine Learning Based Localization Algorithm for Wireless Sensor Networks

For upcoming futuristic communication systems, the Optical Wireless Communication (OWC) with its inherent advantages is becoming popular among service providers. The research in the past has primarily focused on Quality of service (QoS) aspect for OWC in the presence of atmospheric turbulence however, to assess the real time outcome of a service, the evaluation of both QoS and Quality of Experience (QoE) deliver a holistic approach. A much Less effort in the existing literature has been paid to this. Authors in this work attempt to determine the QoE for image transmission over a turbulent OWC link while considering the Structure Similarity Index (SSIM) as a visual performance indicator under varying turbulence strengths (regimes). A functional model to forecast the performance of SSIM practicable for all the regimes is proposed. The most suitable model is bimodal Gaussian mixture model which aptly describes the system performance. To improve the performance, spatial domain filters such as Median and Wiener filters have been employed. An increase of 125 m in the propagation distance and 5.88 dB in received SNR can be achieved while maintaining the SSIM at a 90% for median filter restoration in moderate turbulence regime for simulated values while predicted values suggest an increase of 115 m and 5.18 dB at same level. The results show that the proposed model is in good agreement with simulated values and median filter in moderate turbulence performs best out of all the situations.

     

基于能效优化的WSNs多径流量分配路由算法

该文针对传感器节点能量受限的特点建立能效优化模型,该模型兼顾网络传输能耗和能耗均衡特性,以最大化网络节点总剩余能量和最小化剩余能量的方差为目标,通过合理分配多条路径的流量来优化网络能效。利用权衡评价函数实现了模型的求解,进而提出一种多径流量分配路由(MFAR)算法。仿真实验表明,该算法能够合理配置各路径流量,显著提高网络能量效率,达到在降低网络能耗的同时保证能耗分布均衡的目标。     

基于容忍覆盖区域的无线传感器网络节点调度算法

节点调度机制是解决无线传感器网络节点能量受限问题的重要方法.传统的位置信息无关的节点调度方案以节点的感知区域覆盖为调度目标,导致处于边界区域的节点由于没有太多机会进入休眠状态而先死亡,进而引起死亡节点向监测中心扩散现象,我们称这种现象为"不均等休眠"问题.针对该问题,从理论上对节点覆盖模型进行分析,提出容忍覆盖区域的概...     

面向异构无线传感器网络的节点调度算法

针对传感器网络中的节点冗余问题,提出了一种冗余判别方法来关闭冗余节点,以达到延长网络生命周期的目的.首先按邻居节点的不同位置对节点进行分类,研究了每组邻居节点的网络覆盖率与工作节点数k之间的约束关系,在此基础上,按不同的冗余法则对节点进行判断,关闭冗余节点.理论分析和实验结果表明,提出的算法能关闭网络中的冗余节点从而有效地延长网络的生存时间.     

A Graph Coloring Based TDMA Scheduling Algorithm for Wireless Sensor Networks

Wireless sensor networks should provide with valuable service, which is called service-oriented requirement. To meet this need, a novel distributed graph coloring based time division multiple access scheduling algorithm (GCSA), considering real-time performance for clustering-based sensor network, is proposed in this paper, to determine the smallest length of conflict-free assignment of timeslots for intra-cluster transmissions. GCSA involves two phases. In coloring phase, networks are modeled using graph theory, and a distributed vertex coloring algorithm, which is a distance-2 coloring algorithm and can get colors near to $(\updelta +1)$ , is proposed to assign a color to each node in the network. Then, in scheduling phase, each independent set is mapped to a unique timeslot according to the set’s priority which is obtained by considering network structure. The experimental results indicate that GCSA can significantly decrease intra-cluster delay and increase intra-cluster throughput, which satisfies real-time performance as well as communication reliability.     

Range-Based Sleep Scheduling (RBSS) for Wireless Sensor Networks

Sleep scheduling in a wireless sensor network is the process of deciding which nodes are eligible to sleep (enter power-saving mode) after random deployment to conserve energy while retaining network coverage. Most existing approaches toward this problem require sensor’s location information, which may be impractical considering costly locating overheads. This paper proposes range-based sleep scheduling (RBSS) protocol which needs sensor-to-sensor distance but no location information. RBSS attempts to approach an optimal sensor selection pattern that demands the fewest working (awake) sensors. Simulation results indicate that RBSS is comparable to its location-based counterpart in terms of coverage quality and the reduction of working sensors.

一种无线传感器网络中目标跟踪的自适应节点调度算法

在无线传感器网络目标跟踪的过程中进行节点调度,可以综合考虑跟踪误差和能量消耗,延长传感器网络的使用寿命。为了综合考虑节点调度的短期和长远损失,该文将问题建模为部分可观测马尔科夫决策过程(POMDP)以得到更优的调度策略,并提出一种近似求解算法C-QMDP。该算法利用马尔科夫链蒙特卡洛方法(MCMC)推导连续状态空间的置信状态的转移,并计算瞬时代价。使用状态离散化方法,基于马尔科夫决策过程(MDP)值迭代求解未来代价的近似值。仿真结果表明,相比现有POMDP近似算法,该文算法既可以降低跟踪过程中的累积损失,又可以将大量运算进行离线计算,减小了在线决策时的计算量。     

基于能量预测的无线传感器网络节点覆盖调度算法

针对无线传感器网络中存在的热区问题,采用非均匀部署方案,并在此基础上提出基于能量预测的无线传感器网络节点覆盖调度算法。并对算法进行了仿真实验和性能分析。结果表明该算法可以延长的网络生命周期并在较长的时间里保持较高的网络覆盖率,能够达到网络内大多数节点能耗均衡的设计目标。     

Machine Learning Based Detection and a Novel EC-BRTT Algorithm Based Prevention of DoS Attacks in Wireless Sensor Networks

Wireless Personal Communications - Wireless sensor network allows nodes to communicate with another using wireless channels so that it is necessary for packet delivery to the nodes. Black hole...     

Energy Efficiency Routing with Node Compromised Resistance in Wireless Sensor Networks

For the energy limited wireless sensor networks, the critical problem is how to achieve the energy efficiency. Many attackers can consume the limited network energy, by the method of capturing some legal nodes then control them to start DoS and flooding attack, which is difficult to be detected by only the classic cryptography based techniques with common routing protocols in wireless sensor networks (WSNs). We argue that under the condition of attacking, existing routing schemes are low energy-efficient and vulnerable to inside attack due to their deterministic nature. To avoid the energy consumption caused by the inside attack initiated by the malicious nodes, this paper proposes a novel energy efficiency routing with node compromised resistance (EENC) based on Ant Colony Optimization. Under our design, each node computes the trust value of its 1-hop neighbors based on their multiple behavior attributes evaluation and builds a trust management by the trust value. By this way, sensor nodes act as router to achieve dynamic and adaptive routing, where the node can select much energy efficiency and faithful forwarding node from its neighbors according to their remaining energy and trust values in the next process of data collection. Simulation results indicate that the established routing can bypass most compromised nodes in the transmission path and EENC has high performance in energy efficiency, which can prolong the network lifetime.     

A Learning Automata Based Area Coverage Algorithm for Wireless Sensor Networks

One way to reduce energy consumption in wireless sensor networks is to reduce the number of active nodes in the network. When sensors are redundantly deployed, a subset of sensors should be selected to actively monitor the field （referred to as a ＂cover＂）, whereas the rest of the sensors should be put to sleep to conserve their batteries. In this paper, a learning automata based algorithm for energy-efficient monitoring in wireless sensor networks （EEMLA） is proposed. Each node in EEMLA algorithm is equipped with a learning automaton which decides for the node to be active or not at any time during the operation of the network. Using feedback received from neighboring nodes, each node gradually learns its proper state during the operation of the network. Experimental results have shown that the proposed monitoring algorithm in comparison to other existing methods such as Tian and LUC can better prolong the network lifetime.     

无线传感器网络能量均衡路由算法

设计了一种能量均衡的路由算法.路由的建立分两个阶段,在簇头建立阶段,让候选节点在覆盖范围内以剩余能量的多少和所处位置为标准来竞选簇头,以使簇头分布均匀,平衡网络覆盖;在通信阶段,根据簇头节点的剩余能量大小和其距离基站的远近,采用多跳的簇间通信方式建立路由,以此来降低簇头节点的通信负载.仿真结果表明该算法能够有效降低网络能耗和延长网络生存时间.     

一种基于蚁群算法的WSN能效均衡路由

为了解决无线传感器网络的能耗不均衡问题,提出了一种基于蚁群算法(ACO)的自适应能量均衡路由算法(EBEA).该算法将节点的能量密度融入到启发因子中,利用蚂蚁的动态适应性在全局范围内寻求最优路径让网络达能量均衡的效果.仿真实验结果表明,与LEACH算法相比,该算法能够均衡整个网络的能耗,并有效的避免了网络分割或者"能量空洞"现象,延长网络的生命周期.     

基于能量优化的无线传感器网络安全路由算法

针对无线传感器网络路由面临安全威胁和节点能量有限的不足,提出一种基于能量优化的安全路由算法(EOSR).该算法把优化能量、提高路由安全性和缩短传输时延同时作为设计目标,采用多目标决策,在保证安全性和快速传输的同时,让能量储备较多的节点承担较多的数据转发任务,可获得最优路由和延长网络生命期.通过预置公私密钥对,有效地提高了路由的安全性.给出了该算法中路由发现、路由选择和路由删除的具体步骤,通过仿真实验证明该算法的有效性.