Location-based compromise-tolerant security mechanisms for wireless sensor networks

Node compromise is a serious threat to wireless sensor networks deployed in unattended and hostile environments. To mitigate the impact of compromised nodes, we propose a suite of location-based compromise-tolerant security mechanisms. Based on a new cryptographic concept called pairing, we propose the notion of location-based keys (LBKs) by binding private keys of individual nodes to both their IDs and geographic locations. We then develop an LBK-based neighborhood authentication scheme to localize the impact of compromised nodes to their vicinity. We also present efficient approaches to establish a shared key between any two network nodes. In contrast to previous key establishment solutions, our approaches feature nearly perfect resilience to node compromise, low communication and computation overhead, low memory requirements, and high network scalability. Moreover, we demonstrate the efficacy of LBKs in counteracting several notorious attacks against sensor networks such as the Sybil attack, the identity replication attack, and wormhole and sinkhole attacks. Finally, we propose a location-based threshold-endorsement scheme, called LTE, to thwart the infamous bogus data injection attack, in which adversaries inject lots of bogus data into the network. The utility of LTE in achieving remarkable energy savings is validated by detailed performance evaluation.     

A group-based security scheme for wireless sensor networks

In recent years, wireless sensor networks have been a very popular research topic, offering a treasure trove of systems, networking, hardware, security, and application-related problems. Distributed nature and their deployment in remote areas, these networks are vulnerable to numerous security threats that can adversely affect their proper functioning. The problem is more critical if its purpose is for some mission-critical applications such as in a tactical battlefield. This paper presents a security scheme for group-based distributed wireless sensor networks. Our first goal is to devise a group-based secure wireless sensor network. We exploit the multi-line version of matrix key distribution technique and Gaussian distribution to achieve this goal. Secondly, security mechanisms are proposed for such a group-based network architecture in which sensed data collected at numerous, inexpensive sensor nodes are filtered by local processing on its way through more capable and compromise-tolerant reporting nodes. We address the upstream requirement that reporting nodes authenticate data produced by sensors before aggregating and the downstream requirement that sensors authenticates commands disseminated from reporting nodes. Security analysis is presented to quantify the strength of the proposed scheme against security threats. Through simulations, we validate the analytical results.     

Situation awareness mechanisms for wireless sensor networks [security in mobile ad hoc]

A wireless sensor network should be able to operate for long periods of time with little or no external management. There is a requirement for this autonomy: the sensor nodes must be able to configure themselves in the presence of adverse situations. Therefore, the nodes should make use of situation awareness mechanisms to determine the existence of abnormal events in their surroundings. This work approaches the problem by considering the possible abnormal events as diseases, thus making it possible to diagnose them through their symptoms, namely, their side effects. Considering these awareness mechanisms as a foundation for high-level monitoring services, this article also shows how these mechanisms are included in the blueprint of an intrusion detection system.     

Energy saving with node sleep and power control mechanisms for wireless sensor networks

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...     

基于IBC的短波自组网密钥管理方案

针对短波通信在传输过程中连通率低及容易遭受敌方截获和攻击的缺点,提出一种基于IBC体系的短波自组网密钥管理方案。该方案采用对称加密技术保证报文加解密的效率;运用公钥密码体制强安全性保证种子密钥的安全协商;引入Hash函数对报文进行认证,验证报文的真实性与完整性;基于通信双方的一次一密加密体制,保证密文的安全传输。实验结果表明,该方案能有效抵御敌方的攻击,保证网络的安全通信。     

无线传感器网络中能量有效的波束成形机制

针对无线传感器网络中单个节点能量和通信距离均受限,以及传统波束成形机制中由于忽略能耗均衡而造成单个节点过早死亡的特点,提出了一种能量有效的波束成形机制。首先分析了节点个数、发射系数、功率受限、相位等因素对网络能耗的影响,给出了对应的设计原则。然后,基于此原则来选择参与发射的节点,并结合节点的剩余能量和相位来调整各自的发射系数。理论分析和仿真结果表明,该机制有效地增加了数据成功传输的次数,均衡了节点间的能耗,延长了网络寿命。     

Energy constraint clustering algorithms for wireless sensor networks

