Enhancement of Performance Metrics of Heterogeneous Wireless Camera Sensor Network with Functionalization of Extensive Zonal Stable Election Protocol using Threshold Amplification and Residual Energy

We report a new improved energy competent and optimized data packet flow protocol with Hierarchical Clustering utilized in Wireless camera Sensor Network.The existing Extensive Zonal Stable Election Protocol has been modified along with the threshold parameters amplification and residual energy. It incorporates dynamic hybrid method with finite number of Member Sensor nodes (MSN) in proximity with the base station share their data directly , while the rest of the farther nodes form a cluster for data transference using Cluster Head. The performance metrics accompanied by heterogeneity, longer network survival and better throughput have been improved. The network field was divided into 4 zones with a gateway for defined region 2, 3, and 4. The criterion for zone division remained on the energy status (residual) of the MSNs and distance from the BS and the formulated field characteristics in the simulation were kept unknown. The obtained results demonstrate that our proposed modified version of EZSE protocol considerably performs better than existing EZ-SEP, Z-SEP, SEP, LEACH, Mod-Leach protocols during entire stability timeframe. The notable achievement is also reported in throughput as the same is enhanced more than  by ~ 39%, 43%, 49% ,56%, 53% while total packets communicated with base station has been increased more than by ~ 127%, 131%, 147%, 151%, 148% stability of the network is also improved more than by ~ 37%, 42%, 45%, 49%, 51% with the corresponding increase in the heterogeneity of networks

Energy-efficient routing algorithms based on swarm intelligence for wireless sensor networks

High efficient routing is an important factor to be considered in the design of limited energy resource Wireless Sensor Networks (WSNs). WSN environment has limited resources in terms of on-board energy, transmission power, processing, and storage, and this prompt for careful resource management and new routing protocol so as to counteract the challenges. This work first introduces the concept of wireless sensor networks, routing in WSNs, and its design factors as they affect routing protocols. Next, a comprehensive review of the most prominent routing protocols in WSN, from the classical routing protocols to swarm intelligence based protocols is presented. From the literature study, it was found that comparing routing protocols in WSNs is currently a very challenging task for protocol designers. Often, much time is required to re-create and re-simulate algorithms from descriptions in published papers to perform the comparison. Compounding the difficulty is that some simulation parameters and performance metrics may not be mentioned. We then see a need in the research community to have standard simulation and performance metrics for comparing different protocols. To this end, we re-simulate different protocols using a Matlab based simulator; Routing Modeling Application Simulation Environment (RMASE), and gives simulation results for standard simulation and performance metrics which we hope will serve as a benchmark for future comparisons for the research community. Also, from the literature study, Energy Efficient Ant-Based Routing (EEABR) protocol was found to be the most efficient protocol due to its low energy consumption and low memory usage in WSNs nodes. Following this efficient protocol, an Improved Energy Efficient Ant-Based Routing (IEEABR) Protocol was proposed. Simulation were performed using Network Simulator-2 (NS-2), and from the results, our proposed algorithm performs better in terms of energy utilization efficiency, average energy of network nodes, and minimum energy of nodes. We further improved on the proposed protocol and simulation performed in another well-known WSNs MATLAB-based simulator; Routing Modeling Application Simulation Environment (RMASE), using static, mobile and dynamic scenario. Simulation results show that the proposed algorithm increases energy efficiency by up to 9% and 64% in converge-cast and target-tracking scenarios, respectively, over the original EEABR and also found to out-perform other four Ant-based routing protocols. We further show how this algorithm could be used for energy management in sensor network in the presence of energy harvesters. However, high number of control packets is generated by the IEEABR due to the proactive nature of its path establishment. As such, a new routing protocol for WSNs that has less control packets due to its on-demand (reactive) nature is proposed. This new routing protocol termed Termite-hill is borrowed from the principles behind the termite’s mode of communication. We first study the foraging principles of a termite colony and utilize the inspirational concepts to develop a distributed, simple and energy-efficient routing protocol for WSNs. We perform simulation studies to compare the behavior and performance of the Termite-hill design with an existing classical and on-demand protocol (AODV) and other Swarm Intelligence (SI) based WSN protocols in both static, dynamic and mobility scenarios of WSN. The simulation results demonstrate that Termite-hill outperforms its competitors in most of the assumed scenarios and metrics with less latency. Further studies show that the current practice in modeling and simulation of wireless sensor network (WSN) environments has been towards the development of functional WSN systems for event gathering, and optimization of the necessary performance metrics using heuristics and intuition. The evaluation and validation are mostly done using simulation approaches and practical implementations. Simulation studies, despite their wide use and merits of network systems and algorithm validation, have some drawbacks like long simulation times, and practical implementation might be cost ineffective if the system is not properly studied before the design. We therefore argue that simulation based validation and practical implementation of WSN systems and environments should be further strengthened through mathematical analysis. To conclude this work and to gain more insight on the behavior of the termite-hill routing algorithm, we developed our modeling framework for WSN topology and information extraction in a grid based and line based randomly distributed sensor network. We strengthen the work with a model of the effect of node mobility on energy consumption of Termite-hill routing algorithm as a function of event success rate and occasional change in topology. The results of our mathematical analysis were also compared with the simulation results

