无线传感网络敏感信息的有效监控方法

无线传感网络以其独特传输方式深受各种传输领域所喜爱,无线传感网络凭借传输便捷、基础设施安装部署方便的优点,迅速的占领了很多的传输市场。无线传感网络在传输过程中,对敏感信息有效监控是许多学者正在研究的课题。本文根据上述问题,以无线传感网络敏感信息有效监控方法为对象进行深入的探讨研究,首先对无线传感网络的系统组成和使用原理进行了说明,然后对无线传感网络的使用路径进行分析,最后结合语言识别系统进行敏感信息有效监控。     

一种面向流域监测的无线传感网络系统设计

流域监测是无线传感网络系统的重要应用之一。提出了一种基于链式分布结构的无线传感网络系统,通过协议栈的设计优化提高网络利用率和通信效率,避免多余的数据交互和能量消耗。测试结果表明系统具备良好的信息感知与无线传输性能,可以满足实际的流域监测应用需求。     

无线传感网分布式密钥分配方案综述

近年来,无线传感网以其特殊的军事、商业前景而广泛受到关注,与传统有线网络相比,无线传感网有着自己的优势和特性,而在信息社会,信息安全无疑是研究的一个重要方向。至此,国内外学者对无线传感网的安全性进行了大量研究,尤其是在密钥分配这一方面,首先对密钥分配的概念进行阐述,针对无线传感网自身特点,选取了较为合适的分布式密钥分配方案,分析了几种方案的基本原理,并分别从安全性、通信计算开销和效率等角度分析了其优势和不足,最后,在此基础上进行总结与展望。     

物联网感知层多路径传输策略研究

多路径数据传输是无线传感器网络亟需解决的一个关键问题.本文针对节点故障、链路失效和外界干扰影响网络稳定性和可靠性,提出一种基于混合蛙跳算法的无线传感器网络多路径传输策略.首先我们详细介绍了蛙跳算法及其原理,之后我们将其应用到无线传感器网络多路径传输策略之中,接着运用混合蛙跳算法对传感网络节点其进行更新、划分、重组以便选择出最优节点建立传输最优路径,提高网络的稳定性和可靠性.通过算法仿真与结果对比提出的算法与AODV、粒子群PSO算法相比,在网络能耗、传输时延、丢包率、连通率和可靠度等方面都具有较好的性能.其中网络能耗比AODV、PSO算法降低了62.5％和35.8％.     

基于局域世界的WSN拓扑加权演化模型

 无标度加权网络模型,反映了现实网络的存在形式和动力学特征,是无线传感网络建模和拓扑演化的有效研究工具.本文基于局域世界理论提出一种不均匀成簇的无线传感网络拓扑动态加权演化模型,考虑节点能量,通信流量和距离等因素,对边权重和节点强度进行了定义,同时研究了拓扑生长对边权重分布的影响.实验证明演化所得网络节点度,强度和边权重均服从幂律分布,结合已有理论成果可知,该拓扑不仅继承了无权网络较高的鲁棒性和抗毁性,同时降低了节点发生相继故障的几率,增强了无线传感网络的同步能力.     

融合无线传感网络的长距离射频识别系统

探讨了无线传感网络与射频识别技术融合的意义,研究了有实际应用价值的融合方案,即由融合方案中的＂智能节点＂完成信息采集、识别及传输,充分发挥了射频识别技术的信息标识功能和无线传感网络自组网的成本低、传输距离远等优点,以此来扩展传统射频识别系统的覆盖范围和传输距离。研究结果表明,射频识别系统与无线传感器网络具有一定的互补性...     

随机部署无线传感器网络定位技术研究

随着经济的发展和科学技术的提高,无线传感网络作为一种新型的信息获取技术,在很多领域都具有相当大的作用。而定位问题是无线传感网络（Wireless Sensor Networks,W S Ns）研究中的基础性问题之一。本文从多方面对随机部署无线传感器网络定位进行探讨。     

基于ZigBee协议的无线传感网路及应用

随着网络技术的逐步成熟,无线传感器时代的到来,从而也致使了无线传感网络技术成为了近几年的一个技术热点。在网络设备中嵌入一个标准化的网络协议,可以提高网络之间的互联,提高网络之间的流通强化资源共享的效率。本文基于无线传感网络的特点,重点分析了ZigBee协议的结构特点,以及ZigBee协议的无线传感协议的前景应用方式。     

无线传感网络节点软件高效远程更新方法设计

