Routing Protocol For Wireless Networks Research Articles

Wireless Ad Hoc Network Routing Protocols Performance Evaluation under Security Attack

Abstract: A mobile ad hoc network is made up of portable wireless nodes (MANET). The communication between these mobile nodes is not managed centralized. A self-organizing, self-configuring network known as MANET allows mobile nodes to roam around at whim. The mobile nodes can act as a router by receiving and sending packets. Due to the significance of routing in MANET, this thesis also evaluates several routing systems' efficacy. We compared the three routing protocols AODV, DSR, OLSR, and DSDV. Throughput, network load, and latency are the three metrics used to gauge how well-performing different routing systems are. The three routing techniques are well described using metrics. Information is transmitted end-to-end and hop-by-hop over the connections to the destination nodes using the proactive and reactive protocols of MANET. In multi-hop mobile ad hoc networks, energy consumption at the mobile nodes' end and its effective use are crucial factors. Nodes and other routing resources in MANETs cannot afford to run out of battery power while carrying out mission-critical operations like military or rescue missions. The effectiveness of MANET protocols such AODV, DSDV, OLSR, and DSR is studied in this study. Throughput, packet delivery ratio, and energy use are included while computing the Mobile Ad-hoc Networks' performance parameters. The circumstances that were simulated using various simulators are included in the research. The related research compared the performance of several protocols in MANETs with varying node mobility, stop length, and node density while examining the NS-2 scenario. The optimum routing system for mobile ad hoc networks will be identified after a comparison and analysis of these protocols.

An optimised QoS-based clustering with multipath secure routing protocol for wireless sensor networks

Recent advances in wireless technology with networking capabilities have generated a lot of interest to design secure routing protocol for wireless sensor networks (WSNs). Generally, residual energy of sensors in sink coverage area is drained very quickly compared to other area nodes in WSNs. The proposed optimised QoS-based clustering with multipath secure routing protocol (OQoS-CMSRP) for WSNs reduces the energy consumption in sink coverage area and solving hot spot problem. The proposed protocol is used to find near optimal multi-hop communication path from sink to sensors for selecting the next hop neighbour nodes. An enhanced (k, n)-threshold secret sharing scheme is required to make n shares and recover the secret by using k shares based on Hermite's interpolating polynomial. The proposed protocol is to provide end-to-end security from different network layer attacks and to provide an efficient service for transmitting data in secure and reliable manner.

An optimised QoS-based clustering with multipath secure routing protocol for wireless sensor networks

An optimised QoS-based clustering with multipath secure routing protocol for wireless sensor networks

Improved-Equalized Cluster Head Election Routing Protocol for Wireless Sensor Networks

Throughout the use of the small battery-operated sensor nodes encourage us to develop an energy-efficient routing protocol for wireless sensor networks (WSNs). The development of an energy-efficient routing protocol is a mainly adopted technique to enhance the lifetime of WSN. Many routing protocols are available, but the issue is still alive. Clustering is one of the most important techniques in the existing routing protocols. In the clustering-based model, the important thing is the selection of the cluster heads. In this paper, we have proposed a scheme that uses the bubble sort algorithm for cluster head selection by considering the remaining energy and the distance of the nodes in each cluster. Initially, the bubble sort algorithm chose the two nodes with the maximum remaining energy in the cluster and chose a cluster head with a small distance. The proposed scheme performs hierarchal routing and direct routing with some energy thresholds. The simulation will be performed in MATLAB to justify its performance and results and compared with the ECHERP model to justify its performance. Moreover, the simulations will be performed in two scenarios, gateway-based and without gateway to achieve more energy-efficient results.

Layered routing algorithm for wireless sensor networks based on energy balance

Aiming at the shortcomings of traditional LEACH routing protocol in wireless sensor network (WSN) data transmission applications, such as high total energy consumption, low residual energy and short network life, a hierarchical routing algorithm based on energy balance is proposed. This algorithm is based on the energy consumption model of WSN communication, and adopts the non-uniform clustering algorithm to introduce the threshold. According to the relationship between the distance between cluster head node and sink node and the threshold, the implementation method of network communication is selected. In addition, a simple correlation multi-path route is designed to realise the multi hop communication between clusters. By considering the communication cost and the residual energy value of nodes, the hierarchical route with balanced energy consumption is realised. Experimental results show that the algorithm has obvious advantages in balancing network energy consumption and prolonging network lifetime.

Energy Efficiency Based Load Balancing Optimization Routing Protocol In 5G Wireless Communication Networks

