Malicious Node Detection in Delay Tolerance Network

Delay tolerant networks (DTNs), such as sensor networks with scheduled intermittent connectivity, vehicular DTNs that disseminate location-dependent information, and pocket-switched networks that allow humans to communicate without network infrastructure, are highly partitioned networks that may suffer from frequent disconnectivity. In DTNs, the in-transit messages, also named bundles, can be sent over an existing link and buffered at the next hop until the next link in the path appears. This message propagation process is usually referred to as the “store-carry-and-forward” strategy, and the routing is decided in an “opportunistic” fashion. We aim to evaluate the added effect of the presence of malicious nodes on ad hoc network performance, and determine appropriate measures to detect malicious nodes. A malicious node advertising itself as having a valid route to the destination. With this intension the attacker consumes or intercepts the packet without any forwarding. An attacker can completely modify the packet and generate fake information, this cause the network traffic diverted or dropped. Let H be a malicious node. When H receives a Route Request, it sends back a Route Reply immediately, which constructs the data and can be transmitted by itself with the shortest path. So S receives Route Reply and it is replaced by H->S. then H receives all the data from S. In this research we propose a new assesment based scheme for detection of Malicious Nodes in DTN. And examine different strategies for prevention to malicious nodes as well as Compare out come proposed scheme with the earliest established schemes.

Mathematical model of delay based on a system with gamma distribution

This article is devoted to the analysis of a queuing system formed by two flows with density functions of the gamma distribution law in order to derive a solution for the average delay of requests in the queue, which is the main characteristic for any queuing system. According to this characteristic, for example, packet delays in packet-switched networks are estimated when they are modeled using the queuing system. In queuing theory, studies of G/G/1 systems are especially relevant because there is no solution in the final form for the general case. Therefore, in the study of such systems, various particular distribution laws are used as an arbitrary distribution law for G. In the study of G/G/1 systems, an important role is played by the method of spectral decomposition of the solution of the Lindley integral equation, and most of the results in the theory of queuing were obtained using this method. The article presents the derivation of the calculation formula for the average delay of requests in the queue in the system under consideration, also based on the spectral decomposition method.

A Comprehensive Survey of Social Based Routing for Delay Tolerant Networks

Delay-tolerant networks (DTN) is an approach to deal with scarce network connectivity found in sparse mobile ad-hoc networks (MANETs) which makes the problem of routing messages a challenging task. DTNs have find their usefulness in many challenging environments such as tactical networks, underwater sensor networks, wildlife monitoring, disaster recovery etc. Pocket Switched Networks (PSNs) have emerged as a new application of the delay tolerant networks where network nodes are computing devices carried by humans. Hence, the study of how humans interact in their day-to-day life, the places they visit frequently, the people they meet frequently, the social groups in which they participate on regular basis etc. can help improve routing process in PSNs. This type of routing inspired from the way humans interact with each other is referred to as social based routing and had been a recent topic of research in the field of DTNs. This paper presents a comprehensive survey of the various social-based algorithms that have been designed for Delay Tolerant Networks.

Optical Packet and Burst-Switched Networks

In order to address poor bandwidth-utilization in circuit-switched WRONs, various techniques for optical packet-switching (OPS) have been explored, but needing complex technologies, such as real-time header extraction/insertion, packet alignment, etc. An intermediate solution between the WRONs and OPS networks – the optical burst-switched (OBS) network – has been explored, where several packets are clubbed together at ingress nodes to form optical bursts, which are transmitted with the headers sent as control packets ahead of each bursts. With this prior resource-reservation scheme at en-route nodes before burst arrivals, OBS networks overcome the challenges of OPS networks, while improving bandwidth utilization as compared to WRONs. We first present the node architectures, followed by header-processing schemes and switch designs for OPS networks. Next we present the basic concepts of OBS networking and describe the necessary network protocols, including burst assembly scheme, just enough time (JET) signaling, resource-reservation and routing schemes. (145 words)

Optical Networks

This book presents an in-depth deliberation on optical networks in four parts, capturing the past, present, and ensuing developments in the field. Part I has two chapters presenting an overview of optical networks and the enabling technologies. Part II has three chapters dealing with the single-wavelength optical networks: optical LANs/MANs, optical access networks using passive optical network architecture, SONET/SDH, optical transport network and resilient packet ring. Part III consists of four chapters on WDM-based optical networks, including WDM-based local/metropolitan networks (LANs/MANs) using single and multihop architectures over passive-star couplers, WDM/TWDM access networks as an extension of PONs with WDM transmission, WDM metro ring networks covering circuit-switched (using point-to-point WDM and wavelength-routed transmission) plus packet-switched architectures and WDM long-haul backbone networks presenting the offline and online design methodologies using wavelength-routed transmission. Part IV deals with some selected topics in six chapters. The first deals with transmission impairments and power-consumption issues in optical networks, while the next three chapters deal with the survivable optical networks, network control and management techniques, including GMPLS, ASON, and SDN/SDON, and datacenter networks using electrical, optical, and hybrid switching techniques. The final two chapters present elastic optical networks using flexible grid for better utilization of the optical-fiber spectrum and optical packet and burst-switched networks. The three appendices present the basics of the linear programming techniques, noise processes encountered in the optical communication systems, and the fundamentals of queuing theory and its applications in telecommunication networks. (238 words)