以MSP430F149单片机为例,针对无线传感网络中节点软件维护与更新成本较高的难题,设计了一种无线传感网络节点软件远程更新方法。通过程序文件差异比较、变格式传输和数据压缩提高了远程更新效率,通过程序冗余存储和强制更新提高了远程更新的可靠性。经过高速铁路现场应用情况表明,该方法可显著降低节点维护更新成本、远程更新稳定可靠,适于推广。     

无线mesh网络匿名通信机制研究

本文在对无线mesh网络深入研究的基础上,针对mesh网络环境下的隐私保护需求,提出在无线mesh网络下基于网络编码的匿名通信机制。该方案将多径路由技术与网络编码技术相结合,应用跨层协作机制降低了无线环境下的数据包重传,提高了网络的传输效率,保证了网络传输的可靠性。     

An energy efficient clustering routing algorithm for wireless sensor networks

~~An energy efficient clustering routing algorithm for wireless sensor networks1. Mainwaring A, Polastre J, Szewczyk R, et al. Wireless sensor networks for habitat monitoring. Proceedings of the ACM International Workshop on Wireless Sensor Networks and A…     

An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks

Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.     

PEAL: Power Efficient and Adaptive Latency Hierarchical Routing Protocol for Cluster-Based WSN

In wireless sensor networks, one of the most important constraints is the low power consumption requirement. For that reason, several hierarchical or cluster-based routing methods have been proposed to provide an efficient way to save energy during communication. However, their main challenge is to have efficient mechanisms to achieve the trade-off between increasing the network lifetime and accomplishing acceptable transmission latency. In this paper, we propose a novel protocol for cluster-based wireless sensor networks called PEAL (Power Efficient and Adaptive Latency). Our simulation results show that PEAL can extend the network lifetime about 47% compared to the classic protocol LEACH (Low-Energy Adaptive Clustering Hierarchy) and introduces an acceptable transmission latency compared to the energy conservation gain.     

Multi-factor and Distributed Clustering Routing Protocol in Wireless Sensor Networks

One of important issues in wireless sensor networks is how to effectively use the limited node energy to prolong the lifetime of the networks. Clustering is a promising approach in wireless sensor networks, which can increase the network lifetime and scalability. However, in existing clustering algorithms, too heavy burden of cluster heads may lead to rapid death of the sensor nodes. The location of function nodes and the number of the neighbor nodes are also not carefully considered during clustering. In this paper, a multi-factor and distributed clustering routing protocol MFDCRP based on communication nodes is proposed by combining cluster-based routing protocol and multi-hop transmission. Communication nodes are introduced to relay the multi-hop transmission and elect cluster heads in order to ease the overload of cluster heads. The protocol optimizes the election of cluster nodes by combining various factors such as the residual energy of nodes, the distance between cluster heads and the base station, and the number of the neighbor nodes. The local optimal path construction algorithm for multi-hop transmission is also improved. Simulation results show that MFDCRP can effectively save the energy of sensor nodes, balance the network energy distribution, and greatly prolong the network lifetime, compared with the existing protocols.     

Reliable and energy aware query-driven routing protocol for wireless sensor networks

Wireless sensor networks become very attractive in the research community, due to their applications in diverse fields such as military tracking, civilian applications and medical research, and more generally in systems of systems. Routing is an important issue in wireless sensor networks due to the use of computationally and resource limited sensor nodes. Any routing protocol designed for use in wireless sensor networks should be energy efficient and should increase the network lifetime. In this paper, we propose an efficient and highly reliable query-driven routing protocol for wireless sensor networks. Our protocol provides the best theoretical energy aware routes to reach any node in the network and routes the request and reply packets with a lightweight overhead. We perform an overall evaluation of our protocol through simulations with comparison to other routing protocols. The results demonstrate the efficiency of our protocol in terms of energy consumption, load balancing of routes, and network lifetime.     

Energy efficient multi-channel media access control for dense wireless ad hoc and sensor networks

