基于β分布的无线传感器网络信誉系统

无线传感器网络有其资源受限的特点，单靠密码学和认证无法阻止网络内部的恶意或非恶意攻击以及节点的异常行为。融合了密码学、经济学、统计学、数据分析等相关领域的工具来建立可信的无线传感器网络，提出了一种无线传感器网络的信誉模型。其基本思想是网络中的各节点保存其他节点的信誉，并以此来计算其他节点的可信度。模型中引用了贝叶斯公式来表示、更新和整合信誉，设计了一个基于β分布的无线传感器网络信誉系统。     

无线传感器网络中基于节点行为和身份的可信认证

针对无线传感器网络(WSN)开放性和资源受限导致易受外部和内部攻击以及节点失效等问题,提出了一种高效、安全的可信节点间身份认证方案。方案采用基于身份和双线性对理论实现认证密钥协商与更新,通过基于Beta分布的节点行为信誉的管理计算其信任度,利用信任度识别节点是否可信并采用对称密码体制结合信息认证码实现可信节点间认证。方案不仅能防范窃听、注入、重放、拒绝服务等多种外部攻击,而且能够抵御选择性转发、Wormhole攻击、Sinkhole攻击和女巫攻击等内部威胁。与SPINS方案相比,所提方案在同一网络环境下有较长的网络生命期、较小的认证时延、更高的安全性及可扩展性,在无人值守安全性要求较高的WSN领域具有较好的应用价值。     

基于Dirichlet分布的无线传感器网络的信誉计算模型研究

提出了基于无线传感器网络的信任评估框架,在该框架中,分为检测模块和信誉模块两部分,其中检测模块用于检测各节点测量的数据的异常程度,并根据此异常程度将节点行为分为三大类;在信誉模块中,建立基于Dirichlet分布的信誉函数,计算节点的可信度及不确定度,并实时地利用新获得的数据对信誉进行更新;根据其他节点的信誉进行整合信誉,加快了收敛速度.仿真的结果表明,该模型可以检测出多种错误节点,并且与传统的基于β-分布的信誉模型相比,更加适合于无线传感器网络.     

基于二项分布的无线传感器网络信任管理系统

由于无线传感器网络不同于传统网络的特点,导致其很容易受到来自妥协节点的内部攻击。信任管理系统是防御无线传感器网络内部攻击的最有效方法。针对无线传感器网络节点信誉和信任的评估,我们改进了用于无线传感器网络的基于贝塔的信誉系统BRSN( Beta Reputation System for Sensor Networks),提出了基于二项分布的无线传感器网络信任评估系统BTMS( Binomial-based Trust Management System)。 BTMS基于对节点行为的监控,利用二项分布来描述节点信誉的分布,并进一步得到节点信任值,从而指导中继节点的选择,降低内部攻击的危害。实验结果表明,利用BTMS可以有效的防御来自妥协节点的内部攻击,提高网络安全性。     

基于零知识证明的安全认证方案

为满足无线传感器网络的安全认证需求,针对传统认证方案中可能遭受的重放、中间人攻击的问题,提出了一种基于零知识证明的安全认证方案。网络中的合法节点与请求认证的节点间运行零知识证明协议,根据请求者的回答来验证请求节点的身份。分析表明,敌手无法从认证中获取关于秘密的信息,方案可以抵抗重放,中间人和节点间的合谋攻击,在能耗上也较小,适合资源受限的无线传感器网络。     

WSN中一种高效鲁棒的对等认证方案

受Wacker A等人提出的基于P2P的大规模多用户虚拟环境中认证思想的启发,提出一种适用于无线传感器网络的高效鲁棒的对等认证方案。基于分布式信任模型,该方案通过分布式多节点表决方式保证公钥与私钥之间的对应关系,取代证书方式,避免了证书的颁发/更新、存储、索取等计算和通信开销,在提高公钥加密体制应用效率的同时还增强了系统的鲁棒性。形式化证明该方案是安全的。基于MICA2DOT无线传感器网络节点对方案的能量消耗进行了定量分析,结果表明该方案能很好地适用于资源受限的WSN环境。     

基于XTR的无线传感器网络认证机制

