Journal of Recent Research in Engineering and Technology 3(2), 2016, pp29-38

Article ID J21604 ISSN (Online): 2349 –2252, ISSN (Print):2349 –2260

© Bonfay Publications, 2016

Research Article

Energy-Efficient Fault-Tolerant Data Storage and

Processing in Mobile Cloud
T.Aswini1, M.balamurugan2, Prabhu3
1PG Scholar, Department of computer Science and Engineering, kaveryEngineering college, India
2,3Assistant Professor, Department of computer Science and Engineering, kaveryEngineering college,
India
Received 4 January 2016; Accepted 21 February 2016

ABSTRACT

For mobile devices used in dynamic networks (that is, with frequent changes in topology due to
node failure / unavailability and mobility in a mobile cloud) largely ignored, however, remained
challenges in terms of reliability and efficiency. To the best of our knowledge, we can first have to
address these challenges in an integrated manner for both data storage and processing in mobile
cloud, an approach we call k-out-of-n-Computing. In our solution, mobile devices successfully
retrieve or process data in the most energy-efficient manner, as long as k n are accessible from
remote servers. Through a real implementation of the system, we demonstrate the feasibility of our
approach. the first frame fault tolerant and energy-efficient Remote Storage & processing under a
dynamic network topology, that is, to support mobile cloud. Our framework aims, for applications
that require an energy-efficient and reliable distributed data storage and processing in a dynamic
network. For example, military operations or civil protection. Three famous fault tolerance
strategies are initiated in the following formulas to estimate the probability of default of the fault-
tolerant modules. In this work, probability of default of a cloud component is described as the
probability that precipitates an invocation of this component. The cost of the failure probability is
in the range of [0.1]. In particular, we examine how data and processes with k-out such reliability
of-n to store the data stored in mobile cloud that: 1) minimizing the energy consumption for
distributed data collection; 2) minimizing the energy consumption of distributed data for
processing and 3) data processing and dynamic topology changes are taken into account
distributed. Scheduling techniques such as the decision set to be taken by scheduling manager, if
the assigned node cloud struck leaves two planning techniques. These techniques are: restoration
technique and fault tolerance technology.

Keywords: Mobile cloud, dynamic networks, k-out-of-n-Computing, energy-efficient Remote

Storage & processing, dynamic topology, fault tolerance technology.

