CoChat

Multi-objective routing optimization using evolutionary algorithms

Yetgin, Halil, Cheung, Kent Tsz Kan, Hanzo, Lajos · 2012 · 2012 IEEE Wireless Communications and Networking Conference (WCNC)

The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.

Abstract

Wireless ad hoc networks suffer from several limitations, such as routing failures, potentially excessive bandwidth requirements, computational constraints and limited storage capability. Their routing strategy plays a significant role in determining the overall performance of the multi-hop network. However, in conventional network design only one of the desired routing-related objectives is optimized, while other objectives are typically assumed to be the constraints imposed on the problem. In this paper, we invoke the Non-dominated Sorting based Genetic Algorithm-II (NSGA-II) and the MultiObjective Differential Evolution (MODE) algorithm for finding optimal routes from a given source to a given destination in the face of conflicting design objectives, such as the dissipated energy and the end-to-end delay in a fully-connected arbitrary multi-hop network. Our simulation results show that both the NSGA-II and MODE algorithms are efficient in solving these routing problems and are capable of finding the Pareto-optimal solutions at lower complexity than the `brute-force' exhaustive search, when the number of nodes is higher than or equal to 10. Additionally, we demonstrate that at the same complexity, the MODE algorithm is capable of finding solutions closer to the Pareto front and typically, converges faster than the NSGA-II algorithm.

Overview

Integrity signals

Registry

Crossref · 10.1109/wcnc.2012.6214324

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Cited by

See all 58

Metadata

Authors
Yetgin, H., Cheung, K. T. K., & Hanzo, L.
Affiliations
University of Southampton (GB)
Venue
2012 IEEE Wireless Communications and Networking Conference (WCNC)
Publisher
IEEE
Published
2012-04
Pages
3030-3034
ISSN
1525-3511 (ISSN-L)
OpenAlex
W2091747721
Cited by
58
References
18
Citations by year
2026: 1 · 2025: 1 · 2024: 4 · 2023: 1 · 2022: 3 · 2021: 7 · 2020: 4 · 2019: 3 · 2018: 5 · 2017: 2 · 2016: 6 · 2015: 15 · 2014: 5 · 2013: 1
FWCI
5.64
Type
conference paper
Language
en
Open access
closed
Locations
  • IEEE Wireless Communications and Networking Conference (publishedVersion)
  • ePrints Soton (University of Southampton) (acceptedVersion)
Funders
Engineering and Physical Sciences Research Council (EP/G05178X/1)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
Keywords
wireless ad hoc networks, NSGA-II, multi-objective differential evolution, energy consumption, end-to-end delay, Pareto optimal solutions, multi-hop networks, evolutionary algorithms

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.