A critical analysis of research potential, challenges and future directives in industrial wireless sensor networks

In recent years, Industrial Wireless Sensor Networks (IWSNs) have emerged as an important research theme with applications spanning a wide range of industries including automation, monitoring, process control, feedback systems and automotive. Wide scope of IWSNs applications ranging from small production units, large oil and gas industries to nuclear fission control, enables a fast-paced research in this field. Though IWSNs offer advantages of low cost, flexibility, scalability, self-healing, easy deployment and reformation, yet they pose certain limitations on available potential and introduce challenges on multiple fronts due to their susceptibility to highly complex and uncertain industrial environments. In this paper a detailed discussion on design objectives, challenges and solutions, for IWSNs, are presented. A careful evaluation of industrial systems, deadlines and possible hazards in industrial atmosphere are discussed. The paper also presents a thorough review of the existing standards and industrial protocols and gives a critical evaluation of potential of these standards and protocols along with a detailed discussion on available hardware platforms, specific industrial energy harvesting techniques and their capabilities. The paper lists main service providers for IWSNs solutions and gives insight of future trends and research gaps in the field of IWSNs

A Scheduling Algorithm to Maximize Storm Throughput in Heterogeneous Cluster

In the most popular distributed stream processing frameworks (DSPFs), programs are modeled as a directed acyclic graph. This model allows a DSPF to benefit from the parallelism power of distributed clusters. However, choosing the proper number of vertices for each operator and finding an appropriate mapping between these vertices and processing resources have a determinative effect on overall throughput and resource utilization; while the simplicity of current DSPFs' schedulers leads these frameworks to perform poorly on large-scale clusters. In this paper, we present the design and implementation of a heterogeneity-aware scheduling algorithm that finds the proper number of the vertices of an application graph and maps them to the most suitable cluster node. We start to scale up the application graph over a given cluster gradually, by increasing the topology input rate and taking new instances from bottlenecked vertices. Our experimental results on Storm Micro-Benchmark show that 1) the prediction model estimate CPU utilization with 92% accuracy. 2) Compared to default scheduler of Storm, our scheduler provides 7% to 44% throughput enhancement. 3) The proposed method can find the solution within 4% (worst case) of the optimal scheduler which obtains the best scheduling scenario using an exhaustive search on problem design space

Block Placement Strategies for Fault-Resilient Distributed Tuple Spaces: An Experimental Study - (Practical Experience Report)

The tuple space abstraction provides an easy-to-use programming paradigm for distributed applications. Intuitively, it behaves like a distributed shared memory, where applications write and read entries (tuples). When deployed over a wide area network, the tuple space needs to efficiently cope with faults of links and nodes. Erasure coding techniques are increasingly popular to deal with such catastrophic events, in particular due to their storage efficiency with respect to replication. When a client writes a tuple into the system, this is first striped into k blocks and encoded into n > k blocks, in a fault-redundant manner. Then, any k out of the n blocks are sufficient to reconstruct and read the tuple. This paper presents several strategies to place those blocks across the set of nodes of a wide area network, that all together form the tuple space. We present the performance trade-offs of different placement strategies by means of simulations and a Python implementation of a distributed tuple space. Our results reveal important differences in the efficiency of the different strategies, for example in terms of block fetching latency, and that having some knowledge of the underlying network graph topology is highly beneficia

Energy sink-holes avoidance method based on fuzzy system in wireless sensor networks

The existence of a mobile sink for gathering data significantly extends wireless sensor networks (WSNs) lifetime. In recent years, a variety of efficient rendezvous points-based sink mobility approaches has been proposed for avoiding the energy sink-holes problem nearby the sink, diminishing buffer overflow of sensors, and reducing the data latency. Nevertheless, lots of research has been carried out to sort out the energy holes problem using controllable-based sink mobility methods. However, further developments can be demonstrated and achieved on such type of mobility management system. In this paper, a well-rounded strategy involving an energy-efficient routing protocol along with a controllable-based sink mobility method is proposed to extirpate the energy sink-holes problem. This paper fused the fuzzy A-star as a routing protocol for mitigating the energy consumption during data forwarding along with a novel sink mobility method which adopted a grid partitioning system and fuzzy system that takes account of the average residual energy, sensors density, average traffic load, and sources angles to detect the optimal next location of the mobile sink. By utilizing diverse performance metrics, the empirical analysis of our proposed work showed an outstanding result as compared with fuzzy A-star protocol in the case of a static sink

