Traditional Routing Protocols Research Articles

A Novel Energy-Efficient Routing Protocol for Industrial WSN Using Hybrid Coot-Ls Algorithm with LSTM-Based Dom Prediction

In industrial Wireless Sensor Networks (WSNs), energy efficiency and reliable data transmission are critical challenges that need to be addressed to ensure sustainable and robust network operations. This paper proposes a novel energy-efficient routing protocol that integrates a Hybrid COOT-LS (Coot- Levy Search) algorithm with Long Short-Term Memory (LSTM)-based Dominant Object Motion (DOM) prediction. The routing protocol leverages the strengths of Hybrid Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) to enhance routing efficiency and reduce energy consumption. The Hybrid PSO and ACO algorithms are employed to optimize routing paths by balancing exploration and exploitation, considering multiple factors such as energy levels, node distance, and reliability. The COOT-LS algorithm further refines these paths by incorporating a Levy flight mechanism to enhance the search process. Additionally, the LSTM-based DOM prediction provides accurate forecasts of network conditions, enabling dynamic adjustments to routing strategies in real time. Simulation results demonstrate that the proposed protocol significantly improves network lifetime, reduces energy consumption, and enhances data transmission reliability compared to traditional routing protocols. This approach provides a robust and scalable solution for industrial WSN applications, ensuring efficient and reliable network performance in dynamic and complex industrial environments.

Li-MSD: A lightweight mitigation solution for DAO insider attack in RPL-based IoT

Many IoT applications run on a wireless infrastructure supported by resource-constrained nodes which is popularly known as Low-Power and Lossy Networks (LLNs). Currently, LLNs play a vital role in digital transformation of industries. The resource limitations of LLNs restrict the usage of traditional routing protocols and therefore require an energy-efficient routing solution. IETF’s Routing Protocol for Low-power Lossy Networks (RPL, pronounced “ripple”) is one of the most popular energy-efficient protocols for LLNs, specified in RFC 6550. In RPL, Destination Advertisement Object (DAO) control message is transmitted by a child node to pass on its reachability information to its immediate parent or root node. An attacker may exploit the insecure DAO sending mechanism of RPL to perform “DAO insider attack” by transmitting DAO multiple times. This paper shows that an aggressive DAO insider attacker can drastically degrade network performance. We propose a Lightweight Mitigation Solution for DAO insider attack, which is termed as “Li-MSD”. Li-MSD uses a blacklisting strategy to mitigate the attack and restore RPL performance, significantly. By using simulations, it is shown that Li-MSD outperforms the existing solution in the literature.

COMPUTATIONAL INTELLIGENCE BASED ROUTING SOLUTIONS FOR MOBILE AD HOC NETWORKS

Mobile Ad Hoc Networks (MANETs) refers to a wireless network where nodes dynamically establish and maintain connections with each other, directly without the need for a centralized infrastructure. MANETs are characterized by their decentralized nature, presenting challenges for routing protocols concerning rapid data transmission, minimized delay and Quality of Service (QoS) provisioning. Traditional routing protocols may struggle to perform optimally in MANETs due to frequent changes in network topology and resource constraints. The development of intelligent routing protocols tailored to the specific characteristics of MANETs is vital for dynamic and resource-constrained environments. Computational intelligence (CI) techniques have gained attention for designing intelligent routing protocols for MANETs. This paper provides a comprehensive overview of majorly used CI methodologies in MANETs. The paper reviews existing research on intelligent routing protocols based on CI techniques in MANETs and identifies future research directions in this field to address the unique challenges of MANETs and improve network performance and reliability.

Hybrid Secure Cluster-Based Routing Algorithm for Enhanced Security and Efficiency in Mobile Ad Hoc Networks

ABSTRACT This research addresses critical gaps in Mobile Ad hoc Networks (MANETs) by proposing a hybrid secure cluster-based routing algorithm, focusing on enhancing network security, robustness, and reliability through multipath routing. Methodologically, the approach integrates Convolutional Neural Networks (CNN) for optimal path routing and Emperor Penguin Optimization (EPO) for clustering, introducing a novel combination for efficient cluster head selection. A novel contribution lies in the development of a prediction technique utilizing a trust assessment algorithm to calculate direct trust ratings at each node, incorporating fuzzy values between zero and one. Trust values are further influenced by node performance, adding a dynamic dimension to the trust evaluation process. Key novelties include the emphasis on energy efficiency, network longevity, remaining energy, security level, bandwidth, and packet delivery ratio as evaluation criteria. The proposed CNN-EPO model demonstrates superior results compared to traditional routing protocols, achieving a remarkable 95% energy efficiency, a heightened security level of 99%, and a throughput reaching up to 8 Mbps. Additionally, the Packet Delivery Ratio (PDR) attains close to 99% and routing overhead remains below 0.5, ensuring efficiency in challenging network scenarios with 50 adversaries. In summary, this research contributes a comprehensive solution to MANET challenges, introducing a novel hybrid routing algorithm, incorporating advanced methodologies for path optimization and clustering. These outcomes highlight how important the suggested strategy is to improve the existing state of the art in MANETs.

