A STUDY OF ROUTING METHODS IN URBAN WIRELESS MESH NETWORKS BASED ON REINFORCEMENT LEARNING

2021 ◽  
Author(s):  
В.Д. ФАМ ◽  
Р.В. КИРИЧЕК ◽  
А.С. БОРОДИН
Keyword(s):  
Artificial Intelligence ◽  
Reinforcement Learning ◽  
Simulation Model ◽  
Network Traffic ◽  
Mesh Networks ◽  
Mesh Network ◽  
Queueing Model ◽  
Traffic Routing ◽  
Wireless Mesh ◽  
Routing Methods

Приведены результаты исследования методов маршрутизации на основе обучения с подкреплением с помощью имитационной модели. Рассмотрена задача маршрутизации сетевого трафика для фрагмента ячеистой сети городского масштаба, управляемой на основе технологий искусственного интеллекта. Представлена модель системы массового обслуживания для изучения процесса маршрутизации, а также обучения выбора маршрута. Имитационная модель фрагмента ячеистой сети разработана в пакете Anylogic и обучается на основе платформы Microsoft Bonsai. The results of the study of network traffic routing methods based on reinforcement learning using a simulation model are presented. The problem of network traffic routing for a fragment of a city-scale mesh network, controlled on the basis of artificial intelligence technologies, is considered. The article presents a queueing model for studying the routing process, as well as learning how to choose a route. The mesh network fragment simulation model was developed in the Anylogic package and is trained on the basis of the Microsoft Bonsai platform.

COORDINATED DISTRIBUTED SCHEDULING IN WIRELESS MESH NETWORK

2012 ◽  
Vol 3 (3) ◽  
pp. 368-374
Author(s):  
Usha Kumari ◽  
Udai Shankar
Keyword(s):  
Network Performance ◽  
Mesh Networks ◽  
Mac Protocol ◽  
Scheduling Algorithm ◽  
Ieee 802.16 ◽  
Distributed Scheduling ◽  
Mesh Network ◽  
Fourth Generation ◽  
Network Nodes ◽  
Wireless Mesh

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

scholarly journals Context-Based Topology Control for Wireless Mesh Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-16
Author(s):  
Pragasen Mudali ◽  
Matthew Olusegun Adigun
Keyword(s):  
Topology Control ◽  
Wireless Mesh Network ◽  
Network Performance ◽  
Mesh Networks ◽  
Negative Impact ◽  
Mesh Network ◽  
Adjustment Process ◽  
Spatial Reuse ◽  
Test Bed ◽  
Wireless Mesh

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.

scholarly journals A Novel Packet Aggregation Mechanism for Enhancing VoIP Performance on IEEE 802.11 Wireless Mesh Networks

2020 ◽  
Vol 8 (8) ◽  
pp. 01-08
Author(s):  
Guan-Hsiung Liaw et al.
Keyword(s):  
Ieee 802.11 ◽  
Mesh Networks ◽  
Mesh Network ◽  
Time Intervals ◽  
Aggregation Mechanism ◽  
Packet Aggregation ◽  
Wireless Mesh ◽  
Aggregation Scheme ◽  
Voice Data ◽  
The Voice

In 802.11 Wireless Mesh Network (WMN), bandwidth will be wasted much for transferring VoIP flows since each voice frame must contain relatively large amount of protocol data. “Packet Aggregation” mechanism can be applied to merge the voice data of multiple VoIP flows into one frame for transmission. It reduces the waste on bandwidth and increases the maximum number of successful VoIP calls. In addition, the mechanism “MCF controlled channel access” (MCCA) defined in 802.11 standard can be used to obtain better QoS than adopting default EDCA mechanism. In MCCA, mesh stations which wants to transfer VoIP flows can reserve time intervals of the medium for transmission and this reservation will be advertised to their neighbors. It is why MCCA causes less medium contentions than EDCA. In this paper, a mechanism to transfer VoIP flows in IEEE 802.11 WMN by MCCA with packet aggregation scheme is proposed. The effectiveness of the proposed mechanism is shown by simulation results. In addition, the problem named as Routing-Packet Aggregation / De-aggregation-Scheduling optimization problem (abbr. RPADS problem) derived from the proposed mechanism is also studied. A heuristic algorithm for RPADS problem to maximize the total number of supported calls is also proposed.

