Energy efficiency performance improvements for ant-based routing algorithm in wireless sensor networks

Adamu Murtala Zungeru, Kah Phooi Seng, Li Minn Ang, Wai Chong Chia

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

The main problem for event gathering in wireless sensor networks (WSNs) is the restricted communication range for each node. Due to the restricted communication range and high network density, event forwarding in WSNs is very challenging and requires multihop data forwarding. Currently, the energy-efficient ant based routing (EEABR) algorithm, based on the ant colony optimization (ACO) metaheuristic, is one of the state-of-the-art energy-aware routing protocols. In this paper, we propose three improvements to the EEABR algorithm to further improve its energy efficiency. The improvements to the original EEABR are based on the following: (1) a new scheme to intelligently initialize the routing tables giving priority to neighboring nodes that simultaneously could be the destination, (2) intelligent update of routing tables in case of a node or link failure, and (3) reducing the flooding ability of ants for congestion control. The energy efficiency improvements are significant particularly for dynamic routing environments. Experimental results using the RMASE simulation environment show that the proposed method increases the energy efficiency by up to 9% and 64% in converge-cast and target-tracking scenarios, respectively, over the original EEABR without incurring a significant increase in complexity. The method is also compared and found to also outperform other swarm-based routing protocols such as sensor-driven and cost-aware ant routing (SC) and Beesensor.

Original languageEnglish
Article number759654
JournalJournal of Sensors
Volume2013
DOIs
Publication statusPublished - Apr 5 2013

Fingerprint

Routing algorithms
Energy efficiency
Wireless sensor networks
Routing protocols
sensors
Ant colony optimization
Communication
Target tracking
energy
communication
Sensors
environment simulation
congestion
Costs
casts
costs
optimization

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Instrumentation
  • Electrical and Electronic Engineering

Cite this

@article{759d7acad77d41ab9f733eaa1bf5f0bf,
title = "Energy efficiency performance improvements for ant-based routing algorithm in wireless sensor networks",
abstract = "The main problem for event gathering in wireless sensor networks (WSNs) is the restricted communication range for each node. Due to the restricted communication range and high network density, event forwarding in WSNs is very challenging and requires multihop data forwarding. Currently, the energy-efficient ant based routing (EEABR) algorithm, based on the ant colony optimization (ACO) metaheuristic, is one of the state-of-the-art energy-aware routing protocols. In this paper, we propose three improvements to the EEABR algorithm to further improve its energy efficiency. The improvements to the original EEABR are based on the following: (1) a new scheme to intelligently initialize the routing tables giving priority to neighboring nodes that simultaneously could be the destination, (2) intelligent update of routing tables in case of a node or link failure, and (3) reducing the flooding ability of ants for congestion control. The energy efficiency improvements are significant particularly for dynamic routing environments. Experimental results using the RMASE simulation environment show that the proposed method increases the energy efficiency by up to 9{\%} and 64{\%} in converge-cast and target-tracking scenarios, respectively, over the original EEABR without incurring a significant increase in complexity. The method is also compared and found to also outperform other swarm-based routing protocols such as sensor-driven and cost-aware ant routing (SC) and Beesensor.",
author = "Zungeru, {Adamu Murtala} and Seng, {Kah Phooi} and Ang, {Li Minn} and {Chong Chia}, Wai",
year = "2013",
month = "4",
day = "5",
doi = "10.1155/2013/759654",
language = "English",
volume = "2013",
journal = "Journal of Sensors",
issn = "1687-725X",
publisher = "Hindawi Publishing Corporation",

}

Energy efficiency performance improvements for ant-based routing algorithm in wireless sensor networks. / Zungeru, Adamu Murtala; Seng, Kah Phooi; Ang, Li Minn; Chong Chia, Wai.

In: Journal of Sensors, Vol. 2013, 759654, 05.04.2013.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Energy efficiency performance improvements for ant-based routing algorithm in wireless sensor networks

AU - Zungeru, Adamu Murtala

AU - Seng, Kah Phooi

AU - Ang, Li Minn

AU - Chong Chia, Wai

PY - 2013/4/5

Y1 - 2013/4/5

N2 - The main problem for event gathering in wireless sensor networks (WSNs) is the restricted communication range for each node. Due to the restricted communication range and high network density, event forwarding in WSNs is very challenging and requires multihop data forwarding. Currently, the energy-efficient ant based routing (EEABR) algorithm, based on the ant colony optimization (ACO) metaheuristic, is one of the state-of-the-art energy-aware routing protocols. In this paper, we propose three improvements to the EEABR algorithm to further improve its energy efficiency. The improvements to the original EEABR are based on the following: (1) a new scheme to intelligently initialize the routing tables giving priority to neighboring nodes that simultaneously could be the destination, (2) intelligent update of routing tables in case of a node or link failure, and (3) reducing the flooding ability of ants for congestion control. The energy efficiency improvements are significant particularly for dynamic routing environments. Experimental results using the RMASE simulation environment show that the proposed method increases the energy efficiency by up to 9% and 64% in converge-cast and target-tracking scenarios, respectively, over the original EEABR without incurring a significant increase in complexity. The method is also compared and found to also outperform other swarm-based routing protocols such as sensor-driven and cost-aware ant routing (SC) and Beesensor.

AB - The main problem for event gathering in wireless sensor networks (WSNs) is the restricted communication range for each node. Due to the restricted communication range and high network density, event forwarding in WSNs is very challenging and requires multihop data forwarding. Currently, the energy-efficient ant based routing (EEABR) algorithm, based on the ant colony optimization (ACO) metaheuristic, is one of the state-of-the-art energy-aware routing protocols. In this paper, we propose three improvements to the EEABR algorithm to further improve its energy efficiency. The improvements to the original EEABR are based on the following: (1) a new scheme to intelligently initialize the routing tables giving priority to neighboring nodes that simultaneously could be the destination, (2) intelligent update of routing tables in case of a node or link failure, and (3) reducing the flooding ability of ants for congestion control. The energy efficiency improvements are significant particularly for dynamic routing environments. Experimental results using the RMASE simulation environment show that the proposed method increases the energy efficiency by up to 9% and 64% in converge-cast and target-tracking scenarios, respectively, over the original EEABR without incurring a significant increase in complexity. The method is also compared and found to also outperform other swarm-based routing protocols such as sensor-driven and cost-aware ant routing (SC) and Beesensor.

UR - http://www.scopus.com/inward/record.url?scp=84875650869&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875650869&partnerID=8YFLogxK

U2 - 10.1155/2013/759654

DO - 10.1155/2013/759654

M3 - Article

VL - 2013

JO - Journal of Sensors

JF - Journal of Sensors

SN - 1687-725X

M1 - 759654

ER -