Resolving Dynamic Shortest Path Routing Problems in Mobile Adhoc Networks Using ABC And ACO

Abstract

Mobile Ad Hoc Network (MANET) is a dynamic multihop wireless network which is self organized and self managed network. MANET is decentralized by a collection of mobile nodes. The major problem in MANET is fast changing nature due to the random movement of the nodes. Routing is the process of moving information across the network from a source to a destination. Routing is challenging in this type of networks due to the mobility of nodes, energy and limited resources etc. This type of networks has difficult to find a path between the communicating nodes. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms and Artificial Bee Colony (ABC)  algorithm have shown to be a good technique for identifying multiple stable paths between source and destination nodes. The Ant Colony Optimization (ACO) algorithm is proposed for finding dynamic shortest path and also avoiding the convergence to a locally optimal solution. The Artificial Bee Colony (ABC) algorithm is proposed for finding the dynamic shortest path with best parameter vector which minimizes an objective function.

Authors and Affiliations

R. Sivakumar

Keywords

Related Articles

 IP Anycast Architecture

 This paper illustrates the methodology and architecture for network addressing and routing in which datagram packets routed through mathematical topological nearest node in a cluster of potential receivers that a...

Sharing Channel In IEEE 802.16 Using The Cooperative Model Of Slotted ALOHA

One of the main problems in WIMAX is to share the medium by multiple users who compete for access. Various random access mechanisms, such as ALOHA and its corresponding variations have been widely studied as efficient me...

 Analysis of Brain Cancer and Nervous Cancer Population with Age and Brain Cancer Type in North America

 This paper discuss about statistical representation of Brain Cancer in America. Brain cancer morbidity is high and treatment plans like chemotherapy, surgical resection of Tumor, Hyperthermia and Radio Surgery is k...

Table Detection and Extraction from Image Document

Tables make information easier to understand and perceive than regular text block. Now days, it  becomes popular structure for information representation. Format of tables differs and change according to need of rep...

FPGA based implementation of Interoperability of Wireless mesh Network and Wi-Fi

Wireless Mesh Networks (WMNs) is a key technology for next generation wireless networks, showing rapid progress and many new inspiring applications. IEEE 802.11s is the standard defined for WLAN mesh networks.One importa...

Download PDF file
  • EP ID EP157261
  • DOI -
  • Views 107
  • Downloads 0

How To Cite

R. Sivakumar (2013). Resolving Dynamic Shortest Path Routing Problems in Mobile Adhoc Networks Using ABC And ACO. International Journal of Computer & organization Trends(IJCOT), 3(3), 65-69. https://europub.co.uk/articles/-A-157261