Sudip Misra

Cloud Computing Applications for Smart Grid: A Survey

The fast-paced development of power systems necessitates smart grids to facilitate real-time control and monitoring with bidirectional communication and electricity flows. Future smart grids are expected to have reliable, efficient, secured, and cost-effective power management with the implementation of distributed architecture. To focus on these requirements, we provide a comprehensive survey on different cloud computing applications for the smart grid architecture, in three different areas-energy management, information management, and security. In these areas, the utility of cloud computing applications is discussed, while giving directions on future opportunities for the development of the smart grid. We also highlight different challenges existing in the conventional smart grid (without cloud application) that can be overcome using cloud. In this survey, we present a synthesized overview of the current state of research on smart grid development. We also identify the current research problems in the areas of cloud-based energy management, information management, and security in smart grid.

Wireless sensor networks for agriculture

The existing state-of-the-art in wireless sensor networks for agricultural applications is reviewed thoroughly.The existing WSNs are analyzed with respect to communication and networking technologies, standards, and hardware.The prospects and problems of the existing framework are discussed with case studies for global and Indian scenarios.Few futuristic applications are presented highlighting the factors for improvements for the existing scenarios. The advent of Wireless Sensor Networks (WSNs) spurred a new direction of research in agricultural and farming domain. In recent times, WSNs are widely applied in various agricultural applications. In this paper, we review the potential WSN applications, and the specific issues and challenges associated with deploying WSNs for improved farming. To focus on the specific requirements, the devices, sensors and communication techniques associated with WSNs in agricultural applications are analyzed comprehensively. We present various case studies to thoroughly explore the existing solutions proposed in the literature in various categories according to their design and implementation related parameters. In this regard, the WSN deployments for various farming applications in the Indian as well as global scenario are surveyed. We highlight the prospects and problems of these solutions, while identifying the factors for improvement and future directions of work using the new age technologies.

Guide to Wireless Sensor Networks

Wireless communication technologies continue to undergo rapid advancement. In recent years, there has been a steep growth in research in the area of wireless sensor networks (WSNs). In WSNs, communication takes place with the help of spatially distributed, autonomous sensor nodes equipped to sense specific information. WSNs can be found in a variety of both military and civilian applications worldwide. Examples include detecting enemy intrusion on the battlefield, object tracking, habitat monitoring, patient monitoring and fire detection. Sensor networks are emerging as an attractive technology with great promise for the future. However, challenges remain to be addressed in issues relating to coverage and deployment, scalability, quality-of-service, size, computational power, energy efficiency and security. This highly useful guide presents a comprehensive account of the fundamental concepts, new ideas and results in the field of WSNs.

Guide to Wireless Ad Hoc Networks

Wireless ad-hoc network communication technologies have experienced a steep growth in research and significant advancements in recent times due to their important advantages. These benefits help to set-up a network fast in situations where there is no existing network set-up, or when setting up a fixed infrastructure network is considered infeasible. However, there are challenges that still need to be addressed. This indispensable guidebook provides a comprehensive resource on the new ideas and results in the areas of mobile ad-hoc networks and other ad-hoc computing systems in the wireless communication technology field. Wireless ad-hoc networks are explored by leading experts in the field from both academia and industry, with discussions on various challenges in varied environments, standards, routing mechanisms, etc. This reader-friendly, broad-ranging text features in-depth descriptions of terminologies and concepts related to the diverse subject areas germane to wireless ad hoc communication. Features: Provides an accessible, comprehensive overview of the state-of-the-art technology of wireless ad-hoc networks Includes reader-friendly discussions for practitioners, directions for future research, and helpful lists of terms and definitions Offers a set of summary questions at the end of each chapter to help readers assess their understanding of the various concepts Presents insight into the practical significance of these topics in real-world scenarios Designed, in structure and content, to aid the learning process with the intension of making the book useful at all learning levels Supplies supportive PowerPoint presentation slides and solutions to aid lecturers at www.springer.com/978-1-84800-327-9 This wide-ranging and highly useful guide will be a valuable reference/text in the field for researchers, engineers and strategists needing to know about this technology. It is also an ideal textbook for graduate students wishing to learn more about the topic. Key Topics: Routing Mobility Management Quality of Service Support Congestion Control Security Trust Management

Random Early Detection for Congestion Avoidance in Wired Networks: A Discretized Pursuit Learning-Automata-Like Solution

In this paper, we present a learning-automata-like (LAL) mechanism for congestion avoidance in wired networks. Our algorithm, named as LAL random early detection (LALRED), is founded on the principles of the operations of existing RED congestion-avoidance mechanisms, augmented with a LAL philosophy. The primary objective of LALRED is to optimize the value of the average size of the queue used for congestion avoidance and to consequently reduce the total loss of packets at the queue. We attempt to achieve this by stationing a LAL algorithm at the gateways and by discretizing the probabilities of the corresponding actions of the congestion-avoidance algorithm. At every time instant, the LAL scheme, in turn, chooses the action that possesses the maximal ratio between the number of times the chosen action is rewarded and the number of times that it has been chosen. In LALRED, we simultaneously increase the likelihood of the scheme converging to the action, which minimizes the number of packet drops at the gateway. Our approach helps to improve the performance of congestion avoidance by adaptively minimizing the queue-loss rate and the average queue size. Simulation results obtained using NS2 establish the improved performance of LALRED over the traditional RED methods which were chosen as the benchmarks for performance comparison purposes.

