Link Lifetime Research Articles

Trust-Based Secure Routing in Mobile Ad Hoc Network Using Hybrid Optimization Algorithm

Abstract Routing in mobile ad hoc networks (MANETs) is a hectic challenge due to the dynamic nature of the network. The provisional communication links are assured due to the infrastructure-independent capability of MANET, but with no proper centralized monitoring process, which makes routing in MANETs with respect to the security and trust a major issue. Thus, the paper introduces Advanced Encryption Standard-enabled Trust-based Secure Routing protocol based on the proposed Dolphin Cat Optimizer (AES-TDCO), which is an energy and trust-aware routing protocol. The proposed Dolphin Cat Optimizer is engaged in the optimal route selection based on the modeled objective function based on the trust factors, recent trust, historical trust, direct and indirect trust in addition to delay, distance and link lifetime. The Dolphin Cat Optimizer is the integration of Dolphin Echolocation and Cat Swarm Optimization algorithm that inherits the faster global convergence. The simulation using 75 nodes revealed that the proposed routing protocol acquired the maximal throughput, minimal delay, minimal packet drop and detection rate of 0.6531, 0.0107, 0.3267 and 0.9898 in the absence of network attacks and 0.7693, 0.0112, 0.3605 and 0.9961 in the presence of the network attacks.

Cuckoo Search and M-Tree based Multicast Ad hoc On-demand Distance Vector Protocol for MANET

The proposed work, Cuckoo Search (CS) and M-Tree based Multicast Ad hoc On-demand Distance Vector (MAODV), is a two-step process, which involves M-Tree construction and optimal multicast route selection. Divisional based Cluster (DIVC), a technique of clustering inspired from Divisive clustering, builts the M-Tree using three constraints, destination flag, path-inclusion factor, and multi-factor. This paper aims to provide optimal multicasting with multiple objectives, such as energy, link lifetime, distance and delay

Utility-Aware Enhanced Reliable Opportunistic Routing Protocol for Mobile Adhoc Networks

Usually, the nodes in Mobile Adhoc Networks (MANET) are bounded with the limited power resources to interact with each other nodes without any backbone infrastructures. As a result, an allocation of unbalanced traffic among nodes may increase the power dissipation in the overloaded nodes and path failures that degrade the network lifetime. To tackle this problem, an on-demand Power and Load-Aware (PLA) multipath node-disjoint source routing scheme was proposed based on the Dynamic Source Routing (DSR) protocol that uses a new cost function to determine the multiple node-disjoint power and select the load-aware optimal paths to their destinations. However, this protocol was affected by control overhead and the reliable packet delivery was also not effective. Hence in this article, Power and Load-aware i.e., Utility-Aware Reliable Opportunistic Routing (UAROR) protocol is proposed to enhance the efficiency and reliability of the routing protocol. In this protocol, topology control and link lifetime prediction algorithms are integrated into the PLA algorithm to predict the effect of the node mobility on routing performance. The link prediction algorithm considers both mobility speed and direction for improving the accuracy. As well, an opportunistic topology control algorithm uses packet delivery ratio to maintain the node’s stability. Moreover, Utility-Aware Enhanced ROR (UAEROR) protocol is proposed to improve the node’s stability and reduce the control overhead by employing the neighbor detection algorithm that uses degree and reachability of nodes. Finally, the simulation results show that the effectiveness of the proposed protocol compared to the existing protocol in terms of throughput, end-to-end delay, packet delivery ratio, network lifetime, energy consumption and control overhead.

Multipath data transmission in WSN using exponential cat swarm and fuzzy optimisation

