Persistent Stealthy Attacks and their Detection in Large Distributed Cyber-Physical Systems

Cyber-Physical Systems (CPS) are increasingly targeted by attackers using a wide and evolving array of methods. When these systems are distributed, every node represents a potential vulnerability, and secure system design must take this into account. Distributed CPSs also have the potential to better detect and handle attacks, by leveraging redundancies of physical measurements between adjacent nodes. The main purpose of this research is to determine the conditions that render a distributed CPS more resistant to attacks, and the conditions that render it more vulnerable. The work is centered around two separate applications: The Smart Grid and Autonomous Drone Swarms. In the first application power theft in the Smart Grid is studied and the difficulty of identifying small persistent attacks between semi-trusted nodes is established. A general approach to handling persistent economic attacks is proposed and analyzed. The second application intrusion of non-compliant drones into a system of flocking drones is considered. An approach to detecting intrusions is proposed and tested in simulations. In both applications the residual sum metric is proposed as a basis for detection --Abstract, p. ii

A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks

The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET

Observing the clouds : a survey and taxonomy of cloud monitoring

This research was supported by a Royal Society Industry Fellowship and an Amazon Web Services (AWS) grant. Date of Acceptance: 10/12/2014Monitoring is an important aspect of designing and maintaining large-scale systems. Cloud computing presents a unique set of challenges to monitoring including: on-demand infrastructure, unprecedented scalability, rapid elasticity and performance uncertainty. There are a wide range of monitoring tools originating from cluster and high-performance computing, grid computing and enterprise computing, as well as a series of newer bespoke tools, which have been designed exclusively for cloud monitoring. These tools express a number of common elements and designs, which address the demands of cloud monitoring to various degrees. This paper performs an exhaustive survey of contemporary monitoring tools from which we derive a taxonomy, which examines how effectively existing tools and designs meet the challenges of cloud monitoring. We conclude by examining the socio-technical aspects of monitoring, and investigate the engineering challenges and practices behind implementing monitoring strategies for cloud computing.Publisher PDFPeer reviewe

Security in Wireless Sensor Networks Employing MACGSP6

Wireless Sensor Networks (WSNs) have unique characteristics which constrain them; including small energy stores, limited computation, and short range communication capability. Most traditional security algorithms use cryptographic primitives such as Public-key cryptography and are not optimized for energy usage. Employing these algorithms for the security of WSNs is often not practical. At the same time, the need for security in WSNs is unavoidable. Applications such as military, medical care, structural monitoring, and surveillance systems require information security in the network. As current security mechanisms for WSNs are not sufficient, development of new security schemes for WSNs is necessary. New security schemes may be able to take advantage of the unique properties of WSNs, such as the large numbers of nodes typical in these networks to mitigate the need for cryptographic algorithms and key distribution and management. However, taking advantage of these properties must be done in an energy efficient manner. The research examines how the redundancy in WSNs can provide some security elements. The research shows how multiple random delivery paths (MRDPs) can provide data integrity for WSNs. Second, the research employs multiple sinks to increase the total number of duplicate packets received by sinks, allowing sink voting to mitigate the packet discard rate issue of a WSN with a single sink. Third, the research examines the effectiveness of using multiple random paths in maintaining data confidentiality in WSNs. Last, the research examines the use of a rate limit to cope with packet flooding attacks in WSNs

A Trustworthy and well-organized data disseminating scheme for ad-hoc wsns

Wireless Sensor Networks (WSNs) generate massive amount of live data and events sensed through dispersedly deployed tiny sensors. This generated data needed to be disseminate to the sink with slight consumption of network resources. One of the ways to efficiently transmit this bulk data is gossiping. An important consideration in gossip-based dissemination protocols is to keep routing table up to date. Considering the inherent resource constrained nature of adhoc wireless sensor networks, we propose a gossip based protocol that consumes little resources. Our proposed scheme aims to keep the routing table size R as low as possible yet it ensures that the diameter is small too. We learned the performance of our proposed protocol through simulations. Results show that our proposed protocol attains major improvement in network reachability and connectivity.Comment: 12 Pages, IJCNC 201

Wireless Sensor Network transport protocol: A critical review

The transport protocols for Wireless Sensor Network (WSN) play vital role in achieving the high performance together with longevity of the network. The researchers are continuously contributing in developing new transport layer protocols based on different principles and architectures enabling different combinations of technical features. The uniqueness of each new protocol more or less lies in these functional features, which can be commonly classified based on their proficiencies in fulfilling congestion control, reliability support, and prioritization. The performance of these protocols has been evaluated using dissimilar set of experimental/simulation parameters, thus there is no well defined benchmark for experimental/simulation settings. The researchers working in this area have to compare the performance of the new protocol with the existing protocols to prove that new protocol is better. However, one of the major challenges faced by the researchers is investigating the performance of all the existing protocols, which have been tested in different simulation environments. This leads the significance of having a well-defined benchmark for the experimental/simulation settings. If the future researchers simulate their protocols according to a standard set of simulation/experimental settings, the performance of those protocols can be directly compared with each other just using the published simulation results.This article offers a twofold contribution to support researchers working in the area of WSN transport protocol design. First, we extensively review the technical features of existing transport protocols and suggest a generic framework for a WSN transport protocol, which offers a strong groundwork for the new researchers to identify the open research issues. Second we analyse the experimental settings, focused application areas and the addressed performance criteria of existing protocols; thus suggest a benchmark of experimental/simulation settings for evaluating prospective transport protocols

Crossing Roads of Federated Learning and Smart Grids: Overview, Challenges, and Perspectives

Consumer's privacy is a main concern in Smart Grids (SGs) due to the sensitivity of energy data, particularly when used to train machine learning models for different services. These data-driven models often require huge amounts of data to achieve acceptable performance leading in most cases to risks of privacy leakage. By pushing the training to the edge, Federated Learning (FL) offers a good compromise between privacy preservation and the predictive performance of these models. The current paper presents an overview of FL applications in SGs while discussing their advantages and drawbacks, mainly in load forecasting, electric vehicles, fault diagnoses, load disaggregation and renewable energies. In addition, an analysis of main design trends and possible taxonomies is provided considering data partitioning, the communication topology, and security mechanisms. Towards the end, an overview of main challenges facing this technology and potential future directions is presented

In-Network Outlier Detection in Wireless Sensor Networks

To address the problem of unsupervised outlier detection in wireless sensor networks, we develop an approach that (1) is flexible with respect to the outlier definition, (2) computes the result in-network to reduce both bandwidth and energy usage,(3) only uses single hop communication thus permitting very simple node failure detection and message reliability assurance mechanisms (e.g., carrier-sense), and (4) seamlessly accommodates dynamic updates to data. We examine performance using simulation with real sensor data streams. Our results demonstrate that our approach is accurate and imposes a reasonable communication load and level of power consumption.Comment: Extended version of a paper appearing in the Int'l Conference on Distributed Computing Systems 200