A Review of Wireless Sensor Networks with Cognitive Radio Techniques and Applications

The advent of Wireless Sensor Networks (WSNs) has inspired various sciences and telecommunication with its applications, there is a growing demand for robust methodologies that can ensure extended lifetime. Sensor nodes are small equipment which may hold less electrical energy and preserve it until they reach the destination of the network. The main concern is supposed to carry out sensor routing process along with transferring information. Choosing the best route for transmission in a sensor node is necessary to reach the destination and conserve energy. Clustering in the network is considered to be an effective method for gathering of data and routing through the nodes in wireless sensor networks. The primary requirement is to extend network lifetime by minimizing the consumption of energy. Further integrating cognitive radio technique into sensor networks, that can make smart choices based on knowledge acquisition, reasoning, and information sharing may support the network's complete purposes amid the presence of several limitations and optimal targets. This examination focuses on routing and clustering using metaheuristic techniques and machine learning because these characteristics have a detrimental impact on cognitive radio wireless sensor node lifetime

Energy-efficient routing protocols in heterogeneous wireless sensor networks

Sensor networks feature low-cost sensor devices with wireless network capability, limited transmit power, resource constraints and limited battery energy. The usage of cheap and tiny wireless sensors will allow very large networks to be deployed at a feasible cost to provide a bridge between information systems and the physical world. Such large-scale deployments will require routing protocols that scale to large network sizes in an energy-efficient way. This thesis addresses the design of such network routing methods. A classification of existing routing protocols and the key factors in their design (i.e., hardware, topology, applications) provides the motivation for the new three-tier architecture for heterogeneous networks built upon a generic software framework (GSF). A range of new routing algorithms have hence been developed with the design goals of scalability and energy-efficient performance of network protocols. They are respectively TinyReg - a routing algorithm based on regular-graph theory, TSEP - topological stable election protocol, and GAAC - an evolutionary algorithm based on genetic algorithms and ant colony algorithms. The design principle of our routing algorithms is that shortening the distance between the cluster-heads and the sink in the network, will minimise energy consumption in order to extend the network lifetime, will achieve energy efficiency. Their performance has been evaluated by simulation in an extensive range of scenarios, and compared to existing algorithms. It is shown that the newly proposed algorithms allow long-term continuous data collection in large networks, offering greater network longevity than existing solutions. These results confirm the validity of the GSF as an architectural approach to the deployment of large wireless sensor networks

An Enhanced Cluster-Based Routing Model for Energy-Efficient Wireless Sensor Networks

Energy efficiency is a crucial consideration in wireless sensor networks since the sensor nodes are resource-constrained, and this limited resource, if not optimally utilized, may disrupt the entire network's operations. The network must ensure that the limited energy resources are used as effectively as possible to allow for longer-term operation. The study designed and simulated an improved Genetic Algorithm-Based Energy-Efficient Routing (GABEER) algorithm to combat the issue of energy depletion in wireless sensor networks. The GABEER algorithm was designed using the Free Space Path Loss Model to determine each node's location in the sensor field according to its proximity to the base station (sink) and the First-Order Radio Energy Model to measure the energy depletion of each node to obtain the residual energy. The GABEER algorithm was coded in the C++ programming language, and the wireless sensor network was simulated using Network Simulator 3 (NS-3). The outcomes of the simulation revealed that the GABEER algorithm has the capability of increasing the performance of sensor network operations with respect to lifetime and stability period

Efficient Clustering Protocol Based on Stochastic Matrix & MCL and Data Routing for Mobile Wireless Sensors Network

In this paper, we have already presented a new approach for data routing dedicated to mobile Wireless Sensors Network (WSN) based on clustering. The proposed method is based on stochastic matrix and on the Markov Chain Cluster (MCL) algorithm to organize a large number of mobile sensors into clusters without defining the required clusters number in advance. It is based on mobile sensors connectivity to determinethe optimal number of clusters and to form compact and well separated clusters. Our proposed approach is a distributed method using nodes locations, degrees and theirs residual energies during the cluster head election. Simulation results showed that the proposed approach reduced the loss packets rate by 80%, the energy consumption by 30% and improved the data delivery rate by 70% compared to LEACH-M protocol. Moreover, it outperforms the E-MBC protocol and reduced the average energy consumption and loss packets rate by 60%; as well as it improved the success packets delivery rate by 40%

Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

Analyzing the Performance of Centralized Clustering Techniques for Realistic Wireless Sensor Network Topologies

AbstractClustering techniques in wireless sensor networks enables energy efficient coordination among the densely deployed nodes for data delivery till the base station. Many clustering protocols have been suggested in the recent past. The topology of the nodes, mostly seen in the literature, is of random type. This paper analyzes the performance aspects of various centralized clustering techniques for wireless sensor networks. LEACH-Centralized, KMeans-CP, FCM-CP and HSA-CP protocols have been compared with respect to clustering and data delivery process for various realistic topologies. The simulations were performed for these protocols and performance of the protocols has been critically analyzed. HSA-CP clustering method performs better compared to other techniques for almost each topology examined in the paper

A Study on Intrusion Detection System in Wireless Sensor Networks

The technology of Wireless Sensor Networks (WSNs) has become most significant in present day. WSNs are extensively used in applications like military, industry, health, smart homes and smart cities. All the applications of WSN require secure communication between the sensor nodes and the base station. Adversary compromises at the sensor nodes to introduce different attacks into WSN. Hence, suitable Intrusion Detection System (IDS) is essential in WSN to defend against the security attack. IDS approaches for WSN are classified based on the mechanism used to detect the attacks. In this paper, we present the taxonomy of security attacks, different IDS mechanisms for detecting attacks and performance metrics used to assess the IDS algorithm for WSNs. Future research directions on IDS in WSN are also discussed