Improved QoS-Secure Routing in MANET Using Real-Time Regional ME Feature Approximation

Mobile Ad-hoc Network(MANET)routing problems are thoroughly studied several approaches are identified in support of MANET.Improve the Quality of Service(QoS)performance of MANET is achieving higher performance.To reduce this drawback,this paper proposes a new secure routing algorithm based on real-time partial ME(Mobility,energy)approximation.The routing method RRME(Real-time Regional Mobility Energy)divides the whole network into several parts,and each node’s various characteristics like mobility and energy are randomly selected neighbors accordingly.It is done in the path discovery phase,estimated to identify and remove malicious nodes.In addition,Trusted Forwarding Factor(TFF)calculates the various nodes based on historical records and other characteristics of multiple nodes.Similarly,the calculated QoS Support Factor(QoSSF)calculating by the Data Forwarding Support(DFS),Throughput Support(TS),and Lifetime Maximization Support(LMS)to any given path.One route was found to implement the path of maximizing MANET QoS based on QoSSF value.Hence the proposed technique produces the QoS based on real-time regional ME feature approximation.The proposed simulation implementation is done by the Network Simulator version 2(NS2)tool to produce better performance than other methods.It achieved a throughput performance had 98.5%and a routing performance had 98.2%.

Region Centric GL Feature Approximation Based Secure Routing for Improved QoS in MANET

Secure routing in Mobile Adhoc Network(Manet)is the key issue now a day in providing secure access to different network services.As mobile devices are used in accessing different services,performing secure routing becomes a challenging task.Towards this,different approaches exist whichfind the trusted route based on their previous transmission details and behavior of different nodes.Also,the methods focused on trust measurement based on tiny information obtained from local nodes or with global information which are incomplete.How-ever,the adversary nodes are more capable and participate in each transmission not just to steal the data also to generate numerous threats in degrading QoS(Quality of Service)parameters like throughput,packet delivery ratio,and latency of the network.This encourages us in designing efficient routing scheme to max-imize QoS performance.To solve this issue,a two stage trust verification scheme and secure routing algorithm named GL-Trust(Global-Local-Trust)is presented.The method involves in route discovery as like popular AODV(Adaptive On-demand Distance Vector)which upgrades the protocol to collect other information like transmission supported,successful transmissions,energy,mobility,the num-ber of neighbors,and the number of alternate route to the same destination and so on.Further,the method would perform global trust approximation to measure the value of global trust and perform local trust approximation to measure local trust.Using both the measures,the method would select a optimal route to perform routing.The protocol is designed to perform localized route selection when there is a link failure which supports the achievement of higher QoS performance.By incorporating different features in measuring trust value towards secure routing,the proposed GL-Trust scheme improves the performance of secure routing as well as other QoS factors.

A Micro-Payment Based Isolation ofMisbehavior Secure Routing for Sensor Network

In this paper, we present a Micro-payment based Isolation of Misbehavior(MIM) secure routing protocol. The protocol contains three parts: micro-payment scheme, routingdiscovery and malicious nodes detection The micro-payment scheme proposed in MIM is the firstvirtual currency system that can be suit lor sensor network environment, Based on the micro-paymentscheme, we device an energy aware routing protocol, which forwards packets by auction. Furthermore,the base station can detect and isolate misbehave or non-cooptrare nodes according to the routinginformation.

Towards Blockchain-Based Secure BGP Routing,Challenges and Future Research Directions

Border Gateway Protocol(BGP)is a standard inter-domain routing protocol for the Internet that conveys network layer reachability information and establishes routes to different destinations.The BGP protocol exhibits security design defects,such as an unconditional trust mechanism and the default acceptance of BGP route announcements from peers by BGP neighboring nodes,easily triggering prefix hijacking,path forgery,route leakage,and other BGP security threats.Meanwhile,the traditional BGP security mechanism,relying on a public key infrastructure,faces issues like a single point of failure and a single point of trust.The decentralization,anti-tampering,and traceability advantages of blockchain offer new solution ideas for constructing secure and trusted inter-domain routing mechanisms.In this paper,we summarize the characteristics of BGP protocol in detail,sort out the BGP security threats and their causes.Additionally,we analyze the shortcomings of the traditional BGP security mechanism and comprehensively evaluate existing blockchain-based solutions to address the above problems and validate the reliability and effectiveness of blockchain-based BGP security methods in mitigating BGP security threats.Finally,we discuss the challenges posed by BGP security problems and outline prospects for future research.

