Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!

Znaleziono wyników: 16

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

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Energy consumed by the sensor nodes are more sporadic in a sensor networks. A skilled way to bring down energy consumption and extend maximum life-time of any sensor present can be of evenly and unevenly distributed random area networks. Cluster heads are more responsible for the links between the source and destination. Energy consumption are much compare to member nodes of the network. Re-clustering will take place if the connectivity in the distributed network failure occurs in between the cluster networks that will affects redundancy in the network efficiency. Hence, we propose pragmatic distribution based routing cluster lifetime using fitness function (PDBRC) prototype is better than the existing protocol using MATLAB 2021a simulation tool.
EN
This paper aims at designing, building, and simulating a secured routing protocol to defend against packet dropping attacks in mobile WSNs (MWSNs). This research addresses the gap in the literature by proposing Configurable Secured Adaptive Routing Protocol (CSARP). CSARP has four levels of protection to allow suitability for different types of network applications. The protocol allows the network admin to configure the required protection level and the ratio of cluster heads to all nodes. The protocol has an adaptive feature, which allows for better protection and preventing the spread of the threats in the network. The conducted CSARP simulations with different conditions showed the ability of CSARP to identify all malicious nodes and remove them from the network. CSARP provided more than 99.97% packets delivery rate with 0% data packet loss in the existence of 3 malicious nodes in comparison with 3.17% data packet loss without using CSARP. When compared with LEACH, CSARP showed an improvement in extending the lifetime of the network by up to 39.5%. The proposed protocol has proven to be better than the available security solutions in terms of configurability, adaptability, optimization for MWSNs, energy consumption optimization, and the suitability for different MWSNs applications and conditions.
EN
With the growth of wireless sensor network (WSN) technologies, the applications of IoT-based WSNs allow the interconnection of smart objects or sensors through the Internet. However, energy constraint is a major obstacle in WSN, which directly affects the lifespan of the network. Hence, many researchers have focused on how to program routing protocols to maximize energy conservation in WSNs. The clustering mechanism is demonstrated that separating the network into clusters may significantly decrease energy consumption. In this paper, we propose distributed tree-based clustering routing protocol for IoT applications (EE-DTC). In order to enhance efficient energy, EE-DTC chooses cluster head nodes based on the remaining energy, the location, and the density of nodes. In addition, to lengthen the network lifespan, we create multi-hop routes with short communication links intra-clusters by building the minimum spanning tree using the Kruskal algorithm. Our experiment results show that the performance of EE-DTC overcomes the TBC and LEACH-VA protocols in terms of increasing network lifespan, reducing energy consumption, and improving efficient energy.
EN
How to use efficient energy in wireless sensor networks (WSN) is one of the major challenges due to limited energy batteries and computation capacity. Therefore, in this paper, we propose combining a chain-base routing scheme and data fusion sensor information (CRSDF for short). CRSDF contains two major works: Firstly, the chain-based routing method is applied to connect sensor nodes into a chain in which each node transmits only with the nearest neighbor using the remaining energy and distance of nodes as standard parameters to determine which node will be selected the chain leader, secondly, we fuse and compress one or more data packets to generate a result packet with small size base on the Slepian-Wolf and Dempster-Shafer theory. The simulation results exhibit that the energy efficiency of our proposed protocol can be improved by 40\%, 20\%, and 15\% compared to low-energy adaptive clustering hierarchy (LEACH), power-efficient gathering in sensor information system (PEGASIS), and an improved energy-efficient PEGASIS-Based protocol, respectively.
EN
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.
EN
Wireless sensor network is a significant piece of wireless communication. It is a gathering of an enormous number of sensor nodes that are set in remote spots. The sensors have ability to do a typical undertaking. So energy exhaustion plays a significant job in keeping up a stable network. To build the system lifetime, a different energy effective algorithm is required which expands the network lifetime and makes the network more energy productive. For the augmenting, the lifetime of the network diverse routing technique has been utilized which help in expanding the lifetime of the network. This article portrays the diverse routing protocol which helps in energy efficient routing in a wireless sensor network.
EN
In the past few years, we have seen a rapid expansion in the field of mobile computing due to the proliferation of inexpensive, widely available wireless devices. However, current devices, applications and protocols are solely focused on cellular or wireless local area networks (WLANs), not taking into account the great potential offered by ad hoc networking. Ad hoc networks are wireless mobile networks that can operate without infrastructure and without centralized network management. In such networks, the wireless mobile nodes may dynamically enter the network as well as leave the network. Mobility and dynamic topology are the main characteristics of ad hoc networks. In the last years, the hundreds of new routing protocols were designed, that are used for the various scenarios of this design space. The routing features in wireless ad hoc networks are described. The corresponding routing protocols are reviewed. The paper proposes a method for selecting the preferred protocol wireless networks using the mathematical tools of neural networks.
PL
Obecnie intensywnie rozwija się kierunek naukowy w zakresie budowy sieci telekomunikacyjnych o zmiennej topologii z wykorzystaniem urządzeń bezprzewodowych. Jednak istniejące urządzenia i protokoły koncentrują się wyłącznie na komórkowe lub bezprzewodowe lokalne sieci (WLAN), niezależnie od potencjału sieci Ad-Hoc. Sieci Ad-Hoc są to sieci bezprzewodowe, które mogą pracować bez infrastruktury i bez scentralizowanego zarządzania siecią. W takich sieciach węzły mogą dynamicznie poruszać się po sieci. Mobilność oraz dynamiczna topologia to kluczowe cechy sieci AdHoc. W ostatnich latach opracowano wiele protokołów dla sieci Ad-Hoc zaprojektowanych dla różnych scenariuszy organizacji routingu. Opisano funkcje routingu w sieciach bezprzewodowych Ad-Hoc i przedstawiono przegląd odpowiednich protokołów routingu. W artykule zaproponowano metodę wyboru protokołu sieci bezprzewodowej z wykorzystaniem matematycznego aparatu sieci neuronowych.
PL
W artykule przedstawiono koncepcję protokołu routingu dla niespójnej, bezprzewodowej sieci DTN. Sieci DTN wykorzystują paradygmat składowania - przenoszenia i przekazywania wiadomości przy wykorzystaniu mobilnych węzłów-nośników. Zaproponowane rozwiązanie przeznaczone jest do działania w środowisku, gdzie rolę węzłów przenoszących wiadomości pełnią statki powietrzne. W rozwiązaniu przewidziano brak standardowych możliwości komunikacji oraz wykorzystanie predefiniowanych informacjach o trasie i czasie przemieszczania się statków powietrznych, tzw. planach lotu.
EN
The paper presents routing protocol designed for wireless Delay and Disruptive Tollerant Networks (DTN). The DTN network uses the storage-carry-forward paradigm for message delivery to the destination nodes using mobile message ferries. The proposed solution is designed to operate in a specific environment, where aircrafts are playing the role of message carriers. For the algorithm purpose, we assume the use of pre-defined information about the routes and time of airplanes movement, so-called flight plans. Additionally we assume no other communication possibilities.
9
Content available remote Sieć bezprzewodowa do zastosowań w automatyce budynkowej
PL
Artykuł przedstawia projekt sieci bezprzewodowej przeznaczonej do zastosowań w automatyce budynkowej. W artykule opisano zagadnienia związane z wyszukiwaniem połączeń pomiędzy węzłami sieci, ustalaniem trasy przesyłanych danych i unikaniem kolizji. Przedstawiona wersja sieci służy do sterowania standardowymi elementami wykonawczymi automatyki budynkowej, ale zastosowane w niej algorytmy mogą służyć do odczytywania danych z sieci czujników lub urządzeń pomiarowych zliczających zużycie mediów (np. liczników energii elektrycznej).
EN
The article presents the project of wireless network designed for applications in building automation. The article includes issues related to the search of connections between network nodes, setting the route transmitted data and collision avoidance. The presented version of the network used to control actuators standard of building automation, however described algorithms can be adapted to read data from the network of sensors or measuring devices counting media consumption (eg. energy meters).
10
Content available remote Metrics in routing protocol for wireless mesh networks
EN
The interest in services offered by wireless network has been growing for many years. It has encouraged the development of wireless technologies. New solutions are able to satisfy the ever-increasing demands concerning wireless services. It is also evident in the diversification of quality assessment methods employed with reference to connections used in such networks. One of the basic elements used in connection quality assessment are metrics. The use of metrics is directly linked to the type of the routing protocol applied in a given network. The selection of a given routing protocol is often determined by its specific properties that might be advantageous in a certain network type, or that are important in terms of the type or scope of services provided. Therefore, it is easy to identify a relationship between metrics and the area of application of a given routing protocol. The significance and diversity of metrics is also reflected inWireless Mesh Networks (WMNs). The proposed paper presents a review of the current state-of-the-art routing metrics for Ad-hoc and WMN networks.
11
Content available remote Clar: A novel cluster oriented agent based routing protocol for manet
EN
In this paper we propose a novel algorithm CLAR to build an agent based routing protocol using ACO technique in cluster based mobile ad-hoc networks. Clustering makes possible hierarchical routing in which paths are recorded between cluster-heads instead of nodes. This reduces routing overheads. Presence of an unstable and non-reliable cluster-head degrades the performance of the network since cluster-heads of the network take active role in routing messages between a source destination pair. The proposed algorithm chooses the most reliable and stable node as cluster-head depending on four criteria i.e.: stability, battery power, degree, and trust value of the node. It also uses a multiagent based routing algorithm to generate load balanced routes between source and destination in cluster-based network. Performance of CLAR is compared with other existing efficient algorithms such as AODV, CBRP, Wu & Li’s Algorithm, dominating set based clustering algorithms, agent-based algorithms named as SACO and MALBACO. Simulation results prove that the proposed protocol combines merits of both clustering approach and agent based approach and provides efficient packet delivery even in the presence of high load in the network.
EN
The paper presents a comparative analysis of reallocation algorithms in a structure of wireless sensor network in the event of a failure of network nodes. The article contains detailed research results of wireless sensor networks technology, with particular emphasis on thte network-layer protocols - routing protocols. In the research the simulation environment OMNeT++ was used to study the properties of reconfiguration and reallocation problems in the wireless sensor networks.
PL
Protokół OSPF jest protokołem stanu łączy, w którym trasy są wyznaczane na podstawie algorytmu SPF (ShorterPath First). Urządzenia działające przy jego użyciu zmieniają swoje tablice rutingu. Przeprowadzone badania miały na celu przedstawienie możliwości osiągnięcia zbieżności trzech obszarów szkieletowych. Wykazano, że protokół rutingu OSPF jest niezawodnym protokołem (otwartego źródła), który zapewnia wiele możliwości kontroli sieci oraz urządzeń.
EN
OSPF is a link-state routing protocol where routes are determined be based on the SPF algorithm (Shorter Path First). Devices acting use OSPF changing board routing. This results of the occurrence in net (continuity of the medium, establish a different cost). The study have to show possibilities of convergence of threeautonomousareas. Demonstrated that OSPF routing protocol is a reliable protocol (Open Source) and provides many opportunities for networking and control devices. Article included basic information of the most popular routing protocols with emphasis on the possibility of OSPF.
14
Content available remote Position-based Wireless Sensor Network Routing Protocol for Strip Area
EN
Limited by the terrain, lots of Wireless sensor network (WSN) applications have to be deployed in a narrow strip area. Due to the narrow and strip network structure, traditional WSN routing algorithms such as LEACH and PEGASIS can not be applied in such applications directly, it’s very necessary to develop a new routing protocol suit for the strip WSN. In order to improving communication efficiency of the strip network and saving the energy of the nodes, in this paper a Position-based Cluster routing (PBCR) protocol is proposed, which combines the clustering techniques with the chain routing techniques. The PBCR protocol divided the strip WSN into many belt-shaped region clusters and elected the cluster head through the position and dump energy of the nodes in the cluster, and forward data by cluster head chain. Simulation results show that the PBCR protocol can ensure a balanced use of node energy and prolong lifetime of the network, and has the obviously advantages in the narrow strip area than the LEACH and PEGASIS protocol.
PL
Przy wąskich pasku przestrzeni tradycyjne metody routing bezprzewodowej sieci czujników takie jak LEACH czy PEGASIS nie zdają egzaminu. W artykule zaproponowano nowy protokół PBCR – position based wireless network routing który łącz w sobie technikę klastrów i technikę łańcucha routingu.
EN
The paper presents the methodology of wireless network design, developed according to the requirements originating from existing wired fetal surveillance systems. The proposed network structure is based on popular radio frequency modules, operating in 433/866MHz band. The described solution is a simple and cost effective alternative to the wired networks, and it will vastly increase the mobility of fetal monitors. The authors also describe software tools which were designed for this purpose and the results of simulations performed on their basis.
16
Content available remote Multipath routing in MPLS networks - a survey
EN
The paper presents the problem of multipath routing supporting the quality of service (QoS) in MPLS networks. First, we briefly survey the mechanisms used for setting up data transmission channels. We consider those algorithms applied in conventional IP networks which are also used by the MPLS technology. Then, we discuss algorithms characteristic for MPLS networks such as SWP, WSP and MIRA. The problems of error tolerance and the way of reacting on the errors are discussed as well.
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ć.