Sayed Chhattan Shah

An Energy-Efficient Resource Allocation Scheme for Mobile Ad Hoc Computational Grids

Due to recent advancements in mobile computing and communication technologies, mobile ad hoc computational Grids are emerging as a new computing paradigm, enabling innovative applications through sharing of computing resources among mobile devices without any pre-existing network infrastructure. Energy-efficient resource allocation is one of the key issues in mobile ad hoc computational Grids due to limited battery life of mobile nodes. To reduce energy consumption, we propose a hybrid power-based resource allocation scheme for allocation of interdependent tasks to nodes within mobile ad hoc computational Grid. The basic idea is to exploit dependencies and task type, and allocate interdependent tasks to nodes accessible at minimum transmission power. We also propose a power-based algorithm to search a group of closest nodes to allocate a set of interdependent tasks. Compared to traditional algorithms, complexity of proposed algorithm depends on number of transmission power levels rather than number of nodes within a Grid. The scheme is validated in a simulation environment using various workloads and parameters.

Energy efficient and robust allocation of interdependent tasks on mobile ad hoc computational grid

A mobile ad hoc computational grid is a distributed computing infrastructure that allows mobile nodes to share computing resources in a mobile ad hoc environment. Compared to traditional distributed systems such as grids and clouds, resource allocation in mobile ad hoc computational grids is not straightforward because of node mobility, limited battery power and an infrastructure‐less network environment. The existing schemes are either based on a decentralized architecture that results in poor allocation decisions or assume independent tasks. This paper presents a scheme that allocates interdependent tasks and aims to reduce task completion time and the amount of energy consumed in transmission of data. This scheme comprises two key algorithms: resource selection and resource allocation. The resource selection algorithm is designed to select nodes that remain connected for a longer period, whereas the resource assignment or allocation algorithm is developed to allocate interdependent tasks to the nodes that are accessible at the minimum transmission power. The scheme is based on a hybrid architecture that results in effective allocation decisions, reduces the communication cost associated with the exchange of control information, and distributes the processing burden among the nodes. The paper also investigates the relationship between the data transfer time and transmission energy consumption and presents a power‐based routing protocol to reduce data transfer costs and transmission energy consumption. Copyright

An effective and robust two-phase resource allocation scheme for interdependent tasks in mobile ad hoc computational Grids

This paper addresses the problem of resource allocation to interdependent tasks in mobile ad hoc computational Grids. Dependencies between tasks imply that there can be heavy communication induced by data transfers between tasks executed on separate nodes. The communication in mobile ad hoc Grids is always expensive and unreliable, and therefore plays a critical role in application performance. There are several factors that contribute to communication cost. Unreliable and short-term connectivity can increase communication cost due to frequent failure and activation of links, and ineffective resource allocation can increase communication cost due to multi hop communication between dependent tasks. To reduce communication cost, an effective and robust resource allocation scheme is required. However, the design of such a scheme for mobile ad hoc computational Grids exhibits numerous difficulties due to the constrained communication environment, node mobility, and lack of pre-existing network infrastructure. In this paper, we propose a two-phase resource allocation scheme to reduce communication cost between dependent tasks. The scheme is divided into two phases. The first phase exploits the history of user mobility patterns to select nodes that provide long-term connectivity and the second phase takes into account the task and dependency types, and uses the distance information among the nodes selected in the first phase to reduce communication costs. The scheme is validated in a simulation environment using various workloads and parameters.

Resource allocation scheme to reduce communication cost in mobile ad hoc computational grids

Recent advancements in mobile computing and communication technologies have given rise to the development of mobile ad hoc computational grids which provide a software and hardware infrastructure to share computing resources in mobile ad hoc environments. The adaptation of computational grids in mobile ad hoc environments is not simple and presents numerous research challenges due to node mobility and infrastructure-less network environment. In order to improve utilisation of shared computing resources and application performance, one of the key services is a resource allocation. In this paper, we propose a centralised resource allocation scheme that allocates interdependent tasks to nodes in mobile ad hoc computational grids. First, we classify tasks and dependencies, and then exploit them to reduce communication cost between interdependent tasks, and thus application completion time. The effectiveness of proposed scheme is demonstrated through simulations.

A collaborative scheme for boundary detection and tracking of continuous objects in WSNs