Performance of unique and secure routing protocol(USRP)in flying Adhoc Networks for healthcare applications

Nowadays,Flying Adhoc Networks play a vital role due to its high efficiency in fast communication.Unmanned aerial vehicles transmit data much faster than other networks and are useful in all aspects of communication.In healthcare applications,wireless body area network transmits the data,whereas the security,which is the most important concern to be focused in a flying adhoc network is not satisfactory.Many intruders tamper the network,degrading the overall network performance.To avoid security issues,a unique and secure routing protocol that provides a single solution for five different types of attacks such as,black hole attacks,grey hole attacks,yoyo attacks,conjoint attack and jamming attacks,is proposed.The simulation results analyses the network performance by using the proposed routing table.In comparison to the other solutions rendered to resolve the affected network,this proposed routing protocol has a higher throughput,higher delivery rate,and lower delay.The Unique and Secure Routing Protocol(USRP)provides an integrated solution for an efficient and secure communication in a flying adhoc network.

A Collaborative Approach for Secured Routing in Mobile Ad-Hoc Network

Mobile computing is the most powerful application for network com-munication and connectivity,given recent breakthroughs in thefield of wireless networks or Mobile Ad-hoc networks(MANETs).There are several obstacles that effective networks confront and the networks must be able to transport data from one system to another with adequate precision.For most applications,a frame-work must ensure that the retrieved data reflects the transmitted data.Before driv-ing to other nodes,if the frame between the two nodes is deformed in the data-link layer,it must be repaired.Most link-layer protocols immediately disregard the frame and enable the high-layer protocols to transmit it down.In other words,because of asset information must be secured from threats,information is a valu-able resource.In MANETs,some applications necessitate the use of a network method for detecting and blocking these assaults.Building a secure intrusion detection system in the network,which provides security to the nodes and route paths in the network,is a major difficulty in MANET.Attacks on the network can jeopardize security issues discovered by the intrusion detection system engine,which are then blocked by the network’s intrusion prevention engine.By bringing the Secure Intrusion Detection System(S-IDS)into the network,a new technique for implementing security goals and preventing attacks will be developed.The Secure Energy Routing(SER)protocol for MANETs is introduced in this study.The protocol addresses the issue of network security by detecting and preventing attacks in the network.The data transmission in the MANET is forwarded using Elliptical Curve Cryptography(ECC)with an objective to improve the level of security.Network Simulator–2 is used to simulate the network and experiments are compared with existing methods.

Location-aided and secure routing protocol for heterogeneous multi-hop wireless networks

Most of the existing routing protocols for heterogeneous multi-hop wireless networks （HWMNs） use on-demand routing protocols owing to their suitability for dynamic topology environments, but it causes wastes of network resources with large number of data packets being broadcast. Furthermore, some nodes in heterogeneous wireless multi-hop networksmay be malicious or selfish nodes which can easily lead to link attacks. A novel routing protocol called trust-based secure routing protocol with auxiliary of nodes＇ location information （TSRAL） is proposed for the establishment of a secure routing protocol with a lower overhead for HWMNs which combines the location information and trust value of nodes to select the next forwarding nodes. The destination node selects an optimal path from multiple paths according to the total trust value and the hop number of routes. Simulation results demonstrate that TSRAL can not only reduce the number of hops and data packets being broadcast in the process of routing but also ensure the safety of the route.

A secure routing scheme based on social network analysis in wireless mesh networks

As an extension of wireless ad hoc and sensor networks, wireless mesh networks(WMNs) are employed as an emerging key solution for wireless broadband connectivity improvement. Due to the lack of physical security guarantees, WMNs are susceptible to various kinds of attack. In this paper, we focus on node social selfish attack, which decreases network performance significantly. Since this type of attack is not obvious to detect, we propose a security routing scheme based on social network and reputation evaluation to solve this attack issue. First, we present a dynamic reputation model to evaluate a node's routing behavior, from which we can identify selfish attacks and selfish nodes. Furthermore, a social characteristic evaluation model is studied to evaluate the social relationship among nodes. Groups are built based on the similarity of node social status and we can get a secure routing based on these social groups of nodes. In addition, in our scheme, nodes are encouraged to enter into multiple groups and friend nodes are recommended to join into groups to reduce the possibility of isolated nodes. Simulation results demonstrate that our scheme is able to reflect node security status, and routings are chosen and adjusted according to security status timely and accurately so that the safety and reliability of routing are improved.

