{"title":"Using Human Social Sensors for Robust Event Location Detection","authors":"Ioannis Boutsis, V. Kalogeraki","doi":"10.1109/DCOSS.2016.29","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.29","url":null,"abstract":"Recently, the massive prevalence of mobile devices has led to the development of mobile social sensing systems where humans are enlisted to act as social sensors to perform geo-located tasks that require human intelligence or intervention. Social sensing from ubiquitous users can provide significant benefits particularly during crisis management and emergency scenarios. However, an important problem during such emergencies is how to exploit social sensors to accurately determine the location, extent and severity of the event. In this paper we develop a social sensing system that uses humans as social sensors where we apply particle filtering to iteratively determine the spatial areas to be investigated to accurately detect the location and state of the target event. Our experiments illustrate that our approach can accurately identify critical real-world events using feedback from the social sensors.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124048369","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}
{"title":"WiFi-ID: Human Identification Using WiFi Signal","authors":"Jin Zhang, Bo Wei, Wen Hu, S. Kanhere","doi":"10.1109/DCOSS.2016.30","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.30","url":null,"abstract":"Prior research has shown the potential of device-free WiFi sensing for human activity recognition. In this paper, we show for the first time WiFi signals can also be used to uniquely identify people. There is strong evidence that suggests that all humans have a unique gait. An individual's gait will thus create unique perturbations in the WiFi spectrum. We propose a system called WiFi-ID that analyses the channel state information to extract unique features that are representative of the walking style of that individual and thus allow us to uniquely identify that person. We implement WiFi-ID on commercial off-the-shelf devices. We conduct extensive experiments to demonstrate that our system can uniquely identify people with average accuracy of 93% to 77% from a group of 2 to 6 people, respectively. We envisage that this technology can find many applications in small office or smart home settings.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133761367","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}
{"title":"SenseWit: Pervasive Floorplan Generation Based on Only Inertial Sensing","authors":"Jiaqi Liang, Yuan He, Yunhao Liu","doi":"10.1109/DCOSS.2016.25","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.25","url":null,"abstract":"Mobile crowdsourcing is deemed as a powerful technique to solve traditional problems. But the crowdsourced data from smartphones are generally with low quality, which induce crucial challenges and hurt the applicability of crowdsourcing applications. This paper presents our study to address such challenges in a concrete application, namely floorplan generation. In order to utilize pedestrians' traces for indoor location inference, existing proposals mostly rely on infrastructural references or accurate data sources, which are by nature restricted in terms of applicability and pervasiveness. Our proposal called SenseWit is motivated by the observation that people's behavior offers meaningful clues for location inference. The noise, ambiguity, and behavior diversity contained in the crowdsourced data, however, mean non-trivial challenges in generating high-quality floorplans. We propose 1) a novel concept called Nail to identify featured locations in indoor space and 2) a heuristic pathlet bundling algorithm to progressively discover the internal layouts. We implement SenseWit and conduct real-world experiments in different spaces. Our work offers an efficient technique to obtain high-quality structures (either logical or physical) from low-quality data. We believe it can be generalized to other crowdsourcing applications.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130772461","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}
I. Dhanapala, Ramona Marfievici, P. Agrawal, D. Pesch
{"title":"Towards Detecting WiFi Aggregated Interference for Wireless Sensors Based on Traffic Modelling","authors":"I. Dhanapala, Ramona Marfievici, P. Agrawal, D. Pesch","doi":"10.1109/DCOSS.2016.31","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.31","url":null,"abstract":"We present a technique to identify transmission timing for IEEE 802.15.4 based Wireless Sensor Networks (WSNs) in the presence of WiFi interference. Our technique is based on modeling WiFi traffic with a Modulated Markov Poisson Process (MMPP) model in order to enable us to predict when WiFi transmissions take place and avoid them. We have evaluated the accuracy of our model in a small test-bed. Results are promising and suggest that our approach can increase the reliability of IEEE802.15.4 transmissions.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126985398","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}
{"title":"Learning-Based and Data-Driven TCP Design for Memory-Constrained IoT","authors":"Wei Li, Fan Zhou, W. Meleis, K. Chowdhury","doi":"10.1109/DCOSS.2016.8","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.8","url":null,"abstract":"Advances in wireless technology have resulted in pervasive deployment of devices of a high variability in form factors, memory and computational ability. The need for maintaining continuous connections that deliver data with high reliability necessitate re-thinking of conventional design of the transport layer protocol. This paper investigates the use of Q-learning in TCP cwnd adaptation during the congestion avoidance state, wherein the classical alternation of the window is replaced, thereby allowing the protocol to immediately respond to previously seen network conditions. Furthermore, it demonstrates how memory plays a critical role in building the exploration space, and proposes ways to reduce this overhead through function approximation. The superior performance of the learning-based approach over TCP New Reno is demonstrated through a comprehensive simulation study, revealing 33.8% and 12.1% improvement in throughput and delay, respectively, for the evaluated topologies. We also show how function approximation can be used to dramatically reduce the memory requirements of a learning-based protocol while maintaining the same throughput and delay.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127321136","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}
{"title":"Modeling Optimal Dynamic Scheduling for Energy-Aware Workload Distribution in Wireless Sensor Networks","authors":"Wanli Yu, Yanqiu Huang, A. Ortiz","doi":"10.1109/DCOSS.2016.39","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.39","url":null,"abstract":"Energy-aware workload distribution becomes crucial for extending the lifetime of wireless sensor networks (WSNs) in complex applications as those in Internet-of-Things or in-network DSP processing scenarios. Today static workload schedules are well understood, while dynamic schedules (i.e., with multiple partitions) remain unexplored. This paper models the dynamic scheduling by considering both the communication and computation energy consumption. It formulates a series of (integer) linear programming problems to characterize the optimal scheduling strategies. Surprisingly, even 2-partition scheduling can provide the maximum gains. Besides the interest to evaluate the optimality of on-line heuristics for dynamic scheduling, the reported off-line strategies can be immediately applied to WSN applications.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131155834","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}
{"title":"Maintaining Constructive Interference Using Well-Synchronized Sensor Nodes","authors":"Michael König, Roger Wattenhofer","doi":"10.1109/DCOSS.2016.32","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.32","url":null,"abstract":"Traditionally, achieving constructive interference (CI) required specialized timekeeping hardware. Recently, the ability and interest to employ CI distributedly at any time using groups of ordinary single antenna wireless sensor nodes have grown. In this paper, we investigate achieving CI on sensor nodes. We consider the commonly employed IEEE 802.15.4 wireless standard, which uses a chip frequency of 1 MHz. This means signals need to be synchronized with an error below 0.5 microseconds to allow for CI. Hence, excellent clock synchronization between nodes as well as precise transmission timing are required. We implemented and tested a prototype addressing the implementation challenges of synchronizing the nodes' clocks up to a precision of a few hundred nanoseconds and of timing transmissions as accurately as possible. Our results show that, even after multiple minutes of sleep, our approach is able to achieve CI in over 30% of cases, in scenarios in which any influence from the capture effect can be ruled out. This leads to an increase in a packet's chance of arrival to 30-65%, compared to 0-30% when transmitting with either less synchrony or different data payload. Further, we find that 2 senders generally increase the signal power by 2-3 dB and can double the packet reception ratio of weak links.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115017597","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}
{"title":"Bounding Distributed Energy Balancing Schemes for WSNs via Modular Subgames","authors":"Julia Buwaya, J. Rolim","doi":"10.1109/DCOSS.2016.13","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.13","url":null,"abstract":"This paper studies means of archiving energy balance in Wireless Sensor Networks (WSNs) as criterion to increase network lifetime. While protocols for balancing energy through centralized computation have been established, effective solutions for more realistic distributed settings are still an open research field. In this work, we present a novel approach for balancing energy in WSNs in a distributed manner by solving a sequence of modular strategic subgames. In addition, we prove theoretical bounds for its solution quality. To the best of our knowledge, we are the first to explicitly provide theoretical bounds for distributed WSN energy balancing schemes. We do so by formulating two specific routing games in which sensor nodes act as strategic agents with interests in energy balance. The first formulated game is a monotone utility game and by exploiting and adapting some existing results, we can prove a meaningful relative bound for its solution value via our distributed modular subgames scheme under realistic conditions. For the second game we provide an absolute bound. We round up our theoretical results by an experimental evaluation, where our modular subgames scheme shows increased performance compared to state-of-the-art algorithms.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123455872","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}