Multi-objective routing optimization using evolutionary algorithms
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Moreover, the framework of DL has a recognized potential in multi-objective optimization, see e.g., [203].”
From Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future (2019) · cites this paper as [203]
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053 · cited 5×
“Furthermore, the concept of ’crowding distance’ [3] is introduced in NSGA-II, which is a measure of the Euclidean distance of an individual from its neighbors in the same front of the solution space corresponding to diverse or dissimilar routes.”
BackgroundMethodInfluentialMulti-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,324
Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1024422 · Cited by 13,644
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935 · cited 1×
“The difference between NSGA-II and its predecessor, NSGA [17], is that the diversity of candidate solutions is maintained without requiring a user-selected parameter.”
BackgroundDifferential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307 · cited 1×
“In classic DE [18], the new individuals are created using the appropriately weighted difference between the current individuals of the specific generation.”
BackgroundMultiobjective evolutionary algorithms: A survey of the state of the art
Zhou, A., Qu, B.-Y., Li, H., Zhao, S.-Z., Suganthan, P. N., & Zhang, Q. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.03.001 · Cited by 2,255 · cited 1×
“A multi-objective problem can be formulated as follows [14]: min f(x) = [f1(x), f2(x), f3(x), · · · , fnf (x)]; s.”
BackgroundComputational Intelligence in Wireless Sensor Networks: A Survey
Kulkarni, R. V., Forster, A., & Venayagamoorthy, G. K. (2011) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.040310.00002 · Cited by 695 · cited 2×
“Hence, there is a need for efficient heuristic search algorithms based on reduced-complexity Evolutionary Algorithms (EAs) [5].”
BackgroundA survey on power control issues in wireless sensor networks
Pantazis, N. A., & Vergados, D. D. (2007) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2007.4444752 · Cited by 287 · cited 1×
“Additionally, there are comprehensive studies of MO problems that investigate different aspects of Wireless Sensor Networks (WSNs) [5], [8], [9].”
BackgroundA survey of multicriteria optimization or the vector maximum problem, part I: 1776?1960
Stadler, W. (1979) · Journal of Optimization Theory and Applications · doi:10.1007/bf00932634 · Cited by 237 · cited 1×
“Multi-objective optimization problems can be solved using the Pareto optimality technique, which was proposed by Edgeworth and Pareto [15], as defined below for the case of a minimization problem [16].”
MethodMartins, F. V. C., Carrano, E. G., Wanner, E. F., Takahashi, R. H. C., & Mateus, G. R. (2010) · IEEE Sensors Journal · doi:10.1109/jsen.2010.2048897 · Cited by 95 · cited 1×
“[10] proposed a hybrid multi-objective optimization algorithm for improving the performance of WSNs.”
Background
Cited by
Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
“…considered for this computationally-tedious and intelligence-needy task of searching in multiple spaces with multiple tight constraints (battery resources etc) to draw a global optimal packet-route in order to optimize the overall network performance, see e.g. in [202] and [33], respectively.”
BackgroundQuantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149
“Non-dominated Sorting Genetic Algorithm II (NSGA-II) and the Multiobjective Differential Evolution Algorithm (MODE) have been invoked in [124] for optimizing their end-to-end delay and power dissipation of transmission routes established Fig.”
BackgroundMethodResultSelf-citationWireless Sensor Network Optimization: Multi-Objective Paradigm
Iqbal, M. Q., Naeem, M., Anpalagan, A., Ahmed, A., & Azam, M. (2015) · Sensors · doi:10.3390/s150717572 · Cited by 163
“A trade-off has been obtained between energy efficiency and end-to-end delay by using a multi-objective routing algorithm in [81].”
MethodA multi-objective genetic algorithm-based adaptive weighted clustering protocol in VANET
Hadded, M., Zagrouba, R., Laouiti, A., Mühlethaler, P., & Saı̈dane, L. A. (2015) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2015.7256998 · Cited by 77
Network-Lifetime Maximization of Wireless Sensor Networks
Yetgin, H., Cheung, K. T. K., El‐Hajjar, M., & Hanzo, L. (2015) · IEEE Access · doi:10.1109/access.2015.2493779 · Cited by 58
“At the instant of the crossover operation, we use a similar strategy to that of our work in [16], where a common sensor node is chosen for the crossover point in our scenarios considered.”
BackgroundMethodResultInfluentialSelf-citation
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multi-objective routing optimization using evolutionary algorithms. https://app.cochat.ai/papers/10.1109/wcnc.2012.6214324
- The paper
- Yetgin, H., Cheung, K. T. K., & Hanzo, L. (2012). Multi-objective routing optimization using evolutionary algorithms. 2012 IEEE Wireless Communications and Networking Conference (WCNC). https://doi.org/10.1109/wcnc.2012.6214324
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.