Machine learning‐based data fusion method for wireless sensor networks

AbstractFor wireless sensor networks (WSNs), sensor nodes lose a certain amount of energy during the information collection and transmission process, and sensor nodes powered by non‐replaceable batteries have limited energy and need to be controlled for energy consumption. In the face of the energy consumption issue in WSN data transmission, research has been conducted to analyze data fusion methods in order to reduce energy consumption. Based on machine learning techniques, a Deep Stacked Auto‐Encoder (DSAE) model is constructed and trained using a layer‐wise greedy approach. By combining this model with WSN, an algorithm based on the DSAE model, called Deep Stacked Auto‐Encoder Data Fusion Algorithm (DSAEDFA), is obtained to do data fusion. The results show that compared to other algorithms, the proposed fusion algorithm has better fusion performance. When the number of iterations is set to 500, the DSAEDFA has 281 surviving nodes, which is 10 more than the Back‐Propagation Data Fusion Algorithm (BPDFA) and 144 more than the Low Energy Adaptive Clustering Hierarchy (LEACH) algorithm. When the number of failed nodes is 40, the DSAEDFA has a network survival time of 2562 rounds, which is 746 rounds longer than the LEACH algorithm. The research method effectively extends the lifespan of wireless sensor networks and reduces data transmission energy consumption. Compared to previous methods, the proposed method consider the factors of node residual energy and distance on the basis of traditional routing protocols, making the selection of cluster heads more reasonable. The proposed method can organically combine the DSAE model with the clustering model, optimize the data fusion method, and improve the performance of the algorithm. In addition, by combining the DSAE model, a machine learning technique with clustering models has been expanded in terms of the application scope.

Application of Fuzzy Computing for VANET Routing

In the realm of vehicular ad hoc networks (VANETs), routing plays a pivotal role in ensuring efficient communication among vehicles and infrastructure. Traditional routing protocols often struggle to adapt to the dynamic and uncertain environment of VANETs, characterized by rapidly changing network topologies and unpredictable traffic conditions. In any case, the without a doubt solid and stunning nature of vehicular conditions presents superb difficulties for controlling shows, including unusual straightforwardness, changing association geologies, and dynamic traffic conditions [1, 2]. By incorporating fuzzy logic into routing algorithms, vehicles can make more informed decisions regarding route selection, considering factors such as traffic congestion, road conditions, and vehicle mobility patterns. This paper provides an overview of the key concepts of fuzzy computing and discusses its potential applications in VANET routing. Furthermore, it explores existing research efforts in this area, highlighting the benefits and challenges associated with fuzzy based routing approaches. Through a comprehensive review of the literature, this paper identifies current trends and future directions for leveraging fuzzy computing in VANET routing, aiming to improve the reliability, scalability, and efficiency of communication in vehicular networks.

A smart filtering-based adaptive optimized link state routing protocol in flying ad hoc networks for traffic monitoring

Nowadays, the use of drones as a fundamental element of smart cities has attracted the attention of many researchers to monitor and control the traffic of vehicles. Because of the high flexibility of multi-drone systems, like flying ad hoc networks (FANETs), they provide various services and improve modern life in smart cities. However, due to the unique features of FANET, especially the high speed of drones and rapid changes in network topology, communication reliability is a serious challenge in this network. Hence, traditional routing protocols, such as optimized link state routing (OLSR) scheme, cannot work well in these networks. In this paper, a smart filtering-based adaptive optimized link state routing (SFA-OLSR) scheme is proposed in FANETs. To increase adaptability to the FANET environment, SFA-OLSR provides a new solution to adjust the hello broadcast period so that each flying node specifies its broadcast period based on a new scale called cosine similarity between real and predicted positions. Furthermore, in SFA-OLSR, each flying node develops a filtering algorithm based on two parameters, namely link lifetime and remaining energy. The purpose of this algorithm is to reduce the size of the single-hop neighboring set of each flying node and minimize the search space when finding multi-point relays (MPRs). This increases the convergence speed of the algorithm. Then, SFA-OLSR exploits the sparrow search algorithm (SSA) to single out the best MPRs. This algorithm introduces a multi-objective function by focusing on three components, including energy, link lifespan, and neighbor degree. Lastly, the simulation process of SFA-OLSR is performed by the NS3 simulator. This process evaluates the performance of the proposed method and three schemes, namely Gangopadhyay et al., P-OLSR, and OLSR-ETX. These evaluations show that SFA-OLSR has a good performance in terms of three scales, namely packet delivery ratio, delay, and throughput, but its overhead is more than other methods.