Impact of CoMP VNF Placement on 5G Coordinated Scheduling Performance

To address demanding requirements in terms of expected throughput, latency and scalability, 5G networks will offer high capacity to support huge volumes of traffic generated by heterogeneous services. Dense deployment of small cells can provide a valid solution but are prone to high levels of interference especially at the cell-edge. However, to reduce inter-cell interference and improve cell-edge throughput, a set of techniques known as Coordinated Multipoint (CoMP) has been introduced. Coordinated Scheduling (CS) is a CoMP technique that assigns resources to mobile users to avoid interference between users that are assigned within the same Physical Resource Blocks (PRBs). On the other hand, Software Defined Mobile Networking (SDMN) and Network Function Virtualization (NFV) represent two key technologies to enhance flexibility and efficiency of resource usage within the Radio Access Network (RAN). However, the implementation of CoMP CS techniques on NFV architecture in a dense small cell scenario have not been analyzed yet. In this paper, we propose the joint use of CoMP CS and NFV by studying the implications of different deployment strategies, as constrained by the physical topology of the underlying RAN. The performance of both distributed and centralized CoMP CS are compared in terms of convergence delay and traffic overhead. Guidelines for the optimal design are provided.This work was partially supported by the Italian Government under CIPE resolution no. 135 (December 21, 2012), project INnovating City Planning through Information and Communication Technologies (INCIPICT) and by the EC through the H2020 5G-TRANSFORMER project (Project ID 761536)

DADC: A Novel Duty-cycling Scheme for IEEE 802.15.4 Cluster-tree-based IoT Applications

[EN] The IEEE 802.15.4 standard is one of the widely adopted specifications for realizing different applications of the Internet of Things. It defines several physical layer options and Medium Access Control (MAC) sublayer for devices with low-power operating at low data rates. As devices implementing this standard are primarily battery-powered, minimizing their power consumption is a significant concern. Duty-cycling is one such power conserving mechanism that allows a device to schedule its active and inactive radio periods effectively, thus preventing energy drain due to idle listening. The standard specifies two parameters, beacon order and superframe order, which define the active and inactive period of a device. However, it does not specify a duty-cycling scheme to adapt these parameters for varying network conditions. Existing works in this direction are either based on superframe occupation ratio or buffer/queue length of devices. In this article, the particular limitations of both the approaches mentioned above are presented. Later, a novel duty-cycling mechanism based on MAC parameters is proposed. Also, we analyze the role of synchronization schemes in achieving efficient duty-cycles in synchronized cluster-tree network topologies. A Markov model has also been developed for the MAC protocol to estimate the delay and energy consumption during frame transmission.This work is supported by Science and Engineering Research Board, Department of Science and Technology, Government of India under ECR 2016, Grant No. 2016/001651. This work has been partially supported by the "Ministerio de Economia y Competitividad" in the "Programa Estatal de Fomento de la Investigacion Cientifica y Tecnica de Excelencia," "Subprograma Estatal de Generacion de Conocimiento," within the project under Grant No. TIN2017-84802-C2-1-P. This work has also been partially supported by European Union through the ERANETMED (Euromediterranean Cooperation through ERANET joint activities and beyond) Project ERANETMED3-227 SMARTWATIR.Choudhury, N.; Matam, R.; Mukherjee, M.; Lloret, J. (2021). DADC: A Novel Duty-cycling Scheme for IEEE 802.15.4 Cluster-tree-based IoT Applications. ACM Transactions on Internet Technology. 22(2). https://doi.org/10.1145/3409487S22