共查询到20条相似文献,搜索用时 31 毫秒
1.
Hu Cai Yin Zhang Hehua Yan Fangyang Shen Keliang Zhou Chunhua Zhang 《Mobile Networks and Applications》2016,21(5):879-889
With the rapid development of information communication technologies, industrial manufacturing environments and requirements have changed considerably. Since wireless sensor networks have become more and more popular, our production chains have improved with respect to efficiency, flexibility and security. On the other hand, building a secure, robust and fast network is an essential issue for enterprises. In the past, few experts focused on this issue of industrial applications and most of solutions proposed are not suitable for industrial environments. In this paper, we propose a real-time routing protocol for mobile wireless sensor nodes in industrial environments, which offers superior quality of service in terms of delay time. We use geographic routing and information contained in the nodes routing table to extract location information. Then we calculate the node which is nearest to the target node to reduce hop counts and achieve fast data package transfers. It optimizes the packets forwarding hops, which in turn reduces the delay time effectively. We used OPNET to analyze our protocol and results indicate that this algorithm is useful and suitable for wireless sensor networks 相似文献
2.
3.
4.
As an important supporting technology, the localization technology has become the basis of the practical applications of wireless sensor networks for information acquisition and processing. APIT (approximate Point-In-Triangulation) localization scheme is widely used for localization estimation in wireless sensor networks due to the advantages of the high localization accuracy and easy to deploy. However, there are some inherent defects caused by the uneven distribution of sensor nodes in APIT scheme. To overcome the problem, in this paper a novel virtual nodes-based range-free localization scheme, i.e., VN-APIT, is proposed to improve the APIT scheme. By rationally deploying virtual nodes in sensor network according to the proposed VN-APIT test theory, VN-APIT localization scheme can determine independently that whether a target node is inside or outside the triangle formed by three certain anchor nodes. Therefore, it will not subject to the effect of the density and distribution of sensor nodes and there is no the problem of the In-to-Out error and the Out-to-In error in VN-APIT scheme. Simulation evaluation shows that the proposed VN-APIT scheme is more robust and has a lower average localization error (ALE) than the conventional APIT scheme. 相似文献
5.
无线传感器网络混合定位技术研究 总被引:1,自引:0,他引:1
在大规模复杂无线传感器网络中往往采用多种节点定位技术,在此结合现有无线传感器定位技术的现状,提出了一种混合定位技术以实现不同定位方法之间的互补。一方面利用RSSI定位弥补TDOA定位覆盖范围小的缺点;另一方面将测距信息引入到非测距定位DV—Hop算法中,用RSSI测距模型来提高DV-Hop算法中定位节点与信标节点间有效距离的精度。实验结果表明,该混合定位技术实现了TDOA,RSSI以及DV-HOP等定位技术的融合,有效地提高了复杂大规模无线传感器网络的节点定位精度。 相似文献
6.
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. 相似文献
7.
Robust Range-Free Localization in Wireless Sensor Networks 总被引:1,自引:0,他引:1
In wireless sensor networks, sensors should have some mechanisms to learn their locations since sensed data without associated location information may be meaningless. While many sensor localization algorithms have been proposed, security issues in sensor localization are usually not addressed in their original design. Secure sensor localization is very challenging due to limited computation and energy resources in sensors. It is highly desirable that a localization scheme is robust and is able to detect malicious attacks without using complex cryptographic operations. In this paper, we present and analyze detection methods purely based on geometric constraints in sensor networks. Our detection methods can protect the localization algorithm from malicious attacks by detecting and eliminating the negative impact of fake information. 相似文献
8.
9.
基于 RSSI 的无线传感器网络节点定位算法研究 总被引:2,自引:0,他引:2
节点位置信息是无线传感器网络应用的基础。基于RSSI(Receive Signal Strength Indicator)的测距技术因其低成本和低复杂度的优点而被广泛用于无线传感器网络的定位技术中。介绍了RSSI信号传输模型,在介绍无线传感器网络定位基本原理的基础上,分析了影响定位精度的因素。综述了近几年提出的无线传感器网络中基于RSSI的节点定位算法及其改进算法,现有基于RSSI定位算法的改进算法主要从测距精度改进、定位精度改进或误差修正改进等方面进行。最后,指出了基于RSSI的无线传感器网络节点定位算法的不足,并进行展望。 相似文献
10.
In many applications of wireless sensor networks, sensor nodes are manually deployed in hostile environments where an attacker can disrupt the localization service and tamper with legitimate in-network communication. In this article, we introduce Secure Walking GPS, a practical and cost effective secure localization and key distribution solution for real, manual deployments of WSNs. Using the location information provided by the GPS and inertial guidance modules on a special master node, Secure Walking GPS achieves accurate node localization and location-based key distribution at the same time. We evaluate our localization solution in real deployments of MicaZ. Our experiments show that 100% of the deployed nodes localize (i.e., have a location position) and that the average localization errors are within 1–2 m, due mainly to the limitations of the existing commercial GPS devices. Our further analysis and simulation results indicate that the Secure Walking GPS scheme makes a deployed WSN resistant to the Dolev-Yao, the wormhole, and the GPS-denial attacks, the scheme is practical for large-scale deployments with resource-constrained sensor nodes and has good localization and key distribution performance. 相似文献
11.
A real-world localization system for wireless sensor networks that adapts for mobility and irregular radio propagation model is considered. The traditional range-based techniques and recent range-free localization schemes are not well competent for localization in mobile sensor networks, while the probabilistic approach of Bayesian filtering with particle-based density representations provides a comprehensive solution to such localization problem. Monte Carlo localization is a Bayesian filtering method that approximates the mobile node's location by a set of weighted particles. In this paper, an enhanced Monte Carlo localization algorithm-Extended Monte Carlo Localization (Ext-MCL) is proposed, i.e., the traditional Monte Carlo localization algorithm is improved and extended to make it suitable for the practical wireless network environment where the radio propagation model is irregular. Simulation results show the proposal gets better localization accuracy and higher localizable node number than previously proposed Monte Carlo localization schemes not only for ideal radio model, but also for irregular one. 相似文献
12.
In hostile environments, localization often suffers from malicious attacks that may distort transmit power and degrade positioning accuracy significantly for wireless sensor network. A robust semidefinite relaxation secure localiza-tion algorithm RSRSL was proposed to improve the location accuracy against malicious attacks. On the assumption of unknown transmit power, which is undoubtedly approximate to the fact of WSN, a novel secure location probability model was introduced for single-target and multi-target sensor networks, respectively. Taking the computational complexity of RSRSL into account, the nonlinear and non-convex optimization problem was simplified into a semidefinite programming problem. According to the results from both simulations and field experiments, it is clearly demonstrated that the proposed RSRSL has better performance on location accuracy, in contrast to the conventional localization algorithms. 相似文献
13.
Wireless sensor networks have critical applications in various fields,and the algorithm of their se-cure localization has become a vital technology to support a network.In the light of the self-organization,random deployment and dynamic topology,the localization process is vulnerable to various kinds of malicious attacks.The model of dynamic trust management for a given node is proposed to deal with security concerns in wireless sensor networks.The trust computation is divided into three stages,which are the stage of trust initialization,trust establishment,and trust evolution.The initial value of a global trust relationship is established through a corresponding global trust relation graph in the initial stage of trust.The trust value of each node is calculated by the attribute value in the stage of trust establishment.In the evolution of trust,the iterative process of trust value is accelerated via the finite state machine.Compared with the existing wireless sensor networks,simulation results show that the proposed security localization technology method can resist many kinds of attacks with low communication and time consumption. 相似文献
14.
Monte Carlo localization for mobile wireless sensor networks 总被引:5,自引:0,他引:5
Localization is crucial to many applications in wireless sensor networks. In this article, we propose a range-free anchor-based localization algorithm for mobile wireless sensor networks that builds upon the Monte Carlo localization algorithm. We concentrate on improving the localization accuracy and efficiency by making better use of the information a sensor node gathers and by drawing the necessary location samples faster. To do so, we constrain the area from which samples are drawn by building a box that covers the region where anchors’ radio ranges overlap. This box is the region of the deployment area where the sensor node is localized. Simulation results show that localization accuracy is improved by a minimum of 4% and by a maximum of 73% (average 30%), for varying node speeds when considering nodes with knowledge of at least three anchors. The coverage is also strongly affected by speed and its improvement ranges from 3% to 55% (average 22%). Finally, the processing time is reduced by 93% for a similar localization accuracy. 相似文献
15.
由于无线传感器网络具有其它网络不可比拟的各种优势,使得它在很多领域都有广泛的应用。对于无线传感器网络中的未知节点本身的定位工作是网络的各项应用的基础。本文主要分析无线传感器网络的节点定位技术,研究已有的定位算法,并根据现有算法提出一种改进的分布式的节点定位算法。该算法使用RSSI方法测距,无需增加新的硬件设备,通过分布式的算法来提高效率降低能耗,利用多次定位的平均值提高定位精度,降低了网络中的能量消耗,延长网络寿命。 相似文献
16.
An integrated communications framework for context aware continuous monitoring with body sensor networks 总被引:1,自引:0,他引:1
《Selected Areas in Communications, IEEE Journal on》2009,27(4):379-386
This paper deals with a wireless pervasive communication system to support advanced healthcare applications. The proposed system is based on an ad hoc interaction of mobile body sensor networks with independent wireless sensor networks already deployed within the environments in order to allow a continuous and context aware health monitoring for patients along their daily life scenarios with an unprecedented precision and flexibility of sensing. After an accurate protocol characterization, simulation results are provided, underlining remarkable performance with respect to existing solutions, for different mobility models and node density values. 相似文献
17.
18.
Qian Tan Wei An Yanni Han Haiyan Luo Yanwei Liu Song Ci Hui Tang 《Wireless Communications and Mobile Computing》2016,16(14):2083-2097
Recently, benefiting from rapid development of energy harvesting technologies, the research trend of wireless sensor networks has shifted from the battery‐powered network to the one that can harvest energy from ambient environments. In such networks, a proper use of harvested energy poses plenty of challenges caused by numerous influence factors and complex application environments. Although numerous works have been based on the energy status of sensor nodes, no work refers to the issue of minimizing the overall data transmission cost by adjusting transmission power of nodes in energy‐harvesting wireless sensor networks. In this paper, we consider the optimization problem of deriving the energy‐neutral minimum cost paths between the source nodes and the sink node. By introducing the concept of energy‐neutral operation, we first propose a polynomial‐time optimal algorithm for finding the optimal path from a single source to the sink by adjusting the transmission powers. Based on the work earlier, another polynomial‐time algorithm is further proposed for finding the approximated optimal paths from multiple sources to the sink node. Also, we analyze the network capacity and present a near‐optimal algorithm based on the Ford–Fulkerson algorithm for approaching the maximum flow in the given network. We have validated our algorithms by various numerical results in terms of path capacity, least energy of nodes, energy ratio, and path cost. Simulation results show that the proposed algorithms achieve significant performance enhancements over existing schemes. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
19.
A distributed node localization scheme for wireless sensor networks (WSNs) is presented in this paper, and it includes three
generic phases: (1) determine node-beacon distances, (2) compute node positions, and (3) refine the positions. Different from
previous researches, we propose an algorithm combination Min–max + LI for the position derivation and SD method for the refinement
in our scheme. Simulation shows that our proposed scheme can perform more robust than some representative distributed node
localization schemes presented in previous researches in terms of the trade-off among accuracy, coverage, computation cost,
and communication overhead. 相似文献