Abhishek Swaroop

A Token-Based Group Mutual Exclusion Algorithm for Cellular Wireless Networks

Due to the mobility of hosts, limited battery power and processing power of mobile hosts, and the low bandwidth of wireless channels, the existing distributed algorithms designed for the static distributed systems required to be restructured before these can be used in the cellular wireless networks. The group mutual exclusion (GME) problem is an interesting generalization of the classical mutual exclusion problem which deals with two contradictory issues of mutual exclusion and concurrency. In the present paper, we propose a hierarchical token-based algorithm to solve the GME problem in cellular wireless networks. To the best of our knowledge the proposed algorithm is the first GME algorithm for cellular networks. In the proposed algorithm, a resource starved mobile host requires very little data structure and the bulk of the computation is performed at the resource rich base station level.

Linear sensor networks: Applications, issues and major research trends

The recent advancements in the field of Wireless Sensor Networks (WSN) make the sensors smaller, cheaper and more energy efficient. These innovations made it attractive to use sensor networks in new applications like Border monitoring, Railway track monitoring, Oil and Gas pipeline monitoring etc. In the above mentioned applications, a common characteristic is their linear topology. Since last few years, a new subclass of sensor networks known as linear sensor networks (LSN) is emerging as a major focus area of research. Due to the special topology of LSNs, the issues and solutions required for LSNs are significantly different from ordinary sensor network. In the present exposition, the applications of LSN, major issues related to LSN, and the major research trends in this area have been summarized.

Token Based Group Local Mutual Exclusion Algorithm in MANETs

In this paper, a generalization of the group mutual exclusion problem based upon the concept of neighborhood has been proposed and named as group local mutual exclusion (GLME). The neighborhood is defined based upon the location of shared resources and no synchronization is required between nodes in two different neighborhoods. A token-based solution of the GLME has also been proposed. The algorithm satisfies safety, starvation freedom, and concurrent occupancy properties. The proof of correctness has also been included in the present paper. To the best of our knowledge, it is the first token-based algorithm to solve GLME problem in MANETs.

A brief survey of blackhole detection and avoidance for ZRP protocol in MANETs

Within Mobile Ad-Hoc Network(MANETs) unusual categories of routing protocols have been determined. It is a group of wireless system. MANET is other susceptible to a variety of attack than wired system. Black hole attack is further meticulous intimidation to MANETs. The routing protocols of MANET is less protected and therefore consequenced the system with malicious node. There are various routing protocols being used for MANETs. All routing protocols have been briefly discussed, however, Zone Routing Protocol (ZRP) is discussed in detail. Black hole is a major security threat for MANETs. Hence, in this paper, the various techniques used for detection and avoidance of Black hole attack in MANETs using ZRP routing protocol have been discussed.

A survey on techniques to achive energy efficiency in cloud computing

Due to the increased usage of Information and Communication Technology, together with increasing energy costs and the need to reduce greenhouse gas emissions the energy consumption required for cloud computing system need to be reduced. Hence, the energy-efficient technologies that decrease the overall energy consumption of computation, storage and communications in cloud computing have become more important. The researchers have so far focused on hardware aspects, scheduling, virtualization and clustering for saving energy. The major techniques available in the literature for energy saving in cloud computing such as energy efficient hardware, energy efficient scheduling, consolidation, energy efficient network and clustering servers have also been discussed in the present exposition.

A Hybrid Algorithm to Solve Group Mutual Exclusion Problem in Message passing Distributed Systems

In the present paper, we propose a hierarchical algorithm to solve the group mutual exclusion (GME) problem in clusterbased systems. We consider a two-level hierarchy in which the nodes are divided in to clusters and a node in each cluster is designated as coordinator which is essentially the cluster head. The number of global messages per critical section entry in our algorithm depends upon the number of clusters in the system unlike most of the existing GME algorithms where it depends upon the total number of nodes in the system. Performance of the algorithm directly depends on the coherent behavior of nodes inside clusters. The results have been substantiated with extensive simulation. A fault tolerant extension of the algorithm has also been proposed in the present exposition.

A token-based solution to the group mutual l-exclusion problem in message passing distributed systems

The Group Mutual l-Exclusion (GMLE) problem is an interesting combination of two widely studied generalizations of the classical mutual exclusion problem namely, k-exclusion and group mutual exclusion (GME). In GMLE, up to l sessions can be held simultaneously. In the present exposition, we propose a token-based algorithm to the GMLE problem. To the best of our knowledge, this is the first token-based algorithm for the GMLE problem. The proposed algorithm satisfies all properties necessary for a GMLE algorithm.

Energy Efficient Management of Pipelines in Buildings Using Linear Wireless Sensor Networks

The efficient and safe management of air conditioner (AC), Piped Natural Gas (PNG) and water pipelines in large buildings is a major challenge for the safety of these buildings. In recent years, Linear Wireless Sensor Networks (LWSN) are being used extensively for monitoring of long natural gas, water, and oil pipelines. LWSNs can also be used for efficient and safe management of AC, PNG and water pipelines in large buildings. In this paper, a scheme for optimal placement of sensors and base stations in a linear fashion to monitor the various pipelines used in large buildings has been proposed. The proposed scheme utilizes the Lion Optimization Algorithm (LOA) and has been compared with three strategies, namely Ant Colony Optimization (ACO), Genetic Algorithm (GA) and Greedy Approach with respect to throughput, lifetime and end-to-end delay. The simulation results show that the proposed scheme exhibits better performance in comparison to the other three considered techniques for all the three parameters. The most striking feature of the proposed approach is that optimization is more effective when the length of the pipeline is more as far as end-to-end delay is concerned. The lifetime of the network is significantly improved using the proposed approach, especially when the length of the pipeline is of medium size, which makes the proposed scheme suitable for energy efficient buildings.

A QoS Aware Self Adaptive General Scheme to Solve GME Problem

The Group mutual exclusion problem (GME) is a resource allocation problem which allows concurrency along with mutual exclusion. The concept of GME can be applied to various fields having varying quality of service (QoS) requirements. The present paper presents a self adaptive general scheme to solve GME problem using token-based approach. The striking feature of the scheme is that it considers QoS requirements, checks the QoS requirements time to time and adapts its parameters if there are deviations from the expected behavior. The dynamic analysis of the scheme has also been presented in the present exposition.

An Improved Quorum-Based Algorithm for Extended GME Problem in Distributed Systems

The extended GME (group mutual exclusion) problem is a natural extension of the GME problem. In extended GME problem, processes are allowed to request more than one resource at a time, in order that the processes that can proceed by having access to any one of the requested resource can be allowed to do so. Manabe-Park suggested a quorum based solution for the extended GME problem. However, the worst case message complexity of the Manabe-Park algorithm is 9q, where q is the quorum size. Further, the synchronization delay of Manabe-Park algorithm is 4T, where T is the maximum message propagation delay. In the present paper, we propose a quorum based solution for the extended GME problem. The worst case message complexity of our algorithm is 7q and synchronization delay is 3T. Moreover, in the best case, the synchronization delay and message complexity come down to 2T and 3q respectively.