Performance Comparison of Survival Routing Mechanisms in Wireless Mesh Networks

2013 ◽  
Vol 760-762 ◽  
pp. 623-627
Author(s):  
Yu Huai Peng ◽  
Yin Peng Yu ◽  
Cun Qian Yu ◽  
Qing Yang Song ◽  
Fei Wang
Keyword(s):  
Wireless Mesh Networks ◽  
Performance Metrics ◽  
Mesh Networks ◽  
Fault Tolerant ◽  
Performance Comparison ◽  
Wireless Channel ◽  
Delivery Ratio ◽  
Efficient Design ◽  
Traffic Pattern ◽  
Wireless Mesh

This paper addresses the fault-tolerant mechanisms in Wireless mesh networks (WMNs), and designs a C++ based simulation platform to measure the performance of different fault-tolerant mechanisms. A comprehensive performance evaluation of network coding tree algorithm (NCT), 1+1 scheme and 1: N scheme in WMNs is conducted. Performance metrics, such as packet delivery ratio, resource redundancy degree, end-to-end delay, and useful throughput ratio, are investigated. The simulation results and performance analysis reveal that how wireless channel quality can influence the performance of WMNs and how different fault-tolerant mechanisms can be efficient and effective for latency-sensitive applications in WMNs. The results can also provide the enlightening insights for efficient design of fault-tolerant routing protocols for many-to-one traffic pattern in WMNs.

Opportunistic Frame Forwarding in Wireless Mesh Networks

2015 ◽  
Vol 764-765 ◽  
pp. 941-945
Author(s):  
Shih Tsung Liang ◽  
Bo Yi Song ◽  
Yu Yao Su
Keyword(s):  
Wireless Mesh Networks ◽  
Mesh Networks ◽  
Opportunistic Routing ◽  
Wireless Channel ◽  
Mesh Network ◽  
Delivery Ratio ◽  
Delivery Probability ◽  
Wireless Mesh ◽  
Deterministic Routing ◽  
The One

Opportunistic routing has been shown to achieve the high throughput of the wireless mesh network with lossy channels. Different from deterministic routing mechanisms in which a frame is <em>transmitted</em> and forwarded along with a fixed and predetermined <em>path</em>, the opportunistic routing technique allows multiple nodes hearing the frame to form the forwarder set containing promising candidates for the frame forwarding. Existing opportunistic routing protocols typically choose among forwarding candidates based on the decision made from the transmitter disregarding the current loads in candidates. In this paper, the opportunistic frame forwarding mechanism with considering backlog of frames among forwarders is proposed and analyzed. Specifically, in addition to take into account the delivery probability, our proposal restricts members of the forwarder set for a given transmitter to those wireless nodes whose transmission range covers one another and makes the true forwarder picked from the forward set of a given transmitting frame being the one who gains access to wireless channel for the frame before others do. Therefore, the efficient and load-balanced opportunistic routing for wireless mesh networks can be achieved. Analytic results show that the proposed method compared to the deterministic routing methodology can achieve the high frame delivery ratio.

scholarly journals The Total Network Capacity of Wireless Mesh Networks for IoT Applications

2020 ◽  
Vol 14 (08) ◽  
pp. 61
Author(s):  
El Miloud Ar-Reyouchi ◽  
Yousra Lamrani ◽  
Imane Benchaib ◽  
Kamal Ghoumid ◽  
Salma Rattal
Keyword(s):  
Wireless Mesh Networks ◽  
Forward Error Correction ◽  
Performance Metrics ◽  
Mesh Networks ◽  
Network Capacity ◽  
Operating Conditions ◽  
Wireless Internet ◽  
Research Issues ◽  
Wireless Mesh ◽  
Total Network

<p class="0abstract">Computing and measuring the total capacity of a data network are a remarkably difficult problem. These metrics are directly linked to the available bandwidth to each wireless internet of things (IoT) device of the network.  In this paper, the authors study the performance metrics associated with capacity traffic in multi-hop wireless mesh networks (WMNs). It is dedicated to Internet access assuming a time division multiple access (TDMA). They focus simultaneously on three key operating metrics, the total network capacity (TNC), total application network capacity (TANC), and the Average message time (AMS). They also analyze how parameters such as forward error correction (FEC) and acknowledgments (ACK) affect the overall network capacity under different operating conditions. Theoretical network capacity for WMNs, in this paper, is explored to draw attention to the number of open research issues</p>

scholarly journals Fault-Tolerant Placement of Additional Mesh Nodes in Rural Wireless Mesh Networks: A Minimum Steiner Tree Based Centre of Mass With Bounded Edge Length

2021 ◽  
Vol 9 (4) ◽  
pp. 39-50
Author(s):  
Jean Louis Kedieng Ebongue Fendji ◽  
Patience Leopold Bagona
Keyword(s):  
Digital Divide ◽  
Wireless Mesh Networks ◽  
Steiner Tree ◽  
Mesh Networks ◽  
Fault Tolerant ◽  
Edge Length ◽  
Centre Of Mass ◽  
Steiner Points ◽  
Minimum Steiner Tree ◽  
Wireless Mesh

