Time constrained fault tolerance and management framework for k-connected distributed wireless sensor networks based on composite event detection

Wireless sensor nodes themselves are exceptionally complex systems where a variety of components interact in a complex way. In enterprise scenarios it becomes highly important to hide the details of the underlying sensor networks from the applications and to guarantee a minimum level of reliability of the system. One of the challenges faced to achieve this level of reliability is to overcome the failures frequently faced by sensor networks due to their tight integration with the environment. Failures can generate false information, which may trigger incorrect business processes, resulting in additional costs. Sensor networks are inherently fault prone due to the shared wireless communication medium. Thus, sensor nodes can lose synchrony and their programs can reach arbitrary states. Since on-site maintenance is not feasible, sensor network applications should be local and communication-efficient self-healing. Also, as per my knowledge, no such general framework exist that addresses all the fault issues one may encounter in a WSN, based on the extensive, exhaustive and comprehensive literature survey in the related areas of research. As one of the main goals of enterprise applications is to reduce the costs of business processes, a complete and more general Fault Tolerance and management framework for a general WSN, irrespective of the node types and deployment conditions is proposed which would help to mitigate the propagation of failures in a business environment, reduce the installation and maintenance costs and to gain deployment flexibility to allow for unobtrusive installation

Improving IF Algorithm for Data Aggregation Techniques in Wireless Sensor Networks

In Wireless Sensor Network (WSN), fact from different sensor nodes is collected at assembling node, which is typically complete via modest procedures such as averaging as inadequate computational power and energy resources. Though such collections is identified to be extremely susceptible to node compromising attacks. These approaches are extremely prone to attacks as WSN are typically lacking interfere resilient hardware. Thus, purpose of veracity of facts and prestige of sensor nodes is critical for wireless sensor networks. Therefore, imminent gatherer nodes will be proficient of accomplishment additional cultivated data aggregation algorithms, so creating WSN little unresisting, as the performance of actual low power processors affectedly increases. Iterative filtering algorithms embrace inordinate capacity for such a resolution. The way of allocated the matching mass elements to information delivered by each source, such iterative algorithms concurrently assemble facts from several roots and deliver entrust valuation of these roots. Though suggestively extra substantial against collusion attacks beside the modest averaging techniques, are quiet vulnerable to a different cultivated attack familiarize. The existing literature is surveyed in this paper to have a study of iterative filtering techniques and a detailed comparison is provided. At the end of this paper new technique of improved iterative filtering is proposed with the help of literature survey and drawbacks found in the literature

Secured System Layer Routing Protocols On Imperative Sensor Nodes

Sensor technology has shown tremendous development in the field of data environment like tracking and detection. The participating sensor nodes are prone to failure because of limited resources or limitations in security. The topology of the networks is highly dynamic in nature because of frequent failure of the sensor nodes. The Quality of Service (QoS) support to highly dynamic networks is one of the challenging tasks. In wireless sensor organize, security is a fundamental position in well-lit of its utilization in applications like monitoring, tracking, controlling, surveillance etc. Secure correspondence is greatly critical in conveying key data precisely and on the time through asset imperative sensor nodes. A 3 stage approach gives a secure message conveyance alternative to amplify the message conveyance proportion under antagonistic assaults. Firstly, we have outlined the system layer routing assaults on WSNs. Also, we have given a scientific categorization of secure routing protocols of WSNs. Thirdly, we have given a subjective correlation of existing secure routing protocols. The above quantitative secure investigation on the proposed routing convention in light of the criteria proposed

Autonomous Flight, Fault, and Energy Management of the Flying Fish Solar-Powered Seaplane.

