COORDINATED DISTRIBUTED SCHEDULING IN WIRELESS MESH NETWORK

2012 ◽  
Vol 3 (3) ◽  
pp. 368-374
Author(s):  
Usha Kumari ◽  
Udai Shankar

IEEE 802.16 based wireless mesh networks (WMNs) are a promising broadband access solution to support flexibility, cost effectiveness and fast deployment of the fourth generation infrastructure based wireless networks. Reducing the time for channel establishment is critical for low latency/interactive Applications. According to IEEE 802.16 MAC protocol, there are three scheduling algorithms for assigning TDMA slots to each network node: centralized and distributed the distributed is further divided into two operational modes coordinated distributed and uncoordinated distributed. In coordinated distributed scheduling algorithm, network nodes have to transmit scheduling message in order to inform other nodes about their transfer schedule. In this paper a new approach is proposed to improve coordinated distributed scheduling efficiency in IEEE 802.16 mesh mode, with respect to three parameter Throughput, Average end to end delay and Normalized Overhead. For evaluating the proposed networks efficiency, several extensive simulations are performed in various network configurations and the most important system parameters which affect the network performance are analyzed

2016 ◽  
Vol 2016 ◽  
pp. 1-16
Author(s):  
Pragasen Mudali ◽  
Matthew Olusegun Adigun

Topology Control has been shown to provide several benefits to wireless ad hoc and mesh networks. However these benefits have largely been demonstrated using simulation-based evaluations. In this paper, we demonstrate the negative impact that the PlainTC Topology Control prototype has on topology stability. This instability is found to be caused by the large number of transceiver power adjustments undertaken by the prototype. A context-based solution is offered to reduce the number of transceiver power adjustments undertaken without sacrificing the cumulative transceiver power savings and spatial reuse advantages gained from employing Topology Control in an infrastructure wireless mesh network. We propose the context-based PlainTC+ prototype and show that incorporating context information in the transceiver power adjustment process significantly reduces topology instability. In addition, improvements to network performance arising from the improved topology stability are also observed. Future plans to add real-time context-awareness to PlainTC+ will have the scheme being prototyped in a software-defined wireless mesh network test-bed being planned.


Author(s):  
Felix Juraschek ◽  
Mesut Günes ◽  
Bastian Blywis

DES-Chan is a framework for experimentally driven research on distributed channel assignment algorithms in wireless mesh networks. DES-Chan eases the development process by providing a set of common services required by distributed channel assignment algorithms. A new challenge for channel assignment algorithms are sources of external interferences. With the increasing number of wireless devices in the unlicensed radio spectrum, co-located devices that share the same radio channel may have a severe impact on the network performance. DES-Chan provides a sensing component to detect such external devices and predict their future activity. As a proof of concept, the authors present a reference implementation of a distributed greedy channel assignment algorithm. The authors evaluate its performance in the DES-Testbed, a multi-transceiver wireless mesh network with 128 nodes at the Freie Universität Berlin.


2017 ◽  
Vol 67 (5) ◽  
pp. 581
Author(s):  
Sidharth Shukla ◽  
Vimal Bhatia

<p>Wireless mesh networks (WMN) are the networks of future and can operate on multiple protocols ranging from WiFi, WiMax to long term evolution (LTE). As a recent trend defence networks are incorporating off-the-shelf, state of the art commercial protocols to enhance the capability of their networks. LTE is one such commercially available protocol which is easy to deploy and provide high data rate which can be ideally implemented in WMN for defence networks. To enable these high data rate services LTE-based defence mesh networks (DMN) are the requirement of the day and future. However, LTE-based DMN are prone to congestion at times of active operations or full-fledged war. The congestion scenarios may lead to LTE packet loss. Hence, it is pertinent that these networks amalgamate information grooming algorithms to alleviate the throughput of the network in peak hour conditions. An efficient priority scheduling algorithm based on class of service prioritisation, data rate consumption and location of origin of traffic in the DMN is proposed. The simulations demonstrate that by incorporating the proposed priority scheduling algorithm, the overall packet loss of priority packets in the DMN reduces substantially.</p>


2013 ◽  
Vol 392 ◽  
pp. 872-875 ◽  
Author(s):  
Gu Jia ◽  
Yu Wen Wang ◽  
Fan Ji Meng ◽  
Guo Hua Ye ◽  
Guo Lin Wang

The media access control (MAC) protocol based on fixed slot allocation has low throughput and high delay in high load wireless mesh network. In order to improve the performance of wireless mesh network, we propose a scalable adaptive time division multiple access (TDMA) slot allocation algorithm based on the existing fixed TDMA. The algorithm uses the network structure of clustering and builds a more optimized frame structure, cluster head dynamically allocates time slot according to the packet number of the cluster member sent and the priority level, at the same time taking into account the situation of nodes joining and leaving to improve the scalability of the network The simulation results on OPNET network simulation platform show that the algorithm is superior to fixed TDMA algorithm in both throughput and delay.


Author(s):  
Mohammad Khalaf Rahim Al-juaifari ◽  
Hussain Mumtaiz Alshamy ◽  
Noor Hassan Abed Khammas

Energy consumption of wireless network communication is still a big issue and a lot of research papers have proposed many solutions to increase node life time. The WMN architecture is made up of a fixed and mobile component, whereas the wireless mesh networks (WMNs) are multi-hop wireless networks with instant deployment, self-healing, self-organization and self-configuration features. The reduction in the distance by a factor of two can result in at least four times more powerful signals at the receiver. This paper presents suggestions that the links are more reliable without the increase in power of the transmitter in individual nodes. As a result, the present simulations networks are nine mobile nodes for considering coverage issues of the service area. The analytic results show that the link power node for direct communication between two nodes with long distance consuming more power than it is cleared. The improvement in the network performance for maintaining is available and this solution can be used to implement mobility in such case with low power region for the wireless mesh networks.


2021 ◽  
Author(s):  
Amir Esmailpour

Recently Wireless Mesh Network (WMN) has become popular especially for its low cost deployment in the areas of poor network infrastructure and terrain of difficult deployment. Although paths in WMN backbone network are stable, the access link contention can severely constrain the end-to-end throughput. We proposed an integrated routing system for WMN that exploits both paths through the backbone network and through the ad-hoc access network of mobile nodes. The ad-hoc path is considered as an alternative path and is used only when the primary backbone path is severely constrained due to access links contention. We have shown through simulation that alternative path is effective in delivering higher throughput in that situation. We also proposed a scheme for initiating the route discovery of the ad-hoc path. The main contributions of this thesis are two algorithms that allow the mobile node to evaluate the throughput of the backbone and ad-hoc paths, and to make a decision of taking one path. The proposed algorithms are implemented in OPNET simulator, and network performance is studied under variety of conditions.


Author(s):  
Felix Juraschek ◽  
Mesut Günes ◽  
Bastian Blywis

DES-Chan is a framework for experimentally driven research on distributed channel assignment algorithms in wireless mesh networks. DES-Chan eases the development process by providing a set of common services required by distributed channel assignment algorithms. A new challenge for channel assignment algorithms are sources of external interferences. With the increasing number of wireless devices in the unlicensed radio spectrum, co-located devices that share the same radio channel may have a severe impact on the network performance. DES-Chan provides a sensing component to detect such external devices and predict their future activity. As a proof of concept, the authors present a reference implementation of a distributed greedy channel assignment algorithm. The authors evaluate its performance in the DES-Testbed, a multi-transceiver wireless mesh network with 128 nodes at the Freie Universität Berlin.


Sign in / Sign up

Export Citation Format

Share Document