A Novel Improved Artificial Bee Colony and Blockchain-Based Secure Clustering Routing Scheme for FANET

Flying Ad hoc Network(FANET)has drawn significant consideration due to its rapid advancements and extensive use in civil applications.However,the characteristics of FANET including high mobility,limited resources,and distributed nature,have posed a new challenge to develop a secure and ef-ficient routing scheme for FANET.To overcome these challenges,this paper proposes a novel cluster based secure routing scheme,which aims to solve the routing and data security problem of FANET.In this scheme,the optimal cluster head selection is based on residual energy,online time,reputation,blockchain transactions,mobility,and connectivity by using Improved Artificial Bee Colony Optimization(IABC).The proposed IABC utilizes two different search equations for employee bee and onlooker bee to enhance convergence rate and exploitation abilities.Further,a lightweight blockchain consensus algorithm,AI-Proof of Witness Consensus Algorithm(AI-PoWCA)is proposed,which utilizes the optimal cluster head for mining.In AI-PoWCA,the concept of the witness for block verification is also involved to make the proposed scheme resource efficient and highly resilient against 51%attack.Simulation results demonstrate that the proposed scheme outperforms its counterparts and achieves up to 90%packet delivery ratio,lowest end-to-end delay,highest throughput,resilience against security attacks,and superior in block processing time.

OTP-Based Software-Defined Cloud Architecture for Secure Dynamic Routing

In the current era,anyone can freely access the Internet thanks to the development of information and communication technology.The cloud is attracting attention due to its ability to meet continuous user demands for resources.Additionally,Cloud is effective for systems with large data flow such as the Internet of Things(IoT)systems and Smart Cities.Nonetheless,the use of traditional networking technology in the cloud causes network traffic overload and network security problems.Therefore,the cloud requires efficient networking technology to solve the existing challenges.In this paper,we propose one-time password-based software-defined cloud architecture for secure dynamic routing to mitigating the above-mention issues.The proposed cloud architecture provides a secure data path through dynamic routing using One-Time Internet Protocol(OTIP)algorithm between each layer.On the network side,we use software-defined technology to provide efficient network management and data security.We introduce a software-defined cloud architecture that applies OTIP algorithms for secure dynamic routing.We conduct a comparative analysis between general IP communication and proposed OTIP communication architecture.It evaluates the performance of OTIP algorithms.Finally,we examine the proposed software-defined cloud architecture,including how to apply OTIP in secure dynamic routing according to the results of the comparative analysis.

Reputation-based secure routing protocol in mobile ad-hoc network using Jaya Cuckoo optimization

The advancements in Mobile Ad-hoc Network(MANET)are suitable to wide applications,which involve military applications,civilian domains,and disaster recovery systems.It is assumed that the nodes present in the routing protocols of MANETs are cooperative and trustworthy.This assumption makes MANET more prone to manipulation and interception,which generates several possibilities of different suspicious attacks,such as Denial of Service(DoS)attacks.Hence,security is considered as an important parameter as the network is fond of suspicious attacks.This paper addresses the security issues by proposing an optimization algorithm,named Jaya Cuckoo Search(JCS)algorithm,which is the combination of Jaya algorithm and Cuckoo Search(CS)algorithm for initiating secure route among the MANET nodes so that the path attained is feasible and secure.The proposed JCS algorithm uses a fitness function,which considers a multiobjective function using parameters,such as distance,link lifetime,delay,energy,trust,along with the reputation factor to select a secured path.The JCS algorithm shows maximum performance with energy,throughput,and PDR values as 27.826 J,0.554,and 0.628,respectively.

Energy-and trust-aware secure routing algorithm for big data classification using MapReduce framework in IoT networks

