Pub Date : 2013-04-17DOI: 10.1109/WTS.2013.6566240
Khodor Hamandi, Imad Sarji, I. Elhajj, A. Chehab, A. Kayssi
In this paper, we propose a privacy-enhanced LTE authentication and key agreement scheme, W-AKA. The scheme promises to improve privacy by employing a dynamic identity instead of the static IMSI. In order to exchange the IMSI and inform the user of the new randomized identity, we propose two methods. The first method uses a Wi-Fi secured side channel since Wi-Fi hotspots are becoming ubiquitous. The other method is incorporated as part of the mobile AKA. We also present a simple method through which a random temporary identity is generated. We studied the conditions where W-AKA outperforms the original AKA and where it underperforms. Our analysis shows that in the presence of Wi-Fi, and unless an attacker jams the Wi-Fi channel, W-AKA can sustain both active and passive attacks. On the other hand, in the absence of Wi-Fi, it can only mitigate risks of passive attacks. The difficulties and challenges of the proposed work are also analyzed. The scheme was implemented and compared with previously-published techniques in order to study the computational overhead to accomplish enhanced privacy.
{"title":"W-AKA: Privacy-enhanced LTE-AKA using secured channel over Wi-Fi","authors":"Khodor Hamandi, Imad Sarji, I. Elhajj, A. Chehab, A. Kayssi","doi":"10.1109/WTS.2013.6566240","DOIUrl":"https://doi.org/10.1109/WTS.2013.6566240","url":null,"abstract":"In this paper, we propose a privacy-enhanced LTE authentication and key agreement scheme, W-AKA. The scheme promises to improve privacy by employing a dynamic identity instead of the static IMSI. In order to exchange the IMSI and inform the user of the new randomized identity, we propose two methods. The first method uses a Wi-Fi secured side channel since Wi-Fi hotspots are becoming ubiquitous. The other method is incorporated as part of the mobile AKA. We also present a simple method through which a random temporary identity is generated. We studied the conditions where W-AKA outperforms the original AKA and where it underperforms. Our analysis shows that in the presence of Wi-Fi, and unless an attacker jams the Wi-Fi channel, W-AKA can sustain both active and passive attacks. On the other hand, in the absence of Wi-Fi, it can only mitigate risks of passive attacks. The difficulties and challenges of the proposed work are also analyzed. The scheme was implemented and compared with previously-published techniques in order to study the computational overhead to accomplish enhanced privacy.","PeriodicalId":441229,"journal":{"name":"2013 Wireless Telecommunications Symposium (WTS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116991541","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-04-17DOI: 10.1109/WTS.2013.6566259
Michael Murphree, J. Shim, Kevin Love
The standards' acceptance process is not an easy path to navigate and is littered with successes and failures. Today's mobile communication standards emerged through different processes: some through collaboration between government and business and others from businesses alone. Mobile technology is evolving at a rapid pace and the way in which standards are created is evolving as well. The purpose of this paper is to discuss standardization processes utilizing examples from American, European, Asian models. The background of technology standards will be discussed along with the impacts of different national models. The paper closes with a discussion focusing on the Chinese approach to telecommunication standards and the future of telecommunications standards.
{"title":"National approaches to technology standards for mobile telecommunications","authors":"Michael Murphree, J. Shim, Kevin Love","doi":"10.1109/WTS.2013.6566259","DOIUrl":"https://doi.org/10.1109/WTS.2013.6566259","url":null,"abstract":"The standards' acceptance process is not an easy path to navigate and is littered with successes and failures. Today's mobile communication standards emerged through different processes: some through collaboration between government and business and others from businesses alone. Mobile technology is evolving at a rapid pace and the way in which standards are created is evolving as well. The purpose of this paper is to discuss standardization processes utilizing examples from American, European, Asian models. The background of technology standards will be discussed along with the impacts of different national models. The paper closes with a discussion focusing on the Chinese approach to telecommunication standards and the future of telecommunications standards.","PeriodicalId":441229,"journal":{"name":"2013 Wireless Telecommunications Symposium (WTS)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133609357","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-04-17DOI: 10.1109/WTS.2013.6566245
Buvaneswari Ramanan, L. Drabeck, M. Haner, N. Nithi, T. Klein, Chitra Sawkar
With the rapid increase of traffic on the web, content caching reduces user-perceived latency as well as the transmission of redundant traffic on the network. In this study, we analyze the gains of HTTP content caching at the location of SGW in an LTE Wireless network. High cache hit ratio can be achieved if the proxy server caches only those contents that are guaranteed of significant revisits. In this paper, we identify such contents for optimum proxy server performance. We compare the cacheability gains for different content types such as image, video, text etc, and also for popular websites. Our analysis shows that amongst all the contents, `image' type have the highest revisit rate, which means caching them is beneficial. Amongst the popular websites compared, cacheable contents from `Facebook' have the highest probability of revisits. We extend the analysis by varying the interval of caching and studying its effect on the cacheability. Based on these results, we provide guidelines for configuring the proxy server for high cacheability benefits.
{"title":"Cacheability analysis of HTTP traffic in an operational LTE network","authors":"Buvaneswari Ramanan, L. Drabeck, M. Haner, N. Nithi, T. Klein, Chitra Sawkar","doi":"10.1109/WTS.2013.6566245","DOIUrl":"https://doi.org/10.1109/WTS.2013.6566245","url":null,"abstract":"With the rapid increase of traffic on the web, content caching reduces user-perceived latency as well as the transmission of redundant traffic on the network. In this study, we analyze the gains of HTTP content caching at the location of SGW in an LTE Wireless network. High cache hit ratio can be achieved if the proxy server caches only those contents that are guaranteed of significant revisits. In this paper, we identify such contents for optimum proxy server performance. We compare the cacheability gains for different content types such as image, video, text etc, and also for popular websites. Our analysis shows that amongst all the contents, `image' type have the highest revisit rate, which means caching them is beneficial. Amongst the popular websites compared, cacheable contents from `Facebook' have the highest probability of revisits. We extend the analysis by varying the interval of caching and studying its effect on the cacheability. Based on these results, we provide guidelines for configuring the proxy server for high cacheability benefits.","PeriodicalId":441229,"journal":{"name":"2013 Wireless Telecommunications Symposium (WTS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134060681","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-04-17DOI: 10.1109/WTS.2013.6566246
Francisco Vidal, A. Neto, A. Martins, B. Huyart
Five-port direct conversion receiver has been demonstrated as an interesting alternative for application in software-defined radio since its design is simple and it can operate in a wide range of frequencies. However, in order to carry out in-phase and quadrature demodulation, the five-port receiver must be calibrated for each frequency and modulation type. In this paper, we evaluate the performance of a blind calibration procedure based on Independent Component Analysis (ICA). The experimental and simulation results show the effectiveness of the FastICA algorithm when it is applied to the recovery of the components sI(t) and sQ(t) of the baseband signal in a five-port receiver.
{"title":"Blind calibration of five-port receiver based on Independent Component Analysis (ICA)","authors":"Francisco Vidal, A. Neto, A. Martins, B. Huyart","doi":"10.1109/WTS.2013.6566246","DOIUrl":"https://doi.org/10.1109/WTS.2013.6566246","url":null,"abstract":"Five-port direct conversion receiver has been demonstrated as an interesting alternative for application in software-defined radio since its design is simple and it can operate in a wide range of frequencies. However, in order to carry out in-phase and quadrature demodulation, the five-port receiver must be calibrated for each frequency and modulation type. In this paper, we evaluate the performance of a blind calibration procedure based on Independent Component Analysis (ICA). The experimental and simulation results show the effectiveness of the FastICA algorithm when it is applied to the recovery of the components sI(t) and sQ(t) of the baseband signal in a five-port receiver.","PeriodicalId":441229,"journal":{"name":"2013 Wireless Telecommunications Symposium (WTS)","volume":"5 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133321708","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-04-17DOI: 10.1109/WTS.2013.6566242
D. Chang, H. Yeh, Yulan Sun
In this paper, we investigate the issue of pulse propagation in a fragmented spectrum (FS) and adaptive equalization using embedded probing signals via feed forward paths only. A novel wavefront (WF) multiplexing (Muxing) and de-multiplexing (Demuxing) scheme as a pre- and postprocessing method is proposed for wideband waveforms or data symbols propagation through non-contiguous (NC) frequency slots in an FS. Embedded probing signals as a part of the input to the WF Muxing processor are used for diagnostic as a part of an equalization procedure. The performance of this scheme is evaluated via simulations. The results show pulse distortions can be minimized by equalizing propagation effects of NC channels via the WF Muxing and Demuxing techniques.
{"title":"Orthogonal wavefront-multiplexing architecture for communications in non-contiguous channels","authors":"D. Chang, H. Yeh, Yulan Sun","doi":"10.1109/WTS.2013.6566242","DOIUrl":"https://doi.org/10.1109/WTS.2013.6566242","url":null,"abstract":"In this paper, we investigate the issue of pulse propagation in a fragmented spectrum (FS) and adaptive equalization using embedded probing signals via feed forward paths only. A novel wavefront (WF) multiplexing (Muxing) and de-multiplexing (Demuxing) scheme as a pre- and postprocessing method is proposed for wideband waveforms or data symbols propagation through non-contiguous (NC) frequency slots in an FS. Embedded probing signals as a part of the input to the WF Muxing processor are used for diagnostic as a part of an equalization procedure. The performance of this scheme is evaluated via simulations. The results show pulse distortions can be minimized by equalizing propagation effects of NC channels via the WF Muxing and Demuxing techniques.","PeriodicalId":441229,"journal":{"name":"2013 Wireless Telecommunications Symposium (WTS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130211509","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-04-17DOI: 10.1109/WTS.2013.6566254
Z. Marantz
Controlling the distribution of resources is imperative in any wireless system. Much research has considered the efficiency of the allocation in terms of bits per Joule of radiated energy. In addition, game theoretical concepts have been used to propose algorithms that help systems reach an optimal operating point. This paper investigates in detail the formerly proposed network assisted power control and, unlike other work that has been done, proves that for a very general class of functions it is Pareto Optimal.
{"title":"On the optimality of network assisted power control for a general class of sigmoid functions","authors":"Z. Marantz","doi":"10.1109/WTS.2013.6566254","DOIUrl":"https://doi.org/10.1109/WTS.2013.6566254","url":null,"abstract":"Controlling the distribution of resources is imperative in any wireless system. Much research has considered the efficiency of the allocation in terms of bits per Joule of radiated energy. In addition, game theoretical concepts have been used to propose algorithms that help systems reach an optimal operating point. This paper investigates in detail the formerly proposed network assisted power control and, unlike other work that has been done, proves that for a very general class of functions it is Pareto Optimal.","PeriodicalId":441229,"journal":{"name":"2013 Wireless Telecommunications Symposium (WTS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114402017","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-04-17DOI: 10.1109/WTS.2013.6566241
Yisroel Mirsky, Yoram Haddad
In order to optimize its capacity, a cellular radio system can use a power control algorithm to provide the best overall carrier-to-interference ratio to all of its links. Unfortunately, the optimum algorithm has an impractical exponential complexity of O(2n). However, an approach to the problem has been overlooked. By taking advantage of propagation effects it is possible to split up a large problem into overlapping smaller ones. Doing so can achieve virtually identical results to that of the optimum algorithm in O(n) time (having a stable system). Moreover, this proposed algorithm is suitable as a distributed power control algorithm, whereas the optimum algorithm is a centralized one. This makes the proposed algorithm more suitable for today's cellular network architectures. Furthermore, it is also very easy to parallelize the proposed algorithm over multiple threads and cores offering a great added hardware advantage. In this paper we introduce this algorithm, prove its linear complexity and provide numerical results from simulations.
{"title":"A linear downlink power control algorithm for wireless networks","authors":"Yisroel Mirsky, Yoram Haddad","doi":"10.1109/WTS.2013.6566241","DOIUrl":"https://doi.org/10.1109/WTS.2013.6566241","url":null,"abstract":"In order to optimize its capacity, a cellular radio system can use a power control algorithm to provide the best overall carrier-to-interference ratio to all of its links. Unfortunately, the optimum algorithm has an impractical exponential complexity of O(2n). However, an approach to the problem has been overlooked. By taking advantage of propagation effects it is possible to split up a large problem into overlapping smaller ones. Doing so can achieve virtually identical results to that of the optimum algorithm in O(n) time (having a stable system). Moreover, this proposed algorithm is suitable as a distributed power control algorithm, whereas the optimum algorithm is a centralized one. This makes the proposed algorithm more suitable for today's cellular network architectures. Furthermore, it is also very easy to parallelize the proposed algorithm over multiple threads and cores offering a great added hardware advantage. In this paper we introduce this algorithm, prove its linear complexity and provide numerical results from simulations.","PeriodicalId":441229,"journal":{"name":"2013 Wireless Telecommunications Symposium (WTS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123814308","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-04-17DOI: 10.1109/WTS.2013.6566252
Pouyan Ahmadi, B. Jabbari
In this paper emphasizing the relation between outage and power, we propose a novel cooperative routing algorithm, called Outage-aware K-shortest paths Cooperative Routing (OKCR), which minimizes the transmitted power while exploiting the merit of cooperative communication. The OKCR algorithm (i.e., inherently based on Yen's Kshortest paths algorithm) finds the best route between the source and the destination considering particular outage probability as its constraint. The proposed algorithm nominates k different optimum routes and then selects the best possible relay in each route on the basis of performance analysis. Simulation results show that this strategy enhances power-efficiency in comparison to non-cooperative and other existing cooperative algorithms investigated in the literature by more than 50%.
{"title":"An outage-aware power saving Cooperative Routing algorithm in wireless networks","authors":"Pouyan Ahmadi, B. Jabbari","doi":"10.1109/WTS.2013.6566252","DOIUrl":"https://doi.org/10.1109/WTS.2013.6566252","url":null,"abstract":"In this paper emphasizing the relation between outage and power, we propose a novel cooperative routing algorithm, called Outage-aware K-shortest paths Cooperative Routing (OKCR), which minimizes the transmitted power while exploiting the merit of cooperative communication. The OKCR algorithm (i.e., inherently based on Yen's Kshortest paths algorithm) finds the best route between the source and the destination considering particular outage probability as its constraint. The proposed algorithm nominates k different optimum routes and then selects the best possible relay in each route on the basis of performance analysis. Simulation results show that this strategy enhances power-efficiency in comparison to non-cooperative and other existing cooperative algorithms investigated in the literature by more than 50%.","PeriodicalId":441229,"journal":{"name":"2013 Wireless Telecommunications Symposium (WTS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124250179","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-04-17DOI: 10.1109/WTS.2013.6566239
Isam Abdalla, S. Venkatesan
Demand for Machine to Machine (M2M) communication over cellular wireless network has recently seen a rapid growth. This growth resulted in extra demand for the limited numbering and addressing resources used in the cellular wireless networks. The two main, potentially, limiting resources for the rising demand for M2M communication in the cellular wireless networks are the International Mobile Subscriber Identity (IMSI) and the Mobile Station International Subscriber Directory Number (MSISDN). Each device communicating over the 4th Generation (4G) cellular wireless network is allocated an IMSI to uniquely identify it in the network and at least one MSISDN that is used for terminating calls to the device. This paper addresses the numbering and addressing impact on M2M communication over the 4G cellular networks. We present a solution, based on the Evolved Packet Core (EPC) of the 4G cellular networks, to extend the use of IMSI to accommodate the projected growth in the M2M communication.
{"title":"Scalable addressing of M2M terminals in 4G cellular wireless networks","authors":"Isam Abdalla, S. Venkatesan","doi":"10.1109/WTS.2013.6566239","DOIUrl":"https://doi.org/10.1109/WTS.2013.6566239","url":null,"abstract":"Demand for Machine to Machine (M2M) communication over cellular wireless network has recently seen a rapid growth. This growth resulted in extra demand for the limited numbering and addressing resources used in the cellular wireless networks. The two main, potentially, limiting resources for the rising demand for M2M communication in the cellular wireless networks are the International Mobile Subscriber Identity (IMSI) and the Mobile Station International Subscriber Directory Number (MSISDN). Each device communicating over the 4th Generation (4G) cellular wireless network is allocated an IMSI to uniquely identify it in the network and at least one MSISDN that is used for terminating calls to the device. This paper addresses the numbering and addressing impact on M2M communication over the 4G cellular networks. We present a solution, based on the Evolved Packet Core (EPC) of the 4G cellular networks, to extend the use of IMSI to accommodate the projected growth in the M2M communication.","PeriodicalId":441229,"journal":{"name":"2013 Wireless Telecommunications Symposium (WTS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128346465","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-04-17DOI: 10.1109/WTS.2013.6566250
Q. Xie, Yizong Cheng
This paper proposes a clustering algorithm for heterogeneous wireless sensor networks, addressing energy dissipation as a key issue. Energy dissipation required by sensor nodes to transmit data depends on the distance between sensor nodes and cluster heads or a base station. Clustering is one of the best techniques for reducing energy consumption and extending sensor network lifetimes. Desirable features of the proposed clustering algorithm include: adaptation to changes in sensor distribution; energy efficiency; localized and distributed data aggregation and decision making; immunity to partial damage; and self-recovery. It employs a smallest disc covering algorithm to achieve a minimum of the maximum distance between a cluster head and sensor nodes compared to k-means clustering. Lawson's multiplicative rule is used for the smallest disc covering algorithm. Our simulation demonstrates that the proposed algorithm takes 50.8% fewer iterations to converge for cluster formation, with 33.9% and 23.2% shorter maximum and average intra-cluster distances versus k-means clustering. Performance is also improved.
{"title":"K-centers Min-Max clustering algorithm over heterogeneous wireless sensor networks","authors":"Q. Xie, Yizong Cheng","doi":"10.1109/WTS.2013.6566250","DOIUrl":"https://doi.org/10.1109/WTS.2013.6566250","url":null,"abstract":"This paper proposes a clustering algorithm for heterogeneous wireless sensor networks, addressing energy dissipation as a key issue. Energy dissipation required by sensor nodes to transmit data depends on the distance between sensor nodes and cluster heads or a base station. Clustering is one of the best techniques for reducing energy consumption and extending sensor network lifetimes. Desirable features of the proposed clustering algorithm include: adaptation to changes in sensor distribution; energy efficiency; localized and distributed data aggregation and decision making; immunity to partial damage; and self-recovery. It employs a smallest disc covering algorithm to achieve a minimum of the maximum distance between a cluster head and sensor nodes compared to k-means clustering. Lawson's multiplicative rule is used for the smallest disc covering algorithm. Our simulation demonstrates that the proposed algorithm takes 50.8% fewer iterations to converge for cluster formation, with 33.9% and 23.2% shorter maximum and average intra-cluster distances versus k-means clustering. Performance is also improved.","PeriodicalId":441229,"journal":{"name":"2013 Wireless Telecommunications Symposium (WTS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124667016","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
扫码关注我们
求助内容：
应助结果提醒方式：