Velocity Based Performance Analysis of GreedLea Routing Protocol in Internet of Vehicle (IoV)

Intelligent routing protocols for IoV have also been made possible by the convergence of IoT and machine learning algorithm. In order to make informed routing decisions, these intelligent routing protocols examine data gathered from IoT devices like vehicle sensors and traffic monitoring systems using machine learning algorithms. Moreover, as the number of vehicles increases and road networks become more complex, traditional routing protocols for ad hoc networks are being replaced by more advanced and efficient protocols. The purpose of this study is to concentrate on these unique qualities of IoVs network scenario. A combined routing method has been developed to construct periodic connectivity and find routes on-demand in order to save route data as graphs. The simulation's findings show that GreedLea routing protocol outperforms GPSR and AODV routing protocols in terms of delay and packet delivery ratio (PDR). The results demonstrate that the average AODV latency is significantly higher when there are fewer vehicles on the network. This is due to the fact that connections are frequently lost at higher speeds and lower densities, and re-establishing new channels takes a lot of time. As the number of vehicles rises, efficiency improves and the wait gets shorter. The average latency, yet, keeps increasing as vehicle density increases due to the additional overheads related with routing.

FCPN: Pruning redundant part-whole relations for more streamlined pattern parsing

Cropping-and-segmenting pattern parsers often combine diverse inner correlations into a single metric/scheme, resulting in over-generalizations and redundant representations. It is proposed to streamline pattern parsing by using presenting a redundant association elimination network (RAEN) with capsule attention twisters (CATs) and capsule-attention routing agreement (CARA). CATs trim delicate relationships between parts and wholes that are weak and interchangeable. Senior entities can only be updated by primary entities that meet the requirements of inter-part diversity and intra-object cohesiveness. In order to enhance results, CARA is designed to protect against the unnecessary voting signals of traditional routing protocols. Experiments involving facial and human segmentation show that RAEN is better than current remarkable methods, particularly for defining detailed semantic boundaries.

A novel routing method for dynamic control in distributed computing power networks

Driven by diverse intelligent applications, computing capability is moving from the central cloud to the edge of the network in the form of small cloud nodes, forming a distributed computing power network. Tasked with both packet transmission and data processing, it requires joint optimization of communications and computing. Considering the diverse requirements of applications, we develop a dynamic control policy of routing to determine both paths and computing nodes in a distributed computing power network. Different from traditional routing protocols, additional metrics related to computing are taken into consideration in the proposed policy. Based on the multi-attribute decision theory and the fuzzy logic theory, we propose two routing selection algorithms, the Fuzzy Logic-Based Routing (FLBR) algorithm and the low-complexity Pairwise Multi-Attribute Decision-Making (lPMADM) algorithm. Simulation results show that the proposed policy could achieve better performance in average processing delay, user satisfaction, and load balancing compared with existing works.

WOAD3QN-RP: An intelligent routing protocol in wireless sensor networks — A swarm intelligence and deep reinforcement learning based approach

