Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems

Atomic registers are certainly the most basic objects of computing science. Their implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t \textless{} n/2 (where t is the maximal number of processes that may crash) is a necessary and sufficient requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper presents an algorithm which implements a single-writer multi-reader atomic register with four message types only, and where no message needs to carry control information in addition to its type. Hence, two bits are sufficient to capture all the control information carried by all the implementation messages. Moreover, the messages of two types need to carry a data value while the messages of the two other types carry no value at all. As far as we know, this algorithm is the first with such an optimality property on the size of control information carried by messages. It is also particularly efficient from a time complexity point of view

Improved Fair-Zone technique using Mobility Prediction in WSN

The self-organizational ability of ad-hoc Wireless Sensor Networks (WSNs) has led them to be the most popular choice in ubiquitous computing. Clustering sensor nodes organizing them hierarchically have proven to be an effective method to provide better data aggregation and scalability for the sensor network while conserving limited energy. It has some limitation in energy and mobility of nodes. In this paper we propose a mobility prediction technique which tries overcoming above mentioned problems and improves the life time of the network. The technique used here is Exponential Moving Average for online updates of nodal contact probability in cluster based network.Comment: 10 pages, 7 figures, Published in International Journal Of Advanced Smart Sensor Network Systems (IJASSN

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

Fuzzy-based fault-tolerant and instant synchronization routing technique in wireless sensor network for rapid transit system

In the present era, rapid transits are one of the most affordable means of public transport with various useful integrated application systems. The majority of the integrated applications are deployed in concern over safety and precautionary measures against the worst side-effects of unfortunate emergencies. For such cases, high-end reliable and autonomous systems provide possible positive solutions. Wireless Sensor Network is one of the suitable choices for rapid transit applications to gain positive results with inexpensive implementation cost. However, managing few network consequences like fault tolerance, energy balancing and routing critical informative packets are considered to be the challenging task due to their limited resource usage restriction. In this paper, a novel fuzzy logic-based fault tolerance and instant synchronized routing technique have been proposed specifically for the rapid transit system. On utilizing the fuzzy logic concepts, most of the computational complexities and uncertainties of the system is reduced. The central thematic of the proposed design is concerned over the synchronized routing and permanent faults which abruptly depicts the non-functional nature of the sensor nodes during normal operations. Moreover, our proposed simulation outcomes proved to be improvised evidence on obtaining maximum packet delivery ratio which tends to handle an emergency situation in the compartments of rapid transits

A Unified Wireless Sensor Network Framework

Wireless sensor networks (WSNs) have been a significant area of research over the past decade. WSN systems are used in a wide range of applications such as surveillance, environmental monitoring, target tracking, wildlife tracking, personal health monitoring, machinery monitoring, and many others. With such wide ranging applications, there is active research in nearly every facet of the field including network topologies, communication protocols, node localization, time synchronization, and sensor data processing. This movement has largely been the result of the advances in microelectronics and low-power radio systems. These advancements have enabled the design and implementation of small, powerful, low-power, wireless sensor network systems. Like any emerging technology, a standard needs to be established to allow the advances in the field to be directly leveraged rather than requiring reinvention. This paper outlines the traditional approaches to WSN system design, and in contrast, proposes the necessary components of a unified WSN framework that would support the majority of present applications as well as providing the foundation for further advancements in the field

Concepts and evolution of research in the field of wireless sensor networks

The field of Wireless Sensor Networks (WSNs) is experiencing a resurgence of interest and a continuous evolution in the scientific and industrial community. The use of this particular type of ad hoc network is becoming increasingly important in many contexts, regardless of geographical position and so, according to a set of possible application. WSNs offer interesting low cost and easily deployable solutions to perform a remote real time monitoring, target tracking and recognition of physical phenomenon. The uses of these sensors organized into a network continue to reveal a set of research questions according to particularities target applications. Despite difficulties introduced by sensor resources constraints, research contributions in this field are growing day by day. In this paper, we present a comprehensive review of most recent literature of WSNs and outline open research issues in this field

Byzantine-Tolerant Set-Constrained Delivery Broadcast

Set-Constrained Delivery Broadcast (SCD-broadcast), recently introduced at ICDCN 2018, is a high-level communication abstraction that captures ordering properties not between individual messages but between sets of messages. More precisely, it allows processes to broadcast messages and deliver sets of messages, under the constraint that if a process delivers a set containing a message m before a set containing a message m\u27, then no other process delivers first a set containing m\u27 and later a set containing m. It has been shown that SCD-broadcast and read/write registers are computationally equivalent, and an algorithm implementing SCD-broadcast is known in the context of asynchronous message passing systems prone to crash failures. This paper introduces a Byzantine-tolerant SCD-broadcast algorithm, which we call BSCD-broadcast. Our proposed algorithm assumes an underlying basic Byzantine-tolerant reliable broadcast abstraction. We first introduce an intermediary communication primitive, Byzantine FIFO broadcast (BFIFO-broadcast), which we then use as a primitive in our final BSCD-broadcast algorithm. Unlike the original SCD-broadcast algorithm that is tolerant to up to t<n/2 crashing processes, and unlike the underlying Byzantine reliable broadcast primitive that is tolerant to up to t<n/3 Byzantine processes, our BSCD-broadcast algorithm is tolerant to up to t<n/4 Byzantine processes. As an illustration of the high abstraction power provided by the BSCD-broadcast primitive, we show that it can be used to implement a Byzantine-tolerant read/write snapshot object in an extremely simple way