A Coverage Monitoring algorithm based on Learning Automata for Wireless Sensor Networks

To cover a set of targets with known locations within an area with limited or prohibited ground access using a wireless sensor network, one approach is to deploy the sensors remotely, from an aircraft. In this approach, the lack of precise sensor placement is compensated by redundant de-ployment of sensor nodes. This redundancy can also be used for extending the lifetime of the network, if a proper scheduling mechanism is available for scheduling the active and sleep times of sensor nodes in such a way that each node is in active mode only if it is required to. In this pa-per, we propose an efficient scheduling method based on learning automata and we called it LAML, in which each node is equipped with a learning automaton, which helps the node to select its proper state (active or sleep), at any given time. To study the performance of the proposed method, computer simulations are conducted. Results of these simulations show that the pro-posed scheduling method can better prolong the lifetime of the network in comparison to similar existing method

A Survey on IT-Techniques for a Dynamic Emergency Management in Large Infrastructures

This deliverable is a survey on the IT techniques that are relevant to the three use cases of the project EMILI. It describes the state-of-the-art in four complementary IT areas: Data cleansing, supervisory control and data acquisition, wireless sensor networks and complex event processing. Even though the deliverable’s authors have tried to avoid a too technical language and have tried to explain every concept referred to, the deliverable might seem rather technical to readers so far little familiar with the techniques it describes

A survey of self organisation in future cellular networks

This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks

Fuzzy TOPSIS-based Secure Neighbor Discovery Mechanism for Improving Reliable Data Dissemination in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) being an indispensable entity of the Internet of Things (IoT) are found to be more and more widely utilized for the rapid advent of IoT environment. The reliability of data dissemination in the IoT environment completely depends on the secure neighbor discovery mechanism that are utilized for effective and efficient communication among the sensor nodes. Secure neighbor discovery mechanisms that significantly determine trustworthy sensor nodes are essential for maintaining potential connectivity and sustaining reliable data delivery in the energy-constrained self organizing WSN. In this paper, Fuzzy Technique of Order Preference Similarity to the Ideal Solution (TOPSIS)-based Secure Neighbor Discovery Mechanism (FTOPSIS-SNDM) is proposed for estimating the trust of each sensor node in the established routing path for the objective of enhancing reliable data delivery in WSNs. This proposed FTOPSIS-SNDM is proposed as an attempt to integrate the merits of Fuzzy Set Theory (FST) and TOPSIS-based Multi-criteria Decision Making (MCDM) approach, since the discovery of secure neighbors involves the exchange of imprecise data and uncertain behavior of sensor nodes. This secure neighbor is also influenced by the factors of packet forwarding potential, delay, distance from the Base Station (BS) and residual energy, which in turn depends on multiple constraints that could be possibly included into the process of secure neighbor discovery. The simulation investigations of the proposed FTOPSIS-SNDM confirmed its predominance over the benchmarked approaches in terms of throughput, energy consumption, network latency, communication overhead for varying number of genuine and malicious neighboring sensor nodes in network

Dynamic Aggregation Protocol for Wireless Sensor Networks

International audienceSensor networks suffer from limited capabilities such as bandwidth, low processing power, and memory size. There is therefore a need for protocols that deliver sensor data in an energy-efficient way to the sink. One of those techniques, it gathers sensors' data in a small size packet suitable for transmission. In this paper, we propose a new Effective Data Aggregation Protocol (DAP) to reduce the energy consumption in Wireless Sensor Networks (WSNs), which prolongs the network lifetime. This work uses in-network aggregation approach to distribute the processing all over the aggregation path to avoid unbalanced power consumption on specific nodes until they run out. Simulation results prove that DAP, compared to other protocols, achieves more data aggregation percentage and less power consumption for a one data harvesting round