29
T. Aswini et al, Journal of Recent Research in Engineering and Technology
1. INTRODUCTION
To support the first frame, fault-tolerant
and energy-efficient remote storage and
processing under a dynamic network
topology, that is, mobile cloud. Our
framework is aimed for applications
requiring energy efficient and reliable
distributed data storage and processing in a
dynamic network need. For example,
military operations or civil protection. We
integrate formed of only mobile devices, the
k-out-of-n reliability mechanism in
distributed computing in mobile cloud. k-
out-of-n, a well-studied subject in reliability
control [6], ensures that a system of n
components properly, as long as k or more
components of work operates. Specifically,
we examine how to store the data and
methods, the data stored in mobile cloud
with k out of n reliability, so that: 1)
minimizing the energy consumption for
distributed data collection; 2) The energy
consumption for the processing of the
distributed data is minimized; and 3) data
processing and distributed into account
dynamic topology changes. In our proposed
frame, a data object is encoded and divided
into n fragments, and then stored on
different nodes n. As long as k or more of the
n nodes are available, the data object can be
successfully restored. Similarly, another
group assigned by n nodes tasks for
processing the stored data and all tasks,
while k or more nodes finish the n
processing the assigned tasks are completed.
The parameters k and n the degree of
reliability and different DK determine; NTH
pairs can be allocated to data storage and
data processing. System administrators
choose these parameters based on their
30
reliability requirements. Mobile Cloud
Computing (MCC) is the combination of
cloud computing, mobile computing and
wireless networks extend computing
resources for mobile users to bring network
operators, as well as cloud computing
providers. The ultimate goal of the MCC is to
make possible a variety of mobile devices
running rich mobile applications with a rich
user experience. MCC provides business
opportunities for mobile operators and
cloud providers. More comprehensively,
MCC can be defined as "rich mobile
computing technology, a variety of mobile
devices unified elastic resources of various
cloud and network technologies to unlimited
functionality, storage and mobility uses all
through the channel of Ethernet or Internet
to serve at any time regardless of
heterogeneous environments and to the pay-
as-you-use principle.MCC use approaches
rake augmentation based platforms that can
use mobile devices resource-constrained
computing resources of various cloud-based
resources. In MCC, there are four types of
cloud-based resources, namely 1) remote
motionless clouds 2) near immobile
computing entities, 3) near mobile
computing devices and 4) hybrid
(combination of three different model).
Giant clouds like Amazon EC2 are in the
distant immovable group during cloudlet or
surrogates are members near immobile
computing units. smartphones, Tablets ,
handheld devices, and wearable computing
devices are part of the third group of cloud-
based resources..
2. RELATED WORK
The Case for VM-based Cloudlets in Mobile
Computing
Journal of Recent Research in Engineering and Technology
The technical barriers to this
transformation, and proposes a new system
architecture to overcome them. (Leong et al)
propose that the architecture, a mobile user
uses virtual machine (VM) technology to
instantiate quickly customized service
software on a nearby cloudlet and then uses
this service via a wireless LAN. The mobile
device typically acts as a thin client in relation
to the Service. A cloud is a trusted, resource-
rich computer or group of computers that is
well connected to the Internet and for use by
mobile devices in the vicinity. Our strategy of
temporarily adapted related infrastructure as
a mobile device moves with its user through
the physical world use is called cloudlet based
resource-rich mobile computing. (George et
al) discuss that the Crisp interactive response
that is for seamless reproduction of the
human perception of essential is, of cloudlet
easily achieved in this architecture because of
the physical proximity and a hop network
latency. With a cloud and there, which obtain
the peak bandwidth requirements of multiple
users in reactive production and media such
as HD video and high resolution images
easier. (Cuervo et al., ) Fast adaptation of
infrastructure for various applications proves
to be an important criterion for this
architecture. We present the results of a
proof-of-concept prototypes that suggest that
this requirement can be in fact met by VM
technology.
Clone Cloud: Elastic Execution between
Mobile Device and Cloud
Connectivity provides instant access to the
available data processing, storage and
communications on commercial clouds, near
wireless hot spots with computing resources
or on the user's PC and plugged into laptop.
This wealth of cloud resources and the
31
T. Aswini et al,
mobile opportunity, it is to be used by the
dazzling variety of Flash-current
applications in app stores from Apple,
Google, Microsoft and others met. Now
mobile users look at songs of audio samples;
Play games; Capture, edit and upload video;
analyze, index and aggregate their mobile
photo collections; analyzing their finance;
and manage their personal health and
wellness. Change also new rich media,
mobile augmented reality and data analysis
applications, remember how mobile users
from experience and understand the world
around them. We combine partitioning,
migration with merging, and on-demand
instantiation of partitioning to address these
challenges. Our prototype delivers up to 20x
speedup and 20x energy reduction for the
simple applications we tested, without
programmer involvement, demonstrating
feasibility for the approach, and opening up
a path for a rich research agenda in hybrid
mobile-cloud systems.
Think Air: Dynamic resource allocation
and parallel execution in cloud for mobile
code offloading
Think Air, a new mobile cloud computing
framework that the best results from the two
worlds. Think to create air MAUI lack of
scalability addresses on the cloud virtual
machines (VMs) a complete smart phone
system, and removes the restrictions on
applications / on / ambient conditions, the
Clone Cloud induced by an online process
level of loading Adoption. Moreover think Air
(1) to an efficient way provides on-demand
resource allocation, and (2) utilizes
parallelism of the dynamic creation, resume
and destroy VMs in the cloud to perform
when needed. To the best of our knowledge,
thought Air is the first to address these two
aspects in the mobile cloud. Supporting on-
T. Aswini et al, Journal of Recent Research in Engineering and Technology
demand resource allocation is critical as
mobile users require different computing
power dynamically adjust based on their
workloads and deadlines for tasks and
therefore the cloud provider needs and their
resources to allocate to meet customer
expectations. Existing work does not provide
any mechanism to support on-demand
resource allocation, which is an absolute
necessity given the variety of applications
that can be run on smart phones, in addition
to the high variance of CPU and memory
resources these applications could demand.
The problem of exploiting parallelism
becomes important because mobile
applications require increasing amounts of
processing power, and parallelization reduces
the execution time and energy consumption
of these applications with significant margins
when compared to non-parallel executions of
the same.
Serendipity: Enabling Remote Computing
among Intermittently Connected Mobile
Devices
Mobile applications have become an
indispensable part of daily life. This was
made possible by two directions. First truly
portable mobile devices such as smart
phones and tablet PCs, are increasingly
capable devices with processing and
memory functions that make significant
improvements step with each generation.
While power in mobile devices continues
tethered device is forced to be relative, allow
advances in battery and power management
technology mobile devices to manage more
durable calculations with less strain on the
available power. A second trend, which is
directly relevant to our work, is the
availability of improved connectivity options
for mobile devices. These have enabled
applications that make the individual device
32
capabilities beyond by using remote
processing and storage. Fortunately, often a
mobile device applies, possibly
intermittently, many units capable they
compute resources lending. This
environment provides a range of computing
contexts for remote computing in a mobile
environment. An ultimately successful
system must have the flexibility to use a
blend of the options on this spectrum. On
one side of the spectrum, the use of standard
cloud computing resources is to relieve the
"heavy lifting" that are required in some
mobile applications to server or server
cluster specifically designated. A related
technique for remote processing of mobile
applications suggests offer instantiated
computing resources using cloud, the
software in real-time virtual machine
technology using near.
DistressNet: A Wireless Ad Hoc and
Sensor Network Architecture for
Situation
Management in Disaster Response
First, disasters are infrequent, and the
location, communications requirements, and
sensing needs of the next disaster cannot be
predicted. Existing WASN systems often fill
niche needs, like specialized chemical
detection, that are ill suited for general
deployment. Other solutions, like building
monitoring systems, require pre-disaster
installation and maintenance. To succeed,
WASNs supporting disaster response must
be extensible, flexible, adaptive, and
designed to leverage and incorporate
emerging technologies. A second challenge
involves scale and standardization. Small
disasters, like a localized flood, normally
involve resources from a single jurisdiction
and are organized using simple adhoc
command and control (C2). Larger disasters,
Journal of Recent Research in Engineering and Technology
like a hurricane, may incorporate thousands
of scores of jurisdictions. To manage
complexity at this scale, responders often
organize following Incident Command
System (ICS) guidelines [4]. To operate in
this difficult environment, WASNs must
provide standard architectures and
composable, scalable networks structured to
conform to ICS standards. Lack of
communications infrastructure is a third
challenge faced in larger disasters. Entire
regions suffer from degraded
communications, and remaining capacity is
exhausted by the demands of victims.
Disaster responders must arrive with their
own communications. WASNs designed for
disaster response must provide standalone,
robust, and pervasive communications
sufficient to support the geographic
coverage and mobility requirements of its
users.
High-Throughput Routing for Multi-Hop
Wireless Networks
The expected transfer count (ETX) metric is
nd a new route metric for fi high throughput
paths in multi-hop wireless networks. The
ETX of a path is the expected total number of
packet transmissions (including repeats)
required to successfully deliver a package in
this way. For practical networks, routes with
the minimum ETX have the highest
throughput. The ETX metric contains the
effects of link loss ratios, asymmetry in the
loss ratios between the two directions of each
compound, and interference between the
successive links of a path. A busy network, the
ETX route metric is used to also maximize
total network throughput. We describe the
design and implementation of an ETX metric
for DSDV and DSR routing protocols, as well
as modifications to DSDV and DSR that it
works well with ETX. Measurements of a 29-
33
T. Aswini et al,
node 802.11b test show that ETX improved
performance significantly over the
widespread minimum hop count metric. For
long distances, the increase in throughput is
often by a factor of two or more, suggesting
that ETX make useful are greater than
networks and paths longer. We also present a
simple model for predicting how the package
delivery ratio varies with packet size and
detailed measurements that characterize the
test environment of the distribution of Link
delivery conditions and route through.
Online Prediction of Battery Lifetime for
Embedded and Mobile Devices
We investigate online statistical approach to
battery life prediction that connects observed
recently Dissipation \ history "with pre
calculated online benchmark measurements.
By dynamically integrating on-line
measurements, our approach is able to make
predictions that take into account the
"recovery effect" that the batteries experience
different workloads when they are
discharged, and the charge cycle causes the
battery power changes, batteries are
recharged again and again. These systems try
to make accurate predictions derivative off-
line available for use in design or analytical
contexts. Efficient analysis methods, such as,
and consider the problems of online
prediction, but do not include the statistical
components needed to quickly analyze
dynamically changing workload and working
conditions.
3. PROPOSED WORK
We propose the first frame fault tolerant
and energy-efficient remote support Storage
& processing under a dynamic network
topology, that is, mobile cloud. Our
framework aims, for applications that require
T. Aswini et al,
energy-efficient and reliable distributed data
storage and processing in a dynamic network.
For example, military operations or civil
protection. Three famous fault tolerance
strategies are initiated in the following
formulas to estimate the probability of
default of the fault-tolerant modules. In this
work, probability of default of a cloud
component is described as the probability
that precipitates an invocation of this
component. The cost of the failure probability
is [0.1] scheduling techniques such as the
decision set in the range of which should be
taken by scheduling manager, if the assigned
node cloud struck leaves two planning
techniques. These techniques are: recovery
technique and fault tolerance technique.
4. SYSTEM DESIGN
The following fig 1 shows that the
proposed system architecture for establishing
the energy efficient storage in the mobile
cloud
Scheduling
Technique
Recovery Technique Fault - Tolerance
Technique
Recovery Block
N Version
Programming
(NVP)
Fig 1: Proposed system architecture
Journal of Recent Research in Engineering and Technology
5. METHOD
5.1 Recovery Technique
In this technique, the scheduling manager
delivers the jobs to the appropriate node
based on the order size and the node rate
value. While the job is running, the node
communicates with Tracker Scheduling
Manager and periodically sends the job stat.
The scheduling manager, the stat store
temporarily until the job is done. During job
execution, when communication is lost to the
node Tracker (nodes from the cloud), the
scheduling manager the last job to start a new
idle nodes and continues to run the job from
the last stat. Then the recovery technique is
shown in fig 2.
Fig 2: Recovery technique
5.2 Fault-tolerance Technique
In this technique, the scheduling manager use
two nodes for each job. Each node runs a copy
of the same order. Using the scheduling
manager a periodic heartbeat calling the node
Tracker to show that the node is alive. if a
node is lost (nodes leaving the cloud), read
the Scheduling Manager the current job stat
from the active node and assign it to a new
idle nodes, the job execution to continue with
the active node. Then the fault tolerance
technique is shown in fig 3.
34
Journal of Recent Research in Engineering and Technology T. Aswini et al,

