GSHMAC: Green and Secure Hybrid Medium Access Control for Wireless Sensor Network

The cost efficiency of wireless platforms and their easy deployment enable the applicability of it in widespread application domains. Wireless sensor networks (WSNs) are not excluded from it. Their application domains vary from industrial monitoring to military applications. A WSN is a resource-constrained network and energy of the WSN node is a valuable resource. Like every other network, WSNs are also vulnerable to security attacks. A security attack can results in networks consuming more resources, leading to earlier depletion of node energy. A significant part of the resource consumption in a WSN is controlled by the medium access control (MAC) mechanism. This paper focuses on WSN MAC mechanisms and countermeasures for attacks targeting the MAC layer in a WSN. Denial of sleep attacks are the most relevant for WSN MAC as these types of attacks have shattered effects, which bring down the sensor lifetime from years to days. This paper proposes a secure hybrid MAC mechanism, Green and Secure Hybrid Medium Access Control (GSHMAC) to overcome the devastating effect of WSN MAC attacks. The proposed mechanism provides features such as collision threshold-based MAC mode control and countermeasures on WSN MAC using internal MAC mechanisms. GSHMAC shows improved energy-efficiency, delay, and throughput in the presence of attacks, as compared with state-of-art secure MAC mechanisms.     

A Secure Key Predistribution Scheme for WSN Using Elliptic Curve Cryptography

Security in wireless sensor networks (WSNs) is an upcoming research field which is quite different from traditional network security mechanisms. Many applications are dependent on the secure operation of a WSN, and have serious effects if the network is disrupted. Therefore, it is necessary to protect communication between sensor nodes. Key management plays an essential role in achieving security in WSNs. To achieve security, various key predistribution schemes have been proposed in the literature. A secure key management technique in WSN is a real challenging task. In this paper, a novel approach to the above problem by making use of elliptic curve cryptography (ECC) is presented. In the proposed scheme, a seed key, which is a distinct point in an elliptic curve, is assigned to each sensor node prior to its deployment. The private key ring for each sensor node is generated using the point doubling mathematical operation over the seed key. When two nodes share a common private key, then a link is established between these two nodes. By suitably choosing the value of the prime field and key ring size, the probability of two nodes sharing the same private key could be increased. The performance is evaluated in terms of connectivity and resilience against node capture. The results show that the performance is better for the proposed scheme with ECC compared to the other basic schemes.     

Efficient Approach for Maximizing Lifespan in Wireless Sensor Networks by Using Mobile Sinks

Recently, sink mobility has been shown to be highly beneficial in improving network lifetime in wireless sensor networks (WSNs). Numerous studies have exploited mobile sinks (MSs) to collect sensed data in order to improve energy efficiency and reduce WSN operational costs. However, there have been few studies on the effectiveness of MS operation on WSN closed operating cycles. Therefore, it is important to investigate how data is collected and how to plan the trajectory of the MS in order to gather data in time, reduce energy consumption, and improve WSN network lifetime. In this study, we combine two methods, the cluster‐head election algorithm and the MS trajectory optimization algorithm, to propose the optimal MS movement strategy. This study aims to provide a closed operating cycle for WSNs, by which the energy consumption and running time of a WSN is minimized during the cluster election and data gathering periods. Furthermore, our flexible MS movement scenarios achieve both a long network lifetime and an optimal MS schedule. The simulation results demonstrate that our proposed algorithm achieves better performance than other well‐known algorithms.     

Distributed faulty node detection and recovery scheme for wireless sensor networks using cellular learning automata

Wireless Networks - In a wireless sensor network (WSN), there is always the possibility of failure in sensor nodes. Quality of Service (QoS) of WSNs is highly degraded due to the faulty sensor...     

A design for secure and survivable wireless sensor networks

