Wyniki wyszukiwania - BazTech

1

Lightweight hybrid cryptography algorithm for wireless body area sensor networks using cipher technique

Raziq Aizaz, Qureshi Kashif Naseer, Yar Asfand, Ghafoori Kayhan Zrar, Jeon Gwanggil

Computer Assisted Methods in Engineering and Science

|

2024

|

Vol. 31, no. 2

213--240

EN

Wireless Body Area Networks (WBANs) are based on connected and dedicated sensor nodes for patient monitoring in the healthcare sector. The sensor nodes are implanted inside or outside the patient’s body for sensing the vital signs and transmitting the sensed data to the end devices for decision-making. These sensor nodes use advanced communication technologies for data communication. However, they have limited capabilities in terms of computation power, battery life, storage, and memory, and these constraints make networks more vulnerable to security breaches and routing challenges. Important and sensitive information is exchanged over an unsecured channel in the network. Several devices are involved in handling the data in WBANs, including sink nodes, coordinator, or gateway nodes. Many cryptographic schemes have been introduced to ensure security in WBANs by using traditional confidentiality and key-sharing strategies. However, these techniques are not suitable for limited resource-based sensor nodes. In this paper, we propose a Lightweight Hybrid Cryptography Algorithm (LWHCA) that uses cryptographicbased techniques for WBAN networks to improve network security, minimize network overhead and delay issues, and improve the healthcare monitoring processes. The proposed solution is evaluated in a simulation scenario and compared with state-of-the-art schemes in terms of energy consumption, and ciphertext size.

2

An algorithm for garbage truck routing in cities with a fixation on container filling level

Oliskevych Myroslav, Danchuk Victor

Transport Problems

|

2023

|

T. 18, z. 1

75--87

EN

An algorithm for optimizing the routes of a set of vehicles used for the collection and removal of municipal solid waste in a metropolis is proposed. The algorithm eliminates the problem of applying heuristic methods for multi-agent optimization, which is NP non-deterministic polynomial-time-hard. The application of the algorithm leads to a guaranteed exact solution. Through the application of restrictions on the carrying capacity of vehicles, the size of the input matrix representing the transport network can be reduced to an adequate size. This process uses statistical information about the filling levels of container waste bins. The algorithm is applied to an example of two megacities. The shortest routes are built for different numbers of points (from 12 to 72) on the route. The dependence of the total mileage on the number of involved vehicles is studied.

3

Optymalizacja energetyczna szkieletu sieci z użyciem bypassów optycznych

Ząbek Wojciech, Jurkiewicz Piotr, Wójcik Robert, Domżał Jerzy

Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne

|

2023

|

nr 4

248--251

PL

Zaproponowane rozwiązanie przedstawia efektywne wykorzystanie optycznych zasobów sieciowych. Wykorzystuje w tym celu dobowe zmiany obciążenia sieci. Polega na częściowym wyłączaniu niewykorzystanych zasobów, z zachowaniem wymaganej przepływności sieci. Połączenia optyczne tworzone są tylko tam, gdzie są konieczne. Prezentowany mechanizm prowadzi do znacznego zmniejszenia zużycia energii elektrycznej, a jednocześnie nie powoduje degradacji przenoszonego ruchu.

EN

The proposed solution shows efficient use of network optical resources. For this purpose, it uses daily network load changes. It consists in partial shutdown of unused resources, while maintaining the required network capacity. Connections are made only where necessary. The presented mechanism leads to a significant reduction in power consumption, and at the same time does not degrade the transferred traffic.

4

Powojenne przekształcenia komunikacyjnej sieci śródmieścia Warszawy w latach 1945-1975. Problemy trasowania nowych arterii samochodowych w zderzeniu z ocalałym, zabytkowym układem urbanistyczno-architektonicznym

Wagner Agata

Zeszyty Naukowe Politechniki Poznańskiej. Architektura, Urbanistyka, Architektura Wnętrz