This study proposes a technique for multipath data transmission in Wireless Sensor Network (WSN) by proposing a novel optimisation algorithm, named exponential cat swarm optimisation (ECSO), by integrating the exponential weighted moving average and CSO. Initially, the CH is selected by the penguin fuzzy-based ant colony optimisation (PFuzzyACO) technique, which is the integration of fuzzy, ACO and penguin search optimisation algorithm (PeSOA). After the selection of the optimal CH, the multipath transmission is done by the proposed ECSO algorithm. Here, an optimal path is selected for transmitting the routeing information from source to destination based on various parameters such as trust, energy, distance, delay, traffic density and link lifetime (LLT). Thus, the CHs with maximum trust, energy and LLT, and minimum distance, delay and traffic density are adapted for multipath data transmission using the proposed ECSO algorithm. The proposed ECSO algorithm shows 18.75, 2.99 and 29.87% improvements in terms of number of alive nodes, throughput and network energy, respectively, than the existing PFuzzyACO, which has high performance than the other comparative methods such as artificial bee colony, ACO, fractional artificial bee colony, Low-Energy Adaptive Clustering Hierarchy (LEACH), FuzzyACO and PeSOA.

HybTGR: a hybrid routing protocol based on topological and geographical information in vehicular ad hoc networks

Due to rapid changes in topology and high mobility of vehicles, routing in vehicular ad hoc networks needs special mechanisms. Due to these features, traditional routing protocols that are mainly developed for mobile ad hoc networks do not function well in these type of networks. To improve the efficiency of data routing, geographical routing method has been proposed by the researchers that use geographical information of nodes in the routing process. But this method relies only on the geographical information of network nodes and usually uses a greedy idea that may not perform well in some network situations. The main objective of this paper is to propose a hybrid routing protocol based on both geographical and topological information in Vehicular ad hoc networks and selecting the optimal route for data transmission. In the proposed protocol, based on the parameters like moving speed, link lifetime, the number of vehicles present in the vicinity of the node and distance to the destination node, a weight value is assigned to each network node. In this method, if the weight of a neighbor node is higher than that of the source node, geographical routing is used and otherwise, topology-based routing method will be used. The simulation results show that the proposed protocol due to the use of geographical and topological information, has improved packet loss rate, throughput, end-to-end delay and packet delivery ratio compared to LSGO, GpsrJ+ and GyTAR routing protocols.

On Verifying and Maintaining Connectivity of Interval Temporal Networks

An interval temporal network is, informally speaking, a network whose links change with time. The term interval means that a link may exist for one or more time intervals, called availability intervals of the link, after which it does not exist (until, maybe, a further moment in time when it starts being available again). In this model, we consider continuous time and high-speed (instantaneous) information dissemination. An interval temporal network is connected during a period of time [Formula: see text], if it is connected for all time instances [Formula: see text] (instantaneous connectivity). In this work, we study instantaneous connectivity issues of interval temporal networks. We provide a polynomial-time algorithm that answers if a given interval temporal network is connected during a time period. If the network is not connected throughout the given time period, then we also give a polynomial-time algorithm that returns large components of the network that remain connected and remain large during [Formula: see text]; the algorithm also considers the components of the network that start as large at time [Formula: see text] but dis-connect into small components within the time interval [Formula: see text], and answers how long after time [Formula: see text] these components stay connected and large. Finally, we examine a case of interval temporal networks on tree graphs where the lifetimes of links and, thus, the failures in the connectivity of the network are not controlled by us; however, we can “feed” the network with extra edges that may re-connect it into a tree when a failure happens, so that its connectivity is maintained during a time period. We show that we can with high probability maintain the connectivity of the network for a long time period by making these extra edges available for re-connection using a randomized approach. Our approach also saves some cost in the design of availabilities of the edges; here, the cost is the sum, over all extra edges, of the length of their availability-to-reconnect interval.

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[Formula: see text]J, 0.554, and 0.628, respectively.

Road-Aware Estimation Model for Path Duration in Internet of Vehicles (IoV)

