The use of directional communications in Mobile Ad Hoc Networks (MANET) helps to overcome the most of undesired issues occurring at Medium Access Control (MAC) layer involved by omnidirectional antennas. Although, the employment of Directional Virtual Carrier Sensing (DVCS) techniques are not sufficient to limit decisively the deafness problem, the most recent approaches such as [1] exploiting Round-Robin principle help to enhance efficiency in reducing this issue. However, because these kinds of approaches employ queues for frame management, while considering to reduce the deafness through a Round-Robin scheduling approach, it is necessary also to address the most common issues implied by these strategies that are the waiting queue and the time slice problems. These problems, unfortunately, tend to considerably reduce benefits involved by a sectorized-queue based solution. In this paper a novel Self Clocked Fair Queueing MAC (SCFQ-MAC) approach is proposed with the goal to minimize the effects of the mentioned issue. By exploiting a SCFQ scheduling it is possible to reduce the average waiting time of frames in queues and consequently, to improve system performance especially in terms of fairness.
{"title":"A Self Clocked Fair Queuing MAC Approach Limiting Deafness and Round Robin Issues in Directional MANET","authors":"Vincenzo Inzillo, F. Rango, A. Ariza-Quintana","doi":"10.1109/WD.2019.8734263","DOIUrl":"https://doi.org/10.1109/WD.2019.8734263","url":null,"abstract":"The use of directional communications in Mobile Ad Hoc Networks (MANET) helps to overcome the most of undesired issues occurring at Medium Access Control (MAC) layer involved by omnidirectional antennas. Although, the employment of Directional Virtual Carrier Sensing (DVCS) techniques are not sufficient to limit decisively the deafness problem, the most recent approaches such as [1] exploiting Round-Robin principle help to enhance efficiency in reducing this issue. However, because these kinds of approaches employ queues for frame management, while considering to reduce the deafness through a Round-Robin scheduling approach, it is necessary also to address the most common issues implied by these strategies that are the waiting queue and the time slice problems. These problems, unfortunately, tend to considerably reduce benefits involved by a sectorized-queue based solution. In this paper a novel Self Clocked Fair Queueing MAC (SCFQ-MAC) approach is proposed with the goal to minimize the effects of the mentioned issue. By exploiting a SCFQ scheduling it is possible to reduce the average waiting time of frames in queues and consequently, to improve system performance especially in terms of fairness.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130608670","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}
Industrial wireless sensor networks (IWSN) begin to occupy wide areas in the industry for applications such as factory automation. To meet the strict latency and reliability requirements for (IWSN), channel coding is proposed to be used in the physical layer. To this aim, a comparison study is carried out in this paper among three different modern coding techniques, i.e. turbo, LDPC, and convolutional coding. The goal of this study is to define which coding technique better meets IWSN requirements. LDPC is shown to provide a good performance by means of latency and reliability. In addition, low latency HARQ based on error rate estimation is proposed in this paper. The proposed scheme utilizes few LDPC decoder iterations and can provide up to 5 dB gain compared to another scheme where the decoding process is completely skipped.
{"title":"Channel Coding and Low Latency HARQ for Industrial Wireless Sensor Networks","authors":"B. Husain, A. Czylwik","doi":"10.1109/WD.2019.8734232","DOIUrl":"https://doi.org/10.1109/WD.2019.8734232","url":null,"abstract":"Industrial wireless sensor networks (IWSN) begin to occupy wide areas in the industry for applications such as factory automation. To meet the strict latency and reliability requirements for (IWSN), channel coding is proposed to be used in the physical layer. To this aim, a comparison study is carried out in this paper among three different modern coding techniques, i.e. turbo, LDPC, and convolutional coding. The goal of this study is to define which coding technique better meets IWSN requirements. LDPC is shown to provide a good performance by means of latency and reliability. In addition, low latency HARQ based on error rate estimation is proposed in this paper. The proposed scheme utilizes few LDPC decoder iterations and can provide up to 5 dB gain compared to another scheme where the decoding process is completely skipped.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"10 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130969561","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}
The execution of real-life experiments provides meaningful insights on the performance of wireless sensor network solutions. Along with simulations, it is an important tool in the process of validating a new protocol. Our study case is GeoM, a geographic multicast routing protocol. We make use of the Future Internet of Thing IoT-LAB infrastructure in Strasbourg as the platform for the real-life experiments conducted for our solution. Our real-life experiments show that GeoM improves the network performance, when several metrics - packet loss, maximum energy consumption and latency - are simultaneously considered, compared to similar scheme routing. For scalability purpose we study correlation between the real-life experiment results and the values obtained in simulations, which proves to be consistent.
{"title":"Performance of Geographic Multicast Approach on a Real-life Platform","authors":"Lucas Leão, V. Felea, H. Guyennet","doi":"10.1109/WD.2019.8734229","DOIUrl":"https://doi.org/10.1109/WD.2019.8734229","url":null,"abstract":"The execution of real-life experiments provides meaningful insights on the performance of wireless sensor network solutions. Along with simulations, it is an important tool in the process of validating a new protocol. Our study case is GeoM, a geographic multicast routing protocol. We make use of the Future Internet of Thing IoT-LAB infrastructure in Strasbourg as the platform for the real-life experiments conducted for our solution. Our real-life experiments show that GeoM improves the network performance, when several metrics - packet loss, maximum energy consumption and latency - are simultaneously considered, compared to similar scheme routing. For scalability purpose we study correlation between the real-life experiment results and the values obtained in simulations, which proves to be consistent.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125346596","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}
This paper discusses topic of high Peak to Average Power Ratio (PAPR) in Orthogonal Frequency Division Multiplexing (OFDM) based signals. An innovative technique is proposed to reduce PAPR without compromising Error Vector Mapping (EVM). The proposed technique is named Peak Shrinking and Interpolating (PSI), and results show no more than 1% EVM when the technique is operated. The hardware resource consumption of PSI technique is analyzed and compared with the simplest Crest Factor Reduction (CFR) technique known as Clipping and Filtering (CF). This analysis, together with EVM performance, and PAPR reduction performance indicates that PSI technique can be an outstanding scheme for existing and future technologies such as Long-Term Evolution (LTE) and 5th Generation of cellular mobile communications (5G), resulting in more efficient Power Amplifier (PA) operation.
{"title":"Peak Shrinking and Interpolating Technique for reducing Peak to Average Power Ratio","authors":"S. Mohammady, R. Farrell, D. Malone, J. Dooley","doi":"10.1109/WD.2019.8734273","DOIUrl":"https://doi.org/10.1109/WD.2019.8734273","url":null,"abstract":"This paper discusses topic of high Peak to Average Power Ratio (PAPR) in Orthogonal Frequency Division Multiplexing (OFDM) based signals. An innovative technique is proposed to reduce PAPR without compromising Error Vector Mapping (EVM). The proposed technique is named Peak Shrinking and Interpolating (PSI), and results show no more than 1% EVM when the technique is operated. The hardware resource consumption of PSI technique is analyzed and compared with the simplest Crest Factor Reduction (CFR) technique known as Clipping and Filtering (CF). This analysis, together with EVM performance, and PAPR reduction performance indicates that PSI technique can be an outstanding scheme for existing and future technologies such as Long-Term Evolution (LTE) and 5th Generation of cellular mobile communications (5G), resulting in more efficient Power Amplifier (PA) operation.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126660781","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}
Cloud-radio access networks (C-RANs) are the evolving mobile communication architectures to support high data rates and low latencies in 5G networks. Fronthaul link is an obstacle in C-RANs implementation, due to its high cost and stringent requirements. The optical links are the most appropriate option to realize the fronthaul networks, but it increases the cost, and stringent performance requirements limit the link length to a few kilometers. To tackle these issues, extensive efforts have been devoted to designing the proficient fronthaul networks by applying the compression algorithms, software-defined techniques, and CPRI over Ethernet based solutions. In this paper, we evaluated the performance of passive optical networks (PON) based links for long-distance communications in fronthaul systems. We also determine the optimized location for adding the amplifiers in long-distance fronthaul links to connect the source and destination nodes without violating the performance requirements which results in the cost reduction. The simulation results showed the improvement in the long-distance PON-based fronthaul networks with the placement of the amplifier at an optimized location.
{"title":"A Performance Analysis of 5G Fronthaul Networks for Long-Distance Communications","authors":"Muhammad Waqar, Ajung Kim, Je Joon Yoon","doi":"10.1109/WD.2019.8734202","DOIUrl":"https://doi.org/10.1109/WD.2019.8734202","url":null,"abstract":"Cloud-radio access networks (C-RANs) are the evolving mobile communication architectures to support high data rates and low latencies in 5G networks. Fronthaul link is an obstacle in C-RANs implementation, due to its high cost and stringent requirements. The optical links are the most appropriate option to realize the fronthaul networks, but it increases the cost, and stringent performance requirements limit the link length to a few kilometers. To tackle these issues, extensive efforts have been devoted to designing the proficient fronthaul networks by applying the compression algorithms, software-defined techniques, and CPRI over Ethernet based solutions. In this paper, we evaluated the performance of passive optical networks (PON) based links for long-distance communications in fronthaul systems. We also determine the optimized location for adding the amplifiers in long-distance fronthaul links to connect the source and destination nodes without violating the performance requirements which results in the cost reduction. The simulation results showed the improvement in the long-distance PON-based fronthaul networks with the placement of the amplifier at an optimized location.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126084029","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}
There is growing interest in the application of wireless sensor networks to the problem of monitoring international borders. In this application, barrier coverage is essential in order to ensure that intrusion events are detected. The use of mobile sensors has the potential to enable barrier coverage to be achieved and maintained in hostile environments where the orderly deployment of sensors is impossible. In this paper, we present a distributed cellular automaton based algorithm for autonomous deployment of mobile sensors to achieve barrier coverage. We compare the algorithm with an existing, state-of-the-art algorithm and show that our proposed algorithm achieves barrier coverage with competitive or improved energy cost, and with a communication overhead that is orders of magnitude less. For dense deployment scenarios, our algorithm uses up to six times less energy than the state-of-the-art algorithm.
{"title":"A Distributed Cellular Automaton Algorithm for Barrier Formation in Mobile Sensor Networks","authors":"H. Lloyd, Mohammad Hammoudeh","doi":"10.1109/WD.2019.8734259","DOIUrl":"https://doi.org/10.1109/WD.2019.8734259","url":null,"abstract":"There is growing interest in the application of wireless sensor networks to the problem of monitoring international borders. In this application, barrier coverage is essential in order to ensure that intrusion events are detected. The use of mobile sensors has the potential to enable barrier coverage to be achieved and maintained in hostile environments where the orderly deployment of sensors is impossible. In this paper, we present a distributed cellular automaton based algorithm for autonomous deployment of mobile sensors to achieve barrier coverage. We compare the algorithm with an existing, state-of-the-art algorithm and show that our proposed algorithm achieves barrier coverage with competitive or improved energy cost, and with a communication overhead that is orders of magnitude less. For dense deployment scenarios, our algorithm uses up to six times less energy than the state-of-the-art algorithm.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131815084","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}
This paper aims to present DTNbox, an application for peer-to-peer directory synchronization between DTN nodes, suitable for challenged networks. By contrast to similar applications, DTNbox neither relies on a server node on Internet, which would be impractical in challenged networks, nor is restricted to direct pairing of devices, as in Bluetooth. To cope with possible link disruptions and long delays typical of challenged networks, DTNbox uses the Bundle Protocol (BP), running on top of other ordinary Transport protocols, such as TCP. In order to be compatible with all three major BP implementations, ION, DTN2 and IBR-DTN, DTNbox is built on top of an interface, called Abstraction Layer, which decouples the application from the specific BP implementation in use. DTNbox rationale, design and potential uses are fully described in the paper.
{"title":"DTNbox: a DTN Application for Peer-to-Peer Directory Synchronization","authors":"Marco Bertolazzi, C. Caini, Nicolò Castellazzi","doi":"10.1109/WD.2019.8734214","DOIUrl":"https://doi.org/10.1109/WD.2019.8734214","url":null,"abstract":"This paper aims to present DTNbox, an application for peer-to-peer directory synchronization between DTN nodes, suitable for challenged networks. By contrast to similar applications, DTNbox neither relies on a server node on Internet, which would be impractical in challenged networks, nor is restricted to direct pairing of devices, as in Bluetooth. To cope with possible link disruptions and long delays typical of challenged networks, DTNbox uses the Bundle Protocol (BP), running on top of other ordinary Transport protocols, such as TCP. In order to be compatible with all three major BP implementations, ION, DTN2 and IBR-DTN, DTNbox is built on top of an interface, called Abstraction Layer, which decouples the application from the specific BP implementation in use. DTNbox rationale, design and potential uses are fully described in the paper.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132445732","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}
I. Baig, U. Farooq, N. Hasan, Manaf Zghaibeh, V. Jeoti, M. Imran
Universal Filtered Multi-Carriers (UFMC) has become one of the favorable modulation systems for upcoming 5G Machine-Type Communications (MTC) communications due to its robustness against multiuser interference, fragmented spectrum suitability and short burst support. However, UFMC systems faces a challenging problem in the form of high Peak-to-Average Power Ratio (PAPR) at the transmitter side. The high PAPR value downplays the efficiency of UFMC transmitter. To counter the high PAPR values, in this work, a new Generalized Chirp-Like Precoding based UFMC (GCL-P-UFMC) system is proposed. The Monte-Carlo simulations of the proposed GCL-P-UFMC system indicate that the proposed system has low PAPR as compared to the conventional UFMC system and the Orthogonal Frequency Division Multiplexing (OFDM) system available in the literature. At a clip rate of 10−3, the proposed system gives on average 30% better PAPR results as compared to the conventional UFMC and OFDM systems.
{"title":"A Low PAPR Universal Filtered Multi-Carrier System for 5G Machine Type Communications","authors":"I. Baig, U. Farooq, N. Hasan, Manaf Zghaibeh, V. Jeoti, M. Imran","doi":"10.1109/WD.2019.8734188","DOIUrl":"https://doi.org/10.1109/WD.2019.8734188","url":null,"abstract":"Universal Filtered Multi-Carriers (UFMC) has become one of the favorable modulation systems for upcoming 5G Machine-Type Communications (MTC) communications due to its robustness against multiuser interference, fragmented spectrum suitability and short burst support. However, UFMC systems faces a challenging problem in the form of high Peak-to-Average Power Ratio (PAPR) at the transmitter side. The high PAPR value downplays the efficiency of UFMC transmitter. To counter the high PAPR values, in this work, a new Generalized Chirp-Like Precoding based UFMC (GCL-P-UFMC) system is proposed. The Monte-Carlo simulations of the proposed GCL-P-UFMC system indicate that the proposed system has low PAPR as compared to the conventional UFMC system and the Orthogonal Frequency Division Multiplexing (OFDM) system available in the literature. At a clip rate of 10−3, the proposed system gives on average 30% better PAPR results as compared to the conventional UFMC and OFDM systems.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127397890","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}
Jackline Nakazibwe, J. Serugunda, R. Akol, Stephen S. Mwanje
Cloud radio access network architecture has become increasingly important in meeting the growing demand of high data rate services as well as managing interference among base station sites. However, this architecture is associated with high fronthaul link latencies that result into increased overall network latencies. This paper proposes a placement method for baseband units so as to lower the fronthaul link latencies. This is achieved by formulating the problem as a nonlinear optimization problem that is solved by fuzzy c-means clustering and a heuristic genetic based algorithm. The paper further investigates the user response time comparing it with the scenario before optimizing location of baseband units in edge clouds. Simulation results show that the proposed scheme greatly reduces overall fronthaul link latencies and cost of ownership in cloud radio access networks. We also show that there is an optimal number of edge clouds with baseband units for different cloud radio access network sizes. On the side of the users, the response time is greatly reduced when the baseband units are optimally placed.
{"title":"Optimizing Location of Edge Clouds with Baseband Units in Cloud Radio Access Network","authors":"Jackline Nakazibwe, J. Serugunda, R. Akol, Stephen S. Mwanje","doi":"10.1109/WD.2019.8734222","DOIUrl":"https://doi.org/10.1109/WD.2019.8734222","url":null,"abstract":"Cloud radio access network architecture has become increasingly important in meeting the growing demand of high data rate services as well as managing interference among base station sites. However, this architecture is associated with high fronthaul link latencies that result into increased overall network latencies. This paper proposes a placement method for baseband units so as to lower the fronthaul link latencies. This is achieved by formulating the problem as a nonlinear optimization problem that is solved by fuzzy c-means clustering and a heuristic genetic based algorithm. The paper further investigates the user response time comparing it with the scenario before optimizing location of baseband units in edge clouds. Simulation results show that the proposed scheme greatly reduces overall fronthaul link latencies and cost of ownership in cloud radio access networks. We also show that there is an optimal number of edge clouds with baseband units for different cloud radio access network sizes. On the side of the users, the response time is greatly reduced when the baseband units are optimally placed.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123294128","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
扫码关注我们
求助内容：
应助结果提醒方式：