|

2022

|

Z. 11

95--108

PL

Na przykładzie trzech śródmiejskich arterii w Warszawie: Trasy W-Z (z lat 40. XX w.), południowego odcinka Marszałkowskiej (z lat 50. XX w.) oraz Trasy Łazienkowskiej (lata 60. - projekt, lata 70. XX w. - realizacja) przedstawiony został problem trasowania połączeń komunikacyjnych w istniejącej tkance miejskiej. Przedziały czasowe i skala przekształceń pozwalają na spojrzenie na problematykę trasowania nowych arterii komunikacyjnych nie tylko pod kątem rozwiązań usprawniających ruch kołowy w mieście, ale i zmieniającego się podejścia do architektury historycznej w zderzeniu z potrzebą modernizacji przestrzeni śródmiejskich.

EN

Using the example of three inner-city transport arteries in Warsaw: the W-Z route (from the 1940s), the southern section of the Marszałkowska (from the 1950s) and the Łazienkowska route (from the 1960s - project and 1970s - realisation), the problem of transport links in the existing urban fabric was shown. The time frame and scale of the changeover provide an insight into the problem of laying new arteries, not only in terms of solutions to improve urban transport but also in terms of the changing approach to historical architecture, in case of collision with the need to modernise the inner-city area.

5

Determination of optimised pick-up and drop-off locations in transport routing - a cost distance approach

Hahn Armin, Frühling Wiard, Schlüter Jan

Transport Problems

|

2022

|

T. 17, z. 1

17--28

EN

With the emergence of dynamic passenger transport systems, such as demand-responsive transport (DRT) and ride-sharing without predetermined stop locations as used for static bus routes, accurate routing for these flexible door-to-door transport services is needed. Routing between two addresses requires the assignment of addresses to suitable, so-called snapping points as reference points on the road network. Therefore, many conventional routing machines use perpendicular distance to identify the nearest point on the road network. However, this technique tends to produce inaccurate results if the access to a building is not reachable from the road segment with the shortest perpendicular distance. We provide a novel approach to identify the access to buildings (paths) based on remote sensing data to obtain more reasonable stop locations for passenger transport. Multispectral images, OpenStreetMap data, and light detection and ranging (LiDAR) data were used to perform a cost distance analysis based on vegetation cover, building footprints, and the slope of the terrain to identify such optimised stop locations. We assumed that the access to buildings on the shortest route to the building’s entrance consists of little vegetation cover and minimal slope of the terrain; furthermore, the calculated path should not cross building footprints. Thus, snapping points on the road network can be determined based on the most likely path between a building and the road network. We validated our results based on a predetermined ideal snapping area considering different weightings for the parameters slope, vegetation, and building footprints. The results were compared with a conventional routing machine that uses perpendicular distance. This routing machine shows a validation rate of 81.4%, whereas the validation rate of our presented approach is as high as 90.3%. This new approach provides increased accuracy and better comfort for flexible passenger transport systems.

6

Mechanizm zestawienia ścieżek optycznych typu bypass w sieciach IP/EON

Biernacka Edyta, Domżał Jerzy

Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne

|

2022

|

nr 4

282--285

PL

Artykuł przedstawia analizę wydajności autorskiego mechanizmu zestawienia dodatkowych ścieżek (zwanych bypass) w sieciach wielowarstwowych złożonych z warstwy wirtualnej (IP) oraz z warstwy elastycznej sieci optycznej (EON). Zaproponowano współczynnik wykorzystania zasobów podczas ich dynamicznej alokacji dla mechanizmu bypass. Przeprowadzono eksperymenty symulacyjne dla dwóch topologii sieci oraz uwzględniono dwie klasy ruchu. Wyniki potwierdzają wysoką wydajność zaproponowanego mechanizmu z uwzględnieniem priorytetyzacji ruchu.

EN

