检索结果-内蒙古大学图书馆

IEEE 14th international conference on Mobile Data Management (MDM)

作者： Martinez, Ramon Dario Borja Chen, Chao-Chun Chuang, Kun-Ta Natl Chen Kung Univ CSIE Tainan Taiwan Natl Chen Kung Univ CSIE IMIS Tainan Taiwan

ISBN: (纸本)9781467360685

the mobile social networking application is aimed to build an application that helps users to check-in places and save the check-in data on cloud. Users can then show their trajectory on a web site. this project is ideal for people who spend a great deal of time traveling. the major benefit is the privacy that it offers and the algorithms that help the user to save the battery life. All the data is store in the Google Cloud SQL.

关键词： Internet SQL data privacy mobile computing social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Modeling and Provisioning IoT Cloud Systems for Testing Uncertainties 2017

Modeling and Provisioning IoT Cloud Systems for Testing Unce...

引用

14th EAI international conference on Mobile and Ubiquitous Systems - computing, networking and Services (MobiQuitous)

作者： Hong-Linh Truong Berardinelli, Luca Pavkovic, Ivan Copil, Georgiana TU Wien Distributed Syst Grp Vienna Austria

ISBN: (纸本)9781450353687

Modern Cyber-Physical Systems (CPS) and Internet of things (IoT) systems consist of both loosely and tightly interactions among various resources in IoT networks, edge servers and cloud data centers. these elements are being built atop virtualization layers and deployed in both edge and cloud infrastructures. they also deal with a lot of data through the interconnection of different types of networks and services. therefore, several new types of uncertainties are emerging, such as data, actuation, and elasticity uncertainties. this triggers several challenges for testing uncertainty in such systems. However, there is a lack of novel ways to model and prepare the right infrastructural elements covering requirements for testing emerging uncertainties. In this paper, first we present techniques for modeling CPS/IoT Systems and their uncertainties to be tested. Second, we introduce techniques for determining and generating deployment configuration for testing in different IoT and cloud infrastructures. We illustrate our work with a real-world use case for monitoring and analysis of Base Transceiver Stations.

关键词： Testing IoT Cloud computing Cyber-Physical Systems Uncertainty Deployment

来源：评论

学校读者我要写书评

暂无评论

A Brief Study on Cloud Security 14

A Brief Study on Cloud Security

引用

14th international conference on computing Communication and networking Technologies, ICCCNT 2023

作者： Ajith, Abhay Mathew, Adharsh S Remya, S. Amrita Vishwa Vidyapeetham Amrita School of Computing Department of Computer Science and Engineering Amritapuri India

ISBN: (纸本)9798350335095

distributed, parallel, and grid computing are all used in a kind of computing known as cloud computing. It serves as a flexible, affordable, and tried-and-true online delivery platform for IT services marketed to businesses or consumers. the outsourcing of critical services to external entities has become a common practice, and this trend has led to various challenges in ensuring the security and privacy of data, maintaining data availability and recovery, and ensuring compliance. Cloud computing, in particular, has added a new layer of complexity to these issues and has introduced additional risks. Cloud computing makes use of many different technologies. Additionally, it carries along its inherent security flaws. Customer access to networks, storage, servers, services, and applications is made possible by cloud technology thanks to how well the pay-per-use model's services function. Our main goal is to locate and connect these systems' weaknesses, threats, and remedies. © 2023 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Duck Attack on Accountable distributed Systems 2017

Duck Attack on Accountable Distributed Systems

引用

14th EAI international conference on Mobile and Ubiquitous Systems - computing, networking and Services (MobiQuitous)

作者： Kumar, Amrit Lauradoux, Cedric Lafourcade, Pascal Natl Univ Singapore Singapore Singapore INRIA Paris France Univ Clermont Auvergne Clermont Ferrand France

ISBN: (纸本)9781450353687

Accountability plays a key role in dependable distributed systems. It allows to detect, isolate and churn malicious/selfish nodes that deviate from a prescribed protocol. To achieve these properties, several accountable systems use at their core cryptographic primitives that produce non-repudiable evidence of inconsistent or incorrect behavior. In this paper, we show how selfish and colluding nodes can exploit the use of cryptographic digests in accountability protocols to mount what we call a duck attack. In a duck attack, selfish and colluding nodes exploit the use of cryptographic digests to alter the transmission of messages while masquerading as honest entities. the end result is that their selfish behavior remains undetected. this undermines the security guarantees of the accountability protocols. We first discover the duck attack while analyzing PAG - a custom cryptographic protocol to build accountable systems presented at ICDCS 2016. We later discover that accountable distributed systems based on a secure log (essentially a hash-based data structure) are also vulnerable to the duck attack and apply it on AcTinG - a protocol presented at SRDS 2014. To defeat our attack, we modify the underlying secure log to have high-order dependency on the messages stored in it.

