Retraction Note: Challenges and Developments in Secure Routing Protocols for Healthcare in WBAN: A Comparative Analysis

Retraction Note: Numerical analysis of all optical 1-bit comparator based on PhC structure for optical integrated circuits

A Delay Tolerant Network (DTN) is a network capable of handling long delays and data loss efficiently in various challenged scenarios and environments. Owing to the mentioned challenges, it becomes crucial to study how the routing protocols are designed to adapt in such networks. Currently, the research in this domain is focused on the improving the data delivery ratio and minimizing delays in the routing protocols. This paper reviews state-of-the-art routing protocols for Delay Tolerant Networks (DTNs) as well as performs their comparative analysis. DTN routing protocols are grouped into four categories viz encounter based, time based, infrastructure based and hybrid & others. This categorization depends on the information they use for relay selection routing. We have also discussed some of the inherent drawbacks such as energy consumption, delivery rates and buffer constraints of the existing routing algorithms. We have also conducted an empirical analysis and observed the performance of the most popular existing algorithms of encounter and time based category. This paper offers a widespread study of the routing protocols with their pros and cons.

Designing a secure routing protocol to ensure the network and privacy security is a huge challenge for the Internet of Things. In this paper, a new security routing protocol named PALXA is proposed. The PALXA integrates a new AGV (Arrow-d'Aspremont-Gerard-Varet) mechanism based on the mechanism design theory with the subject logic based reputation mechanism to provide secure and privacy-aware routing protocol and defend against the internal attacks. Simulation results demonstrate the superior performance of the PALXA in terms of successful rate of transmission, network throughput and node survival percentage compared to the existing secure routing protocol PALX and PAIR, in the presence of on-off attacks.

Retraction Note: Comparative analysis of the influence of various materials on the state of the roadside environment during the road repair.

Retraction Note: Comparative analysis of heart disease prediction using logistic regression, SVM, KNN, and random forest with cross-validation for improved accuracy.

Retraction Note: Developing an energy-efficient ubiquitous agriculture mobile sensor network-based threshold built-in MAC routing protocol (TBMP)

Retraction Note: A novel energy-efficient and reliable ACO-based routing protocol for WSN-enabled forest fires detection

In this technical report, we have examined the basic building blocks of mobile ad-hoc networks. The paper discusses various security requirements of ad-hoc networks, attacks in ad-hoc networks, Security Implementation and Routing Protocols. The primary purpose of the paper is to address the Optimized Link State Routing (OLSR) protocol in detail, along with the various possible attacks. Finally, algorithms for securing OLSR are proposed, via the addition of digital signatures, as well as more advanced techniques such as cross checking of advertised routing control data with the node’s geographical position. The main aim of this research work is the addition of security features to the existing OLSR protocol. In order to effectively design a secure routing protocol, we present a detailed literature survey of existing protocols, along with the various attacks. Based on the information gathered from the literature survey, a secure routing protocol for OLSR is proposed. The proposed secure routing protocol involves the addition of a digital signature as well as more advanced techniques such as the reuse of previous topology information to validate the actual link state. Thus, the main objective of this work is to provide secure routing and secure data transmission.

There are a number of routing protocols developed by researchers. Due to the nature of ad hoc networks, secure routing is an important area of research in developing secure routing protocols. Although researchers have proposed several secure routing protocols, their resistance towards various types of security attacks and efficiency are primary points of concern in implementing these protocols. This paper presents some of the available secure routing protocols and most common attack patterns against ad hoc networks. Routing protocols are subjected to case studies against the most commonly identified attack patterns such as: denial-of-service attack, tunneling, spoofing, black hole attack and wormhole attack etc. In MANET, the nodes also function as routers that discover and maintain routes to other nodes in the network. Establishing an optimal and efficient route between the communicating parties is the primary concern of the routing protocols of MANET. Any attack in routing phase may disrupt the overall communication and the entire network can be paralyzed. Thus, security in network layer plays an important role in the security of the whole network. A number of attacks in network layer have been identified and studied in security research. An attacker can absorb network traffic, inject themselves into the path between the source and destination and thus control the network traffic flow.

We are here to introduce the different approach that prevents security threat in MANET routing protocol. In recent year, secure routing protocol has been extensively studied. A mobile ad hoc network (MANET) is an infrastructure-less network where each node acts as an administrator for establishing end-to-end connection and a host for the source or destination. Security in MANET routing protocol is a mechanism to transfer data packet safely. Mostly, the routing protocols are based on cryptography scheme, security association, key distribution, authentication, and so on. The security research area is still open as many of the provided solutions are designed keeping a limited size scenario and limited kind of attacks and vulnerabilities. MANET is the future network because it is practically versatile, easy to use, inexpensive and can instantly update and reconfigure itself. In this paper, we have highlighted some of the typical vulnerabilities that are caused by characteristics of mobile ad hoc networks such as dynamic topology, limited resources (e.g., bandwidth, power), and lack of central management’s points.KeywordsRoute investigation protocolMANETKey managementSecurityAuthenticationMalicious node

Data routing has gained great intention since the appearance of Vehicular Networks (VANETs). However, in the presence of attackers, reliable and trustworthy operations in such networks become impossible without securing routing protocols. In this paper, we target to study and design a secure routing protocol S-GyTAR for vehicular environments. Several kinds of routing techniques are proposed in the literature and could be classified into topology-based or position-based strategies. Position-based is the most investigated strategy in vehicular networks due to the unique characteristics of such networks. For this reason, this work is based on the well-known intersection-based routing protocol GyTAR, which exploits the greedy forwarding technique to relay data. In fact, we benefit from GyTAR's characteristics and reshape it to introduce a new distributed trust management strategy to secure routing. We design a cluster-based mechanism to monitor nodes and a reputation-based schema to evaluate the vehicles and classify them. We evaluate our proposal using NS3 simulator. Simulation results show high performances regarding the detection rate of malicious nodes and overhead with an amelioration of the end-to-end communication delay in the presence of malicious vehicles.

For the dynamic topology and wireless channel features of mobile ad hoc networks, its security problem is always being a research focus. In the aspect of security routing protocol, the problem of how to enhance the security of mobile ad hoc networks was discussed in the paper. Based on the Ad Hoc networks structure and routing characters analysis, the requirements of Ad Hoc networks security routing protocol was brought forward. Then the insecure factors of current network routing protocol were analyzed in detail. To solve these insecure problems, corresponding solutions and material examples were proposed, meanwhile, an advanced strategy to optimizes the security route reconstruction was proposed.

The rapid surge of Mobile Ad Hoc Networks (MANETs) stimulates the need for adaptive, intelligent, and secure routing mechanisms to ensure seamless communication in dynamic environments. Traditional routing protocols are battling with security threats such as wormhole attacks that disrupt routing and degrade network performance. To address these challenges, this study outlines a state-of-the-art technique, the Reinforcement Learning-Based Secure Routing Protocol (RLSRP), which leverages adaptive k-hop clustering and deep Q-Networks (DQN) to fine-tune routing decisions dynamically while mitigating security risks. RLSRP unwaveringly measures network condition by evaluating latency variations and anomalies to spot suspicious nodes, thereby enhancing route stability. The protocol implements zone-related clustering where nodes within each zone collaborate to optimise routing paths based on real-time conditions, ensuring energy-efficient communication. Current research investigated deep reinforcement learning methodologies to improve security in zone-related MANETs and ensure efficient data routing in large-scale environments. A detailed simulation-based evaluation depicts the potency of the proposed RLSRP model when compared with other reinforcement learning-based routing protocols. Using a large-scale setup–scaling up to 10 million nodes–with Dask and TensorFlow, the results show that RLSRP consistently outperforms FSSAM, Cluster-RL, and Reputation-based Q-learning in terms of Packet Delivery Ratio (exceeding 99%), reduced latency, and improved energy efficiency. These findings reported RLSRP as a secure and scalable solution for practical MANET routing.

In P2P systems, it is important to guarantee the efficiency and security of message routing between the source and the destination. Unfortunately, malicious attackers can easily insert a lot of nodes they controlled, and disturb the message routing between honest nodes. In order to counter such attacks, secure routing protocols which ensure successful message routing are needed. Furthermore, it is very important to analyze existing routing protocols for the inventions of secure routing protocols. In this paper, we propose a security model for evaluating security level of routing protocol. In this model, we define the concept of Regular Path, and use it as the indicator of security level. Then, we analyze three representative routing protocols based on proposed model to make comparisons from the aspects of security level and implement level.

Minimization of energy consumption is the main attention of researchers while developing a routing protocol for wireless sensor networks, as sensor nodes are equipped with limited power supply. Virtual topology is an integral part of routing, and grid-based routing protocols are quite popular due to their simplified and efficient virtual grid topology construction. Although a list of surveys exists that either focus on routing protocols in a broader way or on other virtual topologies, none of these surveys are concerned about grid topology and grid-based routing protocols. Having this motivation in mind and considering the impact of these routing protocols on controlling and managing the energy consumption of wireless sensor networks, this article provides an expansive assessment of grid-based routing protocols based on their methodology. In this survey, the existing grid-based routing protocols are classified into two categories from the perspective of sink mobility: static sink and mobile sink. A phase-wise comprehensive overview of these routing protocols is provided in chronological order, along with their comparative analysis. Furthermore, the characteristics, design issues, and challenges of grid-based routing protocols are also provided.