An Energy Aware Strategy for Distributed Cache Discovery with Stale Page Reduction

With the immense growth in the field of mobile communication, a good number of complex applications are now available for the mobile devices. The complex applications are made available to comply with the client demand for the higher performing and higher capable applications, which can be accessible from any locations and any devices. Thus, the application developers have attempted to make highly scaled applications to be deployed on mobile communication devices. The larger applications have higher demand for memory and processing capabilities. Thus, making the similar infrastructure available on the mobile computing environments was always a challenge. Nonetheless, with the availability of distributed computing architecture, the bottleneck for the computing capabilities for these complex applications can be handled. Nonetheless, the memory capabilities for the applications must be addressed more sophisticated manner using distribution of the memory and sharing of the data. Henceforth, distributed caching came under existence.A conveyed cache is an augmentation of the customary idea of cache utilized in a solitary district. A conveyed cache may traverse various servers with the goal that it can develop in size and in value-based limit. It is for the most part used to store application information living in database and web session information.One of the most popular technique for making the cache available is to perform cache discovery operations in the network. A number of parallel research attempts are made to identify the accurate place in the network to create or build the distributed cache network.However, the most of the parallel research attempts are criticised for considering single dimensions for cache discovery as few of the work focuses on distance, few of the work focuses on density and some of the works focuses on page replacement policies applicable on mobile computing environments as MANETs or WSN. Henceforth, the demand of the research is to consider multiple parameters for cache discovery and build a framework to automatically define the cache distribution. Hence, this work proposes a novel architecture or framework to detect the cache distribution based on distance, stale page reduction mechanism and finally the energy optimization. The outcome of the research is to automate the recommendation of cache discovery and increase the network life time by 90% compared to the existing methods for cache discovery. In order to handle the complex processing of the proposed algorithms, this work deploys machine learning methods to reduce the time complexity.

Héctor Cancela

We are glad to present the last issue of 2015, completing Volume 18 of the CLEI Electronic Journal. This issue is comprised by the following regular papers.The first paper, “Quality of Protection on WDM networks: A Recovery Probability based approach”, by M. D. Rodas-Brítez and D. P. Pinto-Roa, features a proposal of a new quality of protection (QoP) paradigm for Wavelength Division Multiplexing optical networks. The new approach is flexible, allowing the network administrator to define and select a set of protection levels, based on recovery probabilities which measure the degree of conflict among primary lightpaths sharing backup lightpaths. To show the interest of the approach, a Genetic Algorithm is used to design a routing strategy by multi-objectiveoptimization, minimizing the number of blocked requests, the number of services without protection, the total differences between the requested QoP and the assigned QoP, and the network cost.The second paper, “Towards Scalability for Federated Identity Systems for Cloud-Based Environments”, by A.A. Pereira, J. B. M. Sobral and C. M. Westphall, addresses scalability issues in identity management for cloud computing environments. The authors propose an adapted sticky-session mechanism, as an alternative approach to the more common distributed memory approach, and discuss the implications in therms of computational resources, throughput and overall efficiency. The following work, “Formal Analysis of Security Models for Mobile Devices, Virtualization Platforms, and Domain Name Systems”, by G. Betarte and C. Luna,tackles security models for security-critical applications in three areas: mobile devices, virtualization platforms, and domain name systems. The authors develop formalizations using the Calculus of Inductive Constructions, to study different usual variants of security models in these platforms and their properties.The last paper of this issue is “Digi-Clima Grid: image processing and distributed computing for recovering historical climate data”, by authors S. Nesmachnow, G. Usera and F. Brasileiro. This paper reports an experience of implementing semi-automatic techniques for digitalizing and recovering historical climate records applying parallel computing techniques over distributed computing infrastructures, which was applied to Uruguayan historical climate data.As we complete now the eighteenth year of continued existence of CLEIej, we thank the regional community for its continued support, and we encourage researchers working in computer science and its applications to consider submitting their work to CLEIej, as the the leading electronic, open access journal in Computer Science in Latin America.