The article presents an analysis of the efficiency of the proprietary mechanism of setting up additional paths (called bypass) in multilayer networks composed of a virtual layer (IP) and a layer of elastic optical network (EON). The resource utilization ratio was proposed during its dynamic allocation for the bypass mechanism. Simulation experiments were conducted for two network topologies and two classes of traffic were taken into account. The results confirm the high efficiency of the proposed mechanism, taking into account traffic prioritization.

7

Analiza porównawcza środowisk emulacyjnych Kathará i Netkit

Kurczab Krzysztof, Kosek-Szott Katarzyna

Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne

|

2022

|

nr 4

250--253

PL

Artykuł zawiera analizę porównawczą dwóch środowisk, Netkit oraz Kathará, pozwalających na emulację sieci teleinformatycznych złożonych z routerów i stacji końcowych wyposażonych w system operacyjny Linux. W artykule przedstawiono główne zalety jakimi cechuje się każde z tych środowisk oraz różnice jakie ich dzielą. Analiza wyników z przeprowadzonych badań koncentruje się na szybkości działania obu środowisk, sposobie zarządzania demonami routingu oraz poprawności wpisów w tablicach routingu.

EN

The article presents a comparative analysis of two environments, Netkit and Kathará, which enable emulation of ICT networks composed of Linux routers and client stations. The article discusses the main advantages and disadvantages of each environment. The analysis of the gathered results concentrates on the operation speed, management of routing daemons, and the correctness of routing table entries.

8

Simulation study on a warehouse picking process taking into account a predetermined order of further goods loading

Guerrero-Moreno Blanca Maria

Journal of TransLogistics

|

2022

|

Vol. 8, nr 1

25-39

EN

In this article, the results of a series of selected algorithms used during the picking of goods in a warehouse, assuming the order of stacking goods in transport containers is predetermined, are analysed, simulated and evaluated. The importance of the development of this type of algorithms is the possibility of reducing the waiting time of both transport and goods in order to reduce the total cost of the picking process. Afterwards, the results will be analysed by varying the parameters and evaluating the solutions. The aim is to show the results of various picking algorithms when their subsequent stacking order is predetermined, and to use these to identify relationships and define guidelines that could be used to support the design of similar picking algorithms.

9

KFOA: K-mean Clustering, Firefly Based Data Rate Optimization and ACO Routing for Congestion Control in WSN

Jadhav Savita Sandeep, Jadhav Sangeeta

International Journal of Electronics and Telecommunications

|

2022

|

Vol. 68. No. 4

659--665

EN

Wireless sensor network (WSN) is assortment of sensor nodes proficient in environmental information sensing, refining it and transmitting it to base station in sovereign manner. The minute sensors communicate themselves to sense and monitor the environment. The main challenges are limited power, short communication range, low bandwidth and limited processing. The power source of these sensor nodes are the main hurdle in design of energy efficient network. The main objective of the proposed clustering and data transmission algorithm is to augment network performance by using swarm intelligence approach. This technique is based on K-mean based clustering, data rate optimization using firefly optimization algorithm and Ant colony optimization based data forwarding. The KFOA is divided in three parts: (1) Clustering of sensor nodes using K-mean technique and (2) data rate optimization for controlling congestion and (3) using shortest path for data transmission based on Ant colony optimization (ACO) technique. The performance is analyzed based on two scenarios as with rate optimization and without rate optimization. The first scenario consists of two operations as k-mean clustering and ACO based routing. The second scenario consists of three operations as mentioned in KFOA. The performance is evaluated in terms of throughput, packet delivery ratio, energy dissipation and residual energy analysis. The simulation results show improvement in performance by using with rate optimization technique.

10

A Survey on Efficient Routing Strategies for The Internet of Underwater Things (IoUT)

Al-Bzoor Mana, Ayyad Walaa, Altaani Ola

International Journal of Electronics and Telecommunications

|

2022

|

