Pub Date : 2005-10-17DOI: 10.1109/MILCOM.2005.1606005
J. Wang, Y. Fang, D. Wu
Directional antenna has received intensive research interests in recent years due to its potential to increase communication efficiency and resilience to interference and jamming. In this paper, we provide a novel directional MAC protocol termed SYN-DMAC for ad hoc networks with synchronization. We demonstrate our proposed SYN-DMAC can efficiently address the major open problems in the directional MAC design such as the deafness problem, the hidden terminal problem, the exposed terminal problem and the head-of-line (HOL) blocking problem. Preliminary simulation results show that our scheme significantly improves throughput in comparison with IEEE 802.11 MAC protocol
{"title":"SYN-DMAC: a directional MAC protocol for ad hoc networks with synchronization","authors":"J. Wang, Y. Fang, D. Wu","doi":"10.1109/MILCOM.2005.1606005","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606005","url":null,"abstract":"Directional antenna has received intensive research interests in recent years due to its potential to increase communication efficiency and resilience to interference and jamming. In this paper, we provide a novel directional MAC protocol termed SYN-DMAC for ad hoc networks with synchronization. We demonstrate our proposed SYN-DMAC can efficiently address the major open problems in the directional MAC design such as the deafness problem, the hidden terminal problem, the exposed terminal problem and the head-of-line (HOL) blocking problem. Preliminary simulation results show that our scheme significantly improves throughput in comparison with IEEE 802.11 MAC protocol","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126789662","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605942
Qingchun Ren, Q. Liang
In this paper, we propose two asynchronous energy-efficient MAC protocols: A-MAC and ASCEMAC, from contention- and schedule-based perspectives correspondingly. Through applying free-running method, novel rescheduling and time-slot allocation schemes, A-MAC and ASCEMAC do not require network time synchronization any more, which is necessary in existing energy-efficient MAC protocols. So, our algorithms are more suitable for the system which is difficult to ensure perfect network time synchronization. Moreover, we present a traffic-intensity- and network-density-based model to compute essential algorithm parameters: power on/off duration, interval of schedule broadcast, as well as super-time-slot size and sequence
{"title":"Asynchronous energy-efficient MAC protocols for wireless sensor networks","authors":"Qingchun Ren, Q. Liang","doi":"10.1109/MILCOM.2005.1605942","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605942","url":null,"abstract":"In this paper, we propose two asynchronous energy-efficient MAC protocols: A-MAC and ASCEMAC, from contention- and schedule-based perspectives correspondingly. Through applying free-running method, novel rescheduling and time-slot allocation schemes, A-MAC and ASCEMAC do not require network time synchronization any more, which is necessary in existing energy-efficient MAC protocols. So, our algorithms are more suitable for the system which is difficult to ensure perfect network time synchronization. Moreover, we present a traffic-intensity- and network-density-based model to compute essential algorithm parameters: power on/off duration, interval of schedule broadcast, as well as super-time-slot size and sequence","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123290737","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605883
D. Vergados, G. Stergiou
Advances in technology led to the development of sensor networks at low cost. Sensor networks can he used in several application areas including military, health, home, environmental and space exploration. Sensor nodes have several constraints, like limited computational and energy resources that pose design issues to researchers. In tactical sensor networks security plays an important role, since these networks are deployed in hostile environments and run safety-critical applications. This paper presents security protocols used in wireless networks and considers how well these algorithms can he applied to wireless tactical sensor networks
{"title":"Security protocols in wireless tactical sensor networks","authors":"D. Vergados, G. Stergiou","doi":"10.1109/MILCOM.2005.1605883","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605883","url":null,"abstract":"Advances in technology led to the development of sensor networks at low cost. Sensor networks can he used in several application areas including military, health, home, environmental and space exploration. Sensor nodes have several constraints, like limited computational and energy resources that pose design issues to researchers. In tactical sensor networks security plays an important role, since these networks are deployed in hostile environments and run safety-critical applications. This paper presents security protocols used in wireless networks and considers how well these algorithms can he applied to wireless tactical sensor networks","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126428351","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1606078
B. Doshi, L. Benmohamed, A. DeSimone
In this paper, we discuss an architecture and several mechanisms for meeting the quality of service (QoS) requirements of a set of very diverse applications over networks of very heterogeneous network domains. Many of these domains have significant mobility and temporal variation in resource capacities. While DoD 's global information grid (the GIG) is a prime example of a network of this type, commercial Internet and intranets increasingly face similar QoS requirements and operate in similar heterogeneous and dynamic environments. Meeting these challenges and still maintaining high resource efficiency, involves mechanisms in data, control, and management planes. In addition to meeting the QoS requirements of applications, these mechanisms also need to honor the importance level of the user and mission involved in the application. Thus, these mechanisms also perform policy based triage function when the requirements of all users and applications cannot be satisfied due to unexpectedly high demand or unexpected reduction in capacity due to failure, weather condition, etc. The architecture we propose here groups applications into service classes, each with its QoS requirements. Any specific instance of an application has an importance level (IL) determined by organizational policy. We use the requirements, one set for each service class-IL combination, as key drivers for designing a hybrid architecture involving session level admission control and preemption for session oriented service classes, and a packet level marking scheme allowing differential treatment of packets from different service classes and from different ILs.
{"title":"A hybrid end-to-end QOS architecture for heterogeneous networks (like the global information grid)","authors":"B. Doshi, L. Benmohamed, A. DeSimone","doi":"10.1109/MILCOM.2005.1606078","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606078","url":null,"abstract":"In this paper, we discuss an architecture and several mechanisms for meeting the quality of service (QoS) requirements of a set of very diverse applications over networks of very heterogeneous network domains. Many of these domains have significant mobility and temporal variation in resource capacities. While DoD 's global information grid (the GIG) is a prime example of a network of this type, commercial Internet and intranets increasingly face similar QoS requirements and operate in similar heterogeneous and dynamic environments. Meeting these challenges and still maintaining high resource efficiency, involves mechanisms in data, control, and management planes. In addition to meeting the QoS requirements of applications, these mechanisms also need to honor the importance level of the user and mission involved in the application. Thus, these mechanisms also perform policy based triage function when the requirements of all users and applications cannot be satisfied due to unexpectedly high demand or unexpected reduction in capacity due to failure, weather condition, etc. The architecture we propose here groups applications into service classes, each with its QoS requirements. Any specific instance of an application has an importance level (IL) determined by organizational policy. We use the requirements, one set for each service class-IL combination, as key drivers for designing a hybrid architecture involving session level admission control and preemption for session oriented service classes, and a packet level marking scheme allowing differential treatment of packets from different service classes and from different ILs.","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121447374","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605888
S. Berber
The paper investigates BER characteristics of a new algorithm for decoding convolutional codes based on neural networks. The novelty of the algorithm is in its capability to generate soft output estimates of the message bits encoded. It is shown that the defined noise energy function, which is traditionally used for the soft decoding algorithm of convolutional codes, can be related to the well known log likelihood function. The coding gain is calculated using a developed simulator of a coding communication system that uses a systematic 1/2-rate convolutional code
{"title":"A soft decision output convolutional decoder based on the application of neural networks","authors":"S. Berber","doi":"10.1109/MILCOM.2005.1605888","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605888","url":null,"abstract":"The paper investigates BER characteristics of a new algorithm for decoding convolutional codes based on neural networks. The novelty of the algorithm is in its capability to generate soft output estimates of the message bits encoded. It is shown that the defined noise energy function, which is traditionally used for the soft decoding algorithm of convolutional codes, can be related to the well known log likelihood function. The coding gain is calculated using a developed simulator of a coding communication system that uses a systematic 1/2-rate convolutional code","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122554277","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605655
A. Forenza, R. Heath
In this paper we present a computationally efficient method to evaluate the performance of circular patch arrays (CPAs) in clustered MIMO channel models. The proposed method is based on bounds to the eigenvalues of the spatial correlation matrix that are shown to depend only on the channel angle spread. From these bounds, we derive a closed-form expression of the MIMO ergodic capacity as a function of the angle spread, which is used to estimate the performance of CPAs in different propagation environments. This method yields dramatic reduction in computational complexity due to the reduced number of channel parameters required for performance evaluation of CPAs. Simulation results show that through this method it is possible to predict the performance of CPAs, with negligible capacity loss (below 2%), for the most practical channel scenarios
{"title":"Performance evaluation of 2-element arrays of circular patch antennas in indoor clustered MIMO channels","authors":"A. Forenza, R. Heath","doi":"10.1109/MILCOM.2005.1605655","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605655","url":null,"abstract":"In this paper we present a computationally efficient method to evaluate the performance of circular patch arrays (CPAs) in clustered MIMO channel models. The proposed method is based on bounds to the eigenvalues of the spatial correlation matrix that are shown to depend only on the channel angle spread. From these bounds, we derive a closed-form expression of the MIMO ergodic capacity as a function of the angle spread, which is used to estimate the performance of CPAs in different propagation environments. This method yields dramatic reduction in computational complexity due to the reduced number of channel parameters required for performance evaluation of CPAs. Simulation results show that through this method it is possible to predict the performance of CPAs, with negligible capacity loss (below 2%), for the most practical channel scenarios","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123112719","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605745
Casey K. Fung, Yi-Liang Chen, Xinyu Wang, J. Lee, R. Tarquini, M. Anderson, R. Linger
The survivability of system services is defined as the capability of system services to fulfil the mission objectives in the presence of malicious attacks, system failures, or accidents. Because of the severe consequences of system service failures, survivability analysis and mitigation solutions have been regarded as two of the most important aspects in distributed system development. In systems based on service-oriented architectures (SOA), the survivability analysis is fundamentally different from the traditional security-centric approaches that have been developed for traditional object-oriented, component-based systems. Under the new SOA paradigm, a system is regarded as a composition of services, each of which has well-defined goals and functionalities. For as long as a service is an independently developed component with well-defined goals and functionalities, the service can be treated as an independent system in the analysis of survivability. This paper presents an initial case study in adopting the attack tree analysis methodology for survivability study. We proposed a generic model for message-oriented systems based on SOA. This model depicts a messaging substrate composed of a group of messaging brokers with help from discover services and QoS managers to coordinate communication of a service overlay network on top of a mobile ad-hoc network (MANET). We first captured the basic service components in the system and the underlying mobile ad-hoc network. Next, we defined a mission objective in a case study and conducted attack tree analysis on the model system. From the attack tree analysis, we identified intrusion scenarios. Then we suggested a quantitative measure for system survivability. The survivability design task for a system is simply to make intrusion on the identified key components as difficult and costly as possible. From this case study, we identified the compromisable components that could be penetrated and damaged by intrusion and provided suggestions to enhance system survivability
{"title":"Survivability analysis of distributed systems using attack tree methodology","authors":"Casey K. Fung, Yi-Liang Chen, Xinyu Wang, J. Lee, R. Tarquini, M. Anderson, R. Linger","doi":"10.1109/MILCOM.2005.1605745","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605745","url":null,"abstract":"The survivability of system services is defined as the capability of system services to fulfil the mission objectives in the presence of malicious attacks, system failures, or accidents. Because of the severe consequences of system service failures, survivability analysis and mitigation solutions have been regarded as two of the most important aspects in distributed system development. In systems based on service-oriented architectures (SOA), the survivability analysis is fundamentally different from the traditional security-centric approaches that have been developed for traditional object-oriented, component-based systems. Under the new SOA paradigm, a system is regarded as a composition of services, each of which has well-defined goals and functionalities. For as long as a service is an independently developed component with well-defined goals and functionalities, the service can be treated as an independent system in the analysis of survivability. This paper presents an initial case study in adopting the attack tree analysis methodology for survivability study. We proposed a generic model for message-oriented systems based on SOA. This model depicts a messaging substrate composed of a group of messaging brokers with help from discover services and QoS managers to coordinate communication of a service overlay network on top of a mobile ad-hoc network (MANET). We first captured the basic service components in the system and the underlying mobile ad-hoc network. Next, we defined a mission objective in a case study and conducted attack tree analysis on the model system. From the attack tree analysis, we identified intrusion scenarios. Then we suggested a quantitative measure for system survivability. The survivability design task for a system is simply to make intrusion on the identified key components as difficult and costly as possible. From this case study, we identified the compromisable components that could be penetrated and damaged by intrusion and provided suggestions to enhance system survivability","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126314171","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605995
K. Fall
Heterogeneous ad-hoc networks, for both military and scientific applications, may be far removed from communications infrastructure such as the Internet. Yet, to be maximally useful, these networks must ultimately be connected to data storage and analysis facilities. Providing connectivity for such networks may involve exotic and unusual methods of data transfer, including acoustic, free space optical, satellite, and data mule forms of network links. problems of intermittent connectivity due to power scheduling, node failure, and packet losses from unpredictable external factors are frequently encountered. In addition, due to the myriad of assets employed, a high degree of network heterogeneity is encountered. As an approach to dealing with these two major issues, we propose the use of the disruption tolerant networking (DTN) architecture, which provides reliable asynchronous data communication across heterogeneous, failure-prone networks
{"title":"Disruption tolerant networking for heterogeneous ad-hoc networks","authors":"K. Fall","doi":"10.1109/MILCOM.2005.1605995","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605995","url":null,"abstract":"Heterogeneous ad-hoc networks, for both military and scientific applications, may be far removed from communications infrastructure such as the Internet. Yet, to be maximally useful, these networks must ultimately be connected to data storage and analysis facilities. Providing connectivity for such networks may involve exotic and unusual methods of data transfer, including acoustic, free space optical, satellite, and data mule forms of network links. problems of intermittent connectivity due to power scheduling, node failure, and packet losses from unpredictable external factors are frequently encountered. In addition, due to the myriad of assets employed, a high degree of network heterogeneity is encountered. As an approach to dealing with these two major issues, we propose the use of the disruption tolerant networking (DTN) architecture, which provides reliable asynchronous data communication across heterogeneous, failure-prone networks","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126406687","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605742
J. Bull
The National Security Agency's Cryptographic Modernization Initiative (CMI) has far reaching implications for the Information Assurance required on military satellites. The programmability tenet, one of six tenets defined in the National Security Agency (NSA)/Central Security Service (CSS) Policy 3-9, provides the greatest return on investment (ROI) by prolonging a satellite's useful life, but also presents the greatest technological risk. This paper explores trades between current performance capabilities and programmability based on available and planned technology. Algorithm transitioning, forecasting the size and complexity of future algorithms, recertification, and redundancy are technology concerns that are addressed. Several issues are highlighted and a process is proposed that can be used to determine the best return on investment for the government, including technology projections and cost as an independent variable. The end goal is ensuring the security of the Warfighter
{"title":"Ensuring the security of warfighters' satcom via programmable cryptographic devices","authors":"J. Bull","doi":"10.1109/MILCOM.2005.1605742","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605742","url":null,"abstract":"The National Security Agency's Cryptographic Modernization Initiative (CMI) has far reaching implications for the Information Assurance required on military satellites. The programmability tenet, one of six tenets defined in the National Security Agency (NSA)/Central Security Service (CSS) Policy 3-9, provides the greatest return on investment (ROI) by prolonging a satellite's useful life, but also presents the greatest technological risk. This paper explores trades between current performance capabilities and programmability based on available and planned technology. Algorithm transitioning, forecasting the size and complexity of future algorithms, recertification, and redundancy are technology concerns that are addressed. Several issues are highlighted and a process is proposed that can be used to determine the best return on investment for the government, including technology projections and cost as an independent variable. The end goal is ensuring the security of the Warfighter","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122200149","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605781
M. Natu, A. Sethi
Future battlefield networks require extensive fault management mechanism. Most existing fault localization algorithms assume availability of complete and/or deterministic dependency model. Such assumptions cannot be made in the dynamic environment of a battlefield network where nodes may move, causing periodic changes in routes. This paper is aimed at developing a fault diagnosis architecture and algorithm, which address the issue of dynamically changing dependencies in battlefield networks
{"title":"Adaptive fault localization in mobile ad hoc battlefield networks","authors":"M. Natu, A. Sethi","doi":"10.1109/MILCOM.2005.1605781","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605781","url":null,"abstract":"Future battlefield networks require extensive fault management mechanism. Most existing fault localization algorithms assume availability of complete and/or deterministic dependency model. Such assumptions cannot be made in the dynamic environment of a battlefield network where nodes may move, causing periodic changes in routes. This paper is aimed at developing a fault diagnosis architecture and algorithm, which address the issue of dynamically changing dependencies in battlefield networks","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114218058","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
扫码关注我们
求助内容：
应助结果提醒方式：