In this article, we present a study of the design of secure and survivable wireless sensor networks (WSN) that has yet to be addressed in the literature. Our goal is to develop a framework that provides the security and survivability features that are crucial to applications in a WSN, because WSNs are vulnerable to physical and network-based security attacks, accidents, and failures. To achieve such a goal, we first examine the security and survivability requirements. We then propose a security and survivability architecture in a WSN with heterogeneous sensor nodes. To understand the interactions between survivability and security, we also design and analyze a key management scheme. The results of the experiment show that a good design can improve both security and survivability of a WSN; however, in some situations, there is a trade off between security and survivability.     

A Queuing Theory-Enabled Dynamic Bandwidth Allocation Algorithm for a Wired-Wireless Converged Network

Multi-sink wireless sensor networks (WSNs) are being increasingly deployed in an ever-widening range of application scenarios, especially as they are reliable and exhibit low power consumption. Providing a backhaul for WSN traffic has become an important issue because the sensor data must usually be sent to the Internet or the core network. Passive optical networks (PONs) represent one next-generation access network technology which is appropriate for such a backhaul, however existing research appears to have concentrated on either WSN performance or PON performance, without considering the overall performance of both networks converged together. This paper proposes a new architecture which converges multi-sink WSNs and PONs, then provides a novel queuing-theory analysis of the converged network performance. Results from this analytical model are then used to motivate a new a DBA algorithm which optimizes grant size allocation. Numerical results show that this algorithm outperforms existing proposals when minimizing the system queue length in the converged network, while providing shorter end-to-end packet delay and higher throughput. We believe that this first resource allocation algorithm which considers the performance of both networks as one converged unit.     

Wireless sensor networks for intrusion detection: packet traffic modeling

Performance evaluation of wireless sensor network (WSN) protocols requires realistic data traffic models since most of the WSNs are application specific. In this letter, a sensor network packet traffic model is derived and analyzed for intrusion detection applications. Presented analytical work is also validated using simulations.     

Mobile anchor assisted particle swarm optimization (PSO) based localization algorithms for wireless sensor networks

Node localization is essential to wireless sensor networks (WSN) and its applications. In this paper, we propose a particle swarm optimization (PSO) based localization algorithm (PLA) for WSNs with one or more mobile anchors. In PLA, each mobile anchor broadcasts beacons periodically, and sensor nodes locate themselves upon the receipt of multiple such messages. PLA does not require anchors to move along an optimized or a pre‐determined path. This property makes it suitable for WSN applications in which data‐collection and network management are undertaken by mobile data sinks with known locations. To the best of our knowledge, this is the first time that PSO is used in range‐free localization in a WSN with mobile anchors. We further derive the upper bound on the localization error using Centroid method and PLA. Simulation results show that PLA can achieve high performance in various scenarios. Copyright © 2011 John Wiley & Sons, Ltd.     

J-Sim: a simulation and emulation environment for wireless sensor networks

Wireless sensor networks have gained considerable attention in the past few years. They have found application domains in battlefield communication, homeland security, pollution sensing, and traffic monitoring. As such, there has been an increasing need to define and develop simulation frameworks for carrying out high-fidelity WSN simulation. In this article we present a modeling, simulation, and emulation framework for WSNs in J-Sim - an open source, component-based compositional network simulation environment developed entirely in Java. This framework is built on the autonomous component architecture and extensible internetworking framework of J-Sim, and provides an object-oriented definition of target, sensor, and sink nodes, sensor and wireless communication channels, and physical media such as seismic channels, mobility models, and power models (both energy-producing and energy-consuming components). Application-specific models can be defined by subclassing classes in the simulation framework and customizing their behaviors. We also include in J-Sim a set of classes and mechanisms to realize network emulation. We demonstrate the use of the proposed WSN simulation framework by implementing several well-known localization, geographic routing, and directed diffusion protocols, and perform performance comparisons (in terms of the execution time incurred and memory used) in simulating WSN scenarios in J-Sim and ns-2. The simulation study indicates the WSN framework in J-Sim is much more scalable than ns-2 (especially in memory usage). We also demonstrate the use of the WSN framework in carrying out real-life full-fledged Future Combat System (FCS) simulation and emulation.     

基于P2P的无线传感器网络应用架构研究