A significant study area in cloud computing that still requires attention is how to distribute the workload among virtual machines and resources. Main goal of this research is to develop an efficient cloud load balancing approach, improve response time, decrease readiness time, maximise source utilisation, and decrease activity rejection time. This research propose novel technique in load balancing based network optimization using routing protocol for 5G wireless communication networks. the network load balancing has been carried out using cloud based software defined multi-objective optimization routing protocol. then the network security has been enhanced by data classification utilizing deep belief Boltzmann NN. Experimental analysis has been carried out based on load balancing and security data classification in terms of throughput, packet delivery ratio, energy efficiency, latency, accuracy, precision, recall.

Machine learning based efficient routing protocol in wireless sensor network

Data loss and recovery are important factors that directly affect the efficiency of the wireless sensor network (WSN). The wireless channel characteristics have a significant impact on data transmission and reception. On the receiver side, the most difficult tasks are maximizing packet delivery ratio and recovering lost data. In some cases, cyclic redundancy check (CRC) based algorithms can provide better data recovery. The CRC method can be made adaptive by using channel characteristics to correct the error bits. This paper evaluates the performance of the proposed machine learning-based efficient routing protocol (ML-ERP). For data recovery, the CRC with channel impulse response (CIR) prediction based on sensor node location information was used. The data recovery capability of ML-ERP increased the network efficiency in terms of packet delivery ratio. Also, due to less data loss, the energy efficiency of the network was also improved by almost 6 % ove existing protocols.

An energy cooperation method of wireless sensor networks based on partially observable Markov decision processes

The performance of routing protocols in wireless sensor networks, such as energy conservation, energy and load balancing. These indicators have a very important impact on the network lifetime. Energy cooperation technology refers to the purposeful transfer of energy from nodes with sufficient energy to nodes with insufficient energy. Firstly, according to POMDP (Partially Observable Markov Decision Process) model, related theories and solving algorithms, this paper proposes an energy cooperation method based on POMDP, establishes an interference decision model based on POMDP, and solves the model. This paper proposes an energy balance routing algorithm based on multi-attribute decision making (EBR_MDM). This algorithm is used to solve the application problem of wireless sensor networks with stable data flow. Including the uneven distribution of network energy, hot spots and energy holes, packet loss caused by node overload and retransmission energy consumption. According to the relative entropy, the attribute weight is calculated, and the optimal forward data is selected to the neighboring nodes. The simulation results show that the network running time of EBR_MDM is increased by 22.1 %, 48.7 % and 101.3 % respectively compared with other comparison protocols. Finally, because the sensor nodes are randomly arranged in the predetermined monitoring area, and the distribution of each node is chaotic, this paper establishes TMA (Trilateral Measurement Algorithm) algorithm to locate the target. The simulation results show that the positioning error of TMA may be about 1.2 m due to trilateration, but it is still within an acceptable range.

Congestion Detection and Alleviation Mechanism Using a Multi-Level Cluster Based Cuckoo Hosted Rider Search Multi-Hop Hierarchical Routing Protocol in Wireless Sensor Networks

Wireless sensor networks congestion occurs easily due to its centralized traffic pattern. Normally, mono-sync wireless sensor network experiences multiple traffic flow congestion in the dense environment of the network, which leads to excess energy consumption and severe packet loss. To overcome these issues, a congestion detection and alleviation mechanism using cluster based heuristic optimized hierarchical routing protocol is proposed in this paper. Here, congestion detection and alleviation utilize the features of sensor nodes. The congestion is categorized into two types: (i) node level congestion and (ii) link level congestion. The node level congestion is detected by assessing the buffer utilization and the interval amid the consecutive data packets. The link level congestion is considered with computing link usage utilizing back-off step of round robin carrier sense multi-access with collision avoidance. Congestion detection and alleviation reactively affected node/link through cuckoo hosted rider search multi-hop routing algorithm. It has two phases: the cluster head selection and multi-path routing. Cluster head selection is performed through Taylor multiple random forest kernel fuzzy C-means clustering algorithm and multi-path routing is performed through cuckoo hosted rider search multi-hop routing algorithm. The simulation of the proposed method is done in network simulator tool. Here, the performance metrics, like packet delivery ratio, delay, energy consumption, packet drop, overhead, network lifetime and throughput are calculated. The experimental outcomes of the proposed technique shows 11.6%, 18.4% and 28.1% lower delay, 78.2%, 65.4% and 52.6% higher packet delivery ratio, and 29.2%, 37.4% and 40.8% lower packet drop compared with the existing methods, like congestion detection and alleviation using multi-attribute decision-making in optimization-based hybrid congestion alleviation routing protocol in wireless sensor networks, congestion detection and alleviation using hybrid K-means with greedy best first search algorithms in packet rate reduction utilizing adaptive weight firefly algorithm ant colony optimization based routing protocol in wireless sensor networks and congestion detection and alleviation using multi-input time on task optimization algorithm for altered gravitational search algorithm routing protocol in wireless sensor networks.