在无线传感器网络中,新节点或新用户接入网络时必须要进行认证,防止恶意节点和非法用户侵入网络,以确保网络安全;本文提出了一种基于XTR(Efficient and Compact Subgroup Trace Representation,有效的、紧致的子群迹表示)公钥密码体制的分布式认证机制;利用XTR公钥密码体制,通过协商生成会话密钥,分别对传感器网络中的本地节点和远端节点进行认证,该认证无需节点与基站直接通信,避免了单点攻击和复杂的通信转发过程,方案简单有效,认证过程具有较低的计算与通信代价,便于在实际应用系统中得到实现.     

WSN中一种防御广播认证中的DoS攻击策略

当将数字签名应用到广播认证时,网络很容易受到DoS( Denial of Service)攻击,比如攻击者不停地广播虚假数据包从而消耗网络的通信资源和计算资源.针对这种情况,提出一种基于弱认证和信誉等级的协议来防御此类DoS攻击.该协议针对分簇的无线传感器网络模型,利用中国剩余定理和单向函数来完成弱认证,同时还引入信誉...     

一种无线传感器网络用户认证与密钥协商协议

随着无线传感器网络的发展,外部用户可以直接访问传感器内部节点获取信息,因此如何认证外部用户的身份,只允许授权用户获取节点数据,保证传输数据的保密性和完整性,已成为当前无线传感器网络研究的热点问题.本文基于用户口令和智能卡提出一个无线传感器网络用户认证与密钥协商协议,协议中采用哈希和异或运算实现主体的身份认证和密钥协商功能.为了分析协议的安全性,本文扩展了串空间理论,构造了分析无线传感器网络认证与密钥协商协议的形式化方法,证明了协议的安全性.最后,文中分析了协议的执行效率,并与同类协议进行了比较.     

基于TePA的无线传感器网络安全方案

针对无线传感器网络的安全需求, 结合TePA技术提出了一种基于TePA的无线传感器网络安全方案。该方案简化了TePA技术的身份认证分组和分组字段, 解决了无线传感器网络在传感器节点接入和密钥协商的问题。采用改进的BSW逻辑验证了协议, 并从协议安全性和网络性能方面分析了方案, 结果表明方案能抵抗中间人攻击和重放攻击, 并适合无线传感器网络。     

无线传感网络中基于无线能量补给的能量感知路由算法

针对无线传感网络中随机分布传感器节点能量消耗不均衡的问题,提出了一种基于无线能量补给的能量感知路由算法。休眠节点不仅可以在无线携能通信(Simultaneous Wireless Information and Power Transfer,SWIPT)传输方式下通过功率分割方法进行无线能量补给,还可以在信息传输方式下通过无线能量收集方法进行能量补给,重新进入活跃状态,为信息传播提供更好的路由,提高传感器节点的能量利用,延长传感网络的使用寿命。在该算法中,通过优化节点间的信息和能量分配,最小化传输功率,引入能量路由度量方法,选择能耗最小的路径作为传输路径。仿真结果表明,本文提出的算法可以有效地利用节点资源,均衡多跳能量受限无线传感器网络中的能量分布。     

无线传感器网络中基于效用的节点合作机制

在无线传感器网络中,由于能量和资源有限,不是每个节点都愿意为邻节点提供转发服务。讨论了无线传感器网络中自私节点的问题,提出了一个博弈模型,设计了一个基于节点信誉和能量的效用函数来监测恶意节点和自私节点,并鼓励节点中有更多的合作。在所提算法中,每个节点维护有邻节点的信誉表,参与转发的节点可以获得信誉作为奖励,而表现自私的节点则会丢失信誉作为惩罚。同时,转发会消耗节点能量,节点的信誉值和剩余能量必须都大于阈值才能在网络中共存。这样,恶意节点最终会被排除网络,自私节点则可以在激励下通过调整转发概率来避免被孤立。     

自认证公钥的无线传感器网络密钥协商协议

