P.C. Srikanth

Novel Defense mechanism against data flooding attacks in ad hoc network

Now a days, mobile users like to use their own consumer electronic devices anywhere and at anytime to access multimedia data. Consumer electronic devices have evolved depending on user needs. Users want to use compact and portable devices such as cellular phones, laptop computers, Personal Digital Assistants (PDAs), etc. anywhere and at anytime to download multimedia data or to access realtime traffic. The mobile Ad Hoc networks have several salient characteristics, such as Dynamic topologies, Bandwidth-constrained, Variable capacity links, Energy-constrained operation and Limited physical security. Due to these features, mobile Ad Hoc networks are particularly vulnerable to denial of service attacks launched through compromised node. The communication in mobile AdHoc networks comprises of two phases, the route discovery and the data transmission. In a hostile environment, adversarial nodes can try to disrupt communication in both the two phases. However, consumer electronic devices generally operate on limited battery power and therefore are vulnerable to security threats like data flooding attacks. Flooding attack is a novel and powerful attack against on-demand Ad Hoc routing protocols. At present, FAP (Flooding Attack Prevention) is the single scheme proposed to resist such attack. But it may not give quality of service. In this paper, we present a Period Based Defense mechanism against data flooding attack in wireless AdHoc network. This is the new technique to defend the flooding attack. This scheme is based on the periods and uses a blacklist to efficiently prevent the data flooding attack. The main aim of this paper is to enhance the throughput of burst traffic. As a result of which, many data packets are forwarded at a high rate for the whole duration. The simulation results show that the proposed scheme enhances the throughput of burst traffic.

Fault tolerance in survivable WDM optical networks using hybrid scheme: An analytical approach

Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cycle upon the arrival of a new connection request. This paper presents a hybrid adaptive survivability algorithm that combines the positive effects of restoration and protection. The overall goal of the proposed approach is to improve the restoration efficiency by providing a tradeoff between proactive protection and dynamic restoration. Experimental results simulated by ns-2 network simulator and analytical results using MATLAB 7.3 are compared. In both the case hybrid scheme achieves significantly lower blocking probability than the conventional dynamic survivable techniques.

Fault-management in survivable WDM optical networks using an adaptive hybrid algorithm

Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cycle upon the arrival of a new connection request. This paper presents a hybrid adaptive survivability algorithm that combine the positive effects of restoration and protection.. The overall goal of the proposed approach is to improve the restoration efficiency by providing a tradeoff between proactive protection and dynamic restoration. Experimental results based on the ns-2 network simulator show that under high loads, the proposed algorithm achieves significantly lower blocking probability than the conventional survivable techniques.

Least resource consumption for optical WDM networks

The paper analyses the problem of link failure and recovery in the wave length division multiplexed (WDM) systems. Here the algorithms namely conversion free routing (CFR), converter shared wavelength routing (CSWR) and dedicated routing algorithms are implemented. Efficiency of these systems using three methods is examined. The network for execution is considered a WDM mesh network with different topology. In the simulator, suggested CSWR criteria gives better result in terms of execution cost and relatively cuts down on preventing possibility as number of wavelengths improves.

An optimized routing algorithm for Elastic Optical Network

The increasing capacity requirements for IP traffic in recent innovations are optical communication systems. In this paper, a new framework to handle the problem in which the sequence of the customer demands are fixed while trying to find the path for each demand in order to obtain more reasonable solution. Genetic algorithm (GA) is a search heuristic that minimizes the process of selection. Genetic algorithm belong to the larger class of evolutionary algorithms (EA), which generate solutions to optimization problems using techniques inspired by natural evolution, such as inheritance, mutation, selection, and crossover. In this paper we have designed GA with priority based encoding for selecting optimized path in the existing routes. Further we have analyzed the algorithm for NSFNET and USNET topology for effect of algorithm. We have checked the blocking probability for the traffic load in both the topologies.

A photonic crystal based pressure sensor

Photonic detecting technologies have extended physical parameter like temperature, stress detecting for huge selection of applications. The process of the photonic detecting technological innovation is to observe the modification of indicative catalog. MOEMS based micro-sized stress indicator can be developed to identify even sub-micron variety sizing modify using the photonic amazingly. The applied stress on the item will modify the sizing of the waveguide designed in the photonic amazingly. As a result, this alternation in space can alter the reproduction feature of electro-magnetic surf that passes through them that is changing the transmitting variety. So, this modification can directly be planned to stress on the noticed item. In this paper, the stress indicator using photonic amazingly has been made and examined.

GPS free localization based on relative velocity in MANETs

A stable ranging localized network can be constructed by using the relative speed of the node pair, and the direction of motion of nodes. The network topology remains constant if the nodes move with same speed and in same direction. The direction of the NCS (Network Co ordinate System) by using proposed system is consistent when compared to [1]. The LRG (Local Reference Group) selection depends on the relative speed of the nodes.

Routing and spectrum allocation in SLICE optical networks

The SLICE architecture for a 6-node network with its components is analyzed. Balanced load spectrum allocation and shortest path with maximum reuse are simulated to address the routing and spectrum allocation. The algorithms results show the reduction in sub-carrier utilization in a SLICE optical network. The simulation results also gives us the maximum subcarriers utilized in each case for various demands, guard band and load on each individual fiber links for the two different routing techniques. We analyze performance of 6 nodes for consistent traffic demands and plot the graph of traffic average verses maximum sub carriers utilized and load on each fiber link id.

Subcarrier multiplexed coherent lightwave systems using combined amplitude and frequency modulation scheme

A subcarrier multiplexed (SCM) coherent lightwave system, where each subcarrier is modulated by two baseband signals in an AM-FM format, is proposed in this paper. The analysis as presented here shows that the proposed system has an efficiency that is twice that of the conventional analog SCM systems, while it maintains an overall performance at a similar level.