Pub Date : 2018-11-01DOI: 10.1109/COMNET.2018.8622180
Halima Bergaoui, Yosra Mlayah, F. Tlili, F. Rouissi
This paper investigates the optimization of the feedback information required by the adaptation of MIMO techniques in a large-scale environment. The main aim is to propose three optimization techniques and compare its BER performances in a 28 GHz system. It is shown that the reduction of the feedback amount leads to a BER increase. However the "keep" approach based method can guarantee near optimal BER performances while ensuring a remarkable feedback’s reduction.
{"title":"Optimization of a Scalable and Adaptable Diversity/Multiplexing Trade-Off in 28 GHz Systems","authors":"Halima Bergaoui, Yosra Mlayah, F. Tlili, F. Rouissi","doi":"10.1109/COMNET.2018.8622180","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622180","url":null,"abstract":"This paper investigates the optimization of the feedback information required by the adaptation of MIMO techniques in a large-scale environment. The main aim is to propose three optimization techniques and compare its BER performances in a 28 GHz system. It is shown that the reduction of the feedback amount leads to a BER increase. However the \"keep\" approach based method can guarantee near optimal BER performances while ensuring a remarkable feedback’s reduction.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122360806","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 : 2018-11-01DOI: 10.1109/COMNET.2018.8622292
M. W. Baidas, Zainab S. Bahbahani, E. Alsusa
In this paper, the problem of stable user-association and channel assignment in downlink multi-cell NOMA networks is studied. Specifically, the aim is to match network users to channels available at each base-station, while taking into account negative network externality resulting from inter-user interference. Specifically, a solution procedure to determine the optimal power allocation for proportional-fairness SINR-based maximization is devised, which is used to determine the preferences of different user sets over the available channels of each base-station, and the preferences of base-stations for each network user. After that, two centralized polynomial-time complexity stable matching algorithms based on the many-to-one student-project allocation matching problem are proposed to associate users with base-stations and assign channels to them. Simulation results are presented to validate the efficacy of the proposed algorithms, and compare them with a centralized joint user-association, channel assignment, and power allocation scheme, where it has been shown that the proposed algorithms yield comparable SINR per user as well as efficiently assign channels to cell-edge users, while achieving proportional-fairness.
{"title":"A Matching-Theoretic Approach to User-Association and Channel Assignment in Downlink Multi-Cell NOMA Networks","authors":"M. W. Baidas, Zainab S. Bahbahani, E. Alsusa","doi":"10.1109/COMNET.2018.8622292","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622292","url":null,"abstract":"In this paper, the problem of stable user-association and channel assignment in downlink multi-cell NOMA networks is studied. Specifically, the aim is to match network users to channels available at each base-station, while taking into account negative network externality resulting from inter-user interference. Specifically, a solution procedure to determine the optimal power allocation for proportional-fairness SINR-based maximization is devised, which is used to determine the preferences of different user sets over the available channels of each base-station, and the preferences of base-stations for each network user. After that, two centralized polynomial-time complexity stable matching algorithms based on the many-to-one student-project allocation matching problem are proposed to associate users with base-stations and assign channels to them. Simulation results are presented to validate the efficacy of the proposed algorithms, and compare them with a centralized joint user-association, channel assignment, and power allocation scheme, where it has been shown that the proposed algorithms yield comparable SINR per user as well as efficiently assign channels to cell-edge users, while achieving proportional-fairness.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130427999","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 : 2018-11-01DOI: 10.1109/COMNET.2018.8622296
Norhane Benkahla, B. Belgacem, M. Frikha
Our environment is getting smarter and smarter and we will reach billions of IoT devices. Being able to implement the IoT properly requires several challenges to take up. This is why the LPWAN technologies were recently introduced. Among many of LPWAN candidate, lora’s power efficiency and long rang features have made it of of the most important candidate for the IoT technology. The constraints of duty cycle limitation was studied in [1] where a shared duty cycle was proposed using different allocation strategies. In this paper, we propose to study the vulnerability of a proposed Enhanced LoRaWAN duty cycle that may turn into an attack: bit flipping and spoofing attack. We propose and evaluate a solution to guaranteed the security in a dynamic behavior of a duty cycle.
{"title":"Security analysis in Enhanced LoRaWAN duty cycle","authors":"Norhane Benkahla, B. Belgacem, M. Frikha","doi":"10.1109/COMNET.2018.8622296","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622296","url":null,"abstract":"Our environment is getting smarter and smarter and we will reach billions of IoT devices. Being able to implement the IoT properly requires several challenges to take up. This is why the LPWAN technologies were recently introduced. Among many of LPWAN candidate, lora’s power efficiency and long rang features have made it of of the most important candidate for the IoT technology. The constraints of duty cycle limitation was studied in [1] where a shared duty cycle was proposed using different allocation strategies. In this paper, we propose to study the vulnerability of a proposed Enhanced LoRaWAN duty cycle that may turn into an attack: bit flipping and spoofing attack. We propose and evaluate a solution to guaranteed the security in a dynamic behavior of a duty cycle.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123600425","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 : 2018-11-01DOI: 10.1109/comnet.2018.8622278
{"title":"ComNet 2018 Copyright Page","authors":"","doi":"10.1109/comnet.2018.8622278","DOIUrl":"https://doi.org/10.1109/comnet.2018.8622278","url":null,"abstract":"","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116840924","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 : 2018-11-01DOI: 10.1109/COMNET.2018.8622294
Mohanad Obeed, A. Salhab, Mohamed-Slim Alouini, S. Zummo
As the existing radio-frequency (RF) networks cannot meet the ever-increasing data rate demand, the optical wireless communication (OWC), which uses a wide untapped unregulated spectrum, has been proposed as a promising technology to overcome the RF spectrum limitations. On the other hand, with the increasing demand for high data rate and the prevalence of the broadcast-nature networks, researchers have recently come up with new mechanisms to improve secure communication using physical layer techniques. Compared to RF networks, the OWC networks are more secure and less susceptible to the interception because of the small coverage provided by LEDs, and because they work properly only in the presence of the line-of-sight (LoS) components. However, the security in OWC networks is still an issue, especially in visible light communication (VLC) when the transmitted information can be accessed by multiple users as in public areas, meeting rooms, laboratories, and libraries. That means potential eavesdroppers may be existing to gather confidential messages. This paper reviews all the conducted work on physical layer security (PLS) in two types of OWC networks, which are the VLC and free space optical (FSO) networks. Furthermore, the paper proposes several open problems in these networks to optimize and enhance the security performance.
{"title":"Survey on Physical Layer Security in Optical Wireless Communication Systems","authors":"Mohanad Obeed, A. Salhab, Mohamed-Slim Alouini, S. Zummo","doi":"10.1109/COMNET.2018.8622294","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622294","url":null,"abstract":"As the existing radio-frequency (RF) networks cannot meet the ever-increasing data rate demand, the optical wireless communication (OWC), which uses a wide untapped unregulated spectrum, has been proposed as a promising technology to overcome the RF spectrum limitations. On the other hand, with the increasing demand for high data rate and the prevalence of the broadcast-nature networks, researchers have recently come up with new mechanisms to improve secure communication using physical layer techniques. Compared to RF networks, the OWC networks are more secure and less susceptible to the interception because of the small coverage provided by LEDs, and because they work properly only in the presence of the line-of-sight (LoS) components. However, the security in OWC networks is still an issue, especially in visible light communication (VLC) when the transmitted information can be accessed by multiple users as in public areas, meeting rooms, laboratories, and libraries. That means potential eavesdroppers may be existing to gather confidential messages. This paper reviews all the conducted work on physical layer security (PLS) in two types of OWC networks, which are the VLC and free space optical (FSO) networks. Furthermore, the paper proposes several open problems in these networks to optimize and enhance the security performance.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127273772","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 : 2018-11-01DOI: 10.1109/COMNET.2018.8622167
Maroua Ben Gharbia, R. Bouallègue
Nowadays the deployment of Femtocell as the emerging wireless technology becomes a promising solution to improve indoor coverage and system capacity and lower transmit power. However, Femtocells deployment may cause the unnecessary Handover due to the movement of the UE. As Femtocells coverage area is very small, there are many targets Femtocells. In this paper, we propose a new Handover decision algorithm between Femtocell and Macrocell for LTE (Long Term Evolution) network based on multiple parameters instead of some parameters as in the vertical Handover algorithm. The proposed algorithm can avoid unnecessary Handover and reduce number of Handover. Simulation results show that the system performance has been improved for medium and high UE’s speed.
目前，Femtocell作为一种新兴的无线技术，在提高室内覆盖、提高系统容量、降低发射功率等方面已成为一种很有前景的解决方案。但是，部署Femtocells可能会由于终端的移动而导致不必要的切换。由于飞蜂窝的覆盖面积很小，因此目标多。本文提出了一种新的LTE (Long Term Evolution)网络中基于多个参数的Femtocell和Macrocell切换决策算法，而不是垂直切换算法中的某些参数。该算法可以避免不必要的切换，减少切换次数。仿真结果表明，在中高UE速度下，系统性能得到了改善。
{"title":"Handover Decision Algorithm in Femtocell Long Term Evolution Networks","authors":"Maroua Ben Gharbia, R. Bouallègue","doi":"10.1109/COMNET.2018.8622167","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622167","url":null,"abstract":"Nowadays the deployment of Femtocell as the emerging wireless technology becomes a promising solution to improve indoor coverage and system capacity and lower transmit power. However, Femtocells deployment may cause the unnecessary Handover due to the movement of the UE. As Femtocells coverage area is very small, there are many targets Femtocells. In this paper, we propose a new Handover decision algorithm between Femtocell and Macrocell for LTE (Long Term Evolution) network based on multiple parameters instead of some parameters as in the vertical Handover algorithm. The proposed algorithm can avoid unnecessary Handover and reduce number of Handover. Simulation results show that the system performance has been improved for medium and high UE’s speed.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130470893","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 : 2018-11-01DOI: 10.1109/COMNET.2018.8622179
Armielle Noulapeu Ngaffo, Walid El Ayeb, Z. Choukair
The increasing number of services gives the telecommunication operators a great opportunity to fulfil the demand of their subscribers. Indeed, since various practically comparative services are promptly accessible, to offer a service that is relevant to the subscriber is at the centre of the operator's concerns. This is the case of IMS (IP Multimedia Subsystem), which is this platform that effectively allows access to a range of varied services regardless of the underlying access networks. By this way, to offer services fitting the needs of the subscriber within the IMS remains a challenging issue. The service discovery approach by exploiting only the information associated with the user's profile has poor performance when the usage history of the target subscriber is not provided. This restricts the relevance of the proposed service. Therefore, in addition to the information associated with the target subscriber's profile, we are interested in the information associated with the profiles of other subscribers similar to that of the target subscriber to improve the accuracy of the service targeting. In this paper we present a collaborative approach applied to service discovery that is based on taking into account the degree of satisfaction of the user. By the end we demonstrate through our results a clear improvement in service targeting accuracy.
{"title":"IMS Predictive Collaborative Service Discovery Approach","authors":"Armielle Noulapeu Ngaffo, Walid El Ayeb, Z. Choukair","doi":"10.1109/COMNET.2018.8622179","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622179","url":null,"abstract":"The increasing number of services gives the telecommunication operators a great opportunity to fulfil the demand of their subscribers. Indeed, since various practically comparative services are promptly accessible, to offer a service that is relevant to the subscriber is at the centre of the operator's concerns. This is the case of IMS (IP Multimedia Subsystem), which is this platform that effectively allows access to a range of varied services regardless of the underlying access networks. By this way, to offer services fitting the needs of the subscriber within the IMS remains a challenging issue. The service discovery approach by exploiting only the information associated with the user's profile has poor performance when the usage history of the target subscriber is not provided. This restricts the relevance of the proposed service. Therefore, in addition to the information associated with the target subscriber's profile, we are interested in the information associated with the profiles of other subscribers similar to that of the target subscriber to improve the accuracy of the service targeting. In this paper we present a collaborative approach applied to service discovery that is based on taking into account the degree of satisfaction of the user. By the end we demonstrate through our results a clear improvement in service targeting accuracy.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129677182","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 : 2018-11-01DOI: 10.1109/COMNET.2018.8622132
Inès Kechiche, Inès Bousnina, A. Samet
RPL is an IPv6 routing protocol for Low-Power and Lossy Networks (LLNs) designed by the ROLL working group to fit challenging routing requirements of LLNS network. RPL relies on Objective Function (OF) to select best parents and then construct paths. Considering the vast areas of applications for RPL, the routing protocol was designed with a great deal of flexibility. In fact RPL does not specify any particular routing metric/constraint to be used for DAG rank computation. In this paper, we give an overview of the different approaches considered to optimize RPL OF and classify them. More specifically, we specify which metrics are considered for OF enhancement and optimal parent selection. After a comparative study, we finally discuss the proposed enhancement schemes and highlight some limitations of the existing strategies.
{"title":"An Overview on RPL Objective Function Enhancement Approaches","authors":"Inès Kechiche, Inès Bousnina, A. Samet","doi":"10.1109/COMNET.2018.8622132","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622132","url":null,"abstract":"RPL is an IPv6 routing protocol for Low-Power and Lossy Networks (LLNs) designed by the ROLL working group to fit challenging routing requirements of LLNS network. RPL relies on Objective Function (OF) to select best parents and then construct paths. Considering the vast areas of applications for RPL, the routing protocol was designed with a great deal of flexibility. In fact RPL does not specify any particular routing metric/constraint to be used for DAG rank computation. In this paper, we give an overview of the different approaches considered to optimize RPL OF and classify them. More specifically, we specify which metrics are considered for OF enhancement and optimal parent selection. After a comparative study, we finally discuss the proposed enhancement schemes and highlight some limitations of the existing strategies.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127916591","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 : 2018-11-01DOI: 10.1109/COMNET.2018.8621921
Amira Kchaou, Ryma Abassi, S. Fatmi
Vehicular communications are expected to share different kinds of information between vehicles. However, the presence of dishonest vehicles in the route may lead to the drop or modification of the content of the exchanged messages. Thus, it is a challenge to find and maintain an efficient route for transmitting reliable information.In this paper, we propose a new routing protocol for Vehicular Ad-hoc NETworks (VANETs) based on trust. This protocol uses the trustworthiness of the path and the number of hops in order to find the optimal route.
{"title":"A New Trust based Routing Protocol for VANETs","authors":"Amira Kchaou, Ryma Abassi, S. Fatmi","doi":"10.1109/COMNET.2018.8621921","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8621921","url":null,"abstract":"Vehicular communications are expected to share different kinds of information between vehicles. However, the presence of dishonest vehicles in the route may lead to the drop or modification of the content of the exchanged messages. Thus, it is a challenge to find and maintain an efficient route for transmitting reliable information.In this paper, we propose a new routing protocol for Vehicular Ad-hoc NETworks (VANETs) based on trust. This protocol uses the trustworthiness of the path and the number of hops in order to find the optimal route.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128017782","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 : 2018-11-01DOI: 10.1109/comnet.2018.8621944
Sirine Sayadi, S. Rejeb, Z. Choukair
With the increasing number of connected devices and the number of online transactions today, managing all these transactions and devices and maintaining network security is a research issue. Current solutions are mainly based on cloud computing infrastructures, which require servers high-end and broadband networks to provide data storage and computing services. These solutions have a number of significant disadvantages, such as high maintenance costs of centralized servers, critical weakness of Internet Of Things applications, security and trust issues, etc. The blockchain is seen as a promising technique for addressing the mentioned security issues and design new decentralization frameworks. However, this new technology has a great potential in the most diverse technological fields. In this paper, we focus on presenting an overview of blockchain technology, highlighting its advantages, limitations and areas of application.The originality of this work resides in the comparison between the different blockchain systems and their security schemes and the perspective of integrating this technology into secured systems models for our comfort and our private life.
{"title":"Blockchain Challenges and Security Schemes: A Survey","authors":"Sirine Sayadi, S. Rejeb, Z. Choukair","doi":"10.1109/comnet.2018.8621944","DOIUrl":"https://doi.org/10.1109/comnet.2018.8621944","url":null,"abstract":"With the increasing number of connected devices and the number of online transactions today, managing all these transactions and devices and maintaining network security is a research issue. Current solutions are mainly based on cloud computing infrastructures, which require servers high-end and broadband networks to provide data storage and computing services. These solutions have a number of significant disadvantages, such as high maintenance costs of centralized servers, critical weakness of Internet Of Things applications, security and trust issues, etc. The blockchain is seen as a promising technique for addressing the mentioned security issues and design new decentralization frameworks. However, this new technology has a great potential in the most diverse technological fields. In this paper, we focus on presenting an overview of blockchain technology, highlighting its advantages, limitations and areas of application.The originality of this work resides in the comparison between the different blockchain systems and their security schemes and the perspective of integrating this technology into secured systems models for our comfort and our private life.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123489214","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
扫码关注我们
求助内容：
应助结果提醒方式：