Pub Date : 1900-01-01DOI: 10.1109/WIMESH.2006.288609
H. Mohri, R. Matsumoto, Y. Kaji
This study investigates new schemes for distributing cryptographic keys in sensor networks. Sharing a key is the very first step to realize secure communication over an untrusted network infrastructure, but commonly used cryptographic techniques cannot be employed for sensor networks due to the restriction of computational resources of sensor nodes. A practical solution to this issue is to predistribute cryptographic keys in sensor nodes before they are deployed. A focal point in this solution is the choice of keys which are assigned to a sensor node. Eschenauer et al. considered to choose keys randomly, and Chan et al. also followed the random choice approach. We consider in this paper a new approach, in which keys are assigned according to a basic algebraic geometry. The performance of the proposed scheme is investigated analytically.
{"title":"Key predistribution schemes for sensor networks using lines,points over a finite geometry","authors":"H. Mohri, R. Matsumoto, Y. Kaji","doi":"10.1109/WIMESH.2006.288609","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288609","url":null,"abstract":"This study investigates new schemes for distributing cryptographic keys in sensor networks. Sharing a key is the very first step to realize secure communication over an untrusted network infrastructure, but commonly used cryptographic techniques cannot be employed for sensor networks due to the restriction of computational resources of sensor nodes. A practical solution to this issue is to predistribute cryptographic keys in sensor nodes before they are deployed. A focal point in this solution is the choice of keys which are assigned to a sensor node. Eschenauer et al. considered to choose keys randomly, and Chan et al. also followed the random choice approach. We consider in this paper a new approach, in which keys are assigned according to a basic algebraic geometry. The performance of the proposed scheme is investigated analytically.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127016974","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288625
Erich P. Stuntebeck, Dario Pompili
The concept of a wireless underground sensor network (WUSN) is introduced and applications are discussed. The feasibility of utilizing commonly available terrestrial wireless sensor network (WSN) hardware solutions in the underground environment is examined. Experiments are run to examine the packet error rate and the received signal strength of correctly received packets for a communication link between two underground sensors and between an underground sensor and an aboveground sensor.
{"title":"Wireless underground sensor networks using commodity terrestrial motes","authors":"Erich P. Stuntebeck, Dario Pompili","doi":"10.1109/WIMESH.2006.288625","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288625","url":null,"abstract":"The concept of a wireless underground sensor network (WUSN) is introduced and applications are discussed. The feasibility of utilizing commonly available terrestrial wireless sensor network (WSN) hardware solutions in the underground environment is examined. Experiments are run to examine the packet error rate and the received signal strength of correctly received packets for a communication link between two underground sensors and between an underground sensor and an aboveground sensor.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131052209","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288632
K. Malasri, Lan Wang
We identify the security threats facing a sensor network for wireless medical monitoring, and we propose a public-key architecture using elliptic curve cryptography to address these issues. We also present a preliminary protocol for securely establishing pairwise symmetric keys between a sensor and a base station using ECC. To evaluate our protocol, we are working on an implementation of ECC for the Moteiv Tmote Sky platform. Our initial release performs competitively with existing implementations for the Crossbow MICA.
{"title":"SNAP: an architecture for secure medical sensor networks","authors":"K. Malasri, Lan Wang","doi":"10.1109/WIMESH.2006.288632","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288632","url":null,"abstract":"We identify the security threats facing a sensor network for wireless medical monitoring, and we propose a public-key architecture using elliptic curve cryptography to address these issues. We also present a preliminary protocol for securely establishing pairwise symmetric keys between a sensor and a base station using ECC. To evaluate our protocol, we are working on an implementation of ECC for the Moteiv Tmote Sky platform. Our initial release performs competitively with existing implementations for the Crossbow MICA.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125594580","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288630
Matthew Holland, Ryan G. Aures, W. Heinzelman
Testing of the range and radiation pattern of wireless sensors is often not fully documented. In this paper, we perform a full characterization of the Tmote Sky motes from MoteIV Corporation. Packet yield, RSSI, and LQI are measured as a function of distance, angle, and transmit power, while taking environmental conditions into consideration. Wireless sensors have a very limited energy source, and the ability to make nodes last as long as possible can be greatly affected by their placement in the network. We aim to present a set of guidelines for setting up Wireless Sensor Networks that will enable them to achieve their QoS goals and maximum lifetime. Our results show that the radio antenna pattern on the Tmote Sky devices is not truly omnidirectional. RSSI does appear to degrade as an exponential function of distance, and LQI appears to be a very reliable indication of packet yield. The most significant result we have found is that transmitting and receiving node heights have a major impact on link performance. We have also found that under any circumstance, it is difficult to support data rates higher than 30 kbps with the current radio stack in TinyOS 1.x. Experimental data is analyzed and the importance of these results is discussed in depth.
{"title":"Experimental investigation of radio performance in wireless sensor networks","authors":"Matthew Holland, Ryan G. Aures, W. Heinzelman","doi":"10.1109/WIMESH.2006.288630","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288630","url":null,"abstract":"Testing of the range and radiation pattern of wireless sensors is often not fully documented. In this paper, we perform a full characterization of the Tmote Sky motes from MoteIV Corporation. Packet yield, RSSI, and LQI are measured as a function of distance, angle, and transmit power, while taking environmental conditions into consideration. Wireless sensors have a very limited energy source, and the ability to make nodes last as long as possible can be greatly affected by their placement in the network. We aim to present a set of guidelines for setting up Wireless Sensor Networks that will enable them to achieve their QoS goals and maximum lifetime. Our results show that the radio antenna pattern on the Tmote Sky devices is not truly omnidirectional. RSSI does appear to degrade as an exponential function of distance, and LQI appears to be a very reliable indication of packet yield. The most significant result we have found is that transmitting and receiving node heights have a major impact on link performance. We have also found that under any circumstance, it is difficult to support data rates higher than 30 kbps with the current radio stack in TinyOS 1.x. Experimental data is analyzed and the importance of these results is discussed in depth.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116984712","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288602
Eric Rozner, Jayesh Seshadri, Yogita Mehta, L. Qiu
Multihop wireless mesh networks are becoming a new attractive communication paradigm. Many cities and public places have deployed or are planning to deploy mesh networks to provide Internet access to residents and local businesses. Routing protocol design is critical to the performance and reliability of wireless mesh networks. Traditional routing protocols send traffic along pre-determined paths and have been shown ineffective in coping with unreliable and unpredictable wireless medium. In this paper, we develop a simple opportunistic adaptive routing protocol (SOAR) for wireless mesh networks. SOAR maximizes the progress each packet makes by using priority-based timers to ensure that the most preferred node forwards the packet with little coordination overhead. Moreover, SOAR minimizes resource consumption and duplicate transmissions by judiciously selecting forwarding nodes to prevent routes from diverging. To further protect against packet losses, SOAR uses local recovery to retransmit a packet when an ACK is not received within a specified time. SOAR uses a combination of selective ACKs, piggyback ACKs, and ACK compression to protect against ACK loss while minimizing ACK overhead. We evaluate SOAR using NS-2 simulations. Our preliminary results show that SOAR is promising to achieve high efficiency and effectively support multiple simultaneous flows.
{"title":"Simple opportunistic routing protocol for wireless mesh networks","authors":"Eric Rozner, Jayesh Seshadri, Yogita Mehta, L. Qiu","doi":"10.1109/WIMESH.2006.288602","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288602","url":null,"abstract":"Multihop wireless mesh networks are becoming a new attractive communication paradigm. Many cities and public places have deployed or are planning to deploy mesh networks to provide Internet access to residents and local businesses. Routing protocol design is critical to the performance and reliability of wireless mesh networks. Traditional routing protocols send traffic along pre-determined paths and have been shown ineffective in coping with unreliable and unpredictable wireless medium. In this paper, we develop a simple opportunistic adaptive routing protocol (SOAR) for wireless mesh networks. SOAR maximizes the progress each packet makes by using priority-based timers to ensure that the most preferred node forwards the packet with little coordination overhead. Moreover, SOAR minimizes resource consumption and duplicate transmissions by judiciously selecting forwarding nodes to prevent routes from diverging. To further protect against packet losses, SOAR uses local recovery to retransmit a packet when an ACK is not received within a specified time. SOAR uses a combination of selective ACKs, piggyback ACKs, and ACK compression to protect against ACK loss while minimizing ACK overhead. We evaluate SOAR using NS-2 simulations. Our preliminary results show that SOAR is promising to achieve high efficiency and effectively support multiple simultaneous flows.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115859082","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288601
Dheeraj Agrawal, Arunesh Mishra, K. Springborn, Suman Banerjee, Samnrat Ganguly
Most wireless meshes will have to operate within the crowded unlicensed spectrum that is also shared by numerous uncoordinated 802.11 hotspots. This creates an unpredictable and variable spectrum space that mesh networks need to co-exist within. We propose a novel method for adapting to such external interference by dynamically changing the assignment of channels to the backbone links, yet retaining the same "logical" network-wide channel assignment. Called Connected- component based Adaption, this method ensures two important properties, (i) Allows distributed changes to the channels used by backbone links depending on local interference, and (ii) Allows a centralized algorithm to dictate the high-level channel and route assignments used by the network as a whole. We propose MeshChop as a randomized algorithm that uses channel hopping to achieve connected-component based adaptation. We show that MeshChop has minimal overheads and provides good link quality and throughput through dynamic adaptation. We present preliminary experimental results which show that MeshChop can achieve almost 80% improvement in throughput over non-adaptive schemes. We believe that component based adaptation using channel hopping is the right method to adapt to local interference conditions without causing network-wide changes.
{"title":"Dynamic interference adaptation for wireless mesh networks","authors":"Dheeraj Agrawal, Arunesh Mishra, K. Springborn, Suman Banerjee, Samnrat Ganguly","doi":"10.1109/WIMESH.2006.288601","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288601","url":null,"abstract":"Most wireless meshes will have to operate within the crowded unlicensed spectrum that is also shared by numerous uncoordinated 802.11 hotspots. This creates an unpredictable and variable spectrum space that mesh networks need to co-exist within. We propose a novel method for adapting to such external interference by dynamically changing the assignment of channels to the backbone links, yet retaining the same \"logical\" network-wide channel assignment. Called Connected- component based Adaption, this method ensures two important properties, (i) Allows distributed changes to the channels used by backbone links depending on local interference, and (ii) Allows a centralized algorithm to dictate the high-level channel and route assignments used by the network as a whole. We propose MeshChop as a randomized algorithm that uses channel hopping to achieve connected-component based adaptation. We show that MeshChop has minimal overheads and provides good link quality and throughput through dynamic adaptation. We present preliminary experimental results which show that MeshChop can achieve almost 80% improvement in throughput over non-adaptive schemes. We believe that component based adaptation using channel hopping is the right method to adapt to local interference conditions without causing network-wide changes.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"47 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131776074","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288629
Erik-Oliver Blass, J. Wilke, M. Zitterbart
To reduce energy consumption, aggregation takes place in a wireless sensor network. All measured data is collected and preprocessed multiple times on its way towards a data sink, e.g., a base station. However, aggregation implies new challenges to security: as the sink Anally receives aggregated data, it is difficult to verify not only the aggregate's correctness, but also the origin of the data the aggregate was computed from. In the presence of an attacker in the network, data transmissions and aggregation could have maliciously been modified. Yet, it turns out that in-network aggregation and data authenticity are contradictory communication properties. This research examines the possibility of finding a trade-off between security (authenticity) and energy-savings (aggregation). If the user is willing to accept data's authenticity with ples100% probability, he can still save large amounts of energy compared to authentic communication without aggregation.
{"title":"A security-energy trade-off for authentic aggregation in sensor networks","authors":"Erik-Oliver Blass, J. Wilke, M. Zitterbart","doi":"10.1109/WIMESH.2006.288629","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288629","url":null,"abstract":"To reduce energy consumption, aggregation takes place in a wireless sensor network. All measured data is collected and preprocessed multiple times on its way towards a data sink, e.g., a base station. However, aggregation implies new challenges to security: as the sink Anally receives aggregated data, it is difficult to verify not only the aggregate's correctness, but also the origin of the data the aggregate was computed from. In the presence of an attacker in the network, data transmissions and aggregation could have maliciously been modified. Yet, it turns out that in-network aggregation and data authenticity are contradictory communication properties. This research examines the possibility of finding a trade-off between security (authenticity) and energy-savings (aggregation). If the user is willing to accept data's authenticity with ples100% probability, he can still save large amounts of energy compared to authentic communication without aggregation.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115121254","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288600
Xue Yang, N. Vaidya
Traditional medium access control (MAC) protocols utilize temporal mechanisms such as access probability or backoff interval adaptation for contention resolution. They typically take the set of competing nodes as a given, and address the problem of adapting each node's channel access behavior to the given channel contention level. This is a temporal approach for contention resolution, which aims to separate transmissions from different nodes in time to achieve successful transmissions. We explore an alternative approach for wireless networks-named "spatial backoff-that adapts the "space" occupied by the transmissions. Each transmission in a wireless network competes for a certain space. By adapting the space occupied by transmissions, the set of "locally" competing nodes, and thus, the channel contention level, can be adjusted to reach a suitable level. There are different ways to realize spatial backoff. In this paper, we propose a dynamic spatial backoff algorithm using the joint control of carrier sense threshold and transmission rate. Our results suggest that spatial backoff can lead to a substantial gain in channel utilization.
{"title":"Spatial backoff contention resolution for wireless networks","authors":"Xue Yang, N. Vaidya","doi":"10.1109/WIMESH.2006.288600","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288600","url":null,"abstract":"Traditional medium access control (MAC) protocols utilize temporal mechanisms such as access probability or backoff interval adaptation for contention resolution. They typically take the set of competing nodes as a given, and address the problem of adapting each node's channel access behavior to the given channel contention level. This is a temporal approach for contention resolution, which aims to separate transmissions from different nodes in time to achieve successful transmissions. We explore an alternative approach for wireless networks-named \"spatial backoff-that adapts the \"space\" occupied by the transmissions. Each transmission in a wireless network competes for a certain space. By adapting the space occupied by transmissions, the set of \"locally\" competing nodes, and thus, the channel contention level, can be adjusted to reach a suitable level. There are different ways to realize spatial backoff. In this paper, we propose a dynamic spatial backoff algorithm using the joint control of carrier sense threshold and transmission rate. Our results suggest that spatial backoff can lead to a substantial gain in channel utilization.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114738450","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288633
Yang Min, Yu Bo, Han Peng, Mao Dilin, Gao Chuanshan
Recent advance in Wireless Sensor Network (WSN) has led to totally different applications which attract a lot of attention. As addressed in [8], how to energy-efficient routing data packets to multi-sinks is a big challenge in WSN. While distributed multicasting technology is the most likely way to cope with this problem in nature due to the special characteristics of WSN. In this paper, we present a optimized distributed multicast routing protocol schema based on our former work DMRPS , termed oDMRPS, to dynamically build and maintain a multicast routing trees between sources and sinks. The primary simulation result shows that it performs much better than DMRPS, especially for numbers of grouped sinks with high density.
{"title":"A optimized distributed multicast routing protocol for wireless sensor network","authors":"Yang Min, Yu Bo, Han Peng, Mao Dilin, Gao Chuanshan","doi":"10.1109/WIMESH.2006.288633","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288633","url":null,"abstract":"Recent advance in Wireless Sensor Network (WSN) has led to totally different applications which attract a lot of attention. As addressed in [8], how to energy-efficient routing data packets to multi-sinks is a big challenge in WSN. While distributed multicasting technology is the most likely way to cope with this problem in nature due to the special characteristics of WSN. In this paper, we present a optimized distributed multicast routing protocol schema based on our former work DMRPS , termed oDMRPS, to dynamically build and maintain a multicast routing trees between sources and sinks. The primary simulation result shows that it performs much better than DMRPS, especially for numbers of grouped sinks with high density.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115857026","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 : 1900-01-01DOI: 10.1109/WIMESH.2006.288627
N. Perova, W. H. Johnson, P. Hogan
Wireless communication devices can be successfully applied as a powerful educational tool for teaching physics concepts to science major students through an engineering design approach. In this paper we will analyze the effects of work on a wireless sensor communication project on students' interest and involvement in the learning process and understanding of the related concepts they study in the core science and engineering courses.
{"title":"Work on multi-channel gas analyzer with wireless data transmission as an educational tool for learning science concepts","authors":"N. Perova, W. H. Johnson, P. Hogan","doi":"10.1109/WIMESH.2006.288627","DOIUrl":"https://doi.org/10.1109/WIMESH.2006.288627","url":null,"abstract":"Wireless communication devices can be successfully applied as a powerful educational tool for teaching physics concepts to science major students through an engineering design approach. In this paper we will analyze the effects of work on a wireless sensor communication project on students' interest and involvement in the learning process and understanding of the related concepts they study in the core science and engineering courses.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128898182","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
扫码关注我们
求助内容：
应助结果提醒方式：