基于休眠和扇区的传感器网络拓扑控制算法

拓扑控制算法对节省无线传感器网络节点能量、延长网络寿命具有重要意义。无线传感器网络节省节点能量有两种方法：层次型拓扑结构控制和功率控制；但目前还没有算法将以上两种方法相结合。丈中是结合周期性休眠和拓扑控制的一种新型拓扑控制策略：基于休眠和扇区的无线传感器网络拓扑控制算法，将拓扑控制算法和节点的休眠结合起来。仿真结果表明：算法在不降低网络吞吐量条件下节省了网络能量消耗，有效延长网络寿命。     

ZigBee网络中Cluster-Tree拓扑的改进与优化

无线传感器网络(WSN)是一种具有感测、计算和传输能力的小型传感器节点的集合。由于单个传感器节点的功能有限,特别是能量的存储和数据的存储,所以需要制定良好的网络拓扑结构和路由协议。文中重点研究基于IEEE 802.15.4标准的Zig Bee无线传感器网络,提出基于最小生成树(MST)的高效聚类拓扑结构MSCT,最终的目的在于以最小的成本构建一个网络拓扑结构。文中的拓扑结构还考虑了室内环境,提出了处理墙壁和障碍物导致的路径损耗和信号衰减的度量,并计算节点之间的链接的权重。最后,通过能量的损耗和网络的寿命来论证文中提出的MSCT拓扑结构比Cluster-Tree拓扑结构更具有优势性。     

泛在互联车辆传感器网络体系结构研究

针对车辆传感器网络的特点,提出一种基于分簇定向扩散与智能路由的泛在互联车辆传感器网络体系结构。该体系结构充分利用车辆传感器网络节点的多途径联网功能以及自组网能力．利用分簇定向扩散机制形成无线自组网与传统网络相结合的混合逻辑拓扑结构HLT—C＆DD,通过节点的智能路由功能为网络中的数据汇聚提供智能分流途径。理论分析和仿真结果表明,该体系结构能提高泛在互联车辆传感器网络的综合性能。     

无线传感器网络节点节能管理方式的研究

无线传感器网络节点数量众多、自身携带的能量十分有限。为了延长网络的生命周期,需采用有效的策略降低能耗。在研究无线传感器网络节点组成结构、能量消耗以及节点间传播方式的基础上,提出一种为有效地达到节能目的所采用的节点管理方式。该方案采用动态选择簇头节点的自组织、多跳路由、层次式拓扑组织结构的路由协议、快速的数据融合技术,并在实现硬件的低功耗设计的条件下进行动态功耗管理。     

一种非对称耦合无线传感器网络同步控制模型

无线传感器网络作为一种复杂网络,具有节点众多、拓扑时变等特点。研究传感器网络中的同步问题对于利用节点众多这一特点,实现MIMO协作信息传输、混沌保密通信等应用有着重要的意义。现有对于网络同步的研究大都集中于研究规则网络模型。然而对于无线传感器网络来说,由于无线信道的固有时变特性以及无线传感器网络节点易失效等原因造成了网络拓扑动态变化,从而给传感器网络同步问题的数学建模和分析造成了很大的困难。本文工作受到Belkh[1]工作的启发,提出一种非对称耦合传感器网络同步控制模型。该模型避开了讨论研究具体的网络拓扑结构下的网络同步问题,代之以从控制的角度研究如何改善网络同步性能。理论分析和实验结果表明该模型能够显著提高网络同步化性能。      

基才ZigBee协议栈的无线传感器网络的设计

首先介绍了无线传感器网络的基本拓扑结构与传感器节点的结构,详细说明了基于ZigBee协议栈的无线传感网络的建立过程,包括协调器启动及建立网络、传感器节点启动及加入网络、传感器节点与协调器之间建立绑定以及传感器节点向协调器发送数据的过程。设计了基于ZigBee协议栈的无线传感网络系统。以采集温度信息为例,协调器能够接收到传感器节点发来的数据,并能通过RS232串口,将收到的数据发送给PC机进行显示。实验显示在距离80m远处,系统仍能保持良好的通信质量。     

基于等概率路由模型的传感器网络负载均衡研究

无线传感器网络的能耗效率与流量负载分布密切相关。论文从微观角度研究了无线传感器网络的负载均衡问题。基于等概率路由模型,分析了拓扑传输结构对于感知数据流量的分流作用。根据分析结果,提出了多对一传输模式下任意节点负载密度的定义和算法。分析了节点的负载密度与传感器网络生命期的关系,进一步论证了在多对一的多跳传感器网络中不能实现完全的负载均衡,但是通过设计合理的拓扑结构可以实现准负载均衡。仿真结果说明,从微观角度得到的节点负载密度可以准确描述无线传感器网络的流量负载分布,由此得到的准负载均衡条件也能实现绝大多数节点的负载均衡。     

