Pub Date : 2018-06-01DOI: 10.1109/SECONW.2018.8396355
Chenxi Sun, V. Li, J. Lam
The general environmental monitoring problem refers to the task of placing sensors or stations to optimize certain objectives under budget constraints. Application scenarios include monitoring temperature, water contamination, air quality etc. As citizens are increasingly concerned about the surrounding environment, it is important to provide sufficient and accurate information to the public. In this study, we focus on the problem of optimal citizen-centric sensor placement, i.e, given a set of locations within the city, we aim at placing sensors or stations at locations that will benefit as many citizens as possible under budget constraints. We prove that the problem is NP-hard, yet the objective function has the nice non-decreasing and submodular property. Then the efficient greedy algorithm and its variants can be adopted with a guaranteed approximation ratio of (1−1/e) for the unit cost case and 1/2 (1−1/e) for the general cost case. Finally we demonstrate the effectiveness of the proposed approach by comparing with two baseline algorithms through a case study.
{"title":"Optimal Citizen-Centric Sensor Placement for Citywide Environmental Monitoring - A Submodular Approach","authors":"Chenxi Sun, V. Li, J. Lam","doi":"10.1109/SECONW.2018.8396355","DOIUrl":"https://doi.org/10.1109/SECONW.2018.8396355","url":null,"abstract":"The general environmental monitoring problem refers to the task of placing sensors or stations to optimize certain objectives under budget constraints. Application scenarios include monitoring temperature, water contamination, air quality etc. As citizens are increasingly concerned about the surrounding environment, it is important to provide sufficient and accurate information to the public. In this study, we focus on the problem of optimal citizen-centric sensor placement, i.e, given a set of locations within the city, we aim at placing sensors or stations at locations that will benefit as many citizens as possible under budget constraints. We prove that the problem is NP-hard, yet the objective function has the nice non-decreasing and submodular property. Then the efficient greedy algorithm and its variants can be adopted with a guaranteed approximation ratio of (1−1/e) for the unit cost case and 1/2 (1−1/e) for the general cost case. Finally we demonstrate the effectiveness of the proposed approach by comparing with two baseline algorithms through a case study.","PeriodicalId":346249,"journal":{"name":"2018 IEEE International Conference on Sensing, Communication and Networking (SECON Workshops)","volume":"463 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132310892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-01DOI: 10.1109/SECONW.2018.8396350
Kento Furuhashi, J. Suzuki, Jonathan S. Mitzman, T. Nakano, Yutaka Okaie, Hiroaki Fukuda
This paper studies a feedback-based communication protocol for bio-nanomachines to reliably transmit and receive a series of molecular messages through diffusive transports in a particular order. Based on the Stop-and- Wait Automatic Repeat Request (SW-ARQ) mechanism, the proposed protocol leverages redundant molecule transmissions, molecule delivery acknowledgement and timeout-based retransmissions to enhance the latency and reliability of in-sequence molecular communication. Simulation results demonstrate that the protocol substantially improves latency, jitter and transmission failure rate. They also illustrate how environmental and protocol parameters impact those communication performance metrics.
{"title":"Impacts of SW-ARQ on the Latency and Reliability of Diffusive, In-Sequence Molecular Communication","authors":"Kento Furuhashi, J. Suzuki, Jonathan S. Mitzman, T. Nakano, Yutaka Okaie, Hiroaki Fukuda","doi":"10.1109/SECONW.2018.8396350","DOIUrl":"https://doi.org/10.1109/SECONW.2018.8396350","url":null,"abstract":"This paper studies a feedback-based communication protocol for bio-nanomachines to reliably transmit and receive a series of molecular messages through diffusive transports in a particular order. Based on the Stop-and- Wait Automatic Repeat Request (SW-ARQ) mechanism, the proposed protocol leverages redundant molecule transmissions, molecule delivery acknowledgement and timeout-based retransmissions to enhance the latency and reliability of in-sequence molecular communication. Simulation results demonstrate that the protocol substantially improves latency, jitter and transmission failure rate. They also illustrate how environmental and protocol parameters impact those communication performance metrics.","PeriodicalId":346249,"journal":{"name":"2018 IEEE International Conference on Sensing, Communication and Networking (SECON Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129432392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-01DOI: 10.1109/seconw.2018.8396327
{"title":"CoWPER Welcome Message","authors":"","doi":"10.1109/seconw.2018.8396327","DOIUrl":"https://doi.org/10.1109/seconw.2018.8396327","url":null,"abstract":"","PeriodicalId":346249,"journal":{"name":"2018 IEEE International Conference on Sensing, Communication and Networking (SECON Workshops)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117180731","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-01DOI: 10.1109/SECONW.2018.8396360
Wei Zhou, Lei Wang, Bingxian Lu, Naigao Jin, Linlin Guo, Jialin Liu, Honglei Sun, Hui Liu
Civilian unmanned aerial vehicles (UAVs) have been increasingly used in problematic ways. For instance, more and more UAVs disrupt flights and peep into privacy. This problem is likely to expand given the rapid proliferation of UAVs for commerce, monitoring, recreation, and other applications. In this paper, we propose a UAV presence detection system which identifies signal signatures by using the UAV's RF communication. We explore UAV's physical characteristics, including the mobility due to fast moving, spatiality due to UAV's 3D nature, and vibration due to its wing rotation. We consider whether the received UAV signals are uniquely differentiated from other wireless devices. We thoroughly analyze the angle of arrival (AoA) in 3D space, and flexibly apply super-resolution AoA estimation method to calculate the elevation in 3D place. We conduct spectrum on fine- grained channel state information data, and successfully detect the frequency of UAV vibration due to the rotation of UAV's propellers, and finally improve the accuracy through a clustering algorithm. Our system is prototyped and evaluated using commodity WiFi devices in real-world environment. Our system shows a good performance, which achieves 86.6% of accuracy, 87.3% of precision and 85.8% of recall.
{"title":"Unmanned Aerial Vehicle Detection Based on Channel State Information","authors":"Wei Zhou, Lei Wang, Bingxian Lu, Naigao Jin, Linlin Guo, Jialin Liu, Honglei Sun, Hui Liu","doi":"10.1109/SECONW.2018.8396360","DOIUrl":"https://doi.org/10.1109/SECONW.2018.8396360","url":null,"abstract":"Civilian unmanned aerial vehicles (UAVs) have been increasingly used in problematic ways. For instance, more and more UAVs disrupt flights and peep into privacy. This problem is likely to expand given the rapid proliferation of UAVs for commerce, monitoring, recreation, and other applications. In this paper, we propose a UAV presence detection system which identifies signal signatures by using the UAV's RF communication. We explore UAV's physical characteristics, including the mobility due to fast moving, spatiality due to UAV's 3D nature, and vibration due to its wing rotation. We consider whether the received UAV signals are uniquely differentiated from other wireless devices. We thoroughly analyze the angle of arrival (AoA) in 3D space, and flexibly apply super-resolution AoA estimation method to calculate the elevation in 3D place. We conduct spectrum on fine- grained channel state information data, and successfully detect the frequency of UAV vibration due to the rotation of UAV's propellers, and finally improve the accuracy through a clustering algorithm. Our system is prototyped and evaluated using commodity WiFi devices in real-world environment. Our system shows a good performance, which achieves 86.6% of accuracy, 87.3% of precision and 85.8% of recall.","PeriodicalId":346249,"journal":{"name":"2018 IEEE International Conference on Sensing, Communication and Networking (SECON Workshops)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122167924","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-01DOI: 10.1109/seconw.2018.8396332
{"title":"CPC-UAV Welcome Message","authors":"","doi":"10.1109/seconw.2018.8396332","DOIUrl":"https://doi.org/10.1109/seconw.2018.8396332","url":null,"abstract":"","PeriodicalId":346249,"journal":{"name":"2018 IEEE International Conference on Sensing, Communication and Networking (SECON Workshops)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127028884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-01DOI: 10.1109/seconw.2018.8396325
{"title":"Title Page","authors":"","doi":"10.1109/seconw.2018.8396325","DOIUrl":"https://doi.org/10.1109/seconw.2018.8396325","url":null,"abstract":"","PeriodicalId":346249,"journal":{"name":"2018 IEEE International Conference on Sensing, Communication and Networking (SECON Workshops)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121140900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-01DOI: 10.1109/seconw.2018.8396339
{"title":"IWMBMC Program","authors":"","doi":"10.1109/seconw.2018.8396339","DOIUrl":"https://doi.org/10.1109/seconw.2018.8396339","url":null,"abstract":"","PeriodicalId":346249,"journal":{"name":"2018 IEEE International Conference on Sensing, Communication and Networking (SECON Workshops)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116824281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-01DOI: 10.1109/SECONW.2018.8396353
Hang Yu, Bryan K. F. Ng, Winston K.G. Seah
As an emerging part of the Internet of Things (IoT), Electromagnetic-based Wireless NanoSensor Networks (EM-WNSNs) working in the TeraHertz (THz) band are envisaged to enable applications that demand high sensing resolution. For the high-speed nanonetworks deployed for time critical applications, the limited IoT backhaul bandwidth of the existing infrastructure becomes the bottleneck that deteriorates resource utilization efficiency. On the one hand, the bandwidth demand exceeding the supply results in unnecessary energy consumption on nano-devices due to the overdue data discarded. On the other hand, the excess supply of bandwidth reduces the bandwidth efficiency. To address this problem, the On-demand Efficient (OE) polling and On-demand Probabilistic (OP) polling were proposed. Nevertheless, the existing solutions only apply to the single-gateway scenario whereas deploying multiple gateways is required for achieving high data completeness and energy efficiency. Therefore, in this paper, we propose the Multi-gateway Probabilistic (MP) polling for the multi-gateway EMWNSNs. To achieve high bandwidth efficiency, in MP polling, one master gateway is selected for OP polling with the aggregated bandwidth that reduces the probabilistic uncertainty. Next, all gateways probabilistically receive packets using the bandwidth-based receiving windows. To the best of our knowledge, MP Polling is the first polling solution designed for the multi gateway EM-WNSNs under dynamic backhaul bandwidth.
{"title":"Multi-Gateway Polling for Nanonetworks under Dynamic IoT Backhaul Bandwidth","authors":"Hang Yu, Bryan K. F. Ng, Winston K.G. Seah","doi":"10.1109/SECONW.2018.8396353","DOIUrl":"https://doi.org/10.1109/SECONW.2018.8396353","url":null,"abstract":"As an emerging part of the Internet of Things (IoT), Electromagnetic-based Wireless NanoSensor Networks (EM-WNSNs) working in the TeraHertz (THz) band are envisaged to enable applications that demand high sensing resolution. For the high-speed nanonetworks deployed for time critical applications, the limited IoT backhaul bandwidth of the existing infrastructure becomes the bottleneck that deteriorates resource utilization efficiency. On the one hand, the bandwidth demand exceeding the supply results in unnecessary energy consumption on nano-devices due to the overdue data discarded. On the other hand, the excess supply of bandwidth reduces the bandwidth efficiency. To address this problem, the On-demand Efficient (OE) polling and On-demand Probabilistic (OP) polling were proposed. Nevertheless, the existing solutions only apply to the single-gateway scenario whereas deploying multiple gateways is required for achieving high data completeness and energy efficiency. Therefore, in this paper, we propose the Multi-gateway Probabilistic (MP) polling for the multi-gateway EMWNSNs. To achieve high bandwidth efficiency, in MP polling, one master gateway is selected for OP polling with the aggregated bandwidth that reduces the probabilistic uncertainty. Next, all gateways probabilistically receive packets using the bandwidth-based receiving windows. To the best of our knowledge, MP Polling is the first polling solution designed for the multi gateway EM-WNSNs under dynamic backhaul bandwidth.","PeriodicalId":346249,"journal":{"name":"2018 IEEE International Conference on Sensing, Communication and Networking (SECON Workshops)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114950134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-01DOI: 10.1109/SECONW.2018.8396349
Liting Yang, Y. Mao, Qiang Liu, Haoyang Zhai, Kun Yang
Nano-network models based on chemotaxis are com-monly designed for the application of target detection or drug delivery. However, due to the random diffusion of molecules, chemotactic substances can't rapidly reach long-range nanoma-chines, which affects effectiveness of the detection process. In this paper, we propose a nano-network model and a corresponding target detection scheme using relay nodes that can release attractants to expand the impact range of chemotactic substances and improve the chemotactic efficiency. We then establish the mathematical model for this process. Finally, simulation results show the proposed scheme for the new model is superior to general schemes.
{"title":"High-Efficiency Target Detection Scheme through Relay Nodes in Chemotactic-Based Molecular Communication","authors":"Liting Yang, Y. Mao, Qiang Liu, Haoyang Zhai, Kun Yang","doi":"10.1109/SECONW.2018.8396349","DOIUrl":"https://doi.org/10.1109/SECONW.2018.8396349","url":null,"abstract":"Nano-network models based on chemotaxis are com-monly designed for the application of target detection or drug delivery. However, due to the random diffusion of molecules, chemotactic substances can't rapidly reach long-range nanoma-chines, which affects effectiveness of the detection process. In this paper, we propose a nano-network model and a corresponding target detection scheme using relay nodes that can release attractants to expand the impact range of chemotactic substances and improve the chemotactic efficiency. We then establish the mathematical model for this process. Finally, simulation results show the proposed scheme for the new model is superior to general schemes.","PeriodicalId":346249,"journal":{"name":"2018 IEEE International Conference on Sensing, Communication and Networking (SECON Workshops)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115053351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-01DOI: 10.1109/SECONW.2018.8396354
M. Khaledi, Arnau Rovira-Sugranes, F. Afghah, A. Razi
Unmanned aerial vehicles (UAVs), commonly known as drones, are becoming increasingly popular for various applications. Freely flying drones create highly dynamic environments, where conventional routing algorithms which rely on stationary network contact graphs fail to perform efficiently. Also, link establishment through exploring optimal paths using hello messages (as is used in AODV algorithm) deems extremely inefficient and costly for rapidly changing network topologies. In this paper, we present a distance-based greedy routing algorithm for UAV networks solely based on UAVs' local observations of their surrounding subnetwork. Thereby, neither a central decision maker nor a time consuming route setup and maintenance mechanism is required. To evaluate the proposed method, we derive an analytical bound for the expected number of hops that a packet traverses. Also, we find the expected end-to-end distance traveled by each packet as well as the probability of successful delivery. The simulation results verify the accuracy of the developed analytical expressions and show considerable improvement compared to centralized shortest path routing algorithms.
{"title":"On Greedy Routing in Dynamic UAV Networks","authors":"M. Khaledi, Arnau Rovira-Sugranes, F. Afghah, A. Razi","doi":"10.1109/SECONW.2018.8396354","DOIUrl":"https://doi.org/10.1109/SECONW.2018.8396354","url":null,"abstract":"Unmanned aerial vehicles (UAVs), commonly known as drones, are becoming increasingly popular for various applications. Freely flying drones create highly dynamic environments, where conventional routing algorithms which rely on stationary network contact graphs fail to perform efficiently. Also, link establishment through exploring optimal paths using hello messages (as is used in AODV algorithm) deems extremely inefficient and costly for rapidly changing network topologies. In this paper, we present a distance-based greedy routing algorithm for UAV networks solely based on UAVs' local observations of their surrounding subnetwork. Thereby, neither a central decision maker nor a time consuming route setup and maintenance mechanism is required. To evaluate the proposed method, we derive an analytical bound for the expected number of hops that a packet traverses. Also, we find the expected end-to-end distance traveled by each packet as well as the probability of successful delivery. The simulation results verify the accuracy of the developed analytical expressions and show considerable improvement compared to centralized shortest path routing algorithms.","PeriodicalId":346249,"journal":{"name":"2018 IEEE International Conference on Sensing, Communication and Networking (SECON Workshops)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122849915","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
扫码关注我们
求助内容：
应助结果提醒方式：