Improvement at network planning using heuristic algorithm to minimize cost of distance between nodes in wireless mesh networks

Shivan Qasim Ameen, Ravie Chandren Muniyandi

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.

Original languageEnglish
Pages (from-to)309-315
Number of pages7
JournalInternational Journal of Electrical and Computer Engineering
Volume7
Issue number1
DOIs
Publication statusPublished - 2017

Fingerprint

Wireless mesh networks (WMN)
Heuristic algorithms
Planning
Costs
Network performance
Particle swarm optimization (PSO)

Keywords

  • Heuristic algorithm
  • MBPSO
  • Minimize cost of distance
  • Routers
  • Wireless mesh networks

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

@article{c999a7d2a4574d979c70b408d89f7e6c,
title = "Improvement at network planning using heuristic algorithm to minimize cost of distance between nodes in wireless mesh networks",
abstract = "Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83{\%} whereas the E2E delay saw an approximate decrease of 8.33{\%}.",
keywords = "Heuristic algorithm, MBPSO, Minimize cost of distance, Routers, Wireless mesh networks",
author = "Ameen, {Shivan Qasim} and Muniyandi, {Ravie Chandren}",
year = "2017",
doi = "10.11591/ijece.v7i1.pp309-315",
language = "English",
volume = "7",
pages = "309--315",
journal = "International Journal of Electrical and Computer Engineering",
issn = "2088-8708",
publisher = "Institute of Advanced Engineering and Science (IAES)",
number = "1",

}

TY - JOUR

T1 - Improvement at network planning using heuristic algorithm to minimize cost of distance between nodes in wireless mesh networks

AU - Ameen, Shivan Qasim

AU - Muniyandi, Ravie Chandren

PY - 2017

Y1 - 2017

N2 - Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.

AB - Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.

KW - Heuristic algorithm

KW - MBPSO

KW - Minimize cost of distance

KW - Routers

KW - Wireless mesh networks

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

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

U2 - 10.11591/ijece.v7i1.pp309-315

DO - 10.11591/ijece.v7i1.pp309-315

M3 - Article

VL - 7

SP - 309

EP - 315

JO - International Journal of Electrical and Computer Engineering

JF - International Journal of Electrical and Computer Engineering

SN - 2088-8708

IS - 1

ER -