In today's competitive industry marketplace, the companies face growing demands to improve process efficiencies, comply with environmental regulations, and meet corporate financial objectives. Given the increasing age of many industrial systems and the dynamic industrial manufacturing market, intelligent and low-cost industrial automation systems are required to improve the productivity and efficiency of such systems. The collaborative nature of industrial wireless sensor networks (IWSNs) brings several advantages over traditional wired industrial monitoring and control systems, including self-organization, rapid deployment, flexibility, and inherent intelligent-processing capability. In this regard, IWSN plays a vital role in creating a highly reliable and self-healing industrial system that rapidly responds to real-time events with appropriate actions. In this paper, first, technical challenges and design principles are introduced in terms of hardware development, system architectures and protocols, and software development. Specifically, radio technologies, energy-harvesting techniques, and cross-layer design for IWSNs have been discussed. In addition, IWSN standards are presented for the system owners, who plan to utilize new IWSN technologies for industrial automation applications. In this paper, our aim is to provide a contemporary look at the current state of the art in IWSNs and discuss the still-open research issues in this field and, hence, to make the decision-making process more effective and direct.

/pdf/industrial-wireless-sensor-networks-challenges-design-1p149rqzw2.pdf

Industrial Wireless Sensor Networks: Challenges, Design Principles, and Technical Approaches

Sensor network technology promises a vast increase in automatic data collection capabilities through efficient deployment of tiny sensing devices. The technology will allow users to measure phenomena of interest at unprecedented spatial and temporal densities. However, as with almost every data-driven technology, the many benefits come with a significant challenge in data reliability. If wireless sensor networks are really going to provide data for the scientific community, citizen-driven activism, or organizations which test that companies are upholding environmental laws, then an important question arises: How can a user trust the accuracy of information provided by the sensor networkq Data integrity is vulnerable to both node and system failures. In data collection systems, faults are indicators that sensor nodes are not providing useful information. In data fusion systems the consequences are more dire; the final outcome is easily affected by corrupted sensor measurements, and the problems are no longer visibly obvious.In this article, we investigate a generalized and unified approach for providing information about the data accuracy in sensor networks. Our approach is to allow the sensor nodes to develop a community of trust. We propose a framework where each sensor node maintains reputation metrics which both represent past behavior of other nodes and are used as an inherent aspect in predicting their future behavior. We employ a Bayesian formulation, specifically a beta reputation system, for the algorithm steps of reputation representation, updates, integration and trust evolution. This framework is available as a middleware service on motes and has been ported to two sensor network operating systems, TinyOS and SOS. We evaluate the efficacy of this framework using multiple contexts: (1) a lab-scale test bed of Mica2 motes, (2) Avrora simulations, and (3) real data sets collected from sensor network deployments in James Reserve.

Reputation-based framework for high integrity sensor networks

In this position paper we investigate the security of cyber-physical systems. We (1) identify and define the problem of secure control, (2) investigate the defenses that information security and control theory can provide, and (3) propose a set of challenges that need to be addressed to improve the survivability of cyber-physical systems.

/pdf/secure-control-towards-survivable-cyber-physical-systems-wcpsudtimg.pdf

Secure Control: Towards Survivable Cyber-Physical Systems

This paper examines the security vulnerabilities and threats imposed by the inherent open nature of wireless communications and to devise efficient defense mechanisms for improving the wireless network security. We first summarize the security requirements of wireless networks, including their authenticity, confidentiality, integrity and availability issues. Next, a comprehensive overview of security attacks encountered in wireless networks is presented in view of the network protocol architecture, where the potential security threats are discussed at each protocol layer. We also provide a survey of the existing security protocols and algorithms that are adopted in the existing wireless network standards, such as the Bluetooth, Wi-Fi, WiMAX, and the long-term evolution (LTE) systems. Then, we discuss the state-of-the-art in physical-layer security, which is an emerging technique of securing the open communications environment against eavesdropping attacks at the physical layer. We also introduce the family of various jamming attacks and their counter-measures, including the constant jammer, intermittent jammer, reactive jammer, adaptive jammer and intelligent jammer. Additionally, we discuss the integration of physical-layer security into existing authentication and cryptography mechanisms for further securing wireless networks. Finally, some technical challenges which remain unresolved at the time of writing are summarized and the future trends in wireless security are discussed.

/pdf/a-survey-on-wireless-security-technical-challenges-recent-k705wofne7.pdf

