Skip to main content

A CONTEXT-AWARE ARCHITECTURE SUPPORTING SERVICE AVAILABILITY IN MOBILE CLOUD COMPUTING

A CONTEXT-AWARE ARCHITECTURE
SUPPORTING SERVICE AVAILABILITY
IN MOBILE CLOUD COMPUTING

ABSTRACT

Mobile systems are gaining more and more importance, and new promising paradigms like Mobile Cloud Computing are emerging. Mobile Cloud Computing provides an infrastructure where data storage and processing could happen outside the mobile node. Specifically, there is a major interest in the use of the services obtained by taking advantage of the distributed resource pooling provided by nearby mobile nodes in a transparent way. This kind of systems is useful in application domains such as emergencies, education and tourism. However, these systems are commonly based on dynamic network topologies, in which disconnections and network partitions can occur frequently, and thus the availability of the services is usually compromised. Techniques and methods from Autonomic Computing can be applied to Mobile Cloud Computing to build dependable service models taking into account changes in the context. In this work, a context-aware software architecture is proposed to support the availability of the services deployed in mobile and dynamic network environments.






EXISTING SYSTEM

                  Several approaches to address the availability of the services in mobile environments can be found in the literature. Generally, they are based on adaptive schemes, following the reference model for autonomic control loops, MAPE-K (Monitor, Analyse, Plan, Execute, and Knowledge).In the case of this kind of systems, two steps in the adaptation loop provide a major impact on their efficiency: when to replicate and where to deploy a service. There are different events that can trigger the creation, migration or deletion of replicas: the battery of the host node is running out, or the node switches off, the demand for the service increases, along with others. In addition to these events, it is worth mentioning the prediction of a network partition. A network partition can affect the availability of a service and the consistency of the shared information.

PROPOSED SYSTEM:
Ø      This paper introduces a context-aware software architecture, which aims to provide an adaptable and energy-efficient solution to support the availability of services in mobile clouds.
Ø       The proposal is based on service replication techniques together with a self-configuration approach for the activation/hibernation of the replicas of the service depending on relevant context information from the mobile system.
Ø      To that end, an election algorithm has been designed and implemented.
Ø       This proposal is based on previous work , which allows us to now address in detail all the structural and behavioural design issues, as well as the context information model, for the complete definition of the architecture
Ø       Additionally, its implementation and a simulation on the Network Simulator 3 (ns-3 1 ) have been performed, which allows us to show the feasibility of the architecture.

ADVANTAGES:
Ø      The proposed architecture provides a reusable and adaptable base to support the availability of services in mobile clouds.
DISADVANTAGES:

Ø The lack of computational resources.
Ø  Transmission errors, or routing overhead.

HARDWARE REQUIREMENTS:
Ø System : Pentium IV 2.4 GHz.
Ø  Hard Disk : 40 GB.
Ø Floppy Drive : 1.44 Mb.
Ø Monitor : 15 VGA Colour.
Ø Mouse : Logitech.
Ø Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

Ø Operating system : Windows XP/7.
Ø Coding Language : ASP.net, C#.net /java

CONCLUSION
                    
                    In this paper, a context-aware software architecture has been presented. The proposed architecture provides a reusable and adaptable base to support the availability of services in mobile clouds. Complementing SOA with service replication techniques together with a self-configuration approach for the activation/hibernation of those replicas, allows us to address the availability problem successfully. This has been achieved through the design and implementation of an election algorithm. By addressing the dynamicity of the mo-bile system we can take advantage of its flexibility without having a negative impact on the availability of the deployed services, and therefore on the dependability of the system

REFERENCE

 [1] GSMA (Groupe Speciale Mobile Association), “The mobile
economy report,” 2015. [Online]. Available: http://www.
gsmamobileeconomy.com/
[2] Y. Al Ridhawi and A. Karmouch, “Decentralized plan-free semanticbased
service composition in mobile networks,” IEEE Transactions on
Services Computings, vol. 8, no. 1, pp. 17–31, Jan 2015.
 [3] O. Khalid, M. Khan, S. Khan, and A. Zomaya, “OmniSuggest: A
ubiquitous cloud-based context-aware recommendation system for
mobile social networks,” IEEE Transactions on Services Comput-ing,

vol. 7, no. 3, pp. 401–414, July 2014.

Comments

Popular posts from this blog

Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search

Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search ABSTRACT: In this paper, With advances in geo-positioning technologies and geo-location services, there are a rapidly growing amount of spatiotextual objects collected in many applications such as location based services and social networks, in which an object is described by its spatial location and a set of keywords (terms). Consequently, the study of spatial keyword search which explores both location and textual description of the objects has attracted great attention from the commercial organizations and research communities. In the paper, we study two fundamental problems in the spatial keyword queries: top k spatial keyword search (TOPK-SK), and batch top k spatial keyword search (BTOPK-SK). Given a set of spatio-textual objects, a query location and a set of query keywords, the TOPK-SK retrieves the closest k objects each of which contains all keywords in the query. BTOPK-SK is the batch processing of sets...

A simple and reliable touch sensitive security system CODING

#include <REGX51.H> #include "lcd.c" #define MAX_DELAY() delay(65000) sbit Vibra_Sense=P3^1; sbit Buz=P1^0; void intro() {  lcd_init();  lcd_str("Touch Sensitive ",0x80);  lcd_str("Security System ",0xc0);  MAX_DELAY();MAX_DELAY();  lcd_clr();  }  void main()  { unsigned int i = 0, j= 0; intro();    while(1)    { lcd_str("Security Syst On",0x80); lcd_str("No Vibra Detectd",0xc0); Buz = 1; if(Vibra_Sense == 1) { while(Vibra_Sense == 1) delay(1000); } else { while(Vibra_Sense == 0) delay(1000); } Buz = 0; lcd_str("Vibraton Detectd",0xc0);delay(65000); while(1);    }  }

A Time Efficient Approach for Detecting Errors in Big Sensor Data on Cloud

A Time Efficient Approach for Detecting Errors in Big Sensor Data on Cloud Abstract                                                                                                                                                      ...