Green Energy Model for Grid Resource Allocation

2014 ◽  
Vol 6 (2) ◽  
pp. 52-73 ◽  
Author(s):  
Achal Kaushik ◽  
Deo Prakash Vidyarthi
Keyword(s):  
Resource Allocation ◽  
Energy Efficient ◽  
Computational Grid ◽  
Energy Model ◽  
Green Energy ◽  
Energy Utilization ◽  
Theoretic Model ◽  
Performance Study ◽  
Characteristic Parameters ◽  
Grid Resource

The computational grid helps in faster execution of compute intensive jobs. Many characteristic parameters are intended to be optimized while making resource allocation for job execution in computational grid. Most often, the green energy aspect, in which one tries for better energy utilization, is ignored while allocating the grid resources to the jobs. The conventional systems, which propose energy efficient scheduling strategies, ignore other Quality of Service parameters while scheduling the jobs. The proposed work tries to optimize the energy in resource allocation to make it a green energy model. It explores how effectively the jobs submitted to the grid can be executed for optimal energy uses making no compromise on other desired related characteristic parameters. A graph theoretic model has been developed for this purpose. The performance study of the proposed green energy model has been experimentally evaluated by simulation. The result reveals the benefits and gives an insight for an energy efficient resource allocation.

A Green Energy Model for Resource Allocation in Computational Grid

2014 ◽  
Vol 58 (7) ◽  
pp. 1530-1547 ◽  
Author(s):  
Achal Kaushik ◽  
Deo Prakash Vidyarthi
Keyword(s):  
Resource Allocation ◽  
Computational Grid ◽  
Energy Model ◽  
Green Energy

scholarly journals Queue Based Energy Efficient Routing with Dynamic Resource Allocation in Mobile Adhoc Networks

2018 ◽  
Vol 7 (3.6) ◽  
pp. 343
Author(s):  
M Thebiga ◽  
R Suji Pramila
Keyword(s):  
Resource Allocation ◽  
Energy Efficient ◽  
Minimum Energy ◽  
Dynamic Resource Allocation ◽  
Energy Utilization ◽  
Mobile Nodes ◽  
Energy Efficient Routing ◽  
Mobile Adhoc Networks ◽  
Dynamic Resource ◽  
Adhoc Networks

Mobile Adhoc networks (MANETs) is defined as an assembly of mobile nodes that are connected wirelessly in which they are dynamic in nature and form a short-term and non-permanent without the dependence of any framework or central supervision and management. Restricted battery potential is considered as one of the significant snag in mobile adhoc networks, as all the nodes included in the network will operate with restricted battery potential. Because of this restricted battery potential, it is mandatory to observe energy consciousness quality in our design. In this paper, we have addressed the energy efficiency in routing by examining the buffer queue status in sequence to avoid packet loss in networks. Finally, a dynamic resource allocation scheme is depicted to minimize the time complexity. In mobile adhoc networks, stabilizing energy and minimum energy utilization are considered as the prime necessity to elongate the existence of network. For this purpose Buffer queue based energy efficient routing algorithm is proposed. This algorithm will upgrade the quality and standard of network by minimizing energy consumption. Simulation results show that the proposed scheme has an efficient performance compared to conventional schemes.  

Auction-Based Resource Allocation in Computational Grids

2013 ◽  
Vol 816-817 ◽  
pp. 847-850 ◽  
Author(s):  
Li Li Ding ◽  
Zheng Wei Wang ◽  
Xiao Ling Wang
Keyword(s):  
Resource Allocation ◽  
Complete Information ◽  
Computational Grid ◽  
Computational Grids ◽  
Grid Resource ◽  
Simulation Experiments ◽  
Auction Models ◽  
Degree Function ◽  
On Line ◽  
Grid Resource Allocation

Auction techniques have been becoming the key methods in grid resource allocation. In this paper, we propose the multi-attribute reverse auction models for computational grid resource based on the designed satisfaction degree function. The fairness is also introduced into the models and protocols to match the reality. Two auction-based protocols are presented, i.e., the offline multi-attribute auction-based protocol and the on-line multi-attribute auction-based protocol. The goal is to help the resource user make multi-attribute decisions with complete information or incomplete information. Results from simulation experiments show that these two protocols can achieve market efficiency and fairness in most instances.

A New Energy-Efficient On-Demand Routing Protocol for Green Wireless Mesh Networks

2013 ◽  
Vol 756-759 ◽  
pp. 2275-2280
Author(s):  
Yin Peng Yu ◽  
Yu Huai Peng ◽  
Lei Guo ◽  
Meng Song
Keyword(s):  
Wireless Mesh Networks ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Mesh Networks ◽  
Green Energy ◽  
Energy Utilization ◽  
Energy Depletion ◽  
Wireless Mesh ◽  
New Energy ◽  
Demand Routing

In order to solve the green energy saving problem with the wireless routing technology, a new energy-efficient survivable routing protocol, called Energy-efficient Survivable AODV (ES-AODV) for unicast demand in green Wireless Mesh Networks (WMNs), is proposed in this paper. The routing protocol uses the hop penalty strategy and flooding delaying strategy to improve the performances of traditional AODV routing protocol. This paper uses QualNet to simulate and verify the performances of proposed ES-AODV. The simulation results show that, compared with the traditional AODV, the energy utilization of ES-AODV is more efficient than AODV by 13%. At the same time, ES-AODV is more load-balancing to reduce the number of energy depletion nodes and postpone the appearance of the first energy depletion node, and thus it effectively improves the network survivability.

Distributed Entropy Energy-Efficient Clustering algorithm for cluster head selection (DEEEC)

2020 ◽  
Vol 39 (6) ◽  
pp. 8139-8147
Author(s):  
Ranganathan Arun ◽  
Rangaswamy Balamurugan
Keyword(s):  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Second Stage ◽  
Energy Efficient Clustering ◽  
Two Stages ◽  
Ch Selection

In Wireless Sensor Networks (WSN) the energy of Sensor nodes is not certainly sufficient. In order to optimize the endurance of WSN, it is essential to minimize the utilization of energy. Head of group or Cluster Head (CH) is an eminent method to develop the endurance of WSN that aggregates the WSN with higher energy. CH for intra-cluster and inter-cluster communication becomes dependent. For complete, in WSN, the Energy level of CH extends its life of cluster. While evolving cluster algorithms, the complicated job is to identify the energy utilization amount of heterogeneous WSNs. Based on Chaotic Firefly Algorithm CH (CFACH) selection, the formulated work is named “Novel Distributed Entropy Energy-Efficient Clustering Algorithm”, in short, DEEEC for HWSNs. The formulated DEEEC Algorithm, which is a CH, has two main stages. In the first stage, the identification of temporary CHs along with its entropy value is found using the correlative measure of residual and original energy. Along with this, in the clustering algorithm, the rotating epoch and its entropy value must be predicted automatically by its sensor nodes. In the second stage, if any member in the cluster having larger residual energy, shall modify the temporary CHs in the direction of the deciding set. The target of the nodes with large energy has the probability to be CHs which is determined by the above two stages meant for CH selection. The MATLAB is required to simulate the DEEEC Algorithm. The simulated results of the formulated DEEEC Algorithm produce good results with respect to the energy and increased lifetime when it is correlated with the current traditional clustering protocols being used in the Heterogeneous WSNs.

Sign in / Sign up

Export Citation Format

Share Document