A Survey on Wireless Security: Technical Challenges, Recent Advances and Future Trends

https://www.eecs.ucf.edu/~turgut/Research/Publications/Download/Boukerche-2011-ComputerNetworks.pdf

Survey Paper: Routing protocols in ad hoc networks: A survey

With sensor networks on the verge of deployment, security issues pertaining to the sensor networks are in the limelight. Though the security in sensor networks share many characteristics with wireless ad hoc networks, the two fields are rapidly diverging due to the fundamental differences between the make-up and goals of the two types of networks. Perhaps the greatest dividing difference is the energy and computational abilities. Sensor nodes are typically smaller, less powerful, and more prone to failure than nodes in an ad hoc network. These differences indicate that protocols that are valid in the context of ad-hoc networks may not be directly applicable for sensor networks. In this paper, we survey the state of art in securing wireless sensor networks. We review several protocols that provide security in sensor networks, with an emphasis on authentication, key management and distribution, secure routing, and methods for intrusion detection. Copyright © 2006 John Wiley & Sons, Ltd.

https://www.cs.arizona.edu/classes/cs625/fall10/Survey_security_sensors.pdf

Security in wireless sensor networks

We present a self-healing On-demand Geographic Path Routing Protocol (OGPR) for mobile ad-hoc networks. OGPR is an efficient, stateless, and scalable routing protocol that inherits the best of the three well-known techniques for routing in ad-hoc networks, viz., greedy forwarding, reactive route discovery, and source routing. In OGPR protocol, source nodes utilize the geographic-topology information obtained during the location request phase to establish geographic paths to their respective destinations. Geographic paths decouple node ID's from the paths and are immune to changes in the network topology. Further, they help nodes avoid dead-ends due to greedy forwarding. To utilize geographic paths even in sparser networks, OGPR uses a path-healing mechanism that helps geographic paths adapt according to the network topology. We present extensions to OGPR protocol to cope with networks containing unidirectional links. Further, we present results from an extensive simulation study using GloMoSim. Simulation results show that OGPR achieves higher percentage packet delivery and lower control overhead, compared to a combination of GPSR+GLS protocols, AODV, and DSR under a wide range of network scenarios.

A self-healing On-demand Geographic Path Routing Protocol for mobile ad-hoc networks

We present angular routing protocol (ARP) for mobile ad-hoc networks. ARP is a new position-based routing protocol that uses an improved geographic forwarding route packets as and when possible. If the geographic forwarding fails, it uses an angle-based forwarding scheme to circumvent voids in sparser networks. ARP does not require a routing table nor does it require nodes to establish/maintain routes. Each node maintains a one-hop neighbor table using an adaptive beaconing protocol. Nodes forward packets to the destination solely based on the neighbor table. To evaluate the performance of our protocol we simulated ARP in GloMoSim. Our simulation study shows that our protocol achieves high packet delivery rate while incurring low overhead compared to greedy perimeter stateless routing (GPSR)

Angular Routing Protocol for Mobile Ad Hoc Networks

In Mobile Ad Hoc Networks (MANETs), nodes depend on each other for routing and forwarding packets. Cooperation among nodes is a key issue in such an environment. However, some of the nodes in MANETs may behave selfishly and may not forward packets to save battery and other resources. Since nodes in MANETs communicate on a peer-to-peer basis, without any central authority (which can monitor selfish behavior of nodes), a centralized solution to stimulate cooperation is not suitable. In this paper, we present a distributed solution to judge, punish and re-admit a selfish node, forcing nodes to cooperate with each other. Unlike previous solutions, we focus on the fairness, i.e., to provide the same chance to all nodes to gain services from the network and to offer services to the network. We also consider the location privilege and counting retransmission problems which have not been emphasized in any of the previous solutions. We combine our scheme with AODV. To evaluate the performance of our scheme, we conducted simulations using Glomosim. Simulation results show that the proposed scheme improves data forwarding capability substantially in presence of selfish nodes.

Venkata C. Giruka

Papers

Security in wireless sensor networks

A self-healing On-demand Geographic Path Routing Protocol for mobile ad-hoc networks

Angular Routing Protocol for Mobile Ad Hoc Networks

A Fair Distributed Solution for Selfish Nodes Problem in Wireless Ad Hoc Networks

Truthful multipath routing for ad hoc networks with selfish nodes