scholarly journals PERFORMANCE ANALYSIS AND QOS FRAMEWORK OF FLY WİRELESS NETWORK

2019 ◽  
Vol 01 (02) ◽  
pp. 103-115
Author(s):  
Durai Pandian M
Keyword(s):  
Quality Of Service ◽  
Performance Analysis ◽  
Wireless Network ◽  
Wireless Mesh Network ◽  
Environmental Changes ◽  
Mesh Networks ◽  
Access Point ◽  
Mesh Network ◽  
Wireless Mesh

The spread out of wireless mesh network has made possible the extended range of communication network that are impractical due to environmental changes in a wired access point, these wireless mesh network does not require much competence to set it up as it can be set very fast at a cheap rate, and the conveyancing of messages in it happens by selecting the shortest path, these wireless mesh built-in with irrepressible and invulnerable identities come with an endurance to temporary congestion and individual node failure. This results in an architecture providing a better coverage, flaw indulgent with higher bandwidth compared to other wireless distributed systems. But faces the limitation on power conservation. The battery activated mesh nodes loses their resources on perception, processing and transmission of the data’s, though these batteries or accumulators comes with energy regaining capability still draw backs show up as their nature of energy regaining are unexposed. So the performance analysis of fly wireless network which proposes a uninterrupted wireless mesh networks aims at providing a best measure of performance that is the best quality of service on the meshwork by providing an improved energy gleaning using potency segregation (IGPS) which empowers each node to have self- contained accumulation of energy achieving heightened adaption with energy consumption kept at a minimum. The gross functioning of the proposed is examined on the bases of delay and packet loss to prove the quality of service acquired.

Preventing Wormhole Attacks in Wireless Mesh Networks

2013 ◽  
Vol 443 ◽  
pp. 440-445 ◽  
Author(s):  
Liang Yu Luan ◽  
Ying Fang Fu ◽  
Peng Xiao ◽  
Ling Xi Peng
Keyword(s):  
Mesh Networks ◽  
Attack Detection ◽  
Mesh Network ◽  
Detection Scheme ◽  
Wormhole Attack ◽  
Attack Model ◽  
Wireless Mesh ◽  
Wormhole Attacks ◽  
Wide Range ◽  
Identity Based

In a wireless mesh network, the need for cooperation among wireless nodes to relay each others packets exposes the network to a wide range of security threats. A particularly devastating type of threats is the so-called wormhole attacks. In order to defense against the attack, a type of wormhole attack model and a watch nodes-based wormhole attack detection scheme were presented in this paper. The scheme that is based on the combination of a number of techniques, such as distributed voting, watch nodes based detection and identity-based cryptosystem. Qualitative analysis and simulation show that the wormhole attack detection scheme is more advantageous over the some of the previous schemes in terms of performance and cost.

Deployment of a Wireless Mesh Network for Traffic Control

2012 ◽  
pp. 290-310
Author(s):  
Kun-chan Lan ◽  
Zhe Wang ◽  
Mahbub Hassan ◽  
Tim Moors ◽  
Rodney Berriman ◽  
...  
Keyword(s):  
Traffic Control ◽  
Network Architecture ◽  
Wireless Mesh Network ◽  
Critical Infrastructure ◽  
Mesh Networks ◽  
New Technology ◽  
Mesh Network ◽  
Traffic Light ◽  
Wireless Mesh ◽  
Communication Needs