In Internet of Vehicles (IoV), numerous routing metrics have been used to assess the performance of routing protocols such as, packet delivery ratio, throughput, end-to-end delay and path duration. Path duration is an influential design parameter, among these routing metrics, that determines the performance of vehicular networks. For instance, in highly dynamic scenarios, it can be used to predict link life time in on-demand routing protocols. In this paper, we propose an infrastructure-assisted hybrid road-aware routing protocol which is capable of enhanced vehicle-to-vehicle and vehicle-to-infrastructure communication. A remarkable aspect of the proposed protocol is that it establishes a link between path duration and fundamental design parameters like vehicular velocity, density, hop count and transmission range. Although, a lot of research has been previously performed, a well defined analytical model for IoV is not available in the literature. Precisely, a relation between path duration and vehicular velocity has not been validated in the previous studies. Experimental results show that the increased packet delivery ratio with reduced end-to-end delay can be achieved by the prediction of path duration. Proposed model for path duration is validated by getting experimental results from network simulator 3 (NS3) and analytical results from MATLAB. In addition, SUMO simulator was used to generate real time traffic on the roads of Gangnam district, South Korea.

Security Enhanced Location-aided Level-based Disjoint Multipath Routing Algorithm for Mobile Ad Hoc Networks

In mobile ad hoc networks (MANET), the location-based multipath routing protocols involves less routing overhead compared to non-location-based protocols. This paper proposes two location-based algorithms, Enhanced Location-aided Level-based node Disjoint Multipath routing (ELLDMR) and Secure Location-aided Level-based node Disjoint Multipath routing (SLLDMR), to enhance the link lifetime and the security of the MANET. The objective of ELLDMR is to build multiple paths with non-critical nodes so that the lifetime of the routing path is significantly increased. It also hides the source, destination and path identity in intermediate nodes to avoid intrusion of routing attacks in the routing path. The SLLDMR is an enhancement over ELLDMR where it aims to overcome rushing attack and exhibit secure data transmission using two-level cryptographic processes. The performances of ELLDMR and SLLDMR are simulated using NS2 where it shows a minimum routing overhead, less end to end delay and high packet delivery compared to existing Location-aided Level-based node Disjoint Multipath routing (LLDMR) algorithm and Topology Hiding multipath protocol (TOHIP).

Link Stability Based Optimized Routing Framework for Software Defined Vehicular Networks

The dynamic nature of vehicular networks imposes a lot of challenges in multihop data transmission as links are vulnerable in their existence due to associated mobility of vehicles. Thus, packets frequently find it difficult to get through to the destination due to the limited lifetimes of links. The conventional broadcasting based vehicular ad-hoc network (VANET) routing protocols struggle to accurately analyze the link dynamicity due to the unavailability of global information and inefficiencies in their route discovering schemes. However, with the recently emerged software defined vehicular network (SDVN) paradigm, link stability can be better scrutinized pertaining to the availability of global network information. Thus, in this paper, we introduce an optimization based novel packet routing scheme with a source routing based flow instantiation (FI) operation for SDVN. The routing framework closely analyzes the stability of links in selecting the routes and the problem is formulated as a minimum cost capacitated flow problem. Furthermore, an incremental packet allocation scheme is proposed to solve the routing problem in a less time complexity. The objective is to find multiple shortest paths which are collectively stable enough to deliver a given number of packets. The FI scheme efficiently delivers and caches flow information in the required nodes with a reduced extent of communication with the control plane. With the help of realistic simulation, we show that the proposed routing framework excels in terms of the performance over the existing routing schemes of both SDVN and conventional VANET.

Cluster‐based emergency message dissemination strategy for VANET using V2V communication

