共查询到17条相似文献，搜索用时 203 毫秒
1.
结合身份密码体制,提出了一个基于身份和地理位置信息的异构传感器网络(HSN)节点间的双向认证及密钥协商方案。不同性能节点之间采用不同的协议完成身份认证和密钥建立,充分发挥了高性能节点的能力,降低了低性能节点的能耗。该方案具有完美前向保密性和主密钥前向保密性,具有较好的抗节点伪造、节点复制和女巫攻击能力。分析与仿真表明,该方案具有较好的安全性。 相似文献
2.
将可信赖平台模块(TPM)芯片引入车载自组织网VANET,提出了一种有效保护地理位置信息路由协议GPSR(贪婪周边无状态路由协议)的可信安全机制,从而能够防止恶意篡改路由协议和邻居位置信息表的行为。在NS2.30下对网络真实场景进行了模拟,证实此可信安全路由协议模型是正确的、有效的和合理的。 相似文献
3.
随着空间通信的发展和卫星节点的增加,空间DTN网络中卫星节点之间的路由的重要性日益明显,大量复杂的卫星网络路由方案相继提出。针对空间DTN网络具有规律性与可预见性,研究了基于卫星节点运动接触规律 (CGR)路由协议。在ONE仿真实验平台下,对真实卫星网络场景进行了仿真实验,并对比了CGR、Epidemic与Prophet路由协议的性能。实验结果表明,相比于Epidemic与Prophet,CGR在消息交付率、平均延时和网络开销比等方面的性能优越。 相似文献
4.
给出了异构传感器网络(HSN)节点异构和网络异构的定义,分析了HSN中的异构性因素。对HSN中的物理因素和密钥管理协议进行了细粒度的刻画,提出了一种多维度的HSN密钥管理框架模型,为进一步研究密钥管理协议提供结构支撑。仿真分析验证了模型的正确性和有效性。 相似文献
5.
《武汉大学学报(信息科学版)》2010,(11)
在介绍Montgomery型椭圆曲线密码体制的基础上,结合Montgomery型椭圆曲线标量乘的快速性和基于证书的ECDH椭圆曲线密钥交换协议的双向性等特性,提出了一种基于Montgomery型椭圆曲线密码体制的遥感图像加解密方法。实验仿真分析表明,该算法提高了对于海量遥感数据的加解密速度,增强了明文嵌入编码的安全性,实现了通信双方的双向认证,可为海量遥感数据的加解密提供有效的算法支持。 相似文献
6.
针对现有随机密钥预分配方案中不同节点间能够建立相同共享密钥的不足,提出了一种基于多项式的异构无线传感器网络密钥预分配方案.从网络连通性、节点内存需求和安全性等方面对方案进行性能评价和模拟仿真.结果表明,本方案能够有效地提高网络的连通性,减小节点所需的存储空间,并增强网络抗攻击能力. 相似文献
7.
将信任理论引入到路由网络,综合路由实体的安全接入与可靠路由,提出了一种路由模型.该模型以静态可信接入为出发点,通过对路由实体之间的交互行为进行分析,参照复杂网络理论.评估路由实体的接入所带来的网络安全风险及网络增益,对信任关系进行量化,进一步提出了信任度的可靠洪泛算法.同时,提出了一种基于最小信任路由熵的路由算法.该算法能够有效规避信任度低的路由节点,同时兼顾了路由效率. 相似文献
8.
对Ohnishi等提出的长距离联系方法进行了改进,提出了一种基于空间格网划分的超级节点LRC路由方法,该方法只对格网中的超级节点建立同行和同列的LRC链接,路由主要通过超级节点完成。实验证明,该方法在保持路由效率的同时,大大地降低了节点的度,同时也增强了系统的稳定性。 相似文献
9.
能量有效的无线传感器网络安全拓扑控制协议 总被引：1，自引：0，他引：1
节能和安全是无线传感器网络应用中的一对矛盾需求,为调和这对矛盾,提出了一种能量有效的无线传感器网络安全拓扑控制协议(energy-efficient secure topology control protocol,ESTCP).ESTCP首先根据节点地理位置形成结构化的网格拓扑;其次,通过单向哈希密钥链技术和对称密钥认证技术控制新节点在不同情形下的安全加入,通过新节点间形成临时簇减少因认证新节点带来的能量损耗.分析和仿真表明,ES-TCP在较少的资源开销下有效保证了拓扑控制的安全性. 相似文献
10.
根据位置服务信息,采用道路内微观路由和道路间宏观路由相结合的路由方案(MiMa),引入Dijk-stra优化算法为节点间通信提供一条具有导向功能的最佳路由。实验结果表明,该路由协议提高了数据包投递率,降低了数据端到端的传输延迟。 相似文献
11.
HONG Liang HONG Fan FU Cai 《地球空间信息科学学报》2006,9(3):229-233
IntroductionIn a multihop wireless ad hoc Network, mobilenodes cooperate to form a Network without u-sing any infrastructure such as access points orbase stations .Instead,the mobile nodes forwardpackets for each other ,allowing communicationamong nodes o… 相似文献
12.
The problem of finding the least-cost path from a source point to a destination point can be dealt with by routing across a continuous surface or routing along a discrete network. The solutions within these two contexts are linked to the use of a raster- or a vector-based least-cost path algorithm. This study presents a technique which integrates raster- and vector-based least-cost path algorithms for determining the least-cost path across a continuous raster surface with discrete vector networks. The technique incorporates ancillary vector data sets that are required to examine the travel cost at each link, connections between nodes, and the representation of intersecting links in the discrete vector network into raster-based least-cost path analysis. The integrated technique presented here is applicable to all-terrain vehicle navigation where a continuous raster surface and discrete vector networks need to be considered simultaneously in order to find least-cost paths. This paper describes the concept behind, and details of, the integrated technique. Applications of the technique with synthetic and real-world data sets are also presented. They provide proof that the technique is effective in finding least-cost paths across a continuous raster surface with discrete vector networks. 相似文献
13.
OLSR (optimal link state routing) is one of the four basic routing protocols used in mobile ad hoc Networks by the MANET working group of IETF (Internet engineering task force). OLSR, a proactive routing protocol, is based on a multipoint relaying flooding technique to reduce the number of topology broadcast. OLSR uses periodic HELLO packets to neighbor detection. As introduced in Reference [1], the wormhole attack can form a serious threat in wireless Networks, especially against many ad hoc Network routing protocols and location-based wireless security systems. Here, a trust model to handle this attack in OLSR is provided and simulated in NS2. 相似文献
14.
Most prior multimodal transport networks have been organized as relational databases with multilayer structures to support transport management and routing; however, database expandability and update efficiency in new networks and timetables are low due to the strict database schemas. This study aimed to develop multimodal transport networks using a graph database that can accommodate efficient updates and extensions, high relation-based query performance, and flexible integration in multimodal routing. As a case study, a database was constructed for London transport networks, and routing tests were performed under various conditions. The constructed multimodal graph database showed stable performance in processing iterative queries, and efficient multi-stop routing was particularly enhanced. By applying the proposed framework, databases for multimodal routing can be readily constructed for other regions, while enabling responses to diversified routings, such as personalized routing through integration with various unstructured information, due to the flexible schema of the graph database. 相似文献
15.
探讨了下一代卫星网络中关键技术的研究进展,主要包括路由策略、传输协议、移动性管理与QoS模型等几个方面,并对下一代卫星网络的研究热点和前景进行了总结和展望。 相似文献
16.
Yong Ge Xitao Xing Qiuming Cheng 《International Journal of Applied Earth Observation and Geoinformation》2010
Society relies greatly upon infrastructure networks that are highly interconnected and mutually dependent in complex ways. Simulation and modeling assist in dealing with the complexity of infrastructure networks, especially in the effective response and management of resources for rescue, recovery, and restoration. This paper introduces the Petri net into a geographical information system to develop the GeoPetri Net system, which can be used to simulate the complex geographical relationships among places and nodes. Unlike the ordinary Petri net, the GeoPetri Net deals with places and nodes with geographical locations and the geographical relationships between these nodes and records the statuses of nodes to produce simulated events. A case study involving an education layer with 15 nodes (schools) and a transportation layer with 25 node lines (streets) in a geographical information system is presented to substantiate the above conceptual arguments. 相似文献
17.
Network transport is an important aspect of geographical information science, transportation, complex networks, etc. Previous studies have shown that the transport capacity of street networks can be enhanced by improving routing algorithms. However, the upper throughput limit of street networks is unknown in detail. This article studies the transport process of networks and finds that any connected network has a maximum throughput depending on the topological and structural properties of the network. Based on this, the maximum throughput of street networks is obtained. Experiments show that when the street network remains unchanged, the maximum throughput of the street network is limited and is dependent on road capacity and average path length, regardless of adopted routing algorithms. Our findings suggest that the throughput of networks can be improved by increasing node capacity or decreasing average path length, but the maximum transport capacity of the network cannot be greater than the ratio of the sum of all the nodes' capacities to the average path length of the network, no matter what routing strategies are adopted. This study is expected to be a starting point for more sophisticated research in network transport, such as evaluating the inherent throughput of an urban street network. 相似文献