Wireless mesh networks are presented as an attractive solution to reduce the digital divide between rural and developed areas. In a multi-hop fashion, they can cover larger spaces. However, their planning is subject to many constraints including robustness. In fact, the failure of a node may result in the partitioning of the network. The robustness of the network is therefore achieved by carefully placing additional nodes. This work tackles the problem of additional nodes minimization when planning bi and tri-connectivity from a given network. We propose a vertex augmentation approach inspired by the placement of Steiner points. The idea is to incrementally determine cut vertices and bridges in the network and to carefully place additional nodes to ensure connectivity, bi and tri-connectivity. The approach relies on an algorithm using the centre of mass of the blocks derived after the partitioning of the network. The proposed approach has been compared to a modified version of a former approach based on the Minimum Steiner Tree. The different experiments carried out show the competitiveness of the proposed approach to connect, bi-connect, and tri-connect the wireless mesh networks.

Link Capacity Based Channel Assignment (LCCA) for Cognitive Radio Wireless Mesh Networks

2013 ◽  
Vol 65 (1) ◽  
Author(s):  
Wajahat Maqbool ◽  
Sharifah K. Syed Yusof ◽  
N. M. Abdul Latiff ◽  
Hashim S. ◽  
Rahat U. ◽  
...  
Keyword(s):  
Cognitive Radio ◽  
Wireless Mesh Networks ◽  
Channel Assignment ◽  
Mesh Networks ◽  
Mesh Network ◽  
Delivery Ratio ◽  
Link Capacity ◽  
Wireless Mesh ◽  
User Activity ◽  
Decision Engine

Cognitive radio wireless mesh network (CRWMN) is expected as an upcoming technology with the potential advantages of both cognitive radio (CR) and the wireless mesh networks (WMN). In CRWMN, co-channel interference is one of the key limiting factors that affect the reception capabilities of the client and reduce the achievable transmission rate. Furthermore, it increases the frame loss rate and results in underutilization of resources. To maximize the performance of such networks, interference related issues need to be considered. Channel assignment (CA) is one of the key techniques to overcome the performance degradation of a network caused by the interferences. To counter the interference issues, we propose a novel CA  technique which is based on link capacity, primary user activity and secondary user activity. These three parameters are fed to the proposed weightage decision engine to get the weight for each of the stated parameters. Thus, the link capacity based channel assignment (LCCA) algorithm is based on the weightage decision engine. The end-to-end delay, packet delivery ratio and the throughput is used to estimate the performance of the proposed algorithm. The numerical results demonstrate that the proposed algorithm is closer to the optimum resource utilization. 

DMT Optimal Cooperative MAC Protocols in Wireless Mesh Networks with Minimized Signaling Overhead

2013 ◽  
pp. 60-77
Author(s):  
Benoît Escrig
Keyword(s):  
Wireless Mesh Networks ◽  
Relay Selection ◽  
Mesh Networks ◽  
Selection Process ◽  
Wireless Channel ◽  
Splitting Algorithm ◽  
Wireless Mesh ◽  
Wireless Channel Models ◽  
Cooperative Mac ◽  
Selection Of

In this paper, a cooperative protocol is proposed for wireless mesh networks. Two features are implemented: on-demand cooperation and selection of the best relay. First, cooperation is activated by a destination terminal when it fails in decoding the message from a source terminal. Second, a selection of the best relay is performed when cooperation is needed. The robustness of wireless links are increased while the resource consumption is minimized. The selection of the best relay is performed by a splitting algorithm, ensuring a fast selection process, the duration of which is now fully characterized. Only terminals that improve the direct link participate in the relay selection and inefficient cooperation is avoided. The proposed protocol is demonstrated to achieve an optimal diversity-multiplexing trade-off. This study focuses on Nakagami- wireless channel models to encompass a variety of fading models in the context of wireless mesh networks.

Recent Trends in Channel Assignment Techniques in Wireless Mesh Networks

2020 ◽  
pp. 155-176
Author(s):  
D. Jasmine David ◽  
Jegathesan V. ◽  
T. Jemima Jebaseeli ◽  
Anand Babu Ambrose ◽  
Justin David D.
Keyword(s):  
Wireless Mesh Networks ◽  
Channel Assignment ◽  
Mesh Networks ◽  
Average Energy ◽  
Network Capacity ◽  
Residual Energy ◽  
Wireless Channel ◽  
Wireless Mesh ◽  
Single Radio ◽  
Average Energy Consumption

Wireless mesh networks have numerous advantages in terms of connectivity as well as reliability. Traditionally, the nodes in wireless mesh networks are equipped with a single radio, but the limitations are lower throughput and limited use of the available wireless channel. To overcome this, the recent advances in wireless mesh networks are based on a multi-channel multi-radio approach. Channel assignment is a technique that selects the best channel for a node or to the entire network just to increase the network capacity. To maximize the throughput and the capacity of the network, multiple channels with multiple radios were introduced in these networks. In this work, algorithms are developed to improve throughput, minimize delay, reduce average energy consumption, and increase the residual energy for multi-radio multi-channel wireless mesh networks.

Sign in / Sign up

Export Citation Format

Share Document