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,466
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. (2011) · 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-citationBasirati, M., Jokar, M. R. A., & Hassannayebi, E. (2019) · Neural Computing and Applications · doi:10.1007/s00521-019-04666-z · Cited by 56
“[58] proposed evolutionary multi-objective meta-heuristics, i.”
ABC-PSO for vertical handover in heterogeneous wireless networks
Goudarzi, S., Hassan, W. H., Anisi, M. H., Soleymani, S. A., Sookhak, M., Khan, M. K., Hashim, A. H. A., & Zareei, M. (2017) · Neurocomputing · doi:10.1016/j.neucom.2016.08.136 · Cited by 59
“Yetgin et al, [21] introduced a VHO method based on a self-selection decision tree, which could support the VHO among WAVE, WiMAX, and cellular 3G.”
MethodA multi-objective routing algorithm for Wireless Multimedia Sensor Networks
Magaia, N., Horta, N. C. G., Neves, R. F., Pereira, P. R., & Correia, M. P. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.01.052 · Cited by 54
“Table 1: Summary of related work Publication MOEA algorithm Scenarios considered Metrics considered [15] MODE Wireless Sensor Network Energy consumption, delay [16] MODE, NSGA-II Full-connected network Energy consumption, delay [17] NSGA-II Wireless Mesh Network Bandwidth, packet loss, energy consumption and delay [18…”
MethodIqbal, M. Q., Naeem, M., Anpalagan, A., Qadri, N. N., & Imran, M. A. (2016) · Computer Networks · doi:10.1016/j.comnet.2016.01.015 · Cited by 52
Cross-Layer Network Lifetime Maximization in Interference-Limited WSNs
Yetgin, H., Cheung, K. T. K., El‐Hajjar, M., & Hanzo, L. (2014) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2014.2360361 · Cited by 48
“multihop relaying [14] is capable of conserving the energy of the”
BackgroundSelf-citationQuantum-Assisted Routing Optimization for Self-Organizing Networks
ALANIS, D., BOTSINIS, P., NG, S. X., & HANZO, L. (2014) · IEEE Access · doi:10.1109/access.2014.2327596 · Cited by 46
“For example, Yetgin et al. [4] used both the Non-dominated Sorting Genetic Algorithm II (NSGA-II) and the Multiobjective Differential Evolution Algorithm (MODE) for optimizing the transmission routes in terms of their end-to-end delay and power dissipation.”
BackgroundMethodInfluentialSelf-citationOn the Physical Layer Security of the Cooperative Rate-Splitting-Aided Downlink in UAV Networks
Bastami, H., Letafati, M., Moradikia, M., Abdelhadi, A., Behroozi, H., & Hanzo, L. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3122989 · Cited by 44
“…converts the non-convex problem 3 Notably, heuristic optimization techniques, such as GA [35], Ant Colonies [36], and Multiple-Objective GA (MOGA) [37] are capable of solving challenging rank deficient [38] and non-convex problems, even for the near-Pareto-optimization of multi-component objective…”
Self-citationUrgelles, H., Picazo-Martínez, P., García‐Roger, D., & Monserrat, J. F. (2022) · Sensors · doi:10.3390/s22197570 · Cited by 44
“rzz(qc[key] ∗ param, key[0], key[1]) 22: end for”
MethodEvolutionary multi-path routing for network lifetime and robustness in wireless sensor networks
Rahat, A., Everson, R., & Fieldsend, J. E. (2016) · Ad Hoc Networks · doi:10.1016/j.adhoc.2016.08.005 · Cited by 34
“Most current EA-based multi-objective routing optimisation approaches consider single-path routing schemes to optimise various objectives: energy efficiency, network lifetime, latency, robustness, expected transmission count, etc. [11, 12, 13, 14].”
Cooperative interaction among multiple RPL instances in wireless sensor networks
Barceló, M., Correa, A., Vicario, J. L., & Morell, A. (2015) · Computer Communications · doi:10.1016/j.comcom.2015.12.008 · Cited by 33
Reina, D. G., Ruiz, P., Ciobanu, R., Toral, S. L., Dorronsoro, B., & Dobre, C. (2016) · International Journal of Distributed Sensor Networks · doi:10.1155/2016/2082496 · Cited by 31
“In [34], the authors test several multiobjective optimization algorithms to optimize a simple routing protocol that finds routes between two nodes in the network.”
BackgroundResultJeske, M., Rosset, V., & Nascimento, M. C. V. (2020) · Computer Networks · doi:10.1016/j.comnet.2020.107347 · Cited by 29
Liu, D., Zhang, J., Cui, J., Ng, S. X., Maunder, R. G., & Hanzo, L. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3105357 · Cited by 31
“Routing Algorithms AODV [6] MUDOR [7] GPSR [11] GLSR [12] A-GR [13] Q-Routing [9] & its variants [10] MQSPR [8] MOEA [14] Proposed POMOR Proposed DL-aided Routing”
BackgroundMethodSelf-citationNon-Dominated Quantum Iterative Routing Optimization for Wireless Multihop Networks
Alanis, D., Botsinis, P., Babar, Z., Ng, S. X., & Hanzo, L. (2015) · IEEE Access · doi:10.1109/access.2015.2478793 · Cited by 26
“Furthermore, each WMHN node attempts to optimize its performance in terms of different and often conflicting Quality of Service (QoS) parameters, such as the Bit Error Ratio (BER), the Packet Loss Ratio (PLR) and the end-to-end delay, while having access to a restricted amount of power.”
BackgroundMethodInfluentialSelf-citationAdaptive systematic optimization of a multi-axis ocean wave energy converter
Shadmani, A., Nikoo, M. R., & Gandomi, A. H. (2023) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2023.113920 · Cited by 21
Improve Energy Consumption and Signal Transmission Quality of Routings in Wireless Sensor Networks
Yeh, W., Jiang, Y., Huang, C., Xiong, N. N., Hu, C.-F., & Yeh, Y.-H. (2020) · IEEE Access · doi:10.1109/access.2020.3030629 · Cited by 21
“Also, we plan to extend our current research to focus on the convergence rate for providing performance comparison for the goal of attaining a better result than that of a fixed number of run trials and to also provide the time-complexity that was conveyed in [31].”
BackgroundA Multi-objective Routing Algorithm for Wireless Mesh Network in a Smart Cities Environment
Lozano-Garzón, C., Camelo, M., Vilà, P., & Donoso, Y. (2015) · Journal of Networks · doi:10.4304/jnw.10.01.60-69 · Cited by 18
“The authors of [14] and [15] present some schemes to solve the single source - single destination routing problem in WMS by using Multi-Objective Evolutionary Algorithms (MOEA).”
BackgroundAlanis, D., Botsinis, P., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2803068 · Cited by 20
“Additionally, since N increases exponentially as the relay nodes proliferate [18], the Pareto-optimal routing problem is classified”
BackgroundMethodInfluentialSelf-citationMulti-Objective Optimization for Football Team Member Selection
Zhao, H., Chen, H., Yu, S., & Chen, B. (2021) · IEEE Access · doi:10.1109/access.2021.3091185 · Cited by 17
Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks
Alanis, D., Hu, J., Botsinis, P., Babar, Z., Ng, S. X., & Hanzo, L. (2016) · IEEE Access · doi:10.1109/access.2016.2629671 · Cited by 15
“For the sake of mitigating the effect of social selfishness as well as the potential degradation [32] of the routing efficiency metrics, a multi-objective optimization approach can be employed by relying on the concept of Paretooptimality [33] borrowed from socially-oblivious treatises.”
MethodInfluentialSelf-citationMulti-objective routing optimisation for battery-powered wireless sensor mesh networks
Rahat, A. A.-A. M., Everson, R., & Fieldsend, J. E. (2014) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2576768.2598311 · Cited by 12
“On the other hand centralised systems, in which a centrally calculated route is broadcast to participating nodes, mostly incorporate variants of evolutionary algorithms (EAs) [11, 13, 8].”
BackgroundNear-Pareto Multiobjective Routing Optimization for Space–Air–Sea-Integrated Networks
Li, D., Gao, Q., Liu, X., Yin, Z., Cheng, N., Xu, C., & Liu, J. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3516121 · Cited by 12
“Yetgin et al. [29] invoked the NSGA II and the multiobjective differential evolution algorithm for finding optimal routes to a given destination in the face of conflicting design objectives, such as dissipated energy and end-to-end delay in a fully connected arbitrary multihop network.”
Cui, J., Yetgin, H., Liu, D., Zhang, J., Ng, S. X., & Hanzo, L. (2021) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2021.3095467 · Cited by 12
“The application of MOEAs in wireless networks has been investigated in [17], [18] for striking a trade-off between the delay, the energy consumption as well as the bit error rate (BER).”
BackgroundSelf-citationDiscrete multi-objective differential evolution algorithm for routing in wireless mesh network
Murugeswari, R., & Radhakrishnan, S. (2015) · Soft Computing · doi:10.1007/s00500-015-1730-5 · Cited by 10
“Yetgin et al. (2012) proposed the Non-dominated Sorting based Genetic Algorithm-II (NSGA-II) and the Multi-Objective Differential Evolution (MODE) algorithm for finding optimal routes from a given source to destination for the mobile ad-hoc network.”
MethodA Multi QoS Genetic-based Adaptive Routing in Wireless Mesh Networks with Pareto Solutions
Ibraheem, I. K., & Al-Hussainy, A. A.-H. (2018) · International Journal of Computer Network and Information Security · doi:10.5815/ijcnis.2018.09.01 · Cited by 10
Xu, M., Yang, Q., & Shen, Z. (2017) · IEEE Sensors Journal · doi:10.1109/jsen.2017.2763617 · Cited by 9
“For example, the authors in [11], [12], [23], and [24] employed the model of fixed transmit power to calculate the corresponding cost function (energy consumption with/without residual energy, delay); while in [13], [14], and [16] the authors used the minimum transmit power to guide their routing designs.”
MethodRahat, A. A.-A. M., Everson, R., & Fieldsend, J. E. (2015) · Evolutionary Computation · doi:10.1162/evco_a_00151 · Cited by 7
“…approaches, which mostly incorporate variants of heuristic algorithms (Chang and Tassiulas, 2004; Xue et al., 2006; Islam and Hussain, 2006; Yetgin et al., 2012) require lower computational power and storage at the nodes, as most of the computation and storage is conducted 2 Evolutionary…”
A controllable chaotic immune algorithm for risk-aware routing in DiffServ networks
Fan, B., Zeng, Y., Jiang, K., & Tang, L. (2015) · Computer Communications · doi:10.1016/j.comcom.2015.11.003 · Cited by 6
Trusted Sensing Model for Mobile Ad HoC Network Using Differential Evolution Algorithm
Elamparithi, P., & Soundar, K. R. (2020) · Information Technology And Control · doi:10.5755/j01.itc.49.4.25438 · Cited by 6
A multi-objective Dyna-Q based routing in wireless mesh network
Chai, Y., & Zeng, X. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2021.107486 · Cited by 7
Wireless Sensor Network Optimization: Multi-Objective Paradigm
Iqbal, M., Naeem, M., Anpalagan, A., Ahmed, A., & Azam, M. (2021) · doi:10.32920/14640045 · Cited by 6
Energy aware and link-Stability Routing Protocol based on Differential Evolution for MANETs
Mekkaoui, A., Smail, O., & Rebbah, M. (2024) · International Conference on Networking and Network Applications (NaNA) · doi:10.1109/nana63151.2024.00018 · Cited by 4
“We refer to this assortment as Pareto Optimal [14].”
MethodGreen routing algorithm for Wireless Mesh Network: A multi-objective evolutionary approach
Lozano-Garzón, C., Camelo, M., Vilà, P., & Donoso, Y. (2013) · International Symposium on Performance Evaluation of Computer and Telecommunication Systems · Cited by 4
A Case Study: Optimization of Outbound Call Routing Using Data Mining Techniques
Vo-Thanh, T. (2024) · International Conference on Advanced Computing and Analytics (ACOMPA) · doi:10.1109/acompa64883.2024.00011 · Cited by 3
“The stimulation in [25] invoked NSGA-II and MODE to solve call routing problems given conflicting design targets to a given destination.”
Quality of Services based routing using evolutionary algorithms for Wireless Sensor Network
Hajjej, F., Ejbali, R., & Zaied, M. (2015) · International Conference on Intelligent Systems Design and Applications (ISDA) · doi:10.1109/isda.2015.7489231 · Cited by 3
Optimizing Communication Strategies in Contested and Dynamic Environments
Szabo, C., Radenovic, V., Judd, G., Craggs, D., Lee, K. L., Chen, X., & Chan, K. (2020) · IEEE International Conference on Engineering of Complex Computer Systems (ICECCS) · doi:10.1109/iceccs51672.2020.00030 · Cited by 3
“[28] compared the performance of two multi-objective evolutionary algorithms designed to determine routing paths through MANETs.”
BackgroundEvolutionary Algorithms for Enhancing Mobile Ad Hoc Network Security
Jinarajadasa, G. M., & Liyanage, S. R. (2022) · Internet of things · doi:10.1007/978-3-031-08254-2_2 · Cited by 4
SDERP: Stable‐aware differential evolution‐based routing protocol for mobile wireless networks
Mekkaoui, A., Smail, O., & Rebbah, M. (2024) · International Journal of Communication Systems · doi:10.1002/dac.6000 · Cited by 3
“This assortment is known as Pareto optimal 4 .”
Trusted-Differential Evolution Algorithm for Mobile Ad Hoc Networks
Prabha, S., & Yadav, R. (2018) · Lecture notes in electrical engineering · doi:10.1007/978-981-13-2685-1_19 · Cited by 3
Barceló, M. (2015) · TDX (Tesis Doctorals en Xarxa) · Cited by 3
An Improved Routing Method for Electric Power Communication Networks
Bing, F. (2016) · American Journal of Networks and Communications · doi:10.11648/j.ajnc.20160505.15 · Cited by 3
“Genetic algorithms (GA) are widely used in solving the problem but the uncertainty of GA is a defect which leads many authors into using the average of multiple running results to illustrate the superiority of the algorithms [13-16].”
Survey on Optimization Problems for Mobile Ad Hoc Networks
Dorronsoro, B., Ruiz, P., Danoy, G., Pigné, Y., & Bouvry, P. (2014) · Wiley eBooks · doi:10.1002/9781118833209.ch3 · Cited by 3
Optimal Path in Mobile Ad-hoc Networks with Differential Evolution
Prabha, S., & Yadav, R. (2018) · Recent Advances on Engineering, Technology and Computational Sciences (RAETCS) · doi:10.1109/raetcs.2018.8443799 · Cited by 2
“In [2] author used multi-objective differential evolution (MODE) and non-dominated sorting based algorithm (NSGA-II) for optimizing E2E delay and energy cost metrics.”
MethodApplication of an Evolutionary Optimization Technique to Routing in Mobile Wireless Networks
Ibraheem, I. K., & Al-Hussainy, A. A.-H. (2014) · International Journal of Computer Applications · doi:10.5120/17385-7922 · Cited by 2
“Halil Yetgin et al [10] invoked the Non-dominated Sorting based Genetic Algorithm-II (NSGA-II) and the Multi Objective 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…”
BackgroundSurvey on Multi-Objective Routing Optimization in Ad Hoc Networks: Challenges for Green Technology
Bouamoud, B., & Habbani, A. (2015) · Advances in environmental engineering and green technologies book series · doi:10.4018/978-1-4666-8447-8.ch010 · Cited by 2
An Energy-Delay Trade-Off in Wireless Visual Sensor Networks Based on Two-Sided Matching
Yuan, D., Yang, X., Jiang, Y., & Meng, Y. (2019) · IEEE Sensors Journal · doi:10.1109/jsen.2019.2918249 · Cited by 2
“, Non-dominated Sorting based Genetic Algorithm-II (NSGA-II) [31] or Multi-Objective Differential Evolution (MODE) algorithm [32], it will be difficult to achieve this goal due to the complexity of Problem 1.”
MethodMulti-Objective Routing by using non-Dominated Sorting Genetic Algorithm in Computer Networks
Zhoulaian, E., Mirabedini, S. J., & Sadeghzadeh, M. (2015) · Cited by 1
Robustness of Middleware Communication in Contested and Dynamic Environments
Szabo, C., Craggs, D., Balasoiu, D. A., Radenovic, V., & Campbell, B. (2022) · Winter Simulation Conference · doi:10.1109/wsc57314.2022.10015382 · Cited by 1
“Lastly, two multi-objective EAs are compared by Yetgin et al. (2012), with a focus on determining routing paths.”
BackgroundWireless Sensor Network Optimization: Multi-Objective Paradigm
Iqbal, M., Naeem, M., Anpalagan, A., Ahmed, A., & Azam, M. (2021) · doi:10.32920/14640045.v1 · Cited by 1
Rahat, A. A.-A. M., Everson, R., & Fieldsend, J. E. (2015) · ACM SIGEVOlution · doi:10.1145/2850447.2850448
Multi-Objective Routing for Dense and Distributed Networks
Gabdullin, R., & Seytnazarov, S. (2025) · International Balkan Conference on Communications and Networking (BalkanCom) · doi:10.1109/balkancom65827.2025.11185973
“• Non-dominated sorting genetic algorithm-II (NSGA-II) [5], [6] is a widely adopted evolutionary algorithm for multi-objective optimization.”
PPF: Link-State Routing Protocol on Multiple Optimality Criteria
Liu, Y., Yang, Y., Xie, R., Deng, H., Xu, M., & Wu, J. (2026) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom59046.2026.11571292
“To improve scalability, approximation techniques [28]–[30] compute near-Pareto frontiers within less time, sacrificing completeness for performance.”
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.