Self-improved Jellyfish Search Optimizer for routing and channel assignment in MANET

Mobile Adhoc Networks (MANETs) have emerged as a popular technology because of their wide application and independent mobility. Nevertheless, communication through MANETs can be effective because of their inherent nature of high mobility, which in turn results in a higher rate of data loss and delay. Therefore, for effective communication to be achieved, the MANETs’ routing performance must be enhanced. Some extant routing protocols like AOMDV can yield moderate Routing Overhead (RO) during communication. The review of previous studies shows that there is a need for improvement in the following areas: Computational E2E delay: the proposed Genetic Algorithm- Ant Colony Optimization (GA-ACO) was unable to reduce the computational E2E delay that occurs during communication. RO: The schemes that were proposed failed to minimize the RO in the network. Energy consumption: the reduction energy consumed by the network was reduced, however, high throughput and PDR could not be achieved by the method. On the contrary, the EHO-based AOMDV routing protocol achieved low E2E delay and RO but was unable to decrease the energy consumed by the network. Throughput and PDR: The protocol proposed failed to achieve high Quality of Services (QoS). Consequently, this paper aims to provide a solution to this communication problem by proposing a Hybrid Optimization-based Effective Path Selection and Multipath routing (HOEPSM) approach for MANETs. The proposed approach, which is HOEPSM is made up of two parts: Elephant Herding Optimization (EHO)-based AOMDV routing protocol, which makes use of EHO for the identification of the shortest path from the source to the destination. The second part which is the Hybrid optimization using Genetic Ant Optimization (GAO) algorithm, involves finding the best solution through the use of a GAO-based hybrid optimization algorithm. The results of the study revealed that the use of the HOEPSM causes a significant decrease in routing RO while enhancing the network’s Quality of Forwarding (QoF) of the network. Also, the simulation of the proposed approach was carried out in NS2, and afterward, compared with earlier proposed methods like DRARP and MDRARP. Based on the simulation results, the HOEPSM outperformed the other methods, with high Energy Efficiency (EE) (91%), Packet Delivery Ratio (PDR) (95%), RO (155), and End to End (E2E delay) (102ms). These results can be attributed to the HOEPSM’s choice of the best and steady route from the source nodes and destination nodes.

ZhuJi,WeiYuandK.J.RayLiu,Fellow, IEEE Abstract—In self-organized mobile ad hoc networks (MANETs) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or honestly revealing its private information, cannot be directly assumed. The pricing mechanism is one way to provide incentives for the users to act cooperatively by awarding some payment for cooperative behaviors. In this paper, we consider efficient routing in self-organized MANETs and model it as multi-stage dynamic pricing games. A game theoretical framework for dynamic pricing-based routing in MANETs is proposed to maximize the sender/receiver’s payoff by considering the dynamic nature of MANETs. Meanwhile, the forwarding incentives of the relay nodes can also be maintained by optimally pricing their packet-forwarding services based on the auction rules and introducing the Cartel Maintenance enforcing mechanism. The simulation results illustrate that the proposed dynamic pricing-based routing approach has significant performance gains over the existing static pricing approaches.

Mobile ad hoc networks (MANETs) routing is a very challenging task because of the dynamic nature of the network. The linking of provisional communication assures based on the infrastructure of MANET, however, there is no centralised monitoring process for making the routing in MANETs in terms of trust and security. Therefore, the stability routing is not considered, which may break easily in dynamic MANETs. Thus, this paper introduces a trust-based secure routing protocol using the proposed atom whale optimisation algorithm (AWOA), which is the trust-aware routing protocol. The developed atom whale optimisation is utilised to select the optimal route with respect to the trust factors, like average encounter rate (AER), and successful cooperation frequency (SCF), integrity factor, and the forwarding rate. Moreover, secure routing is performed between the nodes using the proposed AWOA. The AWOA is the integration of atom search optimisation (ASO), and whale optimisation algorithm (WOA) that inherits the faster global convergence. The fitness function is newly modelled considering mobility, and trust factors. The proposed AWOA outperformed other methods with a minimal end-to-end delay of 0.0083 sec, maximal packet delivery ratio (PDR) of 97.73%, and the maximal throughput of 85.05% respectively.

