Pub Date : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534919
P. Cappanera, L. Lenzini, Alessandro Lori, G. Stea, G. Vaglini
In this paper we investigate link scheduling for Wireless Mesh Networks (WMNs) carrying real-time (i.e., delay-constrained) traffic. We show that the problem of computing a conflict-free link schedule with end-to-end delay constraints can be formulated as a mixed-integer non linear problem that can be optimally solved in reasonable time (i.e., minutes) for relatively large WMNs (up to 20–30 nodes). We use the above result to explore the schedulability region of a WMN with a given routing and input traffic, assessing whether and when aggregating flows which traverse the same path makes a given input flow set sched-ulable. Furthermore, we devise a heuristic solution strategy, which computes good suboptimal solutions within up to few seconds, thus being amenable for online admission control.
{"title":"Optimal link scheduling for real-time traffic in wireless mesh networks in both per-flow and per-path frameworks","authors":"P. Cappanera, L. Lenzini, Alessandro Lori, G. Stea, G. Vaglini","doi":"10.1109/WOWMOM.2010.5534919","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534919","url":null,"abstract":"In this paper we investigate link scheduling for Wireless Mesh Networks (WMNs) carrying real-time (i.e., delay-constrained) traffic. We show that the problem of computing a conflict-free link schedule with end-to-end delay constraints can be formulated as a mixed-integer non linear problem that can be optimally solved in reasonable time (i.e., minutes) for relatively large WMNs (up to 20–30 nodes). We use the above result to explore the schedulability region of a WMN with a given routing and input traffic, assessing whether and when aggregating flows which traverse the same path makes a given input flow set sched-ulable. Furthermore, we devise a heuristic solution strategy, which computes good suboptimal solutions within up to few seconds, thus being amenable for online admission control.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114436664","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-06-14DOI: 10.1109/WOWMOM.2010.5534897
Llorenç Cerdà-Alabern, A. Darehshoorzadeh, V. Pla
In recent years there has been a growing interest in Opportunistic Routing as a way to increase the capacity of wireless networks by exploiting its broadcast nature. By contrast to traditional uni-path routing, in opportunistic routing the nodes overhearing neighbor's transmissions can become candidates to forward the packets towards the destination. In this paper we address the question: What is the maximum performance that can be obtained using opportunistic routing? To answer this question we use an analytical model that allows to compute the optimal position of the nodes, such that the progress towards the destination is maximized. We use this model to compute bounds to the minimum expected number of transmissions that can be achieved in a network using opportunistic routing.
{"title":"On the maximum performance in opportunistic routing","authors":"Llorenç Cerdà-Alabern, A. Darehshoorzadeh, V. Pla","doi":"10.1109/WOWMOM.2010.5534897","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534897","url":null,"abstract":"In recent years there has been a growing interest in Opportunistic Routing as a way to increase the capacity of wireless networks by exploiting its broadcast nature. By contrast to traditional uni-path routing, in opportunistic routing the nodes overhearing neighbor's transmissions can become candidates to forward the packets towards the destination. In this paper we address the question: What is the maximum performance that can be obtained using opportunistic routing? To answer this question we use an analytical model that allows to compute the optimal position of the nodes, such that the progress towards the destination is maximized. We use this model to compute bounds to the minimum expected number of transmissions that can be achieved in a network using opportunistic routing.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127593147","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-06-14DOI: 10.1109/WOWMOM.2010.5534913
Elyes Ben Hamida, G. Chelius
In this paper, we are interested in evaluating the performance of indoor wireless networks in LOS and NLOS conditions. We first provide a thorough analysis of received signal strength indicator (RSSI) measurements obtained in indoor experiments. We aim to better understand the temporal and spatial correlations of RSSI values. Moreover, we analyze in detail the stability of radio links over time. We show that human activity has a significant impact on the performance of wireless networks and that RSSI is not always a robust indicator for the radio link quality. Based on our results, we then propose a time-varying simulation model to reproduce the RSSI variability as observed in our experiments. We argue that this model results in more realistic and accurate RSSI values to be used in simulation.
{"title":"Investigating the impact of human activity on the performance of wireless networks — An experimental approach","authors":"Elyes Ben Hamida, G. Chelius","doi":"10.1109/WOWMOM.2010.5534913","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534913","url":null,"abstract":"In this paper, we are interested in evaluating the performance of indoor wireless networks in LOS and NLOS conditions. We first provide a thorough analysis of received signal strength indicator (RSSI) measurements obtained in indoor experiments. We aim to better understand the temporal and spatial correlations of RSSI values. Moreover, we analyze in detail the stability of radio links over time. We show that human activity has a significant impact on the performance of wireless networks and that RSSI is not always a robust indicator for the radio link quality. Based on our results, we then propose a time-varying simulation model to reproduce the RSSI variability as observed in our experiments. We argue that this model results in more realistic and accurate RSSI values to be used in simulation.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126953656","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-06-14DOI: 10.1109/WOWMOM.2010.5535004
I. Hegazy, R. Safavi-Naini, C. Williamson
In a Wireless Sensor Network (WSN), the sensor nodes rely upon a multi-hop routing protocol to relay their data to the base station. However, most WSN routing protocols are vulnerable to attacks in which a malicious node can disrupt the routes, drop, modify, or divert data away from the base station. In this paper, we use the ns-2 network simulator to demonstrate the vulnerability of the MintRoute protocol to link quality attacks by a malicious node. We then propose a novel "sequence number gap trick" as a lightweight means to test for and detect the presence of a malicious attacker. The simulation results show that judicious use of the sequence number gap trick provides robust detection of malicious nodes, preserving the data delivery capabilities of the WSN.
{"title":"Towards securing mintroute in wireless sensor networks","authors":"I. Hegazy, R. Safavi-Naini, C. Williamson","doi":"10.1109/WOWMOM.2010.5535004","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5535004","url":null,"abstract":"In a Wireless Sensor Network (WSN), the sensor nodes rely upon a multi-hop routing protocol to relay their data to the base station. However, most WSN routing protocols are vulnerable to attacks in which a malicious node can disrupt the routes, drop, modify, or divert data away from the base station. In this paper, we use the ns-2 network simulator to demonstrate the vulnerability of the MintRoute protocol to link quality attacks by a malicious node. We then propose a novel \"sequence number gap trick\" as a lightweight means to test for and detect the presence of a malicious attacker. The simulation results show that judicious use of the sequence number gap trick provides robust detection of malicious nodes, preserving the data delivery capabilities of the WSN.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131459556","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-06-14DOI: 10.1109/WOWMOM.2010.5534909
M. Hassan, H. Vu, T. Sakurai
We develop an accurate analytical model for a dedicated short range communication (DSRC) network that uses the IEEE 802.11 distributed coordination function (DCF) MAC protocol, as adopted by the forthcoming IEEE 802.11p specification for DSRC. The specific focus is on broadcast vehicle-to-vehicle safety messages. We derive explicit expressions for the mean of the total packet delay and the packet delivery ratio (PDR) in an unsaturated network formed by moving vehicles on a highway. Our model is validated using extensive simulations and we show that our model yields better predictive accuracy than other existing models. The model is then used to investigate the performance of a modified DCF that uses a fixed number of sequential retransmissions to improve the reliability of packet delivery. We find that with sequential retransmissions, the PDR improves at low vehicle density (i.e. low traffic load), but degrades at heavy loads where higher collisions induced by the retransmissions outweighs the benefit of repeated attempts.
{"title":"Performance analysis of the IEEE 802.11 MAC protocol for DSRC with and without Retransmissions","authors":"M. Hassan, H. Vu, T. Sakurai","doi":"10.1109/WOWMOM.2010.5534909","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534909","url":null,"abstract":"We develop an accurate analytical model for a dedicated short range communication (DSRC) network that uses the IEEE 802.11 distributed coordination function (DCF) MAC protocol, as adopted by the forthcoming IEEE 802.11p specification for DSRC. The specific focus is on broadcast vehicle-to-vehicle safety messages. We derive explicit expressions for the mean of the total packet delay and the packet delivery ratio (PDR) in an unsaturated network formed by moving vehicles on a highway. Our model is validated using extensive simulations and we show that our model yields better predictive accuracy than other existing models. The model is then used to investigate the performance of a modified DCF that uses a fixed number of sequential retransmissions to improve the reliability of packet delivery. We find that with sequential retransmissions, the PDR improves at low vehicle density (i.e. low traffic load), but degrades at heavy loads where higher collisions induced by the retransmissions outweighs the benefit of repeated attempts.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129913924","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-06-14DOI: 10.1109/WOWMOM.2010.5534947
S. I. Hussain, Mohamed-Slim Alouini, M. Hasna
The cooperative relaying process needs proper coordination among the communicating and the relaying nodes. This coordination and the required capabilities may not be available in some wireless systems, e.g. wireless sensor networks where the nodes are equipped with very basic communication hardware. In this paper, we consider a scenario where the source node transmits its signal to the destination through multiple relays in an uncoordinated fashion. The destination can capture the multiple copies of the transmitted signal through a Rake receiver. We analyze a situation where the number of Rake fingers N is less than that of the relaying nodes L. In this case, the receiver can combine N strongest signals out of L. The remaining signals will be lost and act as interference to the desired signal components. To tackle this problem, we develop a novel signal combining technique based on channel shortening. This technique proposes a processing block before the Rake reception which compresses the energy of L signal components over N branches while keeping the noise level at its minimum. The proposed scheme saves the system resources and makes the received signal compatible to the available hardware. Simulation results show that it outperforms the selection combining scheme.
{"title":"A signal combining technique based on channel shortening for cooperative sensor networks","authors":"S. I. Hussain, Mohamed-Slim Alouini, M. Hasna","doi":"10.1109/WOWMOM.2010.5534947","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534947","url":null,"abstract":"The cooperative relaying process needs proper coordination among the communicating and the relaying nodes. This coordination and the required capabilities may not be available in some wireless systems, e.g. wireless sensor networks where the nodes are equipped with very basic communication hardware. In this paper, we consider a scenario where the source node transmits its signal to the destination through multiple relays in an uncoordinated fashion. The destination can capture the multiple copies of the transmitted signal through a Rake receiver. We analyze a situation where the number of Rake fingers N is less than that of the relaying nodes L. In this case, the receiver can combine N strongest signals out of L. The remaining signals will be lost and act as interference to the desired signal components. To tackle this problem, we develop a novel signal combining technique based on channel shortening. This technique proposes a processing block before the Rake reception which compresses the energy of L signal components over N branches while keeping the noise level at its minimum. The proposed scheme saves the system resources and makes the received signal compatible to the available hardware. Simulation results show that it outperforms the selection combining scheme.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131074094","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-06-14DOI: 10.1109/WOWMOM.2010.5535005
Reza Curtmola, Jing Dong, C. Nita-Rotaru
In the context of wireless mesh networks (WMNs), we ask the question whether a high level of security can be achieved while providing good communication performance. To answer this question, we examine two techniques designed and shown to improve throughput performance in WMNs: high-throughput routing and network coding. Although the advantages of using these techniques hold in a benign setting, it is not clear whether they can be preserved under an adversarial setting. We analyze these techniques and reveal a wide range of security vulnerabilities. We then investigate whether alternative schemes can be designed to be secure and still preserve most of the advantages achieved in benign settings.
{"title":"Tradeoffs between security and communication performance in wireless mesh networks","authors":"Reza Curtmola, Jing Dong, C. Nita-Rotaru","doi":"10.1109/WOWMOM.2010.5535005","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5535005","url":null,"abstract":"In the context of wireless mesh networks (WMNs), we ask the question whether a high level of security can be achieved while providing good communication performance. To answer this question, we examine two techniques designed and shown to improve throughput performance in WMNs: high-throughput routing and network coding. Although the advantages of using these techniques hold in a benign setting, it is not clear whether they can be preserved under an adversarial setting. We analyze these techniques and reveal a wide range of security vulnerabilities. We then investigate whether alternative schemes can be designed to be secure and still preserve most of the advantages achieved in benign settings.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132658320","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-06-14DOI: 10.1109/WOWMOM.2010.5534905
Afzal Mawji, H. Hassanein
P2P applications are enormously popular on the Internet and their uses vary from file sharing to Voice-over-IP to gaming and more. Increasingly, users are moving toward wireless networked devices and wish to continue using P2P applications in these new environments. MANETs are expected to grow in use as wireless mesh and 4G networks increase in popularity. P2P and MANETs share some similarities, such as self-organization, dynamism, and resilience to failure, but it is necessary that P2P algorithms should take advantage of the realities of MANETs. In P2P networks, the overlay peers must form a topology of connections between themselves and this topology should reflect the underlying network in order to reduce delay and energy consumption. We study the results of a game-theoretic topology control algorithm which considers energy and distance between nodes in a P2P network running atop a MANET. We find that the minimum cost topologies are very highly connected and thus resilient, but in most cases the topologies do not stabilize even without peer mobility or churn.
{"title":"P2P overlay topology control in MANETs","authors":"Afzal Mawji, H. Hassanein","doi":"10.1109/WOWMOM.2010.5534905","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534905","url":null,"abstract":"P2P applications are enormously popular on the Internet and their uses vary from file sharing to Voice-over-IP to gaming and more. Increasingly, users are moving toward wireless networked devices and wish to continue using P2P applications in these new environments. MANETs are expected to grow in use as wireless mesh and 4G networks increase in popularity. P2P and MANETs share some similarities, such as self-organization, dynamism, and resilience to failure, but it is necessary that P2P algorithms should take advantage of the realities of MANETs. In P2P networks, the overlay peers must form a topology of connections between themselves and this topology should reflect the underlying network in order to reduce delay and energy consumption. We study the results of a game-theoretic topology control algorithm which considers energy and distance between nodes in a P2P network running atop a MANET. We find that the minimum cost topologies are very highly connected and thus resilient, but in most cases the topologies do not stabilize even without peer mobility or churn.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133809500","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-06-14DOI: 10.1109/WOWMOM.2010.5534943
Tonio Triebel, S. Schnaufer, W. Effelsberg
We propose a global system for acquisition, maintenance and communication of achievements in the real-world. The main focus of the proposal lies on a context-aware notification service for achievements. Users of the system can browse the achievement web application and will only get notifications of users within the same context. The definition of context is based on the network infrastructure of the client accessing the system. Our server utilizes information derived from IP-routing traces to build the notification groups.
{"title":"Achievement notification in a real-world achievement system","authors":"Tonio Triebel, S. Schnaufer, W. Effelsberg","doi":"10.1109/WOWMOM.2010.5534943","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534943","url":null,"abstract":"We propose a global system for acquisition, maintenance and communication of achievements in the real-world. The main focus of the proposal lies on a context-aware notification service for achievements. Users of the system can browse the achievement web application and will only get notifications of users within the same context. The definition of context is based on the network infrastructure of the client accessing the system. Our server utilizes information derived from IP-routing traces to build the notification groups.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"645 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134065121","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-06-14DOI: 10.1109/WOWMOM.2010.5534948
Jingzhe Du, E. Kranakis, A. Nayak
We describe a novel Distributed Storage protocol in Disruption (Delay) Tolerant Networks (DTN). Since DTNs can not guarantee the connectivity of the network all the time, distributed data storage and look up has to be performed in a store-and-forward way. In this work, we define local distributed location regions which are called cells to facilitate the data storage and look up process. Nodes in a cell have high probability of moving within their cells. Our protocol resorts to storing data items in cells which have hierarchical structure to reduce routing information storage at nodes. Multiple copies of a data item may be stored at nodes to counter the adverse impact of the nature of DTNs. The cells are relatively stable regions and as a result, data exchange overheads among nodes are reduced. Through experimentation, we show that the proposed distributed storage protocol achieves higher successful data storage ratios with lower delays and limited data item exchange requirements than other protocols in the literature.
{"title":"Distributed storage in Disruption Tolerant Network","authors":"Jingzhe Du, E. Kranakis, A. Nayak","doi":"10.1109/WOWMOM.2010.5534948","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534948","url":null,"abstract":"We describe a novel Distributed Storage protocol in Disruption (Delay) Tolerant Networks (DTN). Since DTNs can not guarantee the connectivity of the network all the time, distributed data storage and look up has to be performed in a store-and-forward way. In this work, we define local distributed location regions which are called cells to facilitate the data storage and look up process. Nodes in a cell have high probability of moving within their cells. Our protocol resorts to storing data items in cells which have hierarchical structure to reduce routing information storage at nodes. Multiple copies of a data item may be stored at nodes to counter the adverse impact of the nature of DTNs. The cells are relatively stable regions and as a result, data exchange overheads among nodes are reduced. Through experimentation, we show that the proposed distributed storage protocol achieves higher successful data storage ratios with lower delays and limited data item exchange requirements than other protocols in the literature.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133367190","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
扫码关注我们
求助内容：
应助结果提醒方式：