A trusted approach for prediction of data link failure and intrusion detection in wireless sensor networks

Typically, wireless senor network (WSN) is widely used in the various fields for several applications. It is a promising technology due to its higher range of the network connectivity and the fast set up of the network. But there will also be a presence of the some of the eradicating issues which will decrease the network growth. In the WSNfield the prediction of link failure is regarded as the baffling one till now. The proposed technique offers a detailed idea on the failure of link. The proficient trusted Node ID dependent resource reservation protocol (PTN-RRP) is presented in this approach. In this, the shortest path is then recognized with the use of approach weighted based end-to-end delay. This technique identifies the shortest path from a specific preliminary position to the target and thus could enhance the detectionrate. By means of recognizing shortest path, the hop address and sequence numeral is being incorporated to the protocol. Once afterwards the shortest pathdetection, the failure of link is estimated. A link failure structure in the trusted etiquetteemployed has the developedcapabilityto predict and fix issues related to link failure. After that, to identify the attack cause intended for the failureof link, a method of posterior probability evaluation is carried out to find the kind of attack. Finally, the proposed method performance isassessedover simulation study. The simulation outcomeauthorizes that the projectedmethod is effective highly in the link breakage detectionand the implemented algorithm for shortest path recognition in this will decreases the detecting shortest path time period. The performance outcome is compared with existing techniques to prove the effectiveness of proposed methodology.

DEVELOPMENT OF A MULTIPATH ROUTING ALGORITHM IN SOFTWARE-DEFINED COMMUNICATION NETWORKS

The paper describes the development of routing algorithm in software-defined communication networks using the principle of multi-path message delivery. The use of the OpenFlow protocol as the main one for connecting data- and control-plane devices between each other, that is, programmable switches with the controller, allows us to take the network topology presented in undirected weighted graph form as the initial data for the algorithm. There are known solutions to the problem of finding ways to transmit data in a communication network, as a rule, using the network resource reservation protocol, but additional restrictions are imposed on the network, since RSVP has a low degree of scalability, respectively, inappropriate consumption of computing resources and storage system resources of individual routers. In view of the above, an algorithm has been developed for finding a set of paths on a graph with the construction of an auxiliary graph based on the original one. Conditions are given under which an auxiliary graph can be constructed from the initial one. The algorithm takes into account the possibility of constructing several paths passing through one vertex, while meeting the requirements for the delay of the input data stream. To expand the functionality and possible areas of application of the algorithm for finding a set of paths, a criterion for the required total throughput by a set of data transmission paths is introduced. Conditions for constructing paths from a vertex to set of vertices are given. The algorithm presented in the work has an order of magnitude less time complexity, which allows you to quickly respond to changes in the data transmission network, while the most significant differences in the time spent on building a set of paths are noticeable with an increase in nodes in the data transmission network and the number of possible paths.

A Trusted Method For Early Data Link Failure Prediction

Mobile ad-hoc network was widely used in the various fields for several applications. In the field of the wireless sensor network the link failure prediction is still a baffling one. The proposal here provides clear facts about the concepts of the link failure. In this paper the Proficient Trusted Node ID Based Resource Reservation Protocol (PT-NIDBRRP) was used. Here the shortest path was detected by using the weighted end-to-end delay based approach. This algorithm will find the short cut route from the particular starting place to the target and can improve the detection rate. By starting the route detection process the sequence numeral and the hop address is added to the protocol. After detecting the shortest path the link failure was detected. The link failure localization structure in the implemented trusted protocol has the higher ability in predicting and fixing the link failure issues. Then to find out the cause attack for the link failure the posterior probability estimation was used to sort out the type of the attack. At last the performance of the proposed method was evaluated through simulation analysis. The simulation result confirms that the proposed methodology is highly effective in detecting the link breakage and the short path algorithm implemented here will reduces the time period of detecting the shortest path. This method provides trusted secure network time duration, energy values and trust scores play an important role between the source and destination in the network.

Analisis Perbandingan Performa Traffic Engineering Dengan Resource Reservation Protocol (RSVP) dan Segment Routing

Kualitas koneksi khususnya pada backbone menjadi tantangan Internet Service Provider (ISP). MPLS berkerja di layer 2,5 OSI yang mampu mempercepat pengiriman paket pada jaringan backbone. MPLS melekatkan label pada paket yang dikirimkan. Salah satu layanan dari MPLS adalah traffic engineering yang dibuat dengan protokol RSVP. Terdapat protokol baru untuk memberi label pada paket dan mendukung traffic engineering, yaitu Segment Routing. Penelitian ini menganalisis perbandingan performa traffic engineering dengan RSVP dan Segment Routing. Baik pada penerapan RSVP maupun Segment Routing dibuat tunnel untuk jalur utama dan reroute menuju jalur cadangan. Penelitian dilakukan pada emulator EVE-NG dengan mengambil studi kasus topologi backbone di PT ICON+.Hasil penelitian adalah Segment Routing di MPLS menyederhanakan kinerja dari router dalam hal pelabelan dan dalam memelihara Label Switch Path (LSP), tidak membutuhkan protokol signaling. Hasil pengujian latency pada jalur utama, dengan Segment Routing maupun dengan RSVP mempunyai nilai sama. Sedangkan pada jalur cadangan, nilai latency dari Segment Routing lebih kecil, sehingga Segment Routing dapat mengirim data dengan lebih cepat daripada dengan RSVP. Hasil pengujian packet delivery ratio dan packet loss ratio dengan Segment Routing dan dengan RSVP baik di jalur utama maupun jalur cadangan bernilai sama, yaitu 100% dan 0%. Baik pada jalur utama maupun jalur cadangan, penerapan Segment Routing mempunyai nilai throughput yang lebih besar daripada penerapan RSVP, sehingga Segment Routing dapat mengirim data dengan lebih cepat daripada RSVP. Pada kondisi link mengalami kegagalan saat pengujian, keduanya memiliki 1% packet loss, namun perpindahan jalur dilakukan dengan lebih cepat pada Segment Routing.