Wireless Sensor Networks (WSN) are a crucial part of the Internet of Things (IoT), and research on WSN routing protocols has always been a hot topic in academia. However, traditional WSN routing protocols have limited utilization of available information during the routing decision process, leading to challenges such as insufficient adaptability to network topology changes, high communication delays, and short network lifetimes. To address these issues, this paper proposes an innovative intelligent routing algorithm WOAD3QN-RP, which cleverly integrates swarm intelligence algorithms and deep reinforcement learning. The WOAD3QN-RP not only effectively reduces delay but also balances energy consumption and flexibly adapts to changes in network topology, while simultaneously determining the optimal multi-hop path, effectively extending the lifetime of the network. Firstly, the WOAD3QN-RP algorithm employs the Whale Optimization Algorithm (WOA) to determine the optimal cluster heads (CHs). In the process of selecting CHs, the algorithm comprehensively considers key factors such as the residual energy of nodes, node distance, and communication delay, thereby significantly improving the accuracy and efficiency of CH selection, which contributes to better energy distribution and performance of the network. Secondly, in terms of multi-hop path selection, WOAD3QN-RP uses a dueling double deep Q-network (D3QN) to determine the optimal multi-hop path. Through utilizing neural networks to interact with the environment, intelligent agents are trained to learn routing policies to adapt to dynamic changes in the network topology and ensure the balance between energy consumption and multi-hop routing performance. Experimental results show that WOAD3QN-RP exhibits significant advantages over existing routing protocols in terms of network lifetime, energy efficiency, and communication delay.

Modified smell detection algorithm for optimal paths engineering in hybrid SDN

Optimal path engineering in hybrid software defined networking environments involves leveraging traditional networking and software defined capabilities to determine the most efficient paths for network traffic. In hybrid software defined networks, some parts of the network may be controlled by controllers, while others rely on traditional routing protocols. Leveraging the OpenFlow protocol, widely used in such deployments, to program flow entries in software defined switches is one approach to achieving optimal path engineering in hybrid software defined networks. By specifying specific rules and policies in the switches, we can control traffic forwarding behaviour and steer traffic along desired paths based on application requirements. In this work, the smell detection algorithm, a new variant of bio-inspired method, is adopted to explore its capability in routing. The new paradigm of smell detection agent, its architecture, protocols used, and the concept of hybrid defined network is also explained. A comprehensive experimental examination of within the controller, an algorithm based on smell detecting agents computes the most efficient route from where it began to the intended destination. Simulation results readily demonstrate the smell detection agent based technique's effective functioning in getting the optimum direction. In this work, bio-inspired algorithms outperformed conventional algorithms in terms of performance.

APPROACHES FOR SOLVING ROUTING AND SECURITY ISSUES IN MOBILE AD-HOC NETWORKS (MANETs): A REVIEW

Mobile Ad hoc Networks (MANETs) have been very popular for some years now owing to their ability to allow communication in dynamic and infrastructure-less environments. However, the unique characteristics of MANETs, such as node mobility, limited power resources, and absence of centralized infrastructure, pose challenges in ensuring efficient routing and robust security. This paper presents a review of the existing techniques aimed at improving routing protocols and security in MANETs. Scholarly articles, conference papers, and technical reports published in notable research outlets were sourced. Then, the papers were categorized into two main areas: routing techniques and security mechanisms based on the target of this work. Regarding routing techniques, this review discusses the evolution of traditional routing protocols, including proactive, reactive, and hybrid approaches, and highlights their strengths and limitations. Moreover, the review presents some recent advancement such as location-based, Quality of Service (QoS)-aware, and energy-efficient routing protocols, which address specific challenges in MANETs. In terms of security mechanisms, this review provides an overview of the various threats and attacks that MANETs are susceptible to, including black hole, wormhole, and Sybil attacks. The review then examines the countermeasures proposed in the literature to tackle the security challenges. This article further highlights the emerging trends and research directions in the field of MANETs which include blockchain-based security, machine learning-assisted routing, and Internet of Things (IoT) integration. It is believed that this review can provide further insights to researchers in this domain.

Design and Simulation of Efficient Dynamic Data Forwarding Protocol towards Route Optimization in VANET Infrastructure

The VANET, which consists of the Internet and the Internet of Things (IoT), has recently been implemented with the Internet of Vehicles (IoV). Through the use of a car network and an AdHoc approach, it provides the user with environmental traffic information. Combining the networks of cars, known as VANETs, allows for infrastructure-free data transfer, particularly for entertainment and emergency vehicle notification. The data or packet delivery ratio, data communication latency, data transmission faults, and details of vehicle collisions are among the traffic information provided by the internet of vehicles. In this work, an unmanned aerial vehicle (UAV) is used to solve the problem of route optimisation in VANET topologies for effective data transfer. Many routing protocols are used to improve the effectiveness of the packet or data routing process. In order to alleviate the routing issue and generate an effective way for efficient data transfer with strong network stability, the Optimised Link State Routing (OLSR) Protocol is used in this study with energy-saving techniques on many parameters. To evaluate the efficacy of the suggested routing technique on various network sizes, extensive simulations are carried out on the NS2 simulator with various network parameters. When compared to traditional routing protocols along UAV-based protocols for data transmission, the performance results of the suggested data routing solution employing OLSR protocol achieve higher efficient pathways. Ultimately, the suggested routing system produces superior outcomes in terms of message throughput, message delivery ratio, latency and network overhead on comparing with existing routing protocols.

