Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Mutation, Gene Flow, and Genetic Drift

Mutation, Gene Flow, and Genetic Drift

In a population that is not at Hardy-Weinberg equilibrium, the frequency of alleles changes over time. Therefore, any deviations from the five conditions of Hardy-Weinberg equilibrium can alter the genetic variation of a given population. Conditions that change the genetic variability of a population include mutations, natural selection, non-random mating, gene flow, and genetic drift (small population size).

Gene Flow

Gene Flow

Gene flow is the transfer of genes among populations, resulting from either the dispersal of gametes or from the migration of individuals.

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

A Comprehensive Review of Metaheuristic Algorithms for Node Placement in UAV Communication Networks.

Sensors (Basel, Switzerland)·2026

Same author

Information-Entropy Analysis of Stellar Evolutionary Stages with Application to FS CMa Objects.

Entropy (Basel, Switzerland)·2025

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 9, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

MEGA: Maximum-Entropy Genetic Algorithm for Router Nodes Placement in Wireless Mesh Networks.

Nurzhan Ussipov¹, Sayat Akhtanov¹, Dana Turlykozhayeva¹

¹Faculty of Physics and Technology, Al-Farabi Kazakh National University, Almaty 050040, Kazakhstan.

Sensors (Basel, Switzerland)

|October 26, 2024

Summary

The Maximum Entropy Genetic Algorithm (MEGA) optimizes wireless mesh network (WMN) node placement. MEGA demonstrates superior effectiveness and usability for mesh router positioning compared to other leading algorithms.

Keywords:

entropy genetic algorithm mesh router nodes placement network connectivity user coverage wireless mesh networks

More Related Videos

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

Determination of the Optimal Chromosomal Locations for a DNA Element in Escherichia coli Using a Novel Transposon-mediated Approach

Determination of the Optimal Chromosomal Locations for a DNA Element in Escherichia coli Using a Novel Transposon-mediated Approach

Published on: September 11, 2017

Related Experiment Videos

Last Updated: Jun 9, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

Determination of the Optimal Chromosomal Locations for a DNA Element in Escherichia coli Using a Novel Transposon-mediated Approach

Determination of the Optimal Chromosomal Locations for a DNA Element in Escherichia coli Using a Novel Transposon-mediated Approach

Published on: September 11, 2017

Area of Science:

Computer Science
Network Engineering
Optimization Algorithms

Background:

Wireless Mesh Networks (WMNs) offer deployment advantages but face node placement challenges.
Optimal node placement in WMNs is an NP-hard problem requiring advanced optimization.
Existing heuristic and metaheuristic algorithms have limitations in WMN node placement.

Purpose of the Study:

To introduce the Maximum Entropy Genetic Algorithm (MEGA) for WMN mesh router node placement.
To evaluate MEGA's performance against established optimization algorithms.
To assess MEGA's impact on network connectivity and user coverage in WMNs.

Main Methods:

Development of the Maximum Entropy Genetic Algorithm (MEGA).
Experimental evaluation of MEGA across diverse network scenarios.
Comparative analysis with Coyote Optimization Algorithm (COA), Firefly Algorithm (FA), Genetic Algorithm (GA), and Particle Swarm Optimization (PSO).

Main Results:

MEGA demonstrated superior performance in optimizing mesh router node placement.
The algorithm showed effectiveness in enhancing network connectivity and user coverage.
MEGA proved to be a usable and effective solution for WMN node placement challenges.

Conclusions:

The Maximum Entropy Genetic Algorithm (MEGA) is a highly effective method for WMN node placement.
MEGA offers significant advantages over existing algorithms like COA, FA, GA, and PSO.
This research validates MEGA's utility for improving WMN performance through optimal router positioning.