SummaryData dissemination in vehicular ad hoc network (VANET) is emerging as a critical area of research. One of the challenges posed by this domain is the reliability of connection, which depends on many parameters, such as the bandwidth consumption, transmission delay, and data quality of service (QoS). Dissemination of emergency messages is very critical since the network topology is changing frequently and rapidly, which leads to data loss. So, it is necessary to develop new protocols and enhance dissemination schemes in VANET to avoid more emergencies and hazards cases. In this regard, we have proposed a new strategy, which consists of data handling before dissemination process as the first step of our scheme. In this phase, the original message is optimized in order to reduce the number of exchanged packets. The second part of this proposition consists of constructing fast and stable clusters to improve the message delivery time and to procure efficient bandwidth consumption. This approach is based on a Fitness function, which takes into account different parameters such as the transmission period, the connectivity degree, the relative velocity, and the link lifetime validity. Since exchanging data in VANET is an important process, routing phase is proposed to perform data exchange among clusters. It is based on a rapid and real‐time heuristic (real‐time adaptive A* [RTAA*]). To evaluate the reliability of the proposed approach, an urban scenario is used with different simulation parameters. The simulation results show that our proposed approach presents a better stability and efficiency performance compared with the discussed approaches. The proposed approach improves the performance of cluster duration (5% − 25%), delivery rate (2% − 8%), and the overhead (5% − 35%) on average compared with the discussed approaches.

Geographical Zone based Cluster Head for Routing in Sparse Vehicular Networks

Vehicular ad hoc network is a wireless communication technology that is used to provide safety and comfort transport on the roads. Routing algorithm design is one of the main challenging issues in VANET. This paper presents a Geographical Zone Based Cluster Head algorithm for Vehicular Ad hoc Networks (VANETs) to reduce the communication overhead generated by the Control Packets (CP). Depending on the area, the network can be sparsely or fully connected. The Geographical Zone Based Cluster Head Routing in Sparse network (GZCHRS) algorithm can endure network partition due to low node density in the sparse network and high node density in the urban network. This paper inspects the issues of VANETs in sparse networks. In this algorithm, the routing decision is based on vehicular density, velocity and link lifetime. The simulation results display that under rural network conditions, the Geographical Zone Based Cluster Head Routing algorithm performs well when compared to Light Weight Intersection based Traffic Aware Routing (LITAR) and Intersection-based Connectivity Aware Routing (ICAR).

Multi-path selection based on fractional cuckoo search algorithm for QoS aware routing in MANET

PurposeMultimedia applications such as digital audio and video have stringent quality of service (QoS) requirement in mobile ad hoc network. To support wide range of QoS, complex routing protocols with multiple QoS constraints are necessary. In QoS routing, the basic problem is to find a path that satisfies multiple QoS constraints. Moreover, mobility, congestion and packet loss in dynamic topology of network also leads to QoS performance degradation of protocol.Design/methodology/approachIn this paper, the authors proposed a multi-path selection scheme for QoS aware routing in mobile ad hoc network based on fractional cuckoo search algorithm (FCS-MQARP). Here, multiple QoS constraints energy, link life time, distance and delay are considered for path selection.FindingsThe experimentation of proposed FCS-MQARP is performed over existing QoS aware routing protocols AOMDV, MMQARP, CS-MQARP using measures such as normalized delay, energy and throughput. The extensive simulation study of the proposed FCS-based multipath selection shows that the proposed QoS aware routing protocol performs better than the existing routing protocol with maximal energy of 99.1501 and minimal delay of 0.0554.Originality/valueThis paper presents a hybrid optimization algorithm called the FCS algorithm for the multi-path selection. Also, a new fitness function is developed by considering the QoS constraints such as energy, link life time, distance and delay.

Adaptive load distribution approach based on congestion control scheme in ad-hoc networks