Kartik Khurana ◽  
Harpreet Kaur ◽  
Ritu Chauhan ◽  
Shalu Chauhan ◽  
Shaveta Bhatia ◽  

Now a day’s mobile communication has become a serious business tool for the users. Mobile devices are mainly used for the applications like banking, e-commerce, internet access, entertainment, etc. for communication. This has become common for the user to exchange and transfer the data. However people are still facing problems to use mobile devices because of its security issue. This paper deals with various security issues in mobile computing. It also covers all the basic points which are useful in mobile security issues such as categorisation of security issues, methods or tactics for success in security issues in mobile computing, security frameworks.

2020 ◽  
Vol 10 (2) ◽  
pp. 500
Van Bui ◽  
Nam Tuan Le ◽  
Thanh Luan Vu ◽  
Van Hoa Nguyen ◽  
Yeong Min Jang

Recent advances in mobile communication require that indoor/outdoor environment information be available for both individual applications and wireless signal transmission in order to improve interference control and serve upper-layer applications. In this paper, we present a scheme to identify the indoor/outdoor environment using GPS signals combined with machine learning classification techniques. Compared to traditional schemes, which are based on received signal strength indicator (RSSI), the proposed scheme promises a robust approach with high accuracy, smooth operation when moving between indoor and outdoor environments, as well as easy implementation and training. The proposed scheme combined information from a certain number of GPS satellites, using the GPS sensor on mobile devices. Then, data are collected, preprocessed, and classified as indoor or outdoor environment using a machine learning model that is optimized for the best performance. The GPS input data were collected in the Kookmin University area and included 850 training samples and 170 test samples. The overall accuracy reached 97%.

Thomas Kunz ◽  
Abdulbaset Gaddah ◽  
Li Li

Peer-to-Peer computing is a popular, relatively new, distributed computing paradigm. It allows for a flexible set of participants to coordinate their resources with little overhead or reliance on central servers/ services and is becoming particularly relevant in mobile computing environments, where peers come and go. Communication between an (unknown) number of peers, which may or may not be online at the same time, is greatly facilitated by the publish/subscribe model. In this chapter, the authors review the stateof- the-art in publish/subscribe systems, focusing on the support for mobile peers in infrastructure-based networks. They propose a novel handoff approach that proactively distributes pub/sub-related information to brokers/superpeers ahead of a peer’s movement. They show through extensive experiments in a small testbed that the new approach has significant performance benefits, compared to the more typical reactive approach, in which pub/sub context is only established after a handoff event occurred.

Entropy ◽  
2019 ◽  
Vol 21 (8) ◽  
pp. 753
Xi ◽  
Lv ◽  
Sun ◽  

The advances in mobile technologies enable mobile devices to cooperate with each other to perform complex tasks to satisfy users’ composite service requirements. However, data with different sensitivities and heterogeneous systems with diverse security policies pose a great challenge on information flow security during the service composition across multiple mobile devices. The qualitative information flow control mechanism based on non-interference provides a solid security assurance on the propagation of customer’s private data across multiple service participants. However, strict discipline limits the service availability and may cause a high failure rate on service composition. Therefore, we propose a distributed quantitative information flow evaluation approach for service composition across multiple devices in mobile environments. The quantitative approach provides us a more precise way to evaluate the leakage and supports the customized disciplines on information flow security for the diverse requirements of different customers. Considering the limited energy feature on mobile devices, we use a distributed evaluation approach to provide a better balance on consumption on each service participant. Through the experiments and evaluations, the results indicate that our approach can improve the availability of composite service effectively while the security can be ensured.

Carlos Bobed ◽  
Fernando Bobillo ◽  
Sergio Ilarri ◽  
Eduardo Mena

During the last years, mobile computing has been the focus of many research efforts, due mainly to the ever-growing use of mobile devices. In this context, there is a need to manage dynamic data, such as location data or other data provided by sensors. As an example, the continuous processing of location-dependent queries has been the subject of thorough research. However, there is still a need of highly expressive ways of formulating queries, augmenting in this way the systems' answer capabilities. Regarding this issue, the modeling power of Description Logics (DLs) and the inferring capabilities of their attached reasoners could fulfill this new requirement. The main problem is that DLs are inherently oriented to model static knowledge, that is, to capture the nature of the modeled objects, but not to handle changes in the property values (which requires a full ontology reclassification), as it is common in mobile computing environments (e.g., the location is expected to vary continually). In this paper, the authors present a novel approach to process continuous queries that combines 1) the DL reasoning capabilities to deal with static knowledge, with 2) the efficient data access provided by a relational database to deal with volatile knowledge. By marking at modeling time the properties that are expected to change during the lifetime of the queries, the authors'system is able to exploit both the results of the classification process provided by a DL reasoner, and the low computational costs of a database when accessing changing data (mobile environments, semantic sensors, etc.), following a two-step continuous query processing that enables us to handle continuous DL queries efficiently. Experimental results show the feasibility of the authors' approach.

Biju Issac

Wireless networks and the subsequent mobile communication are growing by leaps and bounds in the past years and the demand for connection without cables is certainly high. Nowadays, wireless networks are quite common and can be found on university campuses, corporate offices and in public places like hotels, airports, coffee shops and so forth. Not only are mobile devices getting smaller and cheaper, they are also becoming more efficient and powerful, capable of running applications and network services. This is causing the uncontrollable growth of mobile computing as we are witnessing today. Among the many number of applications and services that are executed by mobile devices, network and data services are in high demand. Brief descriptions of some selective wireless technologies that help mobile computing, like IEEE 802.11 networks (with infrastructure mode and ad-hoc mode), Bluetooth, HomeRF, WiMAX and cellular technologies are given below.

Hong Va Leong

M-commerce applications have evolved out of e-commerce applications, riding on the rapid advancement in mobile communication technologies in the past decade. The diffusion of applications on the Internet into the mobile computing environment has taken an accelerating pace ever since. Virtually all e-commerce and m-commerce applications rely on the provision of information retrieval and processing capability. In this regard, database systems serve as the information source and repository for these applications, backed by efficient indexing mechanism. Bean (2003) gave a good report on supporting Web-based e-commerce with XML, which could be easily extended to m-commerce. An m-commerce framework, based on JINI/XML and a workflow engine, was also defined by Shih and Shim (2002). Customers can receive m-commerce services through the use of mobile devices, such as pocket PCs, PDAs, or even smart phones. These mobile devices together with their users are often modeled as mobile clients. Central to supporting m-commerce applications are three types of entities: mobile device, mobile communication, and database. In particular, we are more interested in providing efficient access mechanisms to mobile-client-enabled database servers, which are often called mobile databases. Mobile databases contain the core information to support the underlying m-commerce applications, while the use of mobile devices serves for the hardware platform, with mobile communication providing the necessary connection between mobile databases and mobile devices for interfacing with real users or customers.

2015 ◽  
Vol 77 (9) ◽  
Nor Azizah Saadon ◽  
Radziah Mohamad

As the number of Mobile Web Services (MWS) with different specifications has increased, the task of discovering the relevant ones becomes more challenging in a mobile environment. The challenges include mobile devices constraints and web service descriptions itself. The issues can be considered from the aspect of mobile device’s performance, diversity of available MWS specifications and lack of enriched MWS descriptions. In order to address these issues, this paper presents an enhancement of semantic-based MWS discovery framework for discovering the most relevant MWS that takes into consideration of Non-Functional Properties (NFPs) in web service descriptions. In our work, the matchmaking algorithm with enhanced similarity measure is presented. Semantic MWS profiles are annotated semantically as a WSMO-Lite profile with a REST-based architecture. The experimental validation and statistical analysis demonstrates that the proposed framework can effectively discover relevant MWS according to the various user requirements. It can be concluded that using the proposed framework, there is a significant improvement in the effectiveness of semantic-based discovery for MWS in mobile computing environments.

Sign in / Sign up

Export Citation Format

Share Document