Traditional single-channel MAC protocols for wireless ad hoc and sensor networks favor energy-efficiency over throughput. More recent multi-channel MAC protocols display higher throughput but less energy efficiency. In this article we propose NAMAC, a negotiator-based multi-channel MAC protocol in which specially designated nodes called negotiators maintain the sleeping and communication schedules of nodes within their communication ranges in static wireless ad hoc and sensor networks. Negotiators facilitate the assignation of channels and coordination of communications windows, thus allowing individual nodes to sleep and save energy. We formally define the problem of finding the optimal set of negotiators (i.e., minimizing the number of selected negotiators while maximizing the coverage of the negotiators) and prove that the problem is NP-Complete. Accordingly, we propose a greedy negotiator-election algorithm as part of NAMAC. In addition, we prove the correctness of NAMAC through a rigorous model checking and analyze various characteristics of NAMAC—the throughput of NAMAC, impact of negotiators on network capacity, and storage and computational overhead. Simulation results show that NAMAC, at high network loads, consumes 36 % less energy while providing 25 % more throughput than comparable state-of-art multi-channel MAC protocols for ad hoc networks. Additionally, we propose a lightweight version of NAMAC and show that it outperforms (55 % higher throughput with 36 % less energy) state-of-art MAC protocols for wireless sensor networks.     

On combining network coding with duty-cycling in flood-based wireless sensor networks

Network coding and duty-cycling are two major techniques for saving energy in wireless sensor networks. To the best of our knowledge, the idea to combine these two techniques for even more aggressive energy savings, has not been explored. This is not unusual, since these two techniques achieve energy efficiency through conflicting means, e.g., network coding saves energy by exploiting overhearing (i.e., nodes are awake), whereas duty-cycling saves energy by reducing idle listening (i.e., nodes sleep). In this article, we thoroughly investigate if network coding and duty cycling can be used together for more aggressive energy savings in flood-based wireless sensor networks.Our main idea is to exploit the redundancy sometimes present in flooding applications that use network coding, and put a node to sleep (i.e., duty cycle) when a redundant transmission takes place (i.e., the node has already received and successfully decoded a sequence of network-coded packets). We propose a scheme, called DutyCode, in which a multiple access control (MAC) protocol implements packet streaming and allows the network coding-aware application to decide when a node can sleep. We also present an algorithm for deciding the optimal coding scheme for a node to further reduce energy consumption by minimizing redundant packet transmissions. Finally, we propose an adaptive switching technique between DutyCode and an existing duty-cycling MAC protocol. We investigate our proposed solutions analytically and implement them on mote hardware. Our performance evaluation results, obtained from a 42-node indoor testbed, show that our scheme saves 30–46% more energy than network coding-based solutions.     

Reliability Analysis for a Data Flow in Event-Driven Wireless Sensor Networks

For the purpose of designing more reliable networks, we extend the traditional reliability analysis from wired networks to wireless networks with imperfect components. This paper aims to study the reliability of a data flow in event-driven wireless sensor networks with acknowledgment-based transmission scheme. Initially, an event-driven wireless sensor network model is described in terms of limited node battery energy and shadowed fading channels. Then, in order to analyze the network reliability, wireless link reliability and node energy availability are investigated, respectively. Further the analytical expressions of the instantaneous network reliability and the mean time to failure are derived. Finally, the simulation results validate the correctness and accuracy of the analytical results.     

Energy-Efficient Routing Algorithm Based on Unequal Clustering and Connected Graph in Wireless Sensor Networks

Clustering and multi-hop routing algorithms substantially prolong the lifetime of wireless sensor networks (WSNs). However, they also result in the energy hole and network partition problems. In order to balance the load between multiple cluster heads, save the energy consumption of the inter-cluster routing, in this paper, we propose an energy-efficient routing algorithm based on Unequal Clustering Theory and Connected Graph Theory for WSN. The new algorithm optimizes and innovates in two aspects: cluster head election and clusters routing. In cluster head election, we take into consideration the vote-based measure and the transmission power of sensor nodes when to sectionalize these nodes into different unequal clusters. Then we introduce the connected graph theory for inter-cluster data communication in clusters routing. Eventually, a connected graph is constituted by the based station and all cluster heads. Simulation results show that, this new algorithm balances the energy consumption among sensor nodes, relieves the influence of energy-hole problem, improve the link quality, achieves a substantial improvement on reliability and efficiency of data transmission, and significantly prolongs the network lifetime.     

Optimal tracking interval for predictive tracking in wireless sensor network

An important application of wireless sensor networks is tracking moving objects. Prediction-based techniques have been proposed to reduce the power consumption in wireless sensor networks by limiting the sensor active time. This paper proposes a quantitative method to optimize the power efficiency by analyzing the effect of prediction on the energy consumption in such networks. To our best knowledge, our efforts are the first attempt made to calculate the optimal tracking interval for a given predictive tracking algorithm. Based on this method, the lifetime and power efficiency of a sensor network can be effectively improved.