Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (4)
  • Open Access


    Cooperative Caching Strategy Based on Two-Layer Caching Model for Remote Sensing Satellite Networks

    Rui Xu1,2,3, Xiaoqiang Di1,3,4,*, Hao Luo1, Hui Qi1,3, Xiongwen He5, Wenping Lei6

    CMC-Computers, Materials & Continua, Vol.75, No.2, pp. 3903-3922, 2023, DOI:10.32604/cmc.2023.037054

    Abstract In Information Centric Networking (ICN) where content is the object of exchange, in-network caching is a unique functional feature with the ability to handle data storage and distribution in remote sensing satellite networks. Setting up cache space at any node enables users to access data nearby, thus relieving the processing pressure on the servers. However, the existing caching strategies still suffer from the lack of global planning of cache contents and low utilization of cache resources due to the lack of fine-grained division of cache contents. To address the issues mentioned, a cooperative caching strategy… More >

  • Open Access


    Protected Fair Secret Sharing Based Bivariate Asymmetric Polynomials in Satellite Network

    Yanyan Han1,2, Jiangping Yu3, Guangyu Hu4, Chenglei Pan4, Dingbang Xie5, Chao Guo1,2,6,*, Abdul Waheed7

    CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 4789-4802, 2022, DOI:10.32604/cmc.2022.027496

    Abstract Verifiable secret sharing mainly solves the cheating behavior between malicious participants and the ground control center in the satellite network. The verification stage can verify the effectiveness of secret shares issued by the ground control center to each participant and verify the effectiveness of secret shares shown by participants. We use a lot of difficult assumptions based on mathematical problems in the verification stage, such as solving the difficult problem of the discrete logarithm, large integer prime factorization, and so on. Compared with other verifiable secret sharing schemes designed for difficult problems under the same… More >

  • Open Access


    Dynamic Resource Pricing and Allocation in Multilayer Satellite Network

    Yuan Li1,7, Jiaxuan Xie1, Mu Xia2, Qianqian Li3, Meng Li4, Lei Guo5,*, Zhen Zhang6

    CMC-Computers, Materials & Continua, Vol.69, No.3, pp. 3619-3628, 2021, DOI:10.32604/cmc.2021.016187

    Abstract The goal of delivering high-quality service has spurred research of 6G satellite communication networks. The limited resource-allocation problem has been addressed by next-generation satellite communication networks, especially multilayer networks with multiple low-Earth-orbit (LEO) and non-low-Earth-orbit (NLEO) satellites. In this study, the resource-allocation problem of a multilayer satellite network consisting of one NLEO and multiple LEO satellites is solved. The NLEO satellite is the authorized user of spectrum resources and the LEO satellites are unauthorized users. The resource allocation and dynamic pricing problems are combined, and a dynamic game-based resource pricing and allocation model is proposed More >

  • Open Access


    End-to-End Latency Evaluation of the Sat5G Network Based on Stochastic Network Calculus

    Huaifeng Shi1, Chengsheng Pan1, *, Li Yang2, Debin Wei2, Yunqing Shi3

    CMC-Computers, Materials & Continua, Vol.65, No.2, pp. 1335-1348, 2020, DOI:10.32604/cmc.2020.011005

    Abstract Simultaneous use of heterogeneous radio access technologies to increase the performance of real-time, reliability and capacity is an inherent feature of satellite-5G integrated network (Sat5G). However, there is still a lack of theoretical characterization of whether the network can satisfy the end-to-end transmission performance for latencysensitive service. To this end, we build a tandem model considering the connection relationship between the various components in Sat5G network architecture, and give an end-to-end latency calculation function based on this model. By introducing stochastic network calculus, we derive the relationship between the end-to-end latency bound and the violation More >

Displaying 1-10 on page 1 of 4. Per Page