Pub Date : 2010-05-23DOI: 10.1109/ICC.2010.5502440
P. Vellore, P. Gillard, R. Venkatesan
The mathematical framework for member reliability of Multicasting in BitTorrent Enabled Ad Hoc Network (MBEAN) routing protocol is reported in this paper. Analytical expressions for packet delivery ratio and bounds for routing and control overhead are also derived. Simulations conducted demonstrate that MBEAN achieves higher member-to-member connectivity, and therefore, higher member reliability compared to other multicast routing protocols such as Multicasting in Ad hoc On Demand Distance Vector (MAODV) routing protocol and Protocol for Unified Multicasting through Announcements (PUMA).MBEAN also shows improved packet delivery ratio with reduced overall overhead compared to MAODV and PUMA.
{"title":"Reliability and Overhead Analysis of Multicast BitTorrent Enabled Ad Hoc Network Routing","authors":"P. Vellore, P. Gillard, R. Venkatesan","doi":"10.1109/ICC.2010.5502440","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502440","url":null,"abstract":"The mathematical framework for member reliability of Multicasting in BitTorrent Enabled Ad Hoc Network (MBEAN) routing protocol is reported in this paper. Analytical expressions for packet delivery ratio and bounds for routing and control overhead are also derived. Simulations conducted demonstrate that MBEAN achieves higher member-to-member connectivity, and therefore, higher member reliability compared to other multicast routing protocols such as Multicasting in Ad hoc On Demand Distance Vector (MAODV) routing protocol and Protocol for Unified Multicasting through Announcements (PUMA).MBEAN also shows improved packet delivery ratio with reduced overall overhead compared to MAODV and PUMA.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"3 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81654760","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}
In this paper, we study a cognitive coexistence strategy for heterogeneous networks. While a lot of previous works focused on spectrum underlay approaches for weak interference scenarios, a high power infrastructure (IS) transmitter creates a large dead zone for nearby ad-hoc (AH) links using the same spectrum. To address this problem, we propose to utilize a halfduplex decode-and-forward (DF) relay node to assist the IS transmitter. The transmission time and power of relay-assisted IS network is optimized to reduce its generated interference while still guaranteeing its quality-of-service (QoS) level. The resource allocation problem of relay-assisted IS network is formulated as a convex optimization problem, for which a tailored dual optimization method is proposed. Our numerical results show that our relay-assisted scheme can produce less interference and/or achieve a higher QoS level.
{"title":"Resource Allocation for the Cognitive Coexistence of Ad-Hoc and Cooperative Relay Networks","authors":"Yin Sun, Yunzhou Li, Xiaofeng Zhong, Shidong Zhou, Xibin Xu","doi":"10.1109/ICC.2010.5502020","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502020","url":null,"abstract":"In this paper, we study a cognitive coexistence strategy for heterogeneous networks. While a lot of previous works focused on spectrum underlay approaches for weak interference scenarios, a high power infrastructure (IS) transmitter creates a large dead zone for nearby ad-hoc (AH) links using the same spectrum. To address this problem, we propose to utilize a halfduplex decode-and-forward (DF) relay node to assist the IS transmitter. The transmission time and power of relay-assisted IS network is optimized to reduce its generated interference while still guaranteeing its quality-of-service (QoS) level. The resource allocation problem of relay-assisted IS network is formulated as a convex optimization problem, for which a tailored dual optimization method is proposed. Our numerical results show that our relay-assisted scheme can produce less interference and/or achieve a higher QoS level.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"26 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81661037","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-05-23DOI: 10.1109/ICC.2010.5502345
Xijun Wang, Wei Chen, Z. Cao
Rateless codes can be used for mutual information accumulation in multi-hop wireless networks. However, the impact of spatial reuse and/or node cooperation on performance of the linear multi- hop network employing rateless codes has not been carefully studied yet. In this paper, we present three rateless coded forwarding schemes in linear multi-hop networks, namely, multi-hop forwarding with no spatial reuse, multi-hop forwarding with spatial reuse, and cooperative forwarding with spatial reuse. By analyzing and comparing their performance, we conclude that mutual information accumulation with spatial reuse improves the average throughput but induces a larger latency, while node cooperation, based on rateless codes and spatial reuse, reduces the average delay but suffers a throughput loss.
{"title":"Rateless Coded Chain Cooperation in Linear Multi-Hop Wireless Networks","authors":"Xijun Wang, Wei Chen, Z. Cao","doi":"10.1109/ICC.2010.5502345","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502345","url":null,"abstract":"Rateless codes can be used for mutual information accumulation in multi-hop wireless networks. However, the impact of spatial reuse and/or node cooperation on performance of the linear multi- hop network employing rateless codes has not been carefully studied yet. In this paper, we present three rateless coded forwarding schemes in linear multi-hop networks, namely, multi-hop forwarding with no spatial reuse, multi-hop forwarding with spatial reuse, and cooperative forwarding with spatial reuse. By analyzing and comparing their performance, we conclude that mutual information accumulation with spatial reuse improves the average throughput but induces a larger latency, while node cooperation, based on rateless codes and spatial reuse, reduces the average delay but suffers a throughput loss.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"26 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82071137","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-05-23DOI: 10.1109/ICC.2010.5502810
K. Appaiah, A. Ashikhmin, T. Marzetta
This paper considers the problem of interference mitigation in multi-cell multi-antenna time division duplex (TDD) wireless systems for downlink transmission. An efficient way to obtain channel state information (CSI) at the base station is by using uplink pilots and reciprocity of the downlink channel. At the same time, it has been shown that pilots from different cells contaminate each other, resulting in corruption of precoding matrices used by base stations, and high inter-cell interference. This paper studies the effects of shifting the location of pilots in time frames used in neighboring cells, and its effectiveness in obtaining better channel estimates, and, thereby, inter-cell interference reduction.
{"title":"Pilot Contamination Reduction in Multi-User TDD Systems","authors":"K. Appaiah, A. Ashikhmin, T. Marzetta","doi":"10.1109/ICC.2010.5502810","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502810","url":null,"abstract":"This paper considers the problem of interference mitigation in multi-cell multi-antenna time division duplex (TDD) wireless systems for downlink transmission. An efficient way to obtain channel state information (CSI) at the base station is by using uplink pilots and reciprocity of the downlink channel. At the same time, it has been shown that pilots from different cells contaminate each other, resulting in corruption of precoding matrices used by base stations, and high inter-cell interference. This paper studies the effects of shifting the location of pilots in time frames used in neighboring cells, and its effectiveness in obtaining better channel estimates, and, thereby, inter-cell interference reduction.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"111 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82463024","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-05-23DOI: 10.1109/ICC.2010.5502190
M. Schlansker, J. Tourrilhes, Yoshio Turner, J. R. Santos
Most datacenter networks are based on specialized edge-core topologies, which are costly to build, difficult to maintain and consume too much power. We propose enhancements to layer-two (L2) Ethernet switches to enable multipath L2 routing in scalable datacenters. This replaces an expensive router with commodity switches. Our hash-based routing approach reuses and minimally extends hardware structures in high-volume switches, while exposing a powerful network management inter-face for multipath load balancing, QoS differentiation, and resilience to faults. Simulation results demonstrate near-optimal load balancing for uniform and non-uniform traffic patterns, and effective management of large datacenter networks independent of the number of traffic flows.
{"title":"Killer Fabrics for Scalable Datacenters","authors":"M. Schlansker, J. Tourrilhes, Yoshio Turner, J. R. Santos","doi":"10.1109/ICC.2010.5502190","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502190","url":null,"abstract":"Most datacenter networks are based on specialized edge-core topologies, which are costly to build, difficult to maintain and consume too much power. We propose enhancements to layer-two (L2) Ethernet switches to enable multipath L2 routing in scalable datacenters. This replaces an expensive router with commodity switches. Our hash-based routing approach reuses and minimally extends hardware structures in high-volume switches, while exposing a powerful network management inter-face for multipath load balancing, QoS differentiation, and resilience to faults. Simulation results demonstrate near-optimal load balancing for uniform and non-uniform traffic patterns, and effective management of large datacenter networks independent of the number of traffic flows.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"31 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78825400","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-05-23DOI: 10.1109/ICC.2010.5502493
Xiaozhao Wang, Yinlong Xu, Yuchong Hu, Kaiqian Ou
Distributed storage systems provide reliable access to data through redundancy spread in network system. A key goal is to minimize bandwidth overhead to maintain the redundancy. This paper studies the flexible recovery from multiple node failures in distributed storage systems. Via a cut-based analysis of information flow graph, we obtain a lower bound of maintenance bandwidth for multi-loss flexible recovery (MFR). We also design a coding scheme based on MFR with maintenance bandwidth matching the lower bound. So the lower bound of maintenance bandwidth for multi-loss recovery is tight and the proposed recovery scheme is optimal.
{"title":"MFR: Multi-Loss Flexible Recovery in Distributed Storage Systems","authors":"Xiaozhao Wang, Yinlong Xu, Yuchong Hu, Kaiqian Ou","doi":"10.1109/ICC.2010.5502493","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502493","url":null,"abstract":"Distributed storage systems provide reliable access to data through redundancy spread in network system. A key goal is to minimize bandwidth overhead to maintain the redundancy. This paper studies the flexible recovery from multiple node failures in distributed storage systems. Via a cut-based analysis of information flow graph, we obtain a lower bound of maintenance bandwidth for multi-loss flexible recovery (MFR). We also design a coding scheme based on MFR with maintenance bandwidth matching the lower bound. So the lower bound of maintenance bandwidth for multi-loss recovery is tight and the proposed recovery scheme is optimal.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"81 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76334667","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-05-23DOI: 10.1109/ICC.2010.5502428
Kashif Ali, Sharief M. A. Oteafy, H. Hassanein
Tag collisions impose a significant hindrance to reading rates of Radio Frequency Identification systems. The parallel singulation approach, being a major milestone, clusters tags and autonomously interrogates each cluster in parallel. This technique reduces the number of tags being interrogated at a given time, reducing collisions, and achieves higher reading rates. However, such an approach faces two limitations as the number of clusters increase. The exponential increase in tag responses may hinder tag functionality due to energy spent on communication. Moreover, energy inefficiency is incurred at cluster-heads to process significantly more tag responses. These issues overshadow the promising benefits of employing parallel singulation. In this paper, we remedy such hindrances by proposing energy efficient enhancements to the parallel singulation technique. The essence of these enhancements lies in minimizing an important measure of communication overhead, referred to as textit{tags traffic rate}, which indicates the efficiency of interrogation cycles in communicating with all tags without incurring unnecessary overhead. Analyses carried out via simulation demonstrate significant improvements by the proposed schemes in reducing energy consumption of cluster-heads, without posing constraints on tag operations nor incurring significant degradation of reading rates.
{"title":"Energy-Efficient Parallel Singulation in RFID","authors":"Kashif Ali, Sharief M. A. Oteafy, H. Hassanein","doi":"10.1109/ICC.2010.5502428","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502428","url":null,"abstract":"Tag collisions impose a significant hindrance to reading rates of Radio Frequency Identification systems. The parallel singulation approach, being a major milestone, clusters tags and autonomously interrogates each cluster in parallel. This technique reduces the number of tags being interrogated at a given time, reducing collisions, and achieves higher reading rates. However, such an approach faces two limitations as the number of clusters increase. The exponential increase in tag responses may hinder tag functionality due to energy spent on communication. Moreover, energy inefficiency is incurred at cluster-heads to process significantly more tag responses. These issues overshadow the promising benefits of employing parallel singulation. In this paper, we remedy such hindrances by proposing energy efficient enhancements to the parallel singulation technique. The essence of these enhancements lies in minimizing an important measure of communication overhead, referred to as textit{tags traffic rate}, which indicates the efficiency of interrogation cycles in communicating with all tags without incurring unnecessary overhead. Analyses carried out via simulation demonstrate significant improvements by the proposed schemes in reducing energy consumption of cluster-heads, without posing constraints on tag operations nor incurring significant degradation of reading rates.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"145 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75975124","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-05-23DOI: 10.1109/ICC.2010.5502192
Jingwei Li, S. Chan
With the penetration of broadband wireless access network and devices, interactive multimedia streaming to handhelds has become a reality. However, it is still challenging to offer such services to a large number of users in a cost-effective manner. With the increase of battery lifetime, memory capacity and processing capability, and the fact that many mobile devices nowadays are equipped with multiple interfaces (3G, Wi-Fi, bluetooth, etc.), we study wireless peer-to-peer (P2P) streaming for scalable interactive streaming. In the network, videos are divided into segments and collaboratively cached and accessed among mobile devices. The major challenge is then which segment to cache at each mobile to achieve efficient access (in terms of low segment access cost). We first formulate the problem of segment caching to minimize segment access cost. We show that the optimization problem is NP-hard and present OPSEC (Optimized Segment Caching), a distributed algorithm which achieves collaborative and efficient segment caching, given heterogeneous caching capacities of the participating users. Using simulation, we show that OPSEC achieves much lower network access cost as compared with some recent schemes for interactive wireless video streaming.
{"title":"Optimizing Segment Caching for Mobile Peer-to-Peer Interactive Streaming","authors":"Jingwei Li, S. Chan","doi":"10.1109/ICC.2010.5502192","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502192","url":null,"abstract":"With the penetration of broadband wireless access network and devices, interactive multimedia streaming to handhelds has become a reality. However, it is still challenging to offer such services to a large number of users in a cost-effective manner. With the increase of battery lifetime, memory capacity and processing capability, and the fact that many mobile devices nowadays are equipped with multiple interfaces (3G, Wi-Fi, bluetooth, etc.), we study wireless peer-to-peer (P2P) streaming for scalable interactive streaming. In the network, videos are divided into segments and collaboratively cached and accessed among mobile devices. The major challenge is then which segment to cache at each mobile to achieve efficient access (in terms of low segment access cost). We first formulate the problem of segment caching to minimize segment access cost. We show that the optimization problem is NP-hard and present OPSEC (Optimized Segment Caching), a distributed algorithm which achieves collaborative and efficient segment caching, given heterogeneous caching capacities of the participating users. Using simulation, we show that OPSEC achieves much lower network access cost as compared with some recent schemes for interactive wireless video streaming.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"46 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86904737","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-05-23DOI: 10.1109/ICC.2010.5502290
Luca Bencini, R. Fantacci, L. Maccari
Wireless mesh networks suffer of scalability problems when the number of nodes grows. To solve this issue, wireless mesh networks with multi-interface nodes were introduced. In such networks it is possible to use multiple channels to implement spatial reuse of frequencies. These solutions offer a huge throughput performance improvement but they increase the complexity due to the need of implementing a selection interface policy. One of the most simple interface selection policy is random choice. In this paper we provide an analytical analysis of the Uniform Random Interface Selection strategy applied in a 802.11 DCF multi-radio network. Then we also present a set of performance results for the throughput and discard probability in function of the number of nodes and the number of interfaces.
{"title":"Analytical Model for Performance Analysis of IEEE 802.11 DCF Mechanism in Multi-Radio Wireless Networks","authors":"Luca Bencini, R. Fantacci, L. Maccari","doi":"10.1109/ICC.2010.5502290","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502290","url":null,"abstract":"Wireless mesh networks suffer of scalability problems when the number of nodes grows. To solve this issue, wireless mesh networks with multi-interface nodes were introduced. In such networks it is possible to use multiple channels to implement spatial reuse of frequencies. These solutions offer a huge throughput performance improvement but they increase the complexity due to the need of implementing a selection interface policy. One of the most simple interface selection policy is random choice. In this paper we provide an analytical analysis of the Uniform Random Interface Selection strategy applied in a 802.11 DCF multi-radio network. Then we also present a set of performance results for the throughput and discard probability in function of the number of nodes and the number of interfaces.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"9 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87650612","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-05-23DOI: 10.1109/ICC.2010.5501987
Jun He, Hongchi Shi
It is one of the major application categories for wireless sensor networks to detect intruders entering protected areas. Early research has studied the problem of barrier coverage for intruder detections. However, it is an open problem to set up the sensor barriers with the minimum number of sensor nodes in wireless sensor networks. It is a critically important problem, and its solution can be widely utilized in the sensor barrier deployment. In this paper, we present a complete solution to this minimum-node barrier coverage problem. Our algorithm works in an asynchronous and distributed fashion for protected areas of any size and any shape. In our algorithm, each node is only required to communicate to its neighbors and is not necessary to be homogeneous or to know its location. For a deployment of n sensors, the new approach has O(n²log(n)) message and time complexities. Our algorithm is the first and the best to provide a distributed solution to the minimum-node barrier coverage problem in asynchronous wireless sensor networks.
{"title":"Finding Barriers with Minimum Number of Sensors in Wireless Sensor Networks","authors":"Jun He, Hongchi Shi","doi":"10.1109/ICC.2010.5501987","DOIUrl":"https://doi.org/10.1109/ICC.2010.5501987","url":null,"abstract":"It is one of the major application categories for wireless sensor networks to detect intruders entering protected areas. Early research has studied the problem of barrier coverage for intruder detections. However, it is an open problem to set up the sensor barriers with the minimum number of sensor nodes in wireless sensor networks. It is a critically important problem, and its solution can be widely utilized in the sensor barrier deployment. In this paper, we present a complete solution to this minimum-node barrier coverage problem. Our algorithm works in an asynchronous and distributed fashion for protected areas of any size and any shape. In our algorithm, each node is only required to communicate to its neighbors and is not necessary to be homogeneous or to know its location. For a deployment of n sensors, the new approach has O(n²log(n)) message and time complexities. Our algorithm is the first and the best to provide a distributed solution to the minimum-node barrier coverage problem in asynchronous wireless sensor networks.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"14 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86060972","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
扫码关注我们
求助内容：
应助结果提醒方式：