ABSTRACTThe ‘load distribution’ proposition in mobile ad-hoc networks (MANETs) is accomplishing great stimulation. This is because of the phenomenal facets it possesses including advanced network resilience, reliability and performance. Though there are other leading network layer routing protocols, but they radically utilise single-path communication paradigm, which is why they fail in achieving efficient load distribution in a network. Via this paper, we propose an efficient cross-layer adaptive load distribution approach to capitalise network’s channel utilisation and to rapidly adapt to dynamic wireless channel characteristic changes. The proposed method modifies the load balanced congestion adaptive routing (LBCAR) protocol and is developed using dynamic load distribution technique, by pioneering (i) novel parameters, which report for the availability of route pertaining to minimum traffic load and better link lifetime and also adapt according to varying available network resources; (ii) an absolute dynamic method to lessen the redundant route oscillations which further reduces the routing instabilities. The simulation results demonstrate the usefulness of the proposed method and yields better results in comparison to LBCAR and standard instead of dynamic ource outing, it is dynamic source routing (DSR) protocol.

Stability-based routing, link scheduling and channel assignment in cognitive radio mobile ad-hoc networks

One fundamental issue in cognitive radio mobile ad hoc networks (CR-MANETs) is the selection of a stable path between any source and destination node to reduce the end-to-end delay and energy consumption arisen from route reconstruction. In this way, we analyse the link stability by calculating the link life time that is dependent on failures caused by secondary users’ (SUs) movements and primary users’ (PUs) activities. We propose a joint stability-based routing, link scheduling and channel assignment (SRLC) algorithm in CR-MANETs, which is benefited from considering the link life time, amount of interference imposed on PUs and energy consumption. The proposed algorithm selects a frequency channel/time slot in a way that channel utilization and previous behaviours of SUs and PUs, are taken into account. In the proposed SRLC, the concept of load balancing is applied by avoiding to route packets through SUs with insufficient energy. The effectiveness of the proposed algorithm is verified by evaluating the aggregate interference energy, end-to-end delay, goodput and the energy usage per packet transmission under three different scenarios. The results show our proposed scheme finds better routes compared to the recently proposed joint stable routing and channel assignment protocol.

A multi-hop moving zone (MMZ) clustering scheme based on cellular-V2X

A clustering scheme based on pure V2V communications has two prominent issues i.e. broadcast storm and network disconnection. The application of the fifth generation (5G) technology to vehicular networks is an optimal choice due to its wide coverage and low latency features. In this paper, a Multi-hop Moving Zone (MMZ) clustering scheme is proposed by combining IEEE 802.11p with the 3rd Generation Partnership Project (3GPP) 5G cellular technology. In MMZ, vehicles are clustered up-to three hops using V2V communications based on IEEE 802.11p aiming to reduce excessive cellular hand-off cost. While the zonal heads (ZHs) i.e. cluster heads (CHs) are selected by cellular-V2X (C-V2X) on the basis of multi-metrics i.e. relative speed, distance and link life time (LLT). The main goal of MMZ is to form stable clusters achieving high packet delivery and low latency. The simulation results using ns3 show that, 5G wide range technology significantly improves the stability of MMZ in term of ZH duration and change rate. The average Data Packet Delivery Ratio (DPDR) and E2E latency are also improved as compared to the existing clustering schemes.

Multi‐objective auto‐regressive whale optimisation for traffic‐aware routing in urban VANET

Vehicular ad-hoc network (VANET) is a growing networking concept that has been used increasingly in various applications including traffic alert broadcasting. The main purpose of VANET is to provide safety to the drivers by alerting them to the dangers that may happen. This study presents a traffic-aware routing protocol in VANET by the introduction of multi-objective auto-regressive whale optimisation (ARWO) algorithm. ARWO algorithm selects the best path from the multiple paths by considering the multiple objectives, such as end-to-end delay (EED), link life time, packet delay and distance, in the fitness function. Here, the traffic density and the expected average speed of the vehicle are predicted by the exponential weighted moving average approach. The performance of ARWO protocol is compared with four existing techniques, like stable CDS-based routing protocol, fractional glow worm swarm optimisation, glow worm swarm optimisation, and Whale Optimization Algorithm (WOA), using the metrics, EED, distance, traffic density, and throughput. The simulation results show that the proposed ARWO algorithm achieves EED of 2.941, a distance of 2.15, traffic density of 0.009 and throughput of 0.1, respectively, at maximum constraints, i.e. at a maximum number of vehicles and simulation time and thus proves its efficiency against the comparative protocols.

