超低功耗MSP430在无线传感网络上的应用

介绍了超低功耗单片机MSP430与射频电路结合利用无线传感网络来实现智能交通的目的。在要求能量消耗较低的情况下,把多个端机分布在马路的各个车道上,利用磁敏传感器,通过无线传感网络把检测到车流量的信息发送到基站上,再把有效信息传递到上位机中,最终获得车流量的信息。实验证明该方法与传统的线圈检测方法相比,前者具有良好的实时性与准确性。

基于无线传感器网络定位技术的图书馆智能管理创新

"互联网+"时代,信息技术的发展对图书馆的智能化管理工作提出了更高的要求。文章概述了无线传感器网络与定位技术,重点讨论了如何将WSN定位技术运用到图书智能管理,通过定位技术与大数据、云计算等信息技术的结合,推动图书馆智能系统建设和智能化发展。

一种面向WSN时间同步的振荡器模型设计与研究

WSN节点采用低成本的晶振,节点之间的频率差异不可避免。该项目讨论频率对耦合振荡器的影响,设计一个适合于WSN时间同步的频率互异耦合振荡器模型。该模型验证振荡器系统在所有条件下都可以达到同步,分析振荡器系统的理论模型,给出系统达到同步的条件。通过多次实验,分析参数对同步的不同影响,验证该模型的可行性。该模型解决振荡器模型因频率不同而出现误差增大的问题,提升整个系统的精度。该模型在经典耦合振荡器基础上,加入频率互异和多跳网络拓扑两个因素,使其更加适用于无线传感器网络。

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.

Calibration Method Based on RBF Neural Networks for Soil Moisture Content Sensor

Temporal and spatial variation of soil moisture content is significant for crop growth,climate change and the other fields.In order to overcome shortage of non-linear output voltage of TDR3 soil moisture content sensor and increase soil moisture content data collection and computational efficiency,this paper presents a RBF neural network calibration method of soil moisture content based on TDR3 soil moisture sensor and wireless sensor networks.Experiment results show that the calibration method is effective...

Sensor deployment strategy for chain-type wireless underground mine sensor network

Wireless sensor networks (WSNs) are very important for monitoring underground mine safety. Sensor node deployment affects the performances of WSNs. In our study, a chain-type wireless underground mine sensor network (CWUMSN) is first pre- sented. A CWUMSN can monitor the environment and locate miners in underground mines. The lowest density deployment strate- gies of cluster head nodes are discussed theoretically. We prove that the lifetime of CWUMSN with a non-uniform deployment strategy is longer than with a uniform deployment strategy. Secondly, we present the algorithm of non-uniform lowest density de- ployment of cluster head nodes. Next, we propose a dynamic choice algorithm of cluster head nodes for CWUMSN which can im- prove the adaptability of networks. Our experiments of CWUMSN with both non-uniform lowest density and uniform lowest den- sity deployments are simulated. The results show that the lifetime of CWUMSN with non-uniform lowest density deployment is almost 2.5 times as long as that of the uniform lowest density deployment. This work provides a new deployment strategy for wire- less underground mine sensor networks and then effectively promotes the application of wireless sensor networks to underground mines.

A load-balanced minimum energy routing algorithm for Wireless Ad Hoc Sensor Networks

Wireless Ad Hoc Sensor Networks (WSNs) have received considerable academia research attention at present. The energy-constraint sensor nodes in WSNs operate on limited batteries, so it is a very important issue to use energy efficiently and reduce power consumption. To maximize the network lifetime, it is essential to prolong each individual node’s lifetime through minimizing the transmission energy consumption, so that many minimum energy routing schemes for traditional mobile ad hoc network have been developed for this reason. This paper presents a novel minimum energy routing algorithm named Load-Balanced Minimum Energy Routing (LBMER) for WSNs considering both sensor nodes’ energy consumption status and the sensor nodes’ hierarchical congestion levels, which uses mixture of energy balance and traffic balance to solve the problem of “hot spots” of WSNs and avoid the situation of “hot spots” sensor nodes using their energy at much higher rate and die much faster than the other nodes. The path router established by LBMER will not be very congested and the traffic will be distributed evenly in the WSNs. Simulation results verified that the LBMER performance is better than that of Min-Hop routing and the existing minimum energy routing scheme MTPR (Total Transmission Power Routing).