Vol. 68. No. 4

825--830

EN

The Internet of Underwater Things (IoUT) is an emerging technology that promised to connect the underwater world to the land internet. It is enabled via the usage of the Underwater Acoustic Sensor Network (UASN). Therefore, it is affected by the challenges faced by UASNs such as the high dynamics of the underwater environment, the high transmission delays, low bandwidth, high-power consumption, and high bit error ratio. Due to these challenges, designing an efficient routing protocol for the IoUT is still a trade-off issue. In this paper, we discuss the specific challenges imposed by using UASN for enabling IoUT, we list and explain the general requirements for routing in the IoUT and we discuss how these challenges and requirements are addressed in literature routing protocols. Thus, the presented information lays a foundation for further investigations and futuristic proposals for efficient routing approaches in the IoUT.

11

Green last-mile route planning for efficient e-commerce distribution

Kunnapapdeelert Siwaporn, Johnson James Vincent, Phalitnonkiat Passarin

Engineering Management in Production and Services

|

2022

|

Vol. 14, no. 1

1--12

EN

This study aims to design vehicle routes based on cost minimisation and the minimisation of greenhouse gasses (GHG) emissions to help companies solve the vehicle routing problem with pickup and delivery (VRPPD) via particle swarm optimisation (PSO). An effective metaheuristics search technique called particle swarm optimisation (PSO) was applied to design the optimal route for these problems. Simulated data from Li and Lim (2001) were used to evaluate the PSO performance for solving green vehicle routing problems with pickup and delivery (Green VRPPD). The findings suggest that green vehicle routing problems with pickup and delivery should be used when distributing products to customers living in a specific area called a cluster. However, the design of vehicle routes by Green VRPPD costs more when used to distribute products to customers living randomly in a coverage service area. When logistics providers decide to use Green VRPPD instead of VRPPD, they need to be concerned about possible higher costs if an increase in the number of vehicles is needed. PSO has been confirmed for solving VRPPD effectively. The study compared the results based on the use of two different objective functions with fuel consumption from diesel and liquefied petroleum gas (LPG). It indicates that solving VRPPD by considering the emissions of direct greenhouse gases as an objective function provides cleaner routes, rather than considering total cost as the objective function for all test cases. However, as Green VRPPD requires more vehicles and longer travel distances, this requires a greater total cost than considering the total cost as the objective function. Considering the types of fuels used, it is obvious that LPG is more environmentally friendly than diesel by up to 53.61 %. This paper should be of interest to a broad readership, including those concerned with vehicle routing problems, transportation, logistics, and environmental management. The findings suggest that green vehicle routing problems with pickup and delivery should be used when distributing products to a cluster. However, the design of vehicle routes by Green VRPPD costs more when used to distribute products to customers living randomly in a coverage service area. When logistics providers decide to use Green VRPPD instead of VRPPD, they need to be concerned about possible higher costs if an increase in the number of vehicles is needed.

12

Dispersed, self-organizing sensory networks supporting the technological

Jagoda Jerzy, Hetmańczyk Mariusz, Stankiewicz Krzysztof

Mining Machines

|

2021

|

no. 2

13--23

EN

Examples of automation of technological processes for mineral extraction are presented. Aspects related to the diagnostics of machines and devices during operation processes are discussed. Applying the distributed sensor networks to enable designing and manufacturing the machines and devices operated in accordance with the idea of Industry 4.0, the Internet of Things, M2M communication and autonomous behaviour was proposed. The paper presents impact of applying the distributed sensor networks on increasing work safety (multi-redundant communication) and reducing the employment in hazardous areas is presented. Implementation of algorithms based on swarm intelligence to control the routing processes of distributed sensor networks was suggested. Areas of application of distributed sensor networks based on swarm intelligence in other industries (renewable energy sources) are also outlined.

13

A Comprehensive Survey on Routing and Security in Mobile Wireless Sensor Networks

