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

TrustMd - A multi-layer framework for domain, edge and d2d caching based on trust dissemination and blockchain

PERVASIVE ANd MOBILE COMPUTING 2025年 107卷

作者： Rocha, Acquila Santos Pinheiro, Billy Anderson Cordeiro, Weverton Borges, Vinicius C. M. Fed Univ Goias UFG Inst Informat INF Goiania Brazil Amazonia Blockchain Solut Amachains Belem Brazil Fed Univ Rio Grande do Sul UFRGS Inst Informat INF Porto Alegre Brazil

device-to-device communication (d2d), combined with edge caching and distinct domains, is a promising approach for offloading data from wireless mobile networks. However, user security is still an open issue in d2d communication. Security vulnerabilities remain possible as a side effect of enabling straightforward, direct, and spontaneous interactions between untrustworthy users. To address this issue, this work involves designing TrustMd (Trust Multiple domain), a multi-layer framework combining diverse technologies inspired by blockchain and trust management to develop a secure and scalable framework for multi-domain, edge, and d2d caching layers. Specifically, TrustMd combines edge trust storage with blockchain for distributed storage management in a multi-layer architecture designed to store trust control data in edge efficiently and d2d networks across different domains. Our experiments with TrustMd showed a significant improvement in data goodput, reaching as high as 95% of the total network throughput. In contrast, state-of-the-art approaches without trust control dissemination achieved at most 80%. Even though we observed a 7% increase in d2d overhead, TrustMd can effectively control latency levels. TrustMd managed security effectively without compromising network performance, reducing false negative rates up to 31% in the best-case scenario. TrustMd offers a scalable and effective security solution that boosts network performance and ensures robust protection.

关键词： d2d caching Trust management Blockchain Security 5G networks

来源：评论

学校读者我要写书评

暂无评论

Cooperative Full duplex Content Sensing and delivery Improves the Offloading Probability of d2d caching

引用

IEEE ACCESS 2019年 7卷 29076-29084页

作者： Chen, Yingyang Wang, Li Ma, Ruqiu Jiao, Bingli Hanzo, Lajos Peking Univ Sch Elect Engn & Comp Sci Beijing 100871 Peoples R China Beijing Univ Posts & Telecommun Sch Elect Engn Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Minist Educ Key Lab Universal Wireless Commun Beijing 100876 Peoples R China Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

A novel policy is conceived for device-to-device (d2d) caching that facilitates content sensing and delivery using full-duplex (Fd) communications. As a benefit, the user devices become capable of performing content sensing and delivery over an extended geographic range, where more aggregate cache units are available, hence circumventing both the limited communication range and the limited storage of individual devices. Based on stochastic geometry-aided modeling of the network, we analytically derive the hit ratio, defined as the probability that a content requester can obtain desired file via a d2d link or an Fd d2d link with data rate larger than a given threshold. The accuracy of our analysis is validated by our Monte Carlo simulations. Our numerical results show that the proposed policy achieves higher offloading probability than that of the existing approaches, even in the face of limited self-interference cancellation capability.

关键词： Full duplex stochastic geometry d2d caching

来源：评论

学校读者我要写书评

暂无评论

Video delivery Architecture for Hierarchical HetNet: HH-d2d caching

引用

IETE TECHNICAL REVIEW 2018年第5期35卷 494-505页

作者： Umrao, Sachin Maheshwari, Mukesh Kumar Saxena, Navrati Roy, Abhishek Hanyang Univ Dept Elect & Comp Engn Seoul South Korea Sungkyunkwan Univ Coll Software Suwon South Korea Samsung Elect Network Div Suwon South Korea

Over the last few years, smart devices and mobile devices drive the wide growth in mobile data communications. This increase is a major challenge for mobile network operators (MNOs). The MNOs are forced to operate with their maximum capacity limits and this growth needs mobile data offloading to accomplish the capacity demands. The mobile data offloading through device-to-device (d2d) communication can help to reduce the network congestion at low operational and capital expenses. The data offloading through d2d attracts the mobile users to participate, by paying them proper incentives in returns of their services. The offloading requires mutual agreement and benefits both the parties, MNOs and mobile users. In this paper, we categorize the smart devices (Sds) on the basis of their storage and methoding capabilities. Furthermore, we create the hierarchy of Sds to utilize the available resources efficiently with minimum cost and higher benefits. We present a main node-friend node (MNFN) selection and matching mechanism, which efficiently selects and utilizes available high-end Sds (HSds) on the basis of available resources for offloading purpose. It also decides the optimal pricing policy for the selected Sds. The efficiency of MNFN has been realized in terms of bandwidth and storage demand. Subsequently, we implement caching in MNs, and FNs with the help of our novel hierarchical heterogeneous d2d (HH-d2d) caching-based video dissemination architecture to solve the bit rate issues in the mobile network. The particular focus of our work is on video data, due to high demands. Simulation results show that FN caching increases bit rate up to approximate to 26 times, while MNFN caching improves bit rate up to approximate to 40 times.

关键词： Auction device-to-device (d2d) communication d2d caching Offloading Video dissemination