Grid-based energy-aware routing in wireless sensor networks

The model of energy cost in a wireless sensor network （WSN）environment is built, and the energy awareness and the wireless interference mainly due to different path loss models are studied. A special case of a clustering scheme, a twodimensional grid clustering mechanism, is adopted. Clusterheads are rotated evenly among all sensor nodes in an efficient and decentralized manner, based on the residual energy in the battery and the random backoff time. In addition to transmitting and receiving packets within the sensors＇ electrical and amplification circuits, extra energy is needed in the retransmission of packets due to packet collisions caused by severe interference. By analysis and mathematical derivation, which are based on planar geometry, it is shown that the total energy consumed in the network is directly related to the gridstructure in the proposed grid based clustering mechanism. The transmission range is determined by cluster size, and the path loss exponent is determined by nodal separation. The summation of overall interference is caused by all the sensors that are transmitting concurrently. By analysis and simulation, an optimal grid structure with the corresponding grid size is presented, which balances between maximizing energy conservation and minimizing overall interference in wireless sensor networks.

A New Localization Scheme with Statistical Estimation against Wormhole Attack in Wireless Sensor Networks

Wormhole attack is one of the most devastating threats for range-free localization in wireless sensor networks. In this paper, we evaluate three statistical estimation methods with the same network model and geographic information obtailaed by the DV-Hop algorithm. We analyze the limits of Minimum Mean Square Estimate （MMSE）, Least Median of Squares （LMS） and Enhanced greedy At- tack-Resistant MMSE （EARMMSE） and propose an improved EARMMSE with the hop-distance relationship, named EARMMSE＋. Simulation results illustrate the performance of MMSE, LMS and EARMMSE＋ with different anchor fraction, the length of wormhole link and the average local neighborhood and show that EARMMSE＋ outperforms MMSE and LMS.

Analysis of distribution uniformity of nodes in wireless sensor networks

Wireless sensor networks have several special characteristics which make against the network coverage, such as shortage of energy, difficulty with energy supply and so on. In order to prolong the lifetime of wireless sensor networks, it is necessary to balance the whole network load. As the energy consumption is related to the situation of nodes, the distribution uniformity must be considered. In this paper, a new model is proposed to evaluate the nodes distribution uniformity by considering some parameters which include compression discrepancy, sparseness discrepancy, self discrepancy, maximum cavity radius and minimum cavity radius. The simulation results show that the presented model could be helpful for measuring the distribution uniformity of nodes scattered randomly in wireless sensor networks.

Capacity Research in Cluster-Based Underwater Wireless Sensor Networks Based on Stochastic Geometry

Underwater wireless sensor networks(UWSNs) have attracted wide attention in recent years.The capacity research on it is still in the initial stage,lacking adequate performance evaluation for network construction.This paper will focus on this subject by theoretical analysis and simulation,aiming to provide some insights for the actual UWSNs construction.According to the structure features of cluster-based UWSNs and the propagation characteristics of underwater acoustic signal,with the combination of signal to interference plus noise ratio,we define some capacity performance metrics,such as outage probability and transmission capacity.Based on the theory of stochastic geometry,a network capacity analytical model used in the cluster-based UWSNs is presented.The simulation results verify the validity of the theoretical analysis,and the cause of error between theoretical and simulation results has also been clearly explained.

Reliable energy-efficient routing with novel route update in wireless sensor networks

In this paper we introduce a novel energy-aware routing protocol REPU (reliable, efficient with path update), which provides reliability and energy efficiency in data delivery. REPU utilizes the residual energy available in the nodes and the re-ceived signal strength of the nodes to identify the best possible route to the destination. Reliability is achieved by selecting a number of intermediate nodes as waypoints and the route is divided into smaller segments by the waypoints. One distinct ad-vantage of this model is that when a node on the route moves out or fails, instead of discarding the whole original route, only the two waypoint nodes of the broken segment are used to find a new path. REPU outperforms traditional schemes by establishing an energy-efficient path and also takes care of efficient route maintenance. Simulation results show that this routing scheme achieves much higher performance than the classical routing protocols, even in the presence of high node density, and overcomes simul-taneous packet forwarding.

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.

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.

