In order to enhance the accuracy of spectrum sensing and achievable throughput of cognitive radio sensor networks, a cross-layer design scheme based on belief weight clustering is proposed. The clustering problem is mapped to constraint maximum-weight edge biclique decomposition problem based on belief weight. Then the transmission time and transmit power of the secondary users are combined optimized in each cluster through the cross-layer design. The optimal transmission time and transmit power allocation scheme are finally obtained. The simulation results show that, compared with the maximum weight unilateral bipartite graph algorithm (MWB), the algorithm proposed in this paper can significantly improve the perception performance under the premise of little difference in system throughput.
{"title":"Cross-layer design for cognitive radio sensor networks based on belief weight clustering","authors":"Yi hang Du, Hui Guo, Chuan hai Jiao","doi":"10.1145/3507971.3507999","DOIUrl":"https://doi.org/10.1145/3507971.3507999","url":null,"abstract":"In order to enhance the accuracy of spectrum sensing and achievable throughput of cognitive radio sensor networks, a cross-layer design scheme based on belief weight clustering is proposed. The clustering problem is mapped to constraint maximum-weight edge biclique decomposition problem based on belief weight. Then the transmission time and transmit power of the secondary users are combined optimized in each cluster through the cross-layer design. The optimal transmission time and transmit power allocation scheme are finally obtained. The simulation results show that, compared with the maximum weight unilateral bipartite graph algorithm (MWB), the algorithm proposed in this paper can significantly improve the perception performance under the premise of little difference in system throughput.","PeriodicalId":439757,"journal":{"name":"Proceedings of the 7th International Conference on Communication and Information Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115124840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xianzhi Yang, Jian Xu, Yao Xie, Jingsheng Jiang, Yiwei Zhu, Chen Yang
In order to promote the construction of communication system in the digital grid and the sharing of information of the whole life cycle of the communication system in the digital grid, the basic framework of the information model of the communication system in digital gridwork is designed and constructed based on the full consideration of the objects and information composition at each stage. The basic components of the information model are defined, and the information model is elaborated in terms of geometry and properties based on the Industry Foundation Class (IFC) standard. In this study, the communication unit is taken as the instantiated object of the information model, the characteristics of the job structure and the expression of the spatial structure in the communication field are combined. The relationship between the whole system and the components of the communication engineering unit is established. By extending the classical Building Information Model (BIM), the information model of the communication system in digital grid based on IFC standard is constructed, which provides a reference for the promotion of BIM technology in the field of digital grid.
为了促进数字网格中通信系统的建设和数字网格中通信系统全生命周期的信息共享，在充分考虑各个阶段的对象和信息构成的基础上，设计和构建了数字网格中通信系统信息模型的基本框架。定义了信息模型的基本组件，并根据工业基础类(Industry Foundation Class, IFC)标准对信息模型的几何形状和属性进行了阐述。本研究以通信单位为信息模型的实例化对象，结合通信领域的工作结构特征和空间结构表达。建立了整个系统与通信工程单元各部件之间的关系。通过对经典建筑信息模型(BIM)的扩展，构建了基于IFC标准的数字网格通信系统信息模型，为BIM技术在数字网格领域的推广提供了参考。
{"title":"Information Modeling of Communication in Digital Grid system Based on BIM Technology","authors":"Xianzhi Yang, Jian Xu, Yao Xie, Jingsheng Jiang, Yiwei Zhu, Chen Yang","doi":"10.1145/3507971.3508004","DOIUrl":"https://doi.org/10.1145/3507971.3508004","url":null,"abstract":"In order to promote the construction of communication system in the digital grid and the sharing of information of the whole life cycle of the communication system in the digital grid, the basic framework of the information model of the communication system in digital gridwork is designed and constructed based on the full consideration of the objects and information composition at each stage. The basic components of the information model are defined, and the information model is elaborated in terms of geometry and properties based on the Industry Foundation Class (IFC) standard. In this study, the communication unit is taken as the instantiated object of the information model, the characteristics of the job structure and the expression of the spatial structure in the communication field are combined. The relationship between the whole system and the components of the communication engineering unit is established. By extending the classical Building Information Model (BIM), the information model of the communication system in digital grid based on IFC standard is constructed, which provides a reference for the promotion of BIM technology in the field of digital grid.","PeriodicalId":439757,"journal":{"name":"Proceedings of the 7th International Conference on Communication and Information Processing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115217680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
IN IOT network, existing computing task offloading methods between terminals are focus on the scenario that computing resources and computing tasks remain unchanged. However, in the actual network, computing tasks and computing resources change dynamically with time, and these existing methods cannot be adjusted with the change of network state. So, in this paper, we propose a dynamic computing task offloading method based on multi round multi node auction algorithm (MRMNA) for IOT intelligent terminal. The auction algorithm is used to realize multi round offloading and the resource is scheduled by base station to realize dynamic allocation. Simulation results show that proposed method can improve the performance of time delay and energy consumption when compared with other methods.
{"title":"A dynamic computing task offloading method for IOT intelligent terminals","authors":"Yingliang Wu, Hui Zhi, Lixia Yang","doi":"10.1145/3507971.3508001","DOIUrl":"https://doi.org/10.1145/3507971.3508001","url":null,"abstract":"IN IOT network, existing computing task offloading methods between terminals are focus on the scenario that computing resources and computing tasks remain unchanged. However, in the actual network, computing tasks and computing resources change dynamically with time, and these existing methods cannot be adjusted with the change of network state. So, in this paper, we propose a dynamic computing task offloading method based on multi round multi node auction algorithm (MRMNA) for IOT intelligent terminal. The auction algorithm is used to realize multi round offloading and the resource is scheduled by base station to realize dynamic allocation. Simulation results show that proposed method can improve the performance of time delay and energy consumption when compared with other methods.","PeriodicalId":439757,"journal":{"name":"Proceedings of the 7th International Conference on Communication and Information Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123156939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The article summarizes the improvement of fast search random tree path planning algorithm in recent years. Firstly, the article explains the model of the original fast search random tree; secondly, the advantages and disadvantages of the RRT algorithm is discussed based on the simulation experiments.As a comparison, the improved RRT-based algorithm is introduced. Finally, the article summarizes the current researching challenges and proposes relevant suggestions and ideas.
{"title":"A Survey of Motion Planning Algorithms Based on Fast Searching Random Tree","authors":"Chengyi Zhang, Shu-wen Dang, Yong Chen, ChenFei Ling","doi":"10.1145/3507971.3507973","DOIUrl":"https://doi.org/10.1145/3507971.3507973","url":null,"abstract":"The article summarizes the improvement of fast search random tree path planning algorithm in recent years. Firstly, the article explains the model of the original fast search random tree; secondly, the advantages and disadvantages of the RRT algorithm is discussed based on the simulation experiments.As a comparison, the improved RRT-based algorithm is introduced. Finally, the article summarizes the current researching challenges and proposes relevant suggestions and ideas.","PeriodicalId":439757,"journal":{"name":"Proceedings of the 7th International Conference on Communication and Information Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124383080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, a semi-quantum key agreement (SQKA) protocol based on the three-particle maximally entangled GHZ state is proposed. In this SQKA protocol, the classical parties Alice and Bob can only operate the qubits with classical basis, while the quantum party Charlie has full manipulation on qubits. By introducing semi-quantum approach, the requirement for device is reduced. Moreover, each of parties has equal contribution to key formation. The protocol can effectively resist outsider attacks even participant attacks. Through the efficiency analysis, our protocol has a higher qubit efficiency than the previous semi-quantum key agreement.
{"title":"Semi-quantum key agreement based on maximally three-qubit entangled states","authors":"Han Guo, Yunxia Li, Jiahua Wei, Jie Tang","doi":"10.1145/3507971.3507994","DOIUrl":"https://doi.org/10.1145/3507971.3507994","url":null,"abstract":"In this paper, a semi-quantum key agreement (SQKA) protocol based on the three-particle maximally entangled GHZ state is proposed. In this SQKA protocol, the classical parties Alice and Bob can only operate the qubits with classical basis, while the quantum party Charlie has full manipulation on qubits. By introducing semi-quantum approach, the requirement for device is reduced. Moreover, each of parties has equal contribution to key formation. The protocol can effectively resist outsider attacks even participant attacks. Through the efficiency analysis, our protocol has a higher qubit efficiency than the previous semi-quantum key agreement.","PeriodicalId":439757,"journal":{"name":"Proceedings of the 7th International Conference on Communication and Information Processing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124291977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Retinal image vessel segmentation or artery/vein segmentation tasks have been investigated for a long time, and hypertension prediction based on statistical data or body indicators has been learned well. However, the gap between retinal image segmentation and retinal image hypertension prediction still exists. In this paper, we bridge the gap by introducing a model-agnostic cross attention module in segmentation part and a semantic image fusion module in hypertension prediction part thus to form a novel segmentation-based pipeline for hypertension prediction. Specifically, the cross attention module adopts cross multiplication to attend encoder and decoder features, which enhances the artery/vein segmentation ability in uncertain region and border region in retinal image. Then we design a semantic image fusion module to fuse segmented artery/vein vessel image and original image as the classifier input to predict hypertension. The experimental results demonstrate that our model can efficiently predict hypertension, and we achieve 94.87% accuracy, 94.74% specificity, 95.00% sensitivity respectively on 393 retinal images from Kaggle ODiR5k dataset at : https://www.kaggle.com/ocular-disease-recognition-odir5k.
{"title":"Segmentation-based Retinal Image Fusion for Hypertension Prediction","authors":"Yin Xie, Shibiao Xu, Li Guo, Yinbing Tian","doi":"10.1145/3507971.3507987","DOIUrl":"https://doi.org/10.1145/3507971.3507987","url":null,"abstract":"Retinal image vessel segmentation or artery/vein segmentation tasks have been investigated for a long time, and hypertension prediction based on statistical data or body indicators has been learned well. However, the gap between retinal image segmentation and retinal image hypertension prediction still exists. In this paper, we bridge the gap by introducing a model-agnostic cross attention module in segmentation part and a semantic image fusion module in hypertension prediction part thus to form a novel segmentation-based pipeline for hypertension prediction. Specifically, the cross attention module adopts cross multiplication to attend encoder and decoder features, which enhances the artery/vein segmentation ability in uncertain region and border region in retinal image. Then we design a semantic image fusion module to fuse segmented artery/vein vessel image and original image as the classifier input to predict hypertension. The experimental results demonstrate that our model can efficiently predict hypertension, and we achieve 94.87% accuracy, 94.74% specificity, 95.00% sensitivity respectively on 393 retinal images from Kaggle ODiR5k dataset at : https://www.kaggle.com/ocular-disease-recognition-odir5k.","PeriodicalId":439757,"journal":{"name":"Proceedings of the 7th International Conference on Communication and Information Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129924098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In order to realize the high gain broadband characteristics of the quasi-Yagi antenna, a novel structure of the quasi-Yagi antenna was designed. The structure of the antenna adopts E-type reflector and eight Split-Ring Resonators so that the quasi-Yagi antenna has the advantages of high gain and wide band at the same time, and can meet the needs of wireless communication. HFSS software is used to simulate the design process, which provides convenience for parameter optimization and other work. Finally, a wideband quasi-Yagi antenna with maximum gain of 5.16dB, frequency band range of 1.91GHz-4.05GHz and relative bandwidth of 72% is obtained. It achieves excellent performance of wide wideband and high gain.
{"title":"A Microstrip Quasi-Yagi Antenna with E-type reflector and Split-Ring Resonators","authors":"A. Li, Shaolong Yang, Weng Ning Wang","doi":"10.1145/3507971.3508016","DOIUrl":"https://doi.org/10.1145/3507971.3508016","url":null,"abstract":"In order to realize the high gain broadband characteristics of the quasi-Yagi antenna, a novel structure of the quasi-Yagi antenna was designed. The structure of the antenna adopts E-type reflector and eight Split-Ring Resonators so that the quasi-Yagi antenna has the advantages of high gain and wide band at the same time, and can meet the needs of wireless communication. HFSS software is used to simulate the design process, which provides convenience for parameter optimization and other work. Finally, a wideband quasi-Yagi antenna with maximum gain of 5.16dB, frequency band range of 1.91GHz-4.05GHz and relative bandwidth of 72% is obtained. It achieves excellent performance of wide wideband and high gain.","PeriodicalId":439757,"journal":{"name":"Proceedings of the 7th International Conference on Communication and Information Processing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126746454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fenglian Li, Syed Nisar Yousaf Sherazi, Yan Zhang, Zelin Wu
Lung nodules are the main indication of lung cancer. The main challenge for the radiologist is to diagnose and identify malignancies in computation tomography images. Different deep learning strategies for the treatment of lung cancer boost the efficiency of computer-aided diagnosis systems continually. Conventional neural networks use the focus layer to reduce resolution gradually but lack the ability to capture the features of small but critical pulmonary nodules. To handle this problem, we propose a new multi-scale dilated deep ResNet (MsDdR) model that helps classify lung nodules between benign and malignant. In this model, we apply different dilation rates, i.e. (3,5,7 and 9), on the input CT images to gain more relative information of the nodules. Then the images are transferred to the deep ResNet. Furthermore, deep ResNet is developed by merging residual learning with migrating learning by ignoring conventional image processing and by carrying over a 50 layers ResNet structure. The performance of the proposed model is analysed using several assessment matrices of accuracy, specificity, and AUC. The public accessible lung image database consortium dataset is used to evaluate the performance in the experiment. Experimental results prove the performance of the model with an accuracy of 91.26% and AUC 0.957.
{"title":"A new Multi-scale Dilated deep ResNet model for Classification of Lung Nodules in CT images","authors":"Fenglian Li, Syed Nisar Yousaf Sherazi, Yan Zhang, Zelin Wu","doi":"10.1145/3507971.3507988","DOIUrl":"https://doi.org/10.1145/3507971.3507988","url":null,"abstract":"Lung nodules are the main indication of lung cancer. The main challenge for the radiologist is to diagnose and identify malignancies in computation tomography images. Different deep learning strategies for the treatment of lung cancer boost the efficiency of computer-aided diagnosis systems continually. Conventional neural networks use the focus layer to reduce resolution gradually but lack the ability to capture the features of small but critical pulmonary nodules. To handle this problem, we propose a new multi-scale dilated deep ResNet (MsDdR) model that helps classify lung nodules between benign and malignant. In this model, we apply different dilation rates, i.e. (3,5,7 and 9), on the input CT images to gain more relative information of the nodules. Then the images are transferred to the deep ResNet. Furthermore, deep ResNet is developed by merging residual learning with migrating learning by ignoring conventional image processing and by carrying over a 50 layers ResNet structure. The performance of the proposed model is analysed using several assessment matrices of accuracy, specificity, and AUC. The public accessible lung image database consortium dataset is used to evaluate the performance in the experiment. Experimental results prove the performance of the model with an accuracy of 91.26% and AUC 0.957.","PeriodicalId":439757,"journal":{"name":"Proceedings of the 7th International Conference on Communication and Information Processing","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130968616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Distributed word embeddings such as Word2Vec and GloVe have been widely adopted in industrial context settings. Major technical applications of GloVe include recommender systems and natural language processing. The fundamental theory behind GloVe relies on the selection of a weighting function in the weighted least squres formulation that computes the powered ratio of word occurrence count and the maximum word count in the corpus. However, the initial formulation of GloVe is not theoretically sound in two aspects, namely the selection of the weighting function and its power exponent is ad-hoc. In this paper, we utilize the theory of extreme value analysis and propose a theoretically accurate version of GloVe. By reformulating the weighted least squares loss function as the expected loss function and accurately choosing the power exponent, we create a theoretically accurate version of GloVe. We demonstrate the competitiveness of our algorithm and show that the initial formulation of GloVe with the suggested optimal parameter can be viewed as a special case of our paradigm.
{"title":"Extremal GloVe : Theoretically Accurate Distributed Word Embedding by Tail Inference","authors":"Hao Wang","doi":"10.1145/3507971.3507972","DOIUrl":"https://doi.org/10.1145/3507971.3507972","url":null,"abstract":"Distributed word embeddings such as Word2Vec and GloVe have been widely adopted in industrial context settings. Major technical applications of GloVe include recommender systems and natural language processing. The fundamental theory behind GloVe relies on the selection of a weighting function in the weighted least squres formulation that computes the powered ratio of word occurrence count and the maximum word count in the corpus. However, the initial formulation of GloVe is not theoretically sound in two aspects, namely the selection of the weighting function and its power exponent is ad-hoc. In this paper, we utilize the theory of extreme value analysis and propose a theoretically accurate version of GloVe. By reformulating the weighted least squares loss function as the expected loss function and accurately choosing the power exponent, we create a theoretically accurate version of GloVe. We demonstrate the competitiveness of our algorithm and show that the initial formulation of GloVe with the suggested optimal parameter can be viewed as a special case of our paradigm.","PeriodicalId":439757,"journal":{"name":"Proceedings of the 7th International Conference on Communication and Information Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130436451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ananda Rizky Duto Pamungkas, Diyanatul Husna, Fransiskus Astha Ekadiyanto, I. K. Eddy Purnama, Afif Nurul Hidayati, Mauridhi Hery Purnomo, I. Nurtanio, Reza Fuad Rachmadi, Supeno Mardi Susiki Nugroho, Anak Agung Putri Ratna
In this study, a higher level of security was implemented by using InterPlanetary File System (IPFS) based peer-to-peer data storage on an Ethereum blockchain. IPFS is used as an image data storage medium that generates an IPFS hash, or known as content identifier (CID). The CID is used to access image data on the IPFS, which can be done with the help of an IPFS gateway. The CID is sent into the blockchain using a smart contract. The results of the study demonstrates that the use of IPFS as additional security on a blockchain system can be done. The size of file sent using IPFS proportionally affects the time it takes for IPFS to store the file. The larger the file size, the more time it will take. For each additional 1 MB file, there is an approximately 5% increase in access time. The distance from the IPFS gateway will also affect file access times in which, the farther the IPFS gateway, the more time it takes. If the IPFS gateway is at a distance of 1,000 km, there will be a decrease in access time of about 5%. The distance between the IPFS gateway and the accessor also affects success with accessing data. For the most distant gateway, i.e. the United States, there was even an access failure of 24%.
{"title":"Designing a Blockchain Data Storage System Using Ethereum Architecture and Peer-to-Peer InterPlanetary File System (IPFS)","authors":"Ananda Rizky Duto Pamungkas, Diyanatul Husna, Fransiskus Astha Ekadiyanto, I. K. Eddy Purnama, Afif Nurul Hidayati, Mauridhi Hery Purnomo, I. Nurtanio, Reza Fuad Rachmadi, Supeno Mardi Susiki Nugroho, Anak Agung Putri Ratna","doi":"10.1145/3507971.3507997","DOIUrl":"https://doi.org/10.1145/3507971.3507997","url":null,"abstract":"In this study, a higher level of security was implemented by using InterPlanetary File System (IPFS) based peer-to-peer data storage on an Ethereum blockchain. IPFS is used as an image data storage medium that generates an IPFS hash, or known as content identifier (CID). The CID is used to access image data on the IPFS, which can be done with the help of an IPFS gateway. The CID is sent into the blockchain using a smart contract. The results of the study demonstrates that the use of IPFS as additional security on a blockchain system can be done. The size of file sent using IPFS proportionally affects the time it takes for IPFS to store the file. The larger the file size, the more time it will take. For each additional 1 MB file, there is an approximately 5% increase in access time. The distance from the IPFS gateway will also affect file access times in which, the farther the IPFS gateway, the more time it takes. If the IPFS gateway is at a distance of 1,000 km, there will be a decrease in access time of about 5%. The distance between the IPFS gateway and the accessor also affects success with accessing data. For the most distant gateway, i.e. the United States, there was even an access failure of 24%.","PeriodicalId":439757,"journal":{"name":"Proceedings of the 7th International Conference on Communication and Information Processing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121606446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：