Compared with other positioning technologies, UWB positioning technology has the absolute advantages in the accuracy, the real-time performance and the wide-band. It can achieve the positioning accuracy of centimeter level. The maturity of wireless clock synchronization algorithm, TDOA (Time Difference of Arrival) positioning algorithm and the multi tags access provides a good foundation for UWB positioning system. This paper applied weight analysis in network scalability to achieve the efficient network scalability with better accuracy of multi tag access.
与其他定位技术相比，超宽带定位技术在精度、实时性和宽带性方面具有绝对优势。可达到厘米级的定位精度。无线时钟同步算法、TDOA (Time Difference of Arrival)定位算法和多标签接入的成熟为超宽带定位系统提供了良好的基础。本文将权值分析应用于网络可扩展性中，以实现高效的网络可扩展性和更高的多标签访问精度。
{"title":"Network scalability with weight analysis based on UWB indoor positioning system","authors":"Xiaosi Chen, Chong Shen, Qian Gao, Qun Zhou, Gaoang Feng","doi":"10.1109/ICWISE.2016.8188549","DOIUrl":"https://doi.org/10.1109/ICWISE.2016.8188549","url":null,"abstract":"Compared with other positioning technologies, UWB positioning technology has the absolute advantages in the accuracy, the real-time performance and the wide-band. It can achieve the positioning accuracy of centimeter level. The maturity of wireless clock synchronization algorithm, TDOA (Time Difference of Arrival) positioning algorithm and the multi tags access provides a good foundation for UWB positioning system. This paper applied weight analysis in network scalability to achieve the efficient network scalability with better accuracy of multi tag access.","PeriodicalId":358005,"journal":{"name":"2016 IEEE Conference on Wireless Sensors (ICWiSE)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130674755","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 : 2016-10-01DOI: 10.1109/ICWISE.2016.8188544
Jahan Razavi, Norman Brennan
In designing a detection system for forest fires, we encounter four challenges: detecting the fire, locating the fire, transmitting the information across a long distance, and keeping the system cost low. We propose such a device, PyroVision, which addresses these problems. Specifically, we demonstrate that Bluetooth technology leads to a low cost for a PyroVision node. A grid system allows locating the fire without using GPS. To deal with Bluetooth's poor transmission range, we replace the original antenna with a dipole structure and we also incorporate node hopping. According to our field measurements, the distance between two transmitters in an area with trees can be 42 meters, while in a clear area, it can be increased to 88 meters.
{"title":"A novel application of Bluetooth technology for detection of forest fires","authors":"Jahan Razavi, Norman Brennan","doi":"10.1109/ICWISE.2016.8188544","DOIUrl":"https://doi.org/10.1109/ICWISE.2016.8188544","url":null,"abstract":"In designing a detection system for forest fires, we encounter four challenges: detecting the fire, locating the fire, transmitting the information across a long distance, and keeping the system cost low. We propose such a device, PyroVision, which addresses these problems. Specifically, we demonstrate that Bluetooth technology leads to a low cost for a PyroVision node. A grid system allows locating the fire without using GPS. To deal with Bluetooth's poor transmission range, we replace the original antenna with a dipole structure and we also incorporate node hopping. According to our field measurements, the distance between two transmitters in an area with trees can be 42 meters, while in a clear area, it can be increased to 88 meters.","PeriodicalId":358005,"journal":{"name":"2016 IEEE Conference on Wireless Sensors (ICWiSE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126721827","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 : 2016-10-01DOI: 10.1109/ICWISE.2016.8187761
Benjamin C. Y. Low, S. Dahlan, M. Wahab
Bus arrival and departure information is widely accessible specially provided by the local public bus services. Using a sophisticated GPS technology, bus companies are able to track their buses and let users know the estimated time of arrival. Users nowadays are depending more on the information, but the convenience is only available for public bus services in the city. In this work, a bus arrival information system was designed by taking advantage of the characteristics of the service routes in rural areas and shuttle bus service in educational institutions. Instead of relying solely on GPS data and complex computational algorithms to calculate the estimated time of arrival of the bus, this system used RFID to update the latest bus stop location that allowed users to have an overview of the real time bus location. GPS was used to provide the real-time location of the moving bus, thanks to the Google Map. The developed system supported participatory contributions where the system depended on the users to update any unpredictable on-road issues and share the information to others. A web application (Web App) was designed with interactive interface as a platform to access all the information. The developed system was tested in UTHM campus-Parit Raja town shuttle bus. This new facility is expected to significantly encourage students to use public transport and improve their travelling experiences.
{"title":"Real-time bus location and arrival information system","authors":"Benjamin C. Y. Low, S. Dahlan, M. Wahab","doi":"10.1109/ICWISE.2016.8187761","DOIUrl":"https://doi.org/10.1109/ICWISE.2016.8187761","url":null,"abstract":"Bus arrival and departure information is widely accessible specially provided by the local public bus services. Using a sophisticated GPS technology, bus companies are able to track their buses and let users know the estimated time of arrival. Users nowadays are depending more on the information, but the convenience is only available for public bus services in the city. In this work, a bus arrival information system was designed by taking advantage of the characteristics of the service routes in rural areas and shuttle bus service in educational institutions. Instead of relying solely on GPS data and complex computational algorithms to calculate the estimated time of arrival of the bus, this system used RFID to update the latest bus stop location that allowed users to have an overview of the real time bus location. GPS was used to provide the real-time location of the moving bus, thanks to the Google Map. The developed system supported participatory contributions where the system depended on the users to update any unpredictable on-road issues and share the information to others. A web application (Web App) was designed with interactive interface as a platform to access all the information. The developed system was tested in UTHM campus-Parit Raja town shuttle bus. This new facility is expected to significantly encourage students to use public transport and improve their travelling experiences.","PeriodicalId":358005,"journal":{"name":"2016 IEEE Conference on Wireless Sensors (ICWiSE)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121796108","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 : 2016-10-01DOI: 10.1109/ICWISE.2016.8187754
V. Kumar, N. Bergmann, Izanoordina Ahmad, R. Jurdak, B. Kusy
Tracking movement of mobile nodes has received significant scientific and commercial interest, but long term tracking of resource-constrained mobile nodes remains challenging due to the high energy consumption of satellite receivers. Cooperative position tracking has been proposed for energy efficiency, however, all the cooperative schemes use opportunistic cooperation and optimize for either energy or accuracy. Considering the existence of a reasonably stable group of mobile nodes like animals, birds, and mobile assets, we propose a cluster-based cooperative tracking algorithm, where cluster head centrally coordinates resource usage among cluster members. Variants of this strategy include the use of a cooperative Kalman filter with and without inertial sensor inputs to estimate nodes' positions. We use the Boid flocking algorithm to generate group position movements in 3D and perform various experiments to compare the energy and position accuracy tradeoff of our proposed scheme with individual-based tracking and existing cooperative schemes. We perform the experiments for fixed periodic GPS sampling and dynamic GPS sampling triggered by node position error uncertainty tolerance limit. Experiments results show that in periodic sampling scheme cooperative tracking yields more than one-quarter reduction in energy consumption and more than one-third improvement in position accuracy over individual-based tracking, however, results for dynamic sampling scheme are comparable with existing cooperative scheme.
{"title":"Cluster-based position tracking of mobile sensors","authors":"V. Kumar, N. Bergmann, Izanoordina Ahmad, R. Jurdak, B. Kusy","doi":"10.1109/ICWISE.2016.8187754","DOIUrl":"https://doi.org/10.1109/ICWISE.2016.8187754","url":null,"abstract":"Tracking movement of mobile nodes has received significant scientific and commercial interest, but long term tracking of resource-constrained mobile nodes remains challenging due to the high energy consumption of satellite receivers. Cooperative position tracking has been proposed for energy efficiency, however, all the cooperative schemes use opportunistic cooperation and optimize for either energy or accuracy. Considering the existence of a reasonably stable group of mobile nodes like animals, birds, and mobile assets, we propose a cluster-based cooperative tracking algorithm, where cluster head centrally coordinates resource usage among cluster members. Variants of this strategy include the use of a cooperative Kalman filter with and without inertial sensor inputs to estimate nodes' positions. We use the Boid flocking algorithm to generate group position movements in 3D and perform various experiments to compare the energy and position accuracy tradeoff of our proposed scheme with individual-based tracking and existing cooperative schemes. We perform the experiments for fixed periodic GPS sampling and dynamic GPS sampling triggered by node position error uncertainty tolerance limit. Experiments results show that in periodic sampling scheme cooperative tracking yields more than one-quarter reduction in energy consumption and more than one-third improvement in position accuracy over individual-based tracking, however, results for dynamic sampling scheme are comparable with existing cooperative scheme.","PeriodicalId":358005,"journal":{"name":"2016 IEEE Conference on Wireless Sensors (ICWiSE)","volume":"603 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122940489","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 : 2016-10-01DOI: 10.1109/ICWISE.2016.8187759
M. Al-Jumaili, Bijan Karimi
Wireless Sensor Networks need energy efficient protocols for communication and data fusion to consolidate data and prolong the lifetime of the network. In this paper, an adaptive hierarchical clustering and routing method has been proposed. This clustering and routing method is based on maximum bottleneck energy routing (MBER) from a node to the sink. This method favors the routes with the highest energy instead of the neighboring node with the highest energy. MBER minimizes the possibility of a node dying in the route of sending a packet to the sink. Due to MBER's hierarchical structure, data fusion can be applied in different forms and at different levels to send more data from each node to the sink, depending on the application. It can be adapted to varying transmission ranges for communication among nodes. Compared to some of the well-known protocols in the field MBER's results show that it outperforms them in terms of the overall lifetime of the network and the number of packets sent to the sink.
{"title":"Maximum bottleneck energy routing (MBER) — An energy efficient routing method for wireless sensor networks","authors":"M. Al-Jumaili, Bijan Karimi","doi":"10.1109/ICWISE.2016.8187759","DOIUrl":"https://doi.org/10.1109/ICWISE.2016.8187759","url":null,"abstract":"Wireless Sensor Networks need energy efficient protocols for communication and data fusion to consolidate data and prolong the lifetime of the network. In this paper, an adaptive hierarchical clustering and routing method has been proposed. This clustering and routing method is based on maximum bottleneck energy routing (MBER) from a node to the sink. This method favors the routes with the highest energy instead of the neighboring node with the highest energy. MBER minimizes the possibility of a node dying in the route of sending a packet to the sink. Due to MBER's hierarchical structure, data fusion can be applied in different forms and at different levels to send more data from each node to the sink, depending on the application. It can be adapted to varying transmission ranges for communication among nodes. Compared to some of the well-known protocols in the field MBER's results show that it outperforms them in terms of the overall lifetime of the network and the number of packets sent to the sink.","PeriodicalId":358005,"journal":{"name":"2016 IEEE Conference on Wireless Sensors (ICWiSE)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125902319","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 : 2016-10-01DOI: 10.1109/ICWISE.2016.8187760
L. Trieu, H. T. Minh, L. T. Nguyen, D. Trong
Wireless sensor networks have emerged as the major criteria that enable the Internet of things evolution. In which, wireless image sensor network have wide application range from special domain to civilian and scientific domain thus it is attracted a lot of research. Since security is of the crucial importance for wireless sensor networks, there are existed several authentication techniques for digital right management, and watermarking is a promising approach for ensuring a part of communication security in these networks due to its popular use and lightweight. To develop a security solution based on this approach, the digital image watermarking techniques need to be considered in different aspects of performance. The paper presents a comparative evaluation on error performance of major digital image processing techniques for JEG/JPEG2000 standard image and its embedded watermark images in a typical wireless image sensor networks. Moreover, a watermark detection probability with varied transform methods is delivered to recognize how attack possibilities. Numerical results will show a best choice of embedded watermark transform method in wireless image sensor networks.
{"title":"A comparative evaluation for digital image watermarking techniques in wireless image sensor networks","authors":"L. Trieu, H. T. Minh, L. T. Nguyen, D. Trong","doi":"10.1109/ICWISE.2016.8187760","DOIUrl":"https://doi.org/10.1109/ICWISE.2016.8187760","url":null,"abstract":"Wireless sensor networks have emerged as the major criteria that enable the Internet of things evolution. In which, wireless image sensor network have wide application range from special domain to civilian and scientific domain thus it is attracted a lot of research. Since security is of the crucial importance for wireless sensor networks, there are existed several authentication techniques for digital right management, and watermarking is a promising approach for ensuring a part of communication security in these networks due to its popular use and lightweight. To develop a security solution based on this approach, the digital image watermarking techniques need to be considered in different aspects of performance. The paper presents a comparative evaluation on error performance of major digital image processing techniques for JEG/JPEG2000 standard image and its embedded watermark images in a typical wireless image sensor networks. Moreover, a watermark detection probability with varied transform methods is delivered to recognize how attack possibilities. Numerical results will show a best choice of embedded watermark transform method in wireless image sensor networks.","PeriodicalId":358005,"journal":{"name":"2016 IEEE Conference on Wireless Sensors (ICWiSE)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130463934","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 : 2016-10-01DOI: 10.1109/ICWISE.2016.8187756
Mohamed Elsayed, A. Badawy, M. Mahmuddin, Tarek M. Elfouly, Amr M. Mohamed, K. Abualsaud
Wireless body sensor networks (WBSN) provide an appreciable aid to patients who require continuous care and monitoring. One key application of WBSN is mobile health (mHealth) for continuous patient monitoring, acquiring vital signs e.g. EEG, ECG, etc. Such monitoring devices are doomed to be portable, i.e., batter powered, and agile to allow for patient mobility, while providing sustainable, energy-efficient hardware platforms. Hence, EEG data compression is critical in reducing the transmission power, hence increase the battery life. In this paper, we design and implement a complete hardware model based on discrete wavelet transform (DWT) for vital signs data compression and reconstruction on a field programmable gate array (FPGA) based platform. We evaluate the performance of our DWT compression FPGA implementation under different practical parameters including filter length and the compression ratio. We investigate the hardware and computational complexity of our design in terms of used resource blocks for future comparison with state-of-the-art techniques. Our results show the efficiency of the proposed hardware compression and reconstruction model at different system parameters, including the high pass filter coefficients, and DWT type, and DWT threshold.
{"title":"FPGA implementation of DWT EEG data compression for wireless body sensor networks","authors":"Mohamed Elsayed, A. Badawy, M. Mahmuddin, Tarek M. Elfouly, Amr M. Mohamed, K. Abualsaud","doi":"10.1109/ICWISE.2016.8187756","DOIUrl":"https://doi.org/10.1109/ICWISE.2016.8187756","url":null,"abstract":"Wireless body sensor networks (WBSN) provide an appreciable aid to patients who require continuous care and monitoring. One key application of WBSN is mobile health (mHealth) for continuous patient monitoring, acquiring vital signs e.g. EEG, ECG, etc. Such monitoring devices are doomed to be portable, i.e., batter powered, and agile to allow for patient mobility, while providing sustainable, energy-efficient hardware platforms. Hence, EEG data compression is critical in reducing the transmission power, hence increase the battery life. In this paper, we design and implement a complete hardware model based on discrete wavelet transform (DWT) for vital signs data compression and reconstruction on a field programmable gate array (FPGA) based platform. We evaluate the performance of our DWT compression FPGA implementation under different practical parameters including filter length and the compression ratio. We investigate the hardware and computational complexity of our design in terms of used resource blocks for future comparison with state-of-the-art techniques. Our results show the efficiency of the proposed hardware compression and reconstruction model at different system parameters, including the high pass filter coefficients, and DWT type, and DWT threshold.","PeriodicalId":358005,"journal":{"name":"2016 IEEE Conference on Wireless Sensors (ICWiSE)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128987345","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 : 2016-10-01DOI: 10.1109/ICWISE.2016.8187753
David Martin Amitu
Mobile sensors are expected to play a significant role in the next generation Internet of Things (IoT) networks, with sensors in vehicles, drones, robots and more. These mobile sensors participate in data gathering for various application scenarios. Some applications are information intensive in that huge chunks of data are required in order to make informative decisions. However, mobility in Wireless Sensor Networks greatly limits the amount of data that can be gathered. We therefore propose an approach for maximizing data gathering in mobile Wireless Sensor Networks. The main objective of this approach is to maximize the data gathering capability of the mobile sensor network for information intensive applications using a dual-stage maximization approach which involves maximizing data gathered within each cluster through a proper selection of cluster heads and maximizing data transmitted to the Base station from cluster heads using a near-optimal transmission duration. Simulation results of our proposed approach show significant data gathering performance gains.
{"title":"Maximizing data gathering in mobile wireless sensor networks","authors":"David Martin Amitu","doi":"10.1109/ICWISE.2016.8187753","DOIUrl":"https://doi.org/10.1109/ICWISE.2016.8187753","url":null,"abstract":"Mobile sensors are expected to play a significant role in the next generation Internet of Things (IoT) networks, with sensors in vehicles, drones, robots and more. These mobile sensors participate in data gathering for various application scenarios. Some applications are information intensive in that huge chunks of data are required in order to make informative decisions. However, mobility in Wireless Sensor Networks greatly limits the amount of data that can be gathered. We therefore propose an approach for maximizing data gathering in mobile Wireless Sensor Networks. The main objective of this approach is to maximize the data gathering capability of the mobile sensor network for information intensive applications using a dual-stage maximization approach which involves maximizing data gathered within each cluster through a proper selection of cluster heads and maximizing data transmitted to the Base station from cluster heads using a near-optimal transmission duration. Simulation results of our proposed approach show significant data gathering performance gains.","PeriodicalId":358005,"journal":{"name":"2016 IEEE Conference on Wireless Sensors (ICWiSE)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129855913","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 : 1900-01-01DOI: 10.1109/ICWISE.2016.8187758
Izanoordina Ahmad, N. Bergmann, R. Jurdak, B. Kusy
Locating fixed sensing devices with a mobile anchor is attractive for covering larger deployment areas. Probabilistic localization has been shown to reduce error over deterministic approaches, yet the performance sensitivity to the geometric arrangement of anchor beacon positions remains unexplored. This paper presents a detailed description of a new RSSI-based localization algorithm which uses a volumetric probability distribution function to find the most likely position of a node by information fusion from several mobile beacon radio packets. Results show a significant performance improvement of up to 80% over existing approaches. Secondly, simulations are conducted to determine the effect of the 3-D geometry of localization broadcast packets. Compared to both a symmetric circular arrangement of beacons, and an arrangement of beacons in a line, if beacon positions are allowed to move to a more asymmetric arrangement with a range of angles and heights, the localization error is reduced to approximately 1 metre or by up to 96% compared to a poor geometry. This is despite individual ranging errors of much more than 1 metre.
{"title":"Geometric sensitivity of localization using airborne mobile anchors with volume probabilistic multilateration","authors":"Izanoordina Ahmad, N. Bergmann, R. Jurdak, B. Kusy","doi":"10.1109/ICWISE.2016.8187758","DOIUrl":"https://doi.org/10.1109/ICWISE.2016.8187758","url":null,"abstract":"Locating fixed sensing devices with a mobile anchor is attractive for covering larger deployment areas. Probabilistic localization has been shown to reduce error over deterministic approaches, yet the performance sensitivity to the geometric arrangement of anchor beacon positions remains unexplored. This paper presents a detailed description of a new RSSI-based localization algorithm which uses a volumetric probability distribution function to find the most likely position of a node by information fusion from several mobile beacon radio packets. Results show a significant performance improvement of up to 80% over existing approaches. Secondly, simulations are conducted to determine the effect of the 3-D geometry of localization broadcast packets. Compared to both a symmetric circular arrangement of beacons, and an arrangement of beacons in a line, if beacon positions are allowed to move to a more asymmetric arrangement with a range of angles and heights, the localization error is reduced to approximately 1 metre or by up to 96% compared to a poor geometry. This is despite individual ranging errors of much more than 1 metre.","PeriodicalId":358005,"journal":{"name":"2016 IEEE Conference on Wireless Sensors (ICWiSE)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123057747","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
扫码关注我们
求助内容：
应助结果提醒方式：