6. EXPERIMENTAL RESULTS

1
0.8

0.6

Probability
Fig 3: Fault-Tolerence technique 0.4

0.2
5.3 Recovery Block (RB).

Failure
Recovery block is a known mechanism in
0
software fault tolerance used. It called 0.20% 0.40% 0.60% 0.80% 1%

System
structuring redundant modules are available,
in which stand-in components to appeal to Fig 4: Component Failure
succession when the primary component is Probability
not happening. A recovery block fails just
when all redundant mechanism fails: Existing System
∏ 1)
Proposed System
The failure probability f a recovery block can
be considered where n is the number of Impact of component failure
redundant mechanism and fi is the probability
probability of failure of the sixth part.

5.4 N-version programming (NVP).

N-version programming, also known as multi-

version programming, which is a software
fault tolerance, where several functionally
equivalent programs are also named as
versions autonomously generated from the
same original specifications. While the NPV
technique to use cloud applications
implemented, it will be independent
functionally equivalent cloud component
decided by majority decision citing parallel Fig 5: Execution time for different
and the final result. components

35
T. Aswini et al, Journal of Recent Research in Engineering and Technology
Fig 6: Comparison of performance before
and after scheduling Technique
In existing methods for mobile
devices used in dynamic networks, the
challenges in terms of reliability and
efficiency remain largely ignored. To the best
of our knowledge, we can first have to
address these challenges in an integrated
manner for both data storage and processing
in mobile cloud, an approach we call k-out-of-
n-Computing. In our proposed method, we
first fault tolerant framework and energy-
efficient remote support Storage & processing
under a dynamic network topology, that is,
mobile cloud. Our framework aims, for
applications that require an energy-efficient
and reliable distributed data storage and
processing in a dynamic network. Scheduling
techniques such as the decision set to be
taken by scheduling manager, if the assigned
node cloud struck leaves two planning
techniques. These techniques are: recovery
technique and fault tolerance technique can
be used to tolerate the fault tolerance
strategy.
7. CONCLUSION
In the mobile cloud paradigm, there is a need
for effective scheduling technique strategy
that is necessary to achieve maximum profit
for cloud service providers and maximize
user satisfaction. This paper summarizes the
architecture, planning techniques, find the
meaning components, we automatically
36
suggest an efficient fault tolerance strategy
selection algorithm NVP strategies on the
importance of components based on the
boundary conditions, to provide. This survey
is to assist us a crystal clear idea about the
broad dimensions of the energy consumption
for the procurement and processing of
distributed data and the fault-tolerant under
the dynamic network topology.
8. Future Work
In the future, to use the derived information
and enhance the framework for an efficient
and effective cloud services monitoring and
application design. The new system is useful
when the following enhancements are made
in future.
• The application can be Web service
oriented, so that it will be further developed
in any platform.
• The application, if developed as a web page,
can be used from cloud.
• The algorithm can be further improved, so
that the cost of the path can be further
reduced.
• The energy update automatically re-
configured the storage nodes.
• Currently, the scheme has a somewhat less
memory overhead, while in the more complex
applications; the program may use more
memory. The future study is in the field of
high-order memory savings.
REFRENCES
[1] M. Satyanarayanan, P. Bahl, R. Caceres,
and N. Davies, “The case for VM-based
cloudlets in mobile computing,” IEEE
Pervasive Comput., vol. 8, no. 4, pp. 14–23,
Oct.-Dec. 2009.
[2] B.-G. Chun, S. Ihm, P. Maniatis, M. Naik,
and A. Patti, “CloneCloud: Elastic execution
between mobile device and cloud,” in Proc.
6th Conf. Comput. Syst., 2011, pp. 301–314.
Journal of Recent Research in Engineering and Technology
[3] S. Kosta, A. Aucinas, P. Hui, R. Mortier, and
X. Zhang, “ThinkAir: Dynamic resource
allocation and parallel execution in the cloud
for mobile code offloading,” in Proc. IEEE
Conf. Comput. Commun., 2012, pp. 945–953.
[4] C. Shi, V. Lakafosis, M. H. Ammar, and E. W.
Zegura, “Serendipity: Enabling remote
computing among intermittently connected
mobile devices,” in Proc. 13th ACM Int. Symp.
Mobile Ad Hoc Netw. Comput., 2012, pp. 145–
154.
[5] S. M. George, W. Zhou, H. Chenji, M. Won,
Y. Lee, A. Pazarloglou,R. Stoleru, and P.
Barooah, “DistressNet: A wireless Ad Hoc and
sensor network architecture for situation
management in disaster response,” IEEE
Commun. Mag., vol. 48, no. 3, pp. 128–136,
Mar.2010.
[6] D. W. Coit and J. Liu, “System reliability
optimization with k-outof-n subsystems,” Int.
J. Rel., Quality Safety Eng., vol. 7, no. 2, pp.
129–142, 2000.
[7] D. S. J. D. Couto, “High-throughput routing
for multi-hop wireless networks,” Ph.D.
dissertation, Dept. Elect. Eng. Comput. Sci.,
MIT, Cambridge, MA, USA, 2004.
[8] Y. Wen, R. Wolski, and C. Krintz, “Online
prediction of battery lifetime for embedded
and mobile devices,” in Proc. 3rd Int. Conf.
Power-Aware Comput. Syst., 2005, pp. 57–72.
[9] A. Leon-Garcia, Probability, Statistics, and
Random Processes for Electrical Engineering.
Englewood Cliffs, NJ, USA: Prentice Hall, 2008.
[10] S. Huchton, G. Xie, and R. Beverly,
“Building and evaluating a kresilient mobile
distributed file system resistant to device
compromise,” in Proc. Mil. Commun. Conf.,
2011, pp. 1315–1320.
[11] A. G. Dimakis, K. Ramchandran, Y. Wu,
and C. Su, “A survey on network codes for
distributed storage,” Proc. IEEE, vol. 99, no. 3,
pp. 476–489, Mar. 2011.
37
T. Aswini et al,
[12] D. Leong, A. G. Dimakis, and T. Ho,
“Distributed storage allocation for high
reliability,” in Proc. IEEE Int. Conf. Commun.,
2010, pp. 1–6.
[13] M. Aguilera, R. Janakiraman, and L. Xu,
“Using erasure codes efficiently for storage in
a distributed system,” in Proc. Int. Conf.
Dependable Syst. Netw., 2005, pp. 336–345.
[14] M. Alicherry and T. Lakshman, “Network
aware resource allocation in distributed
clouds,” in Proc. IEEE Conf. Comput.
Commun., 2012, pp. 963–971.
[15] A. Beloglazov, J. Abawajy, and R. Buyya,
“Energy-aware resource allocation heuristics
for efficient management of data centers for
cloud computing,” Future Generation Comput.
Syst., vol. 28, no. 5, pp. 755–768, 2012.
16] C. Liu, X. Qin, S. Kulkarni, C. Wang, S. Li, A.
Manzanares, and S. Baskiyar, “Distributed
energy-efficient scheduling for data-intensive
applications with deadline constraints on
data grids,” in Proc. IEEE Int. Perform.,
Comput. Commun. Conf., 2008, pp. 26–33.
[17] D. Shires, B. Henz, S. Park, and J. Clarke,
“Cloudlet seeding: Spatial deployment for
high performance tactical clouds,” in Proc.
World Congr. Comput. Sci., Comput. Eng.,
Applied Comput., 2012, pp. 1–7.
[18] D. Neumann, C. Bodenstein, O. F. Rana,
and R. Krishnaswamy, “STACEE: Enhancing
storage clouds using edge devices,” in Proc.
1st ACM/IEEE Workshop Autonomic Comput.
Economics, 2011, pp. 19–26.
[19] D. Huang, X. Zhang, M. Kang, and J. Luo,
“MobiCloud: Building secure cloud
framework for mobile computing and
communication,” in Proc. IEEE 5th Int. Symp.
Serv. Oriented Syst. Eng., 2010, pp. 27–34.
[20] P. Stuedi, I. Mohomed, and D. Terry,
“WhereStore: Location based data storage for
mobile devices interacting with the cloud,” in
Proc. 1st ACM Workshop Mobile Cloud
T. Aswini et al, Journal of Recent Research in Engineering and Technology