关键词： Accountability Duck attack Secure log Public verifiability

来源：评论

学校读者我要写书评

暂无评论

the GAL monitoring concept for distributed AAL platforms

The GAL monitoring concept for distributed AAL platforms

引用

2012 IEEE 14th international conference on e-Health networking, Applications and Services, Healthcom 2012

作者： Büsching, Felix Bottazzi, Maximiliano Wolf, Lars Germany

ISBN: (纸本)9781457720390

In most of today's healthcare and AAL scenarios a multitude of data is recorded by different sensors for various purposes. By definition, this data is mostly personal and can be assigned to certain persons, which again makes it interesting for shady data miners, hackers, or even health insurance companies. thus, this data needs special care regarding privacy and security. On the other hand, if the systems are spread over a larger area, a remote access to such systems is essential for the operator. At least a basic system monitoring should be possible and backups to a distant location are beneficial if the distributed systems fail. In this paper we provide concepts and solutions how in distributed installations of personal AAL platforms privacy and security can be preserved, while remote backup and restore functionality and remote system monitoring can be provided. © 2012 IEEE.

关键词： Personal computing

来源：评论

学校读者我要写书评

暂无评论

A Completely distributed Cloudlet Framework Using 410c SoC 14

A Completely Distributed Cloudlet Framework Using 410c SoC

引用

14th international conference on computing Communication and networking Technologies, ICCCNT 2023

作者： Kakade, Manoj Subhash Karuppiah, Anupama Mathur, Mayank Bibekar, Manasi Basu, Gaurav Raghavan, Aaditya Raghav, Ananth Lekshminarayanan, Pranav Dept. of Eee BITS Pilani Pune Center India BITS Pilani Kk Birla Goa Campus Goa India

ISBN: (纸本)9798350335095

With the emergence of IoT, new computing paradigms have also emerged. Initial IoT systems had all the computing happening on the cloud. With the emergence of Industry 4.0 and IoT being the major building block, clouds are not the only solution for data storage and analytics. the term cloudlets was introduced first in 2011, but research in this area has picked up only over the past couple of years. In this paper, we propose a complete novel distributed architecture for cloudlets, and also we are proposing algorithms for data storage and task allocation across various nodes in the cloud. this cloudlet system was built using Qualcomm Snapdragon 410c. We have analyzed the architecture and the algorithm for varying workloads, bandwidth and data storage. the primary aim of the algorithm and the architecture is to ensure uniform processing and data loads across the nodes of the system. © 2023 IEEE.

关键词： System-on-chip

来源：评论

学校读者我要写书评

暂无评论

Randomized k-set agreement in crash-prone and Byzantine asynchronous systems

引用

thEORETICAL COMPUTER SCIENCE 2018年 709卷 80-97页

作者： Mostefaoui, Achour Moumen, Hamouma Raynal, Michel Univ Nantes LINA F-44322 Nantes France Univ Batna Batna Algeria Inst Univ France Paris France Univ Rennes IRISA F-35042 Rennes France

k-Set agreement is a central problem of fault-tolerant distributed computing. Considering a set of n processes, where up to t may commit failures, let us assume that each process proposes a value. the problem consists in defining an algorithm such that each non-faulty process decides a value, at most k different values are decided, and the decided values satisfy some context-depending validity condition. Algorithms solving k-set agreement in synchronous message-passing systems have been proposed for different failure models (mainly process crashes, and process Byzantine failures). Differently, k-set agreement cannot be solved in failure-prone asynchronous message-passing systems when t > k. To circumvent this impossibility an asynchronous system must be enriched with additional computational power. Assuming t > k, this paper presents two distributed algorithms that solve k-set agreement in asynchronous message-passing systems where up to t processes may commit crash failures (first algorithm) or more severe Byzantine failures (second algorithm). To circumvent k-set agreement impossibility, this article considers that the underlying system is enriched with the computability power provided by randomization. Interestingly, the algorithm that copes with Byzantine failures is signature-free, and ensures that no value proposed only by Byzantine processes can be decided by a non-faulty process. Both algorithms share basic design principles. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Asynchronous system Broadcast abstraction Byzantine process Coin Crash failure distributed algorithm k-Set agreement Message-passing system Randomized algorithm Signature-free algorithm

来源：评论

学校读者我要写书评

暂无评论

CloudAnalyzer: Uncovering the Cloud Usage of Mobile Apps 2017

CloudAnalyzer: Uncovering the Cloud Usage of Mobile Apps

