Wireless Sensor Networks (WSNs) are crucial in supporting continuous environmental monitoring, where sensor nodes are deployed and must remain operational to collect and transfer data from the environment to a base-station. However, sensor nodes have limited energy in their primary power storage unit, and this energy may be quickly drained if the sensor node remains operational over long periods of time. Therefore, the idea of harvesting ambient energy from the immediate surroundings of the deployed sensors, to recharge the batteries and to directly power the sensor nodes, has recently been proposed. The deployment of energy harvesting in environmental field systems eliminates the dependency of sensor nodes on battery power, drastically reducing the maintenance costs required to replace batteries. In this article, we review the state-of-the-art in energy-harvesting WSNs for environmental monitoring applications, including Animal Tracking, Air Quality Monitoring, Water Quality Monitoring, and Disaster Monitoring to improve the ecosystem and human life. In addition to presenting the technologies for harvesting energy from ambient sources and the protocols that can take advantage of the harvested energy, we present challenges that must be addressed to further advance energy-harvesting-based WSNs, along with some future work directions to address these challenges.

https://dl.acm.org/doi/pdf/10.1145/3183338

Energy-Harvesting Wireless Sensor Networks (EH-WSNs): A Review

Mobile Ad-Hoc networks are highly dynamic networks characterized by the absence of physical infrastructure. Nodes of these networks functions as a routers which discovers and maintains the routes to other nodes in the network. In such networks, nodes are able to move and synchronize with their neighbors. Due to mobility, connections in the network can change dynamically and nodes can be added and removed at any time. In this paper, we are going to compare Mobile Ad-Hoc network routing protocols DSDV, AODV and DSR using network simulator NS2.34. We have compared the performance of three protocols together and individually too. The performance matrix includes PDR (Packet Delivery Ratio), Throughput, End to End Delay, Routing overhead. We are comparing the performance of routing protocols when packet size changes, when time interval between packet sending changes, when mobility of nodes changes.

Comparative Performance Analysis of DSDV, AODV and DSR Routing Protocols in MANET Using NS2

Intrusion Detection Systems (IDSs) are a major line of defense for protecting network resources from illegal penetrations. A common approach in intrusion detection models, specifically in anomaly detection models, is to use classifiers as detectors. Selecting the best set of features is central to ensuring the performance, speed of learning, accuracy, and reliability of these detectors as well as to remove noise from the set of features used to construct the classifiers. In most current systems, the features used for training and testing the intrusion detection systems consist of basic information related to the TCP/IP header, with no considerable attention to the features associated with lower level protocol frames. The resulting detectors were efficient and accurate in detecting network attacks at the network and transport layers, but unfortunately, not capable of detecting 802.11-specific attacks such as deauthentication attacks or MAC layer DoS attacks. In this paper, we propose a novel hybrid model that efficiently selects the optimal set of features in order to detect 802.11-specific intrusions. Our model for feature selection uses the information gain ratio measure as a means to compute the relevance of each feature and the k-means classifier to select the optimal set of MAC layer features that can improve the accuracy of intrusion detection systems while reducing the learning time of their learning algorithm. In the experimental section of this paper, we study the impact of the optimization of the feature set for wireless intrusion detection systems on the performance and learning time of different types of classifiers based on neural networks. Experimental results with three types of neural network architectures clearly show that the optimization of a wireless feature set has a significant impact on the efficiency and accuracy of the intrusion detection system.

Impact of Feature Reduction on the Efficiency of Wireless Intrusion Detection Systems

Networking at any time and any place paves the way for a large number of possible applications in ad hoc networks, from disaster relief in remote areas to network extension. Thus, for the past decades, many works have been proposed trying to make ad hoc networks a reality. The importance of broadcasting in networking and the broadcast nature of the wireless medium have encouraged researchers to join their efforts on designing efficient dissemination algorithms for Mobile Ad Hoc Networks (MANETs). The many different challenges that MANETs face, such as limited network resources, network partitions, or energy restrictions, gave rise to many different approaches to overcome one or more of those problems. Therefore, literature reveals a huge variety of techniques that have been proposed for efficient message dissemination. In this article, we make an in-depth review of the existing state-of-the-art techniques, as well as propose a new taxonomy that provides a global overview of the most relevant existing algorithms.

Survey on Broadcast Algorithms for Mobile Ad Hoc Networks

Mobile Ad hoc Networks are decentralized networks in which participating nodes are mobile, small form-factor, equipped with the wireless interface, and have forwarding capabilities. These self-organized networks extend limited wireless range by the provision of multi-hop arrangements on the fly without any central administrator. In order to facilitate communication in a dynamic multi-hop wireless environment, routing protocols are essential to discover routes between nodes that are arbitrarily located and can move dynamically. Routing protocols are intended to discover the correct and efficient route in a timely manner so that information could be delivered to the desired destination node. Routing protocols are the backbone of the Mobile Ad hoc Networks and are challenging to design. Several works have been proposed on routing, and systematic representation of these proposals is desirable. In this paper, we provide a survey of the wide range of routing proposals in the last twenty years for the mobile ad hoc network. We device many categories and classification criteria untouched in most of the surveys. This survey paper gives a key overview of the protocols, also classifies and arranges the routing protocols for logical illustration. Protocol classification in the paper assists to systematically access a large set of protocols and highlights the research trends in the domain.

Azzedine Boukerche

Papers

Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks: Boukerche/Mobile