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.

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

2011 ◽  
Vol 1 (1) ◽  
pp. 56-72
Author(s):  
Benoît Escrig
Keyword(s):  
Wireless Mesh Networks ◽  
Relay Selection ◽  
Mesh Networks ◽  
Selection Process ◽  
Wireless Channel ◽  
Splitting Algorithm ◽  
On Demand ◽  
Wireless Mesh ◽  
Wireless Channel Models ◽  
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.

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.

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