Pub Date : 2010-12-06DOI: 10.1109/ICNIDC.2010.5659458
Xu Mao, Hong Ji
Cognitive radio (CR) employing OFDM has drawn many interests in designing efficient radio resource allocation schemes. Most of the existing works considered the cognitive scenario under perfect knowledge of system state, such as channel state information (CSI) and sensing information (SI). However, it is serious to properly regulate the interference caused by secondary users (SUs) to each primary user (PU). In this paper, we focus on the design and analysis of subcarrier and power allocation scheme under imperfect CSI for cognitive OFDM systems. A smart way using training preamble is presented to obtain the CSI of Rayleigh block-fading channel between the transmitter and receiver. During the training phase, the receiver estimates the channel and feeds the estimate back to the transmitter. During the transmission phase, a two-step algorithm for capacity maximization is proposed to obtain the subcarrier assignment and power allocation for each SU. It is shown by extensive simulation and analysis that, by increasing the number of training symbols, the total capacity can be largely enhanced.
基于OFDM的认知无线电(CR)在设计高效的无线电资源分配方案方面引起了人们的广泛关注。现有的研究大多考虑的是完全了解系统状态的认知场景，如通道状态信息(CSI)和感知信息(SI)。但是，如何合理调节secondary user (secondary user)对每个primary user (primary user)的干扰是一个非常重要的问题。本文重点研究了认知OFDM系统在不完全CSI下的子载波和功率分配方案的设计与分析。提出了一种利用训练前导获取发送端和接收端之间瑞利块衰落信道CSI的智能方法。在训练阶段，接收机估计信道并将估计反馈给发射机。在传输阶段，提出了一种两步容量最大化算法来获得每个SU的子载波分配和功率分配。大量的仿真和分析表明，通过增加训练符号的数量，可以大大提高总容量。
{"title":"Subcarrier and power allocation in cognitive OFDM systems under imperfect CSI with smart channel estimation","authors":"Xu Mao, Hong Ji","doi":"10.1109/ICNIDC.2010.5659458","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5659458","url":null,"abstract":"Cognitive radio (CR) employing OFDM has drawn many interests in designing efficient radio resource allocation schemes. Most of the existing works considered the cognitive scenario under perfect knowledge of system state, such as channel state information (CSI) and sensing information (SI). However, it is serious to properly regulate the interference caused by secondary users (SUs) to each primary user (PU). In this paper, we focus on the design and analysis of subcarrier and power allocation scheme under imperfect CSI for cognitive OFDM systems. A smart way using training preamble is presented to obtain the CSI of Rayleigh block-fading channel between the transmitter and receiver. During the training phase, the receiver estimates the channel and feeds the estimate back to the transmitter. During the transmission phase, a two-step algorithm for capacity maximization is proposed to obtain the subcarrier assignment and power allocation for each SU. It is shown by extensive simulation and analysis that, by increasing the number of training symbols, the total capacity can be largely enhanced.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121592988","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 : 2010-12-06DOI: 10.1109/ICNIDC.2010.5659456
Yuehong Gao, Yuming Jiang, Tao Lin, Xin Zhang
In this paper, we use stochastic network calculus to analyze the performance bounds for a cognitive radio network with two classes of input traffic. First, stochastic service curves for primary users and secondary users are obtained based on the system model and stochastic network calculus. Then, we derive the general expressions of backlog and delay bounds for both primary and secondary users under two methods, i.e., min-plus convolution and independent case analysis. Finally, numerical results as well as simulation results are compared and discussed.
{"title":"Performance bounds for a cognitive radio network with network calculus analysis","authors":"Yuehong Gao, Yuming Jiang, Tao Lin, Xin Zhang","doi":"10.1109/ICNIDC.2010.5659456","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5659456","url":null,"abstract":"In this paper, we use stochastic network calculus to analyze the performance bounds for a cognitive radio network with two classes of input traffic. First, stochastic service curves for primary users and secondary users are obtained based on the system model and stochastic network calculus. Then, we derive the general expressions of backlog and delay bounds for both primary and secondary users under two methods, i.e., min-plus convolution and independent case analysis. Finally, numerical results as well as simulation results are compared and discussed.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130103838","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 : 2010-12-06DOI: 10.1109/ICNIDC.2010.5659459
Biling Zhang, Kai Chen, Xuerong Gou, Shiduan Cheng
Cognitive radio (CR) has been widely recognized as a promising paradigm to achieve efficient use of the spectrum resource. While a lot of attention has been paid to the hierarchical access model of CR, the spectrum leasing model in which PUs can actively lease their spectrum to SUs for certain reward has not been studied thoroughly. In this paper, by assuming a PU is willing to lease its bandwidth for a fraction of time to SUs in exchange for selective cooperation, we propose a game model to describe the dynamic interaction between the PU and SUs. In our model, the PU plays a game with each of the potential SUs and selects the best one to cooperate with. We prove that there is always a unique Nash Equilibrium (NE) for each game. Moreover, we propose a simple distributed algorithm for practical implementation of the model. Simulation results verify that our approach can benefit both the PU and the SU in terms of utility and transmission rate.
{"title":"Spectrum leasing via selective cooperation in distributed cognitive radio networks","authors":"Biling Zhang, Kai Chen, Xuerong Gou, Shiduan Cheng","doi":"10.1109/ICNIDC.2010.5659459","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5659459","url":null,"abstract":"Cognitive radio (CR) has been widely recognized as a promising paradigm to achieve efficient use of the spectrum resource. While a lot of attention has been paid to the hierarchical access model of CR, the spectrum leasing model in which PUs can actively lease their spectrum to SUs for certain reward has not been studied thoroughly. In this paper, by assuming a PU is willing to lease its bandwidth for a fraction of time to SUs in exchange for selective cooperation, we propose a game model to describe the dynamic interaction between the PU and SUs. In our model, the PU plays a game with each of the potential SUs and selects the best one to cooperate with. We prove that there is always a unique Nash Equilibrium (NE) for each game. Moreover, we propose a simple distributed algorithm for practical implementation of the model. Simulation results verify that our approach can benefit both the PU and the SU in terms of utility and transmission rate.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121723288","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 : 2010-12-06DOI: 10.1109/ICNIDC.2010.5659457
Shoufeng Wang, Fan Li, Weidong Wang, Ben Wang, Yinghai Zhang
Channel reservation is used to decrease the drop ratio of secondary users caused by spectrum handover. This paper considers the maintainer of the reserved channels in one secondary system coexisting with multiple primary systems. The global channel reservation scheme, the user channel reservation scheme, and the user-updated channel reservation scheme are proposed, derived by different Markov models. Numerical results show that the global channel reservation scheme performs higher throughput than the user-updated/user channel reservation schemes, while the user-updated channel reservation scheme gains the lowest drop ratio among the three schemes.
{"title":"Secondary user dominated channel reservation in Cognitive Radio","authors":"Shoufeng Wang, Fan Li, Weidong Wang, Ben Wang, Yinghai Zhang","doi":"10.1109/ICNIDC.2010.5659457","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5659457","url":null,"abstract":"Channel reservation is used to decrease the drop ratio of secondary users caused by spectrum handover. This paper considers the maintainer of the reserved channels in one secondary system coexisting with multiple primary systems. The global channel reservation scheme, the user channel reservation scheme, and the user-updated channel reservation scheme are proposed, derived by different Markov models. Numerical results show that the global channel reservation scheme performs higher throughput than the user-updated/user channel reservation schemes, while the user-updated channel reservation scheme gains the lowest drop ratio among the three schemes.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122350338","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 : 2010-12-03DOI: 10.1109/ICNIDC.2010.5657856
Y. Peng, C. Bai, Qingyan Zhang
Narrowband pulse can be seen as singularity when it is adopted to transmit Direct Sequence Ultra-Wide Band (DS-UWB) signals. The remarkable property of wavelet transform is that it has ability to characterize the singularities of signals. In the UWB system there are different propagation characteristics for the modulus maxima of signal and noise with the increasing decomposition scales, theoretical and experimental results show that wavelet-transform modulus-maximum method can reserve signal singularity and remove the noise effectively. Therefore, wavelet-transform modulus-maxima method is used to extract useful information from DS-UWB signal in low SNR. A new algorithm is proposed in this paper by combining wavelet-transform modulus maximal denoising method with adaptive threshold algorithm. The simulation results show that the new method is efficient in restraining noise and reconstructing the signal.
{"title":"A new denoising method for DS-UWB signal based on wavelet transform modulus maximum","authors":"Y. Peng, C. Bai, Qingyan Zhang","doi":"10.1109/ICNIDC.2010.5657856","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657856","url":null,"abstract":"Narrowband pulse can be seen as singularity when it is adopted to transmit Direct Sequence Ultra-Wide Band (DS-UWB) signals. The remarkable property of wavelet transform is that it has ability to characterize the singularities of signals. In the UWB system there are different propagation characteristics for the modulus maxima of signal and noise with the increasing decomposition scales, theoretical and experimental results show that wavelet-transform modulus-maximum method can reserve signal singularity and remove the noise effectively. Therefore, wavelet-transform modulus-maxima method is used to extract useful information from DS-UWB signal in low SNR. A new algorithm is proposed in this paper by combining wavelet-transform modulus maximal denoising method with adaptive threshold algorithm. The simulation results show that the new method is efficient in restraining noise and reconstructing the signal.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115227523","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 : 2010-12-03DOI: 10.1109/ICNIDC.2010.5657803
Yuxuan Li, Hongbo Mo, Xinning Zhu, Zhimin Zeng
In the areas that different radio access technologies (RATs) overlap with each other, multi-mode user equipment devices (UEs) could perform inter-RAT cell reselection in idle mode. This will result in heavy signaling load over the air interface. One key point to resolve this problem is to reduce the frequency of the location area update procedure. In this paper, a method named as Signaling Reduction for Inter-RAT Cell Reselection (SRICR) is proposed. By means of keeping the registration information of two RATs by UEs, it doubles the location areas that UEs could stay in, so the frequency of the location area update procedure is reduced. Based on the analytical model and simulation results, we also analyze the performance of SRICR.
在不同无线接入技术(rat)相互重叠的区域，多模用户设备设备(ue)可以在空闲模式下进行rat小区间的重选。这将导致空中接口上的重信号负载。解决这一问题的一个关键是减少位置区域更新过程的频率。本文提出了一种鼠间细胞重选信号减少(Signaling Reduction for Inter-RAT Cell Reselection, SRICR)方法。通过ue保存两个rat的注册信息，使ue可以驻留的位置区域增加一倍，从而减少了位置区域更新过程的频率。在分析模型和仿真结果的基础上，分析了SRICR的性能。
{"title":"Signaling Reduction for inter-RAT cell reselection","authors":"Yuxuan Li, Hongbo Mo, Xinning Zhu, Zhimin Zeng","doi":"10.1109/ICNIDC.2010.5657803","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657803","url":null,"abstract":"In the areas that different radio access technologies (RATs) overlap with each other, multi-mode user equipment devices (UEs) could perform inter-RAT cell reselection in idle mode. This will result in heavy signaling load over the air interface. One key point to resolve this problem is to reduce the frequency of the location area update procedure. In this paper, a method named as Signaling Reduction for Inter-RAT Cell Reselection (SRICR) is proposed. By means of keeping the registration information of two RATs by UEs, it doubles the location areas that UEs could stay in, so the frequency of the location area update procedure is reduced. Based on the analytical model and simulation results, we also analyze the performance of SRICR.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115312035","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 : 2010-12-03DOI: 10.1109/ICNIDC.2010.5657846
Feng Rao, Yanyun Zhao, A. Cai
In this paper, we propose an efficient luggage searching system based on image classification and retrieval. In this system, we can register and retrieve the luggage automatically. We bring in classification to register images so as to increase the retrieval speed. The Block HSV histogram and the scale invariant feature transform (SIFT) are used for image retrieval. Experiments show that the proposed system has a fast speed and high precision.
{"title":"An effective luggage searching system based on image classification and retrieval","authors":"Feng Rao, Yanyun Zhao, A. Cai","doi":"10.1109/ICNIDC.2010.5657846","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657846","url":null,"abstract":"In this paper, we propose an efficient luggage searching system based on image classification and retrieval. In this system, we can register and retrieve the luggage automatically. We bring in classification to register images so as to increase the retrieval speed. The Block HSV histogram and the scale invariant feature transform (SIFT) are used for image retrieval. Experiments show that the proposed system has a fast speed and high precision.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123130755","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 : 2010-12-03DOI: 10.1109/ICNIDC.2010.5657821
Feng Wan, Wenyu Li, Yu Liu, Lin Zhang, Zhuocheng Jiang, Haiman Cai
TD-SCDMA HNB is proposed to enhance the capability of TD-SCDMA indoor wireless system, reduce the macro system load and increase the coverage of the service. This paper investigates the interference between HNBs for voice services in TDD model. The interference that each HNB is associated with one single UE is compared with the interference that each HNB is associated with several HUEs. The co-channel interference is also compared with the adjacent-channel interference by system level simulation.
{"title":"Interference estimation between Home NodeBs for voice services in TDD","authors":"Feng Wan, Wenyu Li, Yu Liu, Lin Zhang, Zhuocheng Jiang, Haiman Cai","doi":"10.1109/ICNIDC.2010.5657821","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657821","url":null,"abstract":"TD-SCDMA HNB is proposed to enhance the capability of TD-SCDMA indoor wireless system, reduce the macro system load and increase the coverage of the service. This paper investigates the interference between HNBs for voice services in TDD model. The interference that each HNB is associated with one single UE is compared with the interference that each HNB is associated with several HUEs. The co-channel interference is also compared with the adjacent-channel interference by system level simulation.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116898637","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 : 2010-12-03DOI: 10.1109/ICNIDC.2010.5657783
Sangyong Lee, Sanghyuk Jung, Y. Song
In NAND flash memory based storage systems, a flash translation layer (FTL) is usually employed to hide shortcomings of NAND flash memory such as erase-before-write and asymmetric read/write response time. Although there are several types of FTLs according to the mapping granularity, it is a recent trend to use a page-level mapping FTL. There are two basic methods of power loss recovery (PLR) schemes for page-level mapping FTL: per-page-unit method and the map block-unit method; however, these methods have shortcomings in term of the recovery time and the mapping information management overhead, respectively. In order to overcome disadvantages of PLR, thus, we propose a novel PLR, named accumulative backup of mapping information for power loss recovery (A-PLR), which provides a stable data recovery performance without any management overhead.
{"title":"A-PLR: Accumulative backup of mapping information for power loss recovery","authors":"Sangyong Lee, Sanghyuk Jung, Y. Song","doi":"10.1109/ICNIDC.2010.5657783","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657783","url":null,"abstract":"In NAND flash memory based storage systems, a flash translation layer (FTL) is usually employed to hide shortcomings of NAND flash memory such as erase-before-write and asymmetric read/write response time. Although there are several types of FTLs according to the mapping granularity, it is a recent trend to use a page-level mapping FTL. There are two basic methods of power loss recovery (PLR) schemes for page-level mapping FTL: per-page-unit method and the map block-unit method; however, these methods have shortcomings in term of the recovery time and the mapping information management overhead, respectively. In order to overcome disadvantages of PLR, thus, we propose a novel PLR, named accumulative backup of mapping information for power loss recovery (A-PLR), which provides a stable data recovery performance without any management overhead.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125356692","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 : 2010-12-03DOI: 10.1109/ICNIDC.2010.5657798
Xiaochun Wu, Qiuchen Xu, Zhi Zhang, Gang He
The paper analyzed the methods of extracting information from the network traffic, among which the information extraction based on the Tag marker was studied in depth. Tags, which contain specific core words, can be considered as markers of different types of information. Due to the non-standardized nature the Tag marker, a Tag often has lots of interference characters and the traditional pattern matching algorithm may leads to mismatch or poor performance. After analyzing the network service tag characteristics, we presented the Tag word segmenting method and the concept of Tag semantic distance. By introducing the tag semantic distance concept, we improved the Aho-Corasick algorithm to identify the tags which we concerned in extracting network service information. This improved algorithm, SemAC, is based on tag words segmenting and semantic distance calculation by dual-way scanning on words-map. Using this improved AC algorithm based on pre-defined core words, we successfully identified the tags and extracted what we need from the packets stream of web sites. At the end of this paper time complexity is analyzed.
{"title":"SemAC algorithm based on the tag semantic distance in network service information extraction","authors":"Xiaochun Wu, Qiuchen Xu, Zhi Zhang, Gang He","doi":"10.1109/ICNIDC.2010.5657798","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657798","url":null,"abstract":"The paper analyzed the methods of extracting information from the network traffic, among which the information extraction based on the Tag marker was studied in depth. Tags, which contain specific core words, can be considered as markers of different types of information. Due to the non-standardized nature the Tag marker, a Tag often has lots of interference characters and the traditional pattern matching algorithm may leads to mismatch or poor performance. After analyzing the network service tag characteristics, we presented the Tag word segmenting method and the concept of Tag semantic distance. By introducing the tag semantic distance concept, we improved the Aho-Corasick algorithm to identify the tags which we concerned in extracting network service information. This improved algorithm, SemAC, is based on tag words segmenting and semantic distance calculation by dual-way scanning on words-map. Using this improved AC algorithm based on pre-defined core words, we successfully identified the tags and extracted what we need from the packets stream of web sites. At the end of this paper time complexity is analyzed.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114468220","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
扫码关注我们
求助内容：
应助结果提醒方式：