Comparative analysis of routing protocols for wireless area networks and evaluation of the effectiveness

A Mobile Ad Hoc Network (MANET) is a gathering of mobile nodes that want to communicate without any preplanned infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing protocols and finding by comparing them the best one. In this article been compared AODV, DSR and DSDV routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. I study these three MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.

Analysis of power optimization and enhanced routing protocols for wireless sensor networks

Computers are connected through a network. Wireless sensor nodes are used in sensor networks to keep tabs on their surroundings. The building components of a network are sensor nodes. Processors, transceiver and memory are all onboard as well as a power supply. A WSN is a network of devices. Lifespan, data collection, and security are WSN parameters. Wireless sensors' low cost and quick deployment make them ideal for real-time applications. WSN's key problem is long-term energy supply. Energy resource, energy harvesting, topology, and effective routing may extend network lifespan. WSN energy is improved using an efficient manner. The recommended technique relies heavily on grouping and selecting the best possible path. The energy levels of the sensor nodes decide the cluster leader. Chikoo search algorithm selects the best path. This algorithm saves more energy than others. Optimum search ideas identify optimal sink location. Based on the network's energy dissipation and distribution, this technique finds the ideal location for all sinks to improve the network's lifespan and move with intelligent sink placement.

Dynamic routing protocols for wireless touch networks: a review

This article has been retracted. Please see: Retraction of published article due to the author’s proposal - 23 March 2023 Wireless Touch Networks (WTN) have become increasingly important with the emergence of the Internet of Things (IoT) and are regarded as a class of self-organizing networks. This article presents an overview of the construction principles, routing protocols, quality of service parameters, traffic models, and characteristics of WTN. The article also explores the application of dynamic routing protocols for constructing a self-organizing network of autonomous IoT systems. Known dynamic routing protocols for mobile radio networks are reviewed and the advantages and disadvantages of proactive and reactive approaches are discussed.

Finding Optimal Path and Privacy Preserving for Wireless Network

Abstract: Privacy-preserving routing protocols in wireless networks frequently utilize additional artificial traffic to hide the source-destination identities of the communicating pair. Usually, the addition of artificial traffic is done heuristically with no guarantees that the transmission cost, latency, etc., are optimized in every network topology. We explicitly examine the privacyutility trade-off problem for wireless networks and develop a novel privacy-preserving routing algorithm called Optimal Privacy Enhancing Routing Algorithm (OPERA). OPERA uses a statistical decision-making framework to optimize the privacy of the routing protocol given a utility (or cost) constraint. We consider global adversaries with both Lossless and lossy observations that use the Bayesian maximum-a-posteriori (MAP) estimation strategy. We formulate the privacy-utility trade-off problem as a linear program which can be efficiently solved.

Investigation of Route Request Retries of AODV Routing Protocol in a Linear Wireless Ad Hoc Network

AODV is a reactive routing protocol that sets up routes between source and destination nodes as and whenneeded. The performance of AODV protocol depends on the choice of certain parameters including route requestretries which is, by default, set as two in the corresponding RFC. In the present work, the effect of Route RequestRetries (RRR) on a set of performance metrics viz. Normalized Routing Load (NRL), Average End-to-End Delay(AEED), Packet Delivery Ratio (PDR) and Throughput has been investigated for a linear ad hoc network of fivenodes. Three different scenarios have been investigated wherein middle node is made to remain stationary, mobilewith low mobility and mobile with high mobility. Mobility of the middle node is found to be having significanteffect on the performance of such linear ad hoc networks. RRR has no influence on the performance of linear adhoc network of stationary nodes. However, RRR is having significant effect on the performance of linear ad hocnetwork if a node is made mobile. Performance of such linear ad hoc network is also affected by the choice ofduration of simulation.

An improved high performance clustering based routing protocol for wireless sensor networks in IoT

An improved high performance clustering based routing protocol for wireless sensor networks in IoT

Performance Analysis and Evaluation of a Multi-Hop Routing Protocol for Wireless Multimedia Sensor Networks