Using partitioning in sensor networks to create clusters for routing, data management, and for controlling communication has been proven as a way to ensure long range deployment and to deal with sensor network shortcomings such as limited energy and short communication ranges. Choosing a cluster head within each cluster is important because cluster heads use additional energy for their responsibilities and that burden needs to be carefully passed around among nodes in a cluster. Many existing protocols either choose cluster heads randomly or use nodes with the highest remaining energy. We present an Energy Constrained minimum Dominating Set based efficient clustering called ECDS to model the problem of optimally choosing cluster heads with energy constraints. Our proposed randomized distributed algorithm for the constrained dominating set runs in O(log n log Δ) rounds with high probability where Δ is the maximum degree of a node in the graph. We provide an approximation ratio for the ECDS algorithm of expected size 8H_Δ∣OPT∣ and with high probability a size of O(∣OPT∣log n) where n is the number of nodes, H is the harmonic function and OPT means the optimal size. We propose multiple extensions to the distributed algorithm for the energy constrained dominating set. We experimentally show that these extensions perform well in terms of energy usage, node lifetime, and clustering time in comparison and, thus, are very suitable for wireless sensor networks.     

Energy conserving movement-assisted deployment of ad hoc sensor networks

Sensor network deployment is very challenging due to hostile and unpredictable nature of usage environments. In this letter, we propose two methods for the self-deployment of mobile sensors. The first one is a randomized solution that provides both simplicity and applicability to different environments. Inspired by simulated annealing, it improves both speed and energy conservation of the deployment process. The other method is suggested for environments where sensors form a connected graph, initially. At the cost of this extra limitation, we gain considerable improvements.     

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

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

Energy efficient virtual MIMO communication for wireless sensor networks

Virtual multiple input multiple output (MIMO) techniques are used for energy efficient communication in wireless sensor networks. In this paper, we propose energy efficient routing based on virtual MIMO. We investigate virtual MIMO for both fixed and variable rates. We use a cluster based virtual MIMO cognitive model with the aim of changing operational parameters (constellation size) to provide energy efficient communication. We determine the routing path based on the virtual MIMO communication cost to delay the first node death. For larger distances, the simulation results show that virtual MIMO (2×2) based routing is more energy efficient than SISO (single input single output) and other MIMO variations.     

Energy balanced data propagation in wireless sensor networks

We study the problem of energy-balanced data propagation in wireless sensor networks. The energy balance property guarantees that the average per sensor energy dissipation is the same for all sensors in the network, during the entire execution of the data propagation protocol. This property is important since it prolongs the network’:s lifetime by avoiding early energy depletion of sensors. We propose a new algorithm that in each step decides whether to propagate data one-hop towards the final destination (the sink), or to send data directly to the sink. This randomized choice balances the (cheap) one-hop transimssions with the direct transimissions to the sink, which are more expensive but “bypass” the sensors lying close to the sink. Note that, in most protocols, these close to the sink sensors tend to be overused and die out early. By a detailed analysis we precisely estimate the probabilities for each propagation choice in order to guarantee energy balance. The needed estimation can easily be performed by current sensors using simple to obtain information. Under some assumptions, we also derive a closed form for these probabilities. The fact (shown by our analysis) that direct (expensive) transmissions to the sink are needed only rarely, shows that our protocol, besides energy-balanced, is also energy efficient. This work has been partially supported by the IST/FET/GC Programme of the European Union under contract numbers IST-2001-33135 (CRESCCO) and 6FP 001907 (DELIS). A perliminary version of the work appeared in WMAN 2004 [11]. Charilaos Efthymiou graduated form the Computer Engineering and Informatics Department (CEID) of the University of Patras, Greece. He received his MSc from the same department with advisor in S. Nikoletseas. He currently continuous his Ph.D studies in CEID with advisor L. Kirousis. His research interest include Probabilistic Techniques and Random Graphs, Randomized Algorithms in Computationally Hard Problems, Stochastic Processes and its Applications to Computer Science. Dr. Sotiris Nikoletseas is currently a Senior Researcher and Managing Director of Research Unit 1 (“Foundations of Computer Science, Relevant Technologies and Applications”) at the Computer Technology Institute (CTI), Patras, Greece and also a Lecturer at the Computer Engineering and Informatics Department of Patras University, Greece. His research interests include Probabilistic Techniques and Random Graphs, Average Case Analysis of Graph Algorithms and Randomized Algorithms, Fundamental Issues in Parallel and Distributed Computing, Approximate Solutions to Computationally Hard Problems. He has published scientific articles in major international conferences and journals and has co-authored (with Paul Spirakis) a book on Probabilistic Techniques. He has been invited speaker in important international scientific events and Universities. He has been a referee for the Theoretical Computer Science (TCS) Journal and important international conferences (ESA, ICALP). He has participated in many EU funded R&D projects (ESPRIT/ALCOM-IT, ESPRIT/GEPPCOM). He currently participates in 6 Fifth Framework projects: ALCOM-FT, ASPIS, UNIVERSAL, EICSTES (IST), ARACNE, AMORE (IMPROVING). Jose Rolim is Full Professor at the Department of Computer Science of the University of Geneva where he leads the Theoretical Computer Science and Sensor Lab (TCSensor Lab). He received his Ph.D. degree in Computer Science at the University of California, Los Angeles working together with Prof. S. Greibach. He has published several articles on the areas of distributed systems, randomization and computational complexity and leads two major projects on the area of Power Aware Computing and Games and Complexity, financed by the Swiss National Science Foundation. Prof. Rolim participates in the editorial board of several journals and conferences and he is the Steering Committee Chair and General Chair of the IEEE Distributed Computing Conference in Sensor Systems.     

