DonNTU |
Master's portal |
About me |
Relevance
Modern wireless networks are the best solution for the organization of access by the characteristics of speed and cost of
installation, simplicity of new users connection, dependence of surroundings etc. The usage of wireless technologies time by
time is becoming more common way of organization of access to Internet or to corporate, campus and private LANs.
The problem of a mobile user access is rather new, but nevertheless very important one. Today millions of people travel, take
a voyage or a business trip and need access to their e-mail or file server.
The question of protocol and standard compatibility is very actual when building wireless networks. This work is to overview
the questions of wireless network protocols optimization, upgrading their speed and safety of data interchange. Also main tasks
of optimal protocols creation in these networks are introduced.
Scientific importance
The development of data interchange radio networks is nowadays one of the most important parts one among the technical
progress tasks. In the first hand these systems are to provide wireless access to the network providers for the mobile abonents
as well as stationary, when cable infrastructure is technically difficult to install or is economically improfitable.
The quantity of published works in Russian and Ukrainian reviewing wireless routing protocols is very small while in English this
theme is richly introduced. This work has to contribute to overcoming the gap and to the optimization of existing routing methods
using the example of the proposed alternative algorithm.
The routing in wireless networks has its particular features. The fixed infrastructure is usually a weak spot here because of constraints
for data interchange. So, mobile devices are to manage connections autonomously, thus doing the functions of a router. Such
networks are called MANET (mobile ad hoc networks).
The MANET routing protocols are divided into two groups: tabledriven/proactive routing protocols and on-demand/reactive routing
protocols. The peculiarity of the first group members is that peers all the time gather new information about its state, changing it with
their neighbors. The main proactive protocols are TBRPF (Topology Dissemination Based on Reverse-Path Forwarding ), OLSR
(optimized link state routing), DSDV (Highly Dynamic Destination-Sequenced Distance-Vector Routing).
In the reactive protocols a peer is seeking the way to the point of destination only when it's needed. There are two main operations: search
of the route and route support. The main reactive protocols are Основные реактивные протоколы: DSR (Dynamic Source Routing
protocol), AODV (Ad Hoc On-Demand Distance Vector), DYMO (Dynamic MANET On-demand).
So, the question of adaptive routing in wireless networks is intensely studied and researched. The development of wireless routing protocols is going to the direction of traffic control
decentralization and hybridization as a result of attempts of uniting various approaches. Today the complication of network infrastructure goes faster than the
process of standardization, so certain new protocols haven't yet been accepted.
This work introduces an optimized solution - alternate routing algorithm, developed on the base of existing algorithms. It is using the principles of the shortest path building that are
used in Dijkstra's and Bellman-Ford algorithms and methods of average delay calculation that are common for packet wireless networks.
The functional flow block of algorithm is shown on the picture. It includes the following parts:
1. The block of definition of optimal capacities.
2. The block of analysis of average delay.
3. The block of route definition.
4. The block of possible flow building.
5. The block of minimization of average delay.
6.Main body of the algorithm.
The following tasks are to be solved by the algorithm:
1) the most efficient usage of channels;
2) meeting the demands for data interconnection parameters.
About me |