Researchers in wireless multimedia sensor networks (WMSNs) are constantly interested in designing and developing energy-efficient routing protocols. Numerous clustering routing protocols have been developed in recent years to overcome the limitation of consuming less energy and prolong the lifetime of sensor nodes in homogeneous and heterogeneous WMSNs. Existing approaches depend on single-hope communication, in which sensor nodes consume more energy and die faster. Inter-communication nodes can play an important role in reducing energy by transmitting data in a multi-hope fashion to the sink. An energy-efficient multi-path clustering with load balancing routing protocol for wireless multimedia sensor networks (EEMCL) is proposed in this study. In this protocol, the main cluster heads (MCHs) are preselected in each network cluster and filled with more energy than normal sensor nodes. The two secondary cluster heads (SCHs) with the highest energy nodes will be selected by the main cluster head algorithm. Moreover, inter-cluster multi-hop routing with the help of MCHs can enhance the network lifetime when the sink is located at the corner of the sensing field. The simulation results verify that the proposed multi-hop technique provides better performance than existing LEACH, LEACH-C, SEEN, and IEE-LEACH routing protocols in scenario 1 and when compared with CPMA in scenario 2. The last node dead (LND) for the proposed protocol is at round 5721, 2225 for LEACH, 2300 for LEACH-C, 2900 for SEEN, and 3160 for IEE−LEACH in scenario 1, while in scenario 2, the LND for the proposed protocol is at round 3820 and 435 for the CPMA routing protocol.

Novel MAC routing protocol for wireless sensor networks based on IEEE 802.11 ad hoc networks

Abstract Due to the lack of efficient specified multi-hop routing protocol, IEEE 802.11 ad hoc networks have been in limited use for realizing wireless sensor networks where wireless sensors are dispersed in a region and each sensor can transmit its data to one another. We propose a novel MAC routing protocol for IEEE 802.11 wireless sensor networks, of which the service areas are extended by appropriately appointed pseudo-access points.

Light Gradient Boosting Machine-Based Link Quality Prediction for Wireless Sensor Networks

Link quality prediction is a fundamental component of the wireless network protocols and is essential for routing protocols in wireless sensor networks (WSNs). Effective link quality prediction can select high-quality links for communication and improve the reliability of data transmission. In order to improve the accuracy of the link quality prediction model and reduce the model complexity, the link quality prediction model based on the light gradient boosting machine (LightGBM-LQP) is proposed in this paper. Specifically, agglomerative hierarchical clustering and manual division are combined to grade the link quality and obtain the labels of samples. Then, light gradient boosting machine (LightGBM) classification algorithm and Focal Loss are used to estimate the link quality grades. In order to reduce the impact of data imbalance, Borderline-SMOTE is employed to oversample the minority link quality samples. Finally, LightGBM-LQP predicts link quality grade at the next moment with historical link quality information. The experimental results on data collected from a real-world WSNs show that the proposed model has better prediction accuracy and shorter predicting time compared to related models.

FEELS: fuzzy based energy efficient and low SAR routing protocol for wireless body area networks

FEELS: fuzzy based energy efficient and low SAR routing protocol for wireless body area networks

RETRACTED: Medical data quality management using butterfly optimization with adaptive threshold sensitive energy‐efficient routing protocol and multidimensional chaotic blowfish encryption in wireless body networks

AbstractNowadays, medical applications require much medical information to analyze various diseases. To collect various medical data, wearable devices collect patient health and medical details using a wireless body area network. The collected details consist of several critical details: oxygen level, heart attack information, blood pressure, airflow and so forth. These details are broadcast to the healthcare centers using wireless technologies to make clinical decisions. During medical information transfer, the data quality and critical events are difficult to maintain because it reduces the packet delivery, transmission delay, and high energy. So, this article introduces bacterial optimization and adaptive threshold‐sensitive energy‐efficient routing protocol (BOATSEE) to transmit the medical data. The method aggregates the sensitive data by selecting the cluster head and effectively broadcasts the critical data. In addition, the optimized method manages the network lifetime and energy using an energy‐efficient method. Also, we have proposed a multidimensional chaotic blowfish encryption (MCBE) algorithm to enhance the system's security. Then the system's efficiency is computed based on metrics like energy consumption, packet delivery ratio, end‐to‐end delay, and QoS metric‐associated restraints. The results reveal that the proposed system is efficient in managing the medical data quality with minimum energy utilization, packet loss rate, delay, and maximum packet delivery ratio when compared with the conventional approaches. Our method also proved to be more secure than the traditional systems.