Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "routing" wg kryterium: Wszystkie pola


Tytuł:
A study on routing problems and different routing protocols in wireless sensor networks
Autorzy:
Venkatesakumar, V.
Ragasudha, R.
Powiązania:
https://bibliotekanauki.pl/articles/1182939.pdf
Data publikacji:
2016
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
wireless sensor networks
routing protocols
routing problems
Opis:
Extensive utilization of WSN is the reason of advancement of numerous routing protocols. The Late advances in WSN now witness the expanded enthusiasm for the potential use in applications like Environmental, Military, Space Exploration, Health (Scanning), Vehicular Movement, disaster management, Mechanical anxiety levels of appended objects, battle field observation and so forth. Sensors are required to be remotely conveyed in unattended situations. Propels in WSN innovation has given the accessibility of little and minimal effort sensor hubs with a capacity of sensing different sorts of physical and natural environment conditions, wireless communication and data processing. Assortment of sensing capacities results in bounty of application areas. However, the attributes of WSN require more powerful strategies for data forwarding. The sensor hubs in WSN have a constrained transmission range, and their handling and capacity abilities and as well as their energy assets are also restricted. Routing protocols for WSN are in charge of keeping up the routes in the network system and need to guarantee dependable multi-hop communication under these conditions. Routing as one key innovations of wireless sensor systems has now turned into a hot examination on the grounds that the uses of WSN are all over the place, it is unthinkable that there is a routing protocol suitable for all applications. In this paper, we give an overview of routing issues routing protocols for Wireless Sensor Network.
Źródło:
World Scientific News; 2016, 49, 2; 236-248
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analytical review and study on multipath routing protocols
Autorzy:
More, Shivaprasad
Naik, Udaykumar
Powiązania:
https://bibliotekanauki.pl/articles/2050101.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multipath routing protocol
Peak Signal to Noise Ratio
geographic routing protocol
Vehicular Ad Hoc Networks
proactive routing protocol
Opis:
Vehicular Ad Hoc Networks (VANET) constitute a promising technology for Intelligent Transport Systems (ITS). VANET are highly dynamic in their nature because of the movements of vehicles, which are acting as nodes. The routing protocol must be designed for dealing with multiple limiting conditions, like link failures, handoffs, and long congestion periods, which is very challenging. The survey of different routing protocols in VANET provides a significant information for building smart ITS. Accordingly, the present survey is devoted to the existing distinct multipath routing protocols. This review article provides a detailed account on 50 research papers, presenting the different kinds of multipath routing protocols, namely proactive routing protocols, ad-hoc-based routing protocols, Greedy Perimeter Stateless Routing (GPSR), hybrid routing protocols, as well as geographic routing protocols. Besides the classification and cursory description, the present study addresses also several of the important parameters, like evaluation metrics, implementation tool, publication year, datasets utilized, Peak Signal to Noise Ratio (PSNR), and packet end-to-end delay with respect to various techniques considered. Eventually, the research gaps and issues of various multipath routing protocols are presented with the intention of pointing out directions for future research.
Źródło:
Control and Cybernetics; 2020, 49, 4; 369-391
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Method of Routing Ships Sailing in Dedicated Environment
Autorzy:
Życzkowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/320897.pdf
Data publikacji:
2017
Wydawca:
Polskie Forum Nawigacyjne
Tematy:
sailing ship’s routing
route optimization
weather routing
unmanned sailing vessel
Opis:
The method for determining the suboptimal route of sailing vessels operating in a restricted area of the sea are proposed in the paper. The dynamics of the environment including weather conditions and speed characteristics of ships sailing are considered. As optimization criterion, measure sailing time T, and the number of maneuvers performed ω, are taken into account. An heuristic algorithm, and the appropriate application routing for fixed starting points and targets is designed in the method. In addition author analyzed the behavior of the algorithm, depending on the number of direction changes of the course, and granularity of the description of the surface of area.
W artykule zaproponowano suboptymalną metodę określania trasy dla statków żaglowych poruszających się w ograniczonym akwenie morskim. Uwzględniono przy tym dynamikę tego środowiska, między innymi warunki pogodowe oraz charakterystyki prędkościowe statków żaglowych. Jako kryterium optymalizacji przyjęto czas żeglugi T oraz liczbę wykonanych manewrów ω. Zaprojektowano heurystyczny algorytm oraz odpowiednią aplikację wyznaczania trasy dla ustalonych punktów startowych i docelowych. Przeanalizowano zachowanie się algorytmu w zależności od liczby zmian kierunków żeglugi oraz przyjętej ziarnistości opisu akwenu.
Źródło:
Annual of Navigation; 2017, 24; 147-159
1640-8632
Pojawia się w:
Annual of Navigation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Ant Colony Algorithm for efficient ship routing
Autorzy:
Tsou, M.-C.
Cheng, H.-C.
Powiązania:
https://bibliotekanauki.pl/articles/258892.pdf
Data publikacji:
2013
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
ship routing
Ant Colony Algorithm
GIS
weather routing
Opis:
With the substantial rising of international oil price and global warming on the rise, how to reduce operational fuel consumption and decrease air pollution has become one of the pursued goals of green ship. Ship route planning is an indispensible part of the ship navigation process, especially in transoceanic crossing ship routing. The soundness of ship routing not only affects the safety of ship navigation but also the operation economy and environmental protection. This research is based on the platform of Electronic Chart Display and Information System (ECDIS), and founded on Ant Colony Algorithm (ACA) combined with the concept of Genetic Algorithm (GA), to model living organisms optimization behaviour to perform efficient ship route planning in transoceanic crossing. Besides the realization of route planning automation, ship routing will achieve the goal of optimum carbon dioxide reduction and energy conservation, and provide reference for route planning decision.
Źródło:
Polish Maritime Research; 2013, 3; 28-38
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Swarm intelligence for network routing optimization
Autorzy:
Dempsey, P.
Schuster, A.
Powiązania:
https://bibliotekanauki.pl/articles/309012.pdf
Data publikacji:
2005
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
network routing
swarm intelligence
ant algorithms
Opis:
This paper presents the results of a comparative study of network routing approaches. Recent advances in the field suggest that swarm intelligence may offer a robust, high quality solution. The overall aim of the study was to develop a framework to facilitate the empirical evaluation of a swarm intelligence routing approach compared to a conventional static and dynamic routing approach. This paper presents a framework for the simulation of computer networks, collection of performance statistics, generation and reuse of network topologies and traffic patterns.
Źródło:
Journal of Telecommunications and Information Technology; 2005, 3; 24-28
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Energy Aware Location Based Routing Protocols in Wireless Sensor Networks
Autorzy:
Guleria, Kalpna
Kumar, Sushil
Verma, Anil Kumar
Powiązania:
https://bibliotekanauki.pl/articles/1063060.pdf
Data publikacji:
2019
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Energy Efficiency
Location based Routing
Routing metrics
Wireless Sensor Networks
ing
Opis:
Wireless Sensor Networks have played a great role in various application domains like environmental tracking for precision agriculture, structural health monitoring, patient health monitoring, intrusion detection, earthquake or volcano prediction and industrial monitoring etc. The major design issues to be dealt in Wireless sensor networks (WSNs) are its resource constraint nature, limited network lifetime and scalability. The most stringent of all is energy consumption and battery life which actually limits the network lifetime. This paper presents various energy aware location based routing protocols and in depth comparison based on various characteristics such as routing selection method, data aggregation, routing metrics, periodic message type, scalability, energy efficiency, robustness, event/query based and strengths.
Źródło:
World Scientific News; 2019, 124, 2; 326-333
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Topology Based Routing Protocols in Vehicular Ad-Hoc Networks (VANET)
Autorzy:
Rajkumar, M. Newlin
Nithya, M.
Hemalatha, P.
Rajeswari, R.
Powiązania:
https://bibliotekanauki.pl/articles/1193566.pdf
Data publikacji:
2016
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
AODV
DSR
TORA
Topology based routing
VANET
reactive routing
Opis:
Vehicular Ad-hoc network (VANET) is an exacting form of Mobile Ad-hoc Network (MANET) where the vehicles are act as nodes. Due to high mobility of nodes, high partitioned network and also dynamic changing routing protocols, the routing in Vanet is dispute one. The routing protocols functions should depends on the internal and external characteristics of VANET such as nodes mobility, road topology and obstacles which block the signal. A routing protocol is used to find the route between the nodes to communicate each other. The particular route to be selected by routing protocol. The routers have the information about the network which is directly connected to it. The routing protocol first forward the information to the immediate neighbor node, then it forward the information throughout the network. In VANET the routing protocol are classify based on topology, position of vehicle, cluster based vehicle, broadcast based routing and geocast based routing. This article explains the topology based routing protocol, especially reactive routing protocol which is a part of the topology based routing protocol.
Źródło:
World Scientific News; 2016, 41; 186-192
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multicriteria Evolutionary Weather Routing Algorithm in Practice
Autorzy:
Szlapczynska, J.
Powiązania:
https://bibliotekanauki.pl/articles/116837.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
weather routing
Zero Unitarization Method
multicriteria optimisation
evolutionary algorithms
Opis:
The Multicriteria Evolutionary Weather Routing Algorithm (MEWRA) has already been introduced by the author on earlier TransNav 2009 and 2011 conferences with a focus on theoretical application to a hybrid‐propulsion or motor‐driven ship. This paper addresses the topic of possible practical weather routing applications of MEWRA. In the paper some practical advantages of utilizing Pareto front as a result of multicriteria optimization in case of route finding are described. The paper describes the notion of Paretooptimality of routes along with a simplified, easy to follow, example. It also discusses a choice of the most suitable ranking method for MEWRA (a comparison between Fuzzy TOPSIS and Zero Unitarization Method is presented). In addition to that the paper briefly outlines a commercial application of MEWRA.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2013, 7, 1; 61-65
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
HGRP: hybrid grid routing protocol for heterogeneous hierarchical wireless networks
Autorzy:
Shen, Y.
Pei, Q.
Xu, Q.
Xi, N.
Ma, J.
Powiązania:
https://bibliotekanauki.pl/articles/206219.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
hybrid grid routing protocol
mobile ad hoc networks
heterogeneous wireless networks
ad hoc on-demand distance vector routing protocol
zone routing protocol
Opis:
The heterogeneous mobile terminals coexist in the next generation wireless networks. The most common routing schemes for mobile ad hoc networks are designed for homogeneous wireless networks. The heterogeneous wireless network routing protocols are needed urgently in many important applications. This paper improves the routing scheme utilizing different capability of terminals and the Hybrid Grid Routing Protocol (HGRP) is proposed. The network is organized in the grid form, that is, the network deployment area is divided into square cells according to the location. Each cell contains one backbone node and several ordinary nodes. This proposed protocol consists of four parts: grid construction, local routing, global routing, and routing correction. Analysis and simulation results indicate that the proposed protocol has the advantages of lower routing cost, lower energy consumption, smaller delay and higher throughput, compared to AODV and ZRP.
Źródło:
Control and Cybernetics; 2012, 41, 2; 353-371
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Authenticated Routing Protocol for Wireless Ad Hoc Network Based on Small World Model
Autorzy:
Wang, Daxing
Xu, Leying
Powiązania:
https://bibliotekanauki.pl/articles/1844509.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
small world model
wireless ad hoc network
routing protocol
authentication theory
AODV routing protocol
Opis:
Compared with traditional cellular networks, wireless ad hoc networks do not have trusted entities such as routers, since every node in the network is expected to participate in the routing function. Therefore, routing protocols need to be specifically designed for wireless ad hoc networks. In this work, we propose an authenticated routing protocol based on small world model (ARSW). With the idea originating from the small world theory, the operation of the protocol we proposed is simple and flexible. Our simulation results show the proposed ARSW not only increases packet delivery ratio, but also reduces packet delivery delay. In particularly, Using authentication theory, the proposed ARSW improves communication security.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 3; 425-430
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implementation and performance of a new multiple objective dynamic routing method for multiexchange networks
Autorzy:
Martins, L.
Craveirinha, J.
Climaco, J.N.
Gomez, T.
Powiązania:
https://bibliotekanauki.pl/articles/307696.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
dynamic routing
multiple objective routing
multiexchange telecommunication network performance
Opis:
The paper describes new developments of a multiple objective dynamic routing method (MODR) for circuit-switched networks previously presented, based on the periodic calculation of alternative paths for every node pair by a specialised bi-objective shortest path algorithm (MMRA). A model is presented that enables the numerical calculation of two global network performance parameters, when using MMRA. This model puts in evidence an instability problem in the synchronous path computation model which may lead to solutions with poor global network performance, measured in terms of network mean blocking probability and maximum node-to-node blocking probability. The essential requirements of a heuristic procedure enabling to overcome this problem and select "good" routing solutions in every path updating period, are also discussed.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 60-66
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-objective weather routing of sailing vessels
Autorzy:
Życzkowski, M.
Szłapczyński, R.
Powiązania:
https://bibliotekanauki.pl/articles/258742.pdf
Data publikacji:
2017
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
sailing vessels
weather routing
weather forecast
comfort
penalty
Opis:
The paper presents a multi-objective deterministic method of weather routing for sailing vessels. Depending on a particular purpose of sailboat weather routing, the presented method makes it possible to customize the criteria and constraints so as to fit a particular user’s needs. Apart from a typical shortest time criterion, safety and comfort can also be taken into account. Additionally, the method supports dynamic weather data: in its present version short-term, mid-term and long-term term weather forecasts are used during optimization process. In the paper the multi-objective optimization problem is first defined and analysed. Following this, the proposed method solving this problem is described in detail. The method has been implemented as an online SailAssistance application. Some representative examples solutions are presented, emphasizing the effects of applying different criteria or different values of customized parameters.
Źródło:
Polish Maritime Research; 2017, 4; 10-17
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
SocialRouting : The social-based routing algorithm for Delay Tolerant Networks
Autorzy:
Schoeneich, R. O.
Surgiewicz, R.
Powiązania:
https://bibliotekanauki.pl/articles/963900.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
routing protocols
MANET
DTN
Opis:
Delay and Disruptive Tolerant Networks (DTN) are relatively a new networking concept that could provide a robust communication in wide range of implementations from the space to battlefield or other military usage. However in such dynamic networks, which could be considered as a set of intermittently connected nodes, message forwarding strategy is a key issue. Existing routing solutions concentrate mainly on two major routing families flooding and knowledge based algorithms. This paper presents SocialRouting - the social-based routing algorithm designed for DTN. The use of the social properties of wireless mobile nodes is the novel way of message routing that is based on message ferrying between separated parts of the network. Proposed idea has been extensively tested using simulation tools. The simulations were made based on especially designed for measurements in DTN scenarios and compared with popular solutions.
Źródło:
International Journal of Electronics and Telecommunications; 2016, 62, 2; 167-172
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Lagrangian Relaxation and Linear Intersection Based QoS Routing Algorithm
Autorzy:
Stachowiak, K.
Zwierzykowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/226432.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Lagrangian relaxation
quality of service
routing
Opis:
Due to the process of network convergence, the variety of types of traffic transmitted over a single medium increases steeply. This phenomenon can be handled by the existing networking structure although the protocols that are used and, especially, the underlying routing protocols need to be improved. The problem of finding the shortest path on the Internet can no longer be easily defined as there is an increasing number of different characteristics to describe a point-to-point link. The definition of the shortest path may differ for different traffic types. Therefore, in the mathematical models used to solve the modern routing problems multiple criteria must be taken into account. One of the interesting classes of the optimization problem is the problem of finding the solution that is minimized against one of the criteria under certain constraints with regard to the others. In this paper, two algorithms solving this kind of problems are presented and compared with a new solution proposed by the authors.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 4; 307-314
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Percolation Driven Flooding for Energy Efficient Routing in Dense Sensor Networks
Autorzy:
Vakulya, G.
Simon, G.
Powiązania:
https://bibliotekanauki.pl/articles/308970.pdf
Data publikacji:
2009
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
flood routing
percolation
sensor network
Opis:
Simple flooding algorithms are widely used in ad hoc sensor networks either for information dissemination or as building blocks of more sophisticated routing protocols. In this paper a percolation driven probabilistic flooding algorithm is proposed, which provides large message delivery ratio with small number of sent messages, compared to traditional flooding. To control the number of sent messages the proposed algorithm uses locally available information only, thus induces negligible overhead on network traffic. The performance of the algorithm is analyzed and the theoretical results are verified through simulation examples.
Źródło:
Journal of Telecommunications and Information Technology; 2009, 2; 5-12
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies