Heuristic algorithms for designing self-repairing protection trees in mesh networks

2009 ◽  
Vol 53 (14) ◽  
pp. 2537-2551 ◽  
Author(s):  
Shahram Shah-Heydari ◽  
Oliver Yang
Keyword(s):  
Heuristic Algorithms ◽  
Mesh Networks ◽  
Protection Trees

A web interface for wireless mesh networks based on heuristic algorithms: optimisation and analysis for different scenarios

2015 ◽  
Vol 11 (3) ◽  
pp. 327 ◽  
Author(s):  
Algenti Lala ◽  
Vladi Kolici ◽  
Tetsuya Oda ◽  
Leonard Barolli ◽  
Admir Barolli ◽  
...  
Keyword(s):  
Wireless Mesh Networks ◽  
Heuristic Algorithms ◽  
Mesh Networks ◽  
Web Interface ◽  
Wireless Mesh

scholarly journals Fairness Time-Slot Allocation and Scheduling with QoS Guarantees in Multihop WiMAX Mesh Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
Chien-Yu Wu ◽  
Hann-Jang Ho ◽  
Sing-Ling Lee ◽  
Liang Lung Chen
Keyword(s):  
Large Scale ◽  
Heuristic Algorithms ◽  
Mesh Networks ◽  
Time Slot ◽  
Optimal Solution ◽  
Small Scale ◽  
Scheduling Problem ◽  
Slot Allocation ◽  
Long Distance ◽  
Time Slot Allocation

The WiMAX technology has been defined to provide high throughput over long distance communications and support the quality of service (QoS) control applied on different applications. This paper studies the fairness time-slot allocation and scheduling problem for enhancing throughput and guaranteeing QoS in multihop WiMAX mesh networks. For allocating time slots to multiple subscribe stations (SSs), fairness is a key concern. The notion of max-min fairness is applied as our metric to define the QoS-based max-min fair scheduling problem for maximizing the minimum satisfaction ratio of each SS. We formulate an integer linear programming (ILP) model to provide an optimal solution on small-scale networks. For large-scale networks, several heuristic algorithms are proposed for better running time and scalability. The performance of heuristic algorithms is compared with previous methods in the literatures. Experimental results show that the proposed algorithms are better in terms of QoS satisfaction ratio and throughput.

scholarly journals Wireless Mesh Networks Based on MBPSO Algorithm to Improvement Throughput

2018 ◽  
Vol 8 (6) ◽  
pp. 4374 ◽  
Author(s):  
Shivan Qasim Ameen ◽  
Firas Layth Khaleel
Keyword(s):  
Particle Swarm Optimization ◽  
Wireless Mesh Networks ◽  
Communication Technology ◽  
Heuristic Algorithms ◽  
Mesh Networks ◽  
Binary Particle Swarm Optimization ◽  
Swarm Optimization ◽  
Mesh Topology ◽  
Wireless Mesh ◽  
Different Types

Wireless Mesh Networks can be regarded as a type of communication technology in mesh topology in which wireless nodes interconnect with one another. Wireless Mesh Networks depending on the semi-static configuration in different paths among nodes such as PDR, E2E delay and throughput. This study summarized different types of previous heuristic algorithms in order to adapt with proper algorithm that could solve the issue. Therefore, the main objective of this study is to determine the proper methods, approaches or algorithms that should be adapted to improve the throughput. A Modified Binary Particle Swarm Optimization (MBPSO) approach was adapted to improvements the throughput. Finally, the finding shows that throughput increased by 5.79% from the previous study.

scholarly journals Dynamic Resource Management in 802.11 Wireless Mesh Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-12
Author(s):  
George Athanasiou
Keyword(s):  
Load Balancing ◽  
Wireless Mesh Networks ◽  
Heuristic Algorithms ◽  
Mesh Networks ◽  
Access Point ◽  
Wireless Mesh ◽  
Dynamic Resource Management ◽  
Channel Information ◽  
Dynamic Resource ◽  
Cooperative Association

The association/handoff procedures are important components in a balanced operation of 802.11-based wireless mesh networks. In this paper, we introduce the concept of cooperative association where the stations (STA) can share useful information in order to improve the performance of the association/reassociation procedures. Furthermore, in this work we introduce a load balancing mechanism that can be applied in mesh networks. This mechanism operates in a cross-layer manner taking into account uplink and downlink channel information, routing information, and congestion-based information. Our load balancing mechanism is based on a fairness index that is measured at each access point (AP) neighborhood. This index reflects the way the communication load is shared in the neighboring APs. The iterative heuristic algorithms that we propose controls the communication load of each mesh AP in a distributed manner. We evaluate the performance of our mechanisms through OPNET simulations.

Comparison of Meta-heuristic Algorithms on Benchmark Functions

2019 ◽  
Vol 2 (3) ◽  
pp. 508-517
Author(s):  
FerdaNur Arıcı ◽  
Ersin Kaya
Keyword(s):  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Differential Evolution Algorithm ◽  
Population Based ◽  
Time Interval ◽  
Bee Colony ◽  
Different Characteristics

Optimization is a process to search the most suitable solution for a problem within an acceptable time interval. The algorithms that solve the optimization problems are called as optimization algorithms. In the literature, there are many optimization algorithms with different characteristics. The optimization algorithms can exhibit different behaviors depending on the size, characteristics and complexity of the optimization problem. In this study, six well-known population based optimization algorithms (artificial algae algorithm - AAA, artificial bee colony algorithm - ABC, differential evolution algorithm - DE, genetic algorithm - GA, gravitational search algorithm - GSA and particle swarm optimization - PSO) were used. These six algorithms were performed on the CEC’17 test functions. According to the experimental results, the algorithms were compared and performances of the algorithms were evaluated.

Sign in / Sign up

Export Citation Format

Share Document