With rapid advancements in MEMS technologies, sensor networks have made possible a broad range of applications in real time. Object tracking and detection is one of the most prominent applications for wireless sensor networks. Individual object tracking and detection has been intensively discussed, such as tracking enemy vehicles and detecting illegal border crossings. The tracking and detection of continuous objects such as fire smoke, nuclear explosions and hazardous bio-chemical material diffusions pose new challenges because of the characteristics of such objects, i.e., expanding and shrinking in size, changing in shape, splitting into multiple objects or merging multiple objects into one over time. A continuous object covers a large area over the network and requires extensive communication to detect and track. Tracking continuous objects accurately and efficiently is challenging, whereas extensive communication consumes massive energy in the network, and handling energy in wireless sensor network (W...

Time-Slotted Scheduling Schemes for Multi-hop Concurrent Transmission in WPANs with Directional Antenna

To achieve high-speed (Giga-bit) connectivity for shortrange wireless multimedia applications, the mmWave wireless personal area networks with directional antennas are gaining increased interest. Due to the use of directional antennas and mmWave communications, the probability of non-interfering transmissions increases in a localized region. The network throughput can immensely increase by the concurrent time allocation of non-interfering transmissions. The problem of finding optimum time allocation for concurrent transmissions is an NP-hard problem. In the literature, few “sub optimum concurrent time slot allocation” schemes have been proposed. In this paper, we propose two enhanced versions of previously proposed Multihop Concurrent Transmission (MHCT) scheme. To increase the network capacity, proposed schemes efficiently use the free holes in the time allocation map of MHCT scheme and make it more compact.

Mobile RFID and its design security issues

Mobile RFID is a new research direction and it will act as a backbone technology for ubiquity. It is a combination of two technologies: RFID and telecommunication. It is categorized into three application zones: LBZs, EZs, and PZs.Our work is divided into two phases. In first phase, we discussed numerous applications for mobile RFID zones. Each application zone possesses certain char acteristics, hence a set of design require ments for all future applications in that zone. We have provided the first working environment for mobile RFID, which shows all possible locations of its zones. In second phase, we discussed the security issues of mobile RFID application zones, as mobile RFID does not have any standard security design requirements.

Mobile Ad Hoc Computational Grid for Low Constraint Devices

We are not far from the time when environments will be smart and intelligent having capability to compute and communicate with other environments and artifacts. These environments and everyday objects will be equipped with small, inexpensive, and low power devices having capability to communicate with each other in order to organize and coordinate their actions. Computation will be freely available everywhere allowing us to perform tasks anywhere at anytime. The individuals will be equipped with lightweight devices instead of heavy devices that condense the effectiveness of individual. Furthermore, there is increasing trend towards anytime, anywhere computing paradigm that allow user to work at home, while traveling or at any location. Due to this increasing trend and availability of hundreds of low constrained devices, it will be possible for individuals to form a mobile ad hoc computational grid by integrating piecemeal devices into a single, unified computing resource that could achieve the desired result. The purpose of study is to propose architecture for mobile ad hoc computational grid for low constraint devices in order to perform high processing tasks.

Resource Allocation Scheme to Minimize Communication Cost in Mobile Ad Hoc Computational Grids

Recent advancements in mobile computing and communication technologies has given rise to development of mobile ad hoc computational grids. The mobile ad hoc computational grids provide a software infrastructure to share computing resources in mobile ad hoc environments. The adaptation of computational grids in mobile ad hoc environments is not straightforward, and presents many research challenges due to node mobility and infrastructure-less network environment. In order to improve utilization of shared computing resources and application performance, one of the key services is a resource allocation. In this paper, we propose a centralized resource allocation scheme that allocates dependent tasks among nodes in mobile ad hoc computational grids. First, we classify tasks and dependencies, and then exploit them to reduce communication cost among interdependent tasks, and thus application completion time. The effectiveness of proposed scheme is demonstrated through simulations.

Recent Advances in Mobile Grid and Cloud Computing

Grid and cloud computing systems have been extensively used to solve large and complex problems in science and engineering areas. These systems include powerful computing resources connected through high-speed networks. Due to recent advances in mobile computing and networking technologies, it has become feasible to integrate various mobile devices such as robots, aerial vehicles, sensors, and smartphones with grid and cloud computing systems. This integration enables design and development of next generation of applications through sharing of resources in mobile environments and also introduces several challenges due to dynamic and unpredictable network. This paper discusses applications, research challenges involved in design and development of mobile grid and cloud computing systems, and recent advances in the field.