Physical Unclonability Framework for the Internet of Things

Ph. D. ThesisThe rise of the Internet of Things (IoT) creates a tendency to construct unified architectures with a great number of edge nodes and inherent security risks due to centralisation. At the same time, security and privacy defenders advocate for decentralised solutions which divide the control and the responsibility among the entirety of the network nodes. However, spreading secrets among several parties also expands the attack surface. This conflict is in part due to the difficulty in differentiating between instances of the same hardware, which leads to treating physically distinct devices as identical. Harnessing the uniqueness of each connected device and injecting it into security protocols can provide solutions to several common issues of the IoT. Secrets can be generated directly from this uniqueness without the need to manually embed them into devices, reducing both the risk of exposure and the cost of managing great numbers of devices. Uniqueness can then lead to the primitive of unclonability. Unclonability refers to ensuring the difficulty of producing an exact duplicate of an entity via observing and measuring the entity’s features and behaviour. Unclonability has been realised on a physical level via the use of Physical Unclonable Functions (PUFs). PUFs are constructions that extract the inherent unclonable features of objects and compound them into a usable form, often that of binary data. PUFs are also exceptionally useful in IoT applications since they are low-cost, easy to integrate into existing designs, and have the potential to replace expensive cryptographic operations. Thus, a great number of solutions have been developed to integrate PUFs in various security scenarios. However, methods to expand unclonability into a complete security framework have not been thoroughly studied. In this work, the foundations are set for the development of such a framework through the formulation of an unclonability stack, in the paradigm of the OSI reference model. The stack comprises layers propagating the primitive from the unclonable PUF ICs, to devices, network links and eventually unclonable systems. Those layers are introduced, and work towards the design of protocols and methods for several of the layers is presented. A collection of protocols based on one or more unclonable tokens or authority devices is proposed, to enable the secure introduction of network nodes into groups or neighbourhoods. The role of the authority devices is that of a consolidated, observable root of ownership, whose physical state can be verified. After their introduction, nodes are able to identify and interact with their peers, exchange keys and form relationships, without the need of continued interaction with the authority device. Building on this introduction scheme, methods for establishing and maintaining unclonable links between pairs of nodes are introduced. These pairwise links are essential for the construction of relationships among multiple network nodes, in a variety of topologies. Those topologies and the resulting relationships are formulated and discussed. While the framework does not depend on specific PUF hardware, SRAM PUFs are chosen as a case study since they are commonly used and based on components that are already present in the majority of IoT devices. In the context of SRAM PUFs and with a view to the proposed framework, practical issues affecting the adoption of PUFs in security protocols are discussed. Methods of improving the capabilities of SRAM PUFs are also proposed, based on experimental data.School of Engineering Newcastle Universit

Security in Distributed, Grid, Mobile, and Pervasive Computing

This book addresses the increasing demand to guarantee privacy, integrity, and availability of resources in networks and distributed systems. It first reviews security issues and challenges in content distribution networks, describes key agreement protocols based on the Diffie-Hellman key exchange and key management protocols for complex distributed systems like the Internet, and discusses securing design patterns for distributed systems. The next section focuses on security in mobile computing and wireless networks. After a section on grid computing security, the book presents an overview of security solutions for pervasive healthcare systems and surveys wireless sensor network security

Semantic discovery and reuse of business process patterns

Patterns currently play an important role in modern information systems (IS) development and their use has mainly been restricted to the design and implementation phases of the development lifecycle. Given the increasing significance of business modelling in IS development, patterns have the potential of providing a viable solution for promoting reusability of recurrent generalized models in the very early stages of development. As a statement of research-in-progress this paper focuses on business process patterns and proposes an initial methodological framework for the discovery and reuse of business process patterns within the IS development lifecycle. The framework borrows ideas from the domain engineering literature and proposes the use of semantics to drive both the discovery of patterns as well as their reuse