共查询到19条相似文献,搜索用时 93 毫秒
1.
2.
3.
4.
5.
6.
7.
无线传感器网络(WSN)的许多应用都是基于节点的位置信息.本文从WSN的基于测距的定位算法和无需测距的定位算法对其定位算法进行详细的说明.并分析比较各定位算法的优缺点.最后还指出了WSN的自身定位问题的研究方向. 相似文献
8.
9.
研究无线传感器网络节点定位的方法。首先介绍了节点定位的基本原理,在总结节点定位原理的基础上,对节点定位方法的分类依据进行了归纳。在对无线传感器网络节点定位方法的研究中,主要对是否基于测距的节点定位方法进行具体分析,介绍了2种类型的定位方法的基本原理,并对2种类型的定位方法中的典型算法做了具体说明,最后介绍了定位算法的评价标准。 相似文献
10.
11.
Jun-Won HoAuthor Vitae Matthew WrightAuthor VitaeSajal K. DasAuthor Vitae 《Ad hoc Networks》2012,10(3):512-523
In wireless sensor networks, sensor nodes are usually fixed to their locations after deployment. However, an attacker who compromises a subset of the nodes does not need to abide by the same limitation. If the attacker moves his compromised nodes to multiple locations in the network, such as by employing simple robotic platforms or moving the nodes by hand, he can evade schemes that attempt to use location to find the source of attacks. In performing DDoS and false data injection attacks, he takes advantage of diversifying the attack paths with mobile malicious nodes to prevent network-level defenses. For attacks that disrupt or undermine network protocols like routing and clustering, moving the misbehaving nodes prevents them from being easily identified and blocked. Thus, mobile malicious node attacks are very dangerous and need to be detected as soon as possible to minimize the damage they can cause. In this paper, we are the first to identify the problem of mobile malicious node attacks, and we describe the limitations of various naive measures that might be used to stop them. To overcome these limitations, we propose a scheme for distributed detection of mobile malicious node attacks in static sensor networks. The key idea of this scheme is to apply sequential hypothesis testing to discover nodes that are silent for unusually many time periods—such nodes are likely to be moving—and block them from communicating. By performing all detection and blocking locally, we keep energy consumption overhead to a minimum and keep the cost of false positives low. Through analysis and simulation, we show that our proposed scheme achieves fast, effective, and robust mobile malicious node detection capability with reasonable overhead. 相似文献
12.
The aim of wireless sensor networks (WSNs) is to gather sensor data from a monitored environment. However, the collected or reported information might be falsified by faults or malicious nodes. Hence, identifying malicious nodes in an effective and timely manner is essential for the network to function properly and reliably. Maliciously behaving nodes are usually detected and isolated by reputation and trust‐based schemes before they can damage the network. In this paper, we propose an efficient weighted trust‐based malicious node detection (WT‐MND) scheme that can detect malicious nodes in a clustered WSN. The node behaviors are realistically treated by accounting for false‐positive and false‐negative instances. The simulation results confirm the timely identification and isolation of maliciously behaving nodes by the WT‐MND scheme. The effectiveness of the proposed scheme is afforded by the adaptive trust‐update process, which implicitly performs trust recovery of temporarily malfunctioning nodes and computes a different trust‐update factor for each node depending on its behavior. The proposed scheme is more effective and scalable than the related schemes in the literature, as evidenced by its higher detection ratio (DR) and lower misdetection ratio (MDR), which only slightly vary with the network's size. Moreover, the scheme sustains its efficient characteristics without significant power consumption overheads. 相似文献
13.
为了有效抵制女巫攻击,在攻击存在的情况下提高无线传感器网络节点的定位精度,分析、总结了女巫攻击所固有的薄弱环节,提出了基于接收功率验证的检测女巫攻击的节点安全定位方法。检测机制分为两步,首先检测节点通过比较接收功率,从所接收的全部信标节点中选择出距其距离相同的信标节点,列为可疑Sybil节点,然后通过邻居节点间的信息交互和距离验证,最终检测出攻击节点,利用去除了Sybil节点的信标节点集合实现定位。仿真实验显示,当存在攻击时,检测成功概率能达到95%以上,定位精度提高了9~11.64 m,表明该方法能有效检测女巫攻击,实现节点安全定位。 相似文献
14.
Tisan Das Pabitra Mohan Khilar Rakesh Ranjan Swain 《International Journal of Communication Systems》2020,33(3)
Recent advancement in wireless sensor network has contributed greatly to the emerging of low‐cost, low‐powered sensor nodes. Even though deployment of large‐scale wireless sensor network became easier, as the power consumption rate of individual sensor nodes is restricted to prolong the battery lifetime of sensor nodes, hence the heavy computation capability is also restricted. Localization of an individual sensor node in a large‐scale geographic area is an integral part of collecting information captured by the sensor network. The Global Positioning System (GPS) is one of the most popular methods of localization of mobile terminals; however, the use of this technology in wireless sensor node greatly depletes battery life. Therefore, a novel idea is coined to use few GPS‐enabled sensor nodes, also known as anchor nodes, in the wireless sensor network in a well‐distributed manner. Distances between anchor nodes are measured, and various localization techniques utilize this information. A novel localization scheme Intersecting Chord‐Based Geometric Localization Scheme (ICBGLS) is proposed here, which loosely follows geometric constraint‐based algorithm. Simulation of the proposed scheme is carried out for various communication ranges, beacon broadcasting interval, and anchor node traversal techniques using Omnet++ framework along with INET framework. The performance of the proposed algorithm (ICBGLS), Ssu scheme, Xiao scheme, and Geometric Constraint‐Based (GCB) scheme is evaluated, and the result shows the fact that the proposed algorithm outperforms the existing localization algorithms in terms of average localization error. The proposed algorithm is executed in a real‐time indoor environment using Arduino Uno R3 and shows a significant reduction in average localization time than GCB scheme and similar to that of the SSU scheme and Xiao scheme. 相似文献
15.
16.
17.
18.
This article deals with the impact of malicious servers over different trust and reputation models in wireless sensor networks. First, we analysed the five trust and reputation models, namely BTRM-WSN, Eigen trust, peer trust, power trust, linguistic fuzzy trust model. Further, we proposed wireless sensor network design for optimisation of these models. Finally, influence of malicious servers on the behaviour of above mentioned trust and reputation models is discussed. Statistical analysis has been carried out to prove the validity of our proposal. 相似文献
19.
Jang‐Ping Sheu Chih‐Shun Hsu Yen‐Jung Chang 《Wireless Communications and Mobile Computing》2006,6(1):35-48
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. 相似文献