Aitha Nagaraju

Network coding: ABC based COPE in wireless sensor and Mesh network

Network Coding is one of the important concepts which make wireless sensor and mesh network more efficient than the traditional one without NC technique. It encodes multiple packets into a single packet and transmits same in a single transmission cycle. COPE is one of the implementation presented by research community for network coding in wireless sensor network. In COPE, incoming packets stored in virtual queues in respective buffer and packets later on fetch in FIFO order for opportunistic coding. The researchers made several attempts to improve the performance of COPE by adopting various buffer management techniques. The COPE can give considerable coding gain in high traffic networks as per its frame work. In this paper, we are proposing conceptual view of Artificial Bee Colony approach (ABC) to increase the efficiency of COPE in Wireless Mesh networks and Sensor Networks, Wireless mesh networks are high traffic and Sensor Networks are densely deployed and data centric which can more suitable for network coding while transmitting the data packets from sensor to sink node via base station. ABC is a meta-heuristic optimization algorithm based on collective behavior of decentralized and self organizing systems naturally or artificially.

Dynamic TCP-Vegas based on cuckoo search for efficient congestion control for MANET

In the internet congestion control, transmission control protocol (TCP)-Vegas is a source algorithm that provides better performance. However, it has two main issues: first one is rerouting and unable to identify updation of round-trip time (RTT) when changes occurred in the network, these two problems leads to affects the performance of Vegas. These drawbacks persist mostly in the Vegas estimation process of the propagation delay, i.e. BaseRTT. In this paper, we proposed a novel algorithm that uses the cuckoo search optimisation algorithm for selecting the optimal value of BaseRTT. Also, our proposed algorithm has dynamically considered slow start algorithm based on the estimation in real time, the available bandwidth and adjust decrease/ increase rate in congestion avoidance phase for a particular network environment. Simulation results have shown that our proposed algorithm can effectively avoid packet losses and attain the maximum throughput when compared with existing algorithms.

Cross-layer based routing protocol and solution to packet reordering for TCP in MANET

In mobile ad hoc networks (MANETs), link failures and route changes occur most frequently, which may result in packet reordering. Transmission control protocol (TCP) performs poorly in such environment, which misinterprets the reordered packets as lost packets due to congestion. This has motivated us on developing a new protocol towards the packet reordering for improving the performance of TCP in MANETs. Optimal path or route selection is the major concern to improve the energy efficiency and network lifetime. In this paper, trust aware routing protocol for selecting optimal route in MANET is proposed. Based on this protocol, trust value for each node is calculated using direct and indirect trust value. Then the routing cost metric value is calculated and the path with minimum cost metric value is chosen as the best path in the network. After selecting the optimal path, data packet is to be transmitted through the optimal path. During the transmission, the data packet may get dropped or reordered due to congestion or mobility. A cross layer approach between network layer and transport layer to identify the dropped and reordered packets in the network is proposed in this paper. Simulation results are reported, which support this proposal.

An Artificial Bee Colony-Based COPE Framework for Wireless Sensor Network

In wireless communication, network coding is one of the intelligent approaches to process the packets before transmitting for efficient information exchange. The goal of this work is to enhance throughput by using the intelligent technique, which may give comparatively better optimization. This paper introduces a biologically-inspired coding approach called Artificial Bee Colony Network Coding (ABC-NC), a modification in the COPE framework. The existing COPE and its variant are probabilistic approaches, which may not give good results in all of the real-time scenarios. Therefore, it needs some intelligent technique to find better packet combinations at intermediate nodes before forwarding to optimize the energy and maximize the throughput in wireless networks. This paper proposes ABC-NC over the existing COPE framework for the wireless environment.

Mobile Sensor Localization Under Wormhole Attacks: An Analysis

In many application contexts, the nodes in a sensor network may be required to gather information relevant to their locations. This process of location estimation or localization is a critical aspect for all the location related applications of sensor networks. Localization helps nodes find their absolute position coordinates. Like possibly every system, localization systems are prone to attacks. Through this study we intend to do a low-level identification and analysis of broad, large-scale threat to mobile sensor localization systems due to attacks. In this paper, we study the behaviour of some well-known basic localization schemes under by far the most dangerous attacks on localization called wormhole attacks. The network and attacker model assumed in the paper are chosen so that the analysis unleashes the possibility of a resilient solution to the wormhole attacks problem independent of the nodes not under the effect of attacks.

