无线传感器网络路由协议专利分析

无线传感器网络(WSN)的路由算法决定了整个网络的生命周期,因此网络路由在WSN中起着至关重要的作用。专利是能够反映科学技术发展水平最新动态的情报文献,本文结合专利申请情况介绍了WSN路由的概述及常见研究方向,然后从国际专利申请量和国内申请量两方面,对无线传感器分层路由协议的专利申请情况进行了统计分析,并对WSN路由协议的发展趋势进行了简要分析。

基于无线传感器网络的路由协议的研究

本文介绍了无线传感器路由协议的特点和分类,在此基础上着重对几种典型的路由协议进行了分析和比较。

梯度相关的无线传感器网络成簇路由协议

分析了梯度和成簇无线传感器网络路由协议,确定了协议中存在的缺陷,设计了一种基于梯度的高效节能成簇路由协议(GBCRP)。采用基于跳数的梯度建立、能量相关的成簇算法、关键节点转发和功率自适应的簇头路由等技术,解决了无线传感器网络的节点能耗和路由失败而导致的数据传输可靠性问题。仿真实验表明,该协议有效地延长了网络的生命周期。针对不同密度的传感器节点,网络生命周期具有很好的稳定性,同时该协议也具有较好的可靠性保障。

无线传感器网络拓扑控制分析

无线传感器网络的拓扑控制对网络的性能有很大影响。拓扑控制的目标是用最小的能量维持网络拓扑。目前,对拓扑控制算法的研究主要分为集中式和分布式两种。文章简要介绍了无线传感器网络中拓扑控制研究的意义,总结了无线传感器网络的拓扑结构及现有的一些拓扑控制算法,最后探讨了存在的问题和今后的发展方向。

区间值犹豫模糊多属性决策方法在WSN路由安全评估中的应用

无线传感器网络,作为一种可以进行信息收集、处理、发送的集成网络,将现实世界与信息世界相连,极大地改变了人与自然的交流途径。无线传感器网络具有广泛潜在的应用领域,如工业,农业,军事,环境监测,生物医学,城市管理和灾难救助等。具有区间值犹豫模糊信息的无线传感器网络路由安全性评估问题,需要多属性决策来解决。在本文中,通过引入区间值犹豫模糊信息扩展了ELECTRE方法,提出改进的ELECTRE方法来解决多属性决策问题。最后给出了评估无线传感器网络路由安全性的实例,证明了所提供方法的实用性和有效性。

平面路由协议改进策略

本文研究无线传感器网络的网络技术和无线传感器网络路由协议,重点分析了无线传感器网络路由协议的分类、特点、设计目标、性能和影响因素,对现有的几种典型的路由协议进行分析、总结和比较。并提出了一种改进的路由协议。

k跳受限泛洪的能量平衡组播路由算法

组播路由算法(Energy-Balanced Multicast Routing,EBMR)把无线传感器网络节点的剩余能量作为建立组播路由的重要因子,在不引入过长路径的同时优先选择剩余能量高的节点作为组播数据转发节点,构建组播能量平衡树(EB-Tree),从网络能量均衡消耗的角度来延长了无线传感器网络的生存时间。针对EBMR算法路由开销较大的问题,提出了k跳受限泛洪的能量平衡组播路由算法k-EBMR,控制组播路由报文在k跳范围内传播,并且研究了影响算法性能的关键因子的选取。仿真实验表明,与EBMR算法相比,k-EBMR算法较大程度上降低了路由控制报文的传输,提高了节点能量有效使用性,进一步延长了网络生存时间。

SI-INSPIRED ENERGY AWARE QoS ROUTING TREE FOR WSN

