{"title":"以内容为中心的无线自组织网络中的合作组缓存策略","authors":"S. Soleimani, Xiaofeng Tao, Yuhong Li","doi":"10.1109/ICCCHINA.2018.8641166","DOIUrl":null,"url":null,"abstract":"As next generation wireless mobile networks are witnessing a fundamental shift from connection-centric communications to content-centric communications, the content-centric wireless ad hoc network emerges as a promising paradigm for providing content delivery in an efficient, reliable, and secure way. In this paper, we investigate cooperative group caching management in content-centric wireless ad hoc network. Content caching probability is proposed to optimize the cache placement in order to choose the most valuable neighboring node to execute placement with the lowest probability. With the optimal cache scheme, we analytically derive and numerically evaluate the cache hit probability and the average number of successfully served requests. Simulation results show that the proposed cooperative group caching strategy outperforms the existing results.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cooperative Group Caching Strategy in Content-Centric Wireless Ad Hoc Networks\",\"authors\":\"S. Soleimani, Xiaofeng Tao, Yuhong Li\",\"doi\":\"10.1109/ICCCHINA.2018.8641166\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As next generation wireless mobile networks are witnessing a fundamental shift from connection-centric communications to content-centric communications, the content-centric wireless ad hoc network emerges as a promising paradigm for providing content delivery in an efficient, reliable, and secure way. In this paper, we investigate cooperative group caching management in content-centric wireless ad hoc network. Content caching probability is proposed to optimize the cache placement in order to choose the most valuable neighboring node to execute placement with the lowest probability. With the optimal cache scheme, we analytically derive and numerically evaluate the cache hit probability and the average number of successfully served requests. Simulation results show that the proposed cooperative group caching strategy outperforms the existing results.\",\"PeriodicalId\":170216,\"journal\":{\"name\":\"2018 IEEE/CIC International Conference on Communications in China (ICCC)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE/CIC International Conference on Communications in China (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCHINA.2018.8641166\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCHINA.2018.8641166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cooperative Group Caching Strategy in Content-Centric Wireless Ad Hoc Networks
As next generation wireless mobile networks are witnessing a fundamental shift from connection-centric communications to content-centric communications, the content-centric wireless ad hoc network emerges as a promising paradigm for providing content delivery in an efficient, reliable, and secure way. In this paper, we investigate cooperative group caching management in content-centric wireless ad hoc network. Content caching probability is proposed to optimize the cache placement in order to choose the most valuable neighboring node to execute placement with the lowest probability. With the optimal cache scheme, we analytically derive and numerically evaluate the cache hit probability and the average number of successfully served requests. Simulation results show that the proposed cooperative group caching strategy outperforms the existing results.