Subhabrata Barman

Energy efficient routing mechanism in Wireless Sensor Network

This paper gives a brief idea about wireless sensor networks and energy efficient routing in wireless sensor networks. Sensor networks are deployed in an ad hoc fashion, with individual nodes remaining largely inactive for long periods of time, but then becoming suddenly active when something is detected. Sensor Networks are generally battery constrained. They are prone to failure, and therefore the sensor network topology changes frequently. In this paper, we propose a routing algorithm for Wireless Sensor Networks combining Energy Efficient and Hierarchical based routing techniques which minimize the energy consumption, increase the lifetime of the sensor nodes and saves battery power.

Load balanced static grid scheduling using Max-Min heuristic

Grid computing, inspired by electrical power Grid, is an emerging trend for making easy access to computing resources. Its main objective is to solve computationally hard problems which otherwise cannot be solved by single CPU. This extremely high computing power is achieved by optimal utilization of geographically distributed heterogeneous resources which are lying idle. Load balanced task scheduling is very important problem in complex Grid environment. So task scheduling which is one of the NP-Complete problems becomes a focus of research scholars in Grid computing area. The traditional Min-Min and Max-Min algorithms are simple algorithms that produces a schedule that minimizes the makespan than the other traditional algorithms in the literature. In real scenario of Min-Min and Max-Min failed to produce a load balanced schedule. The proposed method has two-phases. In the first phase the traditional Max-Min algorithm is executed and in the second phase the tasks are rescheduled to use the unutilized resources effectively.

Local search based approach in grid scheduling using Simulated Annealing

Grid computing is a High Performance Computing environment. Load balancing is an important aspect of Grids, which provide the necessary resource management features. This decision is made by a resource management component of the Grid, namely, the Grid scheduler. While Grid users are often interested in satisfaction of their Quality of Service (QoS) requirements, these cannot be satisfactorily handled by commonly used queue-based approaches. In this paper, a local search based approach based on Simulated Annealing (SA) is proposed as a periodical optimizer to other dynamic, space shared and schedule-based scheduling policies. SA is found to be most reliable method to apply in practice. Using SA it has been proved that it is possible to converge to the best solution.

A Comparison Between Genetic Algorithm and Cuckoo Search Algorithm to Minimize the Makespan for Grid Job Scheduling

Major subjects like heterogeneity of resources, dynamic and autonomous character of Grid resources are most important challenges for Grid job scheduling. Additionally, there are issues of various strategies being maintained by the resource providers and followed by resource users for execution of their jobs. Thus optimal job scheduling is an NP-complete problem which can easily be solved by using heuristic approaches. This paper compares two heuristic methods: Genetic Algorithm (GA) and Cuckoo Search Algorithm (CSA) for job scheduling problem in order to efficiently allocating jobs to resources in a Grid system so that the makespan is minimized. Our empirical results have proved that the CSA performs better than the GA.

Job scheduling in computational grid based on an improved cuckoo search method

Grid computing is a high performance distributed computing platform to solve complex and large-scale scientific problems. It consists of heterogeneous computing resources connected by a network across dynamic and geographically distributed organisations to create a distributed high performance computing infrastructure. Job scheduling in computational Grid is known as NP-complete problem owing to the problem complexity and intractable nature of the problem. Such a problem could be solved using heuristic algorithms. These types of algorithms have the ability to find a near optimal solution in reasonable time rather than the optimal solution in a very long processing time. The primary objective of the scheduling is to minimise the makespan of the system. In this paper, an Improved Cuckoo Search (ICS) optimisation method has been proposed for scheduling user-jobs to available resources so that various performance metrics are optimised. Here, our attention has been focused on the improvement of computational Grid performance in terms of makespan and completion time. The study reveals that the proposed ICS algorithm provides better results in comparison with Cuckoo Search (CS) and Simulated Annealing (SA).

Symmetric key based blocked oriented digital enveloping

Digital enveloping is the process of embedding information into a digital multimedia object which is used to protect information, and conceal secrets. In digital enveloping, concentration in given on the retrieval of the original data enveloped within another media. In this current work we have proposed a technique called block oriented digital enveloping where an image as secret is enveloped within another image. Here the cover image is divided into blocks and the blocks are chosen based on a pseudo random sequence generated by a symmetric key. For testing, the paper presents 2 types of bit replacing and performs various quality measures of the enveloped image.

