无线传感器网络路由分簇协议研究

无线传感器网络与传统网络的特点不同,且与人们日常生活应用息息相关。无线传感器网络不能利用传统的路由协议,网络层的路由技术在无线传感器网络体系结构中非常重要。数据融合简单、拓扑管理方便、能量利用高效是分簇路由具有的优点,是当前研究非常热门的路由技术。文章分析了无线传感器网络分簇路由概念,着重对无线传感网络路由分簇协议的分类和协议系统进行分析,为路由无线传感器网络路由分簇协议的进一步研究提供参考。     

基于内容的无线传感器网络路由协议

针对无线传感器网络环境下低功耗路由问题,根据无线传感器网络是一种以数据为中心的网络的特点,提出了一种基于内容的低功耗路由协议CBP。其基本思想是:Sink节点根据上层应用构造谓词,并对谓词进行广播,网络中所有传感节点以Sink节点的谓词为依据建立路由表,实现数据路由。与现有无线传感器网络路由协议相比较,此路由协议具有低功耗,占用节点资源少,网络容错能力强等特点。仿真结果表明,在节点数量大于100的大规模网络中,基于内容的无线传感器网络路由协议功耗比定向扩散协议功耗降低19%。     

一种新型安全路由协议——势能导向多下一跳路由协议

路由协议是网络的核心控制协议,通过路由协议增强网络可用性和安全性显得尤为重要。在研究网络路由协议及其安全机制的基础上,充分考虑网络路由过程的动态可用性和节点可信度,在路由机制中首次定义了寻路和可信势能,并设计实现了基于节点势能导向的多下一跳路由协议,很好地解决了目前互联网中突发事件易引起网络拥塞和不安全节点对用户信息安全的隐患,对加强网络抗毁性、保障用户信息安全具有重要价值。     

面向路径的无线多跳网络端-端吞吐量分析

基于802.11 DCF机制的无线多跳网络性能深受MAC层的介质访问机制和上层路由机制相互作用的影响.本文面向自组织网络路径,给出了端-端最优吞吐量的模型以及计算其上下界的方法.本文的研究更加注重无线多跳网络的实际特性:分组调度可以任意方式调度,节点的载波侦听范围大于其传输范围.研究发现路径的端到端吞吐量与路径长度、分组发送速率和分组调度策略等因素密切相关.本文还分析了其他因素对端-端带宽的影响程度.本文从面向路径的分析模拟工作中得出的一些独特结论相信将有助于上层应用程序以及路由协议的研究.     

基于无线传感器网络的海水检测系统设计

针对海水检测恶劣环境提出了使用无线传感器网络的海水指标实时在线检测方案;探讨了传感器网络节能路由协议;实现了系统硬件与软件设计.系统将无线检测传感器布置于所检测水域,利用远程无线分组服务数据通信技术远程传输检测数据,通过因特网显示平台的检测点管理查询技术,全面提升了系统的自动化与检测水平.模拟实验结果表明该系统可以实现远程控制中心和监测控制节点的可靠、高速率的通讯.系统体积小、成本低,适用于现场海水污染程度连续检测.     

基于地理位置的无线传感器网络路由协议

基于地理位置的路由协议是无线传感器网络路由协议研究的一个重要方向。利用位置信息指导路由的发现、维护和数据转发,能够优化路径选择,减少路由能耗,实现网络的全局优化。从限制洪泛机制、虚拟分区机制、最优路由确认机制3个方面,可以看出地理位置信息在路由协议中的重要性。     

基于限制广播域和节点剩余能量的按需路由算法研究

按需路由协议AODV的路由发现使用洪泛方式的扩散法,导致网络超负荷运行和拥塞,而且在选择转发路由时,总是选择最少跳数的路由,造成无线传感网络中节点能量不均,减少网络寿命.本文提出了AODV-DE算法,该算法引入广播域的概念,限制RREQ分组的转发范围,同时避免使用剩余能量低的节点转发数据分组,选择路由路径时选择总剩余能量最多的路径进行信息的传送.仿真结果表明,AODV-DE协议在路由开销、网络寿命和端到端的延迟这三个方面表现出了优势.     

