Pub Date : 2010-08-01DOI: 10.4108/CHINACOM.2010.114
P. Crespo, Xabier Insausti, J. Ser, Jesús Gutiérrez-Gutiérrez
This paper proposes a low-complexity signal shaping scheme for the transmission of non-binary symbols generated by sources with memory over the AWGN channel. It is based on using the Burrows-Wheeler Transform (BWT) [1] and standard two dimensional (QAM) constellations. The constellation points are driven based on the first order probabilities of the BWT output symbols so that shaping gain is maximized. The proposed system is an extension of the one introduced in [2] for binary sources. To evaluate its performance, the corresponding average energy per transmitted symbol is compared with that obtained when using an ideal source encoder followed by a standard uncoded QAM transmission scheme. In addition, it is shown that the power gain ratio between both systems can be assessed based on the Kullback-Leibler divergence between the first order probability distributions of the BWT output symbols and the Maxwell-Boltzmann probability distribution, obtained under the constraint of achieving an entropy equal to the entropy-rate of the original source.
{"title":"Signal shaping scheme based on the BWT for the transmission of non-binary sources with memory over the AWGN channel","authors":"P. Crespo, Xabier Insausti, J. Ser, Jesús Gutiérrez-Gutiérrez","doi":"10.4108/CHINACOM.2010.114","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.114","url":null,"abstract":"This paper proposes a low-complexity signal shaping scheme for the transmission of non-binary symbols generated by sources with memory over the AWGN channel. It is based on using the Burrows-Wheeler Transform (BWT) [1] and standard two dimensional (QAM) constellations. The constellation points are driven based on the first order probabilities of the BWT output symbols so that shaping gain is maximized. The proposed system is an extension of the one introduced in [2] for binary sources. To evaluate its performance, the corresponding average energy per transmitted symbol is compared with that obtained when using an ideal source encoder followed by a standard uncoded QAM transmission scheme. In addition, it is shown that the power gain ratio between both systems can be assessed based on the Kullback-Leibler divergence between the first order probability distributions of the BWT output symbols and the Maxwell-Boltzmann probability distribution, obtained under the constraint of achieving an entropy equal to the entropy-rate of the original source.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126610874","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-08-01DOI: 10.4108/CHINACOM.2010.15
Yang Cao, Daiming Qu, Guohui Zhong, Tao Jiang
In this paper, we propose a novel transmission probability scheduling scheme for opportunistic spectrum access in cognitive radio networks. With the proposed scheme, the secondary user's throughput over a single channel is maximized while collision probability perceived by the primary user is constrained under a required threshold since the secondary user optimally schedules its transmission probabilities during the primary user's idle period. Moreover, we deeply study the maximum achievable throughput of the secondary user when the idle period of the primary user is different distribution to analyze the performance of the proposed transmission probability scheduling scheme. In a practical communication systems, where primary user's traffic pattern and parameters are unknown and the secondary user's spectrum sensing is imperfect, a novel predictor, which is based on hidden Markov model, is also proposed to predict the future channel states and to enable the transmission probability scheduling for the secondary user. Conducted simulations show that the proposed transmission probability scheduling scheme and predictor are effective and can offer good system performances.
{"title":"Throughput maximization for opportunistic spectrum access via transmission probability scheduling scheme","authors":"Yang Cao, Daiming Qu, Guohui Zhong, Tao Jiang","doi":"10.4108/CHINACOM.2010.15","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.15","url":null,"abstract":"In this paper, we propose a novel transmission probability scheduling scheme for opportunistic spectrum access in cognitive radio networks. With the proposed scheme, the secondary user's throughput over a single channel is maximized while collision probability perceived by the primary user is constrained under a required threshold since the secondary user optimally schedules its transmission probabilities during the primary user's idle period. Moreover, we deeply study the maximum achievable throughput of the secondary user when the idle period of the primary user is different distribution to analyze the performance of the proposed transmission probability scheduling scheme. In a practical communication systems, where primary user's traffic pattern and parameters are unknown and the secondary user's spectrum sensing is imperfect, a novel predictor, which is based on hidden Markov model, is also proposed to predict the future channel states and to enable the transmission probability scheduling for the secondary user. Conducted simulations show that the proposed transmission probability scheduling scheme and predictor are effective and can offer good system performances.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"105 1-3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114026450","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-08-01DOI: 10.4108/CHINACOM.2010.94
Peng Liu, Juanjuan Yan, Zheng Zheng
The performance of a satellite-to-ground optical communication system with phase modulation is limited by phase fluctuations induced by atmospheric turbulence. To improve the system performance, one effective way is to use coherent detection. In this paper, a satellite-to-ground coherent optical communication system with differential quadrature phase-shift keying (DQPSK) modulation is studied, and a phase estimation algorithm based on M-th power scheme is used. The simulation results show that the phase noise induced by atmospheric turbulence can be suppressed greatly.
{"title":"Analysis of improved performance for a satellite-to-ground coherent optical communication system with DQPSK modulation due to phase estimation","authors":"Peng Liu, Juanjuan Yan, Zheng Zheng","doi":"10.4108/CHINACOM.2010.94","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.94","url":null,"abstract":"The performance of a satellite-to-ground optical communication system with phase modulation is limited by phase fluctuations induced by atmospheric turbulence. To improve the system performance, one effective way is to use coherent detection. In this paper, a satellite-to-ground coherent optical communication system with differential quadrature phase-shift keying (DQPSK) modulation is studied, and a phase estimation algorithm based on M-th power scheme is used. The simulation results show that the phase noise induced by atmospheric turbulence can be suppressed greatly.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127367848","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-08-01DOI: 10.4108/CHINACOM.2010.116
G. Baudoin, O. Venard
Despite the progress of information, localization and communication technologies (ICT), traveler information is still very difficult to access for people with sensory disabilities (visual or auditory) during their journeys in urban public transports. Through the experience gained in the French research project INFOMOVILLE, this paper presents the main aspects that are to be considered for the wide deployment of transport information systems accessible to sensory impaired persons. It considers different points of view: technical questions (information, communication, localization, energy), ergonomics, economics, legal and normative context.
{"title":"Information, communication and localization environment for travelers with sensory disabilities in public transports","authors":"G. Baudoin, O. Venard","doi":"10.4108/CHINACOM.2010.116","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.116","url":null,"abstract":"Despite the progress of information, localization and communication technologies (ICT), traveler information is still very difficult to access for people with sensory disabilities (visual or auditory) during their journeys in urban public transports. Through the experience gained in the French research project INFOMOVILLE, this paper presents the main aspects that are to be considered for the wide deployment of transport information systems accessible to sensory impaired persons. It considers different points of view: technical questions (information, communication, localization, energy), ergonomics, economics, legal and normative context.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127378624","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-08-01DOI: 10.4108/CHINACOM.2010.82
Liang Tang, Zheng Zhou, Lei Shi, Haipeng Yao, J. Zhang, Y. Ye
Bayesian compressive sensing (BCS) utilizes the prior distribution of signal coefficients to reconstruct the original signal. The widely used prior is Laplace and Gaussian distributed. In this paper, we use the scene of L sets of signal sparse coefficients which are statistically related and take advantage of Laplace prior and statistically interrelationship among signals to propose the Laplace prior based distributed Bayesian compressive sensing. We provide the experiment result to demonstrating that the proposed method is an effective reconstruction algorithm and has a good performance.
{"title":"Laplace prior based distributed compressive sensing","authors":"Liang Tang, Zheng Zhou, Lei Shi, Haipeng Yao, J. Zhang, Y. Ye","doi":"10.4108/CHINACOM.2010.82","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.82","url":null,"abstract":"Bayesian compressive sensing (BCS) utilizes the prior distribution of signal coefficients to reconstruct the original signal. The widely used prior is Laplace and Gaussian distributed. In this paper, we use the scene of L sets of signal sparse coefficients which are statistically related and take advantage of Laplace prior and statistically interrelationship among signals to propose the Laplace prior based distributed Bayesian compressive sensing. We provide the experiment result to demonstrating that the proposed method is an effective reconstruction algorithm and has a good performance.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127875115","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-08-01DOI: 10.4108/CHINACOM.2010.43
Chenyu Zhang, Kai Liu
In this paper, a collision-free on-demand multiple access (CF-ODMA) protocol for mobile ad hoc networks is proposed. In the CF-ODMA protocol, every node obtains collision-free polling service by channel reservation. In addition, a collision resolution algorithm is presented to guarantee that in the present of reservation collisions the access nodes can successfully access channel in sequence, and resolve packet collisions during the contention access period. Simulation results show that the proposed protocol can achieve better performances than the IEEE 802.11 distributed coordination function (DCF) and point coordination function (PCF) mechanisms in terms of throughput, average packet dropping rate and delay.
{"title":"Collision-free on-demand multiple access protocol for mobile ad hoc networks","authors":"Chenyu Zhang, Kai Liu","doi":"10.4108/CHINACOM.2010.43","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.43","url":null,"abstract":"In this paper, a collision-free on-demand multiple access (CF-ODMA) protocol for mobile ad hoc networks is proposed. In the CF-ODMA protocol, every node obtains collision-free polling service by channel reservation. In addition, a collision resolution algorithm is presented to guarantee that in the present of reservation collisions the access nodes can successfully access channel in sequence, and resolve packet collisions during the contention access period. Simulation results show that the proposed protocol can achieve better performances than the IEEE 802.11 distributed coordination function (DCF) and point coordination function (PCF) mechanisms in terms of throughput, average packet dropping rate and delay.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127849786","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-08-01DOI: 10.4108/CHINACOM.2010.56
M. Fouda, T. Taleb, M. Guizani, N. Kato
The current Internet framework is, no longer, able to support the heterogeneous networking technologies, mobile devices, increased number of users, and also the high user requirements for sophisticated services and applications. As a consequence, researchers envision the “future Internet” whereby all these issues may be effectively addressed. The future Internet architecture, amongst many components, is expected to comprise Peer-to-Peer (P2P) Video on Demand (VoD) streaming technologies. Since the conventional streaming techniques over P2P frameworks have a number of shortcomings, design issues pertaining to the P2P VoD schemes need to be seriously reconsidered. In this paper, we envision a scheme to effectively provide a VoD using P2P-based mesh overlay networks that may be part of the future Internet. Our scheme also comprises domain-based localization and congestion awareness strategies for the selection of the most appropriate peers. Empirical results have demonstrated the effectiveness of this scheme in terms of scalability and capability to reduce the startup latency and total link cost, and to also ensure a sustainable playback rate that is crucial for providing VoD services over the future Internet.
{"title":"Towards efficient P2P-based VoD provisioning in future internet","authors":"M. Fouda, T. Taleb, M. Guizani, N. Kato","doi":"10.4108/CHINACOM.2010.56","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.56","url":null,"abstract":"The current Internet framework is, no longer, able to support the heterogeneous networking technologies, mobile devices, increased number of users, and also the high user requirements for sophisticated services and applications. As a consequence, researchers envision the “future Internet” whereby all these issues may be effectively addressed. The future Internet architecture, amongst many components, is expected to comprise Peer-to-Peer (P2P) Video on Demand (VoD) streaming technologies. Since the conventional streaming techniques over P2P frameworks have a number of shortcomings, design issues pertaining to the P2P VoD schemes need to be seriously reconsidered. In this paper, we envision a scheme to effectively provide a VoD using P2P-based mesh overlay networks that may be part of the future Internet. Our scheme also comprises domain-based localization and congestion awareness strategies for the selection of the most appropriate peers. Empirical results have demonstrated the effectiveness of this scheme in terms of scalability and capability to reduce the startup latency and total link cost, and to also ensure a sustainable playback rate that is crucial for providing VoD services over the future Internet.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116763540","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-08-01DOI: 10.4108/CHINACOM.2010.125
Tie Qiu, Lei Wang, He Guo, Xiaoyan Liu, Lin Feng, Lei Shu
Embedded vector processor is a kind of high-performance parallel processor. Pipeline design is a key technology in embedded vector microprocessors. This paper proposes a new modeling method for vector processor pipeline using open queueing network by instruction set feature of vector processor. According to instruction set distribution of vector processor in the practical projects and owing in the pipeline modeling, the model of pipeline queueing network is analyzed. Total delay and mean delay are computed in every path. A better solution of pipeline is put forward as a result of delay data. Serving time of server nodes is averaged by partitioning for pipeline modeling and adding processing nodes in executing model. In conclusion, the delay data before and after improvement pipeline scheme are analyzed: the delay distributing of improvement scheme is almost equality and choke points with long delay and unequal are avoided.
{"title":"A new modeling method for vector processor pipeline using queueing network","authors":"Tie Qiu, Lei Wang, He Guo, Xiaoyan Liu, Lin Feng, Lei Shu","doi":"10.4108/CHINACOM.2010.125","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.125","url":null,"abstract":"Embedded vector processor is a kind of high-performance parallel processor. Pipeline design is a key technology in embedded vector microprocessors. This paper proposes a new modeling method for vector processor pipeline using open queueing network by instruction set feature of vector processor. According to instruction set distribution of vector processor in the practical projects and owing in the pipeline modeling, the model of pipeline queueing network is analyzed. Total delay and mean delay are computed in every path. A better solution of pipeline is put forward as a result of delay data. Serving time of server nodes is averaged by partitioning for pipeline modeling and adding processing nodes in executing model. In conclusion, the delay data before and after improvement pipeline scheme are analyzed: the delay distributing of improvement scheme is almost equality and choke points with long delay and unequal are avoided.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125960581","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 exchange of independent information between two nodes in a wireless network can be viewed as a two-way traffic flow. Such information exchange can be efficiently performed by exploiting relaying technique in a two-way channel. In this paper, we introduce two novel relaying techniques for Bidirectional Amplification of the Throughput (BAT) relaying in wireless multi-hop networks, termed as Equalized Detect-and-Forward (EDF) and Pre-equalized Amplify-and-Forward (PAF) BAT relaying schemes respectively. It is shown that the EDF BAT relaying scheme can decrease the complexity of the relay node by equalizing at the relay node, and the PAF BAT relaying scheme can reduce the signaling overhead by pre-equalizing at the transmitter. Furthermore, we analyze the achievable throughput of these relaying schemes, considering the impact of the location of the relay node.
{"title":"Novel bi-directional relaying schemes in a wireless multi-hop network","authors":"Shengyao Jin, Honglin Hu, Francois Gagnony, Olivier Mungery","doi":"10.4108/CHINACOM.2010.144","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.144","url":null,"abstract":"The exchange of independent information between two nodes in a wireless network can be viewed as a two-way traffic flow. Such information exchange can be efficiently performed by exploiting relaying technique in a two-way channel. In this paper, we introduce two novel relaying techniques for Bidirectional Amplification of the Throughput (BAT) relaying in wireless multi-hop networks, termed as Equalized Detect-and-Forward (EDF) and Pre-equalized Amplify-and-Forward (PAF) BAT relaying schemes respectively. It is shown that the EDF BAT relaying scheme can decrease the complexity of the relay node by equalizing at the relay node, and the PAF BAT relaying scheme can reduce the signaling overhead by pre-equalizing at the transmitter. Furthermore, we analyze the achievable throughput of these relaying schemes, considering the impact of the location of the relay node.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"404 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126678603","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-08-01DOI: 10.4108/CHINACOM.2010.61
Tzu-Chieh Tsai, Tong-Yen Hsieh, Wen-Ching Lo
Peer-to-Peer (P2P) applications are popular recently and have become one of the hottest research topics. The participants can share their resources (such as processing power, disk storage, and network bandwidth) in the P2P architecture to collaborate file downloading and streaming services. In this paper, we design and implement an Interactive Internet Radio system using the P2P approach, called PeerIIR. When the host, co-hosts, and calliners are speaking at the same time, they will produce multiple streams which need to deliver to all the audience on the system. This will consume the network bandwidth inefficiently, or even exhaust the link capacity of the audience. Thus, how to process multiple streams produced at the same time and to deliver to all the audience efficiently is the key issue. When there is only one program host producing the audio stream, a distribution tree is built to distribute it. If there are co-hosts or calliners speaking, a distributed mixer negotiation algorithm is performed to build a voice mixing tree among PeerIIR servers. Therefore the audio streams are mixed distributedly and step by step along the mixing tree to save transmission bandwidth. The results from series of simulation show that the performance for response time and link/node stress is enhanced compared with some related works.
{"title":"PeerIIR: Peer-to-Peer interactive internet radio system","authors":"Tzu-Chieh Tsai, Tong-Yen Hsieh, Wen-Ching Lo","doi":"10.4108/CHINACOM.2010.61","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.61","url":null,"abstract":"Peer-to-Peer (P2P) applications are popular recently and have become one of the hottest research topics. The participants can share their resources (such as processing power, disk storage, and network bandwidth) in the P2P architecture to collaborate file downloading and streaming services. In this paper, we design and implement an Interactive Internet Radio system using the P2P approach, called PeerIIR. When the host, co-hosts, and calliners are speaking at the same time, they will produce multiple streams which need to deliver to all the audience on the system. This will consume the network bandwidth inefficiently, or even exhaust the link capacity of the audience. Thus, how to process multiple streams produced at the same time and to deliver to all the audience efficiently is the key issue. When there is only one program host producing the audio stream, a distribution tree is built to distribute it. If there are co-hosts or calliners speaking, a distributed mixer negotiation algorithm is performed to build a voice mixing tree among PeerIIR servers. Therefore the audio streams are mixed distributedly and step by step along the mixing tree to save transmission bandwidth. The results from series of simulation show that the performance for response time and link/node stress is enhanced compared with some related works.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123450342","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
扫码关注我们
求助内容：
应助结果提醒方式：