Cluster-Based Energy-Efficient Secure Routing in Wireless Sensor Networks

To get inexpensive resolution of real-world problems such as weather forecasting, measurement of underground water label, traffic monitoring, activity of enemies, animals counting in forest, and so on, wireless sensor networks (WSNs) are widely used. Energy-efficient routing protocol is needed to provide the longevity of network lifetime by reducing power consumption of sensor nodes as well as whole networks. Besides, authenticity of sensor nodes and privacy of sensed data are needed in routing protocol for WSNs to provide secure communications, i.e., sensor-to-sensor as well as sensors-to-base station. Clustering technique provides an energy-efficient topology control approach. A minimum connected dominating set (MCDS) can be discovered by applying clustering technique which reduces power consumption in inter-cluster network routing. Cluster head and route selection can be used to provide an energy-efficient outer-cluster routing in WSNs. Identity-based scheme can be used to provide a secure secret message passing mechanism in WSNs. This paper has ng in wireless sensor network framework (E2SDRSNF) which consists of three proposed components. The proposed Algorithm 1 creates a MCDS which is used to build virtual backbone for energy-efficient inter-cluster routing. Data flows through the discovered virtual backbone nodes to base station via cluster heads which is discovered by applying proposed Algorithm 2. The proposed signcryption technique is used for secure communication in WSNs. The analysis of the proposed framework shows that it can save 2720 nJ/bit/m\(^2\) energy than LEACH protocol for one communication (transmission/receiving) along with the security.

Effects of Persistent Misbehaving Nodes in Wireless Sensor Networks

In a wireless sensor network (WSN), sensor nodes may temporarily exhibit mal-behavior (e.g., dumb behavior) under adverse environmental conditions. A misbehaving node may gain back its work ability with the return of favorable weather conditions. In this paper, we consider some scenarios where sensor nodes exhibit mal-behavior for a significant duration of time. We call such misbehaving nodes as “persistent misbehaving nodes”. We present an analytical model which shows the severeness of the detrimental effects caused by persistent misbehaving nodes. The performance analysis corroborates our model and compares the effects of temporary and persistence misbehaving nodes. The results of the performance analysis also show that the existence of persistent misbehaving nodes causes 38% degradation in throughput and 18% extra energy depreciation than the temporary misbehaving nodes. The analysis and performance analysis led us to enlist some open research issues in the concluding section.

ISCP: Inter State Changing Problem in Wireless Sensor Network with Dumb-Behaving Nodes

In a wireless sensor network (WSN), different types of nodes (i.e., active, misbehaving, dead) may coexist. To ensure seamless performance of the network, network administrators often use several mechanisms to recover misbehaving or faulty nodes. As it is impossible for a node to predict the state of another node, the recovery attempts may not be successful every time. Such unsuccessful attempts may bring detrimental effects to the network. In this paper, we introduce three of such problems which occur due to change in state (such as dumb to dead, etc.) with such attempts. We name the problems as Recovery Attempt for Dead (RAD) node, Insecure Recovery Attempt (IRA), and Data Burst (DB). The detrimental effects of these problems are evaluated using network simulator 3 (ns3) simulations. Additionally, this paper also suggests some solution guidelines for these problems. The analysis and simulation experiments led us to enlist some open research issues in the concluding section.

Performance Analysis of IEEE 802.11 Rate Adaptation Algorithms Categorized Under Rate Controlling Parameters

Signal to Noise Ratio(SNR) and Frame Loss Statistic are two basic information used by IEEE 802.11 Rate Adaptation Algorithms for controlling data rates to achieve optimal data transfer. Despite these common information, different Rate Adaptation Algorithms initiate their Rate Control Activities depending on several other parameters such as successful or fail frame count, calculated SNR, Bit Error Rate (BER), loss ratio threshold, statistical analysis etc. In these paper we classify Rate Adaptation Algorithms into three rate controlling categories, Namely- i.Packet Count Based, ii.Analysis and Calculation Based, iii.Statistical Measurement Based. We survey algorithms from different categories and prepare a summarized activity table for better assessment. We also present a simulation based performance analysis of different algorithms using Network Simulator 3 (ns-3). The survey and performance analysis led us to enlist some open issues on Rate Adaptation technique, in the concluding section.