M‐LionWhale: multi‐objective optimisation model for secure routing in mobile ad‐hoc network

Mobile ad-hoc network (MANET) is an emerging technology that comes under the category of wireless network. Even though the network assumes that all its mobile nodes are trusted, it is impossible in the real world as few nodes may be malicious. Therefore, it is essential to put forward a mechanism that can provide security by selecting an optimal route for data forwarding. In this study, a goal programming model is designed using a hybrid optimisation algorithm, called M-LionWhale, for secure routing. M-LionWhale is an optimisation algorithm that incorporates lion algorithm (LA) into whale optimisation algorithm (WOA) for the optimal selection of the path in MANET. The multi-objective optimisation model considers several quality of service (QoS) parameters, namely energy, distance, link lifetime, delay, and trust. With the estimated multi-objective parameters, a fitness function is developed for the best selection of routes. The performance of the proposed algorithm is evaluated using three metrics, such as packet delivery ratio (PDR), throughput, and energy and is compared with that of existing trust-based QoS routing model, LA, and WOA. The proposed M-LionWhale algorithm could attain the maximum performance with 24.1313% residual energy, throughput of 0.2966 kbps, and PDR of 0.3051 at maximum simulation time.

Joint load balanced stable routing and communication segment assignment in mobile cognitive radio ad‐hoc networks

SummaryThe fundamental issues in mobile cognitive radio ad‐hoc networks are the selection of the optimal stable paths between nodes and proper assignment of the frequency channels/time slots (communication segments) to the links. In this paper, a joint load balanced stable routing and communication segment assignment algorithm is proposed that considers jointly the mobility prediction, mitigating the co‐channel interference and energy consumption. The novelty of the proposed algorithm lies in the increasing of the path stability, which benefits from the maximum link lifetime parameter and introduced weighting function to keep routes away from the PU's region. This avoids the negative impacts on the PUs' operations and decreases the conflict of the cognitive nodes. In the proposed algorithm, the concept of load balancing is considered that yields in the balancing energy consumption in the network, improving the network performance and distributing traffic loads on all available channels. The effectiveness of the proposed algorithm is verified by evaluating the aggregate interference energy, average end‐to‐end delay, goodput, and the energy usage per packet under 6 scenarios. The results show that the performance of the proposed algorithm is significantly better than the recently proposed joint stable routing and channel assignment protocol.

Cross-Layer and Reliable Opportunistic Routing Algorithm for Mobile Ad Hoc Networks

For improving the efficiency and the reliability of the opportunistic routing algorithm, in this paper, we propose the cross-layer and reliable opportunistic routing algorithm (CBRT) for Mobile Ad Hoc Networks, which introduces the improved efficiency fuzzy logic and humoral regulation inspired topology control into the opportunistic routing algorithm. In CBRT, the inputs of the fuzzy logic system are the relative variance (rv) of the metrics rather than the values of the metrics, which reduces the number of fuzzy rules dramatically. Moreover, the number of fuzzy rules does not increase when the number of inputs increases. For reducing the control cost, in CBRT, the node degree in the candidate relays set is a range rather than a constant number. The nodes are divided into different categories based on their node degree in the candidate relays set. The nodes adjust their transmission range based on which categories that they belong to. Additionally, for investigating the effection of the node mobility on routing performance, we propose a link lifetime prediction algorithm which takes both the moving speed and moving direction into account. In CBRT, the source node determines the relaying priorities of the relaying nodes based on their utilities. The relaying node which the utility is large will have high priority to relay the data packet. By these innovations, the network performance in CBRT is much better than that in ExOR, however, the computation complexity is not increased in CBRT.