Pub Date : 2018-08-01DOI: 10.1109/ISWCS.2018.8491085
Zubair Amjad, A. Sikora, Jean-Philippe Lauffenburger, B. Hilt
The next generation cellular networks are expected to improve reliability, energy efficiency, data rate, capacity and latency. Originally, Machine Type Communication (MTC) was designed for low-bandwidth high-latency applications such as, environmental sensing, smart dustbin, etc., but there is additional demand around applications with low latency requirements, like industrial automation, driver-less cars, and so on. Improvements are required in 4G Long Term Evolution (LTE) networks towards the development of next generation cellular networks for providing very low latency and high reliability. To this end, we present an in-depth analysis of parameters that contribute to the latency in 4G networks along with a description of latency reduction techniques. We implement and validate these latency reduction techniques in the open-source network simulator (NS3) for narrowband user equipment category Cat-Ml (LTE-M) to analyze the improvements. The results presented are a step towards enabling narrowband Ultra Reliable Low Latency Communication (URLLC) networks.
{"title":"Latency Reduction in Narrowband 4G LTE Networks","authors":"Zubair Amjad, A. Sikora, Jean-Philippe Lauffenburger, B. Hilt","doi":"10.1109/ISWCS.2018.8491085","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491085","url":null,"abstract":"The next generation cellular networks are expected to improve reliability, energy efficiency, data rate, capacity and latency. Originally, Machine Type Communication (MTC) was designed for low-bandwidth high-latency applications such as, environmental sensing, smart dustbin, etc., but there is additional demand around applications with low latency requirements, like industrial automation, driver-less cars, and so on. Improvements are required in 4G Long Term Evolution (LTE) networks towards the development of next generation cellular networks for providing very low latency and high reliability. To this end, we present an in-depth analysis of parameters that contribute to the latency in 4G networks along with a description of latency reduction techniques. We implement and validate these latency reduction techniques in the open-source network simulator (NS3) for narrowband user equipment category Cat-Ml (LTE-M) to analyze the improvements. The results presented are a step towards enabling narrowband Ultra Reliable Low Latency Communication (URLLC) networks.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115807430","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-08-01DOI: 10.1109/ISWCS.2018.8491101
Haheon Chung, Sunguk Lee, Junho Jeong
With growing popularity of Internet of Things (IoT), Low Power Wide Area (LPWA) technologies are getting more interests. Narrowband Internet of Things (NB-IoT) is a LPWA technology specified by 3rdGeneration Partnership Project (3GPP) and in the initial stage of commercialization. The performance of NB-IoT network needs to be optimized in downlink as well as uplink for reliable quality of NB-IoT services. In this paper, we provide optimization cases of modulation and coding scheme (MCS) for paging in multicell interference environments in terms of paging success rate in NB-IoT downlink. We also present optimization cases of coverage level (CL) in a commercial NB-IoT network environment with various driving speed in terms of random access channel (RACH) success rate in NB-IoT uplink.
{"title":"NB-IoT Optimization on Paging MCS and Coverage Level","authors":"Haheon Chung, Sunguk Lee, Junho Jeong","doi":"10.1109/ISWCS.2018.8491101","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491101","url":null,"abstract":"With growing popularity of Internet of Things (IoT), Low Power Wide Area (LPWA) technologies are getting more interests. Narrowband Internet of Things (NB-IoT) is a LPWA technology specified by 3rdGeneration Partnership Project (3GPP) and in the initial stage of commercialization. The performance of NB-IoT network needs to be optimized in downlink as well as uplink for reliable quality of NB-IoT services. In this paper, we provide optimization cases of modulation and coding scheme (MCS) for paging in multicell interference environments in terms of paging success rate in NB-IoT downlink. We also present optimization cases of coverage level (CL) in a commercial NB-IoT network environment with various driving speed in terms of random access channel (RACH) success rate in NB-IoT uplink.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126047698","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-08-01DOI: 10.1109/ISWCS.2018.8491057
Mingfeng Ma, Tiejun Lv, Xuewei Zhang
This paper investigates the joint optimization of layered caching and beamforming design for scalable videos delivered by Dynamic Adaptive Streaming over HTTP in the multicell cloud radio access network. To transmit differential scalable videos, each video is divided into a base layer and a set of enhancement layers based on scalable video coding. Taking the layered property of scalable videos into account, we propose a layered caching scheme, i.e., multiple layers of different scalable videos are cached in the baseband unit pool and the cache-enabled cluster respectively, which alleviates the burden of backhaul links effectively. Since the quality of videos received by each user depends on the available bandwidth, the appropriate scalable videos are provided for users based on the transmission rates. To provide superior video quality for users, we aim to maximize the sum rate for users accessing the remote radio heads and regard the backhaul consumption as a quality of service constraint explicitly. Then, the weighted sum rate maximization problem is formulated, which can be converted into a quadratically constrained quadratic programming problem through the l0-norm approximation technique and the weighted minimum mean square error approach. Finally, simulation results demonstrate the superiority of the proposed scheme.
{"title":"Joint Cache Placement and Beamforming Design for Scalable Videos in C-RAN","authors":"Mingfeng Ma, Tiejun Lv, Xuewei Zhang","doi":"10.1109/ISWCS.2018.8491057","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491057","url":null,"abstract":"This paper investigates the joint optimization of layered caching and beamforming design for scalable videos delivered by Dynamic Adaptive Streaming over HTTP in the multicell cloud radio access network. To transmit differential scalable videos, each video is divided into a base layer and a set of enhancement layers based on scalable video coding. Taking the layered property of scalable videos into account, we propose a layered caching scheme, i.e., multiple layers of different scalable videos are cached in the baseband unit pool and the cache-enabled cluster respectively, which alleviates the burden of backhaul links effectively. Since the quality of videos received by each user depends on the available bandwidth, the appropriate scalable videos are provided for users based on the transmission rates. To provide superior video quality for users, we aim to maximize the sum rate for users accessing the remote radio heads and regard the backhaul consumption as a quality of service constraint explicitly. Then, the weighted sum rate maximization problem is formulated, which can be converted into a quadratically constrained quadratic programming problem through the l0-norm approximation technique and the weighted minimum mean square error approach. Finally, simulation results demonstrate the superiority of the proposed scheme.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130381009","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-08-01DOI: 10.1109/ISWCS.2018.8491253
R. Zayani, H. Shaiek, C. Alexandre, A. Kielys, Xinying Cheng, Xiaotian Fu, D. Roviras
This paper presents an experimental testbed to evaluate the performance of CP-OFDM and the most promising 5G multicarrier waveforms (MWFs) WOLA-OFDM and BF-OFDM in presence of a real RF power amplifier (RF PA). In particular, we focus on the in-band and out-of-band non-linear distortions and their effects on power spectrum density (PSD) and bit error rate (BER), respectively. Testbed results are obtained in a realistic laboratory experimentation with configurable universal software radio peripherals (USRPs) based software defined radio (SDR) prototype. Testbed results confirm that different waveforms lose rapidly their good properties when non-linear RF PA is considered. Waveform performances are validated and compared via both simulations and experimental measurements.
{"title":"A Testbed for Experimental Performance Evaluation of Multicarrier Waveforms in Presence of RF PA","authors":"R. Zayani, H. Shaiek, C. Alexandre, A. Kielys, Xinying Cheng, Xiaotian Fu, D. Roviras","doi":"10.1109/ISWCS.2018.8491253","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491253","url":null,"abstract":"This paper presents an experimental testbed to evaluate the performance of CP-OFDM and the most promising 5G multicarrier waveforms (MWFs) WOLA-OFDM and BF-OFDM in presence of a real RF power amplifier (RF PA). In particular, we focus on the in-band and out-of-band non-linear distortions and their effects on power spectrum density (PSD) and bit error rate (BER), respectively. Testbed results are obtained in a realistic laboratory experimentation with configurable universal software radio peripherals (USRPs) based software defined radio (SDR) prototype. Testbed results confirm that different waveforms lose rapidly their good properties when non-linear RF PA is considered. Waveform performances are validated and compared via both simulations and experimental measurements.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"12 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120822012","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-08-01DOI: 10.1109/ISWCS.2018.8491232
João T. Fernandes, B. Racha, Rui Pedro Paiva, T. Cruz
With technology advances, trying to replace expensive devices with cheaper, but efficient, systems is a promising approach to pursuit in the future. The main objective of this paper is to compare the Littmann 3200 (state-of-the-art electronic stethoscope) with a prototype built for this purpose (with an electric microphone as the sensor, and an Arduino Mega as a controller), in terms of sound quality, cough detection, and costs. Regarding sound quality, the Littmann is better, especially because of all the technology behind the stethoscope. The costs of both devices are significantly different: the prototype costs 90% less than the Littmann. In terms of cough detection, the Littmann has a sensitivity of 75.4±32.0% and a specificity of 99.6±2.5%, and the prototype has a sensitivity of 71.7±32.1% and a specificity of 98.0±11.0%, but the differences are not significant.
{"title":"Using Low Cost Embedded Systems for Respiratory Sounds Auscultation","authors":"João T. Fernandes, B. Racha, Rui Pedro Paiva, T. Cruz","doi":"10.1109/ISWCS.2018.8491232","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491232","url":null,"abstract":"With technology advances, trying to replace expensive devices with cheaper, but efficient, systems is a promising approach to pursuit in the future. The main objective of this paper is to compare the Littmann 3200 (state-of-the-art electronic stethoscope) with a prototype built for this purpose (with an electric microphone as the sensor, and an Arduino Mega as a controller), in terms of sound quality, cough detection, and costs. Regarding sound quality, the Littmann is better, especially because of all the technology behind the stethoscope. The costs of both devices are significantly different: the prototype costs 90% less than the Littmann. In terms of cough detection, the Littmann has a sensitivity of 75.4±32.0% and a specificity of 99.6±2.5%, and the prototype has a sensitivity of 71.7±32.1% and a specificity of 98.0±11.0%, but the differences are not significant.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130898759","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-08-01DOI: 10.1109/ISWCS.2018.8491034
Qing Liao, Jingyi Zhang
Vehicular ad-hoc network has the characteristics of Delay Tolerant Network and social network. In this background, we take the social attributes of Delay Tolerant Network as starting point and study the macroscopic dynamic features, micro dynamic features and dynamic contact features of vehicles. In this paper, we proposed a geographic multicast routing based on social dynamic features aware which solves messages transmission problems in vehicular ad hoc network. Different from the existing mobility-aware geocast algorithm, our algorithm takes into account not only the relationships between vehicles mobility and geographical location, but also the contact features between vehicles and destination areas. Finally, it is proved that our algorithm is superior to the existing mobility-aware geocast algorithm in term of delivery rate, network overhead and average delay by the real mobile data model simulation in large vehicular ad-hoc network. The results prove the effectiveness of our algorithm, and the routing protocol we proposed is suited for large urban vehicular ad hoc networks.
{"title":"Geographic Routing Based on Social Dynamic Features Aware in Vehicle Social Network","authors":"Qing Liao, Jingyi Zhang","doi":"10.1109/ISWCS.2018.8491034","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491034","url":null,"abstract":"Vehicular ad-hoc network has the characteristics of Delay Tolerant Network and social network. In this background, we take the social attributes of Delay Tolerant Network as starting point and study the macroscopic dynamic features, micro dynamic features and dynamic contact features of vehicles. In this paper, we proposed a geographic multicast routing based on social dynamic features aware which solves messages transmission problems in vehicular ad hoc network. Different from the existing mobility-aware geocast algorithm, our algorithm takes into account not only the relationships between vehicles mobility and geographical location, but also the contact features between vehicles and destination areas. Finally, it is proved that our algorithm is superior to the existing mobility-aware geocast algorithm in term of delivery rate, network overhead and average delay by the real mobile data model simulation in large vehicular ad-hoc network. The results prove the effectiveness of our algorithm, and the routing protocol we proposed is suited for large urban vehicular ad hoc networks.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130916672","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-08-01DOI: 10.1109/ISWCS.2018.8491076
Weskley V. F. Maurício, D. C. Araújo, F. H. C. Neto, F. Lima, T. Maciel
This work investigates the space-division multiple access grouping problem in multiuser massive multiple input multiple output (MIMO). The adopted approach consists in performing firstly the K-means algorithm, that is a classification algorithm well known in machine learning field, to split mobile stations (MSs) into spatially compatible clusters based on the knowledge of the users' spatial covariance matrices. Secondly, it schedules a sub-set of MSs from each cluster thus supporting multiple spatial streams per cluster. Furthermore, the MSs are selected based on a metric that accounts for the trade-off between their spatial channel correlation and channel gain. The corresponding scheduling is optimally solved by using branch and bound (BB) and best fit (BF) algorithms. Moreover, we compare the proposed solutions with the random scheduler that performs clustering and chooses the MSs to compose the groups at random. The simulation results show that the two proposed solutions, BB and BF outperform, the random scheduler. The BB and BF solutions achieve similar capacity performance, but the first has polynomial-time computational complexity while the second a exponential computational complexity.
{"title":"A Low Complexity Solution for Resource Allocation and SDMA Grouping in Massive MIMO Systems","authors":"Weskley V. F. Maurício, D. C. Araújo, F. H. C. Neto, F. Lima, T. Maciel","doi":"10.1109/ISWCS.2018.8491076","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491076","url":null,"abstract":"This work investigates the space-division multiple access grouping problem in multiuser massive multiple input multiple output (MIMO). The adopted approach consists in performing firstly the K-means algorithm, that is a classification algorithm well known in machine learning field, to split mobile stations (MSs) into spatially compatible clusters based on the knowledge of the users' spatial covariance matrices. Secondly, it schedules a sub-set of MSs from each cluster thus supporting multiple spatial streams per cluster. Furthermore, the MSs are selected based on a metric that accounts for the trade-off between their spatial channel correlation and channel gain. The corresponding scheduling is optimally solved by using branch and bound (BB) and best fit (BF) algorithms. Moreover, we compare the proposed solutions with the random scheduler that performs clustering and chooses the MSs to compose the groups at random. The simulation results show that the two proposed solutions, BB and BF outperform, the random scheduler. The BB and BF solutions achieve similar capacity performance, but the first has polynomial-time computational complexity while the second a exponential computational complexity.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131151328","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-08-01DOI: 10.1109/ISWCS.2018.8491213
Xiaojuan Zhao, Shou-yi Yang, Aihua Zhang, Xiaoyu Li
Multi-User Detection (MUD) for uplink grant-free Non-orthogonal Multiple Access (NOMA) has received much attention recently. In this paper, we consider the scenario in which a Base Station (BS) is equipped with multiple antennas, and propose a Compressive Sensing-based Hard Fusion Algorithm (CS-HFA) to realize MUD. More explicitly, we detect the user activity information by a conventional CS algorithm at each antenna, and then amalgamate the detected user activity information to derive an active user set. Finally, we can use the obtained active user set to estimate the active users' data. The proposed CS- HFA with low complexity for uplink grant-free Single-Input Multiple-Output Non-Orthogonal Multiple Access (SIMO-NOMA) systems can achieve better BER performance than traditional CS-based MUD in the NOMA system with single antenna at the BS.
{"title":"A Compressive Sensing Based Multi-user Detection Algorithm for SIMa-NOMA Systems","authors":"Xiaojuan Zhao, Shou-yi Yang, Aihua Zhang, Xiaoyu Li","doi":"10.1109/ISWCS.2018.8491213","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491213","url":null,"abstract":"Multi-User Detection (MUD) for uplink grant-free Non-orthogonal Multiple Access (NOMA) has received much attention recently. In this paper, we consider the scenario in which a Base Station (BS) is equipped with multiple antennas, and propose a Compressive Sensing-based Hard Fusion Algorithm (CS-HFA) to realize MUD. More explicitly, we detect the user activity information by a conventional CS algorithm at each antenna, and then amalgamate the detected user activity information to derive an active user set. Finally, we can use the obtained active user set to estimate the active users' data. The proposed CS- HFA with low complexity for uplink grant-free Single-Input Multiple-Output Non-Orthogonal Multiple Access (SIMO-NOMA) systems can achieve better BER performance than traditional CS-based MUD in the NOMA system with single antenna at the BS.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114670911","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-08-01DOI: 10.1109/ISWCS.2018.8491075
Andrey Silva, K. Reza, Aurenice M. Oliveira
The fast topology change and high-speed mobility of vehicles, as well as the limited radio range, usually lead to wrong packet forwarding decisions in highly dynamic Vehicular Ad Hoc Network (VANET). This type of environment makes data routing very challenging. Position-based routing protocols are popular for VANET due to the availability of GPS devices. Geographic Perimeter Stateless Routing (GPSR) has been widely adopted to cope up with VANET challenges. Nevertheless, there are still improvements that could be incorporated into GPSR to make it more reliable and efficient. In this paper, we describe an Adaptive GPSR (AGPSR), including additional information in the Neighbors Table to select the best path and bypass the nodes that delivered the previous packets in recovery mode. This approach can avoid possible link-breakage due to for instance a road accident. We compared our results with the traditional GPSR using the Simulation of Urban MObility (SUMO) and Network Simulator-version 3 (NS-3) for both static and mobility scenarios. Our results show that the proposed AGPSR strategy has better performance than traditional GPSR when packet delivery ratio, lost packets and hop count are used as performance metrics.
{"title":"An Adaptive GPSR Routing Protocol for VANETs","authors":"Andrey Silva, K. Reza, Aurenice M. Oliveira","doi":"10.1109/ISWCS.2018.8491075","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491075","url":null,"abstract":"The fast topology change and high-speed mobility of vehicles, as well as the limited radio range, usually lead to wrong packet forwarding decisions in highly dynamic Vehicular Ad Hoc Network (VANET). This type of environment makes data routing very challenging. Position-based routing protocols are popular for VANET due to the availability of GPS devices. Geographic Perimeter Stateless Routing (GPSR) has been widely adopted to cope up with VANET challenges. Nevertheless, there are still improvements that could be incorporated into GPSR to make it more reliable and efficient. In this paper, we describe an Adaptive GPSR (AGPSR), including additional information in the Neighbors Table to select the best path and bypass the nodes that delivered the previous packets in recovery mode. This approach can avoid possible link-breakage due to for instance a road accident. We compared our results with the traditional GPSR using the Simulation of Urban MObility (SUMO) and Network Simulator-version 3 (NS-3) for both static and mobility scenarios. Our results show that the proposed AGPSR strategy has better performance than traditional GPSR when packet delivery ratio, lost packets and hop count are used as performance metrics.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132960897","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-08-01DOI: 10.1109/ISWCS.2018.8491091
Gustavo Anjos, D. Castanheira, Adão Silva, A. Gameiro
This work presents an information theoretical analysis of the intrinsic secrecy of circular and square M-QAM signals when these constellations are precoded with equal gain transmission (EGT) and maximum ratio transmission (MRT) techniques. The main results show that for low order constellations, a significant percentage of the exchanged information is intrinsically protected by the EGT precoder, while in the MRT case, an interesting result shows that the secrecy level doesn't scale with the entropy of the source, and therefore perfect secrecy rate can be achieved asymptotically increasing the constellation order M. Furthermore, the results provided in this work can be used to quantify a minimum entropy value that a shared secret key must have to fully secure the information from an eavesdropper.
{"title":"Secrecy Analysis of EGT and MRT Precoders for M -QAM Constellations","authors":"Gustavo Anjos, D. Castanheira, Adão Silva, A. Gameiro","doi":"10.1109/ISWCS.2018.8491091","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491091","url":null,"abstract":"This work presents an information theoretical analysis of the intrinsic secrecy of circular and square M-QAM signals when these constellations are precoded with equal gain transmission (EGT) and maximum ratio transmission (MRT) techniques. The main results show that for low order constellations, a significant percentage of the exchanged information is intrinsically protected by the EGT precoder, while in the MRT case, an interesting result shows that the secrecy level doesn't scale with the entropy of the source, and therefore perfect secrecy rate can be achieved asymptotically increasing the constellation order M. Furthermore, the results provided in this work can be used to quantify a minimum entropy value that a shared secret key must have to fully secure the information from an eavesdropper.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124822038","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
扫码关注我们
求助内容：
应助结果提醒方式：