K-means online-learning routing protocol (K-MORP) for unmanned aerial vehicles (UAV) adhoc networks

Unmanned Aerial Vehicles (UAVs) have become a hot topic due to their flexible architecture adopted in many wireless technologies. In UAV ad hoc networks, traditional routing protocols with a fixed topology are ineffective due to dynamic mobility and unstable paths. Therefore, the mobility patterns of UAVs challenge efficient and reliable routing in UAV networks. Traditional routing algorithms are often based on assumptions of static nodes and predetermined network topologies. Which are not suitable for the dynamic and unpredictable nature of UAV mobility patterns. To address this problem, this paper introduces a K-means online learning routing protocol (KMORP) scheme employing a Markov mobility model for UAV ad hoc networks. Initially, the proposed method utilizes a 3D Gauss Markov mobility model to accurately estimate UAV positions, while K-means online learning is adopted for dynamic clustering and load balancing. Designed for real-time data processing, KMORP is well suited for UAV ad hoc networks, quickly adapting to network environmental changes such as UAV mobility, interference, and signal degradation to ensure efficient data transmission and communication. This is achieved while reducing the overall communication overhead and increasing the packet delivery ratio(PDR%). In the routing phase, the proposed scheme employs inter-cluster forwarding nodes to transmit messages among different clusters. Extensive simulations demonstrate the performance of the proposed KMORP, showing a 38% better PDR compared to OLSR and over 50% less end-to-end(E2E) delay compared to typical K-Means. Furthermore, the proposed KMORP exhibited an average throughput of 955 kbps, showing a substantial improvement in network performance. The results underscore that the proposed KMORP outperforms existing techniques in terms of PDR, E2E delay, and throughput.

Improved design of load balancing for multipath routing protocol

In this paper, an improved routing protocol for multipath network load balancing is proposed for defects in the traditional AOMDV (Ad hoc On-demand Multipath Distance Vector) protocol. This research work analyzes problems in traditional routing protocols and estimates the available path load according to network transmission in Wireless Mesh Networks (WMN). Moreover, we design a load distribution scheme according to a given load and improve multi-path load balancing by using the MCMR method. We also control path discovery and the number of paths while also establishing routing paths and probability balancing. Lastly, improvements are made to the AOMDV protocol and efficient data transmission is acheived. The performance results of the modified routing protocol show that the designed protocol can improve successful delivery rate and prolong network survival time.

A novel routing optimization strategy based on reinforcement learning in perception layer networks

Wireless sensor networks have become incredibly popular due to the Internet of Things’ (IoT) rapid development. IoT routing is the basis for the efficient operation of the perception-layer network. As a popular type of machine learning, reinforcement learning techniques have gained significant attention due to their successful application in the field of network communication. In the traditional Routing Protocol for low-power and Lossy Networks (RPL) protocol, to solve the fairness of control message transmission between IoT terminals, a fair broadcast suppression mechanism, or Drizzle algorithm, is usually used, but the Drizzle algorithm cannot allocate priority. Moreover, the Drizzle algorithm keeps changing its redundant constant k value but never converges to the optimal value of k. To address this problem, this paper uses a combination based on reinforcement learning (RL) and trickle timer. This paper proposes an RL Intelligent Adaptive Trickle-Timer Algorithm (RLATT) for routing optimization of the IoT awareness layer. RLATT has triple-optimized the trickle timer algorithm. To verify the algorithm’s effectiveness, the simulation is carried out on Contiki operating system and compared with the standard trickling timer and Drizzle algorithm. Experiments show that the proposed algorithm performs better in terms of packet delivery ratio (PDR), power consumption, network convergence time, and total control cost ratio.

An Energy-Efficient Routing Protocol with Reinforcement Learning in Software-Defined Wireless Sensor Networks.

