Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8718118
Nishat I. Mowla, Inshil Doh, K. Chae
Bio-modalities are ideal for user authentication in Medical Cyber-Physical Systems. Various forms of bio-modalities, such as the face, iris, fingerprint, are commonly used for secure user authentication. Concurrently, various spoofing approaches have also been developed over time which can fail traditional bio-modality detection systems. Image synthesis with play-doh, gelatin, ecoflex etc. are some of the ways used in spoofing bio-identifiable property. Since the bio-modality detection sensors are small and resource constrained, heavy-weight detection mechanisms are not suitable for these sensors. Recently, Fog based architectures are proposed to support sensor management in the Medical Cyber-Physical Systems (MCPS). A thin software client running in these resource-constrained sensors can enable communication with fog nodes for better management and analysis. Therefore, we propose a fog-based security application to detect bio-modality spoofing in a Fog based MCPS. In this regard, we propose a machine learning based security algorithm run as an application at the fog node using a binarized multi-factor boosted ensemble learner algorithm coupled with feature selection. Our proposal is verified on real datasets provided by the Replay Attack, Warsaw and LiveDet 2015 Crossmatch benchmark for face, iris and fingerprint modality spoofing detection used for authentication in an MCPS. The experimental analysis shows that our approach achieves significant performance gain over the state-of-the-art approaches.
{"title":"Binarized Multi-Factor Cognitive Detection of Bio-Modality Spoofing in Fog Based Medical Cyber-Physical System","authors":"Nishat I. Mowla, Inshil Doh, K. Chae","doi":"10.1109/ICOIN.2019.8718118","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718118","url":null,"abstract":"Bio-modalities are ideal for user authentication in Medical Cyber-Physical Systems. Various forms of bio-modalities, such as the face, iris, fingerprint, are commonly used for secure user authentication. Concurrently, various spoofing approaches have also been developed over time which can fail traditional bio-modality detection systems. Image synthesis with play-doh, gelatin, ecoflex etc. are some of the ways used in spoofing bio-identifiable property. Since the bio-modality detection sensors are small and resource constrained, heavy-weight detection mechanisms are not suitable for these sensors. Recently, Fog based architectures are proposed to support sensor management in the Medical Cyber-Physical Systems (MCPS). A thin software client running in these resource-constrained sensors can enable communication with fog nodes for better management and analysis. Therefore, we propose a fog-based security application to detect bio-modality spoofing in a Fog based MCPS. In this regard, we propose a machine learning based security algorithm run as an application at the fog node using a binarized multi-factor boosted ensemble learner algorithm coupled with feature selection. Our proposal is verified on real datasets provided by the Replay Attack, Warsaw and LiveDet 2015 Crossmatch benchmark for face, iris and fingerprint modality spoofing detection used for authentication in an MCPS. The experimental analysis shows that our approach achieves significant performance gain over the state-of-the-art approaches.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127190920","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/ICOIN.2019.8718142
T. V. Ha, D. Hoang
Many countries around the world are expecting a growing number of elderly people as the society is aging over time. This shift is expected to create a large impact on the health and social security system. The cost of having an increasing proportion of elderly people is emerging as a challenge for governments, so much that many countries are encouraging their people to stay in the workforce longer. As a result, the aging population requires a solution that allows them to remain productive and keeping them mentally healthy. Existing solutions rely on the benefits of social networks or service networks to keep them active and improve mental health. However, these solutions fail to allow elderly people to act as a value contributor for the society. This paper proposes the design of a new model that allows elderly people to actively and collaboratively provide value to the society through an assistive platform that integrates a service network with a social network. This model combines the advantages of the social network to connect them and utilize the advantages of the service network to create opportunities for elderly people to offer their skills and knowledge to exchange benefits with other users. The proposed model can be used as a mean to engage seniors to the community, allowing them to generate value for themselves and the community while staying mentally healthy.
{"title":"Toward an Active Aging Society: An IT Model to Engage the Aging Population","authors":"T. V. Ha, D. Hoang","doi":"10.1109/ICOIN.2019.8718142","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718142","url":null,"abstract":"Many countries around the world are expecting a growing number of elderly people as the society is aging over time. This shift is expected to create a large impact on the health and social security system. The cost of having an increasing proportion of elderly people is emerging as a challenge for governments, so much that many countries are encouraging their people to stay in the workforce longer. As a result, the aging population requires a solution that allows them to remain productive and keeping them mentally healthy. Existing solutions rely on the benefits of social networks or service networks to keep them active and improve mental health. However, these solutions fail to allow elderly people to act as a value contributor for the society. This paper proposes the design of a new model that allows elderly people to actively and collaboratively provide value to the society through an assistive platform that integrates a service network with a social network. This model combines the advantages of the social network to connect them and utilize the advantages of the service network to create opportunities for elderly people to offer their skills and knowledge to exchange benefits with other users. The proposed model can be used as a mean to engage seniors to the community, allowing them to generate value for themselves and the community while staying mentally healthy.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114351075","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/ICOIN.2019.8718144
Y. Ji, S. Bae, Yongtae Shin
Recently, the blockchain was introduced in many existing business models. In this paper, personal information management technology using blockchain is proposed, and only trusted institutions form blockchain networks and manage the flow of personal information through their heads. Agreements are made through rack algorithms, and the adequacy of the technology is analysed by evaluating the stability of the network.
{"title":"A Personal Information Management Using BlockChain","authors":"Y. Ji, S. Bae, Yongtae Shin","doi":"10.1109/ICOIN.2019.8718144","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718144","url":null,"abstract":"Recently, the blockchain was introduced in many existing business models. In this paper, personal information management technology using blockchain is proposed, and only trusted institutions form blockchain networks and manage the flow of personal information through their heads. Agreements are made through rack algorithms, and the adequacy of the technology is analysed by evaluating the stability of the network.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114405497","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/ICOIN.2019.8718111
Shuhei Yamasaki, O. Takyu, K. Shirai, T. Fujii, M. Ohta, F. Sasamori, S. Handa
Physical wireless conversion networks have an advantage that the fusion center can simultaneously receive each data sent from multiple sensors. However, the separation of the mixed data was difficult without sensor labels for distinguishing the data. In this paper, we aim to separate the mixed data into passes composed of continuous data points having smooth gradient by using a $K$-shortest pass algorithm. In our previous method, we used the distance between data points as the cost and calculate passes so as to obtain the minimum length, but the method prone to select a wrong pass at intersection points of the passes. In the proposal method, assuming the position of a data point changes smoothly, we use the smoothness of a pass (gradient) as the additional cost. However, it is actually difficult to calculate the gradient of a pass that has not yet been separated. Therefore, in this paper, on the basis of the assumption that the gradient can be somehow obtained, we performed data separation experiments for some mixed data. As a result, a good performance is obtained, so we report the results in this paper.
{"title":"Data Separation Considering Smoothness of Sensing Data in Physical Wireless Parameter Conversion Sensor Networks","authors":"Shuhei Yamasaki, O. Takyu, K. Shirai, T. Fujii, M. Ohta, F. Sasamori, S. Handa","doi":"10.1109/ICOIN.2019.8718111","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718111","url":null,"abstract":"Physical wireless conversion networks have an advantage that the fusion center can simultaneously receive each data sent from multiple sensors. However, the separation of the mixed data was difficult without sensor labels for distinguishing the data. In this paper, we aim to separate the mixed data into passes composed of continuous data points having smooth gradient by using a $K$-shortest pass algorithm. In our previous method, we used the distance between data points as the cost and calculate passes so as to obtain the minimum length, but the method prone to select a wrong pass at intersection points of the passes. In the proposal method, assuming the position of a data point changes smoothly, we use the smoothness of a pass (gradient) as the additional cost. However, it is actually difficult to calculate the gradient of a pass that has not yet been separated. Therefore, in this paper, on the basis of the assumption that the gradient can be somehow obtained, we performed data separation experiments for some mixed data. As a result, a good performance is obtained, so we report the results in this paper.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115694269","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/ICOIN.2019.8718145
Tomotaka Kimura, H. Premachandra
We consider recover schemes suitable for multicast communication in intermittently connected mobile ad hoc networks. In these networks, conventional routing schemes do not work properly. Store-carry-forward routing has been considered as a promising solution in such a circumstance. In many store-carry-forward routing schemes, even when a message reaches its destination node, some nodes stores its copies. To solve this problem, many recovery schemes have been proposed for unicast communications. These recovery schemes, however, could not work properly for multicast communications. In this paper, we propose a new recovery scheme that is suitable for multicast communications. Our recovery scheme aggressively discards message copies before all the anti-packets that all destination nodes generate are received. Through simulation experiments, we demonstrate that our recovery scheme works well compared with the existing recovery scheme when messages are delivered for many destination nodes.
{"title":"Aggressive Recovery Scheme for Multicast Communication in Intermittently Connected Mobile Ad-Hoc Networks","authors":"Tomotaka Kimura, H. Premachandra","doi":"10.1109/ICOIN.2019.8718145","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718145","url":null,"abstract":"We consider recover schemes suitable for multicast communication in intermittently connected mobile ad hoc networks. In these networks, conventional routing schemes do not work properly. Store-carry-forward routing has been considered as a promising solution in such a circumstance. In many store-carry-forward routing schemes, even when a message reaches its destination node, some nodes stores its copies. To solve this problem, many recovery schemes have been proposed for unicast communications. These recovery schemes, however, could not work properly for multicast communications. In this paper, we propose a new recovery scheme that is suitable for multicast communications. Our recovery scheme aggressively discards message copies before all the anti-packets that all destination nodes generate are received. Through simulation experiments, we demonstrate that our recovery scheme works well compared with the existing recovery scheme when messages are delivered for many destination nodes.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"466 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121262074","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/ICOIN.2019.8718171
Toshiki Nonaka, T. Fujii, O. Takyu, M. Ohta
In this paper, we propose a new multiple access scheme based on Network MIMO technique in wireless sensor networks (WSNs). The slotted ALOHA type protocol with successive interference cancellation (SIC) is the promising scheme to meet the requirements of the IoT society which will come within the decades. One of the most effective methods is the one with using the capture effect. However, there used to be the typical sensor node (SN) arrangements which do not make the packets with sufficient power unbalance at the fusion center (FC). Even in the model applies SIC taking advantage of the capture effect, temporal diversity and spatial diversity, those arrangements may still happen. The proposed method allows fusion centers to decode those packets by exploiting the signal separation method of network MIMO system. The results of the computer simulation show that the proposed method can increase the number of SNs which can send the data without degrading the quality of service.
{"title":"Network MIMO with Interference Cancellation for Cloud-Cooperated Wireless Sensor Networks","authors":"Toshiki Nonaka, T. Fujii, O. Takyu, M. Ohta","doi":"10.1109/ICOIN.2019.8718171","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718171","url":null,"abstract":"In this paper, we propose a new multiple access scheme based on Network MIMO technique in wireless sensor networks (WSNs). The slotted ALOHA type protocol with successive interference cancellation (SIC) is the promising scheme to meet the requirements of the IoT society which will come within the decades. One of the most effective methods is the one with using the capture effect. However, there used to be the typical sensor node (SN) arrangements which do not make the packets with sufficient power unbalance at the fusion center (FC). Even in the model applies SIC taking advantage of the capture effect, temporal diversity and spatial diversity, those arrangements may still happen. The proposed method allows fusion centers to decode those packets by exploiting the signal separation method of network MIMO system. The results of the computer simulation show that the proposed method can increase the number of SNs which can send the data without degrading the quality of service.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"31 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126163054","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/ICOIN.2019.8718119
Jiwon Min, Youngseok Lee
As the modern web becomes complicated, HTTP has been upgraded from 1.1 to 2. Many web browsers and servers have adopted HTTP/2 that provides improved performance, security and bandwidth, and they support both HTTP/1.1 as well as HTTP/2 clients for the migration period. In general, HTTP/2 is considered to outperform HTTP/1.1, but it does not always guarantee the enhanced throughput. In this paper, we look into the fairness issue when HTTP/1.1 clients compete with HTTP/2 clients to connect the same web server simultaneously. From the realistic network environments such as WLAN, cellular 3G or LTE networks, we show that the HTTP/2 clients do not achieve the fair network bandwidth allocation when multiple HTTP/1.1 clients are connected to the web server.
{"title":"An Experimental View on Fairness between HTTP/1.1 and HTTP/2","authors":"Jiwon Min, Youngseok Lee","doi":"10.1109/ICOIN.2019.8718119","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718119","url":null,"abstract":"As the modern web becomes complicated, HTTP has been upgraded from 1.1 to 2. Many web browsers and servers have adopted HTTP/2 that provides improved performance, security and bandwidth, and they support both HTTP/1.1 as well as HTTP/2 clients for the migration period. In general, HTTP/2 is considered to outperform HTTP/1.1, but it does not always guarantee the enhanced throughput. In this paper, we look into the fairness issue when HTTP/1.1 clients compete with HTTP/2 clients to connect the same web server simultaneously. From the realistic network environments such as WLAN, cellular 3G or LTE networks, we show that the HTTP/2 clients do not achieve the fair network bandwidth allocation when multiple HTTP/1.1 clients are connected to the web server.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134598421","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/ICOIN.2019.8718117
Jinhyeok Park, Hoki Baek, Jaesung Lim
Ground tactical networks are often limited in their operations when the line of sight (LOS) is not guaranteed. To overcome this limitation, airborne relay communications using unmanned aerial vehicles (UAVs) are a possible solution. In airborne relay communication, it is important to reduce relaying delay because the airborne relay communication is extended to two-hop communication unlike the conventional communication environment. In this paper, we proposed a dynamic time-division multiple access (DTDMA) scheme based on time mirroring to reduce relaying delay in airborne relay communication and allow multiple nodes to access the network effectively. The proposed scheme also performs efficient resource allocation and supports seamless voice communication in order to accommodate the military communication environment where nodes join and leave frequently. Proposed scheme applies the time mirroring scheme to DTDMA. Time-mirroring is a scheme in which a relay node that receives a packet from a source node relays a packet to a destination node without any additional processing. The proposed scheme designates two-timeslots as one mirroring slot to minimize the delay caused in the slot assignment process of the relay node. Slot assignment is accomplished by dividing the idle mirroring slot into a number of mini-slots and allowing the node to randomly access the mini-slot. The simulation shows that the proposed scheme can significantly reduce relaying delay and support seamless voice communication.
{"title":"A Dynamic TDMA Scheme for UAV Based Relay in Combat Net Radio Networks","authors":"Jinhyeok Park, Hoki Baek, Jaesung Lim","doi":"10.1109/ICOIN.2019.8718117","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718117","url":null,"abstract":"Ground tactical networks are often limited in their operations when the line of sight (LOS) is not guaranteed. To overcome this limitation, airborne relay communications using unmanned aerial vehicles (UAVs) are a possible solution. In airborne relay communication, it is important to reduce relaying delay because the airborne relay communication is extended to two-hop communication unlike the conventional communication environment. In this paper, we proposed a dynamic time-division multiple access (DTDMA) scheme based on time mirroring to reduce relaying delay in airborne relay communication and allow multiple nodes to access the network effectively. The proposed scheme also performs efficient resource allocation and supports seamless voice communication in order to accommodate the military communication environment where nodes join and leave frequently. Proposed scheme applies the time mirroring scheme to DTDMA. Time-mirroring is a scheme in which a relay node that receives a packet from a source node relays a packet to a destination node without any additional processing. The proposed scheme designates two-timeslots as one mirroring slot to minimize the delay caused in the slot assignment process of the relay node. Slot assignment is accomplished by dividing the idle mirroring slot into a number of mini-slots and allowing the node to randomly access the mini-slot. The simulation shows that the proposed scheme can significantly reduce relaying delay and support seamless voice communication.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130518998","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/icoin.2019.8718191
{"title":"The 33rd International Conference on Information Networking (ICOIN 2019)","authors":"","doi":"10.1109/icoin.2019.8718191","DOIUrl":"https://doi.org/10.1109/icoin.2019.8718191","url":null,"abstract":"","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125234167","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/ICOIN.2019.8718193
Junhyun Park, Youngjune Oh, HyungHo Byun, Chong-kwon Kim
The ultra-fine particles (PM2.5), pollutants found in the air, are getting increasingly popular as they are found to cause serious damage to human body when inhaled or penetrated into the skin. Although there are public observatories to monitor air quality and alert people, they are usually available only in the vicinity of metropolitan areas. Even in urban regions, measured data are not spaced and sampled densely enough to serve individuals with proper data in spatial and temporal point of view due to high cost. In this paper, we design and implement a low cost fine-grained air monitoring system using LoRa WAn.We tested feasibility of LoRa Wanon metering system with large scale simulations. With densely deployed sensing devices on campus, our system provides fine-grained PM traces as well as reliable packet delivery while consuming significantly low energy.
{"title":"Low Cost Fine-Grained Air Quality Monitoring System Using LoRa WAN","authors":"Junhyun Park, Youngjune Oh, HyungHo Byun, Chong-kwon Kim","doi":"10.1109/ICOIN.2019.8718193","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718193","url":null,"abstract":"The ultra-fine particles (PM2.5), pollutants found in the air, are getting increasingly popular as they are found to cause serious damage to human body when inhaled or penetrated into the skin. Although there are public observatories to monitor air quality and alert people, they are usually available only in the vicinity of metropolitan areas. Even in urban regions, measured data are not spaced and sampled densely enough to serve individuals with proper data in spatial and temporal point of view due to high cost. In this paper, we design and implement a low cost fine-grained air monitoring system using LoRa WAn.We tested feasibility of LoRa Wanon metering system with large scale simulations. With densely deployed sensing devices on campus, our system provides fine-grained PM traces as well as reliable packet delivery while consuming significantly low energy.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123064946","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
扫码关注我们
求助内容：
应助结果提醒方式：