Cognition capability has been seen by researchers as the way forward for the design of next generation of Mobile Ad Hoc Networks (MANETs). The reason why a cognitive paradigm would be more suited to a MANET is because MANETs are highly dynamic networks. The topology may change very frequently during the operation of a MANET. Traffic patterns in MANETs can vary from time to time depending on the need of the users. The size of a MANET and node density is also very dynamic and may change without any predictable pattern. In a MANET environment, most of these parameters may change very rapidly and keeping track of them manually would be very difficult. Previous studies have shown that the performance of a certain routing approach in MANETs is dependent on the size of the network and node density. The choice of whether to use a reactive or proactive routing approach comes down to the network size parameter. Static or offline approaches to fine tune a MANET to achieve certain performance goals is hence not very productive as a lot of these parameters keep changing during the course of operation of MANETs. Similarly, the performance of MANETs would improve greatly if the MAC layer entity could operate in a more flexible manner. In this paper we propose a cognitive MANET design that will ensure that all these dynamic parameters are automatically monitored and decisions are based on the current status of these parameters.

As the advent of new technologies grows, the deployment of mobile ad hoc networks (MANET) becomes increasingly popular in many application areas. In addition, all the nodes in MANET are battery operated and the node mobility affects the path stability and creates excessive traffic leads to higher utilization of energy, data loss which degrades the performance of routing. So, in this paper we propose Levenberg–Marquardt logistic deep neural learning based energy efficient and load balanced routing (LLDNL-EELBR) which is a machine learning method to deeply analyze the mobile nodes to calculate residual load and energy and it also uses logistic activation function to select the mobile node having higher residual energy and residual load to route the data packet. Experimental evaluations of three methods (LLDNL-EELBR, multipath battery and mobility-aware routing scheme (MBMA-OLSR) and opportunistic routing with gradient forwarding for MANETs (ORGMA)) were done and the result reveals that LLDNL-EELBR method is able to increase the through put and minimizes the delay and energy consumption in MANET when compared to works under consideration.<br /><div> </div>

The system in which wireless device self configure, establish and communicate from one end to the other using wireless channel with no existing fixed network is known as Mobile ad hoc network (MANET). The MANET is another varient of Ad-hoc network, which creates short-lived network using wirelss mobile devices. In ddition to MANET, the behaviour of this kind of temporary networks depends on routing protocols. The large number of routing techniques has been presented in the literature, but it is also been stated that routing is one of the key research issue even till today. This research article examines the performance of nature inspired algorithm such as Petal Ant Routing (PAR) with classical based routing such as Dynamic source routing in MANET. The simulation of both routing is carried using Network Simulator (NS2 version 2.35) and evaluted for different network parameters.

Infrastructure and ad hoc network architectures are the two major architectures that can use wireless networks. Unlike infrastructure architecture using the centralized base station, mobile ad hoc network (MANET) is an infrastructure-less architecture which can be connected without any centralized control. In MANET, a mobile device can be connected with another device within the appropriate radio range that is typically 30 MHz to 5 GHz. Therefore, MANET is considered as a self-organizing network where each node acts as a participant and a router. Sector-based routing is a method in MANET which can be used to separate the positions of every node in a network topology. In addition, a specific node called server node can be assigned among the nodes in each sector. The server node is responsible to reserve the path resources and to maintain the information for its associated nodes and links. The performance of sector-based routing depends on the number of nodes available in the sector. Further, the routing approach in sector-based MANET can be considered in various scenarios using server nodes. Our research in this paper is to evaluate the efficiency of the sector-based routing in MANET considering several scenarios. Further, we address the variation of the performance while the number of nodes changes with several routing methods in sector-based MANET. In this paper, we investigate the detailed simulation experiments on a different number of nodes and various scenarios of sector-based routing in MANET. Our findings are as follows. (1) The average collision rate is significantly lower in sector-based routing when compared to MANET. (2) The resource efficiency in sector-based routing is considerably higher. (3) Unlike in a small number of nodes, the higher number of connections can be allowed in a high number of nodes distributed in a sector.KeywordsMANETSector-based routingServer nodeResource efficiency

The Routing Approaches in Mobile Ad-hoc Network have almost entered the saturated arena. But still there are available options of perfection in this meadow. The task of improving the clustering technique is one of the fields which is under rated as a research topic for further improvement of routing. Clustering based MANET routing protocols, which are popular in terms of efficiency, simplicity and usability mostly use circular based clustering techniques. And the election of cluster head is done through the use conventional approaches. This particular paper is mainly focused to launch a new-fangled clustering technique through which it is possible to improve the routing performance of existing protocols. Another important aspect of this paper is to provide a cluster head selection algorithm which can effectively maintain the clusters and provides more stability. Proposed clustering idea is useful for geographically related nodes effectively in different turf of routing. To maintain the clusters and their stability, it provides a new idea to select cluster head within the cluster, also the election of secondary cluster head for avoiding further election immediately after the unavailability of primary cluster head. This idea is evaluated in network simulator and it outperforms the existing clustering techniques.

