Home            Contact us            FAQs
    
      Journal Home      |      Aim & Scope     |     Author(s) Information      |      Editorial Board      |      MSP Download Statistics

     Research Journal of Applied Sciences, Engineering and Technology


An Efficient Multi-criteria Routing Algorithm using Ant Colony with Colored Pheromones in Wireless Sensor Networks

1Fatemeh Rismanian, 2Behrang Masoodifar, 3Manaf Sharifzadeh and 4Somayyeh Sheikhnia
1Department of Computer, Science and Research Branch, Islamic Azad University, Tabriz
2Department of Computer, Damavand Branch, Islamic Azad University
3Department of Computer, Firoozkooh Branch, Islamic Azad University
4Department of Computer, Iran University of Science and Technology, Tehran, Iran
Research Journal of Applied Sciences, Engineering and Technology  2013  7:1147-1152
http://dx.doi.org/10.19026/rjaset.6.3924  |  © The Author(s) 2013
Received: May 08, 2012  |  Accepted: July 09, 2012  |  Published: July 05, 2013

Abstract

Considering the features of non-uniformly distributed traffic load and possibly existing of the traffics requiring different performance in wireless sensor networks, this study proposes , a novel routing protocol based on an improved Ant colony optimization routing algorithm. The algorithm concentrates on the provision of Quality of Service in multi-criteria routing algorithm such as hop count, energy consumption, resident power, bandwidth and end to end delay. These metrics are used by means of colored pheromones of the ant colony system. There are different ants with colored pheromones, which each color is for a level of service. Simulation experiments show that the proposed algorithm has many advantages comparing with existing algorithm: proposing different service classes such as Real time and Best effort traffic; achieve slower delay and longer lifetime; besides, the proposed method behaves more scalable and robust.

Keywords:

Ant Colony Optimization (ACO), Colored Pheromone, Quality of Service (QoS), Routing, Wireless sensor networks,


References


Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.

ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Information
   Sales & Services
Home   |  Contact us   |  About us   |  Privacy Policy
Copyright © 2024. MAXWELL Scientific Publication Corp., All rights reserved