引用

14th EAI international conference on Mobile and Ubiquitous Systems - computing, networking and Services (MobiQuitous)

作者： Henze, Martin Pennekamp, Jan Hellmanns, David Muehmer, Erik Ziegeldorf, Jan Henrik Drichel, Arthur Wehrle, Klaus Rhein Westfal TH Aachen Commun & Distributed Syst Aachen Germany

ISBN: (纸本)9781450353687

Developers of smartphone apps increasingly rely on cloud services for ready-made functionalities, e.g., to track app usage, to store data, or to integrate social networks. At the same time, mobile apps have access to various private information, ranging from users' contact lists to their precise locations. As a result, app deployment models and data flows have become too complex and entangled for users to understand. We present CloudAnalyzer, a transparency technology that reveals the cloud usage of smartphone apps and hence provides users with the means to reclaim informational self-determination. We apply CloudAnalyzer to study the cloud exposure of 29 volunteers over the course of 19 days. In addition, we analyze the cloud usage of the 5000 most accessed mobile websites as well as 500 popular apps from five different countries. Our results reveal an excessive exposure to cloud services: 90 % of apps use cloud services and 36 % of apps used by volunteers solely communicate with cloud services. Given the information provided by CloudAnalyzer, users can critically review the cloud usage of their apps.

关键词： Privacy Smartphones Cloud computing Traffic Analysis

来源：评论

学校读者我要写书评

暂无评论

A Group-based Fault Tolerant Mechanism for Heterogeneous Mobile Clouds 2017

A Group-based Fault Tolerant Mechanism for Heterogeneous Mob...

引用

14th EAI international conference on Mobile and Ubiquitous Systems - computing, networking and Services (MobiQuitous)

作者： Zhou, Bowen Buyya, Rajkumar Univ Melbourne Cloud Comp & Distributed Syst Lab Sch Comp & Informat Syst Melbourne Vic Australia

ISBN: (纸本)9781450353687

Recent developments of the enhanced hardware on mobile devices such as quad-core CPUs and various sensors have made it possible to build a powerful heterogeneous mobile cloud offloading service that consists of a mobile ad-hoc cloud, nearby servers and public cloud services. However, the availability and mobility management of mobile devices in the network can significantly hinder the performance of mobile cloud systems due to the frequent system faults caused by dynamic changes, and prevent applications from offloading to mobile ad-hoc networks. In order to improve the mobile cloud service reliability, we propose a group based fault tolerant mechanism GFT-mCloud that classifies mobile devices into groups based on its processing capacity, mobility, and reliability. Different fault tolerance techniques are then devised adaptively based on the task offloading schedules and the specific group of machines it's offloaded. GFT-mCloud is designed as a standalone module that can work with existing mobile cloud code offloading systems. Extensive experiments have been conducted to evaluate the proposed mechanism. the results show that our fault tolerant mechanism is able to outperform conventional fault tolerant algorithms in the mobile cloud offloading environment.

关键词： Mobile cloud computing fault tolerance code offloading

来源：评论

学校读者我要写书评

暂无评论

distributed verification using mobile agents

Distributed verification using mobile agents

引用

14th international conference on distributed computing and networking, icdcn 2013

作者： Das, Shantanu Kutten, Shay Lotker, Zvi Ben Gurion University of the Negev Beer-Sheva Israel Technion - Israel Institute of Technology Haifa Israel

ISBN: (纸本)9783642356674

We study the problem of distributed verification in the mobile agent model. the problem of distributed verification in a network using local checking has been studied previously. In the local verification model, each node of the network must decide on a yes or no answer based on the knowledge of its immediate neighborhood and the global answer is obtained by a conjunction of the local answers. the efficiency of such a verification process is determined by the sizes of the proofs i.e. labels that must be assigned to the nodes to enable local verification of some global property. On the other hand, in the mobile agent model, verification is performed by an agent that is allowed to move from node to node of the graph, reading the labels of visited nodes in order to verify the required property. In this case, minimizing the memory of the agent is the primary objective. We study the space complexity of performing mobile verification in terms of memory of each agent as well as the number of agents required globally in networks of size n. In the case of a solitary agent, logarithmic memory is both necessary and sufficient for solving certain graph-based verification problems (even in the family of trees). For a team of at least two agents, the space complexity of most verification problems (including the well-studied MST verification) is reduced to O (log log n), while a team of at least three agents even with constant size memory each, is sufficient to solve all graph-based verification problems. We also study the effect of randomization and show that one agent with O (log log n) bits of memory and the ability to flip coins is as powerful as two deterministic agent having the similar memory limitations. © Springer-Verlag 2013.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：