通过基础网络互联多个传感器网络，为用户提供大规模、大范围、多样化的信息服务成为未来无线传感器网络的应用模式之一。据此，提出了一种基于P2P（Peer-to—Peer）技术的无线传感器网络应用架构。采用P2P技术，解决了大数据量的通信瓶颈，传感器网络亦可自由加入、变更或退出，方便部署，网络可扩展性好．同时屏蔽底层网络差异及多种接入方式．为用户提供多个访问入口。     

Wireless passive sensor networks - [Accepted from open call]

The primary challenge in wireless sensor network deployment is the limited network lifetime due to finite-capacity batteries. Hence, the vast majority of research efforts thus far have focused on the development of energy-efficient communication and computing mechanisms for WSNs. In this article a fundamentally different approach and hence completely new WSN paradigm, the wireless passive sensor network, is introduced. The objective of the WPSN is to eliminate the limitation on system lifetime of the WSN. In a WPSN power is externally supplied to the sensor network node via an external RF source. Modulated backscattering is discussed as an alternative communication scheme for WPSNs. The feasibility is investigated along with the open research challenges for reliable communication and networking in WPSNs.     

Connectivity Analysis for Wireless Sensor Networks with Antenna Array Integrated Central Node

In a wireless sensor network (WSN), after gathering information, tiny sensor nodes need to transmit data to a sink. It is important to guarantee that each node can communicate with a sink. Due to the multi-hop communication of WSNs, an essential condition for reliable transmission is completely connectivity of a network. Adaptive or smart antenna (SA) techniques in WSNs have been a topic of active research in recent years. These techniques have been shown to be effective with respect to decreasing energy consuming via specified regions which are formed by the SA beams. In this paper, we propose a probabilistic technique to determine the network connectivity probability of the SA integrated WSN. We employ the geometric shape model to evaluate the network connectivity probability of the WSN using the SA beam specifications. The sensor node density to satisfy the desired network connectivity is determined in terms of the beam-width of the antenna array and node transmission range. The analytical results agree with the simulation results by less than 4.7 % error in the average.     

A Robust Mutual Authentication Protocol for Wireless Sensor Networks

Authentication is an important service in wireless sensor networks (WSNs) for an unattended environment. Recently, Das proposed a hash‐based authentication protocol for WSNs, which provides more security against the masquerade, stolen‐verifier, replay, and guessing attacks and avoids the threat which comes with having many logged‐in users with the same login‐id. In this paper, we point out one security weakness of Das' protocol in mutual authentication for WSN's preservation between users, gateway‐node, and sensor nodes. To remedy the problem, this paper provides a secrecy improvement over Das' protocol to ensure that a legal user can exercise a WSN in an insecure environment. Furthermore, by presenting the comparisons of security, computation and communication costs, and performances with the related protocols, the proposed protocol is shown to be suitable for higher security WSNs.     

e‐LiteSense: Self‐adaptive energy‐aware data sensing in WSN environments

Currently deployed in a wide variety of applicational scenarios, wireless sensor networks (WSNs) are typically a resource‐constrained infrastructure. Consequently, characteristics such as WSN adaptability, low‐overhead, and low‐energy consumption are particularly relevant in dynamic and autonomous sensing environments where the measuring requirements change and human intervention is not viable. To tackle this issue, this article proposes e‐LiteSense as an adaptive, energy‐aware sensing solution for WSNs, capable of auto‐regulate how data are sensed, adjusting it to each applicational scenario. The proposed adaptive scheme is able to maintain the sensing accuracy of the physical phenomena, while reducing the overall process overhead. In this way, the adaptive algorithm relies on low‐complexity rules to establish the sensing frequency weighting the recent drifts of the physical parameter and the levels of remaining energy in the sensor. Using datasets from WSN operational scenarios, we prove e‐LiteSense effectiveness in self‐regulating data sensing accurately through a low‐overhead process where the WSN energy levels are preserved. This constitutes a step‐forward for implementing self‐adaptive energy‐aware data sensing in dynamic WSN environments.     

基于遗传聚类的无线传感器负载均衡路由算法

