Farhan Ahmad, A. Adnane, Fatih Kurugollu, Rasheed Hussain
Vehicular Ad-hoc NETwork (VANET) is a vital transportation technology that facilitates the vehicles to share sensitive information (such as steep-curve warnings and black ice on the road) with each other and with the surrounding infrastructure in real-time to avoid accidents and enable comfortable driving experience.To achieve these goals, VANET requires a secure environment for authentic, reliable and trusted information dissemination among the network entities. However, VANET is prone to different attacks resulting in the dissemination of compromised/false information among network nodes. One way to manage a secure and trusted network is to introduce trust among the vehicular nodes. To this end, various Trust Models (TMs) are developed for VANET and can be broadly categorized into three classes, Entity-oriented Trust Models (ETM), Data oriented Trust Models (DTM) and Hybrid Trust Models (HTM). These TMs evaluate trust based on the received information (data), the vehicle (entity) or both through different mechanisms. In this paper, we present a comparative study of the three TMs. Furthermore, we evaluate these TMs against the different trust, security and quality-of-service related benchmarks. Simulation results revealed that all these TMs have deficiencies in terms of end-to-end delays, event detection probabilities and false positive rates. This study can be used as a guideline for researchers to design new efficient and effective TMs for VANET.
{"title":"A Comparative Analysis of Trust Models for Safety Applications in IoT-enabled Vehicular Networks","authors":"Farhan Ahmad, A. Adnane, Fatih Kurugollu, Rasheed Hussain","doi":"10.1109/WD.2019.8734204","DOIUrl":"https://doi.org/10.1109/WD.2019.8734204","url":null,"abstract":"Vehicular Ad-hoc NETwork (VANET) is a vital transportation technology that facilitates the vehicles to share sensitive information (such as steep-curve warnings and black ice on the road) with each other and with the surrounding infrastructure in real-time to avoid accidents and enable comfortable driving experience.To achieve these goals, VANET requires a secure environment for authentic, reliable and trusted information dissemination among the network entities. However, VANET is prone to different attacks resulting in the dissemination of compromised/false information among network nodes. One way to manage a secure and trusted network is to introduce trust among the vehicular nodes. To this end, various Trust Models (TMs) are developed for VANET and can be broadly categorized into three classes, Entity-oriented Trust Models (ETM), Data oriented Trust Models (DTM) and Hybrid Trust Models (HTM). These TMs evaluate trust based on the received information (data), the vehicle (entity) or both through different mechanisms. In this paper, we present a comparative study of the three TMs. Furthermore, we evaluate these TMs against the different trust, security and quality-of-service related benchmarks. Simulation results revealed that all these TMs have deficiencies in terms of end-to-end delays, event detection probabilities and false positive rates. This study can be used as a guideline for researchers to design new efficient and effective TMs for VANET.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"30 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":"125486822","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}
Traffic classification (TC) is a fundamental task of network management and monitoring operations. Previous works relying on selected packet header fields (e.g. port numbers) or application layer protocol decoding techniques are becoming increasingly difficult and inefficient when facing encrypted traffic and peer-to-peer flows. In this paper, we address the problem of flow based TC using machine learning (ML) algorithms. Our work considers a supervised approach, namely eXtreme Gradient Boosting (XGBoost) algorithm, which has never been investigated for TC. Performance evaluation results show that we obtain 99.5% accuracy on a dataset containing real flows. Additionally, compared to other ML algorithms, XGBoost is the most accurate one.
{"title":"On using eXtreme Gradient Boosting (XGBoost) Machine Learning algorithm for Home Network Traffic Classification","authors":"Iyad Lahsen Cherif, A. Kortebi","doi":"10.1109/WD.2019.8734193","DOIUrl":"https://doi.org/10.1109/WD.2019.8734193","url":null,"abstract":"Traffic classification (TC) is a fundamental task of network management and monitoring operations. Previous works relying on selected packet header fields (e.g. port numbers) or application layer protocol decoding techniques are becoming increasingly difficult and inefficient when facing encrypted traffic and peer-to-peer flows. In this paper, we address the problem of flow based TC using machine learning (ML) algorithms. Our work considers a supervised approach, namely eXtreme Gradient Boosting (XGBoost) algorithm, which has never been investigated for TC. Performance evaluation results show that we obtain 99.5% accuracy on a dataset containing real flows. Additionally, compared to other ML algorithms, XGBoost is the most accurate one.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"48 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":"127967146","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}
M. Tropea, A. Santamaria, Giuseppe Potrino, F. Rango
Unmanned Aerial Vehicles (UAVs) are one of the most important areas of technological research thanks to its rapid development. They find application in many aspects of real world such as precision agriculture where they are able to give a ’big hand’ to the farmers’ issues. This paper deals with the use of UAVs, also called drones, in the precision agriculture domain in order to face parasites or sudden climate changes issues that can severely affect the agricultural products quality. These new technologies can support farmers to face the threats and, in the specific case, to kill parasites that can destroy plants in the cultivated field. In this work a recruiting protocol based on a bio-inspired approach is presented, showing the performance of the proposed mechanism varying different algorithm parameters in order to tune in appropriate way the algorithm implementation.
{"title":"Bio-Inspired Recruiting Protocol for FANET in Precision Agriculture Domains: Pheromone Parameters Tuning","authors":"M. Tropea, A. Santamaria, Giuseppe Potrino, F. Rango","doi":"10.1109/WD.2019.8734209","DOIUrl":"https://doi.org/10.1109/WD.2019.8734209","url":null,"abstract":"Unmanned Aerial Vehicles (UAVs) are one of the most important areas of technological research thanks to its rapid development. They find application in many aspects of real world such as precision agriculture where they are able to give a ’big hand’ to the farmers’ issues. This paper deals with the use of UAVs, also called drones, in the precision agriculture domain in order to face parasites or sudden climate changes issues that can severely affect the agricultural products quality. These new technologies can support farmers to face the threats and, in the specific case, to kill parasites that can destroy plants in the cultivated field. In this work a recruiting protocol based on a bio-inspired approach is presented, showing the performance of the proposed mechanism varying different algorithm parameters in order to tune in appropriate way the algorithm implementation.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"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":"133526720","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}
We revisit the user scheduling problem on the downlink of OFDMA cellular networks. Our aim is to find the optimal system-wide schedule of a multi-cell system to understand how much a fully coordinated scheduling could improve performance. It is a highly non-convex integer problem. We propose a method to upper bound this problem by a signo-mial programming problem that can be solved. The solution to the signomial problem can be used to derive a feasible solution to the original global scheduling problem. We show numerically that the gap between the upper bound and that feasible solution is very small. We then provide results both for homogeneous and heterogeneous networks. In the homogeneous case, we show that the coordinated scheduling significantly outperforms a simple benchmark that uses a local scheduling based on equal power. However, the centralized scheduler is very complex and it requires all the channel state information in the system. Therefore, we use the feasible solutions to the system-wide problem to derive a practical scheme based on a well-parameterized soft frequency reuse and a simple local scheduler. We show that the coordinated scheduling performs only 20% better than this practical scheme. The method we study can also be applied to obtain an upper bound for the case of heterogeneous networks. We compare the solution obtained by fully coordinating the scheduling of all the base stations with practical schemes inspired by the one obtained for the homogeneous case and show that the difference between the upper bound and the performance of the best of these schemes is 21%, which again questions the need for coordination.
{"title":"Revisiting Downlink Scheduling in a Multi-Cell OFDMA Network: From Full Base Station Coordination to Practical Schemes","authors":"Yigit Ozcan, C. Rosenberg","doi":"10.1109/WD.2019.8734248","DOIUrl":"https://doi.org/10.1109/WD.2019.8734248","url":null,"abstract":"We revisit the user scheduling problem on the downlink of OFDMA cellular networks. Our aim is to find the optimal system-wide schedule of a multi-cell system to understand how much a fully coordinated scheduling could improve performance. It is a highly non-convex integer problem. We propose a method to upper bound this problem by a signo-mial programming problem that can be solved. The solution to the signomial problem can be used to derive a feasible solution to the original global scheduling problem. We show numerically that the gap between the upper bound and that feasible solution is very small. We then provide results both for homogeneous and heterogeneous networks. In the homogeneous case, we show that the coordinated scheduling significantly outperforms a simple benchmark that uses a local scheduling based on equal power. However, the centralized scheduler is very complex and it requires all the channel state information in the system. Therefore, we use the feasible solutions to the system-wide problem to derive a practical scheme based on a well-parameterized soft frequency reuse and a simple local scheduler. We show that the coordinated scheduling performs only 20% better than this practical scheme. The method we study can also be applied to obtain an upper bound for the case of heterogeneous networks. We compare the solution obtained by fully coordinating the scheduling of all the base stations with practical schemes inspired by the one obtained for the homogeneous case and show that the difference between the upper bound and the performance of the best of these schemes is 21%, which again questions the need for coordination.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"75 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":"131711718","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}
Khadidja Tisseli, Chafika Benzaid, Noureddine Lasla, N. Badache
Relay node placement can be an effective mean for boosting the performance of a Wireless Sensor Network (WSN) in terms of several metrics such as network connectivity, network lifetime and fault tolerance. In this paper, we consider the problem of deploying relay nodes (RNs) in a WSN to ensure network connectivity. We propose a novel heuristic to find a minimum number of RNs together with their locations needed in order to repair a disconnected network with a grid topology. We first determine the optimal solution for connecting a set of four disconnected nodes and then, by applying our heuristic, we ensure connectivity between these sets via steinerized edges. The runtime complexity of the proposed heuristic is quasilinear in the number of nodes, which is lower than competitive approaches. In addition to that, our heuristic can achieve network connectivity using 32% less of RNs. The performances of the proposed heuristic are validated through simulations.
{"title":"Connectivity-aware Relay Node Deployment in Grid-based Wireless Sensor Networks","authors":"Khadidja Tisseli, Chafika Benzaid, Noureddine Lasla, N. Badache","doi":"10.1109/WD.2019.8734234","DOIUrl":"https://doi.org/10.1109/WD.2019.8734234","url":null,"abstract":"Relay node placement can be an effective mean for boosting the performance of a Wireless Sensor Network (WSN) in terms of several metrics such as network connectivity, network lifetime and fault tolerance. In this paper, we consider the problem of deploying relay nodes (RNs) in a WSN to ensure network connectivity. We propose a novel heuristic to find a minimum number of RNs together with their locations needed in order to repair a disconnected network with a grid topology. We first determine the optimal solution for connecting a set of four disconnected nodes and then, by applying our heuristic, we ensure connectivity between these sets via steinerized edges. The runtime complexity of the proposed heuristic is quasilinear in the number of nodes, which is lower than competitive approaches. In addition to that, our heuristic can achieve network connectivity using 32% less of RNs. The performances of the proposed heuristic are validated through simulations.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"82 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":"131878330","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}
Franco Minucci, E. Vinogradov, Hazem Sallouha, S. Pollin
To enable widespread and safe use of drone technologies, it is fundamental to design sense and avoid solutions with low-cost and reliable performance. To this end, broadcasting the drone location and speed is an essential safety requirement. This paper presents a method to broadcast short messages within the SSID of a Wi-Fi network. As a relevant example, we propose to use such messages to broadcast the position and speed of UAVs in a fashion that resembles the ADS-B used in Airplanes. Unlike the existing sense and avoid methods, our approach provides two main advantages. Firstly, it operates in a broadcast manner, meaning that no delay is imposed by establishing a connection. Secondly, no custom hardware is required. Nonetheless, a tradeoff must be made between spending time broadcasting messages and data communication using an actual Wi-Fi connection. Therefore, we introduce a practical broadcast and receive protocol which improves receiving reliability and robustness against jamming. To validate our approach, extensive measurements of broadcast delivery rates have been conducted for multiple broadcasting strategies and the results are presented.
{"title":"UAV Location Broadcasting with Wi-Fi SSID","authors":"Franco Minucci, E. Vinogradov, Hazem Sallouha, S. Pollin","doi":"10.1109/WD.2019.8734208","DOIUrl":"https://doi.org/10.1109/WD.2019.8734208","url":null,"abstract":"To enable widespread and safe use of drone technologies, it is fundamental to design sense and avoid solutions with low-cost and reliable performance. To this end, broadcasting the drone location and speed is an essential safety requirement. This paper presents a method to broadcast short messages within the SSID of a Wi-Fi network. As a relevant example, we propose to use such messages to broadcast the position and speed of UAVs in a fashion that resembles the ADS-B used in Airplanes. Unlike the existing sense and avoid methods, our approach provides two main advantages. Firstly, it operates in a broadcast manner, meaning that no delay is imposed by establishing a connection. Secondly, no custom hardware is required. Nonetheless, a tradeoff must be made between spending time broadcasting messages and data communication using an actual Wi-Fi connection. Therefore, we introduce a practical broadcast and receive protocol which improves receiving reliability and robustness against jamming. To validate our approach, extensive measurements of broadcast delivery rates have been conducted for multiple broadcasting strategies and the results are presented.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"4 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":"133311165","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}
Zohaib A. Farhat, Mostafa H. Ahfayd, P. Mather, M. Sibley
Offset pulse position modulation (OPPM) the signal modulation scheme offers key advantages compared to other existing pulse position modulation (PPM) schemes, namely greater sensitivity and reduced bandwidth expansion. Most error correction schemes result in bandwidth reduction of the system. This work shows that the bit-error rate (BER) of the OPPM scheme can be further improved using a priority decoding method, without additional expansion in bandwidth. An experimental link incorporating visible light communication (VLC) system based on ‘cool’ 30 W LED was used. This study also addresses the difference of using cool and warm white LEDs for a VLC system. The experimental results show cool white LED achieves improved performance compared to previously studied warm white LED. The OPPM scheme, along with priority decoding, was implemented on FPGA, using VHDL. This study compares the BER results between original and improved OPPM, showing significant improvement in BER of priority decoding OPPM. The analysis has also been made on how the priority decoding operates and limitations of the system.
偏置脉冲位置调制(OPPM)信号调制方案与其他现有脉冲位置调制(PPM)方案相比具有关键优势，即更高的灵敏度和更小的带宽扩展。大多数纠错方案都会导致系统带宽的减少。这项工作表明，OPPM方案的误码率(BER)可以使用优先解码方法进一步提高，而不需要额外的带宽扩展。实验环节采用了基于“cool”30 W LED的可见光通信(VLC)系统。本研究还讨论了在VLC系统中使用冷白光和暖白光led的差异。实验结果表明，冷白光LED的性能比以往研究的暖白光LED有所提高。OPPM方案以及优先解码在FPGA上使用VHDL实现。本研究比较了原始和改进后的OPPM的误码率结果，发现优先解码OPPM的误码率有显著提高。分析了优先解码的工作原理和系统的局限性。
{"title":"Improved BER for offset pulse position modulation using priority decoding over VLC system","authors":"Zohaib A. Farhat, Mostafa H. Ahfayd, P. Mather, M. Sibley","doi":"10.1109/WD.2019.8734159","DOIUrl":"https://doi.org/10.1109/WD.2019.8734159","url":null,"abstract":"Offset pulse position modulation (OPPM) the signal modulation scheme offers key advantages compared to other existing pulse position modulation (PPM) schemes, namely greater sensitivity and reduced bandwidth expansion. Most error correction schemes result in bandwidth reduction of the system. This work shows that the bit-error rate (BER) of the OPPM scheme can be further improved using a priority decoding method, without additional expansion in bandwidth. An experimental link incorporating visible light communication (VLC) system based on ‘cool’ 30 W LED was used. This study also addresses the difference of using cool and warm white LEDs for a VLC system. The experimental results show cool white LED achieves improved performance compared to previously studied warm white LED. The OPPM scheme, along with priority decoding, was implemented on FPGA, using VHDL. This study compares the BER results between original and improved OPPM, showing significant improvement in BER of priority decoding OPPM. The analysis has also been made on how the priority decoding operates and limitations of the system.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"32 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":"132928660","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}
A. Amantayeva, Moldir Yerzhanova, Refik Caglar Kizilirmak
Small-scale unmanned aerial vehicles (UAVs) are considered to support vehicular networks in the form of air-to-ground communication. In this paper, we consider a VLC based air-to-ground communication channel where the small-scale UAV provides multiple access to a cluster of cars. The simulation results reveal that the UAV position influences the capacity of each car with the cars that are closer to the UAV achieving higher capacity. Furthermore, the optimum location of the UAV is found to be the location closer to the car with high data rate demand. Another result of the paper is that larger number of cars in the system leads to smaller improvement in the sum capacity compared to non-optimized UAV position scenario.
{"title":"UAV Location Optimization for UAV-to-Vehicle Multiple Access Channel with Visible Light Communication","authors":"A. Amantayeva, Moldir Yerzhanova, Refik Caglar Kizilirmak","doi":"10.1109/WD.2019.8734156","DOIUrl":"https://doi.org/10.1109/WD.2019.8734156","url":null,"abstract":"Small-scale unmanned aerial vehicles (UAVs) are considered to support vehicular networks in the form of air-to-ground communication. In this paper, we consider a VLC based air-to-ground communication channel where the small-scale UAV provides multiple access to a cluster of cars. The simulation results reveal that the UAV position influences the capacity of each car with the cars that are closer to the UAV achieving higher capacity. Furthermore, the optimum location of the UAV is found to be the location closer to the car with high data rate demand. Another result of the paper is that larger number of cars in the system leads to smaller improvement in the sum capacity compared to non-optimized UAV position scenario.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"1 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":"133835567","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}
T. Jang, Seongbae Jun, Seung Hun Kim, H. Son, D. Kang, Hyuncheol Park, C. Park
In this work, a 120 GHz wireless link for on-board chip-to-chip communication is presented for the case of a 20 mm transmission distance. A Y-shaped antenna is used for wideband, on-board connection, and a PA-antenna-LNA link is measured to evaluate the performance of the channel. The proposed link shows a 3.2 dB peak gain and a 14 GHz, 4 dB gain bandwidth. The 50 Gbps data transmission simulation in the 16-QAM modulation format is carried out. Although the nonideal characteristics of the wireless link cause interference among symbols, the interference can be suppressed by the use of a linear equalizer. Further work on the transmission between transmitter and receiver will be performed.
{"title":"Millimeter Wave Wireless Link for On-board Chip to Chip Communication","authors":"T. Jang, Seongbae Jun, Seung Hun Kim, H. Son, D. Kang, Hyuncheol Park, C. Park","doi":"10.1109/WD.2019.8734216","DOIUrl":"https://doi.org/10.1109/WD.2019.8734216","url":null,"abstract":"In this work, a 120 GHz wireless link for on-board chip-to-chip communication is presented for the case of a 20 mm transmission distance. A Y-shaped antenna is used for wideband, on-board connection, and a PA-antenna-LNA link is measured to evaluate the performance of the channel. The proposed link shows a 3.2 dB peak gain and a 14 GHz, 4 dB gain bandwidth. The 50 Gbps data transmission simulation in the 16-QAM modulation format is carried out. Although the nonideal characteristics of the wireless link cause interference among symbols, the interference can be suppressed by the use of a linear equalizer. Further work on the transmission between transmitter and receiver will be performed.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"6 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":"121951814","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}
LoRa is a recent low-power and long-range sub-GHz radio technology where devices can communicate in 1-hop to a gateway several kilometers away. Long-range radios typically remove the complexity of maintaining a multi-hop network with intermediate nodes for relaying information. Nonetheless, even with the increased range, 1-hop connectivity can be difficult to achieve in real-world deployment scenario, especially for remote and rural areas where density of gateways is low and where devices/gateway are usually deployed for a specific application. This article describes a 2-hop LoRa approach to seamlessly extend a deployed LoRa network in order to reduce both packet losses and transmission cost. We introduce a smart and battery-operated relay-device that can be added after a deployment campaign to transparently provide an extra hop between the remote devices and the gateway. Field tests are conducted to assess network reliability by dynamic insertion of a relay-device between the remote end-devices and the gateway, without advertising its presence. Energy consumption is also discussed.
{"title":"Increased flexibility in long-range IoT deployments with transparent and light-weight 2-hop LoRa approach","authors":"M. Diop, C. Pham","doi":"10.1109/WD.2019.8734228","DOIUrl":"https://doi.org/10.1109/WD.2019.8734228","url":null,"abstract":"LoRa is a recent low-power and long-range sub-GHz radio technology where devices can communicate in 1-hop to a gateway several kilometers away. Long-range radios typically remove the complexity of maintaining a multi-hop network with intermediate nodes for relaying information. Nonetheless, even with the increased range, 1-hop connectivity can be difficult to achieve in real-world deployment scenario, especially for remote and rural areas where density of gateways is low and where devices/gateway are usually deployed for a specific application. This article describes a 2-hop LoRa approach to seamlessly extend a deployed LoRa network in order to reduce both packet losses and transmission cost. We introduce a smart and battery-operated relay-device that can be added after a deployment campaign to transparently provide an extra hop between the remote devices and the gateway. Field tests are conducted to assess network reliability by dynamic insertion of a relay-device between the remote end-devices and the gateway, without advertising its presence. Energy consumption is also discussed.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"1 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":"123492246","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
扫码关注我们
求助内容：
应助结果提醒方式：