Wireless mesh networks (WMN) have attracted considerable interest in recent years as a convenient, new technology. However, the suitability of WMN for mission-critical infrastructure applications remains by and large unknown, as protocols typically employed in WMN are, for the most part, not designed for real-time communications. In this chapter, the authors describe a wireless mesh network architecture to solve the communication needs of the traffic control system in Sydney. This system, known as SCATS and used in over 100 cities around the world — from individual traffic light controllers to regional computers and the central TMC —places stringent requirements on the reliability and latency of the data exchanges. The authors discuss experience in the deployment of an initial testbed consisting of 7 mesh nodes placed at intersections with traffic lights, and share the results and insights learned from measurements and initial trials in the process.

A Framework for External Interference-Aware Distributed Channel Assignment

2013 ◽  
pp. 293-307
Author(s):  
Felix Juraschek ◽  
Mesut Günes ◽  
Bastian Blywis
Keyword(s):  
Channel Assignment ◽  
Network Performance ◽  
Mesh Networks ◽  
Radio Channel ◽  
Radio Spectrum ◽  
Mesh Network ◽  
Wireless Devices ◽  
External Interference ◽  
Wireless Mesh ◽  
Assignment Algorithm

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.

Using Wireless Mesh Network for Traffic Control

2010 ◽  
pp. 331-347 ◽  
Author(s):  
Kun-Chan Lan
Keyword(s):  
Traffic Control ◽  
Network Architecture ◽  
Wireless Mesh Network ◽  
Mesh Networks ◽  
Great Majority ◽  
Mesh Network ◽  
Traffic Light ◽  
Available Bandwidth ◽  
Wireless Mesh ◽  
Communication Needs

Wireless mesh networks (WMN) have attracted considerable interest in recent years as a convenient, flexible and low-cost alternative to wired communication infrastructures in many contexts. However, the great majority of research on metropolitan-scale WMN has been centered around maximization of available bandwidth, suitable for non-real-time applications such as Internet access for the general public. On the other hand, the suitability of WMN for missioncritical infrastructure applications remains by and large unknown, as protocols typically employed in WMN are, for the most part, not designed for realtime communications. In this chapter, we describe a real-world testbed, which sets a goal of designing a wireless mesh network architecture to solve the communication needs of the traffic control system in Sydney, Australia. This system, known as SCATS (Sydney Coordinated Adaptive Traffic System) and used in over 100 cities around the world, connects a hierarchy of several thousand devices -- from individual traffic light controllers to regional computers and the central Traffic Management Centre (TMC) - and places stringent requirements on the reliability and latency of the data exchanges. We discuss some issues in the deployment of this testbed consisting of 7 mesh nodes placed at intersections with traffic lights, and show some results from the testbed measurements.

QoS-Aware Service Selection and Multicast Framework for Wireless Mesh Networks

2016 ◽  
Vol 12 (1) ◽  
pp. 1-15 ◽  
Author(s):  
A. Narayana Rao ◽  
Ch. D. V. Subba Rao
Keyword(s):  
Data Transmission ◽  
Mesh Networks ◽  
Service Selection ◽  
Video Data ◽  
Mesh Network ◽  
Delivery Ratio ◽  
Wired Networks ◽  
Wireless Mesh ◽  
Security And Reliability ◽  
Effective Path

Wireless Mesh Network (WMN) is a multi-hop, multi-path network that has become the most favored method in delivering end-to-end data, voice and video. Data transmission through WMN has the security and reliability, same as the conventional wired networks. Since, WMN has a decentralized topology, maintaining QoS is very crucial. Hence in this work, we propose to develop a WMN that selects services based on high QoS. In order to avoid redundancy in data transmission, in this work we propose to develop an efficient framework for multicasting by determining the most effective path for transmitting the same data towards multiple destination nodes. By simulation results, we show that the proposed technique provides better QoS in terms of throughput and packet delivery ratio.

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.

Sign in / Sign up

Export Citation Format

Share Document