Trust-aware secure routing protocol for wireless sensor networks

A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.     

SERP: secure energy-efficient routing protocol for densely deployed wireless sensor networks

In this paper, we present secure energy-efficient routing protocol (SERP) for densely deployed wireless sensor networks which aims to achieve robust security for transmitted sensor readings with an energy-efficient network backbone. When the sensors with limited energy budgets are deployed in hazardous environment, ensuring energy efficiency and security of the sensor readings becomes a crucial task. Here, we address how to deal with such a deployment scenario. Our protocol ensures secure transmission of data from the source sensors to the base station in a way that it can best utilize the available amount of energy in the network. We use one-way hash chain and pre-stored shared secret keys for ensuring data transmission security. In SERP, first, a sink rooted tree structure is created as the backbone of the network. This energy-efficient network structure is used for authenticated and encrypted data delivery from the source sensors to the base station. To introduce data freshness, SERP includes an optional key refreshment mechanism which could be applied depending on the application at hand. Our analysis and simulation results show that SERP provides a good level of confidentiality and authenticity of data that are transmitted from the sensors to the base station. It also helps for energy-efficient structuring of the network so that the maximum lifetime of the network could be achieved.     

Defending against wormhole attacks in mobile ad hoc networks

In ad hoc networks, malicious nodes can deploy wormhole attacks to fabricate a false scenario on the proximity relationship among mobile nodes. A classification of the attacks according to the format of the wormholes is proposed. This forms a basis to identify the detection capability of various approaches. An analysis shows that earlier approaches focus on the prevention of wormholes among neighbors that trust each other. As a more generic approach, we present an end‐to‐end scheme that can detect wormholes on a multi‐hop route. Only the trust between the source and the destination is assumed. The mechanism uses geographic information to detect anomalies in neighbor relations and node movements. To reduce the computation and storage overhead, we present a scheme called cell‐based open tunnel avoidance (COTA) to manage the information. COTA requires a constant space for every node on the path and the computation overhead increases linearly to the number of detection packets. We prove that the savings do not deteriorate the detection capability. Various schemes to control communication overhead are studied. The simulation and experiments on real devices show that the proposed mechanism can be combined with existent routing protocols to defend against wormhole attacks. Copyright © 2006 John Wiley & Sons, Ltd.     

Secure routing in wireless sensor networks: attacks and countermeasures

We consider routing security in wireless sensor networks. Many sensor network routing protocols have been proposed, but none of them have been designed with security as a goal. We propose security goals for routing in sensor networks, show how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensor networks, introduce two classes of novel attacks against sensor networks––sinkholes and HELLO floods, and analyze the security of all the major sensor network routing protocols. We describe crippling attacks against all of them and suggest countermeasures and design considerations. This is the first such analysis of secure routing in sensor networks.     

SenLeash：一种无线传感器网络虫洞攻击约束防御机制

针对邻居发现或路由发现阶段可能受到虫洞攻击的问题,提出了一种约束防御机制SenLeash,通过限制消息传输的距离来防御虫洞攻击。SenLeash依赖2个因子：每个节点到初始基站的距离和一个精选的接收距离阈值。基于接收信号强度RSSI,提出了一种nRSSI测量方法,在网络初始化阶段用来测量每个节点到初始基站的距离。基于每个节点的接收概率和MAC层的最大重传次数,对接收距离阈值的选择方法进行了研究。实验结果表明,SenLeash可有效减少由虫洞攻击导致的虚假邻居节点个数和无效回复消息个数。     

A centralized energy-efficient routing protocol for wireless sensor networks

Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Several network layer protocols have been proposed to improve the effective lifetime of a network with a limited energy supply. In this article we propose a centralized routing protocol called base-station controlled dynamic clustering protocol (BCDCP), which distributes the energy dissipation evenly among all sensor nodes to improve network lifetime and average energy savings. The performance of BCDCP is then compared to clustering-based schemes such as low-energy adaptive clustering hierarchy (LEACH), LEACH-centralized (LEACH-C), and power-efficient gathering in sensor information systems (PEGASIS). Simulation results show that BCDCP reduces overall energy consumption and improves network lifetime over its comparatives.     