基于元胞自动机的无线传感器网节能路由协议

节能是设计无线传感器网路由协议首先要解决的问题.针对无线传感器网拓扑演化过程所呈现的时空动力学特性,基于源自生物学的元胞自动机理论,提出无线传感器网节能路由协议(AODV-ECA).仿真结果及分析表明,该算法能有效减少传感节点能量消耗,延长无线传感器网生存时间.     

无线传感器网络中的最优感知节点分布及分布优化算法

无线传感器网络中，感知节点的合理分布以及网络拓扑的动态调整对于更加有效地进行信息收集以及提高网络的生存期限都具有重要的作用。为此，针对传感器网络的初始规划提出了一种基于遗传算法的最优分布。仿真结果表明，算法能够针对特定的目标区域获得较好的节点分布。在最佳分布的基础上，结合传感器网络的拓扑管理和节点定位，引入了一种有效的传感器网络拓扑和节点分布优化方法，为传感器网络的拓扑性能管理提供了有效的算法保证。     

无线传感器网络关键技术及特点研究

文章阐述了无线传感器网络中的无线传感器节点结构、无线传感网网络的结构,从定位技术、安全技术、能量控制、数据融合、网络协议、时间同步技术与网络拓扑控制7个方面论述了无线传感器网络的关键技术,并分析了无线传感器网络的特点。     

一种基于Zigbee的无线传感器网络教学实验系统

本文首先简要介绍无线传感器网络的体系结构，然后给出一个基于IEEE802．15．4和Zigbee协议的无线传感器网络教学实验系统。该系统中的多个传感器节点可以组成多种不同的拓扑结构，并可以将采集到的数据通过GSM网络发送到用户终端，用户也可以通过GSM网络对远程传感器节点进行控制。该教学实验系统已被许多院校采用，亦可直接应用于其他领域。     

基于无线传感器网络的仓库智能安保系统设计

将无线传感器网络技术用于智能仓库安保系统。针对无线传感器网络技术和智能仓库安保系统的特点。设计了基于无线传感器网络的智能仓库安保系统的一整套系统和网络节点。该系统体现了无线传感器网络的特点。利用计算机处理信息,根据处理结果作出相应反应、处理。实验表明,该系统使用方便、稳定可靠。     

Cross‐layer technique for boosting base‐station anonymity in wireless sensor networks

A wireless sensor network (WSN) principally is composed of many sensor nodes and a single in situ base station (BS), which are randomly distributed in a given area of interest. These sensor nodes transmit their measurements to the BS over multihop wireless paths. In addition to collecting and processing the sensed data, the BS performs network management operations. Because of the importance of the BS to the WSN, it is the most attractive target of attacks for an adversary. Basically, the adversary opts to locate the BS and target it with denial‐of‐service attack to temporarily or indefinitely disrupt the WSN operation. The adversary can intercept the data packet transmissions and use traffic analysis techniques such as evidence theory to uncover the routing topology. To counter such an attack, this paper presents a novel technique for boosting the BS anonymity by grouping nodes into clusters and creating multiple mesh‐based routing topologies among the cluster heads (CHs). By applying the closed space‐filling curves such as the Moore curve, for forming a mesh, the CHs are offered a number of choices for disseminating aggregated data to the BS through inter‐CH paths. Then, the BS forwards the aggregated data as well so that it appears as one of the CHs. The simulation results confirm the effectiveness of the proposed technique in boosting the anonymity of the BS.     

Distributed Energy Efficient Tracking in Hybrid wireless sensor network (DEETH)

In wireless sensor network (WSN), it is a complex task to track the target when it is moving randomly in an unknown environment. It also becomes difficult to cover a complete searching area because of the limited searching range and energy of sensor nodes as they are few in number. The author proposes a distributed energy efficient tracking in a hybrid WSN (DEETH) to track a randomly moving target in an unknown searching. Hybrid WSN that is proposed has both static sensor nodes (SSNs) and mobile sensor nodes (MSNs), which are deployed in the searching area. The MSNs move collectively using particle swarm techniques to search a target. The SSNs are deployed for tracking the presence of a target and giving this information to the base station. As per the information given by SSN, MSNs travel to the target and track it. Simulation results prove that proposed technique successfully tracks the target using less number of nodes and also less amount of energy.     

