Ant Routing Protocol Research Articles

Tripartite Transmitting Methodology for Intermittently Connected Mobile Network (ICMN)

Mobile network is a collection of devices with dynamic behavior where devices keep moving, which may lead to the network track to be connected or disconnected. This type of network is called Intermittently Connected Mobile Network (ICMN) . The ICMN network is designed by splitting the region into `n' regions, ensuring it is a disconnected network. This network holds the same topological structure with mobile devices in it. This type of network routing is a challenging task. Though research keeps deriving techniques to achieve efficient routing in ICMN such as Epidemic, Flooding, Spray, copy case, Probabilistic, and Wait, these derived techniques for routing in ICMN are wise with higher packet delivery ratio, minimum latency, lesser overhead, and so on. A new routing schedule has been enacted comprising three optimization techniques such as Privacy-Preserving Ant Routing Protocol (PPARP), Privacy-Preserving Routing Protocol (PPRP), and Privacy-Preserving Bee Routing Protocol (PPBRP) . In this paper, the enacted technique gives an optimal result following various network characteristics. Algorithms embedded with productive routing provide maximum security. Results are pointed out by analysis taken from spreading false devices into the network and its effectiveness at worst case. This paper also aids with the comparative results of enacted algorithms for secure routing in ICMN.

AI-Enabled Ant-Routing Protocol to Secure Communication in Flying Networks

Artificial intelligence has recently been used in FANET-based routing strategies for decision-making, which is a unique paradigm. For effective communication in flying vehicles that use routing protocols to accomplish tasks collectively, aerial vehicles are used in both civic and military applications. Aerial ad hoc networks are wirelessly connected, and designing routing schemes is difficult due to the rapid mobility. Ground base stations and satellites are frequently used to interconnect UAV ad hoc networks. This paper developed a novel routing protocol with a focus on ant behavior routing, which assists in end-to-end security. For the first time in flying networks, the column mobility model is used to evaluate the performance of routing protocols. While merging with aerial ad hoc networks, AI-based networking is a relatively new field. In simulation results, AntHocNet shows better results in comparison with other contemporary routing algorithms. Pheromone update process is used for data encryption in AntHocNet. This research study is performed on network simulator-2.

Pheromone Incentivized Intelligent Multipath Traffic Scheduling Approach for LEO Satellite Networks

Low Earth Orbit (LEO) satellite networking has been an indispensable and promising concept for extending the Internet coverage of future space-air-ground integrated networks to oceanic and remote airspace. However, the topology dynamics of the LEO Satellite Network (LEO-SN) for network state perception (Li <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> , 2019) and the intermittent nature of the Inter-Satellite Links (ISLs) for multipath routing discovery (Wang <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> , 2019, Jiang <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> , 2019) both induce new complicated challenges to multipath traffic scheduling for the sake of improving the utility of the LEO-SN facility (Song <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> , 2014, Zhang <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> , 2018, and Yang <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> , 2020). Motivated by these challenges, this paper aims to develop an AI aided intelligent multipath traffic scheduling approach for bolstering autonomous and efficient communications of LEO-SN. To achieve this, we formulate the multipath traffic scheduling problem into a pheromone incentivized Markov Decision Process (MDP) by considering ant routing protocol and adapting pheromone to LEO-SN. Employing enhanced pheromone characterizing network state, we propose ant-inspired multipath routing discovery, which is capable of promptly discovering routing paths available in the dynamic topology. To improve the utility of these discovered routing paths, we employ deep deterministic policy gradient into the pheromone-incentivized MDP-based scheduling problem to derive an intelligent multipath traffic scheduling strategy. The experimental results are further presented to show the achievable performance improvement.

Ai Enabled Ant-Routing Protocol to Secure Communication in Flying Networks

Ai Enabled Ant-Routing Protocol to Secure Communication in Flying Networks

Towards a Formal Validation of a Hybrid Multi-Agent Routing Protocol for Ad hoc Networks

In the authors' previous papers, a new ant routing protocol for ad-hoc networks inspired from ant colony optimization was presented. They introduced a new approach that decreases both node energy consumption and routing overhead within the network. The validation of the routing protocol was based on series of simulations. The results show that the new algorithm provides a significant improvement compared to other protocols. After the algorithm is defined and published, they found it important to validate formally each one of its components in order to avoid any conflict, lack, or misbehaving situations. This process requires in a first step a formal specification. This is the main concern in this paper where the authors propose in a first part a formal specification using inference systems based on logical rules. A formal validation using these inference systems is proposed in a second step in order to prove the correctness, the soundness, the completeness, and the optimality of the proposition.

An Efficient Secure Routing for Intermittently Connected Mobile Networks

A disunited mobile network which lacks of intact affinity as a result of packed network is intermittently connected mobile networks (ICMN). Routing becomes insecure here. High migration of the nodes in the nexus is the reason behind its packed lineament. Detection of the fishy nodes in the network is little tough because of its disunited idiosyncrasy. A secure routing that paves way in detecting and freezing invasion of fishy nodes has been launched in this paper. Ant Colony Optimization (ACO) makes the routing process compatible. Secure communication in the network is made possible by certain authentication series as ICMN is known for its higher delays. A peculiar routing protocol called Privacy Preserving Ant Routing Protocol (PPARP) which is a fusion of ACO with authentication series promises us an expected security. Fishy nodes in the network aids to examine the security grade which proves PPARP as the best.

Ant Routing Protocol with Location Services in Intermittently Connected MANETs

Wireless and mobile networks seem to deliver tremendous uses. In its way, MANET leads to enormous real world applications. Routing allows us to implement many real world applications. Complete affinity in an infrequent network like ICMANET is highly impossible. Disconnected MANET is also known as ICMANET which is also a DTN (Delay Torrent Network) that supports for higher delays. It is laborious process to execute routing in a diffused network process to execute routing in a diffused network. To deliver the data packets towards the destined node to its best, a new strategy in routing called Ant routing protocol in concoction with storage strategy LoDis has been proposed. Despite of routing, security is still an unsolved problem. To evaluate this situation, this paper presents a methodology called agent technology which yields a secure routing. Hostile node in the network is spotted with the help of agent at each node. A cryptographic algorithm Advanced Encryption Standard (AES) is habituated to improve secure communication in wide range Mobility and total number of nodes in the network act as variables in examining the hostile nodes in the network to judge the standard of security. Improved performance along with the security is the point to be highlighted.

ACO-based biology inspired routing protocol for ad hoc networks

The task of routing packets is hard in ad hoc networks because there is no central control over the network elements. In any network, the data packets have to be routed to the destination with minimum data loss, minimum delay and maximum packet delivery ratio. Therefore, there must be an efficient algorithm which satisfies all these qualities of service requirements. In this paper, we propose a biology-inspired ant routing protocol based on ant colony optimisation (ACO) called as optimised AntNet with location awareness functionality (OANTLOC). In this technique, the distance between the current node and neighbouring node is calculated using the range difference technique to transmit the packets, hence overcomes the drawbacks of AntNet algorithm which considers only cumulative probability for packet transmission. Our proposed algorithm also outperforms primitives reactive routing protocols in terms of the average end to end delay, average throughput, packet delivery ratio and route cost.

Component based ant routing protocols analysis over mobile ad hoc networks

To deeply exploit the mechanisms of ant colony optimization (ACO) applied to develop routing in mobile ad hoc networks (MANETS), some existing representative ant colony routing protocols were analyzed and compared. The analysis results show that every routing protocol has its own characteristics and competitive environment. No routing protocol is better than others in all aspects. Therefore, based on no free lunch theory, ant routing protocols were decomposed into three key components: route discovery, route maintenance (including route refreshing and route failure handling) and data forwarding. Moreover, component based ant routing protocol (CBAR) was proposed. For purpose of analysis, it only maintained basic ant routing process, and it was simple and efficient with a low overhead. Subsequently, different mechanisms used in every component and their effect on performance were analyzed and tested by simulations. Finally, future research strategies and trends were also summarized.

New approach for routing in mobile ad‐hoc networks based on ant colony optimisation with global positioning system

The field of mobile ad-hoc networks (MANETs) has gained an important part of the interest of researchers and become very popular in past few years. MANETs can be used to set up a temporary mean of communication by having nodes behave as hosts and routers, with packets hopping between nodes to reach the destination node. This makes MANET suitable for rapid deployment, but because of the dynamic changes in network configurations, quickly finding the optimum route is difficult. In this study, the authors propose a biology-inspired ant routing protocol based on ant colony optimisation called as optimised antnet global positioning system, which is based on GPS and mobile software agents modelled on ants for routing in ad-hoc networks. The authors compare the performance of the authors protocol with Antnet, ad-hoc on-demand distance vector, Dynamic Source Routing (DSR) and Ad-hoc On Demand Multipath Distance Vector (AOMDV) protocols with respect to end-to-end delay, average throughput, packet delivery ratio and route cost.

Computation of Pheromone Values in AntNet Algorithm

In this paper, we discuss the basic routing technique of ants and study the change in pheromone values at each node. Also the optimal paths can then be computed based on the shortest cumulative pheromone count between source and destination nodes. AntNet is a distributed multi-agent system inspired by the stigmergy model of communication observed in ant colonies. The ants or control packets collect information about the network conditions and are used to update and maintain the routing tables. Ants based routing is gaining more popularity because of its adaptive and dynamic nature. A number of Swarm Intelligence based, more specially Ant Colony Optimization (ACO) based routing algorithms are proposed by researchers. A version of ant routing protocol called AntNet has been implemented to work within the network simulator ns-2. Routing tables and Pheromone tables have been computed for each node in the network. On the basis of these tables we have tried to compute the shortest and most optimal path between source node and destination node.