无线传感器网络攻击与安全路由协议综述

随着科学技术的日益进步,无线传感器网络发展受到了人们的广泛关注.但与传统网络相比,无线传感器网络与其在各个方面都存在很大的不同.现存的传统路由协议并不能有效地用于无线传感器网络的传输过程中.因此,相关技术人员开始着眼于研究和开发了各种无线传感器网络路由协议.目前,无线传感器网络已广泛应用在生活中各个领域,而在各种应用中,其承担的主要的作用就是收集数据,因此如何保障数据的安全性就变得尤为重要.本文就将对当前无限传感器网络受到的攻击以及安全路由协议进行简要的介绍.     

无线传感器网络中基于协同的机会路由

提出了一种适用于无线传感器网络的基于协同的机会路由协议,协议在结合区域路由、会聚机制和睡眠机制的基础上,使用跨层的方法对无线传感器网络的路由协议进行改进,以增强网络连接随机变化条件下路由协议的顽健性,并以能量有效的方式提高了数据的转发速度.仿真结果表明,在不同节点密度条件下,基于协同的机会路由在数据转发能效方面比非协同的机会路由有很大的提高.     

体育场馆中的无线地下传感器网络研究

构建体育场馆的无线地下传感器网络,保障智能控制场馆的温度和光电,实现构建智慧体育场馆,提出基于层级和位置的体育场馆无线地下传感器网络地理路由决策机制。首先构建无线地下传感器网络的拓扑结构模型,采用基于层级的定向泛洪机制进行路由协议构建;然后根据节点的层级、密度和剩余能量进行无线地下传感器网络的节点优化部署,根据网络的层级和地下地理位置实现路由探测设计;最后通过仿真实验进行性能测试。实验结果表明,该体育场馆无线地下传感器网络具有较好的能耗均衡性,网络节点端到端的时延较低,数据包的准确传输率较高。     

Routing Optimization in IP Networks Utilizing Additive and Concave Link Metrics

Routing optimization provides network operators with a powerful method for traffic engineering. Its general objective is to distribute traffic flows evenly across available network resources in order to avoid network congestion and quality of service degradation. In this paper we consider routing optimization based on conventional routing protocols where packets are forwarded hop-by-hop in a destination-based manner. Unlike other work in this area, we consider routing protocols, which are able to take into account concave routing metrics in addition to additive ones. The concave link metric introduces an additional degree of freedom for routing optimization, thus, increasing its optimization potential. We present and evaluate a mixed-integer programming model, which works on these metrics. This model unifies the optimization for single-metric and dual-metric routing concepts and also includes the consideration of multipath routing. Furthermore, we propose a heuristic algorithm usable for larger network instances. Numerical results indicate that employment of both the dual-metric concept and multipath routing can achieve considerably better utilization results than default-configured single-metric routing. A significant finding is that metric-based routing optimization with two link metrics often comes close to the results obtainable by optimization of arbitrarily configurable routing.     

A Novel Energy Efficient and Lifetime Maximization Routing Protocol in Wireless Sensor Networks

The energy consumption is a key design criterion for the routing protocols in wireless sensor networks (WSN). Some of the conventional single path routing schemes may not be optimal to maximize the network lifetime and connectivity. Thus, multipath routing schemes is an optimal alternative to extend the lifetime of WSN. Multipath routing schemes distribute the traffic across multiple paths instead of routing all the traffic along a single path. In this paper, we propose a multipath Energy-Efficient data Routing Protocol for wireless sensor networks (EERP). The latter keeps a set of good paths and chooses one based on the node state and the cost function of this path. In EERP, each node has a number of neighbours through which it can route packets to the base station. A node bases its routing decision on two metrics: state and cost function. It searches its Neighbours Information Table for all its neighbours concerned with minimum cost function. Simulation results show that our EERP protocol minimizes and balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime.     

