Sarbani Roy

A modified SPIN for wireless sensor networks

Data transmission is one of the major challenges in wireless sensor network (WSN). Different routing protocols have been proposed to save energy during data transmission in WSN. Routing protocols based on data-centric approach are suitable in this context that performs in-network aggregation of data to yield energy saving data dissemination. In this paper we propose a modified version of SPIN protocol named M-SPIN and compare its performance with traditional SPIN protocol using broadcast communication, which is a well known protocol as benchmark. We evaluate the M-SPIN protocol using simulation in TOSSIM environment. We find that, M-SPIN exhibits significant performance gains than traditional SPIN routing.

Multiple-sink placement strategies in wireless sensor networks

Multiple sinks are deployed in large-scale wireless sensor networks (WSNs) to minimize transmission delay and energy consumption and also to extend the network life time. Since the data collected by sensor nodes are forwarded to the sink, therefore proper placement of sinks has a great impact on the performance of the WSNs. This paper introduces two sink placement strategies and discusses their advantages and disadvantages in comparison with an existing strategy. The two strategies are compared with the Geographic Sink Placement (GSP) [3] strategy which is used as a benchmark. Both GSP and proposed two strategies are implemented and evaluated in a simulation environment. Performances of these strategies are analyzed and analysis results are presented in this paper. It has been observed that the proposed strategies exhibit better performances with respect to energy usage and lifetime in comparison with GSP.

An experience of implementing IPv6 based data retrieval system for Wireless Sensor Networks

Wireless Sensor Network (WSN) is one of the most demanding research topics prevalent in the modern research domain. WSN consists of densely deployed sensor nodes in the area which is to be sensed or monitored. Each sensor node is a tiny and power constrained device which is assigned the task of monitoring. Sensor networks have a very wide range of application and so they are much in demand. Every tiny sensor node needs to transmit the sensed data to more powerful sink nodes or base station. Thus as communication is an important aspect of WSN, so the underlying technologies being used should also be competent enough to enable better functionalities. This paper deals WSN technologies. A successful WSN has been designed with heterogeneous sensing devices using the most popular and efficient technology, namely the IP technology.

Negotiation based service brokering using game theory

Enterprise cloud computing has emerged as a promising technology, where on-demand provisioning of services like storage, infrastructure, software and platform are provided. Growing market of cloud computing, resulted in a variety of heterogeneous cloud services. This leads to a difficult problem for Cloud Service Consumer (SC) when selecting their best fitting Cloud Service Providers (SP), who can provide best quality resource at negotiated price. Thus we propose a middleware based Cloud Service Broker (SB) architecture for enterprise cloud computing. The objective of SB is to find the most suitable SP for a SC based on negotiation with Service Level Agreement (SLA) parameters like price and quality. Second we propose game theory model for automatic SLA negotiation between SC and SP where CSB provides optimal value of price and quality to both the parties.

A comparative study on routing schemes of IP based wireless sensor network

As the world is moving towards the “Internet of Things” [1], Internet Protocol enabled wireless sensor network is becoming an important research area. In order to make it possible and to facilitate transmission of IPv6 packets over low powered networks, 6LoWPAN [9,11] has been introduced. 6LoWPAN incorporates an adaptation layer between network and data link layers. Two routing schemes are used in 6LoWPAN depending on which layer takes routing, forwarding decisions. If adaptation layer takes the decision, then it is called mesh under, whereas if the network layer is involved, then the scheme is route over. In this paper, we present a comparative study of these two schemes. Various performance metrics, such as average round-trip time delay, end to end delay and packet delivery ratio are compared and suitability of the two schemes are analyzed for a Sensor-Grid infrastructure. We also propose a technique which improves the route-over scheme. Our ultimate goal is to apply this Sensor-Grid infrastructure in health-care applications.

An Adaptive Execution Scheme for Achieving Guaranteed Performance in Computational Grids