Al-Nasser Ahmed, Almesaeed Reham, Al-Junaid Hessa

International Journal of Electronics and Telecommunications

|

2021

|

Vol. 67, No. 3

483--496

EN

With the continuous advances in mobile wireless sensor networks (MWSNs), the research community has responded to the challenges and constraints in the design of these networks by proposing efficient routing protocols that focus on particular performance metrics such as residual energy utilization, mobility, topology, scalability, localization, data collection routing, Quality of Service (QoS), etc. In addition, the introduction of mobility in WSN has brought new challenges for the routing, stability, security, and reliability of WSNs. Therefore, in this article, we present a comprehensive and meticulous investigation in the routing protocols and security challenges in the theory of MWSNs which was developed in recent years.

14

Routing protocols in mobile ad-hoc networks

Mikarić Bratislav, Rančić Dejan, Ilić Slaviša

Przegląd Elektrotechniczny

|

2020

|

R. 96, nr 8

106--111

EN

There were more than 8.6 billion mobile devices in the world in the 2019. To be available is imperative in modern society, both in business and in private life. There are mobile networks available on airports, hotels, restaurants, libraries but sometimes we have to make a quick, mobile network on open area for educational campus or military purposes, where there are no mobile operators and public networks such as GSM. A different model of mobile networks is created and called Mobile Ad-hoc Network. The problem of routing is basically the problem of finding the shortest path between nodes. This paper deals with various routing protocols in MANET and shows how to choose the best one for specific purpose.

PL

Na świecie jest ponad 8.6 miliardów bezprzewodowych urządzeń mobilnych I olbrzymia lic\ba sieci. Żeby rozwiązać problemy komunikacyjne trzeba korzystać z metod jak najszybszego I najkrótszego połączenia miedzy węzłami. W artykule analizowano najlepsze sposoby routingu.

15

Presenting a mathematical programming model for routing and scheduling of cross-dock and transportation

Tavallali Pezhman Abbasi, Feylizadeh Mohammad Reza, Amindoust Atefeh

Polish Journal of Management Studies

|

2020

|

Vol. 22, No. 1

545--564

EN

Cross-docking is the practice of unloading goods from inbound delivery vehicles and loading them directly onto outbound vehicles. Cross-docking can streamline supply chains and help them move goods to markets faster and more efficiently by eliminating or minimizing warehouse storage costs, space requirements, and inventory handling. Regarding their short shelf-life, the movement of perishable commodities to cross-dock and their freight scheduling is of great importance. Accordingly, the present study developed a Mixed-Integer linear Programming (MILP) model for routing and scheduling, cross-docking, and transportation in a reverse logistics network. The model was multi-product and multi-level and focused on minimizing the logistics network costs to increase efficiency and maximizing the consumption value of delivered products. Considering cost minimization (i.e., earliness and tardiness penalty costs of customer order delivery, the inventory holding costs at the temporary storage area of the cross-dock and costs of crossover and use of outbound vehicles) as well as uncertainty in customer demand for perishable products, the model was an NP-hard problem. In this model, the problem-solving time increased exponentially according to the problem dimensions; hence, this study proposed an efficient method using the NSGA II algorithm.

PL

