The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Mobile ad hoc networks do not have any fixed topology. Routing in such network is very challenging and difficult due to the mobility of the nodes. Ant colony optimization is an efficient optimization technique used to find the optimum shortest route in the adhoc network. This paper describes a new routing algorithm for MANETs using Ant Colony Optimization technique. Special attention has been given...
This paper presents a new adaptive and dynamic routing algorithm called AAODV for mobile ad hoc networks inspired by Ant Colony Optimization algorithms. This algorithm is proposed by maintaining the nature of the Ad hoc On-demand Distance Vector (AODV) routing through the use of Ant Colony Optimization. AAODV maintains the on-demand nature of AODV but works in an adaptive manner. It does not send...
An ant-based routing algorithm is a class of ant colony optimization algorithms which are inspired by the behavior of ants in nature. An efficient ant-based routing algorithm (EAR) for mobile ad-hoc networks has been proposed in order to support multi-path routes and to reduce overheads by managing ants efficiently. In this paper, the performances of EAR and AntHocNet are analyzed to see how these...
Quality of service support for MANETs is a challenging task due to dynamic topology and limited resources. The main purpose of QoS routing is to find a feasible path that has sufficient resources to satisfy the constraints. In this paper a novel QoS routing algorithm based on ant colony optimization is proposed. The proposed algorithm uses Ant-like agents to discover and maintain paths, that satisfy...
Because of restricted resources, wireless sensor networks need to consider synthetically the price of networks, and costs of communication and computing and so on. Aiming at the localization problem for mobile beacon node in wireless sensor network, this paper uses the ant colony algorithmpsilas characteristics which is self-organized, adaptive, dynamic optimization, integrating the hop number into...
Mobile ad-hoc networks are infrastructure-less networks consisting of wireless, possibly mobile nodes which are organized in peer-to-peer and autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenging one. Recently a new family of algorithms emerged inspired by Swarm Intelligence, which provides a novel approach to...
Supporting multimedia for Mobile ad hoc networks (MANETs) is an important issue. This paper presents two routing algorithms in MANETs inspired by the ant colony optimization routing algorithms. The first algorithm is a Hybrid Multi-Ant (HMAnt) routing algorithm. It is a hybrid since it combines reactive path establishment with proactive path maintenance. It supports multi-path while maintaining an...
Routing, the act of moving information across an Internet work from a source to a destination is one of the major issues in computer network literature. When it comes to mobile ad hoc network, the complexity increases due to various characteristics like dynamic topology, absence of centralized authority, time varying QoS requirements etc. The biggest challenge in this kind of networks is to find a...
One particular challenging environment for multicast is a mobile ad-hoc network (MANET). Existing studies show that tree-based and mesh based on-demand protocols are not necessarily the best choice, since associated overhead will be more. Several algorithms based on the ant colony optimization (ACO) approach minimizes the cost of the tree under multiple constraints. These algorithms treat the traffic...
The goal of this work is to design a new adaptive routing technique for ad hoc wireless networks. This paper proposed the basic deign of the algorithm that works based on the principle of ant colony optimization (ACO). This is a probabilistic adaptive technique that changes its routes with the change of network topology over the period of time by learning its environment. It identifies appropriate...
Designing efficient, cost-effective routing solutions for the infrastructure-less MANETs remains a daunting task till date. A proven optimization technique, the Ant colony optimization has been used in this paper to find the optimum in terms of the shortest route in a MANET. Special attention has been given to the load balancing and congestion control in the network. The simulated performance graphs...
Recent development has a tremendous growth in the ad-hoc wireless networks. Ad-hoc wireless networks are dynamic topology networks organized by a collection of mobile nodes that utilize multi-hop radio relaying and are capable of operating without the support of any fixed infrastructure. Ad-hoc wireless networks are very useful in emergency operations, collaborative and distributed computing and military...
The infrastructure less and the dynamic nature of mobile ad hoc networks (MANET) demands new set of networking strategies to be implemented in order to provide efficient end-to-end communication. These, along with the diverse application of these networks in many different scenarios such as battlefield and disaster recovery, have seen MANETs being researched by many different organizations and institutes...
In this paper, we propose multimedia-enabled improved adaptive routing (M-IAR) that is optimized for single-source-to- single-destination multimedia sensory data traffic. It is an extension of the improved adaptive routing (IAR) algorithm presented in our earlier work, in response to the increasing number of applications incorporating wireless multimedia sensors such as wireless microphones and cameras...
At present, some ACO-based routing algorithms have been advised in mobile ad hoc networks. This paper proposes an on-demand routing algorithm named ADAA for mobile ad hoc networks. This algorithm establishes multi-path routing between a source node and its destination node and improves the packet delivery performance greatly. The simulation results show that the algorithm performs more effectively...
QoS routing has received significant attention from recent literature while developing on-demand routing algorithms in ad hoc networks due to the fact that the dynamic topology changes and geographic coverage of such algorithms poses technical challenges. Swarm intelligence couples complex behaviors that arise from simple interactions. Drawing the analogy from the ant's pheromone trail- laying-and-...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.