Event-to-sink reliable transport in wireless sensor networks

Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective information provided by source nodes and not on any individual report. However, conventional end-to-end reliability definitions and solutions are inapplicable in the WSN regime and would only lead to a waste of scarce sensor resources. Hence, the WSN paradigm necessitates a collective event-to-sink reliability notion rather than the traditional end-to-end notion. To the best of our knowledge, reliable transport in WSN has not been studied from this perspective before. In order to address this need, a new reliable transport scheme for WSN, the event-to-sink reliable transport (ESRT) protocol, is presented in this paper. ESRT is a novel transport solution developed to achieve reliable event detection in WSN with minimum energy expenditure. It includes a congestion control component that serves the dual purpose of achieving reliability and conserving energy. Importantly, the algorithms of ESRT mainly run on the sink, with minimal functionality required at resource constrained sensor nodes. ESRT protocol operation is determined by the current network state based on the reliability achieved and congestion condition in the network. This self-configuring nature of ESRT makes it robust to random, dynamic topology in WSN. Furthermore, ESRT can also accommodate multiple concurrent event occurrences in a wireless sensor field. Analytical performance evaluation and simulation results show that ESRT converges to the desired reliability with minimum energy expenditure, starting from any initial network state.     

基于LEACH路由协议的混合光无线传感网络研究

分析了基于低功耗自适应分簇(LEACH)路由协议的无线传感网络(WSN)在不同拓扑形状下的生命周期,并改进了长方形拓扑形状的路由协议。进而针对WSN在某些场合能量有限、易受干扰和安全性差等缺点,在长方形区域中引入分布式光纤传感结构。将传感光纤铺设在环境复杂和外界电磁波干扰大的监测区域,从而提高整个传感网络的生命周期和可靠性。理论分析和仿真结果表明,改进的拓扑和协议在提高可靠性的同时,有效地延长了光WSN的生存时间,性能优于传统LEACH协议。     

Assimilation of fuzzy clustering approach and EHO‐Greedy algorithm for efficient routing in WSN

The problems related to energy consumption and improvement of the network lifetime of WSN (wireless sensor network) have been considered. The base station (BS) location is the main concern in WSN. BSs are fixed, yet, they have the ability to move in some situations to collect the information from sensor nodes (SNs). Recently, introducing mobile sinks to WSNs has been proved to be an efficient way to extend the lifespan of the network. This paper proposes the assimilation of the fuzzy clustering approach and the Elephant Herding Optimization (EHO)‐Greedy algorithm for efficient routing in WSN. This work considers the separate sink nodes of a fixed sink and movable sink to decrease the utilization of energy. A fixed node is deployed randomly across the network, and the movable sink node moves to different locations across the network for collecting the data. Initially, the number of nodes is formed into the multiple clusters using the enhanced expectation maximization algorithm. After that, the cluster head (CH) selection done through a fuzzy approach by taking the account of three factors of residual energy, node centrality, and neighborhood overlap. A suitable collection of CH can extremely reduce the utilization of energy and also enhancing the lifespan. Finally, the routing protocol of the hybrid EHO‐Greedy algorithm is used for efficient data transmission. Simulation results display that the proposed technique is better to other existing approaches in regard to energy utilization and the system lifetime.     

Efficient broadcasting protocols for regular wireless sensor networks

The wireless sensor network (WSN) has attracted lots of attention recently. Broadcast is a fundamental operation for all kinds of networks and it has not been addressed seriously in the WSN. Therefore, we propose two types of power and time efficient broadcasting protocols, namely one‐to‐all and all‐to‐all broadcasting protocols, for five different WSN topologies. Our one‐to‐all broadcasting protocols conserve power and time by choosing as few relay nodes as possible to scatter packets to the whole network. Besides, collisions are carefully handled such that our one‐to‐all broadcasting protocols can achieve 100% reachability. By assigning each node a proper channel, our all‐to‐all broadcasting protocols are collision free and efficient. Numerical evaluation results compare the performance of the five topologies and show that our broadcasting protocols are power and time efficient. Copyright © 2005 John Wiley & Sons, Ltd.     

A Novel Network Coding and Multi-path Routing Approach for Wireless Sensor Network

In recent times, there have been many advances in the field of information theory and wireless sensor network (WSN) technologies. Network coding is a new paradigm in data transport and promises to change many aspects of WSN. This paper proposes a network coding multipath routing algorithm in WSN (NC-WSN). It is typically proposed in order to increase the reliability of data transmission or to provide load balancing. We evaluate and compare our technique with several existing approaches by a set of simulations, using different scenarios and topologies. The simulations results suggest that the multipath diversity achieved with our proposition can significantly improve the network response time.