News

citefactor-journal-indexing

Shortest Path Routing Algorithm Using Ant Colony Optimization in MANETS

A mobile ad-hoc network (MANET) is formed by a cluster of mobile hosts, each installed with a wireless transceiver, without the assistance of base stations. Various Clustering algorithms have been proposed to partition the network into small and manageable clusters and hence provide efficient resource management which enhances network performance. Ant Colony Optimization (ACO) is inspired by the foraging behaviour of real ant. ACO is meant to find optimal and shortest routing solution for many difficult problems such as Travelling salesman problem, Graph colouring problem... etc. In this paper, a new approach of clustering has been introduced based on ACO. This approach leads to formation of clusters which partition the network into number of non overlapping clusters. An algorithm based on ACO for the selection of Cluster Head and Gateway node is also proposed.



Real Time Impact Factor: Pending

Author Name:

URL: View PDF

Keywords: MANET

ISSN: 2394-6598

EISSN:


EOI/DOI:


Add Citation Views: 1














Search


Advance Search

Get Eoi for your journal/conference/thesis paper.

Note: Get EOI for Journal/Conference/ Thesis paper.
(contact: eoi@citefactor.org).

citefactor-paper-indexing

Share With Us












Directory Indexing of International Research Journals