共查询到18条相似文献,搜索用时 156 毫秒
1.
2.
3.
4.
基于密钥预置技术,提出了一种新的传感器网络动态对偶密钥建立算法。在该算法中,节点在部署前首先被预置一个全局初始密钥,在部署之后,邻节点之间将基于预置的全局初始密钥来动态生成一跳的对偶密钥。理论分析与实验结果表明,与已有基于随机方法的传感器网络对偶密钥建立算法相比,新算法具有更好的直接和间接对偶密钥建立概率。 相似文献
5.
6.
7.
周鹏 《计算机工程与设计》2009,30(8)
针对管道流量泄漏和管网突发性的爆管,将动态密钥路径的实现应用于管道流量泄漏监测中,对偶密钥技术的采用使无线传感器网络通信的安全性得到保障,而对偶密钥中的动态密钥路径的应用进一步提高无线传感器网络通信的可靠性.提出了动态密钥预分配方案及预置算法,导出了基于弱连通性的簇内动态密钥路径实施过程及其算法分析.sBIBD模型算法较好地预测网络阻塞现象,自适应实时调整网络传输速率和减少网络数据损失率.该算法具有良好可靠性和高效性,以保证在管道泄漏监测网络中获得更优的链路利用率、TCP友好性以及减少链路丢包率,是一种适合无线传感器网络安全可靠的具有实用价值的算法. 相似文献
8.
9.
对偶密钥建立的有效性和安全性的折衷平衡是研究传感器网络中对偶密钥管理问题的焦点.提出了基于扩环矩阵向量预置的密钥建立算法以及相应的节点自学习算法.仿真实验表明我们的算法不仅取得了与MSKPD方案非常接近的抗毁损性能,而且在同样的预置和部署条件下,具有更高的密钥连通度. 相似文献
10.
针对异构无线传感器网络,提出一种混合密钥预分配方案。该方案针对异构节点采用不同密钥预分配策略:高级节点采用基于身份的公钥密码机制进行节点间的认证和密钥协商;普通节点主要采用基于单向散列链的随机密钥预分配策略,在高级节点的辅助下进行对偶密钥的建立。在对偶密钥建立过程中,采用共享密钥发现和密钥协商相结合的方法,充分发挥公钥密码机制和随机密钥预分配策略的优势,达到较好的安全连通性和抗毁性。理论分析和仿真试验结果证明方案的可用性和安全性。 相似文献
11.
《Computer Networks》2007,51(4):1169-1182
Pairwise key establishment in mobile ad hoc networks allows any pair of nodes to agree upon a shared key. This is an important security service needed to secure routing protocols, and in general to facilitate secure communication among the nodes of the network.We present two self-keying mechanisms for pairwise key establishment in mobile ad hoc networks which do not require any centralized support. The mechanisms are built using the well-known technique of threshold secret sharing, and are robust and secure against a collusion of up to a certain number of nodes. We evaluate and compare the performance of both the mechanisms in terms of the node admission and pairwise key establishment. 相似文献
12.
针对移动机器人路径规划采用的概率路图(Probabilistic Roadmap,PRM)算法存在路径拐点过多以及部分转角过陡的问题,提出一种PRM路径优化方法。PRM算法在构建路径网络图时采用随机采样,路径并非最优,路径节点过多,使用Douglas-Peucker(D-P)算法提取PRM算法生成初始路径节点中的关键节点,用关键节点代替原来的初始路径节点,以减少路径中拐点的个数。使用Clothoid曲线对新生成的路径进行平滑处理,达到路径优化的目的。仿真结果表明该优化方法能减少路径节点的个数,并使路径更加平滑。 相似文献
13.
一种计算因特网AS拓扑的最短路径的快速算法 总被引:1,自引:1,他引:1
最短路径是因特网AS(autonomous system)拓扑的一个重要特征,AS间的路由路径一般是AS之间的最短路径.因特网服务提供商之间复杂的商业关系导致AS之间存在复杂的路由关系,从而影响AS路由路径的选择,因此在计算AS拓扑中最短路径时需要考虑AS间的路由关系.提出了一种计算AS拓扑中最短路径的算法,算法基于无向图的宽度优先最短路径算法,时间复杂度为O(nm),这里n和m分别为拓扑图中节点和边的个数.通过实验发现,与现有的计算AS拓扑最短路径的时间复杂度为O(n3)的算法相比,该算法在实现同样精确度的前提下大幅缩短了计算时间. 相似文献
14.
Boqing Zhou Sujun Li Qiaoliang Li Xingming Sun Xiaoming Wang 《Computer Communications》2009,32(1):124-133
Pairwise key establishment is a fundamental security service for sensor networks. However, establishing pairwise key in sensor networks is a challenging problem, particularly due to the resource constraints on sensor nodes and the threat of node compromises. On the other hand, adding new nodes to a sensor network is a fundamental requirement for their continuous operation over time, too. We analyze the weaknesses of security due to node capture when adding sensor nodes using key pre-distribution schemes with “fixed” key pools. In this paper, we propose a new approach, which separates the nodes into groups, the nodes in a group communicate with each other using pairwise keys pre-distributed, the communications between any two neighbor groups are accomplished also through pairwise keys, which is computed based on the pre-distributed Hash chain. We show that the performance (e.g. continuous connectivity, continuous network resilience against node capture and memory usage) of sensor networks can be substantially improved by using our scheme. The scheme and its detailed performance evaluation are presented. 相似文献
15.
《Journal of Systems Architecture》2000,46(2):201-205
We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a non-faulty hypercube. The number of faulty nodes and links may be rather large and if any path between the nodes exists, the developed algorithm determines it. To construct this algorithm, some properties of the cube algebra are considered and some transformations based on this algebra are developed. 相似文献
16.
《Journal of Parallel and Distributed Computing》1994,22(2):216-228
In this paper the properties of paths in a star graph are investigated through the analysis of the corresponding star transposition tree. The general algebraic expression for all shortest paths between any two nodes (routing function) is found, and it is shown that every shortest path consists of a number of subpaths which can be combined in an arbitrary order or even mutually nested. Further, due to the known routing function the deadlock problem is solved using the method of virtual channels. A minimal deterministic routing algorithm is developed which recognizes the structure of the path by extracting subpaths and allows optimal adaptive management of virtual channels. Finally, based on the sufficient number of virtual channels, the minimal fully adaptive routing algorithm is suggested which offers an opportunity to reroute the message a number of times, while maintaining the shortest path between two nodes. 相似文献
17.
由于传感器节点部署的随机性、以及网络规模迥异的特点,已有的对偶密钥建立机制可能使得网络中出现若干个孤立的连通集团。在提出基于多点认证的信任模型上,分析了可能使得集团互联的一类关键节点的性质。仿真结果表明,通过关键节点间的对偶密钥建立协议,与传统的建立过程相比,在取得相近抗妥协性能的前提下,能够有效地实现孤立集团间的互联。 相似文献
18.
本文对C.S.Raghavendra等人提出的最佳双环网,给出了无故障情况下的最佳路由算法(NCR)和故障情况下的容错算法(FTR),且FTR在网络同时出现故障的结点数小于3时,保证信息沿最短路径传输. 相似文献