This paper proposes a low-cost solution for mapping and locating UHF-band RFID tags in a 3D space using reader-equipped smartphones. Our solution includes a mobile augmented reality application for data collection and information visualization, and a cloud-based application server for calculating locations of the reader-equipped smartphones and the read RFID tags. Our solution applies computer vision and motion sensing techniques to track 3D locations of the RFID reader based on the visual and inertial sensor data collected from the companion smartphones. Meanwhile, it obtains the exact locations of RFID tags by calculating their relative positions from the readers based on the Angle of Arrival (AoA) concept. Our solution can be implemented with any low-cost fixed transmit power RFID readers, since it only requires the readers to report identifiers of read RFID tags. Furthermore, our solution does not require machine-controlled uniform movement of RFID readers, as it can handle the bias in the readings collected from randomly scattered positions. We have evaluated our solution with experiments in real environments using a commercially-off-the-shelf RFID reader and an Android phone. Results show that the average error in the positions of RFID tags is around 25cm for each of orthogonal axes on the floor plane, with the orders of RFID tags correctly detected in most cases.
本文提出了一种低成本的解决方案，用于使用配备阅读器的智能手机在3D空间中绘制和定位uhf频段RFID标签。我们的解决方案包括一个用于数据收集和信息可视化的移动增强现实应用程序，以及一个用于计算配备阅读器的智能手机和读取RFID标签位置的基于云的应用程序服务器。我们的解决方案应用计算机视觉和运动感应技术，根据从配套智能手机收集的视觉和惯性传感器数据来跟踪RFID阅读器的3D位置。同时，基于到达角(Angle of Arrival, AoA)的概念，通过计算标签与阅读器的相对位置，得到RFID标签的准确位置。我们的解决方案可以与任何低成本的固定发射功率RFID阅读器一起实现，因为它只需要阅读器报告读取的RFID标签的标识符。此外，我们的解决方案不需要机器控制RFID读取器的均匀运动，因为它可以处理从随机分散位置收集的读数中的偏差。我们已经通过在真实环境中使用商用RFID阅读器和Android手机的实验来评估我们的解决方案。结果表明，在地板平面上，每个正交轴对RFID标签位置的平均误差在25cm左右，大多数情况下RFID标签的顺序是正确的。
{"title":"Low-Cost Mapping of RFID Tags Using Reader-Equipped Smartphones","authors":"Yuki Sato, Marius Noreikis, Yu Xiao","doi":"10.1109/MASS.2018.00052","DOIUrl":"https://doi.org/10.1109/MASS.2018.00052","url":null,"abstract":"This paper proposes a low-cost solution for mapping and locating UHF-band RFID tags in a 3D space using reader-equipped smartphones. Our solution includes a mobile augmented reality application for data collection and information visualization, and a cloud-based application server for calculating locations of the reader-equipped smartphones and the read RFID tags. Our solution applies computer vision and motion sensing techniques to track 3D locations of the RFID reader based on the visual and inertial sensor data collected from the companion smartphones. Meanwhile, it obtains the exact locations of RFID tags by calculating their relative positions from the readers based on the Angle of Arrival (AoA) concept. Our solution can be implemented with any low-cost fixed transmit power RFID readers, since it only requires the readers to report identifiers of read RFID tags. Furthermore, our solution does not require machine-controlled uniform movement of RFID readers, as it can handle the bias in the readings collected from randomly scattered positions. We have evaluated our solution with experiments in real environments using a commercially-off-the-shelf RFID reader and an Android phone. Results show that the average error in the positions of RFID tags is around 25cm for each of orthogonal axes on the floor plane, with the orders of RFID tags correctly detected in most cases.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121102662","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}
Edge computing has emerged as the key enabling technology that empowers the IoT with intelligence and efficiency. In this data enriched infrastructure, privacy-preserving data aggregation (PPDA) is one of the most critical services. However, the security and privacy-preserving requirements and online computational cost still present practical concerns in edge computing for resource-constraint edge terminals. To cope with this challenge, we present a lightweight privacy-preserving data aggregation scheme named LPDA-EC for edge computing system by employing the online/offline signature technique, Paillier homomorphic cryptosystem, and double trapdoor Chameleon hash function in this paper. The proposed LPDA-EC scheme can achieve data confidentiality and privacy-preserving, ensuring that the edge server and control center are agnostic of the user's private information during the whole aggregation process. Through detailed analysis, we demonstrate that our scheme is existentially unforgeable under chosen message attack (EU-CMA) and ensures data integrity with formal proofs under q-Strong Diffie-Hellman (q-SDH) assumptions. Numerical results indicate that the LPDA-EC scheme has less computational and communication overheads.
{"title":"LPDA-EC: A Lightweight Privacy-Preserving Data Aggregation Scheme for Edge Computing","authors":"Jiale Zhang, Yanchao Zhao, Jie Wu, Bing Chen","doi":"10.1109/MASS.2018.00024","DOIUrl":"https://doi.org/10.1109/MASS.2018.00024","url":null,"abstract":"Edge computing has emerged as the key enabling technology that empowers the IoT with intelligence and efficiency. In this data enriched infrastructure, privacy-preserving data aggregation (PPDA) is one of the most critical services. However, the security and privacy-preserving requirements and online computational cost still present practical concerns in edge computing for resource-constraint edge terminals. To cope with this challenge, we present a lightweight privacy-preserving data aggregation scheme named LPDA-EC for edge computing system by employing the online/offline signature technique, Paillier homomorphic cryptosystem, and double trapdoor Chameleon hash function in this paper. The proposed LPDA-EC scheme can achieve data confidentiality and privacy-preserving, ensuring that the edge server and control center are agnostic of the user's private information during the whole aggregation process. Through detailed analysis, we demonstrate that our scheme is existentially unforgeable under chosen message attack (EU-CMA) and ensures data integrity with formal proofs under q-Strong Diffie-Hellman (q-SDH) assumptions. Numerical results indicate that the LPDA-EC scheme has less computational and communication overheads.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130400930","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}
Ride-sharing systems enable individual car owners with idle time to provide commercial taxi-like services via an online platform. By crowdsourcing a large population of individual car owners, it can provide more flexible services with a lower serving cost, comparing with the traditional taxi system. Due to the autonomous nature of car owners (drivers), a decentralized driver dispatching algorithm that can achieve a stable (self-motivated) and optimal passenger-driver matching is highly desired for a ride-sharing system. In this paper, we will study such a driver dispatching algorithm systematically. We first show that the optimal passenger-driver matching achieved by the centralized driver dispatching algorithm is often not stable, in the sense that some drivers and passengers may break with their matched partners and form new matching pairs. To this end, we introduce a virtual order fee on each passenger (which the platform will charge the drives who want to serve the passenger) to motivate the behaviors of drivers. Specifically, we propose a novel auction-based decentralized driver dispatching algorithm, where each driver proposes the most profitable passenger that he wants to serve, considering the potential profit that he can achieve and the order fee that he needs to pay from/to serving each passenger. The virtual order fee on a passenger will be gradually increased when multiple drivers want to serve the passenger, until there exists only one driver who is willing to serve. We analytically show that such a decentralized driver dispatching algorithm will converge to an equilibrium (stable) outcome, which achieves the optimal passenger-driver matching (i.e., that maximizes the social income of the whole system). Simulation results further show how the converging speed and the achieved social income change with the system parameters such as the step size of order fee increasement. Moreover, it is easy to implement the proposed distributed algorithm in a practical system.
{"title":"Achieving Stable and Optimal Passenger-Driver Matching in Ride-Sharing System","authors":"Yixuan Zhong, Lin Gao, Tong Wang, Shimin Gong, Baitao Zou, Deliang Yu","doi":"10.1109/MASS.2018.00027","DOIUrl":"https://doi.org/10.1109/MASS.2018.00027","url":null,"abstract":"Ride-sharing systems enable individual car owners with idle time to provide commercial taxi-like services via an online platform. By crowdsourcing a large population of individual car owners, it can provide more flexible services with a lower serving cost, comparing with the traditional taxi system. Due to the autonomous nature of car owners (drivers), a decentralized driver dispatching algorithm that can achieve a stable (self-motivated) and optimal passenger-driver matching is highly desired for a ride-sharing system. In this paper, we will study such a driver dispatching algorithm systematically. We first show that the optimal passenger-driver matching achieved by the centralized driver dispatching algorithm is often not stable, in the sense that some drivers and passengers may break with their matched partners and form new matching pairs. To this end, we introduce a virtual order fee on each passenger (which the platform will charge the drives who want to serve the passenger) to motivate the behaviors of drivers. Specifically, we propose a novel auction-based decentralized driver dispatching algorithm, where each driver proposes the most profitable passenger that he wants to serve, considering the potential profit that he can achieve and the order fee that he needs to pay from/to serving each passenger. The virtual order fee on a passenger will be gradually increased when multiple drivers want to serve the passenger, until there exists only one driver who is willing to serve. We analytically show that such a decentralized driver dispatching algorithm will converge to an equilibrium (stable) outcome, which achieves the optimal passenger-driver matching (i.e., that maximizes the social income of the whole system). Simulation results further show how the converging speed and the achieved social income change with the system parameters such as the step size of order fee increasement. Moreover, it is easy to implement the proposed distributed algorithm in a practical system.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130185292","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}
Zhicheng Yang, P. Pathak, Jianli Pan, M. Sha, P. Mohapatra
60 GHz millimeter-wave networks have emerged as a potential candidate for designing the next generation of multi-gigabit WLANs. Since the 60 GHz links suffer from frequent outages due to blockages caused by human mobility, deploying 60 GHz WLANs that can provide robust coverage in presence of blockages is a challenging problem. In this paper, we study blockage-aware coverage and deployment of 60 GHz WLANs. We first show that the reflection profile of an indoor environment can be sensed using a few measurements. A novel coverage metric (angular spread coverage) which captures the number of available paths and their spatial diversity is proposed. Additionally, it is shown that using relays can extend the coverage of the AP at a lower cost and provide added spatial diversity in the available paths. We propose a heuristic algorithm that determines the AP and relay locations while maximizing the angular spread coverage metric for the clients. Our testbed-based evaluation shows that for five different rooms, our proposed deployment can guarantee an average connectivity of 91.7%, 83.9%, and 74.1% of client locations in the presence of 1, 3 and 5 concurrent human blockages respectively, substantially increasing the robustness of 60 GHz links against blockages.
{"title":"Sense and Deploy: Blockage-Aware Deployment of Reliable 60 GHz mmWave WLANs","authors":"Zhicheng Yang, P. Pathak, Jianli Pan, M. Sha, P. Mohapatra","doi":"10.1109/MASS.2018.00063","DOIUrl":"https://doi.org/10.1109/MASS.2018.00063","url":null,"abstract":"60 GHz millimeter-wave networks have emerged as a potential candidate for designing the next generation of multi-gigabit WLANs. Since the 60 GHz links suffer from frequent outages due to blockages caused by human mobility, deploying 60 GHz WLANs that can provide robust coverage in presence of blockages is a challenging problem. In this paper, we study blockage-aware coverage and deployment of 60 GHz WLANs. We first show that the reflection profile of an indoor environment can be sensed using a few measurements. A novel coverage metric (angular spread coverage) which captures the number of available paths and their spatial diversity is proposed. Additionally, it is shown that using relays can extend the coverage of the AP at a lower cost and provide added spatial diversity in the available paths. We propose a heuristic algorithm that determines the AP and relay locations while maximizing the angular spread coverage metric for the clients. Our testbed-based evaluation shows that for five different rooms, our proposed deployment can guarantee an average connectivity of 91.7%, 83.9%, and 74.1% of client locations in the presence of 1, 3 and 5 concurrent human blockages respectively, substantially increasing the robustness of 60 GHz links against blockages.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130691841","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}
Björn Gernert, Fabian Schwartau, Sebastian Raabe, J. Schoebel, Karsten Schubert, S. Rottmann, L. Wolf
During recent years, automation and optimized production processes within a variety of different agriculture sectors allowed farmers to achieve higher harvesting rates and therefore to maximize the outcome of their efforts. Besides harvesting, storing the crop is the next challenging step in improving agricultural practices. Monitoring and adjusting the environmental conditions in storage are important tasks to achieve an optimal and efficient storability. This paper focuses on the communication part of such a monitoring system. Modern warehouses are usually organized as box storage, which means that the crop to be stored is filled into boxes and then piled up in large warehouses. Selective ventilation and air conditioning ensure a maximum storage period. This paper examines which radio frequencies are suitable for transmitting sensor data from stored boxes to a sink. The obtained sensor data could be used, for example, to control the air conditioning of the warehouse more precisely. The investigations are carried out on potatoes as an example, for which first a simulation and then a prototypical sensor node is created.
{"title":"Evaluation of Suitable Radio Frequencies for Data Transmission in Potato Warehouses","authors":"Björn Gernert, Fabian Schwartau, Sebastian Raabe, J. Schoebel, Karsten Schubert, S. Rottmann, L. Wolf","doi":"10.1109/MASS.2018.00043","DOIUrl":"https://doi.org/10.1109/MASS.2018.00043","url":null,"abstract":"During recent years, automation and optimized production processes within a variety of different agriculture sectors allowed farmers to achieve higher harvesting rates and therefore to maximize the outcome of their efforts. Besides harvesting, storing the crop is the next challenging step in improving agricultural practices. Monitoring and adjusting the environmental conditions in storage are important tasks to achieve an optimal and efficient storability. This paper focuses on the communication part of such a monitoring system. Modern warehouses are usually organized as box storage, which means that the crop to be stored is filled into boxes and then piled up in large warehouses. Selective ventilation and air conditioning ensure a maximum storage period. This paper examines which radio frequencies are suitable for transmitting sensor data from stored boxes to a sink. The obtained sensor data could be used, for example, to control the air conditioning of the warehouse more precisely. The investigations are carried out on potatoes as an example, for which first a simulation and then a prototypical sensor node is created.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128727293","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}
Big data annotation plays an important role in Artificial Intelligence model training. The proliferation of data annotation tasks has brought the issue of security of the big data delivery. This work identifies the security framework associated with encryption and compression procedures that support data delivery safety. In this paper, we propose an agile framework that caters to various types of data under RESTful web services. All the procedures are automatically operated by the server without human intervention. This work assists the company delivers the tagged data products to users with a high-security level avoiding the risk of information disclosure.
{"title":"A Framework to Data Delivery Security for Big Data Annotation Delivery System","authors":"Yanhong Yang, Hongling He, Daliang Wang, Zhongxiang Ding","doi":"10.1109/MASS.2018.00082","DOIUrl":"https://doi.org/10.1109/MASS.2018.00082","url":null,"abstract":"Big data annotation plays an important role in Artificial Intelligence model training. The proliferation of data annotation tasks has brought the issue of security of the big data delivery. This work identifies the security framework associated with encryption and compression procedures that support data delivery safety. In this paper, we propose an agile framework that caters to various types of data under RESTful web services. All the procedures are automatically operated by the server without human intervention. This work assists the company delivers the tagged data products to users with a high-security level avoiding the risk of information disclosure.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122160433","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}
In the process of silkworm breeding, if the healthy pupae number can be predicted by using silkworm's characteristics indicators, it will provide important reference value and guidance for the subsequent breeding and characteristics improvement. In this paper, the statistical analysis of silkworm characteristics data in the past 25 years is carried out, and the linear regression model and model establishment process for predicting the healthy pupae number with common characteristics and health indicators as independent variables are given. The significance test of F test and t test and the correlation analysis of between dependent variable and independent variables showed that there is a significant linear regression relationship between the predicted value of the healthy pupae number and the indicators of trait and health. The established linear regression model predicts the healthy pupae number. The prediction error is within 2%, which is in line with the actual breeding requirements. The results are accurate. The linear regression model has certain practicability.
{"title":"A Method of Linear Regression Model Building for Healthy Pupae Number Based on Common Characters Indicators","authors":"Q. Pu, T. Tao, Dagang Gong, Yuerong Xian, Hong Du","doi":"10.1109/MASS.2018.00076","DOIUrl":"https://doi.org/10.1109/MASS.2018.00076","url":null,"abstract":"In the process of silkworm breeding, if the healthy pupae number can be predicted by using silkworm's characteristics indicators, it will provide important reference value and guidance for the subsequent breeding and characteristics improvement. In this paper, the statistical analysis of silkworm characteristics data in the past 25 years is carried out, and the linear regression model and model establishment process for predicting the healthy pupae number with common characteristics and health indicators as independent variables are given. The significance test of F test and t test and the correlation analysis of between dependent variable and independent variables showed that there is a significant linear regression relationship between the predicted value of the healthy pupae number and the indicators of trait and health. The established linear regression model predicts the healthy pupae number. The prediction error is within 2%, which is in line with the actual breeding requirements. The results are accurate. The linear regression model has certain practicability.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"664 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123979616","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}
Dawood Sajjadi, Zehui Zheng, Rukhsana Ruby, Jianping Pan
Wi-Fi Mesh Networks (WMNs) as a popular platform can be used for the construction of dynamic backhaul networks especially over small cells, which is an indispensable part of the 5G technology. Finding the optimal single-path flow routing solution over the multi-hop backhaul networks is a classic NP-hard problem and there are non-trivial drawbacks such as packet re-ordering to implement multi-path routing as a practical solution. However, Software Defined Networking (SDN) as an emerging paradigm can provide a great opportunity to implement fast and efficient solutions for routing the network flows over WMNs. In this paper, we propose a randomized single-path flow routing that can be applied to SDN-aware WMNs. The randomized nature of our introduced solution avoids the complexities of implementing a multi-path flow routing and it presents a viable routing scheme that guarantees certain performance bounds. In addition, it considers the key characteristics of wireless networks and it can be employed for multi-channel multi-radio WMNs. Through numerical results, we have shown that our solution follows the theoretical, tighter and more general performance bounds. Moreover, in contrast to most of the prior studies, the performance of the proposed solution is not only evaluated through a real testbed (in terms of the aggregated throughput and protocol overhead) but also compared with some of the most popular WMN routing protocols.
{"title":"Randomized Single-Path Flow Routing on SDN-Aware Wi-Fi Mesh Networks","authors":"Dawood Sajjadi, Zehui Zheng, Rukhsana Ruby, Jianping Pan","doi":"10.1109/MASS.2018.00039","DOIUrl":"https://doi.org/10.1109/MASS.2018.00039","url":null,"abstract":"Wi-Fi Mesh Networks (WMNs) as a popular platform can be used for the construction of dynamic backhaul networks especially over small cells, which is an indispensable part of the 5G technology. Finding the optimal single-path flow routing solution over the multi-hop backhaul networks is a classic NP-hard problem and there are non-trivial drawbacks such as packet re-ordering to implement multi-path routing as a practical solution. However, Software Defined Networking (SDN) as an emerging paradigm can provide a great opportunity to implement fast and efficient solutions for routing the network flows over WMNs. In this paper, we propose a randomized single-path flow routing that can be applied to SDN-aware WMNs. The randomized nature of our introduced solution avoids the complexities of implementing a multi-path flow routing and it presents a viable routing scheme that guarantees certain performance bounds. In addition, it considers the key characteristics of wireless networks and it can be employed for multi-channel multi-radio WMNs. Through numerical results, we have shown that our solution follows the theoretical, tighter and more general performance bounds. Moreover, in contrast to most of the prior studies, the performance of the proposed solution is not only evaluated through a real testbed (in terms of the aggregated throughput and protocol overhead) but also compared with some of the most popular WMN routing protocols.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122683462","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}
In Internet of Things (IoT), link failure is unavoidable and it generally brings undesirable effects on the communication and performance of the IoT. Is it possible to cope with the problem arising from the node failure in the IoT networks, while retaining the corresponding network communication performance? In this paper, a distributed Kalman filter with consensus strategy update approach was proposed to investigate the IoT of general multi-agent networks with links failure. The objective of the proposed approach is to compensate for the undesirable effects of the failure links. Numerical simulations are provided to demonstrate the effectiveness of the approach results obtained.
{"title":"Distributed Kalman Filter with Consensus Strategies for Internet of Things Network","authors":"Yee-Ming Chen, Chu-Kai Wang, Yu-meng Chen","doi":"10.1109/MASS.2018.00074","DOIUrl":"https://doi.org/10.1109/MASS.2018.00074","url":null,"abstract":"In Internet of Things (IoT), link failure is unavoidable and it generally brings undesirable effects on the communication and performance of the IoT. Is it possible to cope with the problem arising from the node failure in the IoT networks, while retaining the corresponding network communication performance? In this paper, a distributed Kalman filter with consensus strategy update approach was proposed to investigate the IoT of general multi-agent networks with links failure. The objective of the proposed approach is to compensate for the undesirable effects of the failure links. Numerical simulations are provided to demonstrate the effectiveness of the approach results obtained.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124408190","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}
Received Signal Strength (RSS) is considered to be a promising measurement for indoor positioning. Many RSS range-based localization methods have been proposed due to the convenience and low cost of RSS measurements. However, a fundamental problem has not been answered, that is, how accurate are these methods? We think a key reason leading to this situation is the inappropriate assumption on RSS range models and measurement errors, which results in oversimplified analysis on those methods. In this paper, we use a more general range model and recognize the Generalized Least Square (GLS) method as an optimal estimator whose estimation error equals to the Cramer-Rao lower bound (CRLB). Through mathematical, techniques, we derive the analytic expression of the localization error for the GLS method, which reveals the key factors that affect the localization accuracy. Further studies on the minimal localization error disclose the proportional relationship between the localization accuracy and the above key factors.
{"title":"Error Analysis on RSS Range-Based Localization Based on General Log-Distance Path Loss Model","authors":"Wei Li, Zimu Yuan, Shuhui Yang, Wei Zhao","doi":"10.1109/MASS.2018.00071","DOIUrl":"https://doi.org/10.1109/MASS.2018.00071","url":null,"abstract":"Received Signal Strength (RSS) is considered to be a promising measurement for indoor positioning. Many RSS range-based localization methods have been proposed due to the convenience and low cost of RSS measurements. However, a fundamental problem has not been answered, that is, how accurate are these methods? We think a key reason leading to this situation is the inappropriate assumption on RSS range models and measurement errors, which results in oversimplified analysis on those methods. In this paper, we use a more general range model and recognize the Generalized Least Square (GLS) method as an optimal estimator whose estimation error equals to the Cramer-Rao lower bound (CRLB). Through mathematical, techniques, we derive the analytic expression of the localization error for the GLS method, which reveals the key factors that affect the localization accuracy. Further studies on the minimal localization error disclose the proportional relationship between the localization accuracy and the above key factors.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116043992","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
扫码关注我们
求助内容：
应助结果提醒方式：