PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  routing algorithms
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available ROUTE4ALL: a novel approach to pedestrian navigation for people with special needs
Bureš P., Balata J., Mulickova E.
Archives of Transport System Telematics
|
2017
|
Vol. 10, iss. 1
9--16
EN
Within ROUTE4ALL project we created an extended data model of geographical information database suitable for navigation of people with special needs as well as of general population. Moreover, we provide a methodology for its interpretation and a guide for its implementation into navigation devices. The results of the project could be used by navigation device developers for creating a fully-fledged navigation for people with special needs. First, we describe the requirements for the extended data model, which rise from the research we conducted with people with special needs and from the survey of existing solutions. Second, we introduce a catalogue of geographic elements, their attributes and relationships. Finally, we discuss its benefits over the traditional approaches.
2
Content available remote Performance Evaluation of routing algorithms used in largescale WSN: A Step Towards A Smart City
Lavric A., Popa V.
Przegląd Elektrotechniczny
|
2015
|
R. 91, nr 8
96--100
PL
W artykule zaprezentowano algorytm routingu w sieci WSN wykorzystywanej jako element koncepcji Smart City. Analizowano algorytmy Flooding, Probabilistic Broadcast oraz Convergecast. Do analizy wykorzystano platformę symulacyjną Omnet++ 4.3 oraz MiXiM. Stwierdzono że najlepsze właściwości ma algorytm Flooding. Z punktu widzenia liczby otrzymywanych pakietów najlepszą przepustowość miał algorytm Convergecast.
EN
This paper presents the performance evaluation of the routing algorithms found in WSN networks that can be used as part of the Smart City concept, in order to identify the best candidate. The first part of the paper consists in a brief summary of the main routing techniques and mechanisms used in large scale WSN networks, while the second part of the paper will comprise an analysis of the Flooding, Probabilistic Broadcast and Convergecast algorithms. The performance evaluation consisted in a series of simulations, by means of the Omnet++ 4.3 simulation framework and the MiXiM framework. The obtained results show that, in terms of the latency parameters, the highest performance level is ensured by the Flooding routing mechanism, followed by the Convergecast and the Probabilistic Broadcast algorithms. In terms of the number of received packets, the highest throughput is provided by the Convergecast routing algorithm.
3
Content available Routing flow-shop with buffers and ready times - comparison of selected solution algorithms
Józefczyk J., Markowski M., Balgabaeva L.
Management and Production Engineering Review
|
2014
|
Vol. 5, No. 4
26--35
EN
This article extends the former results concerning the routing flow-shop problem to minimize the makespan on the case with buffers, non-zero ready times and different speeds of machines. The corresponding combinatorial optimization problem is formulated. The exact as well as four heuristic solution algorithms are presented. The branch and bound approach is applied for the former one. The heuristic algorithms employ known constructive idea proposed for the former version of the problem as well as the Tabu Search metaheuristics. Moreover, the improvement procedure is proposed to enhance the quality of both heuristic algorithms. The conducted simulation experiments allow evaluating all algorithms. Firstly, the heuristic algorithms are compared with the exact one for small instances of the problem in terms of the criterion and execution times. Then, for larger instances, the heuristic algorithms are mutually compared. The case study regarding the maintenance of software products, given in the final part of the paper, illustrates the possibility to apply the results for real-world manufacturing systems.
4
Content available Metoda zrównoważonego zużycia energii w bezprzewodowej sieci pomiarowejEnergy balanced method in wireless sensor network
Boniewicz M., Zieliński M.
Pomiary Automatyka Kontrola
|
2013
|
R. 59, nr 5
434--436
PL
W artykule przedstawiono metodę zrównoważenia zużycia energii w bezprzewodowej sieci pomiarowej. W przypadku rozwiązań bezprzewodowych istotnymi aspektami są zużycie energii oraz zrównoważenie zużycia energii. Opisano metody i wyniki symulacji pracy sieci przy klasycznym rozwiązaniu oraz przy zastosowaniu opracowanej metody. Wykazano czterokrotne zmniejszenie rozrzutu energii w sieci przy niewielkim wzroście łącznego zużycia energii. Opracowane rozwiązanie jest testowane na prototypowej sieci pomiarowej.
EN
In this paper there is described the routing algorithm for wireless sensor networks. Energy consumption is very important for self-powered radio nodes. But in some applications energy balancing is more important. Wireless sensor networks used in large areas like farmlands or warehouses consist of hundreds of nodes. In classic methods routing is directed to short time of transmission or low energy consumption. But unbalanced energy consumption can often cause unpredictable failures because of lack of energy in frequently used nodes. Energy balancing prevents this behavior by dynamic bypassing the used nodes. The paper presents five methods for reducing energy consumption and a new method for energy balanced routing. The advantages and disadvantages of the methods are de-scribed. Fig. 1 shows the algorithm diagram. The performed simulations show almost four times smaller energy consumption deviation than the deviation in classic routing method. The energy balancing can be improved by changing the sequence of transmis-sion.
5
Content available remote The Application of K–Shortest Path Algorithm in Multicast Routing
Stasiak M., Piechowiak M., Zwierzykowski P.
Theoretical and Applied Informatics
|
2009
|
Vol. 21, No. 2
69-82
EN
There have been many heuristic algorithms finding multicast trees proposed over the past few years. The necessity for finding a better and more suitable algorithm is still a current and important challenge. The article presents a new multicast routing algorithm for finding a multicast tree in packet networks. The objective of the K-Shortest Path Multicast Algorithm (KSPMA) is to minimize the cost of paths between the source and each destination node using a generalized Dijkstra’s algorithm that would comply with maximum delay bound along each path. A wide range of simulation research carried out by the authors for many network topologies and parameters has confirmed the effectiveness of the proposed algorithm.
PL
W artykule zaproponowano nowy algorytm routingu dla połączeń rozgałęzionych. Prezentowany algorytm stosuje algorytm K–najkrótszych ścieżek do wyznaczenia ścieżek o minimalnych kosztach pomiędzy węzłem źródłowym, a każdym z węzłów docelowych, z uwzględnieniem maksymalnej dopuszczalnej wartości opóźnienia (c) wzdłuż każdej ścieżki. Algorytm KSPMA został przebadany symulacyjnie biorąc pod uwagę parametry określające zarówno struktura, jak i właściwości sieci. Badania przeprowadzono wykorzystując topologie sieci wygenerowane metodami Waxmana [2] oraz Barabasi-Alberta [24]. W symulacjach zbadano również efektywność algorytmu w funkcji podstawowych parametrów sieci tj. liczba węzłów sieci, liczność grupy odbiorców, średni stopień grafu (węzła) oraz maksymalne opóźnienie wzdłuż ścieżki. W badaniach uwzględniono także średnie koszty ścieżek uzyskane po zastosowaniu algorytmów CSPT, KPP oraz LDC. Liczne doświadczenia symulacyjne przeprowadzone przez autorów potwierdziły efektywność proponowanego algorytmu KSPMA.
6
Content available remote Genetic routing algorithm for multicast connections in packet networks
Chojnacki A., Piechowiak M., Zwierzykowski P.
Image Processing & Communications
|
2008
|
Vol. 13, no 1-2
13-20
EN
The article analyzes and explores the influence of different genetical solutions on the efficiency and effectiveness of the performance of genetic algorithms for multicast routing. The results of the simulation studies were compared with the results obtained with the application of classic heuristics, i.e. (KPP [12], CSPT [5] and LD). The tests were carried out for a wide range of parameters defining properties and characteristics of test networks topologies. The simulation study takes into consideration topology generation methods in line with the Waxman model and the Barabasi-Albert model.
7
Efficiency analysis of multicast routing algorithms in large networks
Piechowiak M., Zwierzykowski P.
Poznan University of Technology Academic Journals. Electrical Engineering
|
2007
|
No 54
173-180
EN
The paper presents the research results of multicast heuristic algorithms. The paper is an extension of previous publications presented in [1.2] that discussed small network structures reflecting the real Internet topology. The paper approaches basic methods of generating the Internet topology - Waxman method and Barabasi-Albert method. Performance study of multicast trees constructed by the algorithms is carried out and analysed.
8
Content available remote Comparative evaluation of distributed Bandwidth Broker
Żmudziński P., Piechowiak M.
Image Processing & Communications
|
2006
|
Vol. 11, no 1
59-69
EN
The Differentiated Services (DS) framework is one of the basic architectures that have been proposed for provision in the Internet. One of the most significant advantages of DS is ability to distinguish management plane of the network to provide the customer Quality of Service. A DS architecture proposed by IETF alone is not sufficient to address the end-to-end guaranties in a network layer but it does show great potential for scalability. To fulfill negotiated QoS services Bandwidth Broker - an additional management entity, has to be implemented. The main tasks of the Broker are: limiting the traffic volume carried through the managed domain and services nego-tiation on behalf of domain with customers and adjacent brokers. The authors concentrated on the concept of distributed Broker as a more scalable and efficient solution. The different bandwidth allocation scenarios are presented and compared with regard to signaling overhead, admission control delay and control complexity. The quota-based admission control algorithm has been briefly described and discussed. The new style of reservation has been proposed to decrease the amount of signaling traffic between core and edge routers. The example of its functioning has been given at the end of the presented paper.
9
Content available On the connections between optimal control, regulation and dynamic network routing
Karbowski A.
Journal of Telecommunications and Information Technology
|
2003
|
nr 3
67-72
EN
The paper is devoted to studying general features of dynamic network routing problems. It is shown that these problems may be interpreted as receding horizon optimal control problems or simply regulation problems. In the basic formulation it is assumed, that the nodes have no dynamics and the only goal of the optimization mechanism is to find the shortest paths from the source to the destination nodes. In this problem the optimization mechanism (i.e. the Bellman-Ford algorithm) may be interpreted as a receding horizon optimal control routine. Moreover, there is one-toone correspondence between the Bellman optimal cost-to-go function in the shortest path problem and the Lyapunov function in the regulation problem. At the end some results of the application of the routing optimization algorithm to an inverted pendulum regulation problem are presented.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.