Ad Hoc网络基于能源熵的多路径安全路由协议

由于节点是随机移动的,且其电池容量有限,在无线Ad Hoc网络(自组织网络)中减少能源消耗以延长网络生存期、保证节点的安全性是研究多路径路由中的主要问题。文章分析了AODV(基于距离矢量单路径按需路由)协议和AOMDV(基于距离矢量多路径按需路由)协议的一些基本特点,在考虑安全网格定位服务的基础上,结合能源熵,提出了一种新的安全多路径路由协议-EEBSMRP。仿真计算结果表明,EEBSMRP在发现最小的节点能源消耗路由、平衡各个节点能源利用率、延长整个网络生存期以及安全性方面有较大的改进。     

两层传感器网络中安全分类协议研究

提出了一种安全分类协议SSC,该协议在保护待分类数据和分类规则隐私的情况下使存储节点进行正确分类,并且sink节点可以对分类结果进行抽样认证,防止妥协存储节点伪造分类结果。提出了一种不经意比较(oblivious comparison)技术MHash,该技术首先将分类需要的大小比较转换成等值比较,并进一步采用模运算和散列技术实现隐私保护下的数据分类。提出了一种"十"字邻居技术,分别将传感器以及传感器采集的数据组织成链,并采用倒置布鲁姆过滤器技术同步传感器节点之间的数据,sink利用该技术可以抽样检查存储节点分类统计结果的正确性,分析和实验结果验证了所提方案的有效性。     

GOAL: A parsimonious geographic routing protocol for large scale sensor networks

Geographic routing is well suited for large scale sensor networks, because its per node state is independent of the network size. However, the local minimum caused by holes/obstacles results in the worst-case path stretch of Ω(c²), where c is the path length of the optimal route. Recently, a geographic routing protocol based on the visibility graph (VIGOR) showed that a path stretch of Θ(c) can be achieved. This path stretch, however, is achieved at the cost of communication and storage overhead, which makes the practical deployment of VIGOR in large scale sensor networks challenging. To this end, we propose GOAL (Geometric Routing using Abstracted Holes), a routing protocol that provably achieves a path stretch of Θ(c), with lower communication and storage overhead. To compactly describe holes, we develop a novel distributed convex hull algorithm, which improves the message complexity O(n log² n) of state of art distributed convex hull algorithm to O(n log n). The concise representation of a hole is used by nodes to make locally optimal routing decisions. Our theoretical analysis proves the correctness of the proposed algorithms and the path stretch of Θ(c). Through extensive simulations and experiments on a testbed with 42 EPIC motes, we demonstrate the effectiveness of GOAL and its feasibility for resource constrained wireless sensor networks; specifically, we show that GOAL eliminates part of communication overhead of VIGOR and reduces the memory overhead of VIGOR by up to 51%.     

基于最小跳数的无线传感器网络路由协议

在分析了最小跳数路由算法局限性的基础上对该算法进行了改进,充分考虑了无线传感器网络的跳数、能量、负载均衡等问题。改进后的算法使得传感器的某些节点不会因为频繁使用而迅速死亡,数据包可以沿着最优的路径向网关节点发送。仿真结果显示,改进后的算法可以有效地提高无线传感器网络的可靠性和稳定性,延长了网络的通信时间。     

无线传感器网络高可靠低维护地理路由协议

无线传感器网络地理路由协议要求节点根据少量本地路由信息将数据分组传输路由到目标节点。为了消除路由环,地理路由算法通常需要将网络拓扑平面化。然而现有的平面化算法要么假设节点的通信半径是一固定值,在实际应用中不适用;要么对每一条链路都进行检测是否有交叉链路,路由维护代价很高。针对以上问题,提出一种具有高可靠性和低维护成本的地理路由协议RPR(region partitioning-based routing),其基本思想是将网络划分为规则多边形区域,并在贪心路由失败时将多边形区域内的所有节点看作一个虚拟节点进行周边路由。多边形区域间通信能够降低平均路由路径长度,从而提高了路由的可靠性。基于区域划分的网络平面化策略不需要检测和删除相交链路,因此减少了路由维护开销。模拟实验结果显示,RPR协议比现有方法的平均路由路径长度更短,路由维护开销更低。     