The Flying Fish autonomous unmanned seaplane is designed and built for persistent ocean surveillance. Solar energy harvesting and always-on autonomous control and guidance are required to achieve unattended long-term operation. This thesis describes the Flying Fish avionics and software systems that enable the system to plan, self-initiate, and autonomously execute drift-flight cycles necessary to maintain a designated watch circle subject to environmentally influenced drift. We first present the avionics and flight software architecture developed for the unique challenges of an autonomous energy-harvesting seaplane requiring the system to be: waterproof, robust over a variety of sea states, and lightweight for flight. Seaplane kinematics and dynamics are developed based on conventional aircraft and watercraft and upon empirical flight test data. These models serve as the basis for development of flight control and guidance strategies which take the form of a cyclic multi-mode guidance protocol that smoothly transitions between nested gain-scheduled proportional-derivative feedback control laws tuned for the trim conditions of each flight mode. A fault-tolerant airspeed sensing system is developed in response to elevated failure rates arising from pitot probe water ingestion in the test environment. The fault-tolerance strategy utilizes sensor characteristics and signal energy to combine redundant sensor measurements in a weighted voting strategy, handling repeated failures, sensor recovery, non-homogenous sensors, and periods of complete sensing failure. Finally, a graph-based mission planner combines models of global solar energy, local ocean-currents, and wind with flight-verified/derived aircraft models to provide an energy-aware flight planning tool. An NP-hard asymmetric multi-visit traveling salesman planning problem is posed that integrates vehicle performance and environment models using energy as the primary cost metric. A novel A* search heuristic is presented to improve search efficiency relative to uniform cost search. A series of cases studies are conducted with surface and airborne goals for various times of day and for multi-day scenarios. Energy-optimal solutions are identified except in cases where energy harvesting produces multiple comparable-cost plans via negative-cost cycles. The always-on cyclic guidance/control system, airspeed sensor fault management algorithm, and the nested-TSP heuristic for A* are all critical innovation required to solve the posed research challenges.Ph.D.Aerospace EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/91453/1/eubankrd_1.pd

Edge Computing for Internet of Things

The Internet-of-Things is becoming an established technology, with devices being deployed in homes, workplaces, and public areas at an increasingly rapid rate. IoT devices are the core technology of smart-homes, smart-cities, intelligent transport systems, and promise to optimise travel, reduce energy usage and improve quality of life. With the IoT prevalence, the problem of how to manage the vast volumes of data, wide variety and type of data generated, and erratic generation patterns is becoming increasingly clear and challenging. This Special Issue focuses on solving this problem through the use of edge computing. Edge computing offers a solution to managing IoT data through the processing of IoT data close to the location where the data is being generated. Edge computing allows computation to be performed locally, thus reducing the volume of data that needs to be transmitted to remote data centres and Cloud storage. It also allows decisions to be made locally without having to wait for Cloud servers to respond

Reliable load-balancing routing for resource-constrained wireless sensor networks

Wireless sensor networks (WSNs) are energy and resource constrained. Energy limitations make it advantageous to balance radio transmissions across multiple sensor nodes. Thus, load balanced routing is highly desirable and has motivated a significant volume of research. Multihop sensor network architecture can also provide greater coverage, but requires a highly reliable and adaptive routing scheme to accommodate frequent topology changes. Current reliability-oriented protocols degrade energy efficiency and increase network latency. This thesis develops and evaluates a novel solution to provide energy-efficient routing while enhancing packet delivery reliability. This solution, a reliable load-balancing routing (RLBR), makes four contributions in the area of reliability, resiliency and load balancing in support of the primary objective of network lifetime maximisation. The results are captured using real world testbeds as well as simulations. The first contribution uses sensor node emulation, at the instruction cycle level, to characterise the additional processing and computation overhead required by the routing scheme. The second contribution is based on real world testbeds which comprises two different TinyOS-enabled senor platforms under different scenarios. The third contribution extends and evaluates RLBR using large-scale simulations. It is shown that RLBR consumes less energy while reducing topology repair latency and supports various aggregation weights by redistributing packet relaying loads. It also shows a balanced energy usage and a significant lifetime gain. Finally, the forth contribution is a novel variable transmission power control scheme which is created based on the experience gained from prior practical and simulated studies. This power control scheme operates at the data link layer to dynamically reduce unnecessarily high transmission power while maintaining acceptable link reliability