无线传感器网络簇间节能路由算法

针对基于分簇网络的无线传感器网络簇间路由协议,让簇首和Sink节点直接通信或通过簇首节点转发数据造成能耗不均,节点过早死亡的缺陷。文中提出一种基于网关节点模型的无线传感器网络簇间路由算法,通过簇头与网关节点、网关节点自身建立虚电路,制定存储转发路由,将数据转发给Sink节点。并引入延时等待机制,增强了簇间信息的融合度,此算法适用于大规模无线传感器网络,有良好的可扩展性。仿真表明在能量节省等性能上与传统簇间路由算法相较有较大提高。     

基于无线传感器网络的核辐射监测系统设计

针对核电站周围环境复杂,人员难以靠近等特点,设计了一套基于无线传感器网络的核辐射监测系统.整套系统由终端节点、路由节点、协调器节点和上位机监控系统四部分组成.节点之间采用Mesh网络拓扑,利用ZigBee技术无线传输测量数据,上位机监控系统通过组态王实时显示数据,系统成功实现了对辐射剂量的自动检测及远程监控.实验表明,该系统具有功耗低、性能稳定、组网灵活、拓展性强等优点.     

无线传感器网络在煤矿瓦斯监测系统中的应用

针对近些年煤矿瓦斯监测不够精确等问题,本文结合无线传感器网络技术,提出了基于无线传感器网络的煤矿瓦斯监测系统的设计方法。根据该设计思想将系统分为信息采集、传送、监控和路由设计等几部分。针对现场实际的需求,提出固定节点和移动节点的实现方法并对两类传感器结点进行了软硬件设计。结点硬件部分主要包括:控制模块、传感器模块、无线通信模块和电源模块。软件部分主要包括数据采集采集模块与处理模块和数据传输模块,并给出了各模块的流程图。     

基于Zigbee技术的监管平台的系统设计与实现

基于无线传感器网络设计一套战地装备智能监控系统,该系统由集成特定传感器的多个监控节点和配套通信及数据处理软件构成。系统结合智能传感器网络技术、无线射频（RFID）技术和有线通信网络技术,可在战地恶劣条件下快速构建一个以无线自组网为终端、以内网为骨干的混合网络。系统通过监控节点协作地感知、采集和处理网络覆盖区域内特定对象的信息,实现重要装备自动注册、关键设备运行状态自动监测、前指驻地周边环境定位、监控和报警等多种功能。     

基于无线传感器网络的空气质量监测站的设计

以无线传感网络技术设计空气质量监测站的传感器节点和网关节点,采用CC2420和MC55作为节点的无线模块进行数据的收发,采用ATMEGA128 8位AVR微处理器进行数据的处理和控制。文中介绍了监测站的基本结构、传感器节点和网关节点的硬件设计及基本工作流程。     

基于最小跳数的无线传感器网络路由协议

在分析了最小跳数路由算法局限性的基础上对该算法进行了改进,充分考虑了无线传感器网络的跳数、能量、负载均衡等问题。改进后的算法使得传感器的某些节点不会因为频繁使用而迅速死亡,数据包可以沿着最优的路径向网关节点发送。仿真结果显示,改进后的算法可以有效地提高无线传感器网络的可靠性和稳定性,延长了网络的通信时间。     

基于博弈论的井下监测网QoS路由算法研究

构建煤矿井下无线视频监控系统可有效弥补有线监控系统的不足,以无线多媒体传感器为网络节点设计了煤矿井下无线视频监控系统,针对传感器存在潜在的自私性特点,引入博弈理论思想,建立一种无线多媒体传感器网络QOS路由的博弈模型,并将其融入到路由协议中,提出了一种博弈路由协议,仿真实验表明能够有效均衡节点能量消耗,克服传感器自私性...     

基于nRF2401智能无线火灾监控系统设计

设计了基于无线通信芯片nRF2401的无线火灾监控系统,对系统的数据采集控制节点的硬件和软件进行了设计,并采用多传感器融合算法,对传感器的信息进行融合判断.实验证明该系统具有可靠性高和实用性强等优点.     

基于无线传感器网络的油井远程监控系统设计

现有的油井抽油机远程监控系统建设费用昂贵且存在通信盲区的问题,针对这一状况设计了一种基于无线传感器网络的油井监控系统.采用无线微处理器JN51 39构建基于ZigBee协议的无线监测网络;结合GPRS模块MC55构建网关节点实现数据汇聚和GPRS通信方式的远程数据转发.该系统工作性能稳定,将其应用在油田可实现油田生产管理的信息化和自动化.     

基于移动机器人网关的WSN智慧家庭系统

针对传统智慧家庭工程的WSN固定位置节点存在数据收集盲区的缺陷,建立了智慧家庭传感器网络可靠性模型,提出了一种多场景移动机器人网关节点平台的WSN智慧家庭工程系统。该系统融合了移动机器人与ZigBee技术?利用位置固定的节点采集数据,移动的机器人网关节点动态对家居情况参数进行收集与处理,解决了传统家居节点数据采集的“死角” 问题,从而保证家居环境的稳定性与安全性。     

基于无线传感网的矿井环境监测系统

无线传感器网络具有自组织路由、低功耗、低成本的特点,非常适合运行在某些恶劣甚至危险的远程环境中。本文给出了一种基于无线传感网的井下环境监测系统方案和设计,详细描述了系统架构、无线节点和网关硬件和软件设计、上位机信息分析和处理等。特别对系统中的关键技术,如节点电量管理、自组织路由实现、网关与上位机通信协议等进行了阐述。     

Power management of autonomous wireless sensor node for structure health monitoring

This paper presents the design concepts of wireless sensor network system constructed with autonomous sensing nodes, which operates at extremely low power levels. At first, conventional, wired civil structure health-monitoring system is reviewed. Then, the monitoring methodology is discussed focusing quantitative measurement accuracy. Issues of node synchronized sampling, multi-layer cluster, node distance and integrated sensor node module are discussed. Also, radio transceiver protocol candidates are reviewed from the point of connection to the Internet gateway. Sensor node consists of microprocessor, sensing analog front end, and radio transceiver. Last two factors are critical for power consumption. Therefore, low duty cycle measurement is essential, in order to accomplish the ultra low power level, which is equivalent to energy harvesting source, such as piezoelectric and solar cells, sensor node power management device circuit design is demonstrated for the high-spec measurement.     

A Proposal of B-Tree Based Routing Algorithm for Monitoring Systems with Regular Movements in MANETs

Routing Protocols in MANETs have been researched for peer-to-peer services in general. Furthermore, these protocols have been concerned with the fairness service amongst nodes’ peers. However, most of those protocols aren’t suitable for the data communication especially in hierarchical networks, where the most data flows are vertical like a monitoring system. Furthermore, for the monitoring system, amongst the nodes, one of them (a.k.a. root node) should be employed as a gateway to connect to Internet. Thus, most reporting data from certain nodes are delivered to the root node. Likewise, data should be delivered to the message originator nodes for responsibility. Therefore, a new routing protocol for such networks including the monitoring system is strongly required. This paper proposes a routing protocol based on the binary-tree shaped network, which derives from the general table driven methods’ routing manners with DSDV families of MANETs. In conclusion, we verify whether our protocol would be efficiently used in such networks through its performance evaluations with simulation results.     

Maximum lifetime routing in wireless sensor networks

A routing problem in static wireless ad hoc networks is considered as it arises in a rapidly deployed, sensor based, monitoring system known as the wireless sensor network. Information obtained by the monitoring nodes needs to be routed to a set of designated gateway nodes. In these networks, every node is capable of sensing, data processing, and communication, and operates on its limited amount of battery energy consumed mostly in transmission and reception at its radio transceiver. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver then the energy consumption rate per unit information transmission depends on the choice of the next hop node, i.e., the routing decision. We formulate the routing problem as a linear programming problem, where the objective is to maximize the network lifetime, which is equivalent to the time until the network partition due to battery outage. Two different models are considered for the information-generation processes. One assumes constant rates and the other assumes an arbitrary process. A shortest cost path routing algorithm is proposed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes. The algorithm is amenable to distributed implementation. Simulation results with both information-generation process models show that the proposed algorithm can achieve network lifetime that is very close to the optimal network lifetime obtained by solving the linear programming problem.     

Shift Reduce Parser Based Malicious Sensor Detection for Predicting Forest Fire in WSNs

Nowadays wireless sensor networks (WSNs) has been used in enormous applications for data collection in an unfriendly environment. Forest fire makes vast hazard to the consuming plant of the world. To preserve the forest from fire, sensor nodes monitor the environment temperature. If the temperature is increased and it exceeds the threshold, the sensor sends the notification message to the fire monitoring system. The forest fire is measured by Fire Weather Index. Most of the existing fire monitoring systems only highlight in detection, but not the verification of the sensor. Suppose, if the attacker inserts any malicious sensor, the malicious sensor sends false information or create an additional delay in fire monitoring system. As a result, the more chances for the forest to be destroyed by fire. To solve this problem, Shift Reduce Parser based Malicious Sensor Detection (SRP_MSD) in WSN is proposed. The Bivariate Pascal Triangle method hides the original identity of nodes, data route from the malicious observer and sends confidential information to the Base Station. This method is analyzed and evaluated using network simulator-2. The results show that it is possible to detect malicious sensor nodes and send the reliable information to the forest fire monitoring system.     

WSN在智能化小区火灾报警系统中的应用

针对传统火灾报警检测系统的许多缺点,研制了火灾报警检测系统的无线传感器网络,并对WSN在智能化火灾报警系统中的应用进行了分析,使得火灾报警检测系统的节点位置、监测范围、节点敏感度、节点间距离都得以改善和提高。     

一种基于无线传感器网络的火险信息采集系统

提出了把无线传感器应用于火险信息检测防治的思路,研究设计了基于无线传感器网络的火险信息采集系统。节点设计基于MSP430单片机和CC2420 ZigBee射频IC。采用ARM7系列S3C44BOX、GPRS模块SIM100的网关设计,搭建了平面型无线信息传输网络拓扑结构,仿真结果表明,网络伸缩性好,当发生火灾导致某些传感器节点被烧毁时,网络的其他部分还能持续正常工作,具有自组织重新恢复网络的功能。该系统能够实时地显示出各节点的温度、湿度和风速参数,实现楼宇范围火险信息的实时采集。     

An adaptive load-aware routing algorithm for multi-interface wireless mesh networks

In wireless mesh networks, the number of gateway nodes are limited, when the nodes access to the internet by fixed gateway node, different requirements of nodes lead to the dataflow shows heterogeneity. Many new routing metrics and algorithms existing in traditional wired networks and the Ad Hoc network, can not be directly applied to wireless mesh networks, so how to design a routing metric and algorithm which can dynamically adapt to current networks topology and dataflow changes, avoid bottleneck node, and select the most stable and least congestion link to establish a route is very important. In this paper, we presented a new dynamic adaptive channel load-aware metric (LAM) to solve the link load imbalance caused by inter-flow and inner-flow interference, designed a self-adaptive dynamic load balancing on-demand routing algorithm through extending and improving AODV routing method with the LAM, to achieve flow balance, reduce the high packet loss ratio and latency because congestion and Packet retransmission, and can increase Network Throughput.