A heuristic theoretical optimal routing algorithm （TORA） is presented to achieve the data-gathering structure of location-aided quality of service （QoS） in wireless sensor networks （WSNs）. The construction of TORA is based on a kind of swarm intelligence （SI） mechanism, i. e. , ant colony optimization. Firstly, the ener- gy-efficient weight is designed based on flow distribution to divide WSNs into different functional regions, so the routing selection can self-adapt asymmetric power configurations with lower latency. Then, the designs of the novel heuristic factor and the pheromone updating rule can endow ant-like agents with the ability of detecting the local networks energy status and approaching the theoretical optimal tree, thus improving the adaptability and en- ergy-efficiency in route building. Simulation results show that compared with some classic routing algorithms, TORA can further minimize the total communication energy cost and enhance the QoS performance with low-de- lay effect under the data-gathering condition.

Real-time Threshold Routing Algorithm Based on Wireless Sensor Network

[Objective] This study was to design an intelligent greenhouse real-time monitoring system based on the core technology of Internet of Things in order to meet the needs of agricultural informatization and intellectualization. [Method] Based on the application characteristics of Wireless Sensor Network （WSN）, the intelligent greenhouse monitoring system was designed. And for the incompleteness strategy of load balancing in the Low-Energy Adaptive Clustering Hierarchy （LEACH）, a Real- time Threshold Routing Algorithm （RTRA） was proposed. [Result] The performance of network lifetime and network delay of RTRA were tested in MATLAB and found that, within the same testing environment, RTRA can save nodes energy consumption, prolong network lifetime, and had better real-time performance than LEACH. The al- gorithm satisfies the crops＇ requirements on real-time and energy efficiency in the greenhouse system. [Conclusion] For the good performance on real-time, the de- signed intelligent greenhouse real-time monitoring system laid the foundation for the research and development of agricultural informatization and intellectualization.

Multiple k-hop clusters based routing scheme to preserve source-location privacy in WSNs

Privacy is becoming one of the most notable challenges threatening wireless sensor networks(WSNs).Adversaries may use RF(radio frequency) localization techniques to perform hop-by-hop trace back to the source sensor's location.A multiple k-hop clusters based routing strategy(MHCR) is proposed to preserve source-location privacy as well as enhance energy efficiency for WSNs.Owing to the inherent characteristics of intra-cluster data aggregation,each sensor of the interference clusters is able to act as a fake source to confuse the adversary.Moreover,dummy traffic could be filtered efficiently by the cluster heads during the data aggregation,ensuring no energy consumption be burdened in the hotspot of the network.Through careful analysis and calculation on the distribution and the number of interference clusters,energy efficiency is significantly enhanced without reducing the network lifetime.Finally,the security and delay performance of MHCR scheme are theoretically analyzed.Extensive analysis and simulation results demonstrate that MHCR scheme can improve both the location privacy security and energy efficiency markedly,especially in large-scale WSNs.

G-MER： Green Mobility Estimation- Based Routing Protocol in Wireless Sensor Network

As a core technology of Intemet of Things （loT）, Wireless Sensor Network （WSN） has become a research hotspot recently. More and more WSNs are being deployed in highly mobile environments. The fast moving sensor nodes bring significant challenges for the routing decision. In this paper, we propose an efficient logical location method, and designe a mobility estimating metric and derive a novel Green Mobility Estirmtion- based Routing protocol （G-MER） for WSNs. We also set up a full framework to evaluate its per- formance. Simulation results illustrate that G-MER achieves a fairly better perforrmnce in terrm of broadcast times and link failures than AODV. What＇s more, it decreases the mean hops by about 0.25 and reduces energy consumption by about 10% during the whole experiment. All the results show that G-MER can be effectively used in fast- moving and limited resource scenarios.

An energy efficiency clustering routing protocol for WSNs in confined area

Wireless sensor networks (WSNs) are important application for safety monitoring in underground coal mines, which are difficult to monitor due to natural conditions. Based on the characteristic of limited energy for WSNs in confined underground area such as coal face and laneway, we presents an energy- efficient clustering routing protocol based on weight (ECRPW) to prolong the lifetime of networks. ECRPW takes into consideration the nodes' residual energy during the election process of cluster heads. The constraint of distance threshold is used to optimize cluster scheme. Furthermore, the protocol also sets up a routing tree based on cluster heads' weight. The results show that ECRPW had better perfor- mance in energy consumption, death ratio of node and network lifetime.