针对虫洞攻击的无线传感器网络安全定位方法

节点定位技术是无线传感器网络的关键技术之一,是很多基于无线传感器网络的应用的基础。然而,无线传感器网络通常部署在无人值守的敌对环境中,攻击节点能够很容易地破坏网络中节点的定位过程。本文针对无线传感器网络中距离无关的定位技术,分析了虫洞攻击对DV-Hop定位过程的影响,提出了一种无线传感器网络中抵御虫洞攻击的DV-Hop安全定位方法。仿真结果表明所提出的安全定位方法能够有效降低虫洞攻击对DV-Hop定位过程的影响,验证了该方法的有效性。     

An unequal cluster-based routing protocol in wireless sensor networks

Clustering provides an effective method for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques; selecting cluster heads with more residual energy, and rotating cluster heads periodically to distribute the energy consumption among nodes in each cluster and extend the network lifetime. However, they rarely consider the hot spot problem in multihop sensor networks. When cluster heads cooperate with each other to forward their data to the base station, the cluster heads closer to the base station are burdened with heavier relay traffic and tend to die much faster, leaving areas of the network uncovered and causing network partitions. To mitigate the hot spot problem, we propose an Unequal Cluster-based Routing (UCR) protocol. It groups the nodes into clusters of unequal sizes. Cluster heads closer to the base station have smaller cluster sizes than those farther from the base station, thus they can preserve some energy for the inter-cluster data forwarding. A greedy geographic and energy-aware routing protocol is designed for the inter-cluster communication, which considers the tradeoff between the energy cost of relay paths and the residual energy of relay nodes. Simulation results show that UCR mitigates the hot spot problem and achieves an obvious improvement on the network lifetime. Guihai Chen obtained his B.S. degree from Nanjing University, M. Engineering from Southeast University, and PhD from University of Hong Kong. He visited Kyushu Institute of Technology, Japan in 1998 as a research fellow, and University of Queensland, Australia in 2000 as a visiting professor. During September 2001 to August 2003, he was a visiting professor at Wayne State University. He is now a full professor and deputy chair of Department of Computer Science, Nanjing University. Prof. Chen has published more than 100 papers in peer-reviewed journals and refereed conference proceedings in the areas of wireless sensor networks, high-performance computer architecture, peer-to-peer computing and performance evaluation. He has also served on technical program committees of numerous international conferences. He is a member of the IEEE Computer Society. Chengfa Li was born 1981 and obtained his Bachelor’s Degree in mathematics in 2003 and his Masters Degree in computer science in 2006, both from Nanjing University, China. He is now a system programmer at Lucent Technologies Nanjing Telecommunication Corporation. His research interests include wireless ad hoc and sensor networks. Mao Ye was born in 1981 and obtained his Bachelor’s Degree in computer science from Nanjing University, China, in 2004. He served as a research assistant At City University of Hong Kong from September 2005 to August 2006. He is now a PhD candidate with research interests in wireless networks, mobile computing, and distributed systems. Jie Wu is a professor in the Department of Computer Science and Engineering at Florida Atlantic University. He has published more than 300 papers in various journal and conference proceedings. His research interests are in the areas of mobile computing, routing protocols, fault-tolerant computing, and interconnection networks. Dr. Wu serves as an associate editor for the IEEE Transactions on Parallel and Distributed Systems and several other international journals. He served as an IEEE Computer Society Distinguished Visitor and is currently the chair of the IEEE Technical Committee on Distributed Processing (TCDP). He is a member of the ACM, a senior member of the IEEE, and a member of the IEEE Computer Society.     

Dynamic energy efficient routing protocol in wireless sensor networks

Wireless Networks - Currently, IEEE 802.11 standard for ad-hoc wireless mode is inadequate for multi-hop network. Recent efforts for the advancement of 802.11 standards, such as 11e for QoS support...     

A secure and low‐energy zone‐based wireless sensor networks routing protocol for pollution monitoring

