共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
Two-Tier,Scalable and Highly Resilient Key Predistribution Scheme for Location-Aware Wireless Sensor Network Deployments 总被引:1,自引:0,他引:1
We propose a probabilistic key predistribution scheme for wireless sensor networks, where keying materials are distributed
to sensor nodes for secure communication. We use a two-tier approach in which there are two types of nodes: regular nodes
and agent nodes. Agent nodes are more capable than regular nodes. Our node deployment model is zone-based such that the nodes
that may end up with closer positions on ground are grouped together. The keying material of nodes that belong to different
zones is non-overlapping. However, it is still possible for nodes that belong to different zones to communicate with each
other via agent nodes when needed. We give a comparative analysis of our scheme through simulations and show that our scheme
provides good connectivity figures at reasonable communication cost by using minimal flooding in key distribution. Moreover,
we show that our scheme is scalable such that no extra overhead in incurred in case of increased number of nodes and sensor
field size. Most importantly, simulation results show that our scheme is highly resilient to node captures. 相似文献
4.
Marcela Mejia Néstor Peña Jose L. Muñoz Oscar Esparza Marco Alzate 《Ad hoc Networks》2012,10(7):1379-1398
The scarce resources of a mobile ad hoc network (MANET) should not be wasted attending selfish nodes (those nodes that use resources from other nodes to send their own packets, without offering their own resources to forward other nodes’ packets). Thus, rational nodes (those nodes willing to cooperate if deemed worthy) must detect and isolate selfish nodes in order to cooperate only among themselves. To achieve this purpose, in this paper we present a new game theoretic trust model called DECADE (Distributed Emergent Cooperation through ADaptive Evolution). The design of DECADE is shown by first, analyzing a simple case of packet forwarding between two nodes, and then the results are extended to bigger networks. In DECADE, each node seeks individually to maximize its chance to deliver successfully their own packets, so that the cooperation among rational nodes and the isolation of selfish nodes appear as an emergent collective behavior. This behavior emerges as long as there is a highly dynamic interaction among nodes. So, for those cases where the mobility alone does not suffice to provide this interaction, DECADE includes a sociability parameter that encourages nodes to interact among them for faster learning and adaptability. Additionally, DECADE introduces very low overhead on computational and communication resources, achieving close to optimal cooperation levels among rational nodes and almost complete isolation of selfish nodes. 相似文献
5.
In this paper, we present two intrusion detection techniques for mobile ad-hoc networks, which use collaborative efforts of nodes in a neighborhood to detect a malicious node in that neighborhood. The first technique is designed for detection of malicious nodes in a neighborhood of nodes in which each pair of nodes in the neighborhood are within radio range of each other. Such a neighborhood of nodes is known as a clique [12]. The second technique is designed for detection of malicious nodes in a neighborhood of nodes, in which each pair of nodes may not be in radio range of each other but where there is a node among them which has all the other nodes in its one-hop vicinity. This neighborhood is identical to a cluster as mentioned in [12]. Both techniques use message passing between the nodes. A node called the monitor node initiates the detection process. Based on the messages that it receives during the detection process, each node determines the nodes it suspects to be malicious and send votes to the monitor node. The monitor node upon inspecting the votes determines the malicious nodes from among the suspected nodes. Our intrusion detection system is independent of any routing protocol. We give the proof of correctness of the first algorithm, which shows that it correctly detects the malicious nodes always when there is no message loss. We also show with the help of simulations that both the algorithms give good performance even when there are message losses arising due to unreliable channel. 相似文献
6.
针对Bounding Box算法定位误差大、覆盖率低的缺点,提出了一种采用虚拟锚节点策略的改进定位算法。首先未知节点利用其通信范围内的锚节点进行定位;其次,已定位的节点根据升级策略有选择性的升级为虚拟锚节点;最后,无法定位的节点利用虚拟锚节点实现定位。另外,在离散网络模型的基础上,通过建立双半径网络节点模型从而进一步约束了未知节点的位置。理论分析及仿真结果均表明,该算法在显著提高定位覆盖率的同时,有效地提高了定位精度。 相似文献
7.
针对网络撕裂方法诊断模拟电路故障过程中撕裂节点必须是可及节点的限制,提出了虚拟可及测试节点的方法.利用网络拓扑结构和基尔霍夫电流定律计算一类不可及测试节点故障电压,让其成为虚拟可及测试节点.然后在可及或虚拟可及测试节点对网络进行撕裂,再根据故障电压和故障判据定位故障至更小的区域,从而进一步定位故障元件.这种新方法降低了待诊断电路中对可及节点数目的要求,增加了撕裂的灵活性.通过仿真实例验证了该方法的有效性. 相似文献
8.
机会网络是一种不需要在源节点和目的节点之间存在完整路径,利用节点移动带来的相遇机会实现网络通信的延迟容忍自组织网络,它以“存储-携带-处理-转发”的模式进行.为实现互不相交簇间的信息传输,本文设计了一种带阈值的簇移动模型CMMT,并提出了一种基于摆渡(Ferry)节点与簇节点协作的路由算法(CBSW).该算法减少了冗余的通信和存储开销,以及在Spray阶段簇节点没有遇到目的节点或摆渡节点,进入Wait阶段携带消息的节点采用直接分发方式只向目的节点传输等问题.仿真实验表明,CBSW算法能够增加传输成功率,减少网络开销和传输延迟. 相似文献
9.
Geolocalization of nodes in a wireless sensor network is a process that allows location-unaware nodes to discover their spatial coordinates. This process requires the cooperation of all the nodes in the system. Ensuring the correctness of the process, especially in the presence of misbehaving nodes, is crucial for ensuring the integrity of the system. We analyze the problem of location-unaware nodes determining their location in the presence of misbehaving neighboring nodes that provide false data during the execution of the process. We divide and present potential misbehaving nodes in four different adversary models, based on their capacities. We provide algorithms that enable the location-unaware nodes to determine their coordinates in the presence of these adversaries. The algorithms always work for a given number of neighbors provided that the number of misbehaving nodes is below a certain threshold, which is determined for each adversary model. 相似文献
10.
11.
多标签分类在基因分类,药物发现和文本分类等实际问题中有着广泛的应用.已存在的多标签分类算法,通常都是从网络中随机的选取节点作为训练集.然而,在分类算法执行的过程中,网络中不同节点所起的作用不同.在给定训练集数目的情况下,选择的训练集不同,分类精度也会不同.所以我们引入了种子节点的概念,标签分类从种子节点开始,经过不断推理,得到网络中其他所有节点的标签.本文提出了SHDA(Nodes Selection of High Degree from Each Affiliation)算法,即从网络的每个社团中,按比例的选取度数较大的节点,然后将其合并,处理后得到种子节点.真实数据集上的实验表明,将种子节点用作训练集进行多标签分类,能够提升网络环境下多标签分类的准确率. 相似文献
12.
DSR路由协议中很多相邻节点的"路由应答"无法到达源节点,因此向这些节点广播"路由请求"产生了不必要的耗费.如果选择相对于源节点移动性较弱的相邻节点进行"路由请求",则可比较稳定地获得"路由应答".仿真结果显示,改进后的DSR(M-DSR)路由协议在路由发现时间、路由长度、路由错误、传播路由请求、路由应答等方面的性能较DSR路由协议有明显的改进. 相似文献
13.
14.
15.
16.
17.
WANG Hwang-cheng 《中国邮电高校学报(英文版)》2011,18(1):49-59
Energy efficiency sleep scheduling in wireless sensor networks is one of the most crucial technologies.In this paper,we propose a simple and feasible synchronous node sleeping and waking mechanisms for small scale wireless sensor networks.Sensor nodes are divided into forwarding nodes and listening nodes.Beacon frame containing sleep command from the coordinator can be forwarded to listening nodes via forwarding nodes.All the nodes in the network can enter sleep at about the same time.Through such network s... 相似文献
18.
本文提出了基于父节点的XML查询优化算法,它主要利用关键词的顺序循环查找父节点,把查找出来的父节点集合求交集,所得的父节点交集集合中的元素即为最小子树根节点,最后根据所得出的最小子树根节点得到用户所需的最紧致片段。通过选取经典的INEX数据集算法进行测试。实验结果表明,与传统的XML查询优化算法相比,基于父节点的XML查询优化算法有较高的准确率,更能满足用户需求。 相似文献
19.
Achieving high accuracy with minimum reference nodes, anchor nodes, and computation and communication costs is a goal for the localization in wireless sensor networks. Targeting at this goal, a localization scheme called concentric distributed localization with the tripodal anchor structure and grid scan (CDL-TAGS) requiring two reference nodes and a few anchor nodes is proposed in this paper. Under the precondition that the system has randomly distributed normal sensor nodes, a tripodal anchor structure is first designed. With this structure, the localization process is started from the centroid node and then stretched outward to the farthest normal nodes. Based on the two best reference nodes, a virtual point is generated to serve as the third reference node. In the CDL-TAGS scheme, a grid scan algorithm is employed to estimate the position of a normal node. Finally, we show that the communication overhead and time and space complexities among sensor nodes for CDL-TAGS can be kept at a low level. In addition, CDL-TAGS can achieve better accuracy with minimum anchor nodes as compared to some closely related localization schemes in the literature through simulation results. 相似文献