Nature of the resource pool in a Grid environment is heterogeneous and dynamic. Availability, load and status of the resources may change at the time of execution of an application. Therefore, in order to maintain the performance guarantee (as has been agreed upon through service level agreements (SLAs) between the client and the resource providers), an application may need to adapt to its run-time environment on the basis of resource availability and application demands. Often it may be required to migrate the application components to a new set of resources during their execution so that performance guarantee can be maintained. Objective of this paper is to present an adaptive execution scheme for achieving guaranteed performance on the basis of the SLAs. The scheme has been implemented based on the notion of performance properties and by deploying a set of autonomous agents within an integrated performance-based resource management framework.

Adaptive execution of jobs in computational grid environment

In a computational grid, jobs must adapt to the dynamically changing heterogeneous environment with an objective of maintaining the quality of service. In order to enable adaptive execution of multiple jobs running concurrently in a computational grid, we propose an integrated performance-based resource management framework that is supported by a multi-agent system (MAS). The multi-agent system initially allocates the jobs onto different resource providers based on a resource selection algorithm. Later, during runtime, if performance of any job degrades or quality of service cannot be maintained for some reason (resource failure or overloading), the multi-agent system assists the job to adapt to the system. This paper focuses on a part of our framework in which adaptive execution facility is supported. Adaptive execution facility is availed by reallocation and local tuning of jobs. Mobile, as well as static agents are employed for this purpose. The paper provides a summary of the design and implementation and demonstrates the efficiency of the framework by conducting experiments on a local grid test bed.

Efficient resource management for running multiple concurrent jobs in a computational grid environment

Managing resources in Grid is an intricate issue and is not possible at the application or user level. Grid provides uniform access to heterogeneous resources owned by multiple organizations. Any time a new resource can join the Grid or an existing resource can withdraw. The system loads and status of the resources also change frequently. Thus, a resource broker is an essential component in a Grid environment that can assist in the selection of a right resource provider for a job in all aspects. This paper discusses the design and implementation of resource brokering strategies within the multi-agent framework. These strategies help in finding out an optimal allocation of resources for executing multiple concurrent jobs in a Grid environment. Different stages in resource brokering and their implementation within the framework are discussed. The paper also presents results of evaluating the strategies and demonstrates their effectiveness.

Resource requirement prediction using clone detection technique

In order to maintain the QoS requirements of jobs running on a large distributed system, like Cloud and Grid environments, resource requirements of jobs should be predicted prior to their submission, and on the basis of this prediction, appropriate resources can be selected for their execution. However, because of the dynamic and heterogeneous nature of the modern distributed systems, estimation of resource requirements is a challenging task. This paper presents a feedback-based job modeling scheme based on clone detection technique. In this scheme, the execution data for each job which runs in the environment is stored in Execution History. A newly submitted job is analyzed to find its clones from the execution history and on the basis of the data stored in the execution history, the resource requirement of the new job is predicted. Different levels of clones are discussed in this paper and a metric-based clone detection technique is presented. An automatic resource requirement prediction scheme for jobs is proposed. The paper also evaluates a preliminary implementation of the scheme and discusses the results of using the scheme for some test codes.

An Alternative Approach to Find the Fermat Point of a Polygonal Geographic Region for Energy Efficient Geocast Routing Protocols: Global Minima Scheme

Geocasting is a special variant of multicasting, where a data packet is destined for a particular geographic region. For many applications in wireless ad hoc and sensor networks, geocasting is an important and widely used communication service. Many geocast routing protocols with different approachability have been developed. Amongst them the geometry driven approach addresses the usage of an optimum path through the Fermat point of a triangle for packet forwarding. However, the geometry driven scheme faces some practical problems while determining the Fermat point for a polygonal region. Moreover, the method proposed can not be generalized for triangles with an angle more than 120¿. In this paper we discuss a global minima based scheme for finding the Fermat point of a n sided polygonal geographic region, which is more general in its approach and is free from some of the constraints present in the geometry based scheme for finding the Fermat point. Along with that, the present scheme outplays the geometry driven scheme when it comes to the distance traveled by a packet and the energy consumed therefore.