Due to the open nature of wireless data transmission,routing and data security pose an important research challenge in the Internet of Things(IoT)-enabled networks.Also,the characteristic features,like constrained resources,heterogeneity,uncontrolled environment,and scalability requirement,make the security issues even more challenging.Hence,an effective and secure routing protocol named modified Energy Harvesting Trust-aware Routing Algorithm(mod-EHTARA)is proposed to increase the energy efficiency and the lifespan of the nodes.The proposed mod-EHTARA is designed by adopting the Link Lifetime(LLT)model with the traditional EHTARA.The optimal secure routing path is effectively selected by the proposed mod-EHTARA using the cost metric,which considers the factors like delay,LLT,energy,and trust.The big data classification process is carried out at the Base Station(BS)using the MapReduce framework.Accordingly,the big data classification is progressed using a stacked autoencoder,which is trained by the Adaptive E-Bat algorithm.The Adaptive E-Bat algorithm is developed by integrating the adaptive concept with the Bat Algorithm(BA)and Exponential Weighted Moving Average(EWMA).The proposed mod-EHTARA showed better performance by obtaining a maximal energy of 0.9855.

Route Guardian: Constructing Secure Routing Paths in Software-Defined Networking

Software-Defined Networking（SDN） decouples the control plane and the data plane in network switches and routers, which enables the rapid innovation and optimization of routing and switching configurations. However,traditional routing mechanisms in SDN, based on the Dijkstra shortest path, do not take the capacity of nodes into account, which may lead to network congestion. Moreover, security resource utilization in SDN is inefficient and is not addressed by existing routing algorithms. In this paper, we propose Route Guardian, a reliable securityoriented SDN routing mechanism, which considers the capabilities of SDN switch nodes combined with a Network Security Virtualization framework. Our scheme employs the distributed network security devices effectively to ensure analysis of abnormal traffic and malicious node isolation. Furthermore, Route Guardian supports dynamic routing reconfiguration according to the latest network status. We prototyped Route Guardian and conducted theoretical analysis and performance evaluation. Our results demonstrate that this approach can effectively use the existing security devices and mechanisms in SDN.

Trust management-based and energy efficient hierarchical routing protocol in wireless sensor networks

The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network(WSN).Although the hierarchical routing protocol can effectively cope with large-scale application scenarios,how to elect a secure cluster head and balance the network load becomes an enormous challenge.In this paper,a Trust Management-based and Low Energy Adaptive Clustering Hierarchy protocol(LEACH-TM)is proposed.In LEACH-TM,by using the number of dynamic decision cluster head nodes,residual energy and density of neighbor nodes,the size of the cluster can be better constrained to improve energy efficiency,and avoid excessive energy consumption of a node.Simultaneously,the trust management scheme is introduced into LEACH-TM to defend against internal attacks.The simulation results show that,compared with LEACH-SWDN protocol and LEACH protocol,LEACH-TM outperforms in prolonging the network lifetime and balancing the energy consumption,and can effectively mitigate the influence of malicious nodes on cluster head selection,which can greatiy guarantee the security of the overall network.

Enhancement in Ad hoc on Demand Distance Vector (AODV) Routing Protocol Security

Ad-hoc networking has mainly been associated with military battlefield networks. Security has received considerably less attention and the issue needs to be addressed before any successful applications will appear. Due to the insecure nature of the wireless link and their dynamically changing topology, wireless ad-hoc networks require a careful and security-oriented approach for designing routing protocols. In this paper, an AODV-based secure routing protocol- ENAODV is presented. A speed-optimized digital signature algorithm is integrated into the routing protocol. The protocol algorithm is implemented with NS-2. The security of the protocol is analyzed. The simulating results show that the performances of ENAODV protocol, such as average node energy consumption, packet delay and packet delivery is nearly the same as standard AODV protocol.

Trust-Based Routing Optimization Using Multi-Ant Colonies in Wireless Sensor Network

Nowadays,with the advancement of new technologies such as the Internet of Things,new applications and intelligent networks,the use of wireless sensor network increased considerably.They are prone to a variety of attacks.Thus,network security is of utmost importance to researchers.In the past,methods such as cryptography,authentication and hash function were used to create security in this type of network.However,due to the limitations of this type of network,trust-based methods are used today.Finding a secure route for transferring data among available routes greatly increases security in this network.In this paper,we present aTrust-based Routing Optimization using Multi-Ant Colonies(MACRAT)scheme which is based on the improvement of the ant meta-heuristic algorithm and an improved method for trust assessment which is presented.The simulation results illustrate that MACRAT is more efficient than existing routing protocols.The results show that MACRAT improved by 10% in black hole detection compared to ESRT protocol and by 4% compared to M-CSO protocol,the packet loss rate in MACRAT improved by 30.14%compared to ESRT protocol and 6%compared to M-CSO protocol.