来源：评论

学校读者我要写书评

暂无评论

d2d caching vs. Small Cell caching: Where to Cache Content in a Wireless Network? 17

D2D Caching vs. Small Cell Caching: Where to Cache Content i...

引用

17th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Chen, Zheng Kountouris, Marios Univ Paris Sud CNRS Cent Supelec UMR8506L2S Gif Sur Yvette France Huawei Technol Co Ltd France Res Ctr Math & Algorithm Sci Lab Shenzhen Peoples R China

ISBN: (纸本)9781509017492

Proximity-based content caching and distribution in wireless networks has been identified as a promising traffic offloading solution for improving the capacity and the quality of experience (QoE) by exploiting content popularity and spatiotemporal request correlation. In this paper, we address the following question: where should popular content be cached in a wireless network? For that, we model a wireless cellular network using stochastic geometry and analyze the performance of two network architectures, namely caching at the mobile device allowing device-to-device (d2d) connectivity and local caching at the radio access network edge (small cells). We provide analytical and numerical results to compare their performance in terms of the cache hit probability, the density of cache-served requests and average power consumption. Our results reveal that the performance of cache-enabled networks with either d2d caching or small cell caching heavily depends on the user density and the content popularity distribution.

关键词： d2d caching small cell caching stochastic geometry

来源：评论

学校读者我要写书评

暂无评论

Inter-Cluster Cooperation for Wireless d2d caching Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2018年第9期17卷 6108-6121页

作者： Amer, Ramy Butt, M. Majid Bennis, Mehdi Marchetti, Nicola Univ Dublin Trinity Coll Dublin Coll Green Dublin 2 Ireland Univ Dublin Trinity Coll CONNECT Ctr Future Networks Dublin 2 Ireland Univ Glasgow Sch Engn Univ Ave Glasgow G12 8QQ Lanark Scotland Univ Oulu FIN-90570 Oulu Finland Kyung Hee Univ Dept Comp Engn Yongin 446701 South Korea

Proactive wireless caching and device to device (d2d) communication have emerged as promising techniques for enhancing users' quality of service and network performance. In this paper, we propose a new architecture for d2d caching with inter-cluster cooperation. We study a cellular network in which users cache popular files and share them with other users either in their proximity via d2d communication or with remote users using cellular transmission. We characterize the network average delay per request from a queuing perspective. Specifically, we formulate the delay minimization problem and show that it is NP-hard. Furthermore, we prove that the delay minimization problem is equivalent to the minimization of a non-increasing monotone supermodular function subject to a uniform partition matroid constraint. A computationally efficient greedy algorithm is proposed which is proven to be locally optimal within a factor (1 - e(-1)) approximate to 0.63 of the optimum. We analyze the average per request throughput for different caching schemes and conduct the scaling analysis for the average sum throughput. We show how throughput scaling depends on video content popularity when the number of files grows asymptotically large. Simulation results show a delay reduction of 45% to 80% compared to a d2d caching system without inter-cluster cooperation.

关键词： d2d caching queuing theory delay analysis scaling analysis throughput analysis

来源：评论

学校读者我要写书评

暂无评论

Exploiting Mobility to Content Placement in d2d caching Systems 20

Exploiting Mobility to Content Placement in D2D Caching Syst...

引用

20th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Song, Jaeyoung Choi, Wan Korea Adv Inst Sci & Techonl Sch Elect Engn Daejeon South Korea

ISBN: (纸本)9781538665282

Mobility-aware content placement is studied for d2d caching system. In this work, user mobility is modeled in terms of relative motion of other users with respect to a typical user of interest. due to mobility and wireless fading, the typical user may not receive all parts of the content requested. Hence, a base station (BS) is required to serve the rest parts of the content. Correspondingly, analyzing incoming and outgoing user in the d2d communication area of the typical user, we formulate a minimization problem for the average data load of a BS and then transform it to a maximization problem for a submodular function over a matroid constraint. Using submodularity, we propose a greedy algorithm which reduces the average data load of a BS near optimally.

关键词： Mobility caching Optimal content placement Edge caching d2d caching

来源：评论

学校读者我要写书评

暂无评论

delay Analysis for Wireless d2d caching with Inter-cluster Cooperation

Delay Analysis for Wireless D2D Caching with Inter-cluster C...

引用

IEEE Global Telecommunications Conference (GLOBECOM)

作者： Amer, Ramy Butt, M. Majid Bennis, Mehdi Marchetti, Nicola Univ Dublin Trinity Coll CONNECT Dublin Ireland Univ Oulu Ctr Wireless Commun Oulu Finland Kyung Hee Univ Dept Comp Engn Seoul South Korea

ISBN: (纸本)9781509050192

