Cluster Of Mobile Devices Research Articles

A Task Execution Scheme for Dew Computing with State-of-the-Art Smartphones

The computing resources of today’s smartphones are underutilized most of the time. Using these resources could be highly beneficial in edge computing and fog computing contexts, for example, to support urban services for citizens. However, new challenges, especially regarding job scheduling, arise. Smartphones may form ad hoc networks, but individual devices highly differ in computational capabilities and (tolerable) energy usage. We take into account these particularities to validate a task execution scheme that relies on the computing power that clusters of mobile devices could provide. In this paper, we expand the study of several practical heuristics for job scheduling including execution scenarios with state-of-the-art smartphones. With the results of new simulated scenarios, we confirm previous findings and better comprehend the baseline approaches already proposed for the problem. This study also sheds some light on the capabilities of small-sized clusters comprising mid-range and low-end smartphones when the objective is to achieve real-time stream processing using Tensorflow object recognition models as edge jobs. Ultimately, we strive for industry applications to improve task scheduling for dew computing contexts. Heuristics such as ours plus supporting dew middleware could improve citizen participation by allowing a much wider use of dew computing resources, especially in urban contexts in order to help build smart cities.

Secrecy Rate of Cooperative MIMO in the Presence of a Location Constrained Eavesdropper

We propose and study the cooperative MIMO architecture to enable and to improve the secrecy transmissions between clusters of mobile devices in the presence of an eavesdropper with certain location constraint. The cooperative MIMO system in this paper (referred to as Reconfigurable Distributed MIMO) is formed by temporarily activating clusters of nearby trusted mobile devices, with each cluster being centrally coordinated by its corresponding cluster head. We assume that the transmitters apply a practical eigen-direction precoding scheme to transmit the confidential signal and artificial noise, while the eavesdropper can be located in multiple possible locations in the proximity. We first obtain the expression of the secrecy rate, where the required average mutual information between the transmitters and the eavesdropper is characterized by closed-form approximations. The proposed approximations are especially useful in the secrecy rate maximization, where the original non-convex problem can be solved by the successive convex approximations. Numerical results show that the secrecy rate can be significantly improved by leveraging the location constraint of the eavesdropper, compared to the existing result. We also demonstrate that the secrecy rate can be further improved by increasing the cluster size.

Socially enabled wireless networks: resource allocation via bipartite graph matching

The influence of social interactions among mobile devices and network components in wireless networks has attracted substantial attention due to its potential impact on resource allocation of spectrum and power in particular. We present an organized social graphical view on resource allocation and then extend to multi-objective resource allocation of wireless networks. We subsequently consider taking advantage of multi-dimensional resources, including radio resource, user behavior, and content characteristics, such that we can successfully integrate caching capability, interest similarity, and content popularity and distribution into wireless network design. As an illustration, device-to-device communications is utilized to form pairs and clusters of mobile devices regarding optimal resource matching via a bipartite graph. This socially enabled methodology highlights new potential to design wireless networks and 5G mobile communications.

저전력 모바일 장치에 적합한 효율적인 동적 그룹 키 동의

그룹 키 동의 프로토콜은 공개된 통신망을 통해 안전하게 통신하려는 그룹 구성원들에게 세션키를 제공하기 위해 설계된다. 모바일 컴퓨팅 기술은 프로토콜 참가자의 계산적인 능력 측면에서 비대칭적이다. 즉 프로토콜 참가자는 충분한 계산 능력을 가진 고정된 서버(애플리케이션 서버)와 제한된 계산 자원을 가진 모바일 장치들(클라이언트)로 구성되어 있다. 스마트카드나 개인 휴대 정보 단말기(PDA)와 같은 저전력 모바일 장치를 포함하는 그룹에서는 각 구성원의 계산량을 최소화하는 것이 바람직하다. 또한 그룹 구성원이 현재의 그룹을 탈퇴하거나 다수의 새로운 구성원이 현재의 그룹에 참여할 필요가 있을 때 길은 계산 비용으로 그룹 키의 갱신이 요구된다. 본 논문에서는 저전력 모바일 장치인 클라이언트 쪽의 계산 효율성이 높은 동적 그룹 키 동의 프로토콜을 제안한다. 제안한 프로토콜과 기존 프로토콜을 통신과 계산 비용 측면에서 비교하고, 제안한 프로토콜의 안전성은 랜덤 오라클 모델에서 수동적인 공격자에 대하여 안전함을 증명한다. Group key agreement protocols are designed to provide a group of parties securely communicating over a public network with a session key. The mobile computing architecture is asymmetric in the sense of computational capabilities of participants. That is, the protocol participants consist of the stationary server(application servers) with sufficient computational Power and a cluster of mobile devices(clients) with limited computational resources. It is desirable to minimize the amount of computation performed by each group member in a group involving low-power mobile devices such as smart cards or personal digital assistants(PDAs). Furthermore we are required to update the group key with low computational costs when the members need to be excluded from the group or multiple new members need to be brought into an existing group. In this paper, we propose a dynamic group key protocol which offers computational efficiency to the clients with low-power mobile devices. We compare the total communicative and computational costs of our protocol with others and prove its suity against a passive adversary in the random oracle model.