Sensor networks can be used in many sorts of environments. The increase of pollution and carbon footprint are nowadays an important environmental problem. The use of sensors and sensor networks can help to make an early detection in order to mitigate their effect over the medium. The deployment of wireless sensor networks (WSNs) requires high‐energy efficiency and secures mechanisms to ensure the data veracity. Moreover, when WSNs are deployed in harsh environments, it is very difficult to recharge or replace the sensor's batteries. For this reason, the increase of network lifetime is highly desired. WSNs also work in unattended environments, which is vulnerable to different sort of attacks. Therefore, both energy efficiency and security must be considered in the development of routing protocols for WSNs. In this paper, we present a novel Secure and Low‐energy Zone‐based Routing Protocol (SeLeZoR) where the nodes of the WSN are split into zones and each zone is separated into clusters. Each cluster is controlled by a cluster head. Firstly, the information is securely sent to the zone‐head using a secret key; then, the zone‐head sends the data to the base station using the secure and energy efficient mechanism. This paper demonstrates that SeLeZoR achieves better energy efficiency and security levels than existing routing protocols for WSNs. Copyright © 2016 John Wiley & Sons, Ltd.     

无线Mesh网络中的虫洞攻击检测研究

为了有效检测出无线mesh网络中的虫洞攻击,针对微软提出的支持多射频的链路质量源路由MR-LQSR(multi-radio link-quality souse routing)协议提出了一种虫洞攻击模型,并根据虫洞攻击及无线mesh网的特点,在基于端到端的虫洞攻击检测算法、投票机制、邻居检测机制和基于身份加密技术的基础上提出一种基于端到端的虫洞攻击检测机制.最后通过理论分析和实验证实了该机制能有效地抵御无线mesh网中的虫洞攻击和提高无线mesh网的安全性.     

Passive cluster-based multipath routing protocol for wireless sensor networks

Energy efficiency and quality of service (QoS) are both essential issues in the applications of wireless sensor networks (WSNs) all along, which are mainly reflected in the development of routing and MAC protocols. However, there is little design for achieving the dual performances simultaneously. In this paper, we develop a practical passive cluster-based node-disjoint many to one multipath routing protocol to satisfy the requirements of energy efficiency and QoS in practical WSNs. Passive clustering approach is put to use in the first round, while active clustering technique is taken in the other rounds. Implementation of smart delay strategy makes the cluster distribute uniformly, as well as lessen the number of nodes that have taken part in routing. Among cluster heads, a node-disjoint many to one multipath routing discovery algorithm, which is composed of the optimal path searching process and multipath expansion process, is implemented to find multiple paths at the minimum cost. The simulation results show the proposed protocol achieved very good performance both in energy efficiency and QoS.     

面向WSN的安全范围查询协议研究

针对两层无线传感器网络中范围查询所要求的低能耗和高隐私保护,提出了一种具有隐私和完整性保护的安全范围查询协议:SPQ。SPQ是由数据加密、前缀成员验证、概率邻居验证、查询传输过程分离等技术组成,能够在保证不泄露隐私的情况下完成范围查询。分析和仿真结果表明,相对于其他安全协议,SPQ在保证范围查询安全性的同时具有更低能耗。     

无线传感器网络分簇路由协议研究

在无线传感器网络中,分簇型路由在路由协议中占据重要的地位,该协议方便拓扑结构管理,能源利用率高,数据融合简单。文章从簇头生成、簇形成和簇路由3个角度对典型的分簇路由算法LEACH,HEED,EEUC,PEGASIS进行了系统描述,从网络生命周期和节点存活数量等方面,对比了其优缺点,结合该领域的研究现状,指出了未来研究的方向。     

无线传感器网络能量均衡分簇路由协议

针对LEACH协议存在的3大问题:簇头选举时未考虑节点剩余能量、频繁成簇造成了大量额外能耗以及欠缺对簇间能耗均衡的考虑,提出了能量有效分簇路由协议(LEACH-improved).该协议中,首轮成簇后网络中簇的分布和数量将保持不变,以后每轮各簇的簇头由上一轮簇头结合节点的能量水平来指定,借鉴泛洪算法的思想,在簇间建立多...