Pub Date : 2019-10-01DOI: 10.1109/wincom47513.2019.8942438
T. Chanyour, Youssef Hmimz, Mohamed El Ghmary, M. Malki
Mobile Edge Computing (MEC) is a promising new technology that offers new opportunities for energy consumption optimization, privacy preservation, and network traffic bottlenecks” reduction. Besides, MEC-based computation tasks offloading can achieve lower latencies and energy consumption. However, with the multi-task multi-user setting, the offloading decisions become hard and critical. Indeed, the communication and processing resources as well as the resulting processing delays and the consumed energies have to be carefully considered. In this paper, we consider a multi-policy offloading scenario where each mobile device holds a list of heavy tasks. Each task is further characterized by its proper processing deadline. Therefore, we designed the corresponding optimization problem that minimizes a weighted-sum function that jointly considers energy consumption, processing delays, and the unsatisfied tasks' workloads. Due to the short decision time constraint in the studied system and the NP-hardness of the obtained problem, we decomposed it using two sub-problems. Then, we proposed a solution to each sub-problem. With the aim of evaluating these solutions., we performed a set of simulation experiments to compare their performance with relevant state of the art method. Finally., the obtained execution times are very satisfactory for moderate number of tasks.
{"title":"Multi-policy Aware Offloading with Per-task Delay for Mobile Edge Computing Networks","authors":"T. Chanyour, Youssef Hmimz, Mohamed El Ghmary, M. Malki","doi":"10.1109/wincom47513.2019.8942438","DOIUrl":"https://doi.org/10.1109/wincom47513.2019.8942438","url":null,"abstract":"Mobile Edge Computing (MEC) is a promising new technology that offers new opportunities for energy consumption optimization, privacy preservation, and network traffic bottlenecks” reduction. Besides, MEC-based computation tasks offloading can achieve lower latencies and energy consumption. However, with the multi-task multi-user setting, the offloading decisions become hard and critical. Indeed, the communication and processing resources as well as the resulting processing delays and the consumed energies have to be carefully considered. In this paper, we consider a multi-policy offloading scenario where each mobile device holds a list of heavy tasks. Each task is further characterized by its proper processing deadline. Therefore, we designed the corresponding optimization problem that minimizes a weighted-sum function that jointly considers energy consumption, processing delays, and the unsatisfied tasks' workloads. Due to the short decision time constraint in the studied system and the NP-hardness of the obtained problem, we decomposed it using two sub-problems. Then, we proposed a solution to each sub-problem. With the aim of evaluating these solutions., we performed a set of simulation experiments to compare their performance with relevant state of the art method. Finally., the obtained execution times are very satisfactory for moderate number of tasks.","PeriodicalId":222207,"journal":{"name":"2019 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129817193","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 : 2019-10-01DOI: 10.1109/wincom47513.2019.8942448
M. Knitter, A. Wulf
Over the last decades a lot of metrics for spectrum efficiency have been developed. Most are defined in the context of a specific application area and seldom take the spatial dimension of the spectrum into account. This paper surveys key metrics from literature and discusses their potential usage for modern wireless networks. A new spectrum efficiency metric, the spatial efficiency, is introduced to cover single- and multi-link scenarios in wireless local area networks. The metric is based on the usage of shared resources and incorporates the spatial dimension as a key driving factor for efficiency. Based on general aspects of communication-, antenna- and information theory, the metric is widely system independent. Furthermore, an IEEE 802.11ax application case is presented to show the usage of the metric. A general limitation on communication capacity across a given spatial volume is discussed in the appendix.
{"title":"Spatial Efficiency Metric for Wireless Networks Based on Channel Resource Usage","authors":"M. Knitter, A. Wulf","doi":"10.1109/wincom47513.2019.8942448","DOIUrl":"https://doi.org/10.1109/wincom47513.2019.8942448","url":null,"abstract":"Over the last decades a lot of metrics for spectrum efficiency have been developed. Most are defined in the context of a specific application area and seldom take the spatial dimension of the spectrum into account. This paper surveys key metrics from literature and discusses their potential usage for modern wireless networks. A new spectrum efficiency metric, the spatial efficiency, is introduced to cover single- and multi-link scenarios in wireless local area networks. The metric is based on the usage of shared resources and incorporates the spatial dimension as a key driving factor for efficiency. Based on general aspects of communication-, antenna- and information theory, the metric is widely system independent. Furthermore, an IEEE 802.11ax application case is presented to show the usage of the metric. A general limitation on communication capacity across a given spatial volume is discussed in the appendix.","PeriodicalId":222207,"journal":{"name":"2019 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114898083","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 : 2019-10-01DOI: 10.1109/wincom47513.2019.8942527
A. Zaidi, W. A. Awan, A. Baghdad, Niamat Hussain, A. Ballouk, A. Badri
The presented paper is a “T” shaped compact size wideband antenna., dedicated for E-band applications. The bandwidth of the proposed design ranges from 60.89 GHz to 79.16GHz (18.27 GHz), with a return loss equal to −38.3dB at the central frequency. The antenna is characterized by an adequate gain and a good efficiency, making it a strong candidate at this portion of spectrum. The design of the proposed model is carried out using the electromagnetic simulator HFSSv16 based on finite elements method.
{"title":"Compact Size T-Shaped Patch Antenna for E-Band Applications","authors":"A. Zaidi, W. A. Awan, A. Baghdad, Niamat Hussain, A. Ballouk, A. Badri","doi":"10.1109/wincom47513.2019.8942527","DOIUrl":"https://doi.org/10.1109/wincom47513.2019.8942527","url":null,"abstract":"The presented paper is a “T” shaped compact size wideband antenna., dedicated for E-band applications. The bandwidth of the proposed design ranges from 60.89 GHz to 79.16GHz (18.27 GHz), with a return loss equal to −38.3dB at the central frequency. The antenna is characterized by an adequate gain and a good efficiency, making it a strong candidate at this portion of spectrum. The design of the proposed model is carried out using the electromagnetic simulator HFSSv16 based on finite elements method.","PeriodicalId":222207,"journal":{"name":"2019 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116466900","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 : 2019-10-01DOI: 10.1109/wincom47513.2019.8942491
Charifa Laghridat, I. Mounir, M. Essalih
Topological index is the graph invariant number calculated from a graph representing a network offering an effective way to measure network branching and network similarity. In this paper, we will discuss the use of topological indices in the analysis of social networks by applying the new formula of the degree distance index on types of social networks such as Fan, Crystal, Double Crystal” Butterfly and Sunflower.
{"title":"Analyzing Friendship's Social Networks Using The Topological Indices","authors":"Charifa Laghridat, I. Mounir, M. Essalih","doi":"10.1109/wincom47513.2019.8942491","DOIUrl":"https://doi.org/10.1109/wincom47513.2019.8942491","url":null,"abstract":"Topological index is the graph invariant number calculated from a graph representing a network offering an effective way to measure network branching and network similarity. In this paper, we will discuss the use of topological indices in the analysis of social networks by applying the new formula of the degree distance index on types of social networks such as Fan, Crystal, Double Crystal” Butterfly and Sunflower.","PeriodicalId":222207,"journal":{"name":"2019 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132120053","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 : 2019-10-01DOI: 10.1109/wincom47513.2019.8942485
Mohamed EL Amrani, Hamid Garmani, Driss Ait Omar, Mohamed Baslam, B. Minaoui
Normally, the full use of the network can not be done when we opened a single connection, this can be noticed especially when the quality of the network is not good. The paper aims to maximize the transmission capacity of the mobile applications while guaranteeing the stability of the hole system in presence of an incomplete informations. We formulate a Bayesian game to the network resource allocation problem under the selfish behaviour of mobile applications with multiple connections to a several available network interfaces simultaneously. The maximum data transfer rate for a network interface is private information and is considered as the type of the player(mobile application). The mobile application choses the number of concurrent connections to maximize its own profit. Based on the number of concurrent connections, the mobile applications decide the strategies to maximize their payoffs defined as the difference between the transmission capacity and the connection maintenance cost. After showing the existence and uniqueness of equilibrium in terms of number of concurrent connections, we analyze the impact of interactions between applications on the data transfer rate. We also validated our theoretical study with numerical results, which show that the non-cooperative game has an Bayesian Nash equilibrium (BNE) point which depends on all parameters of the system.
{"title":"Mobile Applications: A Bayesian Game Approach to Optimize Transmission Strategies","authors":"Mohamed EL Amrani, Hamid Garmani, Driss Ait Omar, Mohamed Baslam, B. Minaoui","doi":"10.1109/wincom47513.2019.8942485","DOIUrl":"https://doi.org/10.1109/wincom47513.2019.8942485","url":null,"abstract":"Normally, the full use of the network can not be done when we opened a single connection, this can be noticed especially when the quality of the network is not good. The paper aims to maximize the transmission capacity of the mobile applications while guaranteeing the stability of the hole system in presence of an incomplete informations. We formulate a Bayesian game to the network resource allocation problem under the selfish behaviour of mobile applications with multiple connections to a several available network interfaces simultaneously. The maximum data transfer rate for a network interface is private information and is considered as the type of the player(mobile application). The mobile application choses the number of concurrent connections to maximize its own profit. Based on the number of concurrent connections, the mobile applications decide the strategies to maximize their payoffs defined as the difference between the transmission capacity and the connection maintenance cost. After showing the existence and uniqueness of equilibrium in terms of number of concurrent connections, we analyze the impact of interactions between applications on the data transfer rate. We also validated our theoretical study with numerical results, which show that the non-cooperative game has an Bayesian Nash equilibrium (BNE) point which depends on all parameters of the system.","PeriodicalId":222207,"journal":{"name":"2019 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126981528","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 : 2019-10-01DOI: 10.1109/wincom47513.2019.8942468
Moawiah Alhulayil, M. López-Benítez
The 3rd Generation Partnership Project (3GPP) has recently defined a Licensed Assisted Access (LAA) scheme to enable Long Term Evolution (LTE) networks to use unlicensed frequency bands. However, the unlicensed bands are mainly occupied by the Wi-Fi technology. Hence, achieving fairness between LAA using LTE (LTE-LAA) and Wi-Fi in the unlicensed bands is a primary challenge. The 3GPP has recently standardised in Release 13 a Listen Before Talk (LBT) algorithm to ensure the fairness among these two technologies (LTE and Wi-Fi) over the unlicensed bands. In this paper, we focus on the downlink performance of LTE-LAA and Wi-Fi with different traffic loads. To achieve not only better fairness but also higher total aggregated throughputs for the coexisting networks, a static Contention Window (CW) selection method based on the fairness definition is proposed. The main novelty of this work is that the knowledge of Wi-Fi activity statistics is exploited effectively to select the CW of LAA. We show that the fairness between LAA and Wi-Fi networks depends on the LAA CW size adaptation criterion. Simulation results validate that the proposed method is effective in LAA/Wi-Fi coexistence scenario, can improve fairness performance and provide higher total aggregated throughputs for both coexisting networks compared with the current Category 4 LBT (Cat 4 LBT) algorithm defined in the 3GPP standard.
{"title":"Static Contention Window Method for Improved LTE-LAA/Wi-Fi Coexistence in Unlicensed Bands","authors":"Moawiah Alhulayil, M. López-Benítez","doi":"10.1109/wincom47513.2019.8942468","DOIUrl":"https://doi.org/10.1109/wincom47513.2019.8942468","url":null,"abstract":"The 3rd Generation Partnership Project (3GPP) has recently defined a Licensed Assisted Access (LAA) scheme to enable Long Term Evolution (LTE) networks to use unlicensed frequency bands. However, the unlicensed bands are mainly occupied by the Wi-Fi technology. Hence, achieving fairness between LAA using LTE (LTE-LAA) and Wi-Fi in the unlicensed bands is a primary challenge. The 3GPP has recently standardised in Release 13 a Listen Before Talk (LBT) algorithm to ensure the fairness among these two technologies (LTE and Wi-Fi) over the unlicensed bands. In this paper, we focus on the downlink performance of LTE-LAA and Wi-Fi with different traffic loads. To achieve not only better fairness but also higher total aggregated throughputs for the coexisting networks, a static Contention Window (CW) selection method based on the fairness definition is proposed. The main novelty of this work is that the knowledge of Wi-Fi activity statistics is exploited effectively to select the CW of LAA. We show that the fairness between LAA and Wi-Fi networks depends on the LAA CW size adaptation criterion. Simulation results validate that the proposed method is effective in LAA/Wi-Fi coexistence scenario, can improve fairness performance and provide higher total aggregated throughputs for both coexisting networks compared with the current Category 4 LBT (Cat 4 LBT) algorithm defined in the 3GPP standard.","PeriodicalId":222207,"journal":{"name":"2019 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130839261","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 : 2019-10-01DOI: 10.1109/wincom47513.2019.8942396
Ouafae Kasmi, Amine Baïna, M. Bellafkih
The promise of high bandwidth and low latency for real-time applications are still open issues and challenges in Next Generation Networks (NGN). Thus, sophisticated management is required to improve the Quality of Service (QoS) in these networks and to respect the available network resources. In this paper, we propose a new approach of hybrid criticality to manage dynamically multimedia traffic and requests customers through Differentiated Service (Diffserv) policies using Adaptive Neuro-fuzzy Inference System (ANFIS) and implement them to the Policy Control Rule Function (PCRF) for selecting the appropriate Code Point (CP) to users. We extend the proposed approach in IMS networks with PCRF and PCEF interaction. This approach is based on internal and external factors for making-decision. The internal factors depict the QoS parameters and the external factors characterize the user information. This paper presents a new architecture ANFIS-based for Long Term Evolution (LTE) packet core to enhance QoS management. Simulations show that by adopting hybrid criticality using ANFIS, an improved QoS parameter and time response are gained compared to the classical cases where all flows exhibit the same level of criticality and compared also to Fuzzy Logic technique.
{"title":"Toward a Dynamic QoS Management over LTE/EPC Network using ANFIS","authors":"Ouafae Kasmi, Amine Baïna, M. Bellafkih","doi":"10.1109/wincom47513.2019.8942396","DOIUrl":"https://doi.org/10.1109/wincom47513.2019.8942396","url":null,"abstract":"The promise of high bandwidth and low latency for real-time applications are still open issues and challenges in Next Generation Networks (NGN). Thus, sophisticated management is required to improve the Quality of Service (QoS) in these networks and to respect the available network resources. In this paper, we propose a new approach of hybrid criticality to manage dynamically multimedia traffic and requests customers through Differentiated Service (Diffserv) policies using Adaptive Neuro-fuzzy Inference System (ANFIS) and implement them to the Policy Control Rule Function (PCRF) for selecting the appropriate Code Point (CP) to users. We extend the proposed approach in IMS networks with PCRF and PCEF interaction. This approach is based on internal and external factors for making-decision. The internal factors depict the QoS parameters and the external factors characterize the user information. This paper presents a new architecture ANFIS-based for Long Term Evolution (LTE) packet core to enhance QoS management. Simulations show that by adopting hybrid criticality using ANFIS, an improved QoS parameter and time response are gained compared to the classical cases where all flows exhibit the same level of criticality and compared also to Fuzzy Logic technique.","PeriodicalId":222207,"journal":{"name":"2019 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124271883","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 : 2019-10-01DOI: 10.1109/wincom47513.2019.8942535
T. Xu, I. Darwazeh
Single carrier frequency division multiple access (SC-FDMA) has been comprehensively investigated and standardized in 4th generation (4G) and 5th generation (5G) mobile systems. Its significant advantage is low peak-to-average power ratio (PAPR), which makes it suitable for uplink channel communications. However, over a long time period, SC-FDMA has not made breakthrough especially in data rate enhancement, which may not catch up with the next generation evolution in communications. This work proposes to use a non-orthogonal waveform in SC-FDMA to promote a new concept, termed single carrier spectrally efficient frequency division multiple access (SC-SEFDMA). This non-orthogonal single carrier access technique maintains essentially similar complexity as SC-FDMA but advantageously can either achieve higher data rate for the same amount of power consumption or the same data rate with less power consumption.
{"title":"DFT-Spread Spectrally Efficient Non-Orthogonal FDMA: Invited Paper","authors":"T. Xu, I. Darwazeh","doi":"10.1109/wincom47513.2019.8942535","DOIUrl":"https://doi.org/10.1109/wincom47513.2019.8942535","url":null,"abstract":"Single carrier frequency division multiple access (SC-FDMA) has been comprehensively investigated and standardized in 4th generation (4G) and 5th generation (5G) mobile systems. Its significant advantage is low peak-to-average power ratio (PAPR), which makes it suitable for uplink channel communications. However, over a long time period, SC-FDMA has not made breakthrough especially in data rate enhancement, which may not catch up with the next generation evolution in communications. This work proposes to use a non-orthogonal waveform in SC-FDMA to promote a new concept, termed single carrier spectrally efficient frequency division multiple access (SC-SEFDMA). This non-orthogonal single carrier access technique maintains essentially similar complexity as SC-FDMA but advantageously can either achieve higher data rate for the same amount of power consumption or the same data rate with less power consumption.","PeriodicalId":222207,"journal":{"name":"2019 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116964889","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 : 2019-10-01DOI: 10.1109/wincom47513.2019.8942437
S. Desai, M. Nene
Trust evaluation is an alternate security field, which does not follow the traditional domain of cryptography and its allied mechanisms. Trust is important in any Self-Organising Network (SON) and applicable to mission critical systems where the emergence of system-wide adaptive structure in adhoc deployment and functionality from simple local interactions between individual entities is paramount. Transactions are thus collaborative for control and data transfers. Battlefield-of-Things (BoTs) is a use-case which demonstrates deployment of collaborative wireless sensor network, extensible to employ the Internet of Things. Trust evaluation mechanisms are applied in this work in BoTs to achieve secure transactions in hostile environment. The work proposes a distributed Agent based Trust Evaluation for BoTs. The work addresses the heterogenity of BoTs and the multimodal sensor approach in the battlefield along with the issue of adversary BoT participating in network transactions; hence only a benign BoT is allowed to participate in network operations. Transacting BoTs evaluate trust for all sensitive data transfers thereby demonstrating data trust.
{"title":"Trust Based Security in Battlefield-of-Things","authors":"S. Desai, M. Nene","doi":"10.1109/wincom47513.2019.8942437","DOIUrl":"https://doi.org/10.1109/wincom47513.2019.8942437","url":null,"abstract":"Trust evaluation is an alternate security field, which does not follow the traditional domain of cryptography and its allied mechanisms. Trust is important in any Self-Organising Network (SON) and applicable to mission critical systems where the emergence of system-wide adaptive structure in adhoc deployment and functionality from simple local interactions between individual entities is paramount. Transactions are thus collaborative for control and data transfers. Battlefield-of-Things (BoTs) is a use-case which demonstrates deployment of collaborative wireless sensor network, extensible to employ the Internet of Things. Trust evaluation mechanisms are applied in this work in BoTs to achieve secure transactions in hostile environment. The work proposes a distributed Agent based Trust Evaluation for BoTs. The work addresses the heterogenity of BoTs and the multimodal sensor approach in the battlefield along with the issue of adversary BoT participating in network transactions; hence only a benign BoT is allowed to participate in network operations. Transacting BoTs evaluate trust for all sensitive data transfers thereby demonstrating data trust.","PeriodicalId":222207,"journal":{"name":"2019 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129628070","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 : 2019-10-01DOI: 10.1109/wincom47513.2019.8942570
M. Bouteggui, Fatiha Merazka
In this paper, we consider a multiple-input multiple-output (MIMO) cooperative communication system composed of single source, relay and destination. Selective decode and forward (S-DF) relaying protocol is used by the relay. A strategy is proposed using antenna and path selection with relay based S-DF protocol. Three method are used for path selection which are sum of maximums (Sum-Max), maximum of maximums (Max-Max) and minimum of maximums (Min-Max). Simulation results indicate that Min-Max method outperforms both Sum-Max and Max-Max methods. Also, using S-DF we can achieve better performance compared to path selection with classical DF protocol and also the sub-optimal antenna selection strategies.
{"title":"A Joint Antenna and Path Selection for MIMO Cooperative Communication With Single Selective Decode and Forward Relay","authors":"M. Bouteggui, Fatiha Merazka","doi":"10.1109/wincom47513.2019.8942570","DOIUrl":"https://doi.org/10.1109/wincom47513.2019.8942570","url":null,"abstract":"In this paper, we consider a multiple-input multiple-output (MIMO) cooperative communication system composed of single source, relay and destination. Selective decode and forward (S-DF) relaying protocol is used by the relay. A strategy is proposed using antenna and path selection with relay based S-DF protocol. Three method are used for path selection which are sum of maximums (Sum-Max), maximum of maximums (Max-Max) and minimum of maximums (Min-Max). Simulation results indicate that Min-Max method outperforms both Sum-Max and Max-Max methods. Also, using S-DF we can achieve better performance compared to path selection with classical DF protocol and also the sub-optimal antenna selection strategies.","PeriodicalId":222207,"journal":{"name":"2019 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129053647","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
扫码关注我们
求助内容：
应助结果提醒方式：