Ant routing, searching and topology estimation algorithms for ad hoc netwoks

by Santpal Singh Dhillon

Publisher: IOS Press in Amsterdam

Written in English
Published: Pages: 150 Downloads: 615
Share This

Subjects:

  • Ad hoc networks (Computer networks) -- Programming,
  • Electric network topology,
  • Computer algorithms

Edition Notes

Statementdoor Santpal Singh Dhillon.
Classifications
LC ClassificationsTK5105.77 .D46 2008
The Physical Object
Paginationxii, 150 p. :
Number of Pages150
ID Numbers
Open LibraryOL23931380M
ISBN 101586039016
ISBN 109781586039011
LC Control Number2009417186

Simulation-based Analysis of Topology Control Algorithms for WAHNs 5 The rst topology that we consider is the topology one gets when every sender uses the maximum transmission power and when all possible communi-cation links are used. We call this topology All-Links-Graph (ALG). Of course, all other topologies are a subset of the ALG topology. by ant systems. The proposed routing protocol in [2] uses a new metric to find the route with higher transmission rate, less latency and better stability. akshmi. [4] proposed a new on demand QoS routing algorithm based on ant colony metaheuristic. An algorithm of ant colony optimization for mobile ad hoc networks has been.   In this paper, we propose a novel routing discovering algorithm (RACO) based on Ant colony optimization. It is to solve the limitation of ACO by using the characteristics of Ad Hoc networks and. A survey on the routing protocols based on ant-like mobile agents is given. These protocols are often employed in Mobile Ad Hoc Networks (MANET). Mobile Ad Hoc Networks are collections of wireless mobile nodes such as PDAs, laptop computers, and cellular phones having wireless communication capability that dynamically form a temporary network without using any Cited by:

The ad hoc network is observed in such circumstances. However, conventional routing algorithms that keep the optimum routing is difficult to perform flexible routing in dynamic topology network, such as the ad hoc net-work. This paper proposes Ants-Routing with routing history(ARH) and Ants-Routing with routing history. an on demand ad-hoc routing algorithm is proposed. The foraging behavior of Ant colony optimization and Bee colony optimization, which are the subset of swarm intelligence and considering the ability of simple ants to solve complex problems by cooperation. Several algorithms which are based on ant colony problems were introduced in the. Analysis of Scheduling and Topology-Control Algorithms for Wireless Ad Hoc Networks Diploma Thesis of Fabian Fuchs At the faculty of Computer Science Institute for Theoretical Informatics (ITI) Reviewer: Prof. Dr. Dorothea Wagner Advisor: Dipl.-Inform. Markus Völker October – March Mobile Ad Hoc Network Topology and its Algorithms Anto Ramya. S. I, Assistant Professor, Department of Computer Science, St. Joseph’s College of Arts and Science for Women, Hosur – , Tamil Nadu, India. Abstract – A Mobile Ad hoc Network (MANET) is an autonomous system of mobile nodes connected by wireless Size: KB.

Performance Evaluation of Ant-Performance Evaluation of AntBased Routing Protocols for Based Routing Protocols for Wireless Sensor Networks Wireless Sensor Networks Adamu Murtala Zungeru 1, Li -Minn Ang 2 and Kah Phooi Seng 3, 1School of Electrical and Electronics Engineering, University of Nottingham, Jalan Broga, Semenyih, Selangor Darul Ehsan, Cited by: 8.   One of the most important components of control system is routing. Routing refers to the distributed activity of building and using routing tables. Routing table is a common component of all routing algorithms. It is used to hold information to make the local forwarding decisions. One routing table is maintained by each node in the network/5(10). It is imperative to address the issue of secure routing in mobile ad-hoc networks (MANETs) where the nodes seek for cooperative and trusted behaviour from the peer nodes in the absence of well-established infrastructure and centralized authority. Due to the inherent absence of security considerations in the traditional ad-hoc routing protocols, providing security and reliability in the routing Cited by: 2. ACO algorithms in routing problems. This paper is intended to serve as an exhaustive guide to all possible and available literature that applying ACO algorithms to solve routing problems, see Figure 1. Figure 1. Ant colony optimization algorithms for routing problems A. Ant-Based Control Algorithm.