A simple, least-time, and energy-efficient routing protocol with one-level data aggregation for wireless sensor networks

The area of wireless sensor networks (WSN) is currently attractive in the research community area due to its applications in diverse fields such as defense security, civilian applications and medical research. Routing is a serious issue in WSN due to the use of computationally-constrained and resource-constrained micro-sensors. These constraints prohibit the deployment of traditional routing protocols designed for other ad hoc wireless networks. Any routing protocol designed for use in WSN should be reliable, energy-efficient and should increase the lifetime of the network. We propose a simple, least-time, energy-efficient routing protocol with one-level data aggregation that ensures increased life time for the network. The proposed protocol was compared with popular ad hoc and sensor network routing protocols, viz., AODV (Royer and Perkins, 1999; Das et al., 2003), DSR (Johnson et al., 2001), DSDV (Perkins and Bhagwat, 1994), DD (Intanagonwiwat et al., 2000) and MCF (Ye et al., 2001). It was observed that the proposed protocol outperformed them in throughput, latency, average energy consumption and average network lifetime. The proposed protocol uses absolute time and node energy as the criteria for routing, this ensures reliability and congestion avoidance.

Wireless sensor network-based fire detection, alarming, monitoring and prevention system for Bord-and-Pillar coal mines

Fire is a major concern for those who work in underground coal mines. Coal mine fire can occur at any time and often results in partial or total evacuation of mine personnel and could result in the loss of lives. Therefore, having a warning system that is capable of detecting fire and generating an alarm is important. In this paper, we present the response time of a proposed system for detecting fire hazard in a Bord-and-Pillar coal mine panel (Hustrulid and Bullock, 2001). It uses wireless sensor networks (WSNs), and can be used to detect the exact fire location and spreading direction, and also provide the fire prevention system to stop the spread of fire to save the natural resources and the mining personnel from fire. The proposed system is capable of early detection of fire and generating alarm in case of emergencies. The performance of the proposed system has been evaluated through rigorous simulations. Simulation results show that the average network delay varies almost linearly with the increasing the number of hops.

QoS-Guaranteed Bandwidth Shifting and Redistribution in Mobile Cloud Environment

Mobile cloud computing (MCC) improves the computational capabilities of resource-constrained mobile devices. On the other hand, the mobile users demand a certain level of quality-of-service (QoS) provisioning while they use services from the cloud, even if the interfacing gateway changes due to the mobility of the users. In this paper, we identify, formulate, and address the problem of QoS-guaranteed bandwidth shifting and redistribution among the interfacing gateways for maximizing their utility. Due to node mobility, bandwidth shifting is required for providing QoS-guarantee to the mobile nodes. However, shifting alone is not always sufficient for maintaining QoS-guarantee because of varying spectral efficiency across the associated channels, coupled with the corresponding protocol overhead involved with the computation of utility. We formulate bandwidth redistribution as a utility maximization problem, and solve it using a modified descending bid auction. In the proposed scheme, named as AQUM, each gateway aggregates the demands of all the connecting mobile nodes and makes a bid for the required amount of bandwidth. We investigate the existence of Nash equilibrium (NE) in the proposed solution. Theoretically, we deduce the maximum and minimum selling prices of bandwidth, and prove the convergence of AQUM. Simulation results establish the correctness of the proposed algorithm.

An ant colony optimization approach for reputation and quality-of-service-based security in wireless sensor networks

In wireless sensor networks (WSN), message security is an important concern. The protection of integrity and confidentiality of information and the protection from unauthorized access are important issues. However, due to factors such as resource limitations, absence of centralized access points, open wireless medium and small size of the sensor nodes, the implementation of security in WSN is a challenging task. In this paper, we propose a protocol, quality-based distance vector routing (QDV), for securing WSN using concepts based on Ant colony optimization ACO [1]. Two fundamental parameters—quality-of-service (QoS) and reputation [2]—are used. The high value of reputation of a node signifies that the node is trusted and is more reliable for data communication purposes. As a node shows signs of misbehavior, its reputation decreases, which, in turn, affects its quality-of-security QSec [2], thereby disabling the malicious nodes from gaining access to the network. By incorporating these two factors, we are able to distinguish the nodes present in the network. We, then, present a method to achieve “equilibrium” where the node is able to guarantee that its neighbors are secure. Copyright

Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks

Efficient network coverage and connectivity are the requisites for most Wireless Sensor Network (WSN) deployments, particularly those concerned with area monitoring. Due to the resource constraints of the sensor nodes, redundancy of coverage area must be reduced for effective utilization of the available resources. If two nodes have the same coverage area in their active state, and if both the nodes are activated simultaneously, it leads to redundancy in network and wastage of precious sensor resources. In this paper, we address the problem of network coverage and connectivity and propose an efficient solution to maintain coverage, while preserving the connectivity of the network. The proposed solution aims to cover the area of interest (AOI), while minimizing the count of the active sensor nodes. The overlap region of two sensor nodes varies with the distance between the nodes. If the distance between two sensor nodes is maximized, the overall coverage area of these nodes will also be maximized. Also, to preserve the connectivity of the network, each sensor node must be in the communication range of at least one other node. Results of simulation of the proposed solution indicate up to 95% coverage of the area, while consuming very less energy of 9.44J per unit time in the network, simulated in an area of 2500m^2.