A Partially Non-Cryptographic Security Routing Protocol in Mobile Ad Hoc Networks

In this paper, we propose a partially non-cryptographic security routing protocol （PNCSR） that protects both routing and data forwarding operations through the same reactive approach. PNCSR only apply public-key cryptographic system in managing token, but it doesn＇t utilize any cryptographic primitives on the routing messages. In PNCSR, each node is fair. Local neighboring nodes collaboratively monitor each other and sustain each other. It also uses a novel credit strategy which additively increases the token lifetime each time a node renews its token. We also analyze the storage, computation, and communication overhead of PNCSR, and provide a simple yet meaningful overhead comparison. Finally, the simulation results show the effectiveness of PNCSR in various situations.

Real-Time Data Transmission with Data Carrier Support Value in Neighbor Strategic Collection in WSN

An efficient trust-aware secure routing and network strategy-based data collection scheme is presented in this paper to enhance the performance and security of wireless sensor networks during data collection.The method first discovers the routes between the data sensors and the sink node.Several factors are considered for each sensor node along the route,including energy,number of neighbours,previous transmissions,and energy depletion ratio.Considering all these variables,the Sink Reachable Support Measure and the Secure Communication Support Measure,the method evaluates two distinct measures.The method calculates the data carrier support value using these two metrics.A single route is chosen to collect data based on the value of data carrier support.It has contributed to the design of Secure Communication Support(SCS)Estimation.This has been measured according to the strategy of each hop of the route.The suggested method improves the security and efficacy of data collection in wireless sensor networks.The second stage uses the two-fish approach to build a trust model for secure data transfer.A sim-ulation exercise was conducted to evaluate the effectiveness of the suggested framework.Metrics,including PDR,end-to-end latency,and average residual energy,were assessed for the proposed model.The efficiency of the suggested route design serves as evidence for the average residual energy for the proposed framework.

Trusted Cluster-Based Communication for Wireless Sensor Network Using Meta-Heuristic Algorithms

The mobile transient and sensor network’s routing algorithm detects available multi-hop paths between source and destination nodes.However,some methods are not as reliable or trustworthy as expected.Therefore,finding a reliable method is an important factor in improving communication security.For further enhancement of protected communication,we suggest a trust cluster based secure routing(TCSR)framework for wireless sensor network(WSN)using optimization algorithms.First,we introduce an efficient cluster formation using a modified tug of war optimization(MTWO)algorithm,which provides loadbalanced clusters for energy-efficient data transmission.Second,we illustrate the optimal head selection using multiple design constraints received signal strength,congestion rate,data loss rate,and throughput of the node.Those parameters are optimized by a butterfly optimal deep neural network(BO-DNN),which provides first-level security towards the selection of the best head node.Third,we utilize the lightweight signcryption to encrypt the data between two nodes during data transmission,which provides second-level security.The model provides an estimation of the trust level of each route to help a source node to select the most secure one.The nodes of the network improve reliability and security by maintaining the reliability component.Simulation results showed that the proposed scheme achieved 45.6%of delivery ratio.

Hybrid Trust Based Reputation Mechanism for Discovering Malevolent Node in MANET

A self-contained connection of wireless links that functions without any infrastructure is known as Mobile Ad Hoc Network(MANET).A MANET’s nodes could engage actively and dynamically with one another.However,MAN-ETs,from the other side,are exposed to severe potential threats that are difficult to counter with present security methods.As a result,several safe communication protocols designed to enhance the secure interaction among MANET nodes.In this research,we offer a reputed optimal routing value among network nodes,secure computations,and misbehavior detection predicated on node’s trust levels with a Hybrid Trust based Reputation Mechanism(HTRM).In addition,the study designs a robust Public Key Infrastructure(PKI)system using the suggested trust evaluation method in terms of“key”generation,which is a crucial component of a PKI cryptosystem.We also concentrate on the solid node authenticating process that relies on pre-authentication.To ensure edge-to-edge security,we assess safe,trustworthy routes to secure computations and authenticate mobile nodes,incorporating uncertainty into the trust management solution.When compared to other protocols,our recommended approach performs better.Finally,we use simulations data and performance evaluation metrics to verify our suggested approach’s validity Our approach outperformed the competing systems in terms of overall end-to-end delay,packet delivery ratio,performance,power consumption,and key-computing time by 3.47%,3.152%,2.169%,and 3.527%,3.762%,significantly.