Cross-docking to praktyka polegająca na rozładowywaniu towarów z przychodzących samochodów dostawczych i ładowaniu ich bezpośrednio na pojazdy wyjeżdżające. Cross-docking może usprawnić łańcuchy dostaw i pomóc im szybciej i wydajniej przemieszczać towary na rynki, eliminując lub minimalizując koszty magazynowania, wymagania przestrzenne i obsługę zapasów. Ze względu na ich krótki okres przydatności do spożycia ogromne znaczenie ma przemieszczanie łatwo psujących się towarów do cross-dockingu i planowanie ich przewozu. W związku z tym w niniejszym badaniu opracowano model programowania liniowego (MILP) z mieszaną liczbą całkowitą do wyznaczania tras i harmonogramów, przeładunku towarów i transportu w sieci logistyki zwrotów. Model był wieloproduktowy i wielopoziomowy oraz koncentrował się na minimalizacji kosztów sieci logistycznej w celu zwiększenia wydajności i maksymalizacji wartości konsumpcyjnej dostarczanych produktów. Uwzględniając minimalizację kosztów (tj. Koszty karne za wczesne i spóźnione dostawy zamówień do klienta, koszty magazynowania w tymczasowej strefie składowania cross-docku oraz koszty crossovera i wykorzystania pojazdów wychodzących), a także niepewność dotyczącą zapotrzebowania klientów na łatwo psujące się produkty model był problemem NP-trudnym. W tym modelu czas rozwiązywania problemów wzrastał wykładniczo zgodnie z wymiarami problemu; stąd w badaniu zaproponowano skuteczną metodę wykorzystującą algorytm NSGA II.

16

Problem marszrutyzacji floty dronów

Radzki Grzegorz, Bocewicz Grzegorz, Budzisz Henryk

Zeszyty Naukowe Wydziału Elektroniki i Informatyki Politechniki Koszalińskiej

|

2019

|

Nr 15

5--22

PL

W artykule rozważany jest problem dostarczania towarów w sieci dystrybucyjnej, w której operacje transportu realizowane są przez flotę bezzałogowych statków powietrznych (BSP). Szczególny nacisk położony jest na możliwość uwzględniania warunków pogodowych, w których odbywa się transport. Rozważany problem sprowadza się do wyznaczenia marszruty gwarantującej bezkolizyjne dostarczenie towaru do węzła, przy uwzględnieniu warunków pogodowych oraz poziomu baterii dronów. Zaproponowany został deklaratywny model, którego implementacja w środowisku programowania IBM ILOG pozwala na rozwiązywanie tego typu problemów w trybie on-line. Przedstawione eksperymenty obliczeniowe, potwierdzają poprawność opracowanego modelu.

EN

A problem of delivering goods in a distribution network is considered in which, transport operations are carried out by a fleet of unmanned aerial vehicles (UAV). The weather conditions in which a transport operations take place and a UAV battery level are taken into account. The above-mentioned weather conditions and the battery level affect the determination of the route guaranteeing collision-free delivery. The goods must be delivered to a specific node in a given time window. Specifying the route is the focus of this study. Solutions maximizing the level of customer satisfaction are sought. Computational experiments which show impact of the weather conditions to on route determination are presented.

17

Wprowadzenie protokołu IPv6 do sieci operatorskiej na przykładzie operatora telewizji kablowej

Owczarzak Borys, Zwierzykowski Piotr

Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne

|

2019

|

nr 2

31--39

PL

Działanie globalnej sieci Internet opiera się na protokole IP. Jednym ze skutków dynamicznego rozwoju Internetu jest malejąca liczba dostępnych adresów IP. Metodą umożliwiającą rozwiązanie tego problemu jest wprowadzenie nowej wersi protokołu IP, oznaczonej IPv6. Niestety, obie wersje protokołu IP nie są ze sobą zgodne i dlatego wdrożenie IPv6 napotyka wiele trudności. Wymagane jest podjęcie wielu dodatkowych działań, takich jak zaplanowanie nowej adresacji, zapewnienie kompatybilności pomiędzy urządzeniami, uruchomienie dodatkowych protokołów rutingu i nowych opcji dostępnych w IPv6. W artykule przedstawiono przykład wdrożenia nowej wersji protokołu IP w sieci operatorskiej. Zaproponowane rozwiązania przedstawiono na przykładzie Winogradzkiej Telewizji Kablowej.

EN