Ant routing, searching and topology estimation algorithms for ad hoc netwoks by Santpal Singh Dhillon Download PDF EPUB FB2

Ad hoc networks are self-configuring, self-organizing networks that are formed on the fly. This book studies the performance of a dynamic, self-adaptive routing paradigm known as 'ant routing'; analyzing the behavior of searching and how it performs on graph topologies.

Developing novel algorithms and protocols and analyzing their performance is Ant routing for the development of next generation networks. In Ant Routing, Searching and Topology Estimation Algorithms for Ad Hoc Networks the aim is to analyze the performance of dynamic routing and searching algorithms.

We propose a new routing algorithm based on ant colony optimization for MANETs with global positioning system (GPS) and heuristic methods. In mobile ad hoc networks, every node in different positions has different probabilities to forward the ant to the next hop, so as to greatly reduce the overhead of the packets used for maintaining the Author: Wang Anbao, Zhu Bin.

We are propose the ant routing algorithm for Mobile Ad-hoc networks (ARAMA), which is a biological based routing algorithm. This algorithm is inspired from the ant colonies' life. In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks.

Due to the ever changing topology and limited bandwidth it is very hard to establish and maintain good routes in such networks. Especially reliability and e–ciency are impor.

] is a routing algorithm for both vehicle to vehicle (V2V) and vehicle to infrastructure (V2I) communications in VANETs. MEDAL takes advantage of both the moving directions of vehicles and the destination location to select a neighbor vehicle as the next hop for forwarding Size: 1MB.

the interaction of a multitude of simultaneously interacting agents. A survey of few such algorithms for ad hoc networks is presented here.

Keywords: ad-hoc networks, swarm intelligence. GJCST-E Classification: C Ant-Based Routing Schemes for Mobile Ad Hoc Networks. Strictly as per the compliance and regulations of. requirement. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MANETs.

In this paper, a new QoS algorithm for mobile ad hoc network has been proposed. The proposed algorithm combines the idea of Ant Colony Optimization (ACO) with. Ants-Based Routing in Mobile Ad-Hoc Networks Diplomarbeit der Philosophisch-naturwissenschaftlichen Fakultät der Universität Bern vorgelegt von: David Jörg Leiter der Arbeit: Prof.

Torsten Braun Forschungsgruppe Rechnernetze und Verteilte Systeme (RVS) Institut für Informatik Ant routing angewandte Mathematik.

POSITION BASED ROUTING ALGORITHMS FOR AD HOC NETWORKS: A TAXONOMY Silvia Giordano [email protected] ICA-DSC-EPFL CH Lausanne (Switzerland), Ivan Stojmenovic [email protected] SITE, University of. and we evaluate the performance of the AntHocNet routing algorithm in these scenarios compared to AODV [29], a state-of-the-art MANET algorithm.

2 Routing in mobile ad hoc networks The task of routing is particularly hard in MANETs. Due to the ad hoc and dy-namic nature of these networks, the topology can change continuously, and pathsCited by: Proposal on Multi agent Ants based Routing Algorithm for Mobile Ad-Hoc Networks are free to move, thus the network topology may change dynamically.

Therefore, routing protocols must be able However the ant-based algorithms in wireless ad hoc networks have certain drawbacks. In that the nodes depend solely on the ant. central administration. Mobile ad-hoc networks are suitable for temporary communication links.

One of the major issues in MANET is routing due to the mobility of the nodes. Routing means the act of moving information across an internet work from a source to a destination.

The Enhanced Ant Routing Algorithm (EARA) is based on ant algorithms. The main challenge in ad hoc networks is routing. Due to the mobility of the nodes in the ad hoc networks, routing becomes very difficult. Ant based algorithms are suitable for routing in ad hoc networks due to its dynamic nature and adaptive by: 1.

In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and maintain good routes in such networks.

Especially reliability and efficiency are important concerns. AntHocNet is based on ideas from Ant Colony by: Source Routing (DSR) Protocol approach to solve routing problem. Simulation results are carried out for both algorithms using MATLAB. The results affirmed the potential of the proposed genetic algorithm.

