Pub Date : 2011-06-12DOI: 10.1109/Med-Hoc-Net.2011.5970489
L. Bracciale, Donato Battaglino, A. Detti, G. Bianchi, N. Blefari-Melazzi, A. Bragagnini, M. Turolla
In this work we assess the delay performance of a Publish Subscribe system built on top of a Delay Tolerant Network (DTN) composed of nodes with limited storage capacities. Many DTN routing protocols replicate the same data over several nodes, in order to deliver data to destination in a faster or in a more reliable way. Of course, increasing the number of replicas has the effect of decreasing the delivery delay perceived by the users, but increases the use of the system memory.
{"title":"Delay performance of a Publish Subscribe system deployed over a memory-constrained, Delay Tolerant Network","authors":"L. Bracciale, Donato Battaglino, A. Detti, G. Bianchi, N. Blefari-Melazzi, A. Bragagnini, M. Turolla","doi":"10.1109/Med-Hoc-Net.2011.5970489","DOIUrl":"https://doi.org/10.1109/Med-Hoc-Net.2011.5970489","url":null,"abstract":"In this work we assess the delay performance of a Publish Subscribe system built on top of a Delay Tolerant Network (DTN) composed of nodes with limited storage capacities. Many DTN routing protocols replicate the same data over several nodes, in order to deliver data to destination in a faster or in a more reliable way. Of course, increasing the number of replicas has the effect of decreasing the delivery delay perceived by the users, but increases the use of the system memory.","PeriodicalId":350979,"journal":{"name":"2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126019123","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 : 2011-06-12DOI: 10.1109/Med-Hoc-Net.2011.5970493
Eun-Kyu Lee, M. Gerla
Secure transmission among mobile nodes in hostile environments has often been achieved by trading off security with communication latency. However, in time critical applications (e.g., tactical wireless networks, civilian law enforcement operations, homeland security missions, etc.), latency is more critical than any other parameters. Long latency is generally attributed to the time required by authentication in the presence of eavesdroppers and jammers. To address the latency issue, this paper proposes a Secured Bilateral Rendezvous (SBR) protocol that reduces the communication latency while guaranteeing protection. SBR performs neighbor detection before authentication. During detection, nodes exchange a common secret key in plaintext that helps speed up the authentication process. The plaintext message is protected against jammers by allowing nodes to transmit simultaneously and to recover the partner's packets using self interference cancellation technique. Simulation results show that the proposed SBR protocol can effectively withstand various jamming attacks.
{"title":"Secured Bilateral Rendezvous using self interference cancellation in wireless networks","authors":"Eun-Kyu Lee, M. Gerla","doi":"10.1109/Med-Hoc-Net.2011.5970493","DOIUrl":"https://doi.org/10.1109/Med-Hoc-Net.2011.5970493","url":null,"abstract":"Secure transmission among mobile nodes in hostile environments has often been achieved by trading off security with communication latency. However, in time critical applications (e.g., tactical wireless networks, civilian law enforcement operations, homeland security missions, etc.), latency is more critical than any other parameters. Long latency is generally attributed to the time required by authentication in the presence of eavesdroppers and jammers. To address the latency issue, this paper proposes a Secured Bilateral Rendezvous (SBR) protocol that reduces the communication latency while guaranteeing protection. SBR performs neighbor detection before authentication. During detection, nodes exchange a common secret key in plaintext that helps speed up the authentication process. The plaintext message is protected against jammers by allowing nodes to transmit simultaneously and to recover the partner's packets using self interference cancellation technique. Simulation results show that the proposed SBR protocol can effectively withstand various jamming attacks.","PeriodicalId":350979,"journal":{"name":"2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116721198","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 : 2011-06-12DOI: 10.1109/Med-Hoc-Net.2011.5970478
Anna Abbagnale, F. Cuomo, P. Salvo
In Cognitive Radio Ad-Hoc Networks [1] the design of suitable routing solutions is a focal issue to fully unleash the potentials of this networking paradigm. The main challenge is exploiting spectrum holes to build up network paths that remain stable and that achieve specific network performance in terms of delay and percentage of delivered data, even if an opportunistic spectrum access is implemented. In this paper we propose a utility function based on the path connectivity, re-elaborated in a cognitive radio scenario, and we compare it with other utility functions that can be used for routing data in cognitive radio. We show that by using our utility function we select paths for the secondary users transmissions leading to better performance when compared with a utility function that selects paths with the minimum activities of the primary users and an utility function that minimizes the number of hops. These results are derived in great number of topologies and with different primary users activities.
{"title":"Comparison of utility functions for routing in cognitive wireless ad-hoc networks","authors":"Anna Abbagnale, F. Cuomo, P. Salvo","doi":"10.1109/Med-Hoc-Net.2011.5970478","DOIUrl":"https://doi.org/10.1109/Med-Hoc-Net.2011.5970478","url":null,"abstract":"In Cognitive Radio Ad-Hoc Networks [1] the design of suitable routing solutions is a focal issue to fully unleash the potentials of this networking paradigm. The main challenge is exploiting spectrum holes to build up network paths that remain stable and that achieve specific network performance in terms of delay and percentage of delivered data, even if an opportunistic spectrum access is implemented. In this paper we propose a utility function based on the path connectivity, re-elaborated in a cognitive radio scenario, and we compare it with other utility functions that can be used for routing data in cognitive radio. We show that by using our utility function we select paths for the secondary users transmissions leading to better performance when compared with a utility function that selects paths with the minimum activities of the primary users and an utility function that minimizes the number of hops. These results are derived in great number of topologies and with different primary users activities.","PeriodicalId":350979,"journal":{"name":"2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124778934","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 : 2011-06-12DOI: 10.1109/Med-Hoc-Net.2011.5970475
N. Salman, H. K. Maheshwari, A. Kemp, M. Ghogho
In this paper we discuss the lower bound i.e. the Cramer-rao-bound (CRB) on the accuracy of localization of nodes in a wireless network. We investigate the effects of anchor (or base station) placement on optimal target node positioning. The optimal and worst anchor positions are determined through extended simulation by comparing their mean CRB. Furthermore the ramifications of an additive and multiplicative noise model on the mean CRB are explored. Finally, the least squares (LS) method for localization is used and its performance is compared with the lower bound for optimal anchor positions.
{"title":"Effects of anchor placement on mean-CRB for localization","authors":"N. Salman, H. K. Maheshwari, A. Kemp, M. Ghogho","doi":"10.1109/Med-Hoc-Net.2011.5970475","DOIUrl":"https://doi.org/10.1109/Med-Hoc-Net.2011.5970475","url":null,"abstract":"In this paper we discuss the lower bound i.e. the Cramer-rao-bound (CRB) on the accuracy of localization of nodes in a wireless network. We investigate the effects of anchor (or base station) placement on optimal target node positioning. The optimal and worst anchor positions are determined through extended simulation by comparing their mean CRB. Furthermore the ramifications of an additive and multiplicative noise model on the mean CRB are explored. Finally, the least squares (LS) method for localization is used and its performance is compared with the lower bound for optimal anchor positions.","PeriodicalId":350979,"journal":{"name":"2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121614602","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 : 2011-06-12DOI: 10.1109/Med-Hoc-Net.2011.5970492
F. Mhiri, K. Sethom, R. Bouallègue, G. Pujolle
The femtocell concept is an emerging technology for deploying the next generation of the wireless networks, aiming at increasing capacity and offloading the overlay macrocell traffic. Energy costs account for as much as half of a mobile operator's operating expenses. Thus, finding radio networking solutions that can greatly improve energy-efficiency as well as resource-efficiency (Green Communications) is not only benefit for the global environment but also makes commercial sense for telecommunication operators supporting sustainable and profitable business. In this paper, we propose a green and distributed algorithm to dynamically optimize the coverage of a femtocell group by adjusting their transmitting power in an Administrative Domain. The resulting evolved algorithm shows the ability to optimize the coverage well, and consequently the resultant substantial energy consumption.
{"title":"A power management algorithm for green femtocell networks","authors":"F. Mhiri, K. Sethom, R. Bouallègue, G. Pujolle","doi":"10.1109/Med-Hoc-Net.2011.5970492","DOIUrl":"https://doi.org/10.1109/Med-Hoc-Net.2011.5970492","url":null,"abstract":"The femtocell concept is an emerging technology for deploying the next generation of the wireless networks, aiming at increasing capacity and offloading the overlay macrocell traffic. Energy costs account for as much as half of a mobile operator's operating expenses. Thus, finding radio networking solutions that can greatly improve energy-efficiency as well as resource-efficiency (Green Communications) is not only benefit for the global environment but also makes commercial sense for telecommunication operators supporting sustainable and profitable business. In this paper, we propose a green and distributed algorithm to dynamically optimize the coverage of a femtocell group by adjusting their transmitting power in an Administrative Domain. The resulting evolved algorithm shows the ability to optimize the coverage well, and consequently the resultant substantial energy consumption.","PeriodicalId":350979,"journal":{"name":"2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124914054","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 : 2011-06-12DOI: 10.1109/Med-Hoc-Net.2011.5970481
E. Borgia, M. Conti, A. Passarella
In this paper we focus on approaches which aim at discovering communities of people in Opportunistic Networks. We first study the behaviour of three community detection distributed algorithms proposed in literature [1], in a scenario where people move according to a mobility model which well reproduces the nature of human contacts, namely HCMM [2]. By a simulation analysis, we show that these distributed approaches can satisfactory detect the communities formed by people only when they do not significantly change over time. Otherwise, as they maintain memory of all encountered nodes forever, these algorithms fail to capture dynamic evolutions of the social communities users are part of. To this aim we propose ADSIMPLE, a new solution which captures the dynamic evolution of social communities. We demonstrate that it accurately detects communities and social changes while keeping computation and storage requirements low.
{"title":"Autonomic detection of dynamic social communities in Opportunistic Networks","authors":"E. Borgia, M. Conti, A. Passarella","doi":"10.1109/Med-Hoc-Net.2011.5970481","DOIUrl":"https://doi.org/10.1109/Med-Hoc-Net.2011.5970481","url":null,"abstract":"In this paper we focus on approaches which aim at discovering communities of people in Opportunistic Networks. We first study the behaviour of three community detection distributed algorithms proposed in literature [1], in a scenario where people move according to a mobility model which well reproduces the nature of human contacts, namely HCMM [2]. By a simulation analysis, we show that these distributed approaches can satisfactory detect the communities formed by people only when they do not significantly change over time. Otherwise, as they maintain memory of all encountered nodes forever, these algorithms fail to capture dynamic evolutions of the social communities users are part of. To this aim we propose ADSIMPLE, a new solution which captures the dynamic evolution of social communities. We demonstrate that it accurately detects communities and social changes while keeping computation and storage requirements low.","PeriodicalId":350979,"journal":{"name":"2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132707314","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 : 2011-06-12DOI: 10.1109/Med-Hoc-Net.2011.5970477
L. Giarré, Fabio G. La Rosa, R. Pesenti, I. Tinnirello
It is well known that CSMA/CA protocols exhibit very poor performance in case of multi-hop transmissions, because of inter-link interference due to imperfect carrier sensing. We propose to control such an interference by preallocating temporal slots in which different sets of network nodes are allowed to contend for the channel access. The approach is based on distributed coloring algorithms with limited signaling overhead that can be customized as a function of the network topology and traffic load.
{"title":"Coloring-based resource allocations in ad-hoc wireless networks","authors":"L. Giarré, Fabio G. La Rosa, R. Pesenti, I. Tinnirello","doi":"10.1109/Med-Hoc-Net.2011.5970477","DOIUrl":"https://doi.org/10.1109/Med-Hoc-Net.2011.5970477","url":null,"abstract":"It is well known that CSMA/CA protocols exhibit very poor performance in case of multi-hop transmissions, because of inter-link interference due to imperfect carrier sensing. We propose to control such an interference by preallocating temporal slots in which different sets of network nodes are allowed to contend for the channel access. The approach is based on distributed coloring algorithms with limited signaling overhead that can be customized as a function of the network topology and traffic load.","PeriodicalId":350979,"journal":{"name":"2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128003198","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 : 2011-06-12DOI: 10.1109/Med-Hoc-Net.2011.5970488
Efi Dror, C. Avin, Zvi Lotker
Vehicular Ad-Hoc Networks (VANETs) offer communication between vehicles and infrastructure. Warning messages, among others, can be used to alert drivers, and thus improve road safety. To adapt to the unique nature of VANETs, which demands the delivery of time sensitive messages to nearby vehicles, fast topology control and scheduling algorithms are required. A clustering approach, which was initially offered for Mobile Ad-Hoc Networks (MANETs), can be adapted to VANETs to solve this problem. In this paper we present Hierarchical Clustering Algorithm (HCA), a fast randomized clustering and scheduling algorithm. HCA creates hierarchical clusters with a diameter of at most four hops. Additionally, the algorithm handles channel access and schedules transmissions within the cluster to ensure reliable communication. Unlike other clustering algorithms for VANETs, HCA does not rely on localization systems which contributes to its robustness. The running time of the algorithm was analyzed analytically and HCA was evaluated by simulation. We compared our algorithm with 2-ConID, a clustering algorithm for MANETs, under several mobility scenarios. The simulation results confirm that the algorithm behaves well under realistic vehicle mobility patterns and outperforms 2-ConID in terms of cluster stability.
{"title":"Fast randomized algorithm for hierarchical clustering in Vehicular Ad-Hoc Networks","authors":"Efi Dror, C. Avin, Zvi Lotker","doi":"10.1109/Med-Hoc-Net.2011.5970488","DOIUrl":"https://doi.org/10.1109/Med-Hoc-Net.2011.5970488","url":null,"abstract":"Vehicular Ad-Hoc Networks (VANETs) offer communication between vehicles and infrastructure. Warning messages, among others, can be used to alert drivers, and thus improve road safety. To adapt to the unique nature of VANETs, which demands the delivery of time sensitive messages to nearby vehicles, fast topology control and scheduling algorithms are required. A clustering approach, which was initially offered for Mobile Ad-Hoc Networks (MANETs), can be adapted to VANETs to solve this problem. In this paper we present Hierarchical Clustering Algorithm (HCA), a fast randomized clustering and scheduling algorithm. HCA creates hierarchical clusters with a diameter of at most four hops. Additionally, the algorithm handles channel access and schedules transmissions within the cluster to ensure reliable communication. Unlike other clustering algorithms for VANETs, HCA does not rely on localization systems which contributes to its robustness. The running time of the algorithm was analyzed analytically and HCA was evaluated by simulation. We compared our algorithm with 2-ConID, a clustering algorithm for MANETs, under several mobility scenarios. The simulation results confirm that the algorithm behaves well under realistic vehicle mobility patterns and outperforms 2-ConID in terms of cluster stability.","PeriodicalId":350979,"journal":{"name":"2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130938280","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 : 2011-06-12DOI: 10.1109/Med-Hoc-Net.2011.5970498
M. Koegel, Daniel Baselt, M. Mauve, B. Scheuermann
The transmission of vehicular trajectory information is one basic building block of car-to-car communication. Frequently, this information is transmitted as raw data, i. e., as a sequence of location measurements. In this paper we argue that, due to the laws of physics and the requirement to follow a road, vehicular mobility has very specific characteristics. Hence, vehicular trajectory information can be compressed very efficiently using domain-specific lossy compression schemes. We discuss and compare three promising approaches that can be used to this end: linear approximation, cubic splines, and clothoids.
{"title":"A comparison of vehicular trajectory encoding techniques","authors":"M. Koegel, Daniel Baselt, M. Mauve, B. Scheuermann","doi":"10.1109/Med-Hoc-Net.2011.5970498","DOIUrl":"https://doi.org/10.1109/Med-Hoc-Net.2011.5970498","url":null,"abstract":"The transmission of vehicular trajectory information is one basic building block of car-to-car communication. Frequently, this information is transmitted as raw data, i. e., as a sequence of location measurements. In this paper we argue that, due to the laws of physics and the requirement to follow a road, vehicular mobility has very specific characteristics. Hence, vehicular trajectory information can be compressed very efficiently using domain-specific lossy compression schemes. We discuss and compare three promising approaches that can be used to this end: linear approximation, cubic splines, and clothoids.","PeriodicalId":350979,"journal":{"name":"2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114457631","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 : 2011-06-12DOI: 10.1109/Med-Hoc-Net.2011.5970483
Niko Pollner, Michael Daum, F. Dressler, K. Meyer-Wegener
This paper presents an approach for seamless integration of hosts in heterogeneous networks in the context of data-stream processing. The integration of multiple heterogeneous hosts from the sensor-node level up to the level of high-performance workstations is one of the most promising concepts for extensive and efficient analysis of streaming data. For controlling such a network, communication between hosts is needed, e.g., to initiate stream processing, to configure queries, and to transmit streams. One of the key challenges is global addressing and transparent yet efficient data exchange despite diverse, differently capable networks involved. For this purpose, we developed a cross-platform overlay network that enables transparent communication between autonomous stream-processing systems on different hosts in miscellaneous networks for both data streams and control commands. The system directly uses underlying native protocols within each network so that the most efficient communication method is applied. Furthermore, global addressing of instances of stream-processing systems and routing over the individual communication paths is provided.
{"title":"An overlay network for integration of WSNs in federated stream-processing environments","authors":"Niko Pollner, Michael Daum, F. Dressler, K. Meyer-Wegener","doi":"10.1109/Med-Hoc-Net.2011.5970483","DOIUrl":"https://doi.org/10.1109/Med-Hoc-Net.2011.5970483","url":null,"abstract":"This paper presents an approach for seamless integration of hosts in heterogeneous networks in the context of data-stream processing. The integration of multiple heterogeneous hosts from the sensor-node level up to the level of high-performance workstations is one of the most promising concepts for extensive and efficient analysis of streaming data. For controlling such a network, communication between hosts is needed, e.g., to initiate stream processing, to configure queries, and to transmit streams. One of the key challenges is global addressing and transparent yet efficient data exchange despite diverse, differently capable networks involved. For this purpose, we developed a cross-platform overlay network that enables transparent communication between autonomous stream-processing systems on different hosts in miscellaneous networks for both data streams and control commands. The system directly uses underlying native protocols within each network so that the most efficient communication method is applied. Furthermore, global addressing of instances of stream-processing systems and routing over the individual communication paths is provided.","PeriodicalId":350979,"journal":{"name":"2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124917644","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
扫码关注我们
求助内容：
应助结果提醒方式：