Performance comparison of baseline routing protocols in pocket switched network

Pocket Switched Network (PSN) is a branch of Delay Tolerant Network (DTN) which is intended to work in a challenged network. Challenged network is network with lack of infrastructure such as disaster area. As such, the network has intermittent connectivity. PSN provides a new paradigm to distribute messages in the network by taking advantage of roaming nodes from one place to another. In this paper, network performances of eight PSN routing protocols are investigated namely, First Contact, Direct Delivery, Epidemic, PRotocol using History of Encounter and Transitivity (PRoPHET), Spray and Wait, Binary Spray and Wait, Fuzzy Spray, Adaptive Fuzzy Spray and Wait. The performance metrics are packet delivery ratio, overhead ratio and average latency. Opportunistic Network Environment (ONE) simulator is used to evaluate the network performance. Experiments show that Epidemic has the best performance in term of message delivery ratio, but it has the highest overhead ratio. Direct Delivery has the lowest overhead ratio (zero overhead ratio) and PRoPHET has the lowest latency average

Comparative analysis of attack detection methods in Delay Tolerant Network

Delay Tolerant Network is a new kind of wireless network which includes Radio Frequency (RF) and acoustic (sonar) technologies. DTN developed for an interplanetary network where the speed of light is slow. DTN is derived from deep space communication. DTN is distinguished as long delay and intermittent connectivity. The Delay Tolerant Network is more vulnerable to different kinds of attacks like flooding attack, blackhole and greyhole attacks, due to limited connectivity. There is no end-to-end connectivity between source & destination in DTN. So that it uses a store, carry and forward mechanism to transfer the data from one node to another node. The Delay Tolerant Network was developed to solve technical problems in the end-to-end network. DTN is becoming more and more important because communication networks are ubiquitous today. It provides automotive communication solutions. DTN is a decentralized and self-managed system with unique network attributes; however, attributes such as high mobility nodes, network uplinks and downlinks, and separate routing can cause network vulnerabilities. These vulnerabilities include the host being compromised, which in turn will bring security risks, because the compromised host may destroy the routing protocol in the network. This article analyses the various types of attack detection methods

Comparative analysis of attack detection methods in Delay Tolerant Network

Delay Tolerant Network is a new kind of wireless network which includes Radio Frequency (RF) and acoustic (sonar) technologies. DTN developed for an interplanetary network where the speed of light is slow. DTN is derived from deep space communication. DTN is distinguished as long delay and intermittent connectivity. The Delay Tolerant Network is more vulnerable to different kinds of attacks like flooding attack, blackhole and greyhole attacks, due to limited connectivity. There is no end-to-end connectivity between source & destination in DTN. So that it uses a store, carry and forward mechanism to transfer the data from one node to another node. The Delay Tolerant Network was developed to solve technical problems in the end-to-end network. DTN is becoming more and more important because communication networks are ubiquitous today. It provides automotive communication solutions. DTN is a decentralized and self-managed system with unique network attributes; however, attributes such as high mobility nodes, network uplinks and downlinks, and separate routing can cause network vulnerabilities. These vulnerabilities include the host being compromised, which in turn will bring security risks, because the compromised host may destroy the routing protocol in the network. This article analyses the various types of attack detection methods

Fuzzy-based fault-tolerant and instant synchronization routing technique in wireless sensor network for rapid transit system

In the present era, rapid transits are one of the most affordable means of public transport with various useful integrated application systems. The majority of the integrated applications are deployed in concern over safety and precautionary measures against the worst side-effects of unfortunate emergencies. For such cases, high-end reliable and autonomous systems provide possible positive solutions. Wireless Sensor Network is one of the suitable choices for rapid transit applications to gain positive results with inexpensive implementation cost. However, managing few network consequences like fault tolerance, energy balancing and routing critical informative packets are considered to be the challenging task due to their limited resource usage restriction. In this paper, a novel fuzzy logic-based fault tolerance and instant synchronized routing technique have been proposed specifically for the rapid transit system. On utilizing the fuzzy logic concepts, most of the computational complexities and uncertainties of the system is reduced. The central thematic of the proposed design is concerned over the synchronized routing and permanent faults which abruptly depicts the non-functional nature of the sensor nodes during normal operations. Moreover, our proposed simulation outcomes proved to be improvised evidence on obtaining maximum packet delivery ratio which tends to handle an emergency situation in the compartments of rapid transits

Adaptive Routing Approaches for Networked Many-Core Systems

Through advances in technology, System-on-Chip design is moving towards integrating tens to hundreds of intellectual property blocks into a single chip. In such a many-core system, on-chip communication becomes a performance bottleneck for high performance designs. Network-on-Chip (NoC) has emerged as a viable solution for the communication challenges in highly complex chips. The NoC architecture paradigm, based on a modular packet-switched mechanism, can address many of the on-chip communication challenges such as wiring complexity, communication latency, and bandwidth. Furthermore, the combined benefits of 3D IC and NoC schemes provide the possibility of designing a high performance system in a limited chip area. The major advantages of 3D NoCs are the considerable reductions in average latency and power consumption. There are several factors degrading the performance of NoCs. In this thesis, we investigate three main performance-limiting factors: network congestion, faults, and the lack of efficient multicast support. We address these issues by the means of routing algorithms. Congestion of data packets may lead to increased network latency and power consumption. Thus, we propose three different approaches for alleviating such congestion in the network. The first approach is based on measuring the congestion information in different regions of the network, distributing the information over the network, and utilizing this information when making a routing decision. The second approach employs a learning method to dynamically find the less congested routes according to the underlying traffic. The third approach is based on a fuzzy-logic technique to perform better routing decisions when traffic information of different routes is available. Faults affect performance significantly, as then packets should take longer paths in order to be routed around the faults, which in turn increases congestion around the faulty regions. We propose four methods to tolerate faults at the link and switch level by using only the shortest paths as long as such path exists. The unique characteristic among these methods is the toleration of faults while also maintaining the performance of NoCs. To the best of our knowledge, these algorithms are the first approaches to bypassing faults prior to reaching them while avoiding unnecessary misrouting of packets. Current implementations of multicast communication result in a significant performance loss for unicast traffic. This is due to the fact that the routing rules of multicast packets limit the adaptivity of unicast packets. We present an approach in which both unicast and multicast packets can be efficiently routed within the network. While suggesting a more efficient multicast support, the proposed approach does not affect the performance of unicast routing at all. In addition, in order to reduce the overall path length of multicast packets, we present several partitioning methods along with their analytical models for latency measurement. This approach is discussed in the context of 3D mesh networks.Siirretty Doriast

Understanding information centric layer of adaptive collaborative caching framework in mobile disconnection-prone networks

Smart networks and services leverage in-network caching to improve transmission efficiency and support large amount of content sharing, decrease high operating costs and handle disconnections. In this paper, we investigate the complex challenges related to content popularity weighting process in collaborative caching algorithm in heterogeneous mobile disconnection prone environments. We describe a reputation-based popularity weighting mechanism built in information-centric layer of our adaptive collaborative caching framework CafRepCache which considers a realistic case where caching points gathering content popularity observed by nodes differentiates between them according to node's reputation and network's connectivity. We extensively evaluate CafRepCache with competitive protocols across three heterogeneous real-world mobility, connectivity traces and use YouTube dataset for different workload and content popularity patterns. We show that our collaborative caching mechanism CafRepCache balances the trade-off that achieves higher cache hit ratio, efficiency and success ratios while keeping lower delays, packet loss and caching footprint compared to competing protocols across three traces in the face of dynamic mobility of publishers and subscribers