Pub Date : 2019-02-25DOI: 10.1109/CCNC.2019.8651793
S. Raza, T. Lee, Georgios Exarchakos, M. Günes
Future industrial low-power wireless networks together with cyber-physical systems demand mobile nodes to support diverse applications so as to increase operational efficiency and ensure autonomy. Mobility induces several challenges for low-power lossy networks due to dynamic topology, RF link instability, synchronization loss, signaling overhead, which lead to significant packet loss, more energy consumption, and higher latency. In this paper, we study a widely adopted time-slotted channel hopping (TSCH) MAC protocol in the presence of mobile nodes. We analyze how mobility impacts its reliability in terms of synchronization, message overhead, latency, and energy. The evaluation is performed through simulation and the results show that mobility may cause significant network downtime where nodes are unable to associate to the network for long period of time because of synchronization loss, especially if the environment is not fully covered by static nodes. Association and disassociation issues, induced by mobility, cause frequent disruptions in the network. Although, TSCH can handle mobility if the network space in which mobile nodes are evolving is fully covered by static nodes or there are enough mobile nodes to maintain a consistent coverage. However, the amount of message overhead to maintain synchronization is higher which impacts the reliability of the protocol in terms of energy and latency.
{"title":"A Reliability Analysis of TSCH Protocol in a Mobile Scenario","authors":"S. Raza, T. Lee, Georgios Exarchakos, M. Günes","doi":"10.1109/CCNC.2019.8651793","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651793","url":null,"abstract":"Future industrial low-power wireless networks together with cyber-physical systems demand mobile nodes to support diverse applications so as to increase operational efficiency and ensure autonomy. Mobility induces several challenges for low-power lossy networks due to dynamic topology, RF link instability, synchronization loss, signaling overhead, which lead to significant packet loss, more energy consumption, and higher latency. In this paper, we study a widely adopted time-slotted channel hopping (TSCH) MAC protocol in the presence of mobile nodes. We analyze how mobility impacts its reliability in terms of synchronization, message overhead, latency, and energy. The evaluation is performed through simulation and the results show that mobility may cause significant network downtime where nodes are unable to associate to the network for long period of time because of synchronization loss, especially if the environment is not fully covered by static nodes. Association and disassociation issues, induced by mobility, cause frequent disruptions in the network. Although, TSCH can handle mobility if the network space in which mobile nodes are evolving is fully covered by static nodes or there are enough mobile nodes to maintain a consistent coverage. However, the amount of message overhead to maintain synchronization is higher which impacts the reliability of the protocol in terms of energy and latency.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129802302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-02-25DOI: 10.1109/CCNC.2019.8651802
J. W. Lee, Minsig Han, C. Kang, M. Rim
Massive MIMO is a key feature for improving spectral efficiency in 5G system. Since massive MIMO has been standardized in 3GPP Re1-13 (LTE-Advanced Pro), a next generation of massive MIMO standard is now available in Rel-15, a.k.a New Radio (NR), for 5G, which is aiming at further improving the average spectral efficiency with more antenna elements over the higher frequency band. In particular, beam-based air interface for above 6GHz band involves with various antenna configurations and feedback schemes, requiring a more complex testbed for system-level performance evaluation. In this paper, we examine the multi-antenna technologies in 3GPP NR specification, so as to develop its system-level model in 5G K-SimSys, which has been designed and implemented to provide an open platform and testbed for evaluating the system-level performance for 5G system. Its actual implementation is detailed along with the overall platform architecture for modular and flexible design. Then, its actual performance is demonstrated for one of the precoding matrices in the NR specification as an example.
{"title":"5G K-SimSys for System-level Evaluation of Massive MIMO","authors":"J. W. Lee, Minsig Han, C. Kang, M. Rim","doi":"10.1109/CCNC.2019.8651802","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651802","url":null,"abstract":"Massive MIMO is a key feature for improving spectral efficiency in 5G system. Since massive MIMO has been standardized in 3GPP Re1-13 (LTE-Advanced Pro), a next generation of massive MIMO standard is now available in Rel-15, a.k.a New Radio (NR), for 5G, which is aiming at further improving the average spectral efficiency with more antenna elements over the higher frequency band. In particular, beam-based air interface for above 6GHz band involves with various antenna configurations and feedback schemes, requiring a more complex testbed for system-level performance evaluation. In this paper, we examine the multi-antenna technologies in 3GPP NR specification, so as to develop its system-level model in 5G K-SimSys, which has been designed and implemented to provide an open platform and testbed for evaluating the system-level performance for 5G system. Its actual implementation is detailed along with the overall platform architecture for modular and flexible design. Then, its actual performance is demonstrated for one of the precoding matrices in the NR specification as an example.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132941333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-12DOI: 10.1109/CCNC.2019.8651873
P. Couderc, Y. Maurel
Confidence in location is increasingly important in many applications. This is particularly true in augmented reality applications such as games. Users have an interest in being able to lie about their location. Location reporting methods implemented in existing services are weakly protected: it is often possible to lie in simple cases or to emit signals that deceive the more cautious systems. This paper proposes to observe the Wi-Fi routers near the user‘s location to strengthen confidence in the reported positions so as to complicate the task of an attacker. More particularly we are interested in the observation of the timestamps issued in the beacons of the access points. We show that this method is simple to implement, that it does not require any modification of existing hardware, that it is passive and that it significantly thwart the task of an attacker.
{"title":"Location corroboration using passive observations of IEEE 802.11 Access Points","authors":"P. Couderc, Y. Maurel","doi":"10.1109/CCNC.2019.8651873","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651873","url":null,"abstract":"Confidence in location is increasingly important in many applications. This is particularly true in augmented reality applications such as games. Users have an interest in being able to lie about their location. Location reporting methods implemented in existing services are weakly protected: it is often possible to lie in simple cases or to emit signals that deceive the more cautious systems. This paper proposes to observe the Wi-Fi routers near the user‘s location to strengthen confidence in the reported positions so as to complicate the task of an attacker. More particularly we are interested in the observation of the timestamps issued in the beacons of the access points. We show that this method is simple to implement, that it does not require any modification of existing hardware, that it is passive and that it significantly thwart the task of an attacker.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124566182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-12DOI: 10.1109/CCNC.2019.8651730
Jinsol Park, Yujin Sim, Gangminh Lee, D. Cho
This paper proposes an electric vehicle (EV) scheduling algorithm with fuzzy logic control in smart charging network in order to improve the charging performance of the network significantly. The fuzzy logic control helps that the EV scheduling algorithm determines the proper pair of charging station (CS) and EV logically. The fuzzy inference system determines a weight value by reflecting the multiple charging requirements such as distance between EV and CS, charging time, and charging speed. The weight value describes an EV charging priority, and is used in the scheduling algorithm. The proposed scheduling algorithm focuses on avoiding EV congestion at the CS by reducing the waiting time for charging and balancing charging request rate, which shows how the EV is distributed to the CS with balancing the number of available charging pads. In order to compare the performance of the proposed scheduling algorithm with that of conventional algorithms, the random and max weight scheduling algorithm are also considered. The simulation results show that the proposed scheduling algorithm can improve the performance of the smart charging network in view of waiting time for charging and balancing of charging request rate.
{"title":"A Fuzzy Logic Based Electric Vehicle Scheduling in Smart Charging Network","authors":"Jinsol Park, Yujin Sim, Gangminh Lee, D. Cho","doi":"10.1109/CCNC.2019.8651730","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651730","url":null,"abstract":"This paper proposes an electric vehicle (EV) scheduling algorithm with fuzzy logic control in smart charging network in order to improve the charging performance of the network significantly. The fuzzy logic control helps that the EV scheduling algorithm determines the proper pair of charging station (CS) and EV logically. The fuzzy inference system determines a weight value by reflecting the multiple charging requirements such as distance between EV and CS, charging time, and charging speed. The weight value describes an EV charging priority, and is used in the scheduling algorithm. The proposed scheduling algorithm focuses on avoiding EV congestion at the CS by reducing the waiting time for charging and balancing charging request rate, which shows how the EV is distributed to the CS with balancing the number of available charging pads. In order to compare the performance of the proposed scheduling algorithm with that of conventional algorithms, the random and max weight scheduling algorithm are also considered. The simulation results show that the proposed scheduling algorithm can improve the performance of the smart charging network in view of waiting time for charging and balancing of charging request rate.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129963619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-11DOI: 10.1109/CCNC.2019.8651788
P. Urien
Trusted transaction, i.e., private keys protection and malware avoidance is a critical issue for blockchain platforms. This demonstration presents an innovative crypto terminal, whose security relies on two pillars, secure element and full firmware programming. The device uses open hardware and firmware. Its security policy is similar to bank card terminal. A crypto terminal enforces secure key storage, trusted signature, and is able to generate blockchain transactions.
{"title":"Crypto Terminal Based On Secure Element For Consumer Trusted Blockchain Transactions","authors":"P. Urien","doi":"10.1109/CCNC.2019.8651788","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651788","url":null,"abstract":"Trusted transaction, i.e., private keys protection and malware avoidance is a critical issue for blockchain platforms. This demonstration presents an innovative crypto terminal, whose security relies on two pillars, secure element and full firmware programming. The device uses open hardware and firmware. Its security policy is similar to bank card terminal. A crypto terminal enforces secure key storage, trusted signature, and is able to generate blockchain transactions.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123273491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-11DOI: 10.1109/CCNC.2019.8651702
Chitradeep Majumdar, M. López-Benítez, S. Merchant
This work proposes a novel experimental and mathematical framework to determine the statistical models for the Internet of Things (IoT) data traffic. Conventionally, it is assumed that the data packet generation for IoT based applications follows a Poisson process with exponentially distributed packet inter-arrival time. Based on such generalized premise, majority of the network related theoretical and practical analysis of the IoT platforms are carried out. Based on empirical data for a smart home application recorded for over 10 weeks duration using proposed IoT subsystem, in this paper we estimate the empirical statistical distribution of the IoT data traffic generated by temperature, light intensity and motion sensors. The inter-arrival between the data packets generated from different sensing modules of the IoT smart home application subsystem is determined. The Empirical Cumulative Distribution Function (ECDF) of the estimated time duration is fitted with few of the well-established classical statistical distributions using Method of Moments (MoM) and Maximum Likelihood (ML) estimation techniques. The goodness of fit is quantified using Kolmogrov-Smirnov (KS) test. The parameters of the fitted distributions are determined as a function of the physical input parameters. The results reveal source IoT traffic does not follow a Poisson process which is conventionally assumed in the literature, but rather depends on the type of application.
{"title":"Experimental Evaluation of the Poissoness of Real Sensor Data Traffic in the Internet of Things","authors":"Chitradeep Majumdar, M. López-Benítez, S. Merchant","doi":"10.1109/CCNC.2019.8651702","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651702","url":null,"abstract":"This work proposes a novel experimental and mathematical framework to determine the statistical models for the Internet of Things (IoT) data traffic. Conventionally, it is assumed that the data packet generation for IoT based applications follows a Poisson process with exponentially distributed packet inter-arrival time. Based on such generalized premise, majority of the network related theoretical and practical analysis of the IoT platforms are carried out. Based on empirical data for a smart home application recorded for over 10 weeks duration using proposed IoT subsystem, in this paper we estimate the empirical statistical distribution of the IoT data traffic generated by temperature, light intensity and motion sensors. The inter-arrival between the data packets generated from different sensing modules of the IoT smart home application subsystem is determined. The Empirical Cumulative Distribution Function (ECDF) of the estimated time duration is fitted with few of the well-established classical statistical distributions using Method of Moments (MoM) and Maximum Likelihood (ML) estimation techniques. The goodness of fit is quantified using Kolmogrov-Smirnov (KS) test. The parameters of the fitted distributions are determined as a function of the physical input parameters. The results reveal source IoT traffic does not follow a Poisson process which is conventionally assumed in the literature, but rather depends on the type of application.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126573376","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-11DOI: 10.1109/CCNC.2019.8651843
Ghada Jaber, Rahim Kacimi, T. Gayraud
The Content Centric Networking (CCN) is an emerging paradigm that grounds networking primitives on content names rather than node locators. CCN targets seamless mobility, native muti-cast/multipath support, and content oriented security to better reflect the needs of today users. CCN could greatly improve the efficiency of content delivery also in Wireless Sensor Networks (WSNs). In such a context, we place our attention on the energy efficiency of caching content placement. Our objective is to save energy while achieving a high interest satisfaction rate by study the impact of certain parameters on caching strategy. To this end, we come up with a collaborative on path caching strategy that exploits the node degree and its distance from the source. Through extensive simulations, we demonstrate that our approach achieves a energy efficiency compared to a LCE (Leave Copy Everywhere) while ensuring a good cahe hit then an important interest satosfaction rate.
{"title":"Efficient Interest Satisfaction in Content Centric Wireless Sensor Networks","authors":"Ghada Jaber, Rahim Kacimi, T. Gayraud","doi":"10.1109/CCNC.2019.8651843","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651843","url":null,"abstract":"The Content Centric Networking (CCN) is an emerging paradigm that grounds networking primitives on content names rather than node locators. CCN targets seamless mobility, native muti-cast/multipath support, and content oriented security to better reflect the needs of today users. CCN could greatly improve the efficiency of content delivery also in Wireless Sensor Networks (WSNs). In such a context, we place our attention on the energy efficiency of caching content placement. Our objective is to save energy while achieving a high interest satisfaction rate by study the impact of certain parameters on caching strategy. To this end, we come up with a collaborative on path caching strategy that exploits the node degree and its distance from the source. Through extensive simulations, we demonstrate that our approach achieves a energy efficiency compared to a LCE (Leave Copy Everywhere) while ensuring a good cahe hit then an important interest satosfaction rate.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114412334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-11DOI: 10.1109/CCNC.2019.8651774
A. Vegni, V. Loscrí, P. Manzoni
In this work, we demonstrate that Vehicular Social Networks (VSNs) require specific data dissemination techniques. To this aim, we consider the Barabási model and we study the impact of its use for data dissemination in VSNs. Moreover, the use of a probabilistic data dissemination protocol based on social features [1] proves that the time-evolving dynamics of the vehicular social network graph presents a small-world structure, where nodes tend to connect through clusters whose average distance is low on average. This result highlights how VSNs are a specific class of vehicular ad hoc networks with peculiar features that distinguish them from classical online social networks.
{"title":"Analysis of Small-World Features in Vehicular Social Networks","authors":"A. Vegni, V. Loscrí, P. Manzoni","doi":"10.1109/CCNC.2019.8651774","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651774","url":null,"abstract":"In this work, we demonstrate that Vehicular Social Networks (VSNs) require specific data dissemination techniques. To this aim, we consider the Barabási model and we study the impact of its use for data dissemination in VSNs. Moreover, the use of a probabilistic data dissemination protocol based on social features [1] proves that the time-evolving dynamics of the vehicular social network graph presents a small-world structure, where nodes tend to connect through clusters whose average distance is low on average. This result highlights how VSNs are a specific class of vehicular ad hoc networks with peculiar features that distinguish them from classical online social networks.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126056590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651807
Andreas Pamboris, P. Andreou, I. Polycarpou, G. Samaras
Hyper-responsive mobile applications}, such as augmented reality and online games, require ultra-low latency access to back-end services and data at runtime. While fog computing tries to meet such latency requirements by placing corresponding back-end services and data closer to clients, for e.g., within an access network, assuming a fixed back-end server throughout execution is problematic due to user mobility. A more flexible approach is thus required to allow for adapting to changes in network conditions when users roam, by relocating back-end services and data to closer available infrastructure. Support for real-time migration of software services exists, however, migrating associated disk state remains a bottleneck. This paper presents FOGFS, a fog file system that employs intelligent snapshotting, migration and synchronization mechanisms to speed up the migration of an application‘s disk state between different edge locations at runtime. The experimental evaluation of our prototype implementation reveals that the attainable speed-up is as much as 3. 3 x compared to conventional migration approaches.
{"title":"FogFS: A Fog File System For Hyper-Responsive Mobile Applications","authors":"Andreas Pamboris, P. Andreou, I. Polycarpou, G. Samaras","doi":"10.1109/CCNC.2019.8651807","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651807","url":null,"abstract":"Hyper-responsive mobile applications}, such as augmented reality and online games, require ultra-low latency access to back-end services and data at runtime. While fog computing tries to meet such latency requirements by placing corresponding back-end services and data closer to clients, for e.g., within an access network, assuming a fixed back-end server throughout execution is problematic due to user mobility. A more flexible approach is thus required to allow for adapting to changes in network conditions when users roam, by relocating back-end services and data to closer available infrastructure. Support for real-time migration of software services exists, however, migrating associated disk state remains a bottleneck. This paper presents FOGFS, a fog file system that employs intelligent snapshotting, migration and synchronization mechanisms to speed up the migration of an application‘s disk state between different edge locations at runtime. The experimental evaluation of our prototype implementation reveals that the attainable speed-up is as much as 3. 3 x compared to conventional migration approaches.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125775082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651707
Ashirwad Gupta, M. Fujinami
This paper proposes a novel method of selecting battery-optimal transmission settings for moving nodes in Long Range (LoRa) system. In LoRa communication, transmission setting plays an important role as it affects coverage range, data rate, and battery consumption. Therefore, its optimal configuration is required to ensure successful communication with long battery life. However, with small data rate and resource-limited LoRa nodes, configuration of optimal settings becomes challenging. Current solutions require multiple transmissions for fixed distance between nodes and gateways to achieve the optimal settings. The existing methods become unsuitable for moving nodes because of continuous change in distance between the nodes and the gateways. Thus, each transmission would require different optimal setting. Due to lack of such configuration method, conventional method uses same fixed high energy setting for all transmissions to ensure high reliability, which results in shorter battery life. To minimize energy consumption without affecting reliability, the proposed method dynamically configures the optimal setting for each transmission depending on the distance between current location of the moving node and the nearest gateway, using path loss estimation. The simulation result shows that, for 95% reliability, the proposed method achieves 47% reduction in energy consumption as compared with conventional method.
{"title":"Battery Optimal Configuration of Transmission Settings in LoRa Moving Nodes","authors":"Ashirwad Gupta, M. Fujinami","doi":"10.1109/CCNC.2019.8651707","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651707","url":null,"abstract":"This paper proposes a novel method of selecting battery-optimal transmission settings for moving nodes in Long Range (LoRa) system. In LoRa communication, transmission setting plays an important role as it affects coverage range, data rate, and battery consumption. Therefore, its optimal configuration is required to ensure successful communication with long battery life. However, with small data rate and resource-limited LoRa nodes, configuration of optimal settings becomes challenging. Current solutions require multiple transmissions for fixed distance between nodes and gateways to achieve the optimal settings. The existing methods become unsuitable for moving nodes because of continuous change in distance between the nodes and the gateways. Thus, each transmission would require different optimal setting. Due to lack of such configuration method, conventional method uses same fixed high energy setting for all transmissions to ensure high reliability, which results in shorter battery life. To minimize energy consumption without affecting reliability, the proposed method dynamically configures the optimal setting for each transmission depending on the distance between current location of the moving node and the nearest gateway, using path loss estimation. The simulation result shows that, for 95% reliability, the proposed method achieves 47% reduction in energy consumption as compared with conventional method.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125872181","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
扫码关注我们
求助内容：
应助结果提醒方式：