EFCon: Energy flow control for sustainable wireless sensor networks

The rapid advances in processor, memory, and radio technology enable the development of small, inexpensive sensor nodes that are capable of sensing, computation, and communication. However, the severe energy constraints of the sensors present major challenges for long-term applications. In order to achieve sustainability, environmental energy harvesting has been demonstrated as a promising approach. In this work, the energy utilization scheme is investigated for wireless sensor networks with energy harvesting nodes. The energy utilization system is divided to three parts: energy harvesting, energy consuming and energy storage. Then the sustainability problem is formulated as an energy flow control problem. An energy flow control system, called EFCon, is proposed to keep the balance between energy supplies and demands. EFCon consists of two phases, energy flow direction control and flow rate control. In the phase of energy flow direction control, the system dynamically switches among four patterns: flood flow, direct flow, compensate flow, and backup flow, according to current environmental energy condition and the residual energy condition. Once the energy flow direction is determined, a corresponding energy flow rate control strategy will be adopted for efficient energy utilization. The EFCon is implemented and validated by a long-term deployment in real testbeds. The experimental results indicate that the EFCon outperforms existing designs.     

Energy efficient fault-tolerant multipath routing scheme for wireless sensor networks

In wireless sensor network （MSN）, reliability is the main issue to design any routing technique. To design a comprehensive reliable wireless sensor network, it is essential to consider node failure and energy constrain as inevitable phenomena. In this paper we present energy efficient node fault diagnosis and recovery for wireless sensor networks referred as energy efficient fault tolerant multipath routing scheme for wireless sensor network. The scheme is based on multipath data routing. One shortest path is used for main data routing in our scheme and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic on main channel. Shortest pat data routing ensures energy efficient data routing. Extensive simulation results have revealed that the performance of the proposed scheme is energy efficient and can tolerates more than 60% of fault.     

Energy equilibrium based on corona structure for wireless sensor networks

Although multi‐hop routing can reduce communication consumption and extend network scale, energy hole is unavoidable to appear because of the relay nodes being overloaded due to take more tasks. In this paper, we formulate the energy equilibrium problem as an optimal corona division, where data fusion and data slice are both considered in data gathering process. For a circular multi‐hop sensor network with uniform node distribution and constant data reporting, we demonstrate that the energy equilibrium of the whole network is unable to be realized no matter whether data fusion and data slice are adopted. However, the maximum energy equilibrium for a given circular area can be achieved only if the area increases in geometric progression from the outer corona to the neighbor inner corona except for the outermost one. Moreover, we use a zone‐based allocation scheme to guarantee energy equilibrium of intra‐corona. The approach for computing the optimal parameters is presented in terms of maximizing network lifetime. Based on the mathematical model, we propose an energy equilibrium routing based on corona structure (EERCS). Simulating results validate that EERCS can effectively achieve energy equilibrium and prolong the lifetime of network. Copyright © 2010 John Wiley & Sons, Ltd.     

