Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207352
Jyh-ming Huang, P. Yen
Efficient routing protocols design is a critical approach for energy conservations in wireless sensor networks. In this paper, we propose an energy efficient routing protocol, named as Cluster-Based Directed Hierarchical Routing Protocol (CB-DHRP). The design philosophy of CB-DHRP is conceptually similar to the well-known LEACH scheme, but different in the assumptions of node transmission range and the formation method used in routing structure creation. Bound on the limited node transmission range, and with the cooperation of cluster members and cluster heads, CB-DHRP always constructs energy-efficient transmission paths that are capable of relaying the sensed data toward the sink (Base Station, BS). The simulation results show that, by choosing an appropriate percentage of cluster heads, the proposed CB-DHRP protocol can achieve about 1.5 times improvements on the network lifetime than that in other existing protocols, such as LEACH, ERA, and PEGASIS protocols.
{"title":"CB-DHRP: A Cluster-Based Directed Hierarchical Routing Protocol for wireless sensor networks","authors":"Jyh-ming Huang, P. Yen","doi":"10.1109/ISADS.2009.5207352","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207352","url":null,"abstract":"Efficient routing protocols design is a critical approach for energy conservations in wireless sensor networks. In this paper, we propose an energy efficient routing protocol, named as Cluster-Based Directed Hierarchical Routing Protocol (CB-DHRP). The design philosophy of CB-DHRP is conceptually similar to the well-known LEACH scheme, but different in the assumptions of node transmission range and the formation method used in routing structure creation. Bound on the limited node transmission range, and with the cooperation of cluster members and cluster heads, CB-DHRP always constructs energy-efficient transmission paths that are capable of relaying the sensed data toward the sink (Base Station, BS). The simulation results show that, by choosing an appropriate percentage of cluster heads, the proposed CB-DHRP protocol can achieve about 1.5 times improvements on the network lifetime than that in other existing protocols, such as LEACH, ERA, and PEGASIS protocols.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130643980","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207393
Yoko Furuzumi, Y. Nakamoto
We present node relocation algorithms to achieve better communications quality in a mobile wireless ad hoc network. Our aim is to manage the ad hoc network autonomously. The communications quality is improved by decreasing distance from the source to the destination node in the network. A problem is defined as how to relocate relay nodes in the network to minimize distance in the network and moreover to minimize the distance of moving the nodes. The shorter moving distance of a node leads to the less battery consumption by the moving. We propose two algorithms, i.e., one that was centralized and a decentralized one. The former is based on the minimum spanning tree algorithm. Since the latter is not solved efficiently, we present an approximation algorithm using the distributed election algorithm.
{"title":"Node relocation algorithms for improving communications quality in ad hoc networks","authors":"Yoko Furuzumi, Y. Nakamoto","doi":"10.1109/ISADS.2009.5207393","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207393","url":null,"abstract":"We present node relocation algorithms to achieve better communications quality in a mobile wireless ad hoc network. Our aim is to manage the ad hoc network autonomously. The communications quality is improved by decreasing distance from the source to the destination node in the network. A problem is defined as how to relocate relay nodes in the network to minimize distance in the network and moreover to minimize the distance of moving the nodes. The shorter moving distance of a node leads to the less battery consumption by the moving. We propose two algorithms, i.e., one that was centralized and a decentralized one. The former is based on the minimum spanning tree algorithm. Since the latter is not solved efficiently, we present an approximation algorithm using the distributed election algorithm.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122871326","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207384
C. Takano, M. Aida
We have proposed diffusion flow control (DFC) as a technique for controlling a network, using an analogy of the diffusion phenomenon. In DFC, although each node in a network handles its local traffic flow only on the basis of the information it is aware of, the diffusion effect of DFC distributes the packet density in a network, so avoiding packet loss. In our previous work, we have assumed that each node knows the lengths of the links adjacent to it and we used control timing depending on the link length. In this paper, we describe an extension of the DFC in which the control timing is independent of the link length so allowing DFC to be used in a mobile ad hoc network.
{"title":"Autonomous decentralized flow control allowing control timing independent of link length","authors":"C. Takano, M. Aida","doi":"10.1109/ISADS.2009.5207384","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207384","url":null,"abstract":"We have proposed diffusion flow control (DFC) as a technique for controlling a network, using an analogy of the diffusion phenomenon. In DFC, although each node in a network handles its local traffic flow only on the basis of the information it is aware of, the diffusion effect of DFC distributes the packet density in a network, so avoiding packet loss. In our previous work, we have assumed that each node knows the lengths of the links adjacent to it and we used control timing depending on the link length. In this paper, we describe an extension of the DFC in which the control timing is independent of the link length so allowing DFC to be used in a mobile ad hoc network.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129635344","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207372
S. Niki, Shoichi Murakami, K. Mahmood, Xiaodong Lu, K. Mori
In recent years, with development in wireless communication technologies and sensor devices, wireless sensor networks have gained worldwide attention. In production plant monitoring systems, especially food factory monitoring systems, it is needed to relocate sensors in accordance with reorganization of production lines. A conventional centralized management systems isn't able to cope with huge number of sensors and rapidly changing topology. Autonomous Decentralized Community Wireless Sensor Network System (ADCWSN) is presented to solve these problems. In ADCWSN, all nodes are autonomous, and each node copes with problems by mutual corporation according to the situation. (This set of nodes which mutual corporate forms community.) In this paper, Autonomous Initialization Technology and Autonomous Community Collaboration Technology are proposed to satisfy expandability and the effectiveness of proposed technologies is shown through simulation.
{"title":"Autonomous Decentralized Community Wireless Sensor Network System architecture to achieve high-speed connectivity under dynamical situation","authors":"S. Niki, Shoichi Murakami, K. Mahmood, Xiaodong Lu, K. Mori","doi":"10.1109/ISADS.2009.5207372","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207372","url":null,"abstract":"In recent years, with development in wireless communication technologies and sensor devices, wireless sensor networks have gained worldwide attention. In production plant monitoring systems, especially food factory monitoring systems, it is needed to relocate sensors in accordance with reorganization of production lines. A conventional centralized management systems isn't able to cope with huge number of sensors and rapidly changing topology. Autonomous Decentralized Community Wireless Sensor Network System (ADCWSN) is presented to solve these problems. In ADCWSN, all nodes are autonomous, and each node copes with problems by mutual corporation according to the situation. (This set of nodes which mutual corporate forms community.) In this paper, Autonomous Initialization Technology and Autonomous Community Collaboration Technology are proposed to satisfy expandability and the effectiveness of proposed technologies is shown through simulation.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125365694","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207387
Atsushi Ito, Kenji Ooi, Hiroshi Kasahara, T. Ohta, M. Mahlstedt, Ariane Hedayati, Markus Fischmann
We present our trial of citizen's participation art as autonomous and decentralized System. Our purposes are to provide an environment to encourage people to join an event through ICT tools, and feel happiness and unity in a community.
{"title":"A study of citizen's participation art as autonomous and decentralized System","authors":"Atsushi Ito, Kenji Ooi, Hiroshi Kasahara, T. Ohta, M. Mahlstedt, Ariane Hedayati, Markus Fischmann","doi":"10.1109/ISADS.2009.5207387","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207387","url":null,"abstract":"We present our trial of citizen's participation art as autonomous and decentralized System. Our purposes are to provide an environment to encourage people to join an event through ICT tools, and feel happiness and unity in a community.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129952022","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207345
K. Tagawa
This paper presents several survival selection methods for a new Differentiation Evolution (DE) based on the continuous generation model. The standard DE employs the discrete generation model in which the current-generation population is replaced by the next-generation population at a time. On the other hand, only one population is used in the continuous generation model. Because a newborn excellent individual is added to the population and can be used immediately to generate offspring, it can be expected that the new DE based on the continuous generation model converges faster than the standard DE. Furthermore, it becomes easy to introduce various survival selection methods into the new DE. Therefore, five survival selection methods are contrived for the new DE. Finally, the effects of those survival selection methods are studied by using the analysis of variance (ANOVA).
{"title":"Survival selection methods for the Differential Evolution based on continuous generation model","authors":"K. Tagawa","doi":"10.1109/ISADS.2009.5207345","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207345","url":null,"abstract":"This paper presents several survival selection methods for a new Differentiation Evolution (DE) based on the continuous generation model. The standard DE employs the discrete generation model in which the current-generation population is replaced by the next-generation population at a time. On the other hand, only one population is used in the continuous generation model. Because a newborn excellent individual is added to the population and can be used immediately to generate offspring, it can be expected that the new DE based on the continuous generation model converges faster than the standard DE. Furthermore, it becomes easy to introduce various survival selection methods into the new DE. Therefore, five survival selection methods are contrived for the new DE. Finally, the effects of those survival selection methods are studied by using the analysis of variance (ANOVA).","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115781175","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207367
P. Trakadas, S. Maniatis, P. Karkazis, T. Zahariadis, H. Leligou, S. Voliotis
Security has been recognised as a key issue for the expansion of wireless sensor network applications. To defend against the wide set of security attacks, legacy security solutions are not applicable due to the very limited memory and processing resources of the sensor nodes as well as due to the reason that sensor networks are required to operate in an autonomous infrastructureless manner. Trust management schemes consist a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use these information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a novel trust management system based on both direct and indirect trust information, which allows for fast detection of a wide set of attacks, including those addressing the reputation exchange scheme, while energy awareness is also incorporated in our approach.
{"title":"A novel flexible trust management system for heterogeneous wireless sensor networks","authors":"P. Trakadas, S. Maniatis, P. Karkazis, T. Zahariadis, H. Leligou, S. Voliotis","doi":"10.1109/ISADS.2009.5207367","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207367","url":null,"abstract":"Security has been recognised as a key issue for the expansion of wireless sensor network applications. To defend against the wide set of security attacks, legacy security solutions are not applicable due to the very limited memory and processing resources of the sensor nodes as well as due to the reason that sensor networks are required to operate in an autonomous infrastructureless manner. Trust management schemes consist a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use these information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a novel trust management system based on both direct and indirect trust information, which allows for fast detection of a wide set of attacks, including those addressing the reputation exchange scheme, while energy awareness is also incorporated in our approach.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125765912","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207341
Euisin Lee, Soochang Park, Fucai Yu, Taehee Kim, Sang-Ha Kim
Most existing geographic routing protocols on sensor networks concentrates on finding ways to guarantee data forwarding from the source to the destination, and not many protocols have been done on collecting and aggregating data of sources in a local and adjacent region. However, data generated from the sources in the local and adjacent region are often redundant and highly correlated. Accordingly, data collection and aggregation of the region in the sensor networks is important and necessary to save the energy of sensor nodes. We introduce the concept of a local sink to address this issue in geographic routing. The local sink is a sensor node in the region, in which the sensor node is temporarily selected by the global sink for collecting and aggregating data from source nodes in the region and delivering the aggregated data to the global sink, in geographic routing. We also design a model to determine an optimal location of the local sink and propose a mechanism to collect data through the local sink. Simulation results show that the proposed mechanism with the local sink is more efficient in terms of the energy and the data delivery ratio than the existing mechanism in a geographic routing.
{"title":"Local data collection in geographic routing for wireless sensor networks","authors":"Euisin Lee, Soochang Park, Fucai Yu, Taehee Kim, Sang-Ha Kim","doi":"10.1109/ISADS.2009.5207341","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207341","url":null,"abstract":"Most existing geographic routing protocols on sensor networks concentrates on finding ways to guarantee data forwarding from the source to the destination, and not many protocols have been done on collecting and aggregating data of sources in a local and adjacent region. However, data generated from the sources in the local and adjacent region are often redundant and highly correlated. Accordingly, data collection and aggregation of the region in the sensor networks is important and necessary to save the energy of sensor nodes. We introduce the concept of a local sink to address this issue in geographic routing. The local sink is a sensor node in the region, in which the sensor node is temporarily selected by the global sink for collecting and aggregating data from source nodes in the region and delivering the aggregated data to the global sink, in geographic routing. We also design a model to determine an optimal location of the local sink and propose a mechanism to collect data through the local sink. Simulation results show that the proposed mechanism with the local sink is more efficient in terms of the energy and the data delivery ratio than the existing mechanism in a geographic routing.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"405 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126678926","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207346
Shuxu Zhao, J. Dang, Haimin Ma
The research of China railway Passenger-Dedicated Lines and how to construct high-efficiency information system of it have been accelerated in these years. According to the users' multi-levels requests, the on-line properties are required for new information system, in order to avoid flaws of the existing railway information system. In this paper, we analyzed structure and properties of railway control and management information, gave out its flexible and rigid definitions. We proposed the definitions of Autonomous Functional Unit and Autonomous Information Field. Based on that, a new autonomous integration model of China railway Passenger-Dedicated Lines Information System is constructed, and gave out the mapping method of AFU and AIF in Passenger-Dedicated Lines information system. In the novel integration model, any task can be autonomously separated and processed according to proposed task tree separation algorithm. Finally, an example of dynamic logic process for train dispatching resource integration is described.
{"title":"Research of China high-speed train transport operation system based on autonomous integration","authors":"Shuxu Zhao, J. Dang, Haimin Ma","doi":"10.1109/ISADS.2009.5207346","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207346","url":null,"abstract":"The research of China railway Passenger-Dedicated Lines and how to construct high-efficiency information system of it have been accelerated in these years. According to the users' multi-levels requests, the on-line properties are required for new information system, in order to avoid flaws of the existing railway information system. In this paper, we analyzed structure and properties of railway control and management information, gave out its flexible and rigid definitions. We proposed the definitions of Autonomous Functional Unit and Autonomous Information Field. Based on that, a new autonomous integration model of China railway Passenger-Dedicated Lines Information System is constructed, and gave out the mapping method of AFU and AIF in Passenger-Dedicated Lines information system. In the novel integration model, any task can be autonomously separated and processed according to proposed task tree separation algorithm. Finally, an example of dynamic logic process for train dispatching resource integration is described.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131471594","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207338
Y. Takemoto, J. Funasaka, S. Teshima, T. Ohta, Y. Kakuda
When ubiquitous networks pervade in future, applications such as file transfer and web browsing will be used also on ad-hoc networks. End-to-end reliable communication is necessary for these applications, and TCP has usually been used as a transport protocol. However, it is known that the performance of fairness and transfer rate decreases when TCP is used on ad hoc networks. Particularly, multi-connection flows of TCP have danger of unfair communication among all flows sharing a wireless link. Then, we pay attention to the multistream mechanism of SCTP to improve unfair communication of TCP multi-connection. SCTP can manage multiple data streams in one association by using the multi-stream mechanism. The performance of reliable transport protocols such as TCP and SCTP easily suffers from frequent route failures and contention on the wireless channel. To improve the problem for mobile ad hoc networks, we propose a scheme which adds the mechanism of Fixed RTO and dynamic delayed SACK to SCTP (shortly, the proposal). And, we evaluated the proposal by a network simulator QualNet.
{"title":"SCTP performance improvement for reliable End-to-end communication in ad hoc networks","authors":"Y. Takemoto, J. Funasaka, S. Teshima, T. Ohta, Y. Kakuda","doi":"10.1109/ISADS.2009.5207338","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207338","url":null,"abstract":"When ubiquitous networks pervade in future, applications such as file transfer and web browsing will be used also on ad-hoc networks. End-to-end reliable communication is necessary for these applications, and TCP has usually been used as a transport protocol. However, it is known that the performance of fairness and transfer rate decreases when TCP is used on ad hoc networks. Particularly, multi-connection flows of TCP have danger of unfair communication among all flows sharing a wireless link. Then, we pay attention to the multistream mechanism of SCTP to improve unfair communication of TCP multi-connection. SCTP can manage multiple data streams in one association by using the multi-stream mechanism. The performance of reliable transport protocols such as TCP and SCTP easily suffers from frequent route failures and contention on the wireless channel. To improve the problem for mobile ad hoc networks, we propose a scheme which adds the mechanism of Fixed RTO and dynamic delayed SACK to SCTP (shortly, the proposal). And, we evaluated the proposal by a network simulator QualNet.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"931 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132284896","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
扫码关注我们
求助内容：
应助结果提醒方式：