The enormous increase in heterogeneous wireless devices operating in real-time applications for Internet of Things (IoT) applications presents new challenges, including heterogeneity, reliability, and scalability. To address these issues effectively, a novel architecture has been introduced, combining Software-Defined Wireless Sensor Networks (SDWSN) with the IoT, known as the SDWSN-IoT. However, wireless IoT devices deployed in such systems face limitations in the energy supply, unpredicted network changes, and the quality of service requirements. Such challenges necessitate the careful design of the underlying routing protocol, as failure to address them often results in constantly disconnected networks with poor network performance. In this paper, we present an intelligent, energy-efficient multi-objective routing protocol based on the Reinforcement Learning (RL) algorithm with Dynamic Objective Selection (DOS-RL). The primary goal of applying the proposed DOS-RL routing scheme is to optimize energy consumption in IoT networks, a paramount concern given the limited energy reserves of wireless IoT devices and the adaptability to network changes to facilitate a seamless adaption to sudden network changes, mitigating disruptions and optimizing the overall network performance. The algorithm considers correlated objectives with informative-shaped rewards to accelerate the learning process. Through the diverse simulations, we demonstrated improved energy efficiency and fast adaptation to unexpected network changes by enhancing the packet delivery ratio and reducing data delivery latency when compared to traditional routing protocols such as the Open Shortest Path First (OSPF) and the multi-objective Q-routing for Software-Defined Networks (SDN-Q).

AFB-GPSR: Adaptive Beaconing Strategy Based on Fuzzy Logic Scheme for Geographical Routing in a Mobile Ad Hoc Network (MANET)

In mobile ad hoc networks (MANETs), geographical routing provides a robust and scalable solution for the randomly distributed and unrestricted movement of nodes. Each node broadcasts beacon packets periodically to exchange its position with neighboring nodes. However, reliable beacons can negatively affect routing performance in dynamic environments, particularly when there is a sudden and rapid change in the nodes’ mobility. Therefore, this paper suggests an improved Greedy Perimeter Stateless Routing Protocol, namely AFB-GPSR, to reduce routing overhead and increase network reliability by maintaining correct route selection. To this end, an adaptive beaconing strategy based on a fuzzy logic scheme (AFB) is utilized to choose more optimal routes for data forwarding. Instead of constant periodic beaconing, the AFB strategy can dynamically adjust beacon interval time with the variation of three network parameters: node speed, one-hop neighbors’ density, and link quality of nodes. The routing evaluation of the proposed protocol is carried out using OMNeT++ simulation experiments. The results show that the AFB strategy within the GPSR protocol can effectively reduce the routing overhead and improve the packet-delivery ratio, throughput, average end-to-end delay, and normalized routing load as compared to traditional routing protocols (AODV and GPSR with fixed beaconing). An enhancement of the packet-delivery ratio of up to 14% is achieved, and the routing cost is reduced by 35%. Moreover, the AFB-GPSR protocol exhibits good performance versus the state-of-the-art protocols in MANET.

Enhancing Packet Reliability in Wireless Multimedia Sensor Networks using a Proposed Distributed Dynamic Cooperative Protocol (DDCP) Routing Algorithm

Wireless Multimedia Sensor Networks (WMSNs) are being extensively utilized in critical applications such as environmental monitoring, surveillance, and healthcare, where the reliable transmission of packets is indispensable for seamless network operation. To address this requirement, this work presents a pioneering Distributed Dynamic Cooperation Protocol (DDCP) routing algorithm. The DDCP algorithm aims to enhance packet reliability in WMSNs by prioritizing reliable packet delivery, improving packet delivery rates, minimizing end-to-end delay, and optimizing energy consumption. To evaluate its performance, the proposed algorithm is compared against traditional routing protocols like Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), as well as proactive routing protocols such as Optimized Link State Routing (OLSR). By dynamically adjusting the transmission range and selecting optimal paths through cooperative interactions with neighboring nodes, the DDCP algorithm offers effective solutions. Extensive simulations and experiments conducted on a wireless multimedia sensor node testbed demonstrate the superior performance of the DDCP routing algorithm compared to AODV, DSR, and OLSR, in terms of packet delivery rate, end-to-end delay, and energy efficiency. The comprehensive evaluation of the DDCP algorithm against multiple routing protocols provides valuable insights into its effectiveness and efficiency in improving packet reliability within WMSNs. Furthermore, the scalability and applicability of the proposed DDCP algorithm for large-scale wireless multimedia sensor networks are confirmed. In summary, the DDCP algorithm exhibits significant potential to enhance the performance of WMSNs, making it a suitable choice for a wide range of applications that demand robust and reliable data transmission.