Energy-Efficient Gossiping Protocol of WSN with Realtime Streaming Data

2014 ◽  
Author(s):  
Byungjun Lee ◽  
Ho Kuen Song ◽  
Youngho Suh ◽  
Kyung Hwan Oh ◽  
Hee Yong Youn
Keyword(s):  
Energy Efficient ◽  
Streaming Data

Energy-Efficient Edge Inference on Multi-Channel Streaming Data in 28nm HKMG FeFET Technology

2019 ◽  
Author(s):  
S. Dutta ◽  
W. Chakraborty ◽  
J. Gomez ◽  
K. Ni ◽  
S. Joshi ◽  
...  
Keyword(s):  
Energy Efficient ◽  
Streaming Data

RE-STORM: REAL-TIME ENERGY EFFICIENT DATA ANALYSIS ADAPTING STORM PLATFORM

2016 ◽  
Vol 78 (10) ◽  
Author(s):  
Rizwan Patan ◽  
Rajasekhara Babu M.
Keyword(s):  
Energy Efficiency ◽  
Big Data ◽  
Response Time ◽  
Energy Efficient ◽  
Data Stream ◽  
High Performance ◽  
High Energy ◽  
Streaming Data ◽  
Stream Computing ◽  
High Energy Efficiency

It is necessary to model an energy efficient and stream optimization towards achieve high energy efficiency for Streaming data without degrading response time in big data stream computing. This paper proposes an Energy Efficient Traffic aware resource scheduling and Re-Streaming Stream Structure to replace a default scheduling strategy of storm is entitled as re-storm. The model described in three parts; First, a mathematical relation among energy consumption, low response time and high traffic streams. Second, various approaches provided for reducing an energy without affecting response time and which provides high performance in overall stream computing in big data. Third, re-storm deployed energy efficient traffic aware scheduling on the storm platform. It allocates worker nodes online by using hot-swapping technique with task utilizing by energy consolidation through graph partitioning. Moreover, re-storm is achieved high energy efficiency, low response time in all types of data arriving speeds.it is suitable for allocation of worker nodes in a storm topology. Experiment results have been demonstrated the comparing existing strategies which are dealing with energy issues without affecting or reducing response time for a different data stream speed levels. Finally, it shows that the re-storm platform achieved high energy efficiency and low response time when compared to all existing approaches.

Task scheduling and resource allocation of seasonal requests of users in cloud using NMKA and CM-GA techniques

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
S. Prathiba ◽  
Sharmila Sankar
Keyword(s):  
Resource Allocation ◽  
Response Time ◽  
Task Scheduling ◽  
Energy Efficient ◽  
Feature Reduction ◽  
Streaming Data ◽  
Frequent Itemset ◽  
Process Time ◽  
Content Type ◽  
Cauchy Mutation

Purpose The purpose of this paper is to provide energy-efficient task scheduling and resource allocation (RA) in cloud data centers (CDC). Design/methodology/approach Task scheduling and RA is proposed in this paper for cloud environment, which schedules the user’s seasonal requests and allocates resources in an optimized manner. The proposed study does the following operations: data collection, feature extraction, feature reduction and RA. Initially, the online streaming data of seasonal requests of multiple users were gathered. After that, the features are extracted based on user requests along with the cloud server, and the extracted features are lessened using modified principal component analysis. For RA, the split data of the user request is identified and that data is pre-processed by computing closed frequent itemset along with entropy values. After that, the user requests are scheduled using the normalized K-means algorithm (NKMA) centered on the entropy values. Finally, the apt resources are allotted to that scheduled task using the Cauchy mutation-genetic algorithm (CM-GA). The investigational outcomes exhibit that the proposed study outruns other existing algorithms in respect to response time, execution time, clustering accuracy, precision and recall. Findings The proposed NKMA and CM-GA technique’s performance is analyzed by comparing them with the existing techniques. The NKMA performance is analyzed with KMA and Fuzzy C-means regarding Prc (Precision), Rca (Recall), F ms (f measure), Acr (Accuracy)and Ct (Clustering Time). The performance is compared to about 500 numbers of tasks. For all tasks, the NKMA provides the highest values for Prc, Rca, Fms and Acr, takes the lowest time (Ct) for clustering the data. Then, the CM-GA optimization for optimally allocating the resource in the cloud is contrasted with the GA and particle swarm optimization with respect to Rt (Response Time), Pt (Process Time), Awt (Average Waiting Time), Atat (Average Turnaround Time), Lcy (Latency) and Tp (Throughput). For all number of tasks, the proposed CM-GA gives the lowest values for Rt, Pt, Awt, Atat and Lcy and also provides the highest values for Tp. So, from the results, it is known that the proposed technique for seasonal requests RA works well and the method optimally allocates the resources in the cloud. Originality/value The proposed approach provides energy-efficient task scheduling and RA and it paves the way for the development of effective CDC.

Performance Evaluation of AFOD Protocol for Energy Efficient Routing

2011 ◽  
Author(s):  
B. Smitha Shekar ◽  
M. Sudhakar Pillai ◽  
G. Narendra Kumar
Keyword(s):  
Performance Evaluation ◽  
Energy Efficient ◽  
Energy Efficient Routing

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