<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
	<channel>
		<title>ACM Transactions on Sensor Networks (TOSN)</title>
		<link>http://dl.acm.org/citation.cfm?id=3447946</link>
		<description />
		<item>
			<title>ACM Transactions on Sensor Networks (TOSN)</title>
			<link>http://dl.acm.org/citation.cfm?id=3447946</link>
			<description />
			<pubDate>Mon, 31 May 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3447946</guid>
		</item>
		<item>
			<title>Price Learning-based Incentive Mechanism for Mobile Crowd Sensing</title>
			<link>http://dl.acm.org/citation.cfm?id=3447622</link>
			<description><![CDATA[Yifan Zhang, Xinglin Zhang<br /><br />Mobile crowd sensing (MCS) is an emerging sensing paradigm that can be applied to build various smart city and IoT applications. In an MCS application, the participation level of mobile users plays an essential role. Thus a great many incentive mechanisms have been proposed to motivate users. However, most of these works focus on the bidding behavior of users and overlook the feature of task requesters. Specifically, there exists a disparity between the low payment a requester would like to make and the high reward a user would like to receive. In this work, we address this issue by designing a group-buying-based online incentive mechanism, which contains two stages: In Stage&#x000A0;I, a price learning algorithm is designed to select winning tasks for each group of sensing tasks and obtain a competitive total budget for recruiting users.]]></description>
			<pubDate>Fri, 25 Jun 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3447622</guid>
		</item>
		<item>
			<title>Editorial from the Editor-in-Chief</title>
			<link>http://dl.acm.org/citation.cfm?id=3448130</link>
			<description><![CDATA[Yunhao Liu<br /><br />]]></description>
			<pubDate>Mon, 14 Jun 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3448130</guid>
		</item>
		<item>
			<title>Low-Cost Outdoor Air Quality Monitoring and Sensor Calibration: A Survey and Critical Analysis</title>
			<link>http://dl.acm.org/citation.cfm?id=3446005</link>
			<description><![CDATA[Francesco Concas, Julien Mineraud, Eemil Lagerspetz, Samu Varjonen, Xiaoli Liu, Kai Puolam&#228;ki, Petteri Nurmi, Sasu Tarkoma<br /><br />The significance of air pollution and the problems associated with it are fueling deployments of air quality monitoring stations worldwide. The most common approach for air quality monitoring is to rely on environmental monitoring stations, which unfortunately are very expensive both to acquire and to maintain. Hence, environmental monitoring stations are typically sparsely deployed, resulting in limited spatial resolution for measurements. Recently, low-cost air quality sensors have emerged as an alternative that can improve the granularity of monitoring. The use of low-cost air quality sensors, however, presents several challenges: They suffer from cross-sensitivities between different ambient pollutants; they can be affected by external factors, such as traffic, weather changes, and human behavior; and their accuracy degrades over time.]]></description>
			<pubDate>Fri, 28 May 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3446005</guid>
		</item>
		<item>
			<title>SenCS: Enabling Real-time Indoor Proximity Verification via Contextual Similarity</title>
			<link>http://dl.acm.org/citation.cfm?id=3449071</link>
			<description><![CDATA[Chaohao Li, Xiaoyu Ji, Bin Wang, Kai Wang, Wenyuan Xu<br /><br />Indoor proximity verification has become an increasingly useful primitive for the scenarios where access is granted to the previously unknown users when they enter a given area (e.g., a hotel room). Existing solutions either rely on homogeneous sensing modalities shared by two parties or require additional human interactions. In this article, we propose a context-based indoor proximity verification scheme, called SenCS, to enable real-time autonomous access for mobile devices, utilizing the available heterogeneous sensors at the user side and at the room side. The intuition is that only when the user is within a room can sensors from both sides observe the same events in the room.]]></description>
			<pubDate>Sat, 22 May 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3449071</guid>
		</item>
		<item>
			<title>Smartphone-Based Indoor Visual Navigation with Leader-Follower Mode</title>
			<link>http://dl.acm.org/citation.cfm?id=3448417</link>
			<description><![CDATA[Jingao Xu, Erqun Dong, Qiang Ma, Chenshu Wu, Zheng Yang<br /><br />Existing indoor navigation solutions usually require pre-deployed comprehensive location services with precise indoor maps and, more importantly, all rely on dedicatedly installed or existing infrastructure. In this article, we present Pair-Navi, an infrastructure-free indoor navigation system that circumvents all these requirements by reusing a previous traveler&#x02019;s (i.e., leader) trace experience to navigate future users (i.e., followers) in a Peer-to-Peer mode. Our system leverages the advances of visual simultaneous localization and mapping (SLAM) on commercial smartphones. Visual SLAM systems, however, are vulnerable to environmental dynamics in the precision and robustness and involve intensive computation that prohibits real-time applications. To combat environmental changes, we propose to cull non-rigid contexts and keep only the static and rigid contents in use.]]></description>
			<pubDate>Tue, 04 May 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3448417</guid>
		</item>
		<item>
			<title>Task Planning Considering Location Familiarity in Spatial Crowdsourcing</title>
			<link>http://dl.acm.org/citation.cfm?id=3442698</link>
			<description><![CDATA[Chaoqun Peng, Xinglin Zhang, Zhaojing Ou, Junna Zhang<br /><br />Spatial crowdsourcing (SC) is a popular distributed problem-solving paradigm that harnesses the power of mobile workers (e.g., smartphone users) to perform location-based tasks (e.g., checking product placement or taking landmark photos). Typically, a worker needs to travel physically to the target location to finish the assigned task. Hence, the worker&#x02019;s familiarity level on the target location directly influences the completion quality of the task. In addition, from the perspective of the SC server, it is desirable to finish all tasks with a low recruitment cost. Combining these issues, we propose a Bi-Objective Task Planning (BOTP) problem in SC, where the server makes a task assignment and schedule for the workers to jointly optimize the workers&#x02019; familiarity levels on the locations of assigned tasks and the total cost of worker recruitment.]]></description>
			<pubDate>Tue, 30 Mar 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3442698</guid>
		</item>
		<item>
			<title>Intercepting a Stealthy Network</title>
			<link>http://dl.acm.org/citation.cfm?id=3431223</link>
			<description><![CDATA[Mai Ben Adar Bessos, Amir Herzberg<br /><br />We investigate an understudied threat: networks of stealthy routers (S-Routers), relaying messages to a hidden destination. The S-Routers relay communication along a path of multiple short-range, low-energy hops, to avoid remote localization by triangulation. Mobile devices called Interceptors can detect communication by an S-Router, but only when the Interceptor is next to the transmitting S-Router. We examine algorithms for a set of mobile Interceptors to find the destination of the communication relayed by the S-Routers. The algorithms are compared according to the number of communicating rounds before the destination is found, i.e., rounds in which data is transmitted from the source to the destination.]]></description>
			<pubDate>Fri, 12 Mar 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3431223</guid>
		</item>
		<item>
			<title>BOND: Exploring Hidden Bottleneck Nodes in Large-scale Wireless Sensor Networks</title>
			<link>http://dl.acm.org/citation.cfm?id=3439956</link>
			<description><![CDATA[Qiang Ma, Zhichao Cao, Wei Gong, Xiaolong Zheng<br /><br />In a large-scale wireless sensor network, hundreds and thousands of sensors sample and forward data back to the sink periodically. In two real outdoor deployments GreenOrbs and CitySee, we observe that some bottleneck nodes strongly impact other nodes&#x02019; data collection and thus degrade the whole network performance. To figure out the importance of a node in the process of data collection, system manager is required to understand interactive behaviors among the parent and child nodes. So we present a management tool BOND (BOttleneck Node Detector), which explains the concept of Node Dependence to characterize how much a node relies on each of its parent nodes, and also models the routing process as a Hidden Markov Model and then uses a machine learning approach to learn the state transition probabilities in this model.]]></description>
			<pubDate>Fri, 12 Mar 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3439956</guid>
		</item>
		<item>
			<title>A Data-driven System for City-wide Energy Footprinting and Apportionment</title>
			<link>http://dl.acm.org/citation.cfm?id=3433639</link>
			<description><![CDATA[Peter Wei, Xiaofan Jiang<br /><br />Energy footprinting has the potential to raise awareness of energy consumption and lead to energy-saving behavior. However, current methods are largely restricted to single buildings; these methods require energy and occupancy monitoring sensor deployments, which can be expensive and difficult to deploy at scale. Further, current methods for estimating energy consumption and population at scale cannot provide fine enough temporal or spatial granularity for a reasonable personal energy footprint estimate. In this work, we present a data-driven system for city-wide estimation of personal energy footprints.]]></description>
			<pubDate>Sat, 23 Jan 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3433639</guid>
		</item>
		<item>
			<title>One Size Does Not Fit All: Multi-scale, Cascaded RNNs for Radar Classification</title>
			<link>http://dl.acm.org/citation.cfm?id=3439957</link>
			<description><![CDATA[Dhrubojyoti Roy, Sangeeta Srivastava, Aditya Kusupati, Pranshu Jain, Manik Varma, Anish Arora<br /><br />Edge sensing with micro-power pulse-Doppler radars is an emergent domain in monitoring and surveillance with several smart city applications. Existing solutions for the clutter versus multi-source radar classification task are limited in terms of either accuracy or efficiency, and in some cases, struggle with a tradeoff between false alarms and recall of sources. We find that this problem can be resolved by learning the classifier across multiple time-scales. We propose a multi-scale, cascaded recurrent neural network architecture, MSC-RNN, composed of an efficient multi-instance learning (MIL) Recurrent Neural Network (RNN) for clutter discrimination at a lower tier and a more complex RNN classifier for source classification at the upper tier.]]></description>
			<pubDate>Sat, 23 Jan 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3439957</guid>
		</item>
		<item>
			<title>DeepHeart: A Deep Learning Approach for Accurate Heart Rate Estimation from PPG Signals</title>
			<link>http://dl.acm.org/citation.cfm?id=3441626</link>
			<description><![CDATA[Xiangmao Chang, Gangkai Li, Guoliang Xing, Kun Zhu, Linlin Tu<br /><br />Heart rate (HR) estimation based on photoplethysmography (PPG) signals has been widely adopted in wrist-worn devices. However, the motion artifacts caused by the user&#x02019;s physical activities make it difficult to get the accurate HR estimation from contaminated PPG signals. Although many signal processing methods have been proposed to address this challenge, they are often highly optimized for specific scenarios, making them impractical in real-world settings where a user may perform a wide range of physical activities. In this article, we propose DeepHeart, a new HR estimation approach that features deep-learning-based denoising and spectrum-analysis-based calibration. DeepHeart generates clean PPG signals from electrocardiogram signals based on a training data set.]]></description>
			<pubDate>Sat, 23 Jan 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3441626</guid>
		</item>
		<item>
			<title>CoHop: Quantitative Correlation-based Channel Hopping for Low-power Wireless Networks</title>
			<link>http://dl.acm.org/citation.cfm?id=3440248</link>
			<description><![CDATA[Yuting Wang, Xiaolong Zheng, Liang Liu, Huadong Ma<br /><br />Cross-Technology Interference (CTI) badly harms the transmission reliability for low-power networks such as ZigBee at 2.4-GHz band. Though promising, channel hopping still faces challenges because the increasingly dense deployment of CTI leaves very few available channels. Selecting a good channel with the least overhead is crucial but challenging. Most of the existing works are heuristic methods that choose a channel far from the current one to avoid adjacent channels that may be correlatively interfered by CTI with a wider bandwidth such as WiFi. However, we observe that the correlated channels influenced by the same CTI source do not necessarily have the same channel qualities and even the opposite state, due to the uneven spectrum power density of CTI.]]></description>
			<pubDate>Sat, 23 Jan 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3440248</guid>
		</item>
	</channel>
</rss>