自认证公钥密码不需要证书管理,不存在密钥托管问题,非常适用于资源受限的无线传感器网络.但现有的自认证公钥传感网密钥协商协议存在安全性低和能量消耗大的缺点.首先分析并指出Yoon等人提出的协议不能抵抗密钥泄漏伪装攻击;然后采用MTI协议族的"隐式认证"的思想,基于椭圆曲线Diffie-Hellman假设,设计了一个新的基于自认证公钥体制的认证密钥协商协议WSN-AKA.该协议是第1个可证明安全的传感器网络自认证公钥体制密钥协商协议.与现有协议相比,该协议不仅安全性更高,而且因其密钥协商只需两次消息传递,其通信效率也最高而能耗最少.     

基于无线传感器网络的门禁及定位系统

提出了一套基于无线传感器网络技术的门禁及定位解决方案,不仅实现了人员的考勤,也实现了人员及车辆的定位及跟踪等,并采用B／S模式进行远程信息查询,为不同层次用户提供了信息参考。     

Rule-based inference and decomposition for distributed in-network processing in wireless sensor networks

Wireless sensor networks are application specific and necessitate the development of specific network and information processing architectures that can meet the requirements of the applications involved. A common type of application for wireless sensor networks is the event-driven reactive application, which requires reactive actions to be taken in response to events. In such applications, the interest is in the higher-level information described by complex event patterns, not in the raw sensory data of individual nodes. Although the central processing of information produces the most accurate results, it is not an energy-efficient method because it requires a continuous flow of raw sensor readings over the network. As communication operations are the most expensive in terms of energy usage, the distributed processing of information is indispensable for viable deployments of applications in wireless sensor networks. This method not only helps in reducing the total amount of packets transmitted in the network and the total energy consumed by the sensor nodes, but also produces scalable and fault-tolerant networks. For this purpose, we present two schemes that distribute information processing to appropriate nodes in the network. These schemes use reactive rules, which express relations between event patterns and actions, in order to capture reactive behavior. We also share the results of the performance of our algorithms and the simulations based on our approach that show the success of our methods in decreasing network traffic while still realizing the desired functionality.     

A new dynamic hierarchical reputation evaluation scheme for hybrid wireless mesh networks

A hybrid wireless mesh network has the advantage of a flexible infrastructure but is vulnerable to attacks. Traditional reputation schemes are common approaches to address security, but they are not suitable for direct application to hybrid wireless mesh networks because the node cooperation and hierarchical construction are not considered. In this paper, we propose a new dynamic hierarchical reputation evaluation scheme (DHRES) to provide security for hybrid wireless mesh networks. In this scheme, the virtual cluster structure is built to introduce the reputation relation, including the related nodes’ roles and functions. Moreover, the reputation evaluation mechanism is based on the correlation between nodes such that the reputation information of the nodes is updated according to their different roles. Simulation results show that, compared with traditional reputation models, the proposed scheme can more accurately reflect the security status of nodes, particularly in cases where the malicious nodes are mesh clients.     

Trust-based security for wireless ad hoc and sensor networks

Wireless sensors networks are susceptible to a large number of security threats, and because of the communication, computation and delay constraints of most applications that run on top of these networks, traditional security mechanisms cannot be used. Trust and reputation have been recently suggested as an effective security mechanism for open environments such as the Internet, and considerable research has been done on modeling and managing trust and reputation. Using the trust and reputation management scheme to secure wireless sensor networks (WSNs) requires paying close attention to the incurred bandwidth and delay overhead, which have thus far been overlooked by most research work. In this paper, we propose a novel agent-based trust and reputation management scheme (ATRM) for wireless sensor networks. The objective of the scheme is to manage trust and reputation locally with minimal overhead in terms of extra messages and time delay. Throughout the entirety of this paper, we describe our scheme and prove its correctness. We will also present our extensive performance evaluation results, which clearly show that trust and reputation can be computed in wireless sensor networks with minimal overhead.     

Towards a dynamical model for wireless sensor networks

In this paper we introduce two dynamical models for a broadcast process in wireless sensor networks. We obtain a convergent martingale sequence for the two models. To our knowledge, such martingales were unknown previously. We look at the formal models using the formalisms of martingales, dynamical systems and Markov chains, each formalism providing complementary and coherent information with each other. The dynamics of both models are comparable and are validated in their domain of application with numerical simulation of wireless sensor networks. We make explicit the situations where the models are realistic. We also provide a formal analysis of the quasi-stationary distribution associated to the Markov chain corresponding to the second model proposed.