Prediction-based energy-efficient target tracking protocol in wireless sensor networks

A prediction based energy-efficient target tracking protocol in wireless sensor networks(PET) was proposed for tracking a mobile target in terms of sensing and communication energy consumption.In order to maximize the lifetime of a wireless sensor network(WSN),the volume of messages and the time for neighbor discovery operations were minimized.The target was followed in a special region known as a face obtained by planarization technique in face-aware routing.An election process was conducted to choose a minimal number of appropriate sensors that are the nearest to the target and a wakeup strategy was proposed to wakeup the appropriate sensors in advance to track the target.In addition,a tracking algorithm to track a target step by step was introduced.Performance analysis and simulation results show that the proposed protocol efficiently tracks a target in WSNs and outperforms some existing protocols of target tracking with energy saving under certain ideal situations.

Interference Robust Channel Hopping Strategies for Wireless Sensor Networks

Due to the shared nature of the wireless medium, the performance of wireless sensor network is often limited by both internal interference and external interference. The internal interference is that simultaneous traffic activity by neighboring nodes in the same network, while the external interference is from wireless transmissions by other types of devices, such as Wi-Fi and Bluetooth nodes. In this paper, we present two channel hopping algorithms for multichannel, single-radio wireless sensor networks. The first algorithm achieves collision-free transmission environment while do not introduce extra control overhead. The second algorithm, in addition to reducing internal interference effects, reduces the external interference effects from Wi-Fi devices. Simulation results show that both of them significantly improve performance in wireless sensor network.

QoS Adaptive Topology Configuration in Synchronous Wireless Sensor Networks

By using hyper-graph theory,this paper proposes a QoS adaptive topology configuration(QATC) algorithm to effectively control large-scale topology and achieve robust data transmitting in synchronous wireless sensor networks.Firstly,a concise hyper-graph model is abstracted to analyze the large-scale and high-connectivity network.Secondly,based on the control theory of biologic 'Cell Mergence',a novel self-adaptive topology configuration algorithm is used to build homologous perceptive data logic sub-network ...

Distributed Plume Source Localization Using Hierarchical Sensor Networks

A hierarchical wireless sensor networks(WSN) was proposed to estimate the plume source location.Such WSN can be of tremendous help to emergency personnel trying to protect people from terrorist attacks or responding to an accident.The entire surveillant field is divided into several small sub-regions.In each sub-region,the localization algorithm based on the improved particle filter(IPF) was performed to estimate the location.Some improved methods such as weighted centroid,residual resampling were introduced to the IPF algorithm to increase the localization performance.This distributed estimation method eliminates many drawbacks inherent with the traditional centralized optimization method.Simulation results show that localization algorithm is efficient for estimating the plume source location.

Delay optimization for planar wireless sensor network with N-policy

In N-policy, the nodes attempt to seize the channel when the number of packets in the buffer approaches N. The performance of N-policy on the energy efficiency is widely studied in the past years. And it is presented that there exists one optimal N to minimize the energy consumption. However, it is noticed that the delay raised by N-policy receives little attention. This work mathematically proves the delay to monotonically increase with increasing N in the collision-unfree channel. For planar network where the near-to-sink nodes burden heavier traffic than the external ones, the data stemming from the latter undergo longer delay.The various-N algorithm is proposed to address this phenomenon by decreasing the threshold N of outer nodes. Without the impacting on the network longevity, the maximum delay among the network has decreased 62.9% by the algorithm. Extensive simulations are given to verify the effectiveness and correctness of our analysis.

An Iterative Clustering-Based Localization Algorithm for Wireless Sensor Networks

In wireless sensor networks,node localization is a fundamental middleware service.In this paper,a robust and accurate localization algorithm is proposed,which uses a novel iterative clustering model to obtain the most representative intersection points between every two circles and use them to estimate the position of unknown nodes.Simulation results demonstrate that the proposed algorithm outperforms other localization schemes (such as Min-Max,etc.) in accuracy,scalability and gross error tolerance.