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

Review of Optimization Problems in Wireless Sensor Networks

International audienc

Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks

Generative Boltzmann Adversarial Network in Manet Attack Detection and QOS Enhancement with Latency

Mobile Ad-Hoc Network (MANET) are considered as self-configured network those does not have any centralized base station for the network monitoring and control. MANET environment does not control architecture for routing for the frequent maintenance of topology. The drastic development of Internet leads to adverse effect of development in MANET for different multimedia application those are sensitive to latency. Upon the effective maintenance of the QoS routing route discovery is performed to calculate queue and contention delay. However, the MANET requirement comprises of the complex procedure to withstand the Quality of Service (QoS) with Artificial Intelligence (AI). In MANET it is necessary to compute the MANET attacks with improved QoS with the reduced latency as existing model leads to higher routing and increased latency.  In this paper proposed a Generative Boltzmann Networking Weighted Graph (GBNWG) model for the QoS improvement in MANET to reduce latency. With GBNWG model the MANET model network performance are computed with the weighted graph model. The developed weighted graph computes the routes in the MANET network for the estimation of the available path in the routing metrices. The proposed GBNWG model is comparatively estimated with the conventional QOD technique. Simulation analysis stated that GBNWG scheme exhibits the improved performance in the QoS parameters. The GBNWG scheme improves the PDR value by 12%, 41% reduced control packets and 45% improved throughput value

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

Reliable Fault Tolerance System for Service Composition in Mobile Ad Hoc Network

A Due to the rapid development of smart processing mobile devices, Mobile applications are exploring the use of web services in MANETs to satisfy the user needs. Complex user needs are satisfied by the service composition where a complex service is created by combining one or more atomic services. Service composition has a significant challenge in MANETs due to its limited bandwidth, constrained energy sources, dynamic node movement and often suffers from node failures. These constraints increase the failure rate of service composition. To overcome these, we propose Reliable Fault Tolerant System for Service Composition in MANETs (RFTSC) which makes use of the checkpointing technique for service composition in MANETs. We propose fault policies for each fault in service composition when the faults occur. Failure of services in the service composition process is recovered locally by making use of Checkpointing system and by using discovered services which satisfies the QoS constraints. A Multi-Service Tree (MST) is proposed to recover failed services with O(1) time complexity. Simulation result shows that the proposed approach is efficient when compared to existing approaches