Applications of mobile ad hoc networks (MANETs) have gained increasing popularity among different areas of human life and significantly attracted the attention of the researchers in this field. Routing in a MANET plays the vital role in its real-world application. Further, routing in MANET is associated with a set of issues that need to be addressed before its implementation. The issues include satisfaction of specified quality of service (QoS) requirements and security issues. In this paper, we have addressed security issues as our point of focus. Again, security issues can be addressed using various algorithms and out of all, evolutionary technique-based algorithms appear to be more effective for the purpose. Ant colony optimization (ACO) is one of the most popular evolutionary algorithms for optimization. We have carried out an extensive review of ant colony optimization (ACO)-based secure MANET routing protocols and the contents of this paper can help researchers in the field of MANET to devise secure routing protocols, especially using ACO algorithm for addressing the security issues in a MANET.

Mobile ad hoc networks (MANETs) are infrastructureless and distributed communication systems that require sophisticated approaches to routing to cope with node mobility and heterogeneous application requirements. In the past few years, distributed hash table (DHT) has come forth as a useful additional technique to the design and specification of spontaneous and self-organized networks. Researchers have exploited its advantages by implementing it at the network layer and developing scalable routing protocols for MANETs. The implementation of DHT-based routing in a MANET requires different algorithms and specifications compared to routing in the Internet because a MANET has its unique characteristics, such as node mobility, spontaneous networking, decentralized architecture, limited transmission range, dynamic topology, and frequent network partitioning/merging. In this article, we present a comprehensive survey of research related to DHT-based routing that aims at enhancing the scalability of MANETs. We present a vivid taxonomy of DHT-based routing protocols and the guidelines to design such protocols for MANETs. We compare the features, strengths, and weaknesses of existing DHT-based routing protocols and highlight key research challenges that are vital to address. The outcome of the analysis serves as a guide for anyone willing to delve into research on DHT-based routing in MANETs.

Inter-domain routing is an important component to allow interoperation among heterogeneous network domains operated by different organizations. Although inter-domain routing has been well supported in the Internet, there has been relatively little support to the Mobile Ad Hoc Networks (MANETs) space. In MANETs, the inter-domain routing problem is challenged by: (1) dynamic network topology due to mobility, and (2) diverse intra-domain ad hoc routing protocols. In this paper, we discuss how to enable inter-domain routing among MANETs, and to handle the dynamic nature of MANETs. We first present the design challenges for inter-domain routing in MANETs, and then propose a framework for inter-domain routing in MANETs.

In this paper, we address the problem of multicast routing in mobile ad-hoc networks from the viewpoint of energy efficiency. In an ad-hoc wireless network, each node runs on a local energy source which has a limited energy life span. Thus, energy conservation is a critical issue in mobile ad-hoc networks. One approach for energy conservation is to establish routes that require lowest total energy consumption. This optimization problem is referred as the minimum-energy multicast routing problem (MEMRP). In this paper, propose new efficient heuristic algorithms for the construction of energy-efficient multicast routes in mobile ad-hoc networks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy-efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEMRP.

Due to the high mobility of nodes in the dynamic topology of Mobile Ad Hoc Networks (MANETs), it is challenging to define the precise position of a node in the network for effective data delivery. The paperproposed a hybrid algorithm for routing in MANETs called Adaptive GPSR with Dynamic Thresholds (AGDT). AGDT is a novel approach that combines the GPSR routing protocol with a dynamic threshold-based approach to increase the enactment of the network. The algorithm employs distance and direction-based thresholds to determine when to switch between GPSR and a perimeter-based approach for routing. The paper discusses the implementation of the algorithm and provides a performance evaluation of its effectiveness in comparison to other present routing algorithms. The results show that AGDT outperforms other protocols in terms of packet delivery ratio, end-to-end delay, and throughput. The paper concludes by highlighting the potential applications and benefits of the AGDT algorithm in MANETs.

Many existing studies just considered that nodes in a Mobile Ad Hoc NETwork (MANET) would fully cooperate to forward packets for one another. However, this assumption does not hold in many scenarios. The node selfishness in relay cooperation will certainly influence the overall performance of routing in MANETs. In this work, we investigate the energy-aware routing problem in MANETs with nodes' selfishness. We model the situation of node cooperation in energy-aware routing by using game theory. We consider the competitive and cooperative relationship between the nodes to formulate the game for MANETs. An incentive mechanism is given in order to encourage forwarding cooperation during energy-aware routing. Nodes are encouraged to forward more data packets for others in order to acquire more services from others. We also carry out a simulation for the proposed method and perform detailed analysis in this work. From the results of the simulation, we argue that it's possible to find out a suitable configuration for a MANET to support more efficient energy-aware routing through our method.

Emergent Intelligence Based QoS Routing in MANET