A Cross-Layer Channel Access and Routing Protocol for Medical-Grade QoS Support in Wireless Sensor Networks

One of principal design issues of a Wireless Sensor Network (WSN) for medical information systems is to classify received packets based on their priorities and guarantees so that they can be transmitted reliably, thus satisfying QoS requirements. In addition, when the target WSN requires multi-hop communications and the traffic load increases significantly, it is challenging to support both load balancing and suitable QoS at the same time. In this paper, we propose a new reliable protocol termed Cross-layer Channel Access and Routing (CCAR), which simultaneously supports both MAC and routing operations for medical-grade QoS provisions. CCAR initially determines the routing path with the lowest traffic load and low latency using newly defined channel quality factors. Concurrently, the source node allocates the predefined QoS Access Category to each packet and reserves the channel along the route. In addition, CCAR introduces an effective route maintenance scheme to avoid link failures in bottlenecked intermediate nodes, which prevents unnecessary packet drops and route rediscovery evocations. Finally, through both simulation studies and real test-bed experiments, we evaluate the performance of CCAR by comparing it with other conventional protocols, demonstrating that the proposed protocol can more efficiently support medical-grade QoS packets, especially when the network is heavily loaded.     

A hybrid approach for the optimization of quality of service metrics of WSN

The core objective behind this research paper is to implement a hybrid optimization technique along with proactive routing algorithm to enhance the network lifetime of wireless sensor networks (WSN). The combination of two soft computing techniques viz. genetic algorithm (GA) and bacteria foraging optimization (BFO) techniques are applied individually on destination sequence distance vector (DSDV) routing protocol and after that the hybridization of GA and BFO is applied on the same routing protocol. The various simulation parameters used in the research are: throughput, end to end delay, congestion, packet delivery ratio, bit error rate and routing overhead. The bits are processed at a data rate of 512 bytes/s. The packet size for data transmission is 100 bytes. The data transmission time taken by the packets is 200 s i.e. the simulation time for each simulation scenario. Network is composed of 60 nodes. Simulation results clearly demonstrates that the hybrid approach along with DSDV outperforms over ordinary DSDV routing protocol and it is best suitable under smaller size of WSN.

     

Energy Efficient Reliable Multi-path Data Transmission in WSN for Healthcare Application

In healthcare applications of WSN, the data loss due to congestion may cause death alarm for a patient in critical condition. Therefore, an efficient congestion avoidance or otherwise an efficient congestion control mechanism is required. In this paper, we present an energy efficient reliable multi-path data transmission protocol for reliable data transport over WSN for the health care application. The emergency data and sensitive data packets are transmitted through an alternate path having minimum correlation with transmission interference during congestion. The proposed protocol attempts to avoid congestion by computing the probability of congestion at the intermediate nodes and transmission rate at the intermediate node is adjusted. The buffer of each node is partitioned to support fair and efficient data delivery. The reliability of the proposed protocol is achieved through hop-by-hop loss recovery and acknowledgement. The performance of the proposed protocol is evaluated through extensive simulations. The simulation results reveal that it outperforms the existing congestion control protocols for healthcare application in terms of energy efficiency, reliability and end-to-end delivery ratio.     

Optimized Congestion Management Protocol for Healthcare Wireless Sensor Networks

The application of Wireless Sensor Networks (WSNs) in healthcare is dominant and fast growing. In healthcare WSN applications (HWSNs) such as medical emergencies, the network may encounter an unpredictable load which leads to congestion. Congestion problem which is common in any data network including WSN, leads to packet loss, increasing end-to-end delay and excessive energy consumption due to retransmission. In modern wireless biomedical sensor networks, increasing these two parameters for the packets that carry EKG signals may even result in the death of the patient. Furthermore, when congestion occurs, because of the packet loss, packet retransmission increases accordingly. The retransmission directly affects the lifetime of the nodes. In this paper, an Optimized Congestion management protocol is proposed for HWSNs when the patients are stationary. This protocol consists of two stages. In the first stage, a novel Active Queue Management (AQM) scheme is proposed to avoid congestion and provide quality of service (QoS). This scheme uses separate virtual queues on a single physical queue to store the input packets from each child node based on importance and priority of the source’s traffic. If the incoming packet is accepted, in the second stage, three mechanisms are used to control congestion. The proposed protocol detects congestion by a three-state machine and virtual queue status; it adjusts the child’s sending rate by an optimization function. We compare our proposed protocol with CCF, PCCP and backpressure algorithms using the OPNET simulator. Simulation results show that the proposed protocol is more efficient than CCF, PCCP and backpressure algorithms in terms of packet loss, energy efficiency, end-to-end delay and fairness.     

