Pub Date : 2019-08-01DOI: 10.1109/CCET48361.2019.8989253
Xu Yamei, Xu Jili
Offline handwritten Uighur scripts is cursive and have a large vocabulary, which makes the word recognition more complicated. In this paper, we propose a segmentation-driven recognition algorithm for offline handwritten Uighur word based on grapheme analysis and two-level DTW (dynamic time wrapping). Firstly, a MSAC (main segmentation and additional clustering) algorithm is adopted to over-segment a handwritten Uighur word into two grapheme sequences. After then, a hierarchical hybrid Uighur character classifier is designed to enhance the character recognition accuracy. Finally, a novel maximum likelihood algorithm with two-level DTW is presented to select the best hypothesis of character sequence from grapheme merging and decide the word class. Experiment results show that the proposed algorithm can achieve high character segmentation accuracy and word recognition rate simultaneously.
{"title":"Offline Handwritten Uighur Word Recognition Based on Segmentation-driven and Two-level DTW","authors":"Xu Yamei, Xu Jili","doi":"10.1109/CCET48361.2019.8989253","DOIUrl":"https://doi.org/10.1109/CCET48361.2019.8989253","url":null,"abstract":"Offline handwritten Uighur scripts is cursive and have a large vocabulary, which makes the word recognition more complicated. In this paper, we propose a segmentation-driven recognition algorithm for offline handwritten Uighur word based on grapheme analysis and two-level DTW (dynamic time wrapping). Firstly, a MSAC (main segmentation and additional clustering) algorithm is adopted to over-segment a handwritten Uighur word into two grapheme sequences. After then, a hierarchical hybrid Uighur character classifier is designed to enhance the character recognition accuracy. Finally, a novel maximum likelihood algorithm with two-level DTW is presented to select the best hypothesis of character sequence from grapheme merging and decide the word class. Experiment results show that the proposed algorithm can achieve high character segmentation accuracy and word recognition rate simultaneously.","PeriodicalId":231425,"journal":{"name":"2019 IEEE 2nd International Conference on Computer and Communication Engineering Technology (CCET)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114877809","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}
Pub Date : 2019-08-01DOI: 10.1109/CCET48361.2019.8989318
Feng Luo, Quan Wen
With its 100Mbps high bandwidth and high-speed transmission characteristics, automotive Ethernet is expected to solve traditional vehicle bus’s problem of low bandwidth and low data transmission rate, and become the backbone network of the future vehicle. The use of automotive Ethernet introduces a new diagnostic technology, DoIP (Diagnostic over IP). ISO 13400 is the standard protocol for DoIP, which provides an Ethernet-based diagnostic method for automotive systems and describes how external tester communicate with in-vehicle ECUs. This paper analyzes the implementation principle of DoIP by studying ISO 13400 protocol, including the communication scenarios of DoIP, DoIP diagnostic process and the network time management of DoIP. Then a bootloader based on DoIP is developed and the performance of the bootloader is tested. The result shows that the DoIP-based bootloader only takes 29.6 second to update the ECU with 384K bytes code.
{"title":"Implementation of bootloader based on DoIP","authors":"Feng Luo, Quan Wen","doi":"10.1109/CCET48361.2019.8989318","DOIUrl":"https://doi.org/10.1109/CCET48361.2019.8989318","url":null,"abstract":"With its 100Mbps high bandwidth and high-speed transmission characteristics, automotive Ethernet is expected to solve traditional vehicle bus’s problem of low bandwidth and low data transmission rate, and become the backbone network of the future vehicle. The use of automotive Ethernet introduces a new diagnostic technology, DoIP (Diagnostic over IP). ISO 13400 is the standard protocol for DoIP, which provides an Ethernet-based diagnostic method for automotive systems and describes how external tester communicate with in-vehicle ECUs. This paper analyzes the implementation principle of DoIP by studying ISO 13400 protocol, including the communication scenarios of DoIP, DoIP diagnostic process and the network time management of DoIP. Then a bootloader based on DoIP is developed and the performance of the bootloader is tested. The result shows that the DoIP-based bootloader only takes 29.6 second to update the ECU with 384K bytes code.","PeriodicalId":231425,"journal":{"name":"2019 IEEE 2nd International Conference on Computer and Communication Engineering Technology (CCET)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124500614","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}
Pub Date : 2019-08-01DOI: 10.1109/CCET48361.2019.8989357
Zhou Wen, Huaqing Wang, Hongfang Yuan, Min Liu, Xin Guo
The doctor's assessment of the degree for pulmonary embolism often needs to calculate the volume about it. The most important thing is to accurately segment pulmonary embolism in the Computed Tomography Pulmonary Angiography (CTPA) images. This paper proposes a method to segment the pulmonary embolism from CTPA images and the method is based on U-net which is an effective semantic segmentation network in deep learning. This work uses partial weights from the VGG16 pre-training model to initialize the parameters of the contracting path in the U-net. It can extremely reduce time of training and improve the generalization ability of the network. However, the class of the samples is unbalanced extremely. This paper defined a new loss function which is combined Focal loss and Dice loss to solve this problem. And the experiment shows that the proposed method can get effectively segmentation of pulmonary embolism in CTPA images.
{"title":"A method of pulmonary embolism segmentation from CTPA images based on U-net","authors":"Zhou Wen, Huaqing Wang, Hongfang Yuan, Min Liu, Xin Guo","doi":"10.1109/CCET48361.2019.8989357","DOIUrl":"https://doi.org/10.1109/CCET48361.2019.8989357","url":null,"abstract":"The doctor's assessment of the degree for pulmonary embolism often needs to calculate the volume about it. The most important thing is to accurately segment pulmonary embolism in the Computed Tomography Pulmonary Angiography (CTPA) images. This paper proposes a method to segment the pulmonary embolism from CTPA images and the method is based on U-net which is an effective semantic segmentation network in deep learning. This work uses partial weights from the VGG16 pre-training model to initialize the parameters of the contracting path in the U-net. It can extremely reduce time of training and improve the generalization ability of the network. However, the class of the samples is unbalanced extremely. This paper defined a new loss function which is combined Focal loss and Dice loss to solve this problem. And the experiment shows that the proposed method can get effectively segmentation of pulmonary embolism in CTPA images.","PeriodicalId":231425,"journal":{"name":"2019 IEEE 2nd International Conference on Computer and Communication Engineering Technology (CCET)","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129992275","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}
Pub Date : 2019-08-01DOI: 10.1109/CCET48361.2019.8989398
Jamal Alsultan
School zones are areas close to schools in which crossing vehicles represent a threat to school children. Due to various reasons, drivers might not be aware that they are approaching school zone areas. Utilizing wireless technology in vehicular environments can improve road safety and reduce the number accidents through the development of vehicle safety applications. This paper proposes a context-aware school zone warning system in VANETs. A context aware On-Board Unit architecture is proposed to detect active school zones and provide timely notifications to drivers to safely reduce the speed of their vehicles. The architecture is divided into three layers (i.e. sensing, reasoning, and acting layers). The sensing layer is responsible for collecting the required information to identify active school zones. The reasoning layer identifies the active school zones and sends signals to the application layer, which is responsible for alerting drivers through in-vehicle alarms.
{"title":"Context Aware School Zone Warning System in VANETs","authors":"Jamal Alsultan","doi":"10.1109/CCET48361.2019.8989398","DOIUrl":"https://doi.org/10.1109/CCET48361.2019.8989398","url":null,"abstract":"School zones are areas close to schools in which crossing vehicles represent a threat to school children. Due to various reasons, drivers might not be aware that they are approaching school zone areas. Utilizing wireless technology in vehicular environments can improve road safety and reduce the number accidents through the development of vehicle safety applications. This paper proposes a context-aware school zone warning system in VANETs. A context aware On-Board Unit architecture is proposed to detect active school zones and provide timely notifications to drivers to safely reduce the speed of their vehicles. The architecture is divided into three layers (i.e. sensing, reasoning, and acting layers). The sensing layer is responsible for collecting the required information to identify active school zones. The reasoning layer identifies the active school zones and sends signals to the application layer, which is responsible for alerting drivers through in-vehicle alarms.","PeriodicalId":231425,"journal":{"name":"2019 IEEE 2nd International Conference on Computer and Communication Engineering Technology (CCET)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132020750","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}
Pub Date : 2019-08-01DOI: 10.1109/CCET48361.2019.8989341
Y. Ding, Anzhong Hu
In millimeter-wave massive multiple input multiple output multiuser systems, inter-user interference becomes a major factor limiting system capacity. The premise of increasing system capacity is to minimize inter-user interference on the basis of ensuring large receiving power. In response to this situation, this paper proposes a low complexity grouping optimization based hybrid beamforming (HBF) algorithm. Specifically, we group users according to user channel correlation and a correlation threshold. Users with strong correlation are grouped into a group. Then, with the goal of maximizing capacity, the low-dimensional exhaustive algorithm is used in each group to select the base station beamforming vector. Moreover, a greedy algorithm is adopted, i.e., the influence of the beamforming vectors of the previous groups is considered. Simulation results show that the system sum rate of the grouping optimization HBF algorithm is higher than that of the existing HBF algorithms.
{"title":"Grouping Optimization Based Hybrid Beamforming for Multiuser MmWave Massive MIMO Systems","authors":"Y. Ding, Anzhong Hu","doi":"10.1109/CCET48361.2019.8989341","DOIUrl":"https://doi.org/10.1109/CCET48361.2019.8989341","url":null,"abstract":"In millimeter-wave massive multiple input multiple output multiuser systems, inter-user interference becomes a major factor limiting system capacity. The premise of increasing system capacity is to minimize inter-user interference on the basis of ensuring large receiving power. In response to this situation, this paper proposes a low complexity grouping optimization based hybrid beamforming (HBF) algorithm. Specifically, we group users according to user channel correlation and a correlation threshold. Users with strong correlation are grouped into a group. Then, with the goal of maximizing capacity, the low-dimensional exhaustive algorithm is used in each group to select the base station beamforming vector. Moreover, a greedy algorithm is adopted, i.e., the influence of the beamforming vectors of the previous groups is considered. Simulation results show that the system sum rate of the grouping optimization HBF algorithm is higher than that of the existing HBF algorithms.","PeriodicalId":231425,"journal":{"name":"2019 IEEE 2nd International Conference on Computer and Communication Engineering Technology (CCET)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114358366","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}
Pub Date : 2019-08-01DOI: 10.1109/ccet48361.2019.8989011
{"title":"CCET 2019 Committees","authors":"","doi":"10.1109/ccet48361.2019.8989011","DOIUrl":"https://doi.org/10.1109/ccet48361.2019.8989011","url":null,"abstract":"","PeriodicalId":231425,"journal":{"name":"2019 IEEE 2nd International Conference on Computer and Communication Engineering Technology (CCET)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132675019","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}
Pub Date : 2019-08-01DOI: 10.1109/CCET48361.2019.8989331
J. Rao, X. Zou, Kui Dai
The symmetric cryptographic algorithm(SCA) is one of the fundamental technologies for information security. Due to the ever-increasing computing power and evolving attack technologies, researchers have to keep seeking more secure algorithms with better attack resistances. This paper proposes a data flow based Symmetric Cryptographic Algorithm Description Language(dSCADL) to speed up the implementation and evaluation which are vital for new cipher algorithm explorations. With flexible data structures and proven Turing-completeness, users can intuitively describe algorithms by mainly focusing on data flow. Evaluation results show that dSCADL can speed up implementation efficiency of typical SCAs by 2.95 to 9.75 times over existing researches. The language definition and runtime library are open sources for practical SCA explorations.
{"title":"dSCADL: A Data Flow based Symmetric Cryptographic Algorithm Description Language","authors":"J. Rao, X. Zou, Kui Dai","doi":"10.1109/CCET48361.2019.8989331","DOIUrl":"https://doi.org/10.1109/CCET48361.2019.8989331","url":null,"abstract":"The symmetric cryptographic algorithm(SCA) is one of the fundamental technologies for information security. Due to the ever-increasing computing power and evolving attack technologies, researchers have to keep seeking more secure algorithms with better attack resistances. This paper proposes a data flow based Symmetric Cryptographic Algorithm Description Language(dSCADL) to speed up the implementation and evaluation which are vital for new cipher algorithm explorations. With flexible data structures and proven Turing-completeness, users can intuitively describe algorithms by mainly focusing on data flow. Evaluation results show that dSCADL can speed up implementation efficiency of typical SCAs by 2.95 to 9.75 times over existing researches. The language definition and runtime library are open sources for practical SCA explorations.","PeriodicalId":231425,"journal":{"name":"2019 IEEE 2nd International Conference on Computer and Communication Engineering Technology (CCET)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115922286","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}
Pub Date : 2019-08-01DOI: 10.1109/CCET48361.2019.8989315
Xiangdong You
In this paper, we study the automatic summarization and keyword extraction techniques for web page and text file. First, we use the Readability algorithm to extract the text of the web page, and study the PageRank algorithm and TextRank algorithm, and then use the TextRank algorithm to extract keywords, key sentences and abstracts. We also develop the web application that processes web page and text file. The application can input URL, text file, or text paragraph, then application can complete the extraction of main content, abstract, keywords and key sentences.
{"title":"Automatic Summarization and Keyword Extraction from Web Page or Text File","authors":"Xiangdong You","doi":"10.1109/CCET48361.2019.8989315","DOIUrl":"https://doi.org/10.1109/CCET48361.2019.8989315","url":null,"abstract":"In this paper, we study the automatic summarization and keyword extraction techniques for web page and text file. First, we use the Readability algorithm to extract the text of the web page, and study the PageRank algorithm and TextRank algorithm, and then use the TextRank algorithm to extract keywords, key sentences and abstracts. We also develop the web application that processes web page and text file. The application can input URL, text file, or text paragraph, then application can complete the extraction of main content, abstract, keywords and key sentences.","PeriodicalId":231425,"journal":{"name":"2019 IEEE 2nd International Conference on Computer and Communication Engineering Technology (CCET)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124218860","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}
Pub Date : 2019-08-01DOI: 10.1109/CCET48361.2019.8989177
Stephen Dankwa, Wenfeng Zheng
In this current research work, we applied a Twin- Delayed DDPG (TD3) algorithm to solve the most challenging virtual Artificial Intelligence application by training a HalfCheetah robot as an Intelligent Agent to run across a field. Twin-Delayed DDPG (TD3) is a recent breakthrough smart AI model of a Deep Reinforcement Learning which combines the state-of-the-art techniques in Artificial Intelligence, including continuous Double Deep Q-Learning, Policy Gradient and Actor-Critic. These Deep Reinforcement Learning approaches have the capabilities to train an Intelligent agent to interact with an environment with automatic feature engineering, that is, requiring minimal domain knowledge. Twin-Delayed Deep Deterministic Policy Gradient algorithm (TD3) was built on the Deep Deterministic Policy Gradient algorithm (DDPG). During the implementation of the TD3 model, we used a two- layer feedforward neural network of 400 and 300 hidden nodes respectively, with Rectified Linear Units (ReLU) as an activation function between each layer for both the Actor and Critics, and then a final tanh unit following the output of the Actor. Overall, we developed six (6) neural networks. The Critic received both the state and action as input to the first layer. Both the network parameters were updated using the Adam optimizer. The implementation of the TD3 algorithm was made possible by using the pybullet continuous control environment which was interfaced through the OpenAI Gym. The idea behind the Twin-Delayed DDPG (TD3) is to reduce overestimation bias in Deep Q-Learning with discrete actions which are ineffective in an Actor-Critic domain setting. After exposing the Agent to training for 500,000 iterations, the Agent then achieved a Maximum Average Reward over the evaluation time-step of approximately 1891. Twin-Delayed Deep Deterministic Policy Gradient (TD3) has prominently improved both the learning speed and performance of the DDPG in a challenging task in a continuous control setting.
{"title":"Modeling a Continuous Locomotion Behavior of an Intelligent Agent Using Deep Reinforcement Technique.","authors":"Stephen Dankwa, Wenfeng Zheng","doi":"10.1109/CCET48361.2019.8989177","DOIUrl":"https://doi.org/10.1109/CCET48361.2019.8989177","url":null,"abstract":"In this current research work, we applied a Twin- Delayed DDPG (TD3) algorithm to solve the most challenging virtual Artificial Intelligence application by training a HalfCheetah robot as an Intelligent Agent to run across a field. Twin-Delayed DDPG (TD3) is a recent breakthrough smart AI model of a Deep Reinforcement Learning which combines the state-of-the-art techniques in Artificial Intelligence, including continuous Double Deep Q-Learning, Policy Gradient and Actor-Critic. These Deep Reinforcement Learning approaches have the capabilities to train an Intelligent agent to interact with an environment with automatic feature engineering, that is, requiring minimal domain knowledge. Twin-Delayed Deep Deterministic Policy Gradient algorithm (TD3) was built on the Deep Deterministic Policy Gradient algorithm (DDPG). During the implementation of the TD3 model, we used a two- layer feedforward neural network of 400 and 300 hidden nodes respectively, with Rectified Linear Units (ReLU) as an activation function between each layer for both the Actor and Critics, and then a final tanh unit following the output of the Actor. Overall, we developed six (6) neural networks. The Critic received both the state and action as input to the first layer. Both the network parameters were updated using the Adam optimizer. The implementation of the TD3 algorithm was made possible by using the pybullet continuous control environment which was interfaced through the OpenAI Gym. The idea behind the Twin-Delayed DDPG (TD3) is to reduce overestimation bias in Deep Q-Learning with discrete actions which are ineffective in an Actor-Critic domain setting. After exposing the Agent to training for 500,000 iterations, the Agent then achieved a Maximum Average Reward over the evaluation time-step of approximately 1891. Twin-Delayed Deep Deterministic Policy Gradient (TD3) has prominently improved both the learning speed and performance of the DDPG in a challenging task in a continuous control setting.","PeriodicalId":231425,"journal":{"name":"2019 IEEE 2nd International Conference on Computer and Communication Engineering Technology (CCET)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128363482","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}
Pub Date : 2019-08-01DOI: 10.1109/CCET48361.2019.8989033
Junyu Lai, Chengkang Li, Zhongwei Chen, Yingbing Sun, Han Xiao
Information Centric Networking (ICN) is a promising future networking architecture, and Named Data Networking (NDN) is considered to be its authoritative and representative scheme. In recent years, applying ICN/NDN concept in Mobile Ad-hoc Network (MANET), i.e. Name Data Mobile Ad-hoc Network (NDMANET), becomes a research hotspot. Compared with traditional IP protocol, NDN scheme is thought to be more robust and profitable to the node mobility and dynamically changed topologies in MANET. This paper focuses on NDMANET’s in-networking caching strategy, which provides a great flexibility and efficiency for data dissemination and is a vital feature of NDMANET. Firstly, the paper investigates and analyzes some existing caching strategies which are widely applied in the ICN/NDN domain. On that basis, a novel Content Popularity and Distance based Interval (CPDI) caching strategy is derived for NDMANET, with the purpose of improving its network performance. Comprehensive simulation experiments have been carried out and the results illustrate that the proposed CPDI caching strategy can introduce considerable improvements on the average cache hit ratio, the average number of cached data packets, and the average energy consumption with only slightly degrading the average download delay.
{"title":"A Novel Content Popularity and Distance based Interval Caching Strategy for Named Data Mobile Ad-hoc Network (NDMANET)","authors":"Junyu Lai, Chengkang Li, Zhongwei Chen, Yingbing Sun, Han Xiao","doi":"10.1109/CCET48361.2019.8989033","DOIUrl":"https://doi.org/10.1109/CCET48361.2019.8989033","url":null,"abstract":"Information Centric Networking (ICN) is a promising future networking architecture, and Named Data Networking (NDN) is considered to be its authoritative and representative scheme. In recent years, applying ICN/NDN concept in Mobile Ad-hoc Network (MANET), i.e. Name Data Mobile Ad-hoc Network (NDMANET), becomes a research hotspot. Compared with traditional IP protocol, NDN scheme is thought to be more robust and profitable to the node mobility and dynamically changed topologies in MANET. This paper focuses on NDMANET’s in-networking caching strategy, which provides a great flexibility and efficiency for data dissemination and is a vital feature of NDMANET. Firstly, the paper investigates and analyzes some existing caching strategies which are widely applied in the ICN/NDN domain. On that basis, a novel Content Popularity and Distance based Interval (CPDI) caching strategy is derived for NDMANET, with the purpose of improving its network performance. Comprehensive simulation experiments have been carried out and the results illustrate that the proposed CPDI caching strategy can introduce considerable improvements on the average cache hit ratio, the average number of cached data packets, and the average energy consumption with only slightly degrading the average download delay.","PeriodicalId":231425,"journal":{"name":"2019 IEEE 2nd International Conference on Computer and Communication Engineering Technology (CCET)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130169826","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
扫码关注我们
求助内容：
应助结果提醒方式：