Data security in unattended wireless sensor networks with mobile sinks

Unattended wireless sensor networks operating in hostile environments face the risk of compromise. Given the unattended nature, sensors must safeguard their sensed data of high value temporarily. However, saving data inside a network creates security problems due to the lack of tamper‐resistance of sensors and the unattended nature of the network. In some occasions, a network controller may periodically dispatch mobile sinks to collect data. If a mobile sink is given too many privileges, it will become very attractive for attack. Thus, the privilege of mobile sinks should be restricted. Additionally, secret keys should be used to achieve data confidentiality, integrity, and authentication between communicating parties. To address these security issues, we present mAKPS, an asymmetric key predistribution scheme with mobile sinks, to facilitate the key distribution and privilege restriction of mobile sinks, and schemes for sensors to protect their collected data in unattended wireless sensor networks. Copyright © 2011 John Wiley & Sons, Ltd.     

Implementation of security policy for clinical information systems over wireless sensor networks

Various healthcare areas such as diagnosis, surgery, intensive care and treatment, and patient monitoring in general, would greatly benefit from light, autonomous devices which can be unobtrusively mounted on the patient’s body in order to monitor and report health-relevant variables to an interconnection device in the vicinity. This interconnection device should be able to connect to access points at different locations within the healthcare institution. In this manner, health-relevant measurements can be forwarded to the central medical database and stored therein. In this scenario, integrity and privacy of personal medical data is of utmost importance. In this paper we address the networking and security architecture of a healthcare information system comprised of patients’ personal sensor networks, department/room networks, hospital network, and medical databases. We discuss confidentiality and integrity policies for clinical information systems and propose the feasible enforcement mechanisms over the wireless hop. We also compare two candidate technologies, IEEE 802.15.1 and IEEE 802.15.4, from the aspect of resilience to jamming and denial-of-service attacks.     

能耗均衡和可靠的无线传感器网络分簇算法

为了解决热区问题和单点失效问题,提出了一种新的无线传感器网络分簇算法。算法将网络划分为非均匀的栅格,每个栅格的节点分别构成一个簇,根据节点失效概率确定栅格簇首的数目,并由栅格的多个簇首协作完成该栅格节点的数据收集。算法通过调整各个栅格中可参与簇首轮换的节点数目,从长远均衡节点之间的能耗。通过建立包含多个簇首的簇,算法降低了簇成员对单个簇首的依赖性。此外,算法还采取了一些降低能耗的措施。实验结果表明,该算法能够达到较高的能耗均衡程度和数据收集可靠性,并可以延长网络的生命周期。     

无线传感器网络中能量高效的基站位置优选算法

将基站位置选择及节能路由优化联合考虑,定义了最短路径树剖分,分析了二维空间中剖分单元的结构与相邻剖分单元搜索算法,并设计了3种启发式算法.通过仿真实验对算法性能进行了分析与对比,结果表明所提出的启发式算法的性能有效地接近或者收敛于全局最优解.     

Energy equalizing routing for fast data gathering in wireless sensor networks

Energy saving and fast responding of data gathering are two crucial factors for the performance of wireless sensor networks. A dynamic tree based energy equalizing routing scheme (DTEER) was proposed to make an effort to gather data along with low energy consumption and low time delay. DTEER introduces a dynamic multi-hop route selecting scheme based on weight-value and height-value to form a dynamic tree and a mechanism similar to token passing to elect the root of the tree. DTEER can simply and rapidly organize all the nodes with low overhead and is robust enough to the topology changes. When compared with power-efficient gathering in sensor information systems (PEGASIS) and the hybrid, energy- efficient, distributed clustering approach (HEED), the simulation results show that DTEER achieves its intention of consuming less energy, equalizing the energy consumption of all the nodes, alleviating the data gathering delay, as well as extending the network lifetime perfectly.