A hybrid beaconless geographic routing for different packets in WSN

The localized operation and stateless features of geographic routing make it become an attractive routing scheme for wireless sensor network (WSN). In this paper, we proposed a novel routing protocol, hybrid beaconless geographic routing (HBGR), which provides different mechanisms for different packets. Based on the requirement of application on latency, we divide the packets of WSN into delay sensitive packets and normal packets. HBGR uses two kinds of Request-To-Send/Clear-To-Send handshaking mechanisms for delay sensitive packets and normal packets, and assigns them different priority to obtain the channel. The simplified analysis is given, which proves that delay sensitive packets have lower latency and higher priority to obtain the channel than normal packets. Moreover, forwarding area division scheme is proposed to optimize the forwarder selection. Simulation results show that HBGR achieves higher packet delivery ratio, lower End-to-End latency and lower energy consumption than existing protocols under different packet generation rates in stationary and mobility scenario. Besides, compared with normal packets, delay sensitive packets have at least 10 % (9 %) improvement in terms of End-to-End latency. The improvement increases with the increasing of packet generation rate, and achieves 58 % (73 %) when the packet generation rate is 24 packets per second in stationary (mobility) scenario.     

基于分簇的无线传感器网络通信协议LEACH研究

针对于直接传输（DT,DirectTransmission）和最小化传输能量（MTE,MinimumTransmissionEnergy）两种传统通信协议的缺点和无线传感器网络（WSNs,WirelessSensorNetworks）的特点,分析了基于分簇的无线传感器网络通信的低功耗自适应分簇协议（LEACH,Low—EnergyAdaptiveCluste—ringHierarchy）的基本原理,并对三者进行仿真分析。分析与仿真结果表明,使用LEACH协议比使用DT协议要节约大约7到8倍的能源,同时也比MTE协议方式要减少4到8倍能源消耗。更适用于无线传感器网络。     

一种基于路径信息的WSN路由协议

AODV是一种广泛应用于MANET的按需路由协议,但是它并不完全适用于WSN。本文通过改进AODV协议基于洪泛的路由机制,提出了一种适用于WSN的低开销、低时延的路由协议IAODV。仿真结果表明:与AODV协议相比,IAODV协议可以在保持较高的分组投递率的同时有效降低数据分组的平均端到端时延和路由开销,达到了低开销、低时延的设计目标。     

Fair data collection in wireless sensor networks: analysis and protocol

In general, wireless sensor networks (WSNs) consist of many sensors which transmit data to a central node, called the sink, possibly over multiple hops. This many-to-one data routing paradigm leads to nonuniform traffic distribution for the different sensors (e.g., nodes closer to the sink transfer more traffic than those farther away). In this paper, we perform an analysis of the fairness issue by presenting a tree-based WSN and derive the throughput, delay, and energy distribution for each sensor under the fairness constraint. Based on the analysis, we design our fair data collection protocol in which each node decides its media access and packet forwarding strategies in a distributed manner. Finally, we demonstrate the effectiveness of our solution through simulations. The results for the proposed protocol show the accuracy of the analysis and show that the protocol ensures the fair delivery of packets and reduces end-to-end delay. Based on the analysis, we also quantitatively determine the energy required for each of the nodes and show that a nonuniform energy distribution can maximize the network lifetime for the WSN scenario under study.