Comput. Serv.: Soc. Netw.Beyond, 2010, pp.

1:1–1:8.
[21] S. Sobti, N. Garg, F. Zheng, J. Lai, Y. Shao,
C. Zhang, E. Ziskind, A.Krishnamurthy, and R.
Y. Wang, “Segank: A distributed mobile
storage system,” in Proc. 3rd USENIX Conf.
File Storage Technol., 2004, pp. 239–252.
[22] C. Chen, M. Won, R. Stoleru, and G. Xie,
“Resource allocation for energy efficient k-
out-of-n system in mobile ad hoc networks,”
in Proc. 22nd Int. Conf. Comput.r Commun.
Netw., 2013, pp. 1–9.
[23] C. A. Chen, M. Won, R. Stoleru, and G. Xie,
“Energy-efficient fault-tolerant data storage
and processing in dynamic network,”in Proc.
14th ACM Int. Symp. Mobile Ad Hoc Netw.
Comput., 2013,pp. 281–286.
[24] E. Cuervo, A. Balasubramanian, D.-k. Cho,
A. Wolman, S. Saroiu, R. Chandra, and P. Bahl,
“MAUI: Making smartphones last longer with
code offload,” in Proc. 8th Int. Conf. Mobile
Syst., Appl., Serv., 2010, pp. 49–62.

38