Pub Date : 2006-07-17DOI: 10.1109/MOBIQW.2006.361775
Shiow-Fen Hwang, Yi-Yu Su, Yi-Yo Lin, C. Dow
Wireless sensor networks consist of a large number of low-power, small-scale sensors with limited processing and communication capabilities. Such networks are usually applied to gather data from interested area or specific environment and deliver to remote users for analyzing or monitoring. Because of sensing devices are usually powered by batteries, it is a great challenge to meet the performance of long system lifetime required by different applications under limited power. In the densely deployed sensor networks, the area or data sensed by neighboring sensors may overlap. In recent researches, coverage preserved node scheduling has been proposed to conserve power and provide sensing reliability. By selecting appropriate sensors into sleep state, the system lifetime can be extended without losing coverage. In this paper, we propose a duster-based coverage-preserved node scheduling scheme. We divide sensors into clusters and group cluster members into sponsor sets based on neighbor information. The proposed approach distributes the workloads among sponsor set nodes and ensures sufficient coverage as long as possible
{"title":"A Cluster-Based Coverage-Preserved Node Scheduling Scheme in Wireless Sensor Networks","authors":"Shiow-Fen Hwang, Yi-Yu Su, Yi-Yo Lin, C. Dow","doi":"10.1109/MOBIQW.2006.361775","DOIUrl":"https://doi.org/10.1109/MOBIQW.2006.361775","url":null,"abstract":"Wireless sensor networks consist of a large number of low-power, small-scale sensors with limited processing and communication capabilities. Such networks are usually applied to gather data from interested area or specific environment and deliver to remote users for analyzing or monitoring. Because of sensing devices are usually powered by batteries, it is a great challenge to meet the performance of long system lifetime required by different applications under limited power. In the densely deployed sensor networks, the area or data sensed by neighboring sensors may overlap. In recent researches, coverage preserved node scheduling has been proposed to conserve power and provide sensing reliability. By selecting appropriate sensors into sleep state, the system lifetime can be extended without losing coverage. In this paper, we propose a duster-based coverage-preserved node scheduling scheme. We divide sensors into clusters and group cluster members into sponsor sets based on neighbor information. The proposed approach distributes the workloads among sponsor set nodes and ensures sufficient coverage as long as possible","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125687578","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 : 2006-07-17DOI: 10.1109/MOBIQW.2006.361725
J. Buford, B. Burg, E. Celebi, P. Frankl
The design of service discovery protocols which limit power consumption of devices has received little consideration but is an important problem because of the growing use of power-limited mobile networked devices. We describe Sleeper, a new discovery protocol which uses proxied advertisement and discovery to dynamically offload service discovery workload from power-limited devices. The advertisement structure supports several modes of service discovery including conventional service advertisements, meta discovery, taxonomic-based discovery, location-based discovery and federated discovery. In addition, Sleeper supports both push and pull modes of advertisement, but unlike other protocols uses service popularity to select push or pull modality. We describe an implementation of the new protocol and provide an analytical model for comparing response time to other push-based service discovery methods
{"title":"Sleeper: A Power-Conserving Service Discovery Protocol","authors":"J. Buford, B. Burg, E. Celebi, P. Frankl","doi":"10.1109/MOBIQW.2006.361725","DOIUrl":"https://doi.org/10.1109/MOBIQW.2006.361725","url":null,"abstract":"The design of service discovery protocols which limit power consumption of devices has received little consideration but is an important problem because of the growing use of power-limited mobile networked devices. We describe Sleeper, a new discovery protocol which uses proxied advertisement and discovery to dynamically offload service discovery workload from power-limited devices. The advertisement structure supports several modes of service discovery including conventional service advertisements, meta discovery, taxonomic-based discovery, location-based discovery and federated discovery. In addition, Sleeper supports both push and pull modes of advertisement, but unlike other protocols uses service popularity to select push or pull modality. We describe an implementation of the new protocol and provide an analytical model for comparing response time to other push-based service discovery methods","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126827470","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 : 2006-07-17DOI: 10.1109/MOBIQ.2006.340406
Zhaomin Mo, Hao Zhu, K. Makki, N. Pissinou
Vehicular ad hoc networks (VANETs) are going to be an important communication infrastructure in our life. Because of high mobility and frequent link disconnection, it becomes quite challenging to establish a robust multi-hop path that helps packet delivery from the source to the destination. This paper presents a multi-hop routing protocol, called MURU that is able to find robust paths in urban VANETs to achieve high end-to-end packet delivery ratio with low overhead. MURU tries to minimize the probability of path breakage by exploiting mobility information of each vehicle in VANETs. A new metric called expected disconnection degree (EDD) is used to select the most robust path from the source to the destination. MURU is fully distributed and does not incur much overhead, which makes MURU highly scalable for VANETs. The design is sufficiently justified through theoretical analysis and the protocol is evaluated with extensive simulations. Simulation results demonstrate that MURU significantly outperforms existing ad hoc routing protocols in terms of packet delivery ratio, packet delay and control overhead
{"title":"MURU: A Multi-Hop Routing Protocol for Urban Vehicular Ad Hoc Networks","authors":"Zhaomin Mo, Hao Zhu, K. Makki, N. Pissinou","doi":"10.1109/MOBIQ.2006.340406","DOIUrl":"https://doi.org/10.1109/MOBIQ.2006.340406","url":null,"abstract":"Vehicular ad hoc networks (VANETs) are going to be an important communication infrastructure in our life. Because of high mobility and frequent link disconnection, it becomes quite challenging to establish a robust multi-hop path that helps packet delivery from the source to the destination. This paper presents a multi-hop routing protocol, called MURU that is able to find robust paths in urban VANETs to achieve high end-to-end packet delivery ratio with low overhead. MURU tries to minimize the probability of path breakage by exploiting mobility information of each vehicle in VANETs. A new metric called expected disconnection degree (EDD) is used to select the most robust path from the source to the destination. MURU is fully distributed and does not incur much overhead, which makes MURU highly scalable for VANETs. The design is sufficiently justified through theoretical analysis and the protocol is evaluated with extensive simulations. Simulation results demonstrate that MURU significantly outperforms existing ad hoc routing protocols in terms of packet delivery ratio, packet delay and control overhead","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122341805","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 : 2006-07-17DOI: 10.1109/MOBIQW.2006.361785
A. Ordine, Julian F. Gutierrez, L. Veltri
Deployment of 802.11 wireless LANs is increasingly on the rise leading to new service scenarios in which users are connected everywhere-everytime. However the IEEE 802.11 standard was designed for short range wireless data transmissions and does not natively provide any support for roaming amongst different access networks. In the more general case, a mobile user should be expected to be able to roam into a visited domain and gain access to the network on the basis of some credentials shared with his home domain or WISP. There are several mechanisms that can be involved in providing such access control and roaming functionality but no any standard has overcome. In this paper a new SIP based solution is proposed. SIP-based authentication is provided end-to-end between user-to-network and network-to-network. The proposed solution realizes full proxy-to-proxy authentication at SIP level, enabling dynamic and secure WISP-to-WISP interworking. The proposed solution has been also implemented and successfully tested in a demonstrating testbed
{"title":"SIP roaming solution amongst different WLAN-based service providers","authors":"A. Ordine, Julian F. Gutierrez, L. Veltri","doi":"10.1109/MOBIQW.2006.361785","DOIUrl":"https://doi.org/10.1109/MOBIQW.2006.361785","url":null,"abstract":"Deployment of 802.11 wireless LANs is increasingly on the rise leading to new service scenarios in which users are connected everywhere-everytime. However the IEEE 802.11 standard was designed for short range wireless data transmissions and does not natively provide any support for roaming amongst different access networks. In the more general case, a mobile user should be expected to be able to roam into a visited domain and gain access to the network on the basis of some credentials shared with his home domain or WISP. There are several mechanisms that can be involved in providing such access control and roaming functionality but no any standard has overcome. In this paper a new SIP based solution is proposed. SIP-based authentication is provided end-to-end between user-to-network and network-to-network. The proposed solution realizes full proxy-to-proxy authentication at SIP level, enabling dynamic and secure WISP-to-WISP interworking. The proposed solution has been also implemented and successfully tested in a demonstrating testbed","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125761196","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 : 2006-07-17DOI: 10.1109/MOBIQW.2006.361717
Y. Yanagisawa, H. Kido, T. Satoh
In this paper, we introduce location traceability as an indicator for evaluating time-series location privacy for users on location-based services (LBS). The location traceability of a user is calculated with a formalized tree structure that represents all possible paths of a moving user. Through the results of the simulation experiments, we validated the effectiveness of this proposed indicator
{"title":"Location Privacy of Users in Location-based Services","authors":"Y. Yanagisawa, H. Kido, T. Satoh","doi":"10.1109/MOBIQW.2006.361717","DOIUrl":"https://doi.org/10.1109/MOBIQW.2006.361717","url":null,"abstract":"In this paper, we introduce location traceability as an indicator for evaluating time-series location privacy for users on location-based services (LBS). The location traceability of a user is calculated with a formalized tree structure that represents all possible paths of a moving user. Through the results of the simulation experiments, we validated the effectiveness of this proposed indicator","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127282853","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 : 2006-07-17DOI: 10.1109/MOBIQW.2006.361754
A. Patwardhan, A. Joshi, Timothy W. Finin, Y. Yesha
In vehicular ad hoc networks individual vehicles can help each other locate resources and establish trustworthiness under highly dynamic conditions, lacking any centralized trust authority. To ascertain the accuracy and reliability of data aggregated in a distributed manner, we present a reputation management system for such networks that enables devices to quickly adapt to changing local conditions and provides a bootstrapping method for establishing trust relationships where only a few may exist a priori. Our scheme considers cooperativeness and accuracy of peer-provided data as two aspects of trust when evolving trust relationships and managing reputations. We use an epidemic data exchange protocol that incorporates reputation and agreement to ensure high reliability of data and stimulate proactive collaboration above and beyond stipulation, to enhance availability and reliability of data. We present preliminary simulation results which demonstrate the effectiveness of our data intensive reputation management scheme
{"title":"A Data Intensive Reputation Management Scheme for Vehicular Ad Hoc Networks","authors":"A. Patwardhan, A. Joshi, Timothy W. Finin, Y. Yesha","doi":"10.1109/MOBIQW.2006.361754","DOIUrl":"https://doi.org/10.1109/MOBIQW.2006.361754","url":null,"abstract":"In vehicular ad hoc networks individual vehicles can help each other locate resources and establish trustworthiness under highly dynamic conditions, lacking any centralized trust authority. To ascertain the accuracy and reliability of data aggregated in a distributed manner, we present a reputation management system for such networks that enables devices to quickly adapt to changing local conditions and provides a bootstrapping method for establishing trust relationships where only a few may exist a priori. Our scheme considers cooperativeness and accuracy of peer-provided data as two aspects of trust when evolving trust relationships and managing reputations. We use an epidemic data exchange protocol that incorporates reputation and agreement to ensure high reliability of data and stimulate proactive collaboration above and beyond stipulation, to enhance availability and reliability of data. We present preliminary simulation results which demonstrate the effectiveness of our data intensive reputation management scheme","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"331 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133842579","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 : 2006-07-17DOI: 10.1109/MOBIQW.2006.361766
Weidong Xiang, P. Richardson, Jinhua Guo
At first, this paper presents an overview on the background and technical merits of wireless access for vehicular environments (WAVE) systems. Next, a WAVE testbed was setup and the preliminary experimental results are reported. The WAVE testbed operates at the center frequency of 5.9 GHz and adopts a signal format defined by a draft of the IEEE 802.11p standard. Based on the experimental data captured in a typical vehicle-to-roadside access point environment, related channel impulse responses and capacities are extracted and analyzed
{"title":"Introduction and Preliminary Experimental Results of Wireless Access for Vehicular Environments (WAVE) Systems","authors":"Weidong Xiang, P. Richardson, Jinhua Guo","doi":"10.1109/MOBIQW.2006.361766","DOIUrl":"https://doi.org/10.1109/MOBIQW.2006.361766","url":null,"abstract":"At first, this paper presents an overview on the background and technical merits of wireless access for vehicular environments (WAVE) systems. Next, a WAVE testbed was setup and the preliminary experimental results are reported. The WAVE testbed operates at the center frequency of 5.9 GHz and adopts a signal format defined by a draft of the IEEE 802.11p standard. Based on the experimental data captured in a typical vehicle-to-roadside access point environment, related channel impulse responses and capacities are extracted and analyzed","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124920319","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 : 2006-07-17DOI: 10.1109/MOBIQW.2006.361749
D. Matolak, I. Sen, W. Xiong
In this paper we describe results of a channel measurement campaign for modeling the V2V channel. After review of applications, potential frequency bands, and related work, we describe the measurements and results for delay spreads and multipath component fading amplitudes and correlations, made in multiple V2V environments. We also note how the V2V channel can differ appreciably from other common terrestrial (e.g., cellular) channels. We describe considerations used in developing the statistical channel models for these environments, and provide some example measurement and modeling results that should be useful for system designers in future V2V applications
{"title":"Channel Modeling for V2V Communications","authors":"D. Matolak, I. Sen, W. Xiong","doi":"10.1109/MOBIQW.2006.361749","DOIUrl":"https://doi.org/10.1109/MOBIQW.2006.361749","url":null,"abstract":"In this paper we describe results of a channel measurement campaign for modeling the V2V channel. After review of applications, potential frequency bands, and related work, we describe the measurements and results for delay spreads and multipath component fading amplitudes and correlations, made in multiple V2V environments. We also note how the V2V channel can differ appreciably from other common terrestrial (e.g., cellular) channels. We describe considerations used in developing the statistical channel models for these environments, and provide some example measurement and modeling results that should be useful for system designers in future V2V applications","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125508420","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 : 2006-07-17DOI: 10.1109/MOBIQW.2006.361767
Rama Vuyyuru, K. Oguchi, C. Collier, E. Koch
Vehicular communication is an emerging technology that has lot of potential to support transportation safety, traffic information and other ITS related applications. Due to its unique challenges and infrastructure requirements it is very difficult to evaluate new communication technologies in real world. A good simulation environment is required to evaluate new technologies in close to real-world situations. It is very difficult to integrate real world scenarios like driving and vehicular mobility in widely used network simulators like NS-2 and Qualnet. This paper discusses these requirements for vehicular communication simulation and provides a new architecture for flexible simulation framework for vehicular networks. Proposed simulation architecture combines network simulation, driving simulation and propagation simulation by using real geographic road network and digital elevation model (DEM) to accurately simulate vehicular communication with realistic mobility, accurate propagation models and precise communication models. Proposed simulation framework provides plug-in type modules to extend the features for a particular technology, whether it is communication protocol or driver safety system and evaluates the results inside complete system. Also presented a simple scenario to show how different modules can be extended based on the simulation requirements
{"title":"Automesh: Flexible Simulation Framework for Vehicular Communication","authors":"Rama Vuyyuru, K. Oguchi, C. Collier, E. Koch","doi":"10.1109/MOBIQW.2006.361767","DOIUrl":"https://doi.org/10.1109/MOBIQW.2006.361767","url":null,"abstract":"Vehicular communication is an emerging technology that has lot of potential to support transportation safety, traffic information and other ITS related applications. Due to its unique challenges and infrastructure requirements it is very difficult to evaluate new communication technologies in real world. A good simulation environment is required to evaluate new technologies in close to real-world situations. It is very difficult to integrate real world scenarios like driving and vehicular mobility in widely used network simulators like NS-2 and Qualnet. This paper discusses these requirements for vehicular communication simulation and provides a new architecture for flexible simulation framework for vehicular networks. Proposed simulation architecture combines network simulation, driving simulation and propagation simulation by using real geographic road network and digital elevation model (DEM) to accurately simulate vehicular communication with realistic mobility, accurate propagation models and precise communication models. Proposed simulation framework provides plug-in type modules to extend the features for a particular technology, whether it is communication protocol or driver safety system and evaluates the results inside complete system. Also presented a simple scenario to show how different modules can be extended based on the simulation requirements","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128881875","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 : 2006-07-17DOI: 10.1109/MOBIQW.2006.361753
B. Braem, B. Latré, I. Moerman, C. Blondia, P. Demeester
Wireless body area networks (WBANs) have gained a lot of interest in the world of medical monitoring. Current implementations generally use a large single hop network to connect all sensors to a personal server. However recent research pointed out that multihop networks are more energy-efficient and even necessary when applied near the human body with inherent severe propagation loss. In this paper we present a slotted multihop approach to medium access control and routing in wireless body area networks, the wireless autonomous spanning tree protocol or WASP. It uses crosslayer techniques to achieve efficient distributed coordination of the separated wireless links. Traffic in the network is controlled by setting up a spanning tree and by broadcasting scheme messages over it that are used both by the parent and the children of each node in the tree. We analyze the performance of WASP and show the simulation results
{"title":"The Wireless Autonomous Spanning tree Protocol for Multihop Wireless Body Area Networks","authors":"B. Braem, B. Latré, I. Moerman, C. Blondia, P. Demeester","doi":"10.1109/MOBIQW.2006.361753","DOIUrl":"https://doi.org/10.1109/MOBIQW.2006.361753","url":null,"abstract":"Wireless body area networks (WBANs) have gained a lot of interest in the world of medical monitoring. Current implementations generally use a large single hop network to connect all sensors to a personal server. However recent research pointed out that multihop networks are more energy-efficient and even necessary when applied near the human body with inherent severe propagation loss. In this paper we present a slotted multihop approach to medium access control and routing in wireless body area networks, the wireless autonomous spanning tree protocol or WASP. It uses crosslayer techniques to achieve efficient distributed coordination of the separated wireless links. Traffic in the network is controlled by setting up a spanning tree and by broadcasting scheme messages over it that are used both by the parent and the children of each node in the tree. We analyze the performance of WASP and show the simulation results","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127092966","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
扫码关注我们
求助内容：
应助结果提醒方式：