Approach to a Message Routing for Wireless Mesh Networks with a Rapidly Changing Topology

Anton S Churaev,Konstantin S Zaytsev

doi:10.5539/mas.v8n6p178

Abstract

A development of the major part of economy branches nowadays is provided through the wide scale adaptation of social networks, which are capable of connecting resources of both legal persons and physical persons. That trend requires a developed infrastructure based on new solutions for the aggregation of mobile devices in a so called wireless mesh networks. One of the central tasks of that aggregation is message routing in networks with a rapidly changing topology. The purpose of the presented paper is an attempt to analyze the main message routing algorithms in wireless networks with respect to mesh networks with rapidly changing topology, and to make recommendations for their improvement and development. As the primary reason, which prevents the achievement of a quality routing in networks with a rapidly changing topology, the instability of links between network nodes is considered. For the assessment of quality of channels between nodes, the implementation of following parameters is proposed: package transmission delay, available network capacity and time of life of a communication channel, which can be easily adjusted by empirically-selectable threshold values. For the solution of the task of message routing of wireless mesh networks with a rapidly changing topology, a criteria is proposed which implements weighted values of proposed parameters. The selection of threshold values of parameters and their weights in order to calculate criterion expression is the important part of a network design, and depends on its expected work characteristics.

Highlights

Wireless Mesh network (WMN) can be perceived in a similar way as a society, in which communication –information transfer is not occurring centrally, but directly from one member of society to another (Bоkhаri and Zаrubа, 2012)
All designed routing algorithms are divided into reactive, which lay a route for the package of data from a source node to a destination node only at the time when they send a package (Cisco Guide, 2014), proactive, supporting reachability tables of senders and recipients by permanent background exchanges of information about alterations in a network topology between nodes (Jасquet, 2001), and hybrid (Lumpur, 2012, Lyahov et al, 2012), in which, generally, an initial network is divided into subnets; inside each of them exist proactive algorithms, and interaction between subnets is provided by reactive methods
Instability of links between nodes is the main reason which is not allowing to achieve a quality routing in networks with a rapidly changing topology, using all algorithms described above

Summary

Introduction

Wireless Mesh network (WMN) can be perceived in a similar way as a society, in which communication –information transfer is not occurring centrally, but directly from one member of society to another (Bоkhаri and Zаrubа, 2012). All designed routing algorithms are divided into reactive, which lay a route for the package of data from a source node to a destination node only at the time when they send a package (Cisco Guide, 2014), proactive, supporting reachability tables of senders and recipients by permanent background exchanges of information about alterations in a network topology between nodes (Jасquet, 2001), and hybrid (Lumpur, 2012, Lyahov et al, 2012), in which, generally, an initial network is divided into subnets; inside each of them exist proactive algorithms, and interaction between subnets is provided by reactive methods. With the increase of changes of speed in the topology of a network, the effectiveness of the operation of reactive and proactive algorithms is decreasing rapidly. Because cached routes of a package transport quickly become obsolete due to the destruction of their constituent links, resulting in a need for the frequent rearrangement of acceptable routes, and as a consequence, to bigger delays in data delivery.

Methods

Results

Discussion

Conclusion