The operation of the global internet network is based on the IP protocol. One of the effects of the dynamic development of the internet, however, is the decreasing number of available IP addresses (address exhaustion). However, over the last decades, network, cloud, mobile and IoT technologies have rapidly reduced the number of available IP addresses. A solution to this limitation is the latest version of the IP communications protocol, termed IPv6. Regrettably, both versions of the IP protocol, the previous version and the new one, are not compatible with each other, and hence the implementation of the IPv6 has encountered problems and resistance. The initial requirements involve a large number of additional tasks, such as new IP addressing planning, provision of compatibility between devices and activation of additional routing protocols and new options available in the IPv6 protocol. This article presents an example of a practical implementation of the new version of the IP protocol in Winogradzka Telewizja Kablowa, a local cable television operator network.

18

Milk-run routing and scheduling subject to a trade-off between vehicle fleet size and storage capacity

Bocewicz Grzegorz, Bożejko Wojciech, Wójcik Robert, Banaszak Zbigniew

Management and Production Engineering Review

|

2019

|

Vol. 10, No. 3

41--53

EN

The objective of the milk-run design problem considered in this paper is to minimize transportation and inventory costs by manipulating ﬂeet size and the capacity of vehicles and storage areas. Just as in the case of an inventory routing problem, the goal is to ﬁnd a periodic distribution policy with a plan on whom to serve, and how much to deliver by what ﬂeet of tugger trains travelling regularly on which routes. This problem boils down to determining the trade-oﬀ between ﬂeet size and storage capacity, i.e. the size of replenishment batches that can minimize ﬂeet size and storage capacity. A solution obtained in the declarative model of the milk-run system under discussion allows to determine the routes for each tugger train and the associated delivery times. In this context, the main contribution of the present study is the identiﬁcation of the relationship between takt time and the size of replenishment batches, which allows to determine the delivery time windows for milkrun delivery and, ultimately, the positioning of trade-oﬀ points. The results show that this relationship is non-linear.

19

Fuzzy Clustering with Multi-Constraint QoS Service Routing in Wireless Sensor Networks

Agarkhed Jayashree, Kadrolli Vijayalaxmi, Patil Siddarama R.

Journal of Telecommunications and Information Technology

|

2019

|

nr 1

31--38

EN

This paper presents a fuzzy logic-based, service diﬀerentiated, QoS aware routing protocol (FMSR) oﬀering multipath routing for WSNs, with the purpose of providing a service diﬀerentiated path meant for communication between nodes, based on actual requirements. The proposed protocol initially forms a cluster by fuzzy c-means. Next, the building of a routing follows, so as to establish multiple paths between nodes through the modiﬁed QoS k-nearest neighborhood, based on diﬀerent QoS constraints and on optimum shortest paths. If one node in the path fails due to lack of residual energy, bandwidth, packet loss, delay, an alternate path leading through another neighborhood node is selected for communication. Simulation results show that the proposed protocol performs better in terms of packet delivery ratio, delay, packet drop ratio and throughput compared to other existing routing protocols.

20

Comparison of Multicast Algorithm Evaluation Results in Low and High Multicast Saturation Environments

Stachowiak Krzysztof, Zwierzykowski Piotr

Journal of Telecommunications and Information Technology

|

2019

|

nr 3

3--7

EN

The multicast quality of service-enabled routing is a computationally challenging task. Despite ongoing research eﬀorts, the associated mathematical problems are still considered to be NP-hard. In certain applications, computational complexity of ﬁnding the optimal connection between a set of network devices may be a particularly diﬃcult challenge. For example, connecting a small group of participants of a teleconference is not much more complex than setting up a set of mutual point-to-point connections. On the other hand, satisfying the demand for such services as IPTV, with their receivers constituting the majority of the network, requires applying appropriate optimization methods in order to ensure real system execution. In this paper, algorithms solving this class of problems are considered. The notion of multicast saturation is introduced to measure the amount of multicast participants relative to the entire network, and the eﬃciency of the analyzed algorithms is evaluated for diﬀerent saturation degrees.