A routing and positioning algorithm based on a K-barrier for use in an underground wireless sensor network

Deployment of nodes based on K-barrier coverage in an underground wireless sensor network is described. The network has automatic routing recovery by using a basic information table (BIT) for each node. An RSSI positioning algorithm based on a path loss model in the coal mine is used to calculate the path loss in real time within the actual lane way environment. Simulation results show that the packet loss can be controlled to less than 15% by the routing recovery algorithm under special recovery circum- stances. The location precision is within 5 m, which greatly enhances performance compared to tradi- tional frequency location systems. This approach can meet the needs for accurate location underground.

Multi-Gradient Routing Protocol for Wireless Sensor Networks

Sensor networks tend to support different traffic patterns since more and more emerging applications have diverse needs. We present MGRP, a Multi-Gradient Routing Protocol for wireless sensor networks, which is fully distributed and efficiently supports endto-end, one-to-many and many-to-one traffic patterns by effectively construct and maintain a gradient vector for each node. We further combine neighbor link estimation with routing information to reduce packet exchange on network dynamics and node failures. We have implemented MGRP on Tiny OS and evaluated its performance on real-world testbeds. The result shows MGRP achieves lower end-to-end packet delay in different traffic patterns compared to the state of the art routing protocols while still remains high packet delivery ratio.

Energy optimal routing for long chain-type wireless sensor networks in underground mines

Wireless sensor networks are useful complements to existing monitoring systems in underground mines. They play an important role of enhancing and improving coverage and flexibility of safety monitoring systems.Regions prone to danger and environments after disasters in underground mines require saving and balancing energy consumption of nodes to prolong the lifespan of networks.Based on the structure of a tunnel,we present a Long Chain-type Wireless Sensor Network（LC-WSN）to monitor the safety of underground mine tunnels.We define the optimal transmission distance and the range of the key region and present an Energy Optimal Routing（EOR）algorithm for LC-WSN to balance the energy consumption of nodes and maximize the lifespan of networks.EOR constructs routing paths based on an optimal transmission distance and uses an energy balancing strategy in the key region.Simulation results show that the EOR algorithm extends the lifespan of a network,balances the energy consumption of nodes in the key region and effectively limits the length of routing paths,compared with similar algorithms.

Enabling Energy Efficient Sensory Data Collection Using Multiple Mobile Sink

Mobile sink is the challenging task for wireless sensor networks(WSNs).In this paper we propose to design an efficient routing protocol for single mobile sink and multiple mobile sink for data gathering in WSN.In this process,a biased random walk method is used to determine the next position of the sink.Then,a rendezvous point selection with splitting tree technique is used to find the optimal data transmission path.If the sink moves within the range of the rendezvous point,it receives the gathered data and if moved out,it selects a relay node from its neighbours to relay packets from rendezvous point to the sink.Proposed algorithm reduces the signal overhead and improves the triangular routing problem.Here the sink acts as a vehicle and collect the data from the sensor.The results show that the proposed model effectively supports sink mobility with low overhead and delay when compared with Intelligent Agent-based Routing protocol(IAR) and also increases the reliability and delivery ratio when the number of sources increases.

Ant-Colony Based Routing Algorithm in Wireless Sensor Networks

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Antcolony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.

A clustered routing protocol based on energy and link quality in WSNs

Influenced by the environment and nodes status,the quality of link is not always stable in actual wireless sensor networks( WSNs). Poor links result in retransmissions and more energy consumption. So link quality is an important issue in the design of routing protocol which is not considered in most traditional clustered routing protocols. A based on energy and link quality's routing protocol( EQRP) is proposed to optimize the clustering mechanism which takes into account energy balance and link quality factors. EQRP takes the advantage of high quality links to increase success rate of single communication and reduce the cost of communication. Simulation shows that,compared with traditional clustered protocol,EQRP can perform 40% better,in terms of life cycle of the whole network.