Pub Date : 2013-10-17DOI: 10.1109/ICTEL.2013.6632159
Fengming Cao, Z. Fan, M. Sooriyabandara, T. Farnham
This paper focuses on femtocell self-organization through radio environment map (REM) based power control. Different downlink power control strategies with REM have been studied with realistic LTE system evaluation. We have shown that downlink power control can be an effective means for femtocell self-organization. With the help of REM information, the performance between macrocell and femtocell is better balanced. Our study suggests that REM-based power control is useful in practical femtocell network planning, in which a careful balance should be struck in maintaining satisfactory network performance and user QoS (quality of service) in heterogeneous networks.
{"title":"REM-based power control and femtocell self-organization","authors":"Fengming Cao, Z. Fan, M. Sooriyabandara, T. Farnham","doi":"10.1109/ICTEL.2013.6632159","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632159","url":null,"abstract":"This paper focuses on femtocell self-organization through radio environment map (REM) based power control. Different downlink power control strategies with REM have been studied with realistic LTE system evaluation. We have shown that downlink power control can be an effective means for femtocell self-organization. With the help of REM information, the performance between macrocell and femtocell is better balanced. Our study suggests that REM-based power control is useful in practical femtocell network planning, in which a careful balance should be struck in maintaining satisfactory network performance and user QoS (quality of service) in heterogeneous networks.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130550935","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 : 2013-10-17DOI: 10.1109/ICTEL.2013.6632090
Y. Abbes, S. Najeh, Hichem Besbes
In this paper, we aim to design an OFDMA frame-based resource allocation scheme allowing the power consumption minimization, the throughput enhancement and the queue's stability. We have proposed a novel proportional fairness admission control strategy in order to guarantee the desired QoS for each user. To increase the number of admitted users, we investigate a joint superposition coding and admission control process permitting to further exploit the multiuser diversity. Furthermore, we have suggested a power and bandwidth allocation scheme permitting to minimize power consumption while ensuring buffer's stability and satisfying the QoS requirements of users in a heavy load context. Numerical studies are conducted to evaluate the performance of the proposed algorithms in terms of served user and power consumption.
{"title":"Joint proportional fairness admission control and superposition coding for OFDMA networks","authors":"Y. Abbes, S. Najeh, Hichem Besbes","doi":"10.1109/ICTEL.2013.6632090","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632090","url":null,"abstract":"In this paper, we aim to design an OFDMA frame-based resource allocation scheme allowing the power consumption minimization, the throughput enhancement and the queue's stability. We have proposed a novel proportional fairness admission control strategy in order to guarantee the desired QoS for each user. To increase the number of admitted users, we investigate a joint superposition coding and admission control process permitting to further exploit the multiuser diversity. Furthermore, we have suggested a power and bandwidth allocation scheme permitting to minimize power consumption while ensuring buffer's stability and satisfying the QoS requirements of users in a heavy load context. Numerical studies are conducted to evaluate the performance of the proposed algorithms in terms of served user and power consumption.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126190744","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632146
S. Kumar, Mohammed Zafar Ali Khan
Cyclostationary detection is considered as one of the major methods for spectrum sensing in cognitive radio. But due to cyclic frequency mismatch the performance degrades as the sensing time increases. In this paper we propose block based cyclostationary detection which overcomes the sensitivity of traditional cyclostationary detection to cyclic frequency mismatch. Theoretical analysis of block based cyclostationary detection is presented which shows that there is an optimal block length for which the performance is best. Simulation results corroborating the theoretical analysis are then presented.
{"title":"Robust, block based cyclostationary detection","authors":"S. Kumar, Mohammed Zafar Ali Khan","doi":"10.1109/ICTEL.2013.6632146","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632146","url":null,"abstract":"Cyclostationary detection is considered as one of the major methods for spectrum sensing in cognitive radio. But due to cyclic frequency mismatch the performance degrades as the sensing time increases. In this paper we propose block based cyclostationary detection which overcomes the sensitivity of traditional cyclostationary detection to cyclic frequency mismatch. Theoretical analysis of block based cyclostationary detection is presented which shows that there is an optimal block length for which the performance is best. Simulation results corroborating the theoretical analysis are then presented.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125461950","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632142
N. Dimitriou, A. Polydoros, A. Barnawi
The paper focuses on the issue of path establishment in Mobile Ad-hoc NETworks (MANETs) suitable for challenging environments where traditional network designs underperform. The goal is to define, specify, design and assess solutions that can provide adequate-quality of service to specific missions that have to be deployed in hostile environments that imply propagation-harsh and otherwise unpredictable conditions. The main metrics of such technology-disruptive ad-hoc networking are reliability (resilience, robustness) and sufficient throughput to support applications that are time-critical and delay-sensitive (push-to-talk voice, streaming video), on top of classic data applications. The paper will show advanced autonomous cooperative path establishment techniques and will demonstrate their performance benefits and their suitability to support delay sensitive applications over dynamically changing MANET topologies.
{"title":"Cooperative path establishment for robust connectivity in mobile ad-hoc networks","authors":"N. Dimitriou, A. Polydoros, A. Barnawi","doi":"10.1109/ICTEL.2013.6632142","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632142","url":null,"abstract":"The paper focuses on the issue of path establishment in Mobile Ad-hoc NETworks (MANETs) suitable for challenging environments where traditional network designs underperform. The goal is to define, specify, design and assess solutions that can provide adequate-quality of service to specific missions that have to be deployed in hostile environments that imply propagation-harsh and otherwise unpredictable conditions. The main metrics of such technology-disruptive ad-hoc networking are reliability (resilience, robustness) and sufficient throughput to support applications that are time-critical and delay-sensitive (push-to-talk voice, streaming video), on top of classic data applications. The paper will show advanced autonomous cooperative path establishment techniques and will demonstrate their performance benefits and their suitability to support delay sensitive applications over dynamically changing MANET topologies.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114889225","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632164
Ejder Bastug, Jean-Louis Guenego, M. Debbah
Proactive scheduling in mobile networks is known as a way of using network resources efficiently. In this work, we investigate proactive Small Cell Networks (SCNs) from a caching perspective. We first assume that these small base stations are deployed with high capacity storage units but have limited capacity backhaul links. We then describe the model and define a Quality of Experience (QoE) metric in order to satisfy a given file request. The optimization problem is formulated in order to maximize this QoE metric for all requests under the capacity constraints. We solve this problem by introducing an algorithm, called PropCaching (proactive popularity caching), which relies on the popularity statistics of the requested files. Since not all requested files can be cached due to storage constraints, the algorithm selects the files with the highest popularities until the total storage capacity is achieved. Consecutively, the proposed caching algorithm is compared with random caching. Given caching and sufficient capacity of the wireless links, numerical results illustrate that the number of satisfied requests increases. Moreover, we show that PropCaching performs better than random caching in most cases. For example, for R = 192 number of requests and a storage ratio γ = 0.25 (storage capacity over sum of length of all requested files), the satisfaction in PropCaching is 85% higher than random caching and the backhaul usage is reduced by 10%.
{"title":"Proactive small cell networks","authors":"Ejder Bastug, Jean-Louis Guenego, M. Debbah","doi":"10.1109/ICTEL.2013.6632164","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632164","url":null,"abstract":"Proactive scheduling in mobile networks is known as a way of using network resources efficiently. In this work, we investigate proactive Small Cell Networks (SCNs) from a caching perspective. We first assume that these small base stations are deployed with high capacity storage units but have limited capacity backhaul links. We then describe the model and define a Quality of Experience (QoE) metric in order to satisfy a given file request. The optimization problem is formulated in order to maximize this QoE metric for all requests under the capacity constraints. We solve this problem by introducing an algorithm, called PropCaching (proactive popularity caching), which relies on the popularity statistics of the requested files. Since not all requested files can be cached due to storage constraints, the algorithm selects the files with the highest popularities until the total storage capacity is achieved. Consecutively, the proposed caching algorithm is compared with random caching. Given caching and sufficient capacity of the wireless links, numerical results illustrate that the number of satisfied requests increases. Moreover, we show that PropCaching performs better than random caching in most cases. For example, for R = 192 number of requests and a storage ratio γ = 0.25 (storage capacity over sum of length of all requested files), the satisfaction in PropCaching is 85% higher than random caching and the backhaul usage is reduced by 10%.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122876271","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632115
O. F. Gemici, Ibrahim Hökelek, H. A. Çırpan
The voice, video, and data traffic can be carried as IP packets over Long Term Evolution (LTE) networks which bring the cellular communication to the fourth generation (4G) era. LTE enables this digital convergence by offering higher capacity, including inherent IP support in its architecture, and supporting multi-user diversity scheduling. However, recent increases in Voice over IP (VoIP) and video traffic usage require the prioritization of the real-time traffic to meet its stringent QoS requirements. In this paper, the existing Round Robin and Best CQI schedulers are enhanced to enable the QoS support to the real-time traffic. For both schedulers, a configurable parameter, which determines the degree of priority level, is introduced so that the real-time traffic throughput can be administratively controlled without jeopardizing the overall network performance. Simulation results demonstrate the trade-off among the real-time traffic throughput, the overall system throughput and the overall system fairness for various scenarios.
语音、视频和数据流量可以在LTE (Long Term Evolution)网络上以IP包的形式进行传输，从而将蜂窝通信带入第四代(4G)时代。LTE通过提供更高的容量(包括其架构中固有的IP支持)和支持多用户多样性调度来实现这种数字融合。然而，近年来VoIP (Voice over IP)和视频业务的使用不断增加，需要对实时流量进行优先级排序，以满足其严格的QoS要求。本文对现有的轮循和最佳CQI调度器进行了改进，使其能够对实时流量提供QoS支持。对于这两个调度器，都引入了一个可配置的参数，该参数决定了优先级级别的程度，因此可以在不损害整体网络性能的情况下对实时流量吞吐量进行管理控制。仿真结果证明了在各种场景下，实时流量吞吐量、系统总体吞吐量和系统总体公平性之间的权衡。
{"title":"Trade-off analysis of QoS-aware configurable LTE downlink schedulers","authors":"O. F. Gemici, Ibrahim Hökelek, H. A. Çırpan","doi":"10.1109/ICTEL.2013.6632115","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632115","url":null,"abstract":"The voice, video, and data traffic can be carried as IP packets over Long Term Evolution (LTE) networks which bring the cellular communication to the fourth generation (4G) era. LTE enables this digital convergence by offering higher capacity, including inherent IP support in its architecture, and supporting multi-user diversity scheduling. However, recent increases in Voice over IP (VoIP) and video traffic usage require the prioritization of the real-time traffic to meet its stringent QoS requirements. In this paper, the existing Round Robin and Best CQI schedulers are enhanced to enable the QoS support to the real-time traffic. For both schedulers, a configurable parameter, which determines the degree of priority level, is introduced so that the real-time traffic throughput can be administratively controlled without jeopardizing the overall network performance. Simulation results demonstrate the trade-off among the real-time traffic throughput, the overall system throughput and the overall system fairness for various scenarios.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114226891","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632094
A. Chaoub, E. Ibn-Elhaj, J. E. Abbadi
Distributed communication has a great potential to become a promising foundation for future cognitive radio networks regarding its ability to provide a reliable multimedia transmission under lossy and delay constrained conditions. In this paper, we explore a novel distributed system for cognitive radio networks relying on the concept of multiple description coding for the more realistic case where packets are dropped due either to primary interruptions or subchannel fading. In particular, the initial stream is distributed across multiple nodes, each will be responsible of conveying one entire description using a single subchannel without the need to coordinate its activity with the other sources and the common destination will merge the received descriptions to recover the delivered stream. Numerical simulations are performed to investigate the throughput benefits of the proposed scheme, we argue that there is an optimal number of nodes providing the maximum achieved throughput while protecting the secondary content against the loss pattern.
{"title":"Multiple description coding based distributed communications over cognitive radio networks","authors":"A. Chaoub, E. Ibn-Elhaj, J. E. Abbadi","doi":"10.1109/ICTEL.2013.6632094","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632094","url":null,"abstract":"Distributed communication has a great potential to become a promising foundation for future cognitive radio networks regarding its ability to provide a reliable multimedia transmission under lossy and delay constrained conditions. In this paper, we explore a novel distributed system for cognitive radio networks relying on the concept of multiple description coding for the more realistic case where packets are dropped due either to primary interruptions or subchannel fading. In particular, the initial stream is distributed across multiple nodes, each will be responsible of conveying one entire description using a single subchannel without the need to coordinate its activity with the other sources and the common destination will merge the received descriptions to recover the delivered stream. Numerical simulations are performed to investigate the throughput benefits of the proposed scheme, we argue that there is an optimal number of nodes providing the maximum achieved throughput while protecting the secondary content against the loss pattern.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115818898","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632102
P. Kolios, A. Pitsillides, O. Mokryn
An emergency response networking scenario is considered, in which immediately after the strike of a disaster, mobile terminals autonomously form an ad-hoc network. Distress nodes, use this network to disseminate help-requests as a far outcry mechanism. In turn, and upon their arrival, emergency response units opt to gain access to the withstanding ad-hoc network in order to retrieve those disseminated help requests; invaluable information that would allow timely response to those distress nodes. This work is concerned with Bilateral Routing, an algorithm that best meets the requirements and constraints for help-request dissemination and retrieval in emergency scenarios. A novel explore-and-exploit dissemination strategy is detailed that clearly outperforms traditional dissemination mechanisms. The strategy takes into account both centrality and battery power of each node, to increase survivability and allow for a subsequent detection of help-requests by response units. The latter, search through reachable network nodes to retrieve new and unattended help requests. Extensive numerical results illustrate the decisive applicability of Bilateral Routing in emergency response networking scenarios.
{"title":"Bilateral routing in emergency response networks","authors":"P. Kolios, A. Pitsillides, O. Mokryn","doi":"10.1109/ICTEL.2013.6632102","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632102","url":null,"abstract":"An emergency response networking scenario is considered, in which immediately after the strike of a disaster, mobile terminals autonomously form an ad-hoc network. Distress nodes, use this network to disseminate help-requests as a far outcry mechanism. In turn, and upon their arrival, emergency response units opt to gain access to the withstanding ad-hoc network in order to retrieve those disseminated help requests; invaluable information that would allow timely response to those distress nodes. This work is concerned with Bilateral Routing, an algorithm that best meets the requirements and constraints for help-request dissemination and retrieval in emergency scenarios. A novel explore-and-exploit dissemination strategy is detailed that clearly outperforms traditional dissemination mechanisms. The strategy takes into account both centrality and battery power of each node, to increase survivability and allow for a subsequent detection of help-requests by response units. The latter, search through reachable network nodes to retrieve new and unattended help requests. Extensive numerical results illustrate the decisive applicability of Bilateral Routing in emergency response networking scenarios.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133028951","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632152
Adrian Kliks, F. Bader
This paper tackles the problem of efficient power loading in Filter-Bank based Multicarrier (FBMC) systems, being more and more often treated as the potential successor of the Orthogonal Frequency Division Multiplexing (OFDM) scheme. In particular the potential of application of the mercury-waterfilling principle for power allocation among data symbols in these systems has been analyzed. The efficiency of the proposed link adaptation scheme has been verified in the specified WiMAX-PUSC scenario, in which dedicated pilot pattern, adapted to the FBMC features, was used.
{"title":"Power loading for FBMC systems: An analysis with mercury-filling approach","authors":"Adrian Kliks, F. Bader","doi":"10.1109/ICTEL.2013.6632152","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632152","url":null,"abstract":"This paper tackles the problem of efficient power loading in Filter-Bank based Multicarrier (FBMC) systems, being more and more often treated as the potential successor of the Orthogonal Frequency Division Multiplexing (OFDM) scheme. In particular the potential of application of the mercury-waterfilling principle for power allocation among data symbols in these systems has been analyzed. The efficiency of the proposed link adaptation scheme has been verified in the specified WiMAX-PUSC scenario, in which dedicated pilot pattern, adapted to the FBMC features, was used.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"45 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131878877","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632154
E. Dahlman, K. Dimou, S. Parkvall, H. Tullberg
Network densification and heterogeneous deployments are key tools to satisfy future traffic-volume and end-user service-level demands. LTE release 10/11 introduced several features to enhance LTE operation in heterogeneous deployments. This will continue as part of the work on small-cell enhancements in LTE Release 12. Especially, different forms of dual-connectivity are being considered to improve overall system performance and enhance end-user experience.
{"title":"Future wireless access small cells and heterogeneous deployments","authors":"E. Dahlman, K. Dimou, S. Parkvall, H. Tullberg","doi":"10.1109/ICTEL.2013.6632154","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632154","url":null,"abstract":"Network densification and heterogeneous deployments are key tools to satisfy future traffic-volume and end-user service-level demands. LTE release 10/11 introduced several features to enhance LTE operation in heterogeneous deployments. This will continue as part of the work on small-cell enhancements in LTE Release 12. Especially, different forms of dual-connectivity are being considered to improve overall system performance and enhance end-user experience.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114427606","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
扫码关注我们
求助内容：
应助结果提醒方式：