Proactive wireless caching and d2d communication have emerged as promising techniques for enhancing users' quality of service and network performance. In this paper, we propose a new architecture for d2d caching with inter-cluster cooperation. We study a cellular network in which users cache popular files and share them with other users either in their proximity via d2d communication or with remote users using cellular transmission. We characterize the network average delay per request from a queuing perspective. Specifically, we formulate the delay minimization problem and show that it is NP-hard. Furthermore, we prove that the delay minimization problem is equivalent to minimization of a non-increasing monotone supermodular function subject to a partition matroid constraint. A computationally efficient greedy algorithm is proposed which is proven to be locally optimal within a factor 2 of the optimum. Simulation results show more than 45% delay reduction compared to a d2d caching system without inter-cluster cooperation.

关键词： d2d caching queuing analysis delay analysis

来源：评论

学校读者我要写书评

暂无评论

A Privacy-preserved d2d caching Scheme Underpinned by Blockchain-enabled Federated Learning

A Privacy-preserved D2D Caching Scheme Underpinned by Blockc...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Cheng, Runze Sun, Yao Liu, Yijing Xia, Le Sun, Sanshan Imran, Muhammad Ali Univ Glasgow James Watt Sch Engn Glasgow Lanark Scotland Univ Elect Sci & Technol China Natl Key Lab Commun Chengdu Peoples R China Sichuan Normal Univ Coll Phys & Elect Engn Chengdu Peoples R China

ISBN: (纸本)9781728181042

Cache-enabled device-to-device (d2d) communication has been widely deemed as a promising approach to tackle the unprecedented growth of wireless traffic demands. Recently, tremendous efforts have been put into designing an efficient caching policy to provide users better quality of service. However, public concerns of data privacy still remain in d2d cache sharing networks, which thus arises an urgent need for a privacy-preserved caching scheme. In this study, we propose a double-layer blockchain-based federated learning (dBFL) scheme with the aim of minimizing the download latency for all users in a privacy-preserving manner. Specifically, in the sublayer, the devices within the same coverage area run a federated learning (FL) to train the caching scheme model for each area separately without exchange of local data. The model parameters for each area are recorded in sublayer chains with Raft consensus mechanism. Meanwhile, in the main layer, a mainchain based on practical Byzantine fault tolerance (PBFT) mechanism is used to resist faults and attacks, thus securing the reliability of FL updates. Only the reliable area models authorized by the mainchain are utilized to update the global model in the main layer. Numerical results show the convergence, as well as the gain of download latency of the proposed dBFL caching scheme when compared with several traditional schemes.

关键词： d2d caching Federated Learning Blockchain

来源：评论

学校读者我要写书评

暂无评论

Contents caching Scheme in d2d caching Systems when Incentives are Provided to Users

Contents Caching Scheme in D2D Caching Systems when Incentiv...

引用

19th International Conference on Electronics, Information, and Communication (ICEIC)

作者： Kim, Gayoung Song, Yoonseok Rim, Minjoong Kang, Chung G. Dongguk Univ Commun Engn Seoul South Korea Dongguk Univ Informat & Commun Engn Seoul South Korea Korea Univ Sch Elect Engn Seoul South Korea

ISBN: (纸本)9781728162898

In wireless networks with coverage and backhaul issues, install content caches on devices and use device-to-device (d2d) communication technology to deal with increased mobile traffic and content on other devices d2d cache system technology that provides is under active research. In this paper, a special device that can supply content to other devices that have a largecapacity cache is called a helper, in order to increase the hit ratio of the content stored in the helper. We are considering a solution of providing rewards to users. We proposed that what content needs to be saved and what effects can be obtained through compensation to the user.

关键词： Contents caching d2d caching Helper Reward

来源：评论

学校读者我要写书评

暂无评论

Secure d2d caching framework inspired on trust management and blockchain for Mobile Edge caching

引用

PERVASIVE ANd MOBILE COMPUTING 2021年 77卷

作者： Rocha, Acquila Santos Pinheiro, Billy Anderson Borges, Vinicius C. M. Univ Fed Goias UFG Inst Informat INF Goiania Go Brazil Amazonia Blockchain Solut Amachains Belem Para Brazil

device-to-device communication (d2d), combined with edge caching and mobile edge computing, is a promising approach to allow offloading data from the wireless mobile network in light of the growth of the number of connected devices and the increase in traffic. However, user security is still an open issue in d2d communication. Security vulnerabilities remain possible owing to easy, direct and spontaneous interactions between untrusted users as well as mobility. In this article, we establish a Secure d2d caching framework inspired on trUst management and Blockchain (SeCdUB) to improve the security of d2d communication in video caching, through an approach that combines direct and indirect observations. In addition, blockchain concepts were adapted to the dynamic and restricted scenario of the d2d networks to prevent data interception and the alteration of indirect observations. Two uncertainty mathematical models were used to infer direct and indirect trust values: Bayesian inference and the dempster Shafer Theory (dST) respectively. In addition, we have designed a clustering scheme that enables a faster and more lightweight blockchain for d2d networks. This ensures overhead will not increase with the number of nodes, and thus offers a scalable security solution. Although the average throughput and packet loss increase when SeCdUB is employed, it is not significant in dense scenarios. Nonetheless, there is an improvement in the goodput for all the accessed network scenarios. (C) 2021 Published by Elsevier B.V.

关键词： d2d caching Trust management Blockchain Security 5G networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：