Keywords - Ad-Hoc Network, DSR, Genetic Algorithm, Routing Protocols, Optimal Routing. In this paper we propose a new reactive routing algorithm for mobile ad hoc networks, called POSANT (Position based Ant Colony Routing Algorithm), which combines the idea of ant colony.

We study the performance of ant routing for static and dynamic network topologies. We also compare the per-formance of ant routing with AODV and DSR for ad hoc networks. The simulations show that the ant routing al-gorithm performs well for static topologies. However, the routing overhead in ant routing is more than AODV and DSR.

Therefore, mobile ad-hoc networks are suitable for temporary communication links. This flexibility, however, comes at a price: communication is difficult to organize due to frequent topology changes.

The Ant-Colony-Based Routing Algorithm Cited by: This approach belongs to the class of routing algorithms inspired by the behavior of the ant colonies in locating and storing food.

The effectiveness of the heuristic algorithm is supported by mathematical proofs and demonstrated by a comparison with the well-known Ad hoc On Demand Distance Vector (AODV) by: HOPNET: The hybrid ant colony optimization routing algorithm for mobile ad hoc networks [14] is a hybrid routing algorithm based on ants hopping from one area to another.

The algorithm has. routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence. Ant colony algorithms are a subset of swarm intelligence and consider the ability of simple ants to solve complex problems by cooperation.

The introduced routing protocol is well adaptive, efficient and scalable. In this paper, we introduce the Ant-Based Topology Control (ABTC) algorithm that adapts the biological metaphor of Swarm Intelligence to control topology of mobile ad hoc networks.

ARA-The ant-colony based routing algorithms: Gunes et al. present a novel technique for ad hoc routing by using concepts of swarm intelligence and the ant colony meta-heuristic. This class of algorithms aims to solve the complex optimization and collaboration problems without direct communication among the by: ARA (ant colony based routing algorithm) proposed by Gunes et al.

is one of the first ACO algorithms for finding routes in mobile ad hoc networks. It is a reactive algorithm which consists of three phases: route discovery, route maintenance and route failure by: In this paper we study the performance of ant colony based routing algorithms in mobile ad hoc networks (MANETs) and present SAMP-DSR, a new algorithm to address the shortcomings of both ant colony based as well as the traditional DSR algorithms.

Due to the unstable nature of MANETs memory based search algorithms such as ant based. Fig. 1 shows a wireless Ad-Hoc network, which is a decentralized network where each node (end-user node) is able to forward data packets for other nodes. The main objective of an Ad-Hoc network is to maintain the node’s connectivity and reliably transport the data packets.

In addition, each node dynamically determines its next hop based on the network by: The improved ant colony optimization routing algorithm for mobile ad hoc networks (PACONET) [9] is a reactive routing protocol where the forward ants explore the paths in.

For the problem of poor link reliability caused by high-speed dynamic changes and congestion owing to low network bandwidth in ad hoc networks, an ant colony routing algorithm, based on reliable path under dual-channel condition (DSAR), is proposed.

First, dual-channel communication mode is used to improve network bandwidth, and a hierarchical network model Cited by: 3.

topology is changed in Ad hoc Networks. Existing routes may fail or new paths are generated. Ant Routing Algorithm Ant routing algorithm for mobile Ad hoc networks (ARAMA) is proposed. It solves the routing problem in MANET and it is a dynamic routing algorithm with controlled overheads in the network.

Ant Based Ad hoc Routing Protocols. Abstract—Mobile Ad hoc networks (MANET) are communication networks that consist of wireless nodes, which placed together in an ad hoc manner. Nodes can enter or leave the network at any time, so that the network topology changes frequently. In this paper we are going to propose an algorithm for routing in mobile ad hoc networks.

Mobile ad hoc networks (MANETs) consist of a set of nodes which can move freely and communicate with each other wirelessly. Due to the movement of nodes and unlike wired networks, the available routes used among the nodes for transmitting data packets are not stable.

Hence, proposing real-time routing protocols for MANETs is regarded as one of the Cited by: ad-hoc networks. We will discuss various reasons by considering important properties of mobile ad-hoc networks. Dynamic topology:This property is responsible for the bad performance of several routing algorithms in mobile multi-hop ad-hoc networks.

The ant colony optimization meta-heuristic is based on agent systems and works with individual ants.