通常的无线传感器分簇网络存在节点负载不均衡的问题。为均衡各节点能量消耗,延长网络生存周期,将K均值算法与遗传算法相结合,提出一种负载均衡的无线传感器网络路由算法,算法利用遗传算法的全局寻优能力以克服传统K均值算法的局部性和对初始中心的敏感性,实现了传感器网络节点自适应成簇与各节点负载均衡。仿真实验表明,该算法显著延长了网络寿命,相对于其他分簇路由算法,其网络生存时间延长了约43%。     

A service-centric model for wireless sensor networks

Most of the current research in wireless sensor networks (WSNs) is constraint driven and focuses on optimizing the use of limited resources (e.g., power) at each sensor. While such constraints are important, there is a energy for more general performance metrics to assess the effectiveness of WSNs. There is also a need for a unified formal model that would enable comparison of different types of WSNs and provide a framework for WSN operations. We propose a new service-centric model that focuses on services provided by a WSN and views a WSN as a service provider. A WSN is modeled at different levels of abstraction. For each level, a set of services and a set of metrics are defined. Services and their interfaces are defined in a formal way to facilitate automatic composition of services, and enable interoperability and multitasking of WSNs at the different levels. A two-way mapping between two neighboring levels is then defined as a decomposition (from higher to lower level) and composition (from lower to higher level). A composite mapping between metrics at different levels connects high-level, mission-oriented metrics and low-level, capability-oriented metrics. The service-centric model consists of mission, network, region, sensor, and capability layers. Each layer has associated semantics that use lower level components as syntactic units (except for the capability layer). Within each layer there are four planes or functionality sets; communication, management, application, and generational learning. The combination of layers and planes enables a service-based visualization paradigm that can provide better understanding of the WSN. The service-centric model provides a holistic approach to measuring and presenting WSNs effectiveness. In addition, it presents a general and flexible framework in which various more specific WSN models can be represented and evaluated.     

Research and Improvement of Wireless Sensor Network Secure Data Aggregation Protocol Based on SMART

The privacy-preserving of information is one of the most important problems to be solved in wireless sensor network (WSN). Privacy-preserving data aggregation is an effective way to protect security of data in WSNs. In order to deal with the problem of energy consumption of the SMART algorithm, we present a new dynamic slicing D-SMART algorithm which based on the importance degree of data. The proposed algorithm can decrease the communication overhead and energy consumption effectively while provide good performance in preserving privacy by the reasonable slicing based on the importance degree of the collected raw data. Simulation results show that the proposed D-SMART algorithm improve the aggregation accuracy, enhance the privacy-preserving, reduce the communication overhead to some extent, decrease the energy consumption of sensor node and prolong the network lifetime indirectly.     

无线传感器网络安全研究

网络安全是无线传感器网络研究的热点。本文在分析无线传感器网络特点和安全需求的基础上,从密钥管理和攻防技术两个方面介绍了无线传感器网络安全研究的现状,简要地分析了无线传感器网络安全研究的重点,最后指出了下一步研究的方向。     

Clustering Based Two Dimensional Motion of Sink Node in Wireless Sensor Networks

The wireless sensor network (WSN) is always known for its limited-energy issues and finding a good solution for energy minimization in WSNs is still a concern for researchers. Implementing mobility to the sink node is used widely for energy conservation or minimization in WSNs which reduces the distance between sink and communicating nodes. In this paper, with the intention to conserve energy from the sensor nodes, we designed a clustering based routing protocol implementing a mobile sink called ‘two dimensional motion of sink node (TDMS)’. In TDMS, each normal sensor node collects data and send it to their respective leader node called cluster head (CH). The sink moves in the two dimensional direction to collect final data from all CH nodes, particularly it moves in the direction to that CH which has the minimum remaining energy. The proposed protocol is validated through rigorous simulation using MATLAB and comparisons have been made with WSN’s existing static sink and mobile sink routing protocols over two different geographical square dimensions of the network. Here, we found that TDMS model gives the optimal result on energy dissipation per round and increased network lifetime.