Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784933
Soyoung Hwang, Gwangja Jin, Changsub Shin, Bongsoo Kim
Many routing protocols have been proposed for sensor networks where energy awareness and reliability are essential design issues. This paper proposes an energy-aware data gathering method called Energy-aware Tree Routing (ETR) in Wireless Sensor Networks. The proposed scheme relates to reliable and energy efficient data routing by selecting a data transmission path in consideration of residual energy at each node to disperse energy consumption across the networks and reliably transmit the data through a detour path when there is link or node failure. Simulation results show that the proposed method outperformed traditional Tree Routing (TR) by 23%∼55% in network lifetime.
{"title":"Energy-Aware Data Gathering in Wireless Sensor Networks","authors":"Soyoung Hwang, Gwangja Jin, Changsub Shin, Bongsoo Kim","doi":"10.1109/CCNC.2009.4784933","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784933","url":null,"abstract":"Many routing protocols have been proposed for sensor networks where energy awareness and reliability are essential design issues. This paper proposes an energy-aware data gathering method called Energy-aware Tree Routing (ETR) in Wireless Sensor Networks. The proposed scheme relates to reliable and energy efficient data routing by selecting a data transmission path in consideration of residual energy at each node to disperse energy consumption across the networks and reliably transmit the data through a detour path when there is link or node failure. Simulation results show that the proposed method outperformed traditional Tree Routing (TR) by 23%∼55% in network lifetime.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122711675","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-01-11DOI: 10.1109/CCNC.2009.4784826
Christophe Domingues, S. Otmane, F. Davesne, M. Mallem, L. Benchikh
Augmented Reality (AR) can provide to a Human Operator (HO) a real help to achieve complex tasks, such as remote control of robots and cooperative teleassistance. Using appropriate augmentations, the HO can interact faster, safer and easier with the remote real world. In this paper, we present an extension of an existing distributed software and network architecture for collaborative teleoperation based on networked human-scaled mixed reality and mobile platform. The first teleoperation system was composed by a VR application and a Web application. However the 2 systems cannot be used together and it is impossible to control a distant robot simultaneously. Our goal is to update the teleoperation system to permit a heterogeneous collaborative teleoperation between the 2 platforms. An important feature of this interface is based on the use of different Virtual Reality platforms and different Mobile platforms to control one or many robots. The first aim with this work is to develop collaborative robot teaching with the use of virtual or real robot.
{"title":"A Distributed Architecture for Collaborative Teleoperation using Virtual Reality and Web Platforms","authors":"Christophe Domingues, S. Otmane, F. Davesne, M. Mallem, L. Benchikh","doi":"10.1109/CCNC.2009.4784826","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784826","url":null,"abstract":"Augmented Reality (AR) can provide to a Human Operator (HO) a real help to achieve complex tasks, such as remote control of robots and cooperative teleassistance. Using appropriate augmentations, the HO can interact faster, safer and easier with the remote real world. In this paper, we present an extension of an existing distributed software and network architecture for collaborative teleoperation based on networked human-scaled mixed reality and mobile platform. The first teleoperation system was composed by a VR application and a Web application. However the 2 systems cannot be used together and it is impossible to control a distant robot simultaneously. Our goal is to update the teleoperation system to permit a heterogeneous collaborative teleoperation between the 2 platforms. An important feature of this interface is based on the use of different Virtual Reality platforms and different Mobile platforms to control one or many robots. The first aim with this work is to develop collaborative robot teaching with the use of virtual or real robot.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122523257","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-01-11DOI: 10.1109/CCNC.2009.4784735
W. Syafei, R. Yohena, H. Shimajiri, T. Yoshida, M. Kurosaki, Y. Nagao, B. Sai, H. Ochi
This paper presents our investigation on performance enhancement due to the implementation of low density parity check (LDPC) codes on IEEE 802.11n system and its Application Specific Integrated Circuit design. Simulation result shows that in higher coding rate, LDPC codes gives 6 dB better performance compared to binary convolutional codes. Logic synthesis is succesfully done on 0.13 µm CMOS technology with low-power standard cell library.
本文介绍了在IEEE 802.11n系统上实施低密度奇偶校验(LDPC)码所带来的性能提升及其专用集成电路设计。仿真结果表明，在较高的编码率下，LDPC码比二进制卷积码的性能提高了6 dB。采用低功耗标准单元库，在0.13 μ m CMOS技术上成功完成了逻辑合成。
{"title":"Performance Evaluation and ASIC Design of LDPC Decoder for IEEE802.11n","authors":"W. Syafei, R. Yohena, H. Shimajiri, T. Yoshida, M. Kurosaki, Y. Nagao, B. Sai, H. Ochi","doi":"10.1109/CCNC.2009.4784735","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784735","url":null,"abstract":"This paper presents our investigation on performance enhancement due to the implementation of low density parity check (LDPC) codes on IEEE 802.11n system and its Application Specific Integrated Circuit design. Simulation result shows that in higher coding rate, LDPC codes gives 6 dB better performance compared to binary convolutional codes. Logic synthesis is succesfully done on 0.13 µm CMOS technology with low-power standard cell library.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122981740","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-01-11DOI: 10.1109/CCNC.2009.4784990
L. X. Hung, R. Shaikh, Hassan Jameel, S. K. Raazi, Weiwei Yuan, N. T. Canh, P. Truc, Sungyoung Lee, Heejo Lee, Yuseung Son, Miguel Fernandes
Recent research on ubiquitous computing has introduced a new concept of activity-based computing as a way of thinking about supporting human activities in ubiquitous computing environment. Existing access control approaches such as RBAC, became inappropriate to support this concept because they do not consider human activities. In this paper, we propose Activity-Oriented Access Control (AOAC) model, aiming to support user's activity in ubiquitous environments. We have designed and implemented our initial AOAC system. We also built up a simple scenario in order to illustrate how it supports user activities. The results have shown that AOAC meets our objectives. Also, AOAC it takes approximately 0.26 second to give a response which proves that AOAC is suitable to work in real-time environments.
{"title":"Activity-Oriented Access Control for Ubiquitous Environments","authors":"L. X. Hung, R. Shaikh, Hassan Jameel, S. K. Raazi, Weiwei Yuan, N. T. Canh, P. Truc, Sungyoung Lee, Heejo Lee, Yuseung Son, Miguel Fernandes","doi":"10.1109/CCNC.2009.4784990","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784990","url":null,"abstract":"Recent research on ubiquitous computing has introduced a new concept of activity-based computing as a way of thinking about supporting human activities in ubiquitous computing environment. Existing access control approaches such as RBAC, became inappropriate to support this concept because they do not consider human activities. In this paper, we propose Activity-Oriented Access Control (AOAC) model, aiming to support user's activity in ubiquitous environments. We have designed and implemented our initial AOAC system. We also built up a simple scenario in order to illustrate how it supports user activities. The results have shown that AOAC meets our objectives. Also, AOAC it takes approximately 0.26 second to give a response which proves that AOAC is suitable to work in real-time environments.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114250350","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-01-11DOI: 10.1109/CCNC.2009.4784720
Il-Woo Lee, Ho-Jin Park, Kwang-Roh Park
We designed and developed a virtual home platform based on peer-to-peer (P2P) based networking service. Also, we designed a P2P based social networking service method and apparatus capable of appropriately providing a social networking service under P2P environments. This paper proposed a method for easily providing a social networking service, which will be used as an Application Programming Interface (API) on the basis of a universal P2P platform irrelevant to application characteristics.
{"title":"Service Platform and Social Networking Service Based on Peer-to-Peer Networking","authors":"Il-Woo Lee, Ho-Jin Park, Kwang-Roh Park","doi":"10.1109/CCNC.2009.4784720","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784720","url":null,"abstract":"We designed and developed a virtual home platform based on peer-to-peer (P2P) based networking service. Also, we designed a P2P based social networking service method and apparatus capable of appropriately providing a social networking service under P2P environments. This paper proposed a method for easily providing a social networking service, which will be used as an Application Programming Interface (API) on the basis of a universal P2P platform irrelevant to application characteristics.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114271934","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-01-11DOI: 10.1109/CCNC.2009.4784897
N. Sato, T. Fujii
In this paper, we propose a novel multi-antenna utilization scheme for avoiding the packet congestion around the gateway (GW) of the ad-hoc wireless networks. In our previous work, we have discussed the number of antenna design for suitable for packet congestion around the GW. However, only multi-user access with multi-antenna is considered at the receiver node. Moreover, we do not consider the effective media access control (MAC) protocol for this kind of networks. In this paper, in order to realize the effective multi-packet access ad-hoc wireless networks, we consider applying multi-input multi-output (MIMO) technique for packet transmission to the next hop node, and we also propose a MAC protocol avoiding the hidden node problem for supporting the multi-packet access with multi-antenna at the nodes around the GW.
{"title":"A MAC Protocol for Multi-Packet Ad-Hoc Wireless Network Utilizing Multi-Antenna","authors":"N. Sato, T. Fujii","doi":"10.1109/CCNC.2009.4784897","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784897","url":null,"abstract":"In this paper, we propose a novel multi-antenna utilization scheme for avoiding the packet congestion around the gateway (GW) of the ad-hoc wireless networks. In our previous work, we have discussed the number of antenna design for suitable for packet congestion around the GW. However, only multi-user access with multi-antenna is considered at the receiver node. Moreover, we do not consider the effective media access control (MAC) protocol for this kind of networks. In this paper, in order to realize the effective multi-packet access ad-hoc wireless networks, we consider applying multi-input multi-output (MIMO) technique for packet transmission to the next hop node, and we also propose a MAC protocol avoiding the hidden node problem for supporting the multi-packet access with multi-antenna at the nodes around the GW.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114293639","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-01-11DOI: 10.1109/CCNC.2009.4784764
A. Ouali, B. Kerhervé, B. Jaumard
Several recent P2P streaming systems have adopted mesh overlays to disseminate content to participating peers because this topology appears to be more resilient to churns. To cope with inferred problems, such as data redundancy, these systems opt for data-driven content retrieval mechanisms (pull mechanisms). Each node has a list of neighbors with whom it periodically exchanges buffer information and requests content fragments. One of the drawbacks of such a mechanism is that it does not offer intelligent selection of sending neighbors based on their characteristics. This is mainly because the most important criteria used to select nodes is the content availability. This can result in some performance degradation, for instance, due to peers that are sending very small or big parts of the needed data. Resiliency may then be weakened and overhead increased. In this paper we propose to study how the integration of some end nodes characteristics can improve the performance of a typical pull mechanism with random scheduling. We show that the improvement in performance is significant enough despite the fact that the room for improvement is bounded by the limitations of the pull mechanism. Hence we believe that the awareness of end characteristics is an important block upon which we can build more efficient content retrieval mechanisms. The gain in performance can also be amplified by proposing an alternative to the pull mechanism such as a combined pull-push approach.
{"title":"Toward Improving Scheduling Strategies in Pull-Based Live P2P Streaming Systems","authors":"A. Ouali, B. Kerhervé, B. Jaumard","doi":"10.1109/CCNC.2009.4784764","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784764","url":null,"abstract":"Several recent P2P streaming systems have adopted mesh overlays to disseminate content to participating peers because this topology appears to be more resilient to churns. To cope with inferred problems, such as data redundancy, these systems opt for data-driven content retrieval mechanisms (pull mechanisms). Each node has a list of neighbors with whom it periodically exchanges buffer information and requests content fragments. One of the drawbacks of such a mechanism is that it does not offer intelligent selection of sending neighbors based on their characteristics. This is mainly because the most important criteria used to select nodes is the content availability. This can result in some performance degradation, for instance, due to peers that are sending very small or big parts of the needed data. Resiliency may then be weakened and overhead increased. \u0000 \u0000In this paper we propose to study how the integration of some end nodes characteristics can improve the performance of a typical pull mechanism with random scheduling. We show that the improvement in performance is significant enough despite the fact that the room for improvement is bounded by the limitations of the pull mechanism. Hence we believe that the awareness of end characteristics is an important block upon which we can build more efficient content retrieval mechanisms. The gain in performance can also be amplified by proposing an alternative to the pull mechanism such as a combined pull-push approach.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121894310","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-01-11DOI: 10.1109/CCNC.2009.4784947
Behnam Hassanabadi, Le Zhang, S. Valaee
In this paper we propose a new class of repetition-based MAC protocols for Vehicular Ad-hoc Networks. The design can be used for safety applications and position information dissemination. An erasure broadcast channel is considered in which several vehicles are in a cluster and each vehicle attempts to send its own safety message to all other vehicles. A distributed feedback mechanism has been introduced to propagate the network transmission and reception information throughout the network. Based on the feedback information, a packet coding algorithm, inspired by index coding, is proposed to efficiently reduce the number of transmissions and contentions. Simulations show that the proposed protocol yields a greater average probability of successful transmission.
{"title":"Index Coded Repetition-Based MAC in Vehicular Ad-Hoc Networks","authors":"Behnam Hassanabadi, Le Zhang, S. Valaee","doi":"10.1109/CCNC.2009.4784947","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784947","url":null,"abstract":"In this paper we propose a new class of repetition-based MAC protocols for Vehicular Ad-hoc Networks. The design can be used for safety applications and position information dissemination. An erasure broadcast channel is considered in which several vehicles are in a cluster and each vehicle attempts to send its own safety message to all other vehicles. A distributed feedback mechanism has been introduced to propagate the network transmission and reception information throughout the network. Based on the feedback information, a packet coding algorithm, inspired by index coding, is proposed to efficiently reduce the number of transmissions and contentions. Simulations show that the proposed protocol yields a greater average probability of successful transmission.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129625074","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-01-11DOI: 10.1109/CCNC.2009.4785019
M. Kolberg, Michael Wilson, Martin Blunn, E. Magill, P. Burtwistle
P2P applications are increasingly popular. Unlike traditional client-server applications they do not require central server resources. This makes them less costly to host and maintain. While there have been a large number of P2P applications developed for PC based systems, there are only very few for mobile appliances, such as mobile phones or networked PDAs. Furthermore, there are even fewer applications which operate successfully on the public mobile data network (GPRS, 3G), rather than WiFi. This is largely due to the difficulties posed by the restrictive data access to mobile devices (NATs, Firewalls by the network operators) and traditionally high charges for data communications. Recently, the latter point has been virtually removed by the introduction of flat-rate data packages by the operators. This paper (and demo) present a framework and applications based on a structured P2P overlay network which can successfully operate on the public data network.
{"title":"A Framework for Mobile Applications Based on a Structured P2P Overlay","authors":"M. Kolberg, Michael Wilson, Martin Blunn, E. Magill, P. Burtwistle","doi":"10.1109/CCNC.2009.4785019","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4785019","url":null,"abstract":"P2P applications are increasingly popular. Unlike traditional client-server applications they do not require central server resources. This makes them less costly to host and maintain. While there have been a large number of P2P applications developed for PC based systems, there are only very few for mobile appliances, such as mobile phones or networked PDAs. Furthermore, there are even fewer applications which operate successfully on the public mobile data network (GPRS, 3G), rather than WiFi. This is largely due to the difficulties posed by the restrictive data access to mobile devices (NATs, Firewalls by the network operators) and traditionally high charges for data communications. Recently, the latter point has been virtually removed by the introduction of flat-rate data packages by the operators. This paper (and demo) present a framework and applications based on a structured P2P overlay network which can successfully operate on the public data network.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129811638","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-01-11DOI: 10.1109/CCNC.2009.4784755
A. Inoie, M. Ishizaka
The audio quality provided by some simple FEC schemes is studied. We deal with an M/M/1/K queueing model and assume that some of packets are lost due to noise or interference in the transmission as well as buffer overflow in the router. We consider the following two schemes: One is the Fixed/Variable Scheme that fixes the volume of original data and varies the volume of redundant data in a packet, and the other is Variable/Fixed Scheme that varies the volume of original data and fixed the volume of the whole data. We showed the cases where the Fixed/Variable Scheme improves the audio quality of the system.
{"title":"The Effect of Transmission Error on Audio Quality for Simple FEC Schemes","authors":"A. Inoie, M. Ishizaka","doi":"10.1109/CCNC.2009.4784755","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784755","url":null,"abstract":"The audio quality provided by some simple FEC schemes is studied. We deal with an M/M/1/K queueing model and assume that some of packets are lost due to noise or interference in the transmission as well as buffer overflow in the router. We consider the following two schemes: One is the Fixed/Variable Scheme that fixes the volume of original data and varies the volume of redundant data in a packet, and the other is Variable/Fixed Scheme that varies the volume of original data and fixed the volume of the whole data. We showed the cases where the Fixed/Variable Scheme improves the audio quality of the system.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128580622","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
扫码关注我们
求助内容：
应助结果提醒方式：