Mobile Ad Hoc Networks (MANETs) is a self-configurable network of mobile nodes connected by wireless links to form an arbitrary topology and communicate to each other without the use of existing infrastructure. Complexities of routing between the nodes are increasing due to the highly dynamic nature of the mobile ad hoc network results in frequent change in network topology. The routing protoco...

A swarm of unmanned aerial vehicles (UAVs) requires the transmission mission-related data across network. The resource constraints and dynamic nature bring critical challenges to design UAV routing protocols. Most conventional ad hoc schemes are not intelligent cannot adapt swarming networks. On other hand, some artificial intelligence (AI)-based may consume significant computational resources ...

This paper presents the rst dynamic routing scheme for high-speed networks. The scheme is based on a hierarchical bubbles partition of the underlying communication graph. Dynamic routing schemes are ranked by their adaptability, i.e., the maximum number of sites to be updated upon a topology change. An advantage of our scheme is that it implies small number of updates upon a topology change. In...

Mobile Ad-hoc Networks (MANET) are consisting of nodes that have limited battery power so the energy efficiency is one of the primary metrics of interest. Energy efficient routing is a major issue in MANET. This paper proposed an Energy efficient power aware multipath dynamic source routing protocol by modifying one of the most popular routing protocols that is Dynamic Source Routing (DSR) prot...

Routing strategy is one of the most important aspects in a mobile agent system, which is a complex combinatorial problem. Most of current mobile agent systems adopt static routing strategies, which don’t consider dynamic network status and host status. This is a hinder to the performance and autonomy of mobile agents. Ant Algorithm is good at solving such kind of problems. After analyzing exist...

Routing plays an important role in various types of networks. There are two main ways to route the packets, i.e., unicast and multicast. In most cases, the unicast routing problem is to find the shortest path between two nodes in the network and the multicast routing problem is to find an optimal tree spanning the source and all the destinations. In recent years, both the shortest path routing ...

This paper considers the problem of dynamic traffic assignment under the principle that individual drivers will choose fastest paths, in the dynamic situation where path durations consist of time-dependent link travel times. Rather than constructing a unified model encompassing traffic dynamics and route choice, we decompose the model into an assignment mapping, which identifies the link travel...

In Vehicular ad hoc networks (VANET), a host may exhaust its power or move away without giving any notice to its cooperative nodes, causing changes in network topology, and thus, these changes may significantly degrade the performance of a routing protocol. Several routing protocol studies based on node lifetime and link lifetime have been done to address this problem. We propose a new algorith...

In this paper, a routing protocol which utilizes the characteristics of Bluetooth technology is proposed for Bluetooth-based mobile ad hoc networks. The routing tables are maintained in the master devices and the routing zone radius for each table is adjusted dynamically by using evolving fuzzy neural networks. Observing there exists some useless routing packets which are helpless to build the ...