Pub Date : 2018-11-01DOI: 10.1109/LATINCOM.2018.8613238
I. Villordo-Jiménez, R. Menchaca-Méndez, M. E. Rivero-Angeles, Noé Torres-Cruz
In this paper, we introduce H-MAC (Hash-based Medium Access Protocol), a collision-free, energy-efficient MAC protocol designed for Linear Sensor Networks (LSN) with applications to the Internet-of-Things (IoT), In our proposal, the LSN is divided in grades composed of nodes located at the same hop-distance to the sink. Nodes in the same grade follow a synchronized duty cycle to transit from the different operation modes (transmission, reception, sleeping). In order to transmit packets from one grade to the next, nodes use pipeline scheduling to coordinate transmissions between adjacent grades. During a transmission slot, H-MAC employs hash functions to implement a distributed election whose winner can access to the channel in an interference-free fashion. Extensive simulation results show that H - MAC outperforms state of the art proposals in terms of throughput, source-to-sink packet delay, packet loss probability and energy consumption. This is particularly true in scenarios where the LSN has from medium to high node density, which is a common condition in the context of the IoT.
{"title":"An Energy-Efficient Hash-Based MAC Protocol for LSN","authors":"I. Villordo-Jiménez, R. Menchaca-Méndez, M. E. Rivero-Angeles, Noé Torres-Cruz","doi":"10.1109/LATINCOM.2018.8613238","DOIUrl":"https://doi.org/10.1109/LATINCOM.2018.8613238","url":null,"abstract":"In this paper, we introduce H-MAC (Hash-based Medium Access Protocol), a collision-free, energy-efficient MAC protocol designed for Linear Sensor Networks (LSN) with applications to the Internet-of-Things (IoT), In our proposal, the LSN is divided in grades composed of nodes located at the same hop-distance to the sink. Nodes in the same grade follow a synchronized duty cycle to transit from the different operation modes (transmission, reception, sleeping). In order to transmit packets from one grade to the next, nodes use pipeline scheduling to coordinate transmissions between adjacent grades. During a transmission slot, H-MAC employs hash functions to implement a distributed election whose winner can access to the channel in an interference-free fashion. Extensive simulation results show that H - MAC outperforms state of the art proposals in terms of throughput, source-to-sink packet delay, packet loss probability and energy consumption. This is particularly true in scenarios where the LSN has from medium to high node density, which is a common condition in the context of the IoT.","PeriodicalId":332646,"journal":{"name":"2018 IEEE 10th Latin-American Conference on Communications (LATINCOM)","volume":"17 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":"131126378","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/LATINCOM.2018.8613243
A. H. Tacuri, J. Fortes, R. Neto
The Generalised Frequency Division Multiplexing (GFDM)is a new multicarrier waveform that has been proposed in order to meet the requirements of the applications that are expected to work over fifth generation (5G)wireless communications systems. Due to its multicarrier nature, the performance of GFDM systems is highly sensitive to non-linear distortions. In addition, due to its wideband characteristics the memory effects of the non-linearities must also be considered. Thus, this paper presents closed-form analytical expressions that allows to evaluate the spectral efficiency (in terms of out-of-band emissions)of GFDM systems operating over a non-linear channel with memory. These analytical expressions are used to obtain numerical results for many different parameters system, allowing a quantitative evaluation of the spectral performance.
{"title":"Analytical Spectral Evaluation of GFDM Systems Over Non-Linear Channels with Memory","authors":"A. H. Tacuri, J. Fortes, R. Neto","doi":"10.1109/LATINCOM.2018.8613243","DOIUrl":"https://doi.org/10.1109/LATINCOM.2018.8613243","url":null,"abstract":"The Generalised Frequency Division Multiplexing (GFDM)is a new multicarrier waveform that has been proposed in order to meet the requirements of the applications that are expected to work over fifth generation (5G)wireless communications systems. Due to its multicarrier nature, the performance of GFDM systems is highly sensitive to non-linear distortions. In addition, due to its wideband characteristics the memory effects of the non-linearities must also be considered. Thus, this paper presents closed-form analytical expressions that allows to evaluate the spectral efficiency (in terms of out-of-band emissions)of GFDM systems operating over a non-linear channel with memory. These analytical expressions are used to obtain numerical results for many different parameters system, allowing a quantitative evaluation of the spectral performance.","PeriodicalId":332646,"journal":{"name":"2018 IEEE 10th Latin-American Conference on Communications (LATINCOM)","volume":"79 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":"126907481","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/LATINCOM.2018.8613219
Paola M. Guaman, L. F. Guerrero-Vásquez, J. P. Bermeo, Paul A. Chasi
The patch antennas are widely used today and the research about their design is very important due to the numerous communication systems in which they are used. However, for these applications is essential that their parameters are suitable. Besides, the theoretical design of this type of antennas is not always effective. So, the metaheuristic optimization algorithms combined with simulations are presented, as a very efficient tool for the design of this class of antennas. Swarm intelligence is imitated of organisms present in nature that have an organization to each other and this communication between members of the same population makes it possible to find a global optimum value of the parameters. In this paper, metaheuristic swarm intelligence optimization algorithms have been used for the design of patch antennas. The optimization techniques used were particle swarm optimization, firefly algorithm and directional bat algorithm. The optimization of the operating frequency, the reflection parameter or Sl l and the impedance of the antenna is performed. Each algorithm performs the search in a different way. Finally, the results obtained are presented.
{"title":"Metaheuristic Optimization Algorithms of Swarm Intelligence in Patch Antenna Design","authors":"Paola M. Guaman, L. F. Guerrero-Vásquez, J. P. Bermeo, Paul A. Chasi","doi":"10.1109/LATINCOM.2018.8613219","DOIUrl":"https://doi.org/10.1109/LATINCOM.2018.8613219","url":null,"abstract":"The patch antennas are widely used today and the research about their design is very important due to the numerous communication systems in which they are used. However, for these applications is essential that their parameters are suitable. Besides, the theoretical design of this type of antennas is not always effective. So, the metaheuristic optimization algorithms combined with simulations are presented, as a very efficient tool for the design of this class of antennas. Swarm intelligence is imitated of organisms present in nature that have an organization to each other and this communication between members of the same population makes it possible to find a global optimum value of the parameters. In this paper, metaheuristic swarm intelligence optimization algorithms have been used for the design of patch antennas. The optimization techniques used were particle swarm optimization, firefly algorithm and directional bat algorithm. The optimization of the operating frequency, the reflection parameter or Sl l and the impedance of the antenna is performed. Each algorithm performs the search in a different way. Finally, the results obtained are presented.","PeriodicalId":332646,"journal":{"name":"2018 IEEE 10th Latin-American Conference on Communications (LATINCOM)","volume":"13 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":"123687288","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/LATINCOM.2018.8613229
Christopher Zygowski, A. Jaekel
Traditional Wireless Sensor Networks (WSN)use stationary sensor nodes to sense relevant events in their vicinity and relay this information for further analysis. These nodes may fail to cover the entire search space either due to inaccurate placement, an insufficient number of nodes or failure of some nodes, resulting in ‘coverage holes.’ Mobile nodes can be deployed, in such cases, to visit the coverage holes and collect the necessary data. It is critical to plan the path taken by these mobile nodes to maximize area coverage and minimize trip time. In this paper, we propose a novel Mixed Integer Linear Programming (MILP)formulation, to determine the path taken by the mobile node. The goal is to find a route that achieves the specified level of coverage in the least amount of time. We have run simulations with different WSN sizes and sensing capabilities of the sensor nodes to evaluate the proposed MILP.
{"title":"Optimal Formulation for Maximizing Area Coverage in Wireless Sensor Networks with Mobile Nodes","authors":"Christopher Zygowski, A. Jaekel","doi":"10.1109/LATINCOM.2018.8613229","DOIUrl":"https://doi.org/10.1109/LATINCOM.2018.8613229","url":null,"abstract":"Traditional Wireless Sensor Networks (WSN)use stationary sensor nodes to sense relevant events in their vicinity and relay this information for further analysis. These nodes may fail to cover the entire search space either due to inaccurate placement, an insufficient number of nodes or failure of some nodes, resulting in ‘coverage holes.’ Mobile nodes can be deployed, in such cases, to visit the coverage holes and collect the necessary data. It is critical to plan the path taken by these mobile nodes to maximize area coverage and minimize trip time. In this paper, we propose a novel Mixed Integer Linear Programming (MILP)formulation, to determine the path taken by the mobile node. The goal is to find a route that achieves the specified level of coverage in the least amount of time. We have run simulations with different WSN sizes and sensing capabilities of the sensor nodes to evaluate the proposed MILP.","PeriodicalId":332646,"journal":{"name":"2018 IEEE 10th Latin-American Conference on Communications (LATINCOM)","volume":"8 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":"126735609","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/LATINCOM.2018.8613253
Miguel Borja-Benitez, R. Parra-Michel, A. Orozco-Lugo
Two main types of modeling are considered in the $I/Q$ imbalance problem literature: symmetric models and asymmetrical models. Specifically, the symmetric models are applied in the $I/Q$ imbalance testing area, while the asymmetrical models have applications in the $I/Q$ imbalance calibration area; each model offers advantages in their respective areas, with applications in real systems. In this paper, a study of both types of modeling was carried out, covering main characteristics, advantages and differences between these models. Symmetrical and asymmetrical models in matrix form are developed for transmitter and receiver bearing on a zero-IF architecture, taking into account the main sources of imbalance in the analog front end (AFE). Based on these models, a matrix model transformation methodology is developed, which is capable of transferring the $I/Q$ imbalance characteristics of a symmetric model into an asymmetric model. Simulation results confirm the proposed model transformation through a performance comparison of four $I/Q$ imbalance testing algorithms in the sense of the AFE imbalances estimation, allowing a fair comparison under the same conditions of imbalance.
{"title":"Symmetrical to Asymmetrical Model Transformation for I/Q Imbalance in Zero-IF Transceivers","authors":"Miguel Borja-Benitez, R. Parra-Michel, A. Orozco-Lugo","doi":"10.1109/LATINCOM.2018.8613253","DOIUrl":"https://doi.org/10.1109/LATINCOM.2018.8613253","url":null,"abstract":"Two main types of modeling are considered in the $I/Q$ imbalance problem literature: symmetric models and asymmetrical models. Specifically, the symmetric models are applied in the $I/Q$ imbalance testing area, while the asymmetrical models have applications in the $I/Q$ imbalance calibration area; each model offers advantages in their respective areas, with applications in real systems. In this paper, a study of both types of modeling was carried out, covering main characteristics, advantages and differences between these models. Symmetrical and asymmetrical models in matrix form are developed for transmitter and receiver bearing on a zero-IF architecture, taking into account the main sources of imbalance in the analog front end (AFE). Based on these models, a matrix model transformation methodology is developed, which is capable of transferring the $I/Q$ imbalance characteristics of a symmetric model into an asymmetric model. Simulation results confirm the proposed model transformation through a performance comparison of four $I/Q$ imbalance testing algorithms in the sense of the AFE imbalances estimation, allowing a fair comparison under the same conditions of imbalance.","PeriodicalId":332646,"journal":{"name":"2018 IEEE 10th Latin-American Conference on Communications (LATINCOM)","volume":"143 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":"124587302","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/LATINCOM.2018.8613227
Ruth G. Barba, Marcelo Criollo, Norma Aimacana, Carlos Manosalvas, C. Cárdenas
Given sthe evolution of technology and the growing demand for resources from users of campus networks that affect network performance, a solution based on SDN is proposed; a technology that differs from the paradigm of traditional networks that centers the administration of the network in a controller. With this new approach, the traffic in campus networks, its behavior, and the main treatment of QoS policies in conventional networks is studied; besides a model to define QoS policies in SDN and conventional networks is designed. Performance is evaluated in three physical scenarios based on latency, jitter and bandwidth, taking an important step to introduce SDN networks in real environment. The D-TIG traffic generator is used for testing. The T-Student statistical method is applied for the analysis of the data.
{"title":"QoS Policies to Improve Performance in Academic Campus and SDN Networks","authors":"Ruth G. Barba, Marcelo Criollo, Norma Aimacana, Carlos Manosalvas, C. Cárdenas","doi":"10.1109/LATINCOM.2018.8613227","DOIUrl":"https://doi.org/10.1109/LATINCOM.2018.8613227","url":null,"abstract":"Given sthe evolution of technology and the growing demand for resources from users of campus networks that affect network performance, a solution based on SDN is proposed; a technology that differs from the paradigm of traditional networks that centers the administration of the network in a controller. With this new approach, the traffic in campus networks, its behavior, and the main treatment of QoS policies in conventional networks is studied; besides a model to define QoS policies in SDN and conventional networks is designed. Performance is evaluated in three physical scenarios based on latency, jitter and bandwidth, taking an important step to introduce SDN networks in real environment. The D-TIG traffic generator is used for testing. The T-Student statistical method is applied for the analysis of the data.","PeriodicalId":332646,"journal":{"name":"2018 IEEE 10th Latin-American Conference on Communications (LATINCOM)","volume":"86 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":"122455049","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/LATINCOM.2018.8613200
Zhenyu Liu, Florian Meyer, M. Win
Network localization and synchronization (NLS) is a paradigm that considers joint inference of positions and clock parameters in a network consisting of completely asynchronous nodes. NLS has the potential to achieve significant performance gains in terms of localization and synchronization accuracy. In this paper, we derive fundamental performance limits of NLS by considering a problem formulation in the non-Bayesian inference framework, in which the waveforms received by different nodes in the network are considered as measurements. We perform equivalent Fisher information analysis to obtain bounds on the accuracy of NLS, and our results reveal how physical parameters and signal departure times affect the inference performance. The analytical results are verified by simulations based on a realistic channel model that takes spatial consistency into consideration.
{"title":"On the Accuracy of Network Localization and Synchronization","authors":"Zhenyu Liu, Florian Meyer, M. Win","doi":"10.1109/LATINCOM.2018.8613200","DOIUrl":"https://doi.org/10.1109/LATINCOM.2018.8613200","url":null,"abstract":"Network localization and synchronization (NLS) is a paradigm that considers joint inference of positions and clock parameters in a network consisting of completely asynchronous nodes. NLS has the potential to achieve significant performance gains in terms of localization and synchronization accuracy. In this paper, we derive fundamental performance limits of NLS by considering a problem formulation in the non-Bayesian inference framework, in which the waveforms received by different nodes in the network are considered as measurements. We perform equivalent Fisher information analysis to obtain bounds on the accuracy of NLS, and our results reveal how physical parameters and signal departure times affect the inference performance. The analytical results are verified by simulations based on a realistic channel model that takes spatial consistency into consideration.","PeriodicalId":332646,"journal":{"name":"2018 IEEE 10th Latin-American Conference on Communications (LATINCOM)","volume":"66 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":"126329907","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/LATINCOM.2018.8613244
E. Almeida, L. S. Costa, R. A. Souza, D. Guimarães
The circular folding cooperative power spectral density split cancellation (CF-CPSC) algorithm was recently proposed for detecting idle bands in centralized cooperative spectrum sensing for cognitive radio (CR) applications. This algorithm has low complexity and is robust under nonuniform noise. This paper analyzes the performance of the CF-CPSC under quantized and erroneous report channel transmissions. Two approaches has been investigated regarding the CF-CPSC test statistic: i) it is completely computed at the fusion center (FC), and ii) it is partially calculated at each CR for saving report channel resources. In both cases, the information to be reported by the CRs are uniformly quantized and then submitted to errors. Results show that the CF-CPSC is also robust to the quantization and report errors. The second approach is more sensitive to the quantization and report channel errors, but less channel resources are used in comparison with the first approach. The smaller resource usage is achieved by the second approach even with error correcting codes, which increases the amount of data through the report channel. The resource usage achieved by the first approach is larger, even with no error correcting codes.
{"title":"Performance Analysis of the Circular Folding Cooperative Power Spectral Density Split Cancellation Algorithm for Spectrum Sensing Under Errors at the Quantized Report Channel","authors":"E. Almeida, L. S. Costa, R. A. Souza, D. Guimarães","doi":"10.1109/LATINCOM.2018.8613244","DOIUrl":"https://doi.org/10.1109/LATINCOM.2018.8613244","url":null,"abstract":"The circular folding cooperative power spectral density split cancellation (CF-CPSC) algorithm was recently proposed for detecting idle bands in centralized cooperative spectrum sensing for cognitive radio (CR) applications. This algorithm has low complexity and is robust under nonuniform noise. This paper analyzes the performance of the CF-CPSC under quantized and erroneous report channel transmissions. Two approaches has been investigated regarding the CF-CPSC test statistic: i) it is completely computed at the fusion center (FC), and ii) it is partially calculated at each CR for saving report channel resources. In both cases, the information to be reported by the CRs are uniformly quantized and then submitted to errors. Results show that the CF-CPSC is also robust to the quantization and report errors. The second approach is more sensitive to the quantization and report channel errors, but less channel resources are used in comparison with the first approach. The smaller resource usage is achieved by the second approach even with error correcting codes, which increases the amount of data through the report channel. The resource usage achieved by the first approach is larger, even with no error correcting codes.","PeriodicalId":332646,"journal":{"name":"2018 IEEE 10th Latin-American Conference on Communications (LATINCOM)","volume":"5 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":"114937359","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/LATINCOM.2018.8613226
C. Santivanez
CSMA/CA MACs for mobile ad hoc networks (e.g. the 802.11 suite)exhibit an unstable behavior (i.e., their throughput goes to zero under high load)in the presence of hidden nodes. In this paper, we show that even the simplest Multi-User Detection (MUD)-enabled radio can mitigate the MAC's loss-of-state, which is the culprit of the MAC instability. Thus, a MUD-enabled CSMA MAC - with just a few modifications - can significantly reduce the instability associated with CSMA/CA MAC and achieve high throughput even under very high traffic load. High fidelity simulation results, with a radio model that includes important technological constraints, are presented for both a simple idealized topology as well as for a very realistic scenario. In both cases, it is shown that the combined CSMA/CA MAC and MUD radio system is able to achieve high throughput with much improved stability.
用于移动自组织网络(例如802.11套件)的CSMA/CA mac在隐藏节点的存在下表现出不稳定的行为(即，它们的吞吐量在高负载下变为零)。在本文中，我们证明了即使是最简单的多用户检测(MUD)启用无线电也可以减轻MAC的状态丢失，这是MAC不稳定的罪魁祸首。因此，启用mudd的CSMA MAC -只需进行一些修改-可以显着减少与CSMA/CA MAC相关的不稳定性，并且即使在非常高的流量负载下也能实现高吞吐量。高保真度的仿真结果，与无线电模型，包括重要的技术限制，提出了一个简单的理想拓扑和一个非常现实的场景。在这两种情况下，表明CSMA/CA MAC和MUD组合无线电系统能够实现高吞吐量，并大大提高稳定性。
{"title":"Exploiting Multi-User Detection (MUD)Radio Capabilities to Improve Stability of CSMA/CA for MANETs","authors":"C. Santivanez","doi":"10.1109/LATINCOM.2018.8613226","DOIUrl":"https://doi.org/10.1109/LATINCOM.2018.8613226","url":null,"abstract":"CSMA/CA MACs for mobile ad hoc networks (e.g. the 802.11 suite)exhibit an unstable behavior (i.e., their throughput goes to zero under high load)in the presence of hidden nodes. In this paper, we show that even the simplest Multi-User Detection (MUD)-enabled radio can mitigate the MAC's loss-of-state, which is the culprit of the MAC instability. Thus, a MUD-enabled CSMA MAC - with just a few modifications - can significantly reduce the instability associated with CSMA/CA MAC and achieve high throughput even under very high traffic load. High fidelity simulation results, with a radio model that includes important technological constraints, are presented for both a simple idealized topology as well as for a very realistic scenario. In both cases, it is shown that the combined CSMA/CA MAC and MUD radio system is able to achieve high throughput with much improved stability.","PeriodicalId":332646,"journal":{"name":"2018 IEEE 10th Latin-American Conference on Communications (LATINCOM)","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":"117124233","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/LATINCOM.2018.8613234
Rogério Pereira Junior, C. Rocha, B. Chang
In this paper, we introduce a new widely linear iterative equalizer for Single Carrier systems with Frequency Domain Equalization (SC-FDE) that takes into account up to K independent interferers in the symbol estimation process. In the proposed equalizer design method, we assume that there is ideal feedback after the first equalizer iteration in order to reduce the complexity. It was seen that the proposed iterative structure has a better error performance when compared to the non-iterative version regardless of the number of interferers and the interference power.
{"title":"Multiple Independent Interferences Cancellation for SC-FDE Systems Using Widely Linear Iterative Equalizers","authors":"Rogério Pereira Junior, C. Rocha, B. Chang","doi":"10.1109/LATINCOM.2018.8613234","DOIUrl":"https://doi.org/10.1109/LATINCOM.2018.8613234","url":null,"abstract":"In this paper, we introduce a new widely linear iterative equalizer for Single Carrier systems with Frequency Domain Equalization (SC-FDE) that takes into account up to K independent interferers in the symbol estimation process. In the proposed equalizer design method, we assume that there is ideal feedback after the first equalizer iteration in order to reduce the complexity. It was seen that the proposed iterative structure has a better error performance when compared to the non-iterative version regardless of the number of interferers and the interference power.","PeriodicalId":332646,"journal":{"name":"2018 IEEE 10th Latin-American Conference on Communications (LATINCOM)","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":"131063377","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
扫码关注我们
求助内容：
应助结果提醒方式：