Dynamic bandwidth allocation and congestion control using data aggregation

Wireless sensor network is a deployment of sensors and the Base station. If base station is not reachable directly for the sensors, an intermediate sink node also deployed as relay node. A sensor senses the environment and forwards the sensed raw data in digital format to the sink hop by hop. Bandwidth allocation is a phenomenon to equally distribute the probability of transmission from sensors to the sink Sink decides the rate, at which data can be received without any congestion. Social Welfare Maximization (SWM) bandwidth allocation approach, allocates the bandwidth based on the demand vector and sensing rate of the sensors. In our proposed scheme bandwidth is allocated dynamically to the sensors on the basis of transmissions being forwarded by the sensors to the sink in a given time slot. In this work we are trying to reduce the redundant transmission by applying Data Aggregation. While the data transmission from sensors to sink, overlapping data from various sensors would be aggregated to generate aggregated packet which reduces congestion. We have compared our proposed work with and without aggregation in SWM.

Secure and energy efficient routing algorithm for wireless sensor networks

In a large scale sensor network, minimum spanning tree is evaluated to route data to a sink node in a hop by hop manner. But in this route any node can be compromised or a compromised node can be included and it can inject false data or it can alter the existing data. Therefore, to provide a security we use a COmpromised nOde Locator protocol (COOL) by which we can remove compromised node from the network. When a compromised node is detected then this protocol prevents further damages from misbehaved node and forms a reliable and energy saving sensor network. Thus in our proposed algorithm, we make a path using minimum spanning tree and maintains security (COOL protocol) in wireless sensor networks. Thus, by combining both (MST and COOL protocol) we creates a secure and energy conserving environment in which sensor nodes can communicate through the sink node which is the node whom all nodes send the data through routing. Also we can check the node consistency using the hash values.

Dynamic Load Balancing with Advanced Reservation of Resources for Computational Grid

The primary requirement of heterogeneous computing is minimization of task waiting time in order to well regulate services to the users with efficient resource utilization. In this paper, we propose a dynamic load balancing with advanced reservation (DLBAR) of resources that commits advanced reservation of resources to tasks to minimize load imbalance on nodes with optimum makespan. The objective of this work is to allocate and calculate load earlier in advance on each resource before task execution started to efficiently distribute load among available resources, and other parameters like makespan are computed for performance evaluation. In order to show the effectiveness of proposed model, an unbiased comparative performance analysis is carried out with other well-known load balancing heuristic approach available in the literature. The simulation study reveals the motivation of algorithm with the superior performance of the proposed algorithm on account of all considered parameters under study.

Connected dominating set based network coding for SDN

In order to address complex and resource demanding applications. Software Defined Networks (SDN) and Network Coding (NC) paradigm has garnered much attention in recent years. NC is the key concept of networking to enhance network throughput and reliability, whereas SDN is the modern network architecture to virtualized network services for making route more flexible and allocating network resources on-the-fly. NC advances the conventional store-and-forward concept of packet flow by the notion of a store-code-forward among the intermediate nodes. With effect, source and destination no longer need to track singular packets, but rather targeting enough autonomous encoded packets. The practical coding gain lies on the complication of deploying coding techniques over the classical network of routers. The comprehensive view of SDN can overcome this challenge by separating network architecture into control plane and data plane. This paper counsels the use of SDN which not only assist traffic, but also manage buffering, scheduling and processing of packets. Further, the paper presents NC functionality rich Connected Dominated Set based Flow-oriented Coding-aware Routing technique (CFCR) to optimize number of transmissions over the SDN network.

DVFS based heterogeneous scheduling for power optimisation and load balancing in HPC clustersaper

As computation intensive scientific applications rely on high performance computing (HPC), energy consumption is a challenging issue. Reducing energy consumption is a major design constraint for modern heterogeneous computing systems. Conventional energy efficient scheduling strategies developed on distributed systems do not sufficiently exploit the system elasticity and adaptability for maximum energy savings. The conventional scheduling algorithm, dynamic power management (DPM) or dynamic voltage and frequency scaling (DVFS) do not simultaneously take account of energy usage and optimal system performance. In this paper, a novel scheduling strategy on DVFS enabled HPC clusters is proposed.