路径优化的无线传感器网络CTP路由算法

针对无线传感器网络普遍存在因负载不均衡导致的转发率过高,网络寿命短的问题,提出了一种基于汇聚树协议(CTP)的路径转发优化协议深度和孩子汇聚树协议(DC-CTP).通过研究节点路径深度和孩子节点个数对当前节点以及对全网络转发数据量的影响,对CTP网络节点的路由算法进行优化.TOSSIM仿真的结果表明:DC-CTP协议选择优化后的路径,将整个网络的节点的数据转发量减少了平均10.25％左右,能够延长无线传感器网络的存活时间.     

一种无线传感器网络MAC协议优化算法

在无线传感器网络中,各节点采集的信息以多跳的方式传送到汇聚点.从各节点到汇聚点形成一棵以汇聚点为根的传输树.文中在对无线传感器网络传输特点分析的基础上,剖析了基于CSMA/CA(载波多路监听/冲突避免)的MAC协议在树状结构无线传感器网络中的弊端,提出了一种基于CSMA/CA的MAC协议优化算法.算法基于节点在传输树中的位置信息调整其MAC信道接入分配,将CSMA/CA采用的各节点均等竞争信道的方法优化为各节点依据在传输树中的位置情况竞争信道的方式,这一优化提高了节点公平性,使MAC信道接入分配与树状结构的无线传感器网络传输特点相契合,解决了基于CSMA/CA的MAC协议与树状结构无线传感器网络不匹配的问题,从而减少了信道资源浪费,提高了网络传输效率,降低了能耗.实验结果表明该算法在网络丢包率、吞吐量和能耗方面的性能均有较大改进.     

基于簇的无线传感器网络密钥管理协议

无线传感器网络密钥管理协议的研究是一个热点问题.针对无线传感器网络体系结构的特征,提出一种基于无线传感器网络簇路由选择协议的集中控制密钥管理协议.将逻辑密钥树协议应用于无线传感器网络中,降低基站节点和普通传感器节点的存储开销和降低普通传感器节点的密钥计算开销,各个簇内采用逻辑密钥树协议作为密钥管理协议,命令控制节点采用Kerberos方法对基站节点实行安全管理.最后对提出的密钥管理协议进行了性能分析.     

无线传感器网络时间同步协议

出了基于层次结构的无线传感器网络时间同步协议。首先以汇聚点为根节点建立一个具有层次结构的树,然后采用成对同步法沿着该树建立一个全网统一的时钟。仿真结果显示该协议能满足无线传感器网络的时间同步要求。     

基于WSN均衡汇聚树的CTP路由算法改进

针对无线传感器网络(WSN)节点能量均衡消耗的需求,提出一种基于均衡汇聚树的路由算法LB-CTP。该算法定义节点均衡度,引入规避繁忙节点接入机制。在路由更新中,相应节点以LB-CTP路由算法选择父节点接入网络,分担繁忙节点负担。基于TinyOS操作系统对 LB-CTP进行实现,通过TOSSIM平台进行仿真实验,结果表明,与CTP算法相比,LB-CTP算法能有效地均衡网络负载。     

基于Steiner树的层次型无线传感器网络安全组播协议

在基于查询的无线传感器网络中,组播技术的应用可大幅减少传感器节点的能量消耗,延长节点寿命.针对大型无线传感器网络组播协议性能不高,且易遭受攻击等问题,提出了基于Steiner树的层次型无线传感器网络安全组播协议.该协议主要运用Steiner树与分簇网络的思想,将Steiner树的高效性与簇的高扩展性相结合,提高了无线传...     

无线传感器网络基于数据汇聚的路由

提出了一种针对无线传感器网络的路由协议,该路由采用最小传输成本生成树的数据汇聚机制。具体方法是首先将传感区域内的传感器节点采集的数据传送给传感区域内离汇聚点最近的节点,将这些数据进行汇聚操作后,将汇聚的结果通过最短路径传递给网络汇聚点。仿真结果显示,采用最小传输代价生成树的路由协议能减少数据传输量50%-80%,并具有较小的传输时延。     

一种新的基于漫游代理的定向路由树算法

分析了以数据为中心的无线传感器网络中的定向扩散路由算法,提出了一种基于随机漫游的具有路由修复agent的定向路由树算法.该算法用泛洪策略构造一棵以汇聚节点为根的定向汇聚树,随后agent以等概率的方式在各个相邻传感器节点之间移动,当agent发现某两节点之间不再相邻时,即采取以该节点为中心的、逐步增加搜索范围的定向汇聚树的层次修复工作.研究表明,该算法具有良好的路由修复功能,同时也能节省能量并延长无线传感器网络的寿命.     

基于生成树的无线传感器网络MAC协议

简要分析了无线传感器网络(W SNs)MAC层协议,针对MAC协议在节能和时延方面的不足,提出了一种基于生成树的MAC协议(ST-MAC)。以汇聚点为根节点,创建一个由网络中所有节点组成的生成树。ST-MAC采用TDMA接入方式,其固有的低工作周期提高了网络性能。性能分析和实验结果表明:相对S-MAC,ST-MAC在能量节省和时延方面有较好的效果。     

基于能量均衡的无线传感器网络组播路由协议

在无线传感器网络实际应用中,组播技术能够较好地满足网络对资源的要求,但由于能量等多方面的因素限制,使得为无线传感器网络设计一个有效的组播路由变得非常困难.针对无线传感器网络中节点的能量限制,提出一种基于能量均衡树的无线传感器网络组播路由(EBTMR)协议,该协议充分考虑到网络中节点的能耗因素和节点的剩余能量,通过对这2个因素的综合考虑,使得具有较多能量的节点担任组播节点来承担更多的传输任务,为数据流优化路由选择,平衡无线传感器网络中节点的能量消耗,以延长网络的生存时间,仿真结果证明了EBTMR是有效的.     

Rendezvous based routing protocol for wireless sensor networks with mobile sink

In wireless sensor networks, the sensor nodes find the route towards the sink to transmit data. Data transmission happens either directly to the sink node or through the intermediate nodes. As the sensor node has limited energy, it is very important to develop efficient routing technique to prolong network life time. In this paper we proposed rendezvous-based routing protocol, which creates a rendezvous region in the middle of the network and constructs a tree within that region. There are two different modes of data transmission in the proposed protocol. In Method 1, the tree is directed towards the sink and the source node transmits the data to the sink via this tree, whereas in Method 2, the sink transmits its location to the tree, and the source node gets the sink’s location from the tree and transmits the data directly to the sink. The proposed protocol is validated through experiment and compared with the existing protocols using some metrics such as packet delivery ratio, energy consumption, end-to-end latency, network life time.     

Post-order based routing & transport protocol for wireless sensor networks

In this paper, we propose a lightweight, application independent transport protocol for communication of the nodes belonging to a wireless sensor network (WSN) with the nodes belonging to a local area network. The framework consists of a novel downstream routing scheme and a well-known tree based upstream routing protocol for WSNs. The downstream routing protocol leverages Post-order Numbering (PN) of sensor nodes in the collection tree network formed and maintained by the upstream routing protocol. Through the proposed transport framework, using a technique similar to NATing, we achieve a seamless integration of WSNs and IP networks. The proposed protocol was not only evaluated by extensive simulations, but also implemented on a real test bed to show its practical deployability. We built our test bed around a small Wireless Distribution System (WDS) consisting of two laptop computers and eight Micaz motes attached with MTS300 sensor boards. We connected one of the computers in WDS via Ethernet to the LAN while the other operated as a server with a serial forwarder. A gateway board was attached to the second computer via a USB port which enabled it to function also as a base station for the WSN. A distinct advantage of the proposed framework is that an IP client can directly communicate with a sensor node through its base station.     

能量高效的传感器网络数据查询路由*

提出一种能量高效的传感器网络数据查询路由EEDQ(energy-efficient data query),EEDQ以sink节点为根节点,构造最小路由生成树,由sink节点发出查询任务,查询结果由叶子节点向sink节点传输,传输过程中进行数据汇聚.实验表明,EEDQ相比direct transmission,大大提高了传感器网络的生命周期.     

LED路灯无线传感网络的智能监控设计

为了实现对LED路灯网络的智能监控,提出LED路灯无线传感网络的解决方案。在以IEEE 802.15.4协议作为物理层和数据链路层协议的基础上,设计一种简易的网络协议。该协议通过采用单跳、双跳以及变跳3种接力通信模式,可以实现对整个路灯网络所有节点快速命令覆盖,也可以对任意节点进行控制与状态数据收集;当网络节点出现故障时,能准确地报告故障节点的相关信息,也能跳过故障节点继续信息的传输。     

移动社会网络中社会性路由算法研究

在无法部署Sink的无线传感器网络中, 数据采集者(即:能够收集数据的人或移动设备)在网络的任意位置收集数据, 即泛在数据收集。网络区域中的节点数量庞大, 能量有限, 如何能有效地采集到全部节点的数据是一个难点。提出一个网络生命周期最大化的泛在数据收集协议MULAC。MULAC以用户所在当前位置为圆心, 半径为r的区域内选择一个节点v。以v为根构造一棵最大化生命周期树T。网络中的节点可以通过T传送数据给v, 数据采集者可以通过v接收到网络中的全部数据。当数据采集者移动到其他位置, T将根据用户新的位置改变根节点, 并且以最小的能量耗费调整树结构, 从而延长全网的寿命。在收集数据过程中保证无线传感器网络生命周期最大化是一个NP完全问题, MULAC能够近似最优的解决此问题。仿真实验和理论分析表明, MULAC能有效延长网络生命周期。     

An energy-efficient data gathering method based on compressive sensing for pervasive sensor networks

This paper proposes an energy-efficient data gathering method called CN-MSTP (Combining Minimum Spanning Tree with Interest Nodes) for pervasive wireless sensor networks, basing on Compressive sensing (CS) and data aggregation. The proposed CN-MSTP protocol selects different nodes at random as projection nodes, and sets each projection node as a root to construct a minimum spanning tree by combining with interest nodes. Projection node aggregates sensor reading from sensor nodes using compressive sensing. We extend our method by letting the sink node participate in the process of building a minimum tree and introduce eCN-MSTP. We compare our methods with the other methods. Simulation results indicate that our two methods outperform the other methods in overall energy consumption saving and load balance and hence prolong the lifetime of the network.     

SEEM: Secure and energy-efficient multipath routing protocol for wireless sensor networks

A Wireless Sensor Network (WSN) is a collection of wireless sensor nodes forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, due to the limited range of each node’s wireless transmissions, it may be necessary for one sensor node to ask for the aid of other sensor nodes in forwarding a packet to its destination, usually the base station. One important issue when designing wireless sensor network is the routing protocol that makes the best use of the severely limited resource presented by WSN, especially the energy limitation. Another import factor required attention from researchers is providing as much security to the application as possible. The proposed routing protocols in the literature focus either only on increasing lifetime of network or only on addressing security issues while consuming much power. None of them combine solutions to the two challenges. In this paper, we propose a new routing protocol called SEEM: Secure and Energy-Efficient multipath Routing protocol. SEEM uses multipath alternately as the path for communicating between two nodes thus prolongs the lifetime of the network. On the other hand, SEEM is effectively resistive to some specific attacks that have the character of pulling all traffic through the malicious nodes by advertising an attractive route to the destination. The performance of our protocol is compared to the Directed Diffusion protocol. Simulation results show that our protocol surpasses the Directed Diffusion protocol in terms of throughput, control overhead and network lifetime.     

稀疏水下传感网中AUV数据移动收集技术研究

由于水下传感器节点的水声通信距离有限、价格昂贵,水下传感器网络中一般采用稀疏方式部署,因此很难保证整体网络的连通性及数据采集效率。自主水下航行器AUV（Autonomous Underwater Vehicle）作为天然的移动数据采集平台,可以弥补固定Sink节点数据采集方式的缺陷。提出了一种基于移动AUV的水下传感网移动数据收集机制。以AUV覆盖区域内的传感器节点作为临时Sink节点,其他传感器节点以临时Sink节点为根节点,采用最小生成树MST（Minimum Spanning Tree）方法将传感数据传输到这些临时Sink节点,然后通过临时Sink节点将汇聚数据传输给AUV。随着AUV的自主移动轨迹,水下传感网的传感数据都能简单高效地被收集起来。仿真结果验证了该方法在保证网络能耗的前提下提高了数据采集效率。     

一种改进的分簇路由算法

多跳分簇低功耗路由协议(MHLeach,Multi-Hop Low Energy Adaptive Clustering Hierarchy)是一种用于数据汇聚的路由协议,它为传感器节点提供一种自组织、自适应的分簇组网方法。MHLeach将网络分割成若干个小簇,使簇内传感器节点按星型拓扑方式汇聚消息到簇首,而把簇间的簇首连接成具有多个分支的树形网络来组网。为提高MHLeach的可靠传输能力,本文提出基于链路质量估计的能量均衡路由协议ELQECHE,ELQECHE协议讨论链路质量对传输可靠性的影响,它将簇首间的链路质量作为一个重要指标,根据该链路质量来评估网络传输可靠性的高低,最后从邻居中选出传输可靠性较高的簇首作为转发节点。