Different devices, such as mobile phones, soft phones, or desktop phones, have varying processing power, bandwidth, and media capabilities. Heterogeneous P2P voice systems that are built based on a set of capabilities will not be suitable for devices that have different capabilities. In this paper, we present an architecture for P2P voice systems that can dynamically change P2P overlay mechanisms to better suit different device, user, and feature requirements of a P2P voice system. As a first step towards realizing the architecture, we propose a P2P-SIP based architecture that separates out P2P mechanisms from SIP. Our architecture allows dynamic P2P structural changes, limits bloating of the SIP protocol, and lays a foundation for a flexible hierarchical system
{"title":"Dynamic peer-to-peer overlays for voice systems","authors":"K. Dhara, Salman Baset","doi":"10.1109/PERCOMW.2006.46","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.46","url":null,"abstract":"Different devices, such as mobile phones, soft phones, or desktop phones, have varying processing power, bandwidth, and media capabilities. Heterogeneous P2P voice systems that are built based on a set of capabilities will not be suitable for devices that have different capabilities. In this paper, we present an architecture for P2P voice systems that can dynamically change P2P overlay mechanisms to better suit different device, user, and feature requirements of a P2P voice system. As a first step towards realizing the architecture, we propose a P2P-SIP based architecture that separates out P2P mechanisms from SIP. Our architecture allows dynamic P2P structural changes, limits bloating of the SIP protocol, and lays a foundation for a flexible hierarchical system","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130862216","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}
Consider a placement of heterogeneous, wireless sensors that can vary the transmission range by increasing or decreasing power. The problem of determining an optimal assignment of transmission radii, so that the resulting network is strongly-connected and more generally k-connected has been studied in the literature. In traditional k-connectedness, the network is able resist the failure of up to k - 1 nodes anywhere in the network, and still remain strongly-connected. In this paper we introduce a much stronger k-connectedness property, which we show can be implemented efficiently, and without great increase in the radii of transmission needed to simply achieve connectedness. We say that a network is dominating k-connected if, for any simultaneous failure of nodes throughout the network, with at most k - 1 nodes failures occurring in the out-neighborhood any surviving (up) node, the set U of up nodes forms a dominating set and induces a strongly-connected subdigraph. In this paper, we give a simple characterization of the networks that are dominating k-connected and design an associated efficient algorithm for determining the dominating connectivity, i.e., the maximum k such that the network is dominating k-connected. We also present an efficient algorithm for computing an assignment of transmission radii that results in a dominating k-connected network which minimizes the maximum radius. Furthermore, we show that the maximum radius in this assignment is no more than a multiplicative factor of k greater than the percolation radius rhoperc, i.e., the minimum that the maximum transmission radius can be so that the network remains connected. We show through empirical testing that this multiplicative factor can, in practice, be considerably less than k and only slightly greater than that required to achieve traditional k-connectedness. Finally, we show that for sensors placed on the lattice points of a two-dimensional square, we can achieve dominating k-connectedness with a multiplicative factor of at most radic2[radick + .5] greater than rhoperc
{"title":"Dominating connectivity and reliability of heterogeneous sensor networks","authors":"K. Berman, Fred S. Annexstein, A. Ranganathan","doi":"10.1109/PERCOMW.2006.44","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.44","url":null,"abstract":"Consider a placement of heterogeneous, wireless sensors that can vary the transmission range by increasing or decreasing power. The problem of determining an optimal assignment of transmission radii, so that the resulting network is strongly-connected and more generally k-connected has been studied in the literature. In traditional k-connectedness, the network is able resist the failure of up to k - 1 nodes anywhere in the network, and still remain strongly-connected. In this paper we introduce a much stronger k-connectedness property, which we show can be implemented efficiently, and without great increase in the radii of transmission needed to simply achieve connectedness. We say that a network is dominating k-connected if, for any simultaneous failure of nodes throughout the network, with at most k - 1 nodes failures occurring in the out-neighborhood any surviving (up) node, the set U of up nodes forms a dominating set and induces a strongly-connected subdigraph. In this paper, we give a simple characterization of the networks that are dominating k-connected and design an associated efficient algorithm for determining the dominating connectivity, i.e., the maximum k such that the network is dominating k-connected. We also present an efficient algorithm for computing an assignment of transmission radii that results in a dominating k-connected network which minimizes the maximum radius. Furthermore, we show that the maximum radius in this assignment is no more than a multiplicative factor of k greater than the percolation radius rhoperc, i.e., the minimum that the maximum transmission radius can be so that the network remains connected. We show through empirical testing that this multiplicative factor can, in practice, be considerably less than k and only slightly greater than that required to achieve traditional k-connectedness. Finally, we show that for sensors placed on the lattice points of a two-dimensional square, we can achieve dominating k-connectedness with a multiplicative factor of at most radic2[radick + .5] greater than rhoperc","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126297571","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}
Wen-Cheng Ho, A. Smailagic, D. Siewiorek, C. Faloutsos
Environmental variations cause significant fluctuations in WiFi signals in the same location over time, rendering traditional RF-to-location pre-trained maps quickly obsolete. To solve this problem, we use a two-phase approach to determining the user's location. The first phase utilizes traditional pattern-matching to identify the general location, and a second phase applies logistic regression to distinguish between finer-grained locations. An adaptive calibration system allows the user to re-train and dynamically update the signal strength maps to account for the fluctuated signals. We show that our two-phase approach is able to achieve generally high accuracy (-95%) and over in areas of high signal fluctuations due to heavy access point and human density
{"title":"An adaptive two-phase approach to WiFi location sensing","authors":"Wen-Cheng Ho, A. Smailagic, D. Siewiorek, C. Faloutsos","doi":"10.1109/PERCOMW.2006.18","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.18","url":null,"abstract":"Environmental variations cause significant fluctuations in WiFi signals in the same location over time, rendering traditional RF-to-location pre-trained maps quickly obsolete. To solve this problem, we use a two-phase approach to determining the user's location. The first phase utilizes traditional pattern-matching to identify the general location, and a second phase applies logistic regression to distinguish between finer-grained locations. An adaptive calibration system allows the user to re-train and dynamically update the signal strength maps to account for the fluctuated signals. We show that our two-phase approach is able to achieve generally high accuracy (-95%) and over in areas of high signal fluctuations due to heavy access point and human density","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128716313","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}
Localization research has focused on improving the accuracy of pinpointing the physical location of a target. We think that the energy efficiency and the quality of the localization services (QoLS) are equally important properties of localization systems. We refer to the QoLS as the timely supply of the location information to the applications. Energy efficiency and quality are seemingly two contradictive goals in terms of determining the rate of triggering the localization systems to perform the necessary computation and communication. In that, a lower location sampling rate contributes to a lower level of energy consumption but in the meantime compromises the timeliness of acquiring the location information. Opting for energy efficient and quality localization services, we propose a mobility-aware mechanism that adapts the sampling rate to the target mobility. Results from our simulations confirm that the adaptive sampling approach is promising and effective
{"title":"Enabling energy-efficient and quality localization services","authors":"Tsung-Han Lin, Polly Huang, Hao-Hua Chu, Hsing-Hau Chen, Ju-Peng Chen","doi":"10.1109/PERCOMW.2006.50","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.50","url":null,"abstract":"Localization research has focused on improving the accuracy of pinpointing the physical location of a target. We think that the energy efficiency and the quality of the localization services (QoLS) are equally important properties of localization systems. We refer to the QoLS as the timely supply of the location information to the applications. Energy efficiency and quality are seemingly two contradictive goals in terms of determining the rate of triggering the localization systems to perform the necessary computation and communication. In that, a lower location sampling rate contributes to a lower level of energy consumption but in the meantime compromises the timeliness of acquiring the location information. Opting for energy efficient and quality localization services, we propose a mobility-aware mechanism that adapts the sampling rate to the target mobility. Results from our simulations confirm that the adaptive sampling approach is promising and effective","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129146211","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-03-13DOI: 10.1109/PERCOMW.2006.134
Faraz Rasheed, Young-Koo Lee, Sungyoung Lee
Ubiquitous computing envisions the era of computing where pro-active computing services are available to all any where, any time. In order to provide such pervasive services, an ubiquitous system collects a large amount of information continuously from its physical and computational environment. Managing and manipulating this information optimally is one of the most important aspects of ubiquitous computing system. We have proposed formal schemes for the storage and management of this information using the summarization techniques. We prepare aggregates or summary of information present in the repository and try only to use these summaries and aggregates most of the time for query processing. This approach not only saves the storage space but also results in efficient distributed and mobile data processing
{"title":"Towards using data aggregation techniques in ubiquitous computing environments","authors":"Faraz Rasheed, Young-Koo Lee, Sungyoung Lee","doi":"10.1109/PERCOMW.2006.134","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.134","url":null,"abstract":"Ubiquitous computing envisions the era of computing where pro-active computing services are available to all any where, any time. In order to provide such pervasive services, an ubiquitous system collects a large amount of information continuously from its physical and computational environment. Managing and manipulating this information optimally is one of the most important aspects of ubiquitous computing system. We have proposed formal schemes for the storage and management of this information using the summarization techniques. We prepare aggregates or summary of information present in the repository and try only to use these summaries and aggregates most of the time for query processing. This approach not only saves the storage space but also results in efficient distributed and mobile data processing","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122843484","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}
The design process of protocols for wireless sensor networks (WSNs) is primarily concerned with tackling special issues inherent to WSNs, such as limited energy (or battery power), computation, communication, and storage capabilities, with energy being the most crucial resource for sensor nodes. This paper proposes LAMaR, a location-aided and maximum remaining energy-based data dissemination protocol for WSNs, with a goal to prolong the network lifetime. LAMaR exploits the geometric properties of Voronoi diagram and introduces the concepts of proxy forwarders and intermediate forwarder chains to build energy-efficient dissemination paths. We show that LAMaR, which favors disseminating data over short distances, achieves an energy gain in the order of 55% for the free space model and close to 100% for the multi-path model compared to BVGF and GPSR, which forward data through long distances. We also prove that the use of proxy forwarders yields an energy gain in the order of 30% in comparison with a similar protocol which does not use the concept of proxy forwarders
{"title":"An energy-efficient data dissemination protocol for wireless sensor networks","authors":"H. Ammari, Sajal K. Das","doi":"10.1109/PERCOMW.2006.21","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.21","url":null,"abstract":"The design process of protocols for wireless sensor networks (WSNs) is primarily concerned with tackling special issues inherent to WSNs, such as limited energy (or battery power), computation, communication, and storage capabilities, with energy being the most crucial resource for sensor nodes. This paper proposes LAMaR, a location-aided and maximum remaining energy-based data dissemination protocol for WSNs, with a goal to prolong the network lifetime. LAMaR exploits the geometric properties of Voronoi diagram and introduces the concepts of proxy forwarders and intermediate forwarder chains to build energy-efficient dissemination paths. We show that LAMaR, which favors disseminating data over short distances, achieves an energy gain in the order of 55% for the free space model and close to 100% for the multi-path model compared to BVGF and GPSR, which forward data through long distances. We also prove that the use of proxy forwarders yields an energy gain in the order of 30% in comparison with a similar protocol which does not use the concept of proxy forwarders","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123322843","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}
This paper moves the discussion of pervasive learning from the domain of theory into the domain of practice. It provides an overview of a model of pervasive learning and discusses how the model was used to support the development of one type of pervasive learning environment, specifically, a pervasive learning game called ProjectY
{"title":"From theory to practice: on designing a pervasive learning game","authors":"Siobhan Thomas","doi":"10.1109/PERCOMW.2006.60","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.60","url":null,"abstract":"This paper moves the discussion of pervasive learning from the domain of theory into the domain of practice. It provides an overview of a model of pervasive learning and discusses how the model was used to support the development of one type of pervasive learning environment, specifically, a pervasive learning game called ProjectY","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"708 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122001251","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}
We consider group key agreement (GKA) protocols, used by a group of peers to establish a shared secret key for multicast communications. There has been much previous work to improve the security, efficiency and scalability of such protocols. In our work, we describe secure schemes which utilize auxiliary channels in addition to that afforded by the open medium of radio. Such channels are often present in a human-centric pervasive ad-hoc networking scenario, though often neglected. We show that auxiliary channels can reduce public-key operations, reduce computational complexity, and strengthen security against an active adversary on the open channel, and against an eavesdropper on the auxiliary channels. Group key agreement protocols are usually often contextualized by their topology. We applied multi-channel schemes to different topologies, and found that the ideal topology may be different for different channels
{"title":"Multi-channel protocols for group key agreement in arbitrary topologies","authors":"Ford-Long Wong, F. Stajano","doi":"10.1109/PERCOMW.2006.98","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.98","url":null,"abstract":"We consider group key agreement (GKA) protocols, used by a group of peers to establish a shared secret key for multicast communications. There has been much previous work to improve the security, efficiency and scalability of such protocols. In our work, we describe secure schemes which utilize auxiliary channels in addition to that afforded by the open medium of radio. Such channels are often present in a human-centric pervasive ad-hoc networking scenario, though often neglected. We show that auxiliary channels can reduce public-key operations, reduce computational complexity, and strengthen security against an active adversary on the open channel, and against an eavesdropper on the auxiliary channels. Group key agreement protocols are usually often contextualized by their topology. We applied multi-channel schemes to different topologies, and found that the ideal topology may be different for different channels","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"289 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123105098","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}
M. McLaughlin, Roger Zimmermann, Leslie S. Liu, Younbo Jung, W. Peng, Seung A. Jin, J. Stewart, S. Yeh, Weirong Zhu, Beomjoo Seo
Rapid technological advances have changed how many existing tasks are performed. For example, the combination of virtual environments and the Internet is presenting a powerful opportunity in the area of medical training and rehabilitation. Here we present our design and preliminary experience with a telehaptic environment augmented with a voice conferencing system. Initial tests are encouraging and reveal the promise of our system
{"title":"Integrated voice and haptic support for tele-rehabilitation","authors":"M. McLaughlin, Roger Zimmermann, Leslie S. Liu, Younbo Jung, W. Peng, Seung A. Jin, J. Stewart, S. Yeh, Weirong Zhu, Beomjoo Seo","doi":"10.1109/PERCOMW.2006.68","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.68","url":null,"abstract":"Rapid technological advances have changed how many existing tasks are performed. For example, the combination of virtual environments and the Internet is presenting a powerful opportunity in the area of medical training and rehabilitation. Here we present our design and preliminary experience with a telehaptic environment augmented with a voice conferencing system. Initial tests are encouraging and reveal the promise of our system","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"64 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120990715","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-03-13DOI: 10.1109/PERCOMW.2006.112
Chunxiao Chigan, V. Oberoi
Wireless LANs will play a critical role in providing anywhere and anytime connectivity for ubiquitous telemedicine applications. This paper focuses on how to provide QoS over the wireless channel between the body sensor network (BSN) gateway and the wireless access points (e.g., wireless hotspots in various locations). In the telemedicine application, it usually requires the periodic data and the data related to the occurrence of emergencies to be reported to the remote health care in a timely manner. Unlike the traditional QoS techniques which support voice and data applications, the sporadic nature of the emergency data in telemedicine systems makes it nontrivial to provide sufficient QoS support. In this paper, we first investigated several alternative schemes for emergency QoS support in the telemedicine systems. An express dual channel (EDC) based QoS provisioning mechanism is then proposed. Not only is the proposed mechanism simple and resource efficient, but also it provides the minimum delay for the unpredictable emergency data transmission. Simulation results show the proposed EDC based solution provides satisfactory QoS for ubiquitous telemedicine applications
{"title":"Providing QoS in ubiquitous telemedicine networks","authors":"Chunxiao Chigan, V. Oberoi","doi":"10.1109/PERCOMW.2006.112","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.112","url":null,"abstract":"Wireless LANs will play a critical role in providing anywhere and anytime connectivity for ubiquitous telemedicine applications. This paper focuses on how to provide QoS over the wireless channel between the body sensor network (BSN) gateway and the wireless access points (e.g., wireless hotspots in various locations). In the telemedicine application, it usually requires the periodic data and the data related to the occurrence of emergencies to be reported to the remote health care in a timely manner. Unlike the traditional QoS techniques which support voice and data applications, the sporadic nature of the emergency data in telemedicine systems makes it nontrivial to provide sufficient QoS support. In this paper, we first investigated several alternative schemes for emergency QoS support in the telemedicine systems. An express dual channel (EDC) based QoS provisioning mechanism is then proposed. Not only is the proposed mechanism simple and resource efficient, but also it provides the minimum delay for the unpredictable emergency data transmission. Simulation results show the proposed EDC based solution provides satisfactory QoS for ubiquitous telemedicine applications","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122058992","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
扫码关注我们
求助内容：
应助结果提醒方式：