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 Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of Distance between Nodes in Wireless Mesh Networks

2017 ◽  
Vol 7 (1) ◽  
pp. 309
Author(s):  
Shivan Qasim Ameen ◽  
Ravie Chandren Muniyandi
Keyword(s):  
Particle Swarm Optimization ◽  
Wireless Mesh Networks ◽  
Heuristic Algorithm ◽  
Network Performance ◽  
Mesh Networks ◽  
Cost Minimization ◽  
Binary Particle Swarm Optimization ◽  
Swarm Optimization ◽  
Wireless Mesh ◽  
Different Levels

Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.

Selection of Pathway Markers for Cancer Using Collaborative Binary Multi-Swarm Optimization

2018 ◽  
pp. 337-363
Author(s):  
Prativa Agarwalla ◽  
Sumitra Mukhopadhyay
Keyword(s):  
Particle Swarm Optimization ◽  
Artificial Bee Colony ◽  
Gene Selection ◽  
Heuristic Algorithms ◽  
Particle Swarm ◽  
High Accuracy ◽  
Marker Genes ◽  
Binary Particle Swarm Optimization ◽  
Swarm Optimization ◽  
Bee Colony

Pathway information for cancer detection helps to find co-regulated gene groups whose collective expression is strongly associated with cancer development. In this paper, a collaborative multi-swarm binary particle swarm optimization (MS-BPSO) based gene selection technique is proposed that outperforms to identify the pathway marker genes. We have compared our proposed method with various statistical and pathway based gene selection techniques for different popular cancer datasets as well as a detailed comparative study is illustrated using different meta-heuristic algorithms like binary coded particle swarm optimization (BPSO), binary coded differential evolution (BDE), binary coded artificial bee colony (BABC) and genetic algorithm (GA). Experimental results show that the proposed MS-BPSO based method performs significantly better and the improved multi swarm concept generates a good subset of pathway markers which provides more effective insight to the gene-disease association with high accuracy and reliability.

scholarly journals Performance Evaluation of Routing Metrics for Community Wireless Mesh Networks

2021 ◽  
Author(s):  
◽  
Nan Liu
Keyword(s):  
Performance Evaluation ◽  
Wireless Mesh Networks ◽  
Mesh Networks ◽  
Internet Traffic ◽  
Transmission Time ◽  
Route Selection ◽  
Loss Ratio ◽  
Hop Count ◽  
Mesh Topology ◽  
Wireless Mesh

<p>With the growth of different types of Internet traffic there is a compelling need to provide better quality of service, especially, over the increasing number of wireless networks. Expected Transmission Count (ETX) is a high throughput route selection metric that measures link loss ratios. ETX of a path reflects the total number of packet transmissions (including retransmission) required to successfully deliver a data packet along that path. Expected Transmission Time (ETT) is an improvement of ETX. ETT of a path is a measure of the transmission time needed to successfully deliver a packet along the path. ETT measures the loss ratio and the bandwidth of the link. Both, ETX and ETT, in comparison to hop count, provide better route selection for routing protocols widely used in Wireless Mesh Networks (WMNs). Using minimum hop count to find the shortest path has been shown to be inadequate for WMNs, as the selected routes often include the weakest links. This thesis presents a performance evaluation comparing hop count, ETX and ETT when used with the Optimized Link State Routing version 2 (OLSRv2) protocol. This study is based on the wireless mesh topology of a suburban residential area in New Zealand, and analyses the performance of three common Internet traffic types in terms of throughput, end-to-end delay, jitter and packet loss ratio, and presents findings that are closer to the perspective of what an enduser experiences. Also, a grid network of 121 nodes was used to analyze how the metrics choose paths, the performance changes (for different path lengths) and other conditions that affect the performance of the three metrics.</p>

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 Performance Evaluation of Routing Metrics for Community Wireless Mesh Networks

2021 ◽  
Author(s):  
◽  
Nan Liu
Keyword(s):  
Performance Evaluation ◽  
Wireless Mesh Networks ◽  
Mesh Networks ◽  
Internet Traffic ◽  
Transmission Time ◽  
Route Selection ◽  
Loss Ratio ◽  
Hop Count ◽  
Mesh Topology ◽  
Wireless Mesh

<p>With the growth of different types of Internet traffic there is a compelling need to provide better quality of service, especially, over the increasing number of wireless networks. Expected Transmission Count (ETX) is a high throughput route selection metric that measures link loss ratios. ETX of a path reflects the total number of packet transmissions (including retransmission) required to successfully deliver a data packet along that path. Expected Transmission Time (ETT) is an improvement of ETX. ETT of a path is a measure of the transmission time needed to successfully deliver a packet along the path. ETT measures the loss ratio and the bandwidth of the link. Both, ETX and ETT, in comparison to hop count, provide better route selection for routing protocols widely used in Wireless Mesh Networks (WMNs). Using minimum hop count to find the shortest path has been shown to be inadequate for WMNs, as the selected routes often include the weakest links. This thesis presents a performance evaluation comparing hop count, ETX and ETT when used with the Optimized Link State Routing version 2 (OLSRv2) protocol. This study is based on the wireless mesh topology of a suburban residential area in New Zealand, and analyses the performance of three common Internet traffic types in terms of throughput, end-to-end delay, jitter and packet loss ratio, and presents findings that are closer to the perspective of what an enduser experiences. Also, a grid network of 121 nodes was used to analyze how the metrics choose paths, the performance changes (for different path lengths) and other conditions that affect the performance of the three metrics.</p>

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.

Sign in / Sign up

Export Citation Format

Share Document