%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "1.61", %%% date = "17 March 2026", %%% time = "15:23:35 MDT", %%% filename = "tosn.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% URL = "https://www.math.utah.edu/~beebe", %%% checksum = "03502 39525 208211 1963032", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "ACM Transactions on Sensor Networks; %%% bibliography; TOSN", %%% license = "public domain", %%% supported = "yes", %%% docstring = "This is a COMPLETE BibTeX bibliography for %%% ACM Transactions on Sensor Networks (CODEN %%% ????, ISSN 1550-4859 (print), 1550-4867 %%% (electronic)), covering all journal issues %%% from 2005 -- date. The journal is published %%% quarterly in February, May, August, and %%% November, and the first issue was published %%% in August 2005. In 2024, the issue count was %%% increased to six per year. %%% %%% At version 1.61, the COMPLETE journal %%% coverage looked like this: %%% %%% 2005 ( 12) 2013 ( 62) 2021 ( 40) %%% 2006 ( 22) 2014 ( 57) 2022 ( 76) %%% 2007 ( 22) 2015 ( 42) 2023 ( 98) %%% 2008 ( 26) 2016 ( 37) 2024 ( 130) %%% 2009 ( 45) 2017 ( 34) 2025 ( 62) %%% 2010 ( 54) 2018 ( 31) 2026 ( 14) %%% 2011 ( 18) 2019 ( 49) %%% 2012 ( 36) 2020 ( 42) %%% %%% Article: 1009 %%% %%% Total entries: 1009 %%% %%% The journal Web page can be found at: %%% %%% http://www.acm.org/tosn/ %%% %%% The journal table of contents page is at: %%% %%% http://portal.acm.org/browse_dl.cfm?idx=J981 %%% %%% Qualified subscribers can retrieve the full %%% text of recent articles in PDF form. %%% %%% The initial draft was extracted from the ACM %%% Web pages. %%% %%% ACM copyrights explicitly permit abstracting %%% with credit, so article abstracts, keywords, %%% and subject classifications have been %%% included in this bibliography wherever %%% available. Article reviews have been %%% omitted, until their copyright status has %%% been clarified. %%% %%% bibsource keys in the bibliography entries %%% below indicate the entry originally came %%% from the computer science bibliography %%% archive, even though it has likely since %%% been corrected and updated. %%% %%% URL keys in the bibliography point to %%% World Wide Web locations of additional %%% information about the entry. %%% %%% BibTeX citation tags are uniformly chosen %%% as name:year:abbrev, where name is the %%% family name of the first author or editor, %%% year is a 4-digit number, and abbrev is a %%% 3-letter condensation of important title %%% words. Citation tags were automatically %%% generated by software developed for the %%% BibNet Project. %%% %%% In this bibliography, entries are sorted in %%% publication order, using ``bibsort -byvolume.'' %%% %%% The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility." %%% } %%% ==================================================================== @Preamble{"\input bibnames.sty"} %%% ==================================================================== %%% Acknowledgement abbreviations: @String{ack-nhfb = "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|https://www.math.utah.edu/~beebe/|"} %%% ==================================================================== %%% Journal abbreviations: @String{j-TOSN = "ACM Transactions on Sensor Networks"} %%% ==================================================================== %%% Bibliography entries: @Article{Zhao:2005:I, author = "Feng Zhao", title = "Introduction", journal = j-TOSN, volume = "1", number = "1", pages = "1--2", month = aug, year = "2005", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Dec 27 07:32:01 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Li:2005:NPS, author = "Qun Li and Daniela Rus", title = "Navigation protocols in sensor networks", journal = j-TOSN, volume = "1", number = "1", pages = "3--35", month = aug, year = "2005", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Dec 27 07:32:01 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Xing:2005:ICC, author = "Guoliang Xing and Xiaorui Wang and Yuanfang Zhang and Chenyang Lu and Robert Pless and Christopher Gill", title = "Integrated coverage and connectivity configuration for energy conservation in sensor networks", journal = j-TOSN, volume = "1", number = "1", pages = "36--72", month = aug, year = "2005", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Dec 27 07:32:01 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Lazos:2005:SRL, author = "Loukas Lazos and Radha Poovendran", title = "{SeRLoc}: {Robust} localization for wireless sensor networks", journal = j-TOSN, volume = "1", number = "1", pages = "73--100", month = aug, year = "2005", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Dec 27 07:32:01 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{He:2005:FTI, author = "Guanghui He and Rong Zheng and Indranil Gupta and Lui Sha", title = "A framework for time indexing in sensor networks", journal = j-TOSN, volume = "1", number = "1", pages = "101--133", month = aug, year = "2005", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Dec 27 07:32:01 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Nguyen:2005:KBL, author = "Xuanlong Nguyen and Michael I. Jordan and Bruno Sinopoli", title = "A kernel-based learning approach to ad hoc sensor network localization", journal = j-TOSN, volume = "1", number = "1", pages = "134--152", month = aug, year = "2005", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Dec 27 07:32:01 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ledeczi:2005:CSU, author = "{\'A}kos L{\'e}deczi and Andr{\'a}s N{\'a}das and P{\'e}ter V{\"o}lgyesi and Gy{\"o}rgy Balogh and Branislav Kusy and J{\'a}nos Sallai and G{\'a}bor Pap and Sebesty{\'e}n D{\'o}ra and K{\'a}roly Moln{\'a}r and Mikl{\'o}s Mar{\'o}ti and Gyula Simon", title = "Countersniper system for urban warfare", journal = j-TOSN, volume = "1", number = "2", pages = "153--177", month = nov, year = "2005", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Dec 27 07:32:01 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Prabh:2005:ECD, author = "K. Shashi Prabh and Tarek F. Abdelzaher", title = "Energy-conserving data cache placement in sensor networks", journal = j-TOSN, volume = "1", number = "2", pages = "178--203", month = nov, year = "2005", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Dec 27 07:32:01 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liu:2005:IKP, author = "Donggang Liu and Peng Ning", title = "Improving key predistribution with deployment knowledge in static sensor networks", journal = j-TOSN, volume = "1", number = "2", pages = "204--239", month = nov, year = "2005", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Dec 27 07:32:01 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Huang:2005:FFA, author = "Qingfeng Huang and Sangeeta Bhattacharya and Chenyang Lu and Gruia-Catalin Roman", title = "{FAR}: {Face-Aware Routing} for mobicast in large-scale sensor networks", journal = j-TOSN, volume = "1", number = "2", pages = "240--271", month = nov, year = "2005", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Dec 27 07:32:01 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhang:2005:UBL, author = "Honghai Zhang and Jennifer C. Hou", title = "On the upper bound of {$\alpha$}-lifetime for large sensor networks", journal = j-TOSN, volume = "1", number = "2", pages = "272--300", month = nov, year = "2005", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Dec 27 07:32:01 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhang:2005:ODS, author = "Xin Zhang and Stephen B. Wicker", title = "On the optimal distribution of sensors in a random field", journal = j-TOSN, volume = "1", number = "2", pages = "301--306", month = nov, year = "2005", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Dec 27 07:32:01 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{He:2006:VIS, author = "Tian He and Sudha Krishnamurthy and Liqian Luo and Ting Yan and Lin Gu and Radu Stoleru and Gang Zhou and Qing Cao and Pascal Vicaire and John A. Stankovic and Tarek F. Abdelzaher and Jonathan Hui and Bruce Krogh", title = "{VigilNet}: an integrated sensor network system for energy-efficient surveillance", journal = j-TOSN, volume = "2", number = "1", pages = "1--38", month = feb, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 28 07:01:48 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Costa:2006:DWM, author = "Jose A. Costa and Neal Patwari and Alfred O. {Hero III}", title = "Distributed weighted-multidimensional scaling for node localization in sensor networks", journal = j-TOSN, volume = "2", number = "1", pages = "39--64", month = feb, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 28 07:01:48 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Law:2006:SBB, author = "Yee Wei Law and Jeroen Doumen and Pieter Hartel", title = "Survey and benchmark of block ciphers for wireless sensor networks", journal = j-TOSN, volume = "2", number = "1", pages = "65--93", month = feb, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 28 07:01:48 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Carbunar:2006:RCD, author = "Bogdan C{\u{a}}rbunar and Ananth Grama and Jan Vitek and Octavian C{\u{a}}rbunar", title = "Redundancy and coverage detection in sensor networks", journal = j-TOSN, volume = "2", number = "1", pages = "94--128", month = feb, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 28 07:01:48 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Li:2006:LTC, author = "Xiang-Yang Li and Wen-Zhan Song and Yu Wang", title = "Localized topology control for heterogeneous wireless sensor networks", journal = j-TOSN, volume = "2", number = "1", pages = "129--153", month = feb, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 28 07:01:48 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ganesan:2006:PES, author = "Deepak Ganesan and Razvan Cristescu and Baltasar Beferull-Lozano", title = "Power-efficient sensor placement and transmission structure for data gathering under distortion constraints", journal = j-TOSN, volume = "2", number = "2", pages = "155--181", month = may, year = "2006", CODEN = "????", DOI = "https://doi.org/10.1145/1149283.1149284", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Oct 1 19:09:34 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider the joint optimization of sensor placement and transmission structure for data gathering, where a given number of nodes need to be placed in a field such that the sensed data can be reconstructed at a sink within specified distortion bounds while minimizing the energy consumed for communication. We assume that the nodes use either joint entropy coding based on explicit communication between sensor nodes, where coding is done when side information is available, or Slepian-Wolf coding where nodes have knowledge of network correlation statistics. We consider both maximum and average distortion bounds. We prove that this optimization is NP-complete since it involves an interplay between the spaces of possible transmission structures given radio reachability limitations, and feasible placements satisfying distortion bounds.We address this problem by first looking at the simplified problem of optimal placement in the one-dimensional case. An analytical solution is derived for the case when there is a simple aggregation scheme, and numerical results are provided for the cases when joint entropy encoding is used. We use the insight from our 1-D analysis to extend our results to the 2-D case and compare it to typical uniform random placement and shortest-path tree. Our algorithm for two-dimensional placement and transmission structure provides two to three fold reduction in total power consumption and between one to two orders of magnitude reduction in bottleneck power consumption. We perform an exhaustive performance analysis of our scheme under varying correlation models and model parameters and demonstrate that the performance improvement is typical over a range of data correlation models and parameters. We also study the impact of performing computationally-efficient data conditioning over a local scope rather than the entire network. Finally, we extend our explicit placement results to a randomized placement scheme and show that such a scheme can be effective when deployment does not permit exact node placement.", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Huang:2006:DEC, author = "Chi-Fu Huang and Li-Chu Lo and Yu-Chee Tseng and Wen-Tsuen Chen", title = "Decentralized energy-conserving and coverage-preserving protocols for wireless sensor networks", journal = j-TOSN, volume = "2", number = "2", pages = "182--187", month = may, year = "2006", CODEN = "????", DOI = "https://doi.org/10.1145/1149283.1149285", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Oct 1 19:09:34 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we propose several decentralized protocols that schedule sensors' active and sleeping periods to prolong the network lifetime while maintain the sensing field sufficiently covered. The proposed protocols are based on a model similar to that of Yan et al. [2003], but improve its results in several senses. First, our approach can significantly reduce the computational complexity incurred, and at the same time achieve better accuracy in determining the coverage of the sensing area. Second, we extend the result such that it can support multilayer coverage of the sensing field. Third, we further enhance it [Yan et al. 2003] by proposing several optimization mechanisms to balance or reduce sensors' energy expenditure.", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Biswas:2006:SPB, author = "Pratik Biswas and Tzu-Chen Lian and Ta-Chung Wang and Yinyu Ye", title = "Semidefinite programming based algorithms for sensor network localization", journal = j-TOSN, volume = "2", number = "2", pages = "188--220", month = may, year = "2006", CODEN = "????", DOI = "https://doi.org/10.1145/1149283.1149286", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Oct 1 19:09:34 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "An SDP relaxation based method is developed to solve the localization problem in sensor networks using incomplete and inaccurate distance information. The problem is set up to find a set of sensor positions such that given distance constraints are satisfied. The nonconvex constraints in the formulation are then relaxed in order to yield a semidefinite program that can be solved efficiently.The basic model is extended in order to account for noisy distance information. In particular, a maximum likelihood based formulation and an interval based formulation are discussed. The SDP solution can then also be used as a starting point for steepest descent based local optimization techniques that can further refine the SDP solution.We also describe the extension of the basic method to develop an iterative distributed SDP method for solving very large scale semidefinite programs that arise out of localization problems for large dense networks and are intractable using centralized methods.The performance evaluation of the technique with regard to estimation accuracy and computation time is also presented by the means of extensive simulations.Our SDP scheme also seems to be applicable to solving other Euclidean geometry problems where points are locally connected.", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhou:2006:MSR, author = "Gang Zhou and Tian He and Sudha Krishnamurthy and John A. Stankovic", title = "Models and solutions for radio irregularity in wireless sensor networks", journal = j-TOSN, volume = "2", number = "2", pages = "221--262", month = may, year = "2006", CODEN = "????", DOI = "https://doi.org/10.1145/1149283.1149287", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Oct 1 19:09:34 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we investigate the impact of radio irregularity on wireless sensor networks. Radio irregularity is a common phenomenon that arises from multiple factors, such as variance in RF sending power and different path losses, depending on the direction of propagation. From our experiments, we discover that the variance in received signal strength is largely random; however, it exhibits a continuous change with incremental changes in direction. With empirical data obtained from the MICA2 and MICAZ platforms, we establish a radio model for simulation, called the Radio Irregularity Model (RIM). This model is the first to bridge the discrepancy between the spherical radio models used by simulators and the physical reality of radio signals. With this model, we investigate the impact of radio irregularity on several upper layer protocols, including MAC, routing, localization and topology control. Our results show that radio irregularity has a relatively larger impact on the routing layer than the MAC layer. It also shows that radio irregularity leads to larger localization errors and makes it harder to maintain communication connectivity in topology control. To deal with these issues, we present eight solutions to deal with radio irregularity. We evaluate three of them in detail. The results obtained from both the simulations and a running testbed demonstrate that our solutions greatly improve system performance in the presence of radio irregularity.", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liu:2006:ORT, author = "Xue Liu and Qixin Wang and Wenbo He and Marco Caccamo and Lui Sha", title = "Optimal real-time sampling rate assignment for wireless sensor networks", journal = j-TOSN, volume = "2", number = "2", pages = "263--295", month = may, year = "2006", CODEN = "????", DOI = "https://doi.org/10.1145/1149283.1149288", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Oct 1 19:09:34 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "How to allocate computing and communication resources in a way that maximizes the effectiveness of control and signal processing, has been an important area of research. The characteristic of a multi-hop Real-Time Wireless Sensor Network raises new challenges. First, the constraints are more complicated and a new solution method is needed. Second, a distributed solution is needed to achieve scalability. This article presents solutions to both of the new challenges. The first solution to the optimal rate allocation is a centralized solution that can handle the more general form of constraints as compared with prior research. The second solution is a distributed version for large sensor networks using a pricing scheme. It is capable of incremental adjustment when utility functions change. This article also presents a new sensor device/network backbone architecture---Real-time Independent CHannels (RICH), which can easily realize multi-hop real-time wireless sensor networking.", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chakrabarti:2006:CPO, author = "Arnab Chakrabarti and Ashutosh Sabharwal and Behnaam Aazhang", title = "Communication power optimization in a sensor network with a path-constrained mobile observer", journal = j-TOSN, volume = "2", number = "3", pages = "297--324", month = aug, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Lazos:2006:SCH, author = "Loukas Lazos and Radha Poovendran", title = "Stochastic coverage in heterogeneous sensor networks", journal = j-TOSN, volume = "2", number = "3", pages = "325--358", month = aug, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Fragouli:2006:CCT, author = "Christina Fragouli and Tarik Tabet", title = "On conditions for constant throughput in wireless networks", journal = j-TOSN, volume = "2", number = "3", pages = "359--379", month = aug, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Devarajan:2006:DMC, author = "Dhanya Devarajan and Richard J. Radke and Haeyong Chung", title = "Distributed metric calibration of ad hoc camera networks", journal = j-TOSN, volume = "2", number = "3", pages = "380--403", month = aug, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ramachandran:2006:DDF, author = "Umakishore Ramachandran and Rajnish Kumar and Matthew Wolenetz and Brian Cooper and Bikash Agarwalla and Junsuk Shin and Phillip Hutto and Arnab Paul", title = "Dynamic data fusion for future sensor networks", journal = j-TOSN, volume = "2", number = "3", pages = "404--443", month = aug, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Funke:2006:SID, author = "Stefan Funke and Alexander Kesselman and Ulrich Meyer and Michael Segal", title = "A simple improved distributed algorithm for minimum {CDS} in unit disk graphs", journal = j-TOSN, volume = "2", number = "3", pages = "444--453", month = aug, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Agarwal:2006:SOS, author = "Pankaj K. Agarwal and David Brady and Ji{\v{r}}{\'\i} Matou{\v{s}}ek", title = "Segmenting object space by geometric reference structures", journal = j-TOSN, volume = "2", number = "4", pages = "455--465", month = nov, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Jindal:2006:MSC, author = "Apoorva Jindal and Konstantinos Psounis", title = "Modeling spatially correlated data in sensor networks", journal = j-TOSN, volume = "2", number = "4", pages = "466--499", month = nov, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhu:2006:LES, author = "Sencun Zhu and Sanjeev Setia and Sushil Jajodia", title = "{LEAP+}: {Efficient} security mechanisms for large-scale distributed sensor networks", journal = j-TOSN, volume = "2", number = "4", pages = "500--528", month = nov, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Arici:2006:PEB, author = "Tarik Arici and Toygar Akgun and Yucel Altunbasak", title = "A prediction error-based hypothesis testing method for sensor data acquisition", journal = j-TOSN, volume = "2", number = "4", pages = "529--556", month = nov, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Cao:2006:SLC, author = "Qing Cao and Tarek Abdelzaher", title = "Scalable logical coordinates framework for routing in wireless sensor networks", journal = j-TOSN, volume = "2", number = "4", pages = "557--593", month = nov, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Goldberg:2006:VIE, author = "David H. Goldberg and Andreas G. Andreou and Pedro Juli{\'a}n and Philippe O. Pouliquen and Laurence Riddle and Rich Rosasco", title = "{VLSI} implementation of an energy-aware wake-up detector for an acoustic surveillance sensor network", journal = j-TOSN, volume = "2", number = "4", pages = "594--611", month = nov, year = "2006", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Huang:2007:DPE, author = "Chi-Fu Huang and Yu-Chee Tseng and Hsiao-Lu Wu", title = "Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network", journal = j-TOSN, volume = "3", number = "1", pages = "??--??", month = mar, year = "2007", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ramachandran:2007:ACA, author = "Iyappan Ramachandran and Arindam K. Das and Sumit Roy", title = "Analysis of the contention access period of {IEEE} 802.15.4 {MAC}", journal = j-TOSN, volume = "3", number = "1", pages = "??--??", month = mar, year = "2007", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Su:2007:CAA, author = "Xun Su", title = "A combinatorial algorithmic approach to energy efficient information collection in wireless sensor networks", journal = j-TOSN, volume = "3", number = "1", pages = "??--??", month = mar, year = "2007", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tiwari:2007:EEW, author = "Ankit Tiwari and Prasanna Ballal and Frank L. Lewis", title = "Energy-efficient wireless sensor network design and implementation for condition-based maintenance", journal = j-TOSN, volume = "3", number = "1", pages = "??--??", month = mar, year = "2007", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Trigoni:2007:WSR, author = "Niki Trigoni and Yong Yao and Alan Demers and Johannes Gehrke and Rajmohan Rajaraman", title = "Wave scheduling and routing in sensor networks", journal = j-TOSN, volume = "3", number = "1", pages = "??--??", month = mar, year = "2007", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yoon:2007:CAC, author = "Sunhee Yoon and Cyrus Shahabi", title = "The {Clustered AGgregation (CAG)} technique leveraging spatial and temporal correlations in wireless sensor networks", journal = j-TOSN, volume = "3", number = "1", pages = "??--??", month = mar, year = "2007", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Apr 14 11:10:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zamalloa:2007:AUA, author = "Marco Z{\'u}{\~n}iga Zamalloa and Bhaskar Krishnamachari", title = "An analysis of unreliability and asymmetry in low-power wireless links", journal = j-TOSN, volume = "3", number = "2", pages = "7:1--7:??", month = jun, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1240226.1240227", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:12 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Experimental studies have demonstrated that the behavior of real links in low-power wireless networks (such as wireless sensor networks) deviates to a large extent from the ideal binary model used in several simulation studies. In particular, there is a large transitional region in wireless link quality that is characterized by significant levels of unreliability and asymmetry, significantly impacting the performance of higher-layer protocols. We provide a comprehensive analysis of the root causes of unreliability and asymmetry. In particular, we derive expressions for the distribution, expectation, and variance of the packet reception rate as a function of distance, as well as for the location and extent of the transitional region. These expressions incorporate important environmental and radio parameters such as the path loss exponent and shadowing variance of the channel, and the modulation, encoding, and hardware variance of the radios.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "communication theory; hardware variance; probability theory; transitional region; wireless link", } @Article{Yoon:2007:TST, author = "Suyoung Yoon and Chanchai Veerarittiphan and Mihail L. Sichitiu", title = "Tiny-sync: {Tight} time synchronization for wireless sensor networks", journal = j-TOSN, volume = "3", number = "2", pages = "8:1--8:??", month = jun, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1240226.1240228", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:12 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Time synchronization is a fundamental middleware service for any distributed system. Wireless sensor networks make extensive use of synchronized time in many contexts (e.g., data fusion, TDMA schedules, synchronized sleep periods, etc.). We propose a time synchronization method relevant for wireless sensor networks. The solution features minimal complexity in network bandwidth, storage as well as processing, and can achieve good accuracy. Especially relevant for sensor networks, it also provides tight, deterministic bounds on offset and clock drift. A method for synchronizing the entire network is presented. The performance of the algorithm is analyzed theoretically and validated on a realistic testbed. The results show that the proposed algorithm outperforms existing algorithms in terms of precision and resource requirements.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "sensor networks; time synchronization", } @Article{Brass:2007:BCT, author = "Peter Brass", title = "Bounds on coverage and target detection capabilities for models of networks of mobile sensors", journal = j-TOSN, volume = "3", number = "2", pages = "9:1--9:??", month = jun, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1240226.1240229", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:12 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article we analyze the capabilities of various models of sensor networks with the Boolean sensing model for mobile or stationary sensors and targets, under random or optimal placement, independent or globally coordinated search, and stealthy or visible sensors. For each model we give an upper bound for the capabilities under any strategy, and a search strategy which at least asymptotically matches that bound. To ensure comparability of these models, we present them using the same parameters: the sensing radius $r$, sensor placement density $\lambda$, as well as the travel distance $l$ of each sensor and $d$ of the target. By this we obtain a complete analysis of the geometric coverage and detection capabilities of the various models of sensor networks, where we abstract from issues like communication and power management.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Boolean sensing model; coverage capabilities; foundations of sensor networks; mobile sensors; search strategies; sensor deployment", } @Article{Gelenbe:2007:DMP, author = "Erol Gelenbe", title = "A diffusion model for packet travel time in a random multihop medium", journal = j-TOSN, volume = "3", number = "2", pages = "10:1--10:??", month = jun, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1240226.1240230", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:12 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider a wireless network in which packets are forwarded opportunistically from the source towards the destination, without accurate knowledge of the direction that they should take. A Brownian motion model that includes the effect of packet losses, and subsequent retransmission after a time-out, is used to compute the average travel time of the packet. The results indicate that the average travel time is always finite provided that a time-out is used, and that there is an element of randomness in the manner in which successive nodes are being chosen. We show that the average packet travel time can be minimized by a judicious choice of the time-out, and its optimum value in turn depends on other system parameters such as packet-loss probabilities. We present simulations that illustrate the analytical results.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "ad hoc networks; autonomic communications; diffusion process; packet travel time; sensor networks; simulation; wireless networks", } @Article{Xing:2007:MPC, author = "Guoliang Xing and Chenyang Lu and Ying Zhang and Qingfeng Huang and Robert Pless", title = "Minimum power configuration for wireless communication in sensor networks", journal = j-TOSN, volume = "3", number = "2", pages = "11:1--11:??", month = jun, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1240226.1240231", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:12 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article proposes the minimum power configuration (MPC) approach to power management in wireless sensor networks. In contrast to earlier research that treats different radio states (i.e., transmission/reception/idle) in isolation, MPC integrates them in a joint optimization problem that depends on both the set of active nodes and the transmission power. We propose four approximation algorithms with provable performance bounds and two practical routing protocols. Simulations based on realistic radio models show that the MPC approach can conserve more energy than existing minimum power routing and topology control protocols. Furthermore, it can flexibly adapt to network workload and radio platforms.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "ad hoc networks; energy efficiency; minimum power configuration; sensor networks; wireless communications", } @Article{Cheng:2007:CBP, author = "Maggie X. Cheng and Lu Ruan and Weili Wu", title = "Coverage breach problems in bandwidth-constrained sensor networks", journal = j-TOSN, volume = "3", number = "2", pages = "12:1--12:??", month = jun, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1240226.1240232", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:12 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Recent research in sensor networks highlights the low-power mode operation of sensor networks. In wireless sensor networks, network lifetime can be extended by organizing sensors into mutually exclusive subsets and alternatively activating each subset. Coverage breach occurs when a subset fails to cover all the targets. In bandwidth-constrained sensor networks, coverage breach is more likely to happen because when active sensors periodically send data to the base station, contention for channel access must be considered. Channel bandwidth imposes a limit on the cardinality of each subset. To make efficient use of both energy and bandwidth with minimum coverage breach requires optimal arrangement of sensor nodes.\par This article addresses three coverage breach problems related to the low-power operation of wireless sensor networks where channel bandwidth is limited. The three coverage breach problems are formulated using integer linear programming models. A greedy approximation algorithm and a heuristic based on the LP-relaxation method are proposed. Effects of changing different network resources on sensor network coverage are studied through simulations. One consistent result is that when the number of sensors increases, network lifetime can be improved without loss of network coverage only if there is no bandwidth constraint; with bandwidth constraints, network lifetime may be improved further at the cost of coverage breach.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "coverage; coverage breach; energy efficiency; network lifetime; scheduling; sensor networks", } @Article{Girod:2007:ESE, author = "Lewis Girod and Nithya Ramanathan and Jeremy Elson and Thanos Stathopoulos and Martin Lukac and Deborah Estrin", title = "{Emstar}: a software environment for developing and deploying heterogeneous sensor-actuator networks", journal = j-TOSN, volume = "3", number = "3", pages = "13:1--13:??", month = aug, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1267060.1267061", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:25 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Recent work in wireless embedded networked systems has followed heterogeneous designs, incorporating a mixture of elements from extremely constrained 8- or 16-bit ``Motes'' to less resource-constrained 32-bit embedded ``Microservers.''\par Emstar is a software environment for developing and deploying complex applications on such heterogeneous networks. Emstar is designed to leverage the additional resources of Microservers by trading off some performance for system robustness in sensor network applications. It enables fault isolation, fault tolerance, system visiblity, in-field debugging, and resource sharing across multiple applications.\par In order to accomplish these objectives, Emstar is designed to run as a multiprocess system and consists of libraries that implement message-passing IPC primitives, services that support networking, sensing, and time synchronization, and tools that support simulation, emulation, and visualization of live systems, both real and simulated. We evaluate this work by discussing the Acoustic ENSBox, a platform for distributed acoustic sensing that we built using Emstar. We show that by leveraging existing Emstar services, we are able to significantly reduce development time while achieving a high degree of robustness. We also show that a sample application was developed much more quickly on this platform than it would have been otherwise.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Emstar; Real code simulation; sensor networks; TinyOS", } @Article{Zhu:2007:IHH, author = "Sencun Zhu and Sanjeev Setia and Sushil Jajodia and Peng Ning", title = "Interleaved hop-by-hop authentication against false data injection attacks in sensor networks", journal = j-TOSN, volume = "3", number = "3", pages = "14:1--14:??", month = aug, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1267060.1267062", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:25 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Sensor networks are often deployed in unattended environments, thus leaving these networks vulnerable to false data injection attacks in which an adversary injects false data into the network with the goal of deceiving the base station or depleting the resources of the relaying nodes. Standard authentication mechanisms cannot prevent this attack if the adversary has compromised one or a small number of sensor nodes. We present three interleaved hop-by-hop authentication schemes that guarantee that the base station can detect injected false data immediately when no more than $t$ nodes are compromised, where $t$ is a system design parameter. Moreover, these schemes enable an intermediate forwarding node to detect and discard false data packets as early as possible. Our performance analysis shows that our scheme is efficient with respect to the security it provides, and it also allows a tradeoff between security and performance. A prototype implementation of our scheme indicates that our scheme is practical and can be deployed on the current generation of sensor nodes.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "authentication; filtering false data; interleaved hop-by-hop; sensor networks", } @Article{Hua:2007:ARS, author = "Cunqing Hua and Tak-Shing Peter Yum", title = "Asynchronous random sleeping for sensor networks", journal = j-TOSN, volume = "3", number = "3", pages = "15:1--15:??", month = aug, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1267060.1267063", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:25 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Sleeping scheduling is a common energy-conservation solution for sensor networks. For application whereby coordination of sleeping among sensors is not possible or inconvenient, random sleeping is the only option. In this article, we study the asynchronous random sleeping(ARS) scheme whereby sensors (i) do not need to synchronize with each other, and (ii) do not need to coordinate their sleeping schedules. The stationary coverage probability and the expected coverage periods for ARS are derived. For surveillance application, we derive in addition the detection probability and detection delay distribution. The correctness of our results is validated through extensive simulations. We compare ARS with other synchronous and asynchronous sleeping scheduling algorithms and show that ARS offers better performance in terms of detection delay in the lower duty-cycle regime. We also conduct simulations to demonstrate that our results can be a good approximation for clock drifting case.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "energy conservation; event detection; k-coverage; random sleeping; sensor network", } @Article{Huang:2007:SPK, author = "Dijiang Huang and Deep Medhi", title = "Secure pairwise key establishment in large-scale sensor networks: an area partitioning and multigroup key predistribution approach", journal = j-TOSN, volume = "3", number = "3", pages = "16:1--16:??", month = aug, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1267060.1267064", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:25 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Existing pairwise key establishment schemes for large-scale sensor networks are vulnerable to various passive or active attacks. We classify attacks as selective node capture attacks, node fabrication attacks, and insider attacks. In order to improve the security robustness of random key predistribution and pairwise key establishment schemes against these attacks, we propose a five-phase pairwise key predistribution and pairwise key establishment approach by using area partitioning and multigroup key predistribution. Our security performance studies show that our proposed approach is resilient to selective node capture and node fabrication attacks, and restricts the consequence of any insider attack to a minimal level.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "insider attack; node fabrication; selective node capture; sensor", } @Article{Hoang:2007:CBC, author = "Anh Tuan Hoang and Mehul Motani", title = "Collaborative broadcasting and compression in cluster-based wireless sensor networks", journal = j-TOSN, volume = "3", number = "3", pages = "17:1--17:??", month = aug, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1267060.1267065", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:25 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Achieving energy efficiency to prolong the network lifetime is an important design criterion for wireless sensor networks. In this article, we propose a novel approach that exploits the broadcast nature of the wireless medium for energy conservation in spatially correlated wireless sensor networks. Since wireless transmission is inherently broadcast, when one sensor node transmits, other nodes in its coverage area can receive the transmitted data. When data collected by different sensors are correlated, each sensor can utilize the data it overhears from other sensors to compress its own data and conserve energy in its own transmissions. We apply this idea to a class of cluster-based wireless sensor networks in which each sensing node transmits collected data directly to its cluster head using time division multiple access (TDMA). We formulate the problem in which sensors in each cluster collaborate their transmitting, receiving, and compressing activities to optimize their lifetimes. We show that this lifetime optimization problem can be solved by a sequence of linear programming problems. We also propose a heuristic scheme which has low complexity and achieves near optimal performance. Important characteristics of wireless sensor networks such as node startup cost and packet loss due to transmission errors are also considered. Numerical results show that by exploiting the broadcast nature of the wireless medium, our control schemes achieve significant improvement in the sensors' lifetimes.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "broadcast communications; clustering; data compression; data gathering; lifetime optimization; sensor networks; spatial correlation", } @Article{Wan:2007:OTM, author = "Chieh-Yih Wan and Shane B. Eisenman and Andrew T. Campbell and Jon Crowcroft", title = "Overload traffic management for sensor networks", journal = j-TOSN, volume = "3", number = "4", pages = "18:1--18:??", month = oct, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1281492.1281493", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:34 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "There is a critical need for new thinking regarding overload traffic management in sensor networks. It has now become clear that experimental sensor networks (e.g., mote networks) and their applications commonly experience periods of persistent congestion and high packet loss, and in some cases even congestion collapse. This significantly impacts application fidelity measured at the physical sinks, even under light to moderate traffic loads, and is a direct product of the funneling effect; that is, the many-to-one multihop traffic pattern that characterizes sensor network communications. Existing congestion control schemes are effective at mitigating congestion through rate control and packet drop mechanisms, but do so at the cost of significantly reducing application fidelity measured at the sinks. To address this problem we propose to exploit the availability of a small number of all wireless, multiradio virtual sinks that can be randomly distributed or selectively placed across the sensor field. Virtual sinks are capable of siphoning off data events from regions of the sensor field that are beginning to show signs of high traffic load. In this paper, we present the design, implementation, and evaluation of Siphon, a set of fully distributed algorithms that support virtual sink discovery and selection, congestion detection, and traffic redirection in sensor networks. Siphon is based on a Stargate implementation of virtual sinks that uses a separate longer range radio network (based on IEEE 802.11) to siphon events to one or more physical sinks, and a short-range mote radio to interact with the sensor field at siphon points. Results from analysis, simulation and an experimental 48 Mica2 mote testbed show that virtual sinks can scale mote networks by effectively managing growing traffic demands while minimizing any negative impact on application fidelity. Additionally, we show the scheme is competitive with respect to energy consumption compared to a network composed of only motes.", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "simulations; system design; testbeds", } @Article{Tague:2007:CSA, author = "Patrick Tague and Radha Poovendran", title = "A canonical seed assignment model for key predistribution in wireless sensor networks", journal = j-TOSN, volume = "3", number = "4", pages = "19:1--19:??", month = oct, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1281492.1281494", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:34 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A promising solution for trust establishment in wireless sensor networks is the assignment of cryptographic seeds (keys, secrets, etc.) to sensor nodes prior to network deployment, known as key predistribution. In this article, we propose a canonical seed assignment model for key predistribution characterizing seed assignment in terms of the probability distribution describing the number of nodes receiving each seed and the algorithm for seed assignment. In addition, we present a sampling framework for seed assignment algorithms in the canonical model. We propose a probabilistic $k$-connectivity model for randomly deployed secure networks using spatial statistics and geometric random graph theory. We analyze key predistribution schemes in the canonical model in terms of network connectivity and resilience to node capture. The analytical results can be used to determine the average or worst-case connectivity or resilience to node capture for a key predistribution scheme. Furthermore, we demonstrate the design of new key predistribution schemes and the inclusion of existing schemes in the canonical model. Finally, we present a general approach to analyze the addition of nodes to an existing secure network and derive results for a well-known scheme.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "key establishment; key predistribution; network models; sensor networks", } @Article{Wang:2007:SPP, author = "Dan Wang and Qian Zhang and Jiangchuan Liu", title = "The self-protection problem in wireless sensor networks", journal = j-TOSN, volume = "3", number = "4", pages = "20:1--20:??", month = oct, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1281492.1281495", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:34 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks have recently been suggested for many surveillance applications, such as object monitoring, path protection, or area coverage. Since the sensors themselves are important and critical objects in the network, a natural question is whether they need certain level of protection, so as to resist the attacks targeting on them directly. If this is necessary, then who should provide this protection, and how it can be done?\par We refer to the above problem as self-protection, as we believe the sensors themselves are the best (and often the only) candidates to provide such protection. In this article, we for the first time present a formal study on the self-protection problems in wireless sensor networks. We show that, if we simply focus on enhancing the quality of field or object covering, the sensors might not necessarily be self-protected, which in turn makes the system extremely vulnerable. We then investigate different forms of self-protections, and show that the problems are generally NP-complete. We develop efficient approximation algorithms for centrally controlled sensors. We further extend the algorithms to fully distributed implementation, and introduce a smart sleep-scheduling algorithm that minimizes the energy consumption.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "coverage; protection; sensor networks", } @Article{Zheng:2007:LUB, author = "Yunhui Zheng and David J. Brady and Pankaj K. Agarwal", title = "Localization using boundary sensors: an analysis based on graph theory", journal = j-TOSN, volume = "3", number = "4", pages = "21:1--21:??", month = oct, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1281492.1281496", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:34 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider sensors, such as fibers, lasers, and pyroelectric motion detectors, that fire when objects cross a boundary. A moving object can be localized by analyzing sequences of boundary crossings. We consider the number of distinct sequences and object positions that can be achieved using boundary sensors in one- and two-dimensional spaces. For 1D systems we use representations of sensor sequences on graphs to derive limits on the number of object locations that can be monitored by a given sensor population and sequence length. For 2D systems we show that in certain circumstances the ratio of the number of unique sensor sequences to the number of unique object paths is exponential in the sequence length and we argue that the probability of unique identification is high for sufficiently large sequences. We also prove the triangle grid can track an object with error limited to a small neighborhood.", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "boundary sensor; deployment graph; deployment sequence; sensor sequence; sequence graph", } @Article{Kansal:2007:RMM, author = "Aman Kansal and William Kaiser and Gregory Pottie and Mani Srivastava and Gaurav Sukhatme", title = "Reconfiguration methods for mobile sensor networks", journal = j-TOSN, volume = "3", number = "4", pages = "22:1--22:??", month = oct, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1281492.1281497", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:34 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Motion may be used in sensor networks to change the network configuration for improving the sensing performance. We consider the problem of controlling motion in a distributed manner for a mobile sensor network for a specific form of motion capability. Mobility itself may have a high resource overhead, hence we exploit motility, a constrained form of mobility, which has very low overheads but provides significant reconfiguration potential. We present an architecture that allows each node in the network to learn the medium and phenomenon characteristics. We describe a quantitative metric for sensing performance that is concretely tied to real sensor and medium characteristics, rather than assuming an abstract range based model. The problem of determining the desirable network configuration is expressed as an optimization of this metric. We present a distributed optimization algorithm which computes a desirable network configuration, and adapts it to environmental changes. The relationship of the proposed algorithm to simulated annealing and incremental subgradient descent based methods is discussed. A key property of our algorithm is that convergence to a desirable configuration can be proved even though no global coordination is involved. A network protocol to implement this algorithm is discussed, followed by simulations and experiments on a laboratory test bed.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "actuation; coverage; mobile or actuator systems; mobility control; motion coordination; network protocols; spatial resolution", } @Article{Ning:2008:MAA, author = "Peng Ning and An Liu and Wenliang Du", title = "Mitigating {DoS} attacks against broadcast authentication in wireless sensor networks", journal = j-TOSN, volume = "4", number = "1", pages = "1:1--1:??", month = jan, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1325651.1325652", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:44 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Broadcast authentication is a critical security service in wireless sensor networks. There are two general approaches for broadcast authentication in wireless sensor networks: digital signatures and $\mu$TESLA-based techniques. However, both signature-based and $\mu$TESLA-based broadcast authentication are vulnerable to Denial of Services (DoS) attacks: An attacker can inject bogus broadcast packets to force sensor nodes to perform expensive signature verifications (in case of signature-based broadcast authentication) or packet forwarding (in case of $\mu$TESLA-based broadcast authentication), thus exhausting their limited battery power. This paper presents an efficient mechanism called message-specific puzzle to mitigate such DoS attacks. In addition to signature-based or $\mu$TESLA-based broadcast authentication, this approach adds a weak authenticator in each broadcast packet, which can be efficiently verified by a regular sensor node, but takes a computationally powerful attacker a substantial amount of time to forge. Upon receiving a broadcast packet, each sensor node first verifies the weak authenticator, and performs the expensive signature verification (in signature-based broadcast authentication) or packet forwarding (in $\mu$TESLA-based broadcast authentication) only when the weak authenticator is valid. A weak authenticator cannot be precomputed without a non-reusable (or short-lived) key disclosed only in a valid packet. Even if an attacker has intensive computational resources to forge one or more weak authenticators, it is difficult to reuse these forged weak authenticators. Thus, this weak authentication mechanism substantially increases the difficulty of launching successful DoS attacks against signature-based or $\mu$TESLA-based broadcast authentication. A limitation of this approach is that it requires a powerful sender and introduces sender-side delay. This article also reports an implementation of the proposed techniques on TinyOS, as well as initial experimental evaluation in a network of MICAz motes.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "broadcast authentication; DoS attacks; security; sensor networks", } @Article{Krasniewski:2008:EED, author = "Mark D. Krasniewski and Rajesh Krishna Panta and Saurabh Bagchi and Chin-Lung Yang and William J. Chappell", title = "Energy-efficient on-demand reprogramming of large-scale sensor networks", journal = j-TOSN, volume = "4", number = "1", pages = "2:1--2:??", month = jan, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1325651.1325653", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:44 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "As sensor networks operate over long periods of deployment in difficult to reach places, their requirements may change or new code may need to be uploaded to them. The current state-of-the-art protocols (Deluge and MNP) for network reprogramming perform the code dissemination in a multihop manner using a three-way handshake where metadata is exchanged prior to code exchange to suppress redundant transmissions. The code image is also pipelined through the network at the granularity of pages. In this article we propose a protocol called Freshet for optimizing the energy for code upload and speeding up the dissemination if multiple sources of code are available. The energy optimization is achieved by equipping each node with limited nonlocal topology information which it uses to determine the time when it can go to sleep since code is not being distributed in its vicinity. The protocol to handle multiple sources provides a loose coupling of nodes to a source and disseminates code in waves each originating at a source with a mechanism to handle collisions when the waves meet. The protocol's performance with respect to reliability, delay, and energy consumed is demonstrated through analysis, simulation, and implementation on the Berkeley mote platform.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Deluge; network reprogramming; sensor networks; three-way handshake; wireless communication", } @Article{Wang:2008:SLC, author = "Chen Wang and Li Xiao", title = "Sensor localization in concave environments", journal = j-TOSN, volume = "4", number = "1", pages = "3:1--3:??", month = jan, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1325651.1325654", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:44 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In sensor network localization, multihop based approaches have been proposed to approximate the shortest paths to Euclidean distances between pairwise sensors. A good approximation can be achieved when sensors are densely deployed in a convex area, where the shortest paths are close to straight lines connecting pairwise sensors. However, in a concave network, the shortest paths may deviate far away from straight lines, which leads to erroneous distance estimation and inaccurate localization results. To solve this problem, we propose an improved multihop algorithm that can recognize and filter out the erroneous distance estimation, and therefore achieve accurate localization results even in a concave network.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "concave; localization; multihop; sensor networks", } @Article{Gupta:2008:EGC, author = "Himanshu Gupta and Vishnu Navda and Samir Das and Vishal Chowdhary", title = "Efficient gathering of correlated data in sensor networks", journal = j-TOSN, volume = "4", number = "1", pages = "4:1--4:??", month = jan, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1325651.1325655", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:44 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we design techniques that exploit data correlations in sensor data to minimize communication costs (and hence, energy costs) incurred during data gathering in a sensor network. Our proposed approach is to select a small subset of sensor nodes that may be sufficient to reconstruct data for the entire sensor network. Then, during data gathering only the selected sensors need to be involved in communication. The selected set of sensors must also be connected, since they need to relay data to the data-gathering node. We define the problem of selecting such a set of sensors as the connected correlation-dominating set problem, and formulate it in terms of an appropriately defined correlation structure that captures general data correlations in a sensor network.\par We develop a set of energy-efficient distributed algorithms and competitive centralized heuristics to select a connected correlation-dominating set of small size. The designed distributed algorithms can be implemented in an asynchronous communication model, and can tolerate message losses. We also design an exponential (but nonexhaustive) centralized approximation algorithm that returns a solution within $O(\log n)$ of the optimal size. Based on the approximation algorithm, we design a class of centralized heuristics that are empirically shown to return near-optimal solutions. Simulation results over randomly generated sensor networks with both artificially and naturally generated data sets demonstrate the efficiency of the designed algorithms and the viability of our technique --- even in dynamic conditions.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "correlated data; energy efficiency; topology control", } @Article{Karenos:2008:CBC, author = "Kyriakos Karenos and Vana Kalogeraki and Srikanth V. Krishnamurthy", title = "Cluster-based congestion control for sensor networks", journal = j-TOSN, volume = "4", number = "1", pages = "5:1--5:??", month = jan, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1325651.1325656", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:44 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In wireless sensor networks, multiple flows from data collecting sensors to an aggregating sink could traverse paths that are largely interference coupled. These interference effects manifest themselves as congestion, and cause the flows to experience high packet loss and arbitrary packet delays. This is particularly problematic in event-based sensor networks (such as those in disaster recovery missions) where some flows are of greater importance than others and require a higher fidelity in terms of packet delivery and timeliness. In this paper we present COMUT (COngestion control for MUlti-class Traffic), a distributed cluster-based mechanism for supporting multiple classes of traffic in sensor networks. COMUT is based on the self-organization of the network into clusters, each of which autonomously and proactively monitors congestion within its localized scope. The clusters then exchange appropriate information to facilitate system wide rate control where, each data source, depending on the relative importance of its data flow and the experienced congestion en route the sink, is coerced into controlling its rate. Our simulation results demonstrate that (i) our techniques are highly effective in dealing with multiple, interfering flows and in achieving high delivery ratios and low delays compared to traditional approaches, (ii) operate successfully over multiple underlying routing protocols, (iii) provide higher throughput to higher importance flows, (iv) are responsive to failures and, finally, (v) achieve substantial energy savings due to the considerable reduction in packet drops via the effective regulation of the network load.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "clusters; rate control; real time; sensor networks", } @Article{Sengul:2008:APB, author = "Cigdem Sengul and Indranil Gupta and Matthew J. Miller", title = "Adaptive probability-based broadcast forwarding in energy-saving sensor networks", journal = j-TOSN, volume = "4", number = "2", pages = "6:1--6:??", month = mar, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1340771.1340772", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:53 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Networking protocols for multihop wireless sensor networks (WSNs) are required to simultaneously minimize resource usage as well as optimize performance metrics such as latency and reliability. This article explores the energy-latency-reliability tradeoff for broadcast in WSNs by presenting a new protocol called PBBF. Essentially, for a given reliability level, energy and latency are found to be inversely related and our study quantifies this relationship at the reliability boundary. Therefore, PBBF offers an application designer considerable flexibility in the choice of desired operation points. Furthermore, we propose an extension to dynamically adjust the PBBF parameters to minimize the input required from the designer.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "broadcast; probabilistic protocols; sensor network", } @Article{Nath:2008:SDR, author = "Suman Nath and Phillip B. Gibbons and Srinivasan Seshan and Zachary Anderson", title = "Synopsis diffusion for robust aggregation in sensor networks", journal = j-TOSN, volume = "4", number = "2", pages = "7:1--7:??", month = mar, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1340771.1340773", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:53 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Previous approaches for computing duplicate-sensitive aggregates in wireless sensor networks have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures, which are common in sensor networks. In this article, we present synopsis diffusion, a general framework for achieving significantly more accurate and reliable answers by combining energy-efficient multipath routing schemes with techniques that avoid double-counting. Synopsis diffusion avoids double-counting through the use of order- and duplicate-insensitive (ODI) synopses that compactly summarize intermediate results during in-network aggregation. We provide a surprisingly simple test that makes it easy to check the correctness of an ODI synopsis. We show that the properties of ODI synopses and synopsis diffusion create implicit acknowledgments of packet delivery. Such acknowledgments enable energy-efficient adaptation of message routes to dynamic message loss conditions, even in the presence of asymmetric links. Finally, we illustrate using extensive simulations the significant robustness, accuracy, and energy-efficiency improvements of synopsis diffusion over previous approaches.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "query processing; sensor networks; synopsis diffusion", } @Article{Sugihara:2008:PMS, author = "Ryo Sugihara and Rajesh K. Gupta", title = "Programming models for sensor networks: a survey", journal = j-TOSN, volume = "4", number = "2", pages = "8:1--8:??", month = mar, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1340771.1340774", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:53 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Sensor networks have a significant potential in diverse applications some of which are already beginning to be deployed in areas such as environmental monitoring. As the application logic becomes more complex, programming difficulties are becoming a barrier to adoption of these networks. The difficulty in programming sensor networks is not only due to their inherently distributed nature but also the need for mechanisms to address their harsh operating conditions such as unreliable communications, faulty nodes, and extremely constrained resources. Researchers have proposed different programming models to overcome these difficulties with the ultimate goal of making programming easy while making full use of available resources. In this article, we first explore the requirements for programming models for sensor networks. Then we present a taxonomy of the programming models, classified according to the level of abstractions they provide. We present an evaluation of various programming models for their responsiveness to the requirements. Our results point to promising efforts in the area and a discussion of the future directions of research in this area.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "programming models and languages; survey; taxonomy", } @Article{Chitnis:2008:AML, author = "Laukik Chitnis and Alin Dobra and Sanjay Ranka", title = "Aggregation methods for large-scale sensor networks", journal = j-TOSN, volume = "4", number = "2", pages = "9:1--9:??", month = mar, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1340771.1340775", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:53 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The ability to efficiently aggregate information --- for example compute the average temperature --- in large networks is crucial for the successful employment of sensor networks. This article addresses the problem of designing truly scalable protocols for computing aggregates in the presence of faults, protocols that can enable million node sensor networks to work efficiently. More precisely, we make four distinct contributions. First, we introduce a simple fault model and analyze the behavior of two existing protocols under the fault model: tree aggregation and gossip aggregation. Second, since the behavior of the two protocols depends on the size of the network and probability of failure, we introduce a hybrid approach that can leverage the strengths of the two protocols and minimize the weaknesses; the new protocol is analyzed under the same fault model. Third, we propose methodology for determining the optimal mix between the two basic protocols; the methodology consists in formulating an optimization problem, using models of the protocol behavior, and solving it. Fourth, we perform extensive experiments to evaluate the performance of the hybrid protocol and show that it usually performs better, sometimes orders of magnitude better, than both the tree and gossip aggregation.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "fault tolerance; in-network processing and aggregation; modeling faults; sensor fusion and distributed inference", } @Article{Shrivastava:2008:DCS, author = "Nisheeth Shrivastava and Subhash Suri and Csaba D. T{\'o}th", title = "Detecting cuts in sensor networks", journal = j-TOSN, volume = "4", number = "2", pages = "10:1--10:??", month = mar, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1340771.1340776", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:53 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We propose a low-overhead scheme for detecting a network partition or cut in a sensor network. Consider a network $S$ of $n$ sensors, modeled as points in a two-dimensional plane. An $\epsilon$-cut, for any $0 < \varepsilon < 1$, is a linear separation of $\varepsilon n$ nodes in $S$ from a distinguished node, the base station. Our main result is that, by monitoring the status of just $O(1/\epsilon)$ nodes in the network, the base station can detect whenever an $\epsilon$-cut occurs. Furthermore, this detection comes with a deterministic guarantee that every reported cut has size at least $\epsilon n / 2$. Besides this combinatorial result, we also propose efficient algorithms for finding the $O(1 / \epsilon)$ nodes that should act as sentinels, and report on our simulation results, comparing the sentinel algorithm with two natural schemes based on random sampling.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "computational geometry; distributed algorithms; network failure", } @Article{Liu:2008:GBK, author = "Donggang Liu and Peng Ning and Wenliang Du", title = "Group-based key predistribution for wireless sensor networks", journal = j-TOSN, volume = "4", number = "2", pages = "11:1--11:??", month = mar, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1340771.1340777", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:50:53 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Many key predistribution techniques have been developed recently to establish pairwise keys between sensor nodes in wireless sensor networks. To further improve these schemes, researchers have also proposed to take advantage of the sensors' expected locations and discovered locations to help the predistribution of the keying materials. However, in many cases, it is very difficult to deploy sensor nodes at their expected locations or guarantee the correct location discovery at sensor nodes in hostile environments. In this article, a group-based deployment model is developed to improve key predistribution. In this model, sensor nodes are only required to be deployed in groups. The critical observation in the article is that the sensor nodes in the same group are usually close to each other after deployment. This deployment model is practical; it greatly simplifies the deployment of sensor nodes, while still providing an opportunity to improve key predistribution. Specifically, the article presents a novel framework for improving key predistribution using the group-based deployment knowledge. This framework does not require the knowledge of the sensors' expected or discovered locations and is thus suitable for applications where it is difficult to deploy the sensor nodes at their expected locations or correctly estimate the sensors' locations after deployment. To seek practical key predistribution schemes, the article presents two efficient instantiations of this framework, a hash key-based scheme and a polynomial-based scheme. The evaluation shows that these two schemes are efficient and effective for pairwise key establishment in sensor networks; they can achieve much better performance than the previous key predistribution schemes when the sensor nodes are deployed in groups.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "group-based deployment; key predistribution; pairwise key establishment; security; sensor networks", } @Article{Zamalloa:2008:EGR, author = "Marco Z{\'u}{\~n}iga Zamalloa and Karim Seada and Bhaskar Krishnamachari and Ahmed Helmy", title = "Efficient geographic routing over lossy links in wireless sensor networks", journal = j-TOSN, volume = "4", number = "3", pages = "12:1--12:??", month = may, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1362542.1362543", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:51:03 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Recent experimental studies have shown that wireless links in real sensor networks can be extremely unreliable, deviating to a large extent from the idealized perfect-reception-within-range models used in common network simulation tools. Previously proposed geographic routing protocols commonly employ a maximum-distance greedy forwarding technique that works well in ideal conditions. However, such a forwarding technique performs poorly in realistic conditions as it tends to forward packets on lossy links. Based on a recently developed link loss model, we study the performance of a wide array of forwarding strategies, via analysis, extensive simulations and a set of experiments on motes. We find that the product of the packet reception rate and the distance improvement towards destination (PRR $\times d$) is a highly suitable metric for geographic forwarding in realistic environments.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "blacklisting; geographic routing; wireless sensor networks", } @Article{Jourdan:2008:OSP, author = "Damien B. Jourdan and Nicholas Roy", title = "Optimal sensor placement for agent localization", journal = j-TOSN, volume = "4", number = "3", pages = "13:1--13:??", month = may, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1362542.1362544", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:51:03 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article we consider deploying a sensor network to help an agent navigate in an area. In particular the agent uses range measurements to the sensors to localize itself. We wish to place the sensors in order to provide optimal localization accuracy to the agent. We begin by considering the problem of placing sensors in order to optimally localize the agent at a single location. The Position Error Bound (PEB), a lower bound on the localization accuracy, is used to measure the quality of sensor configurations. We then present RELOCATE, an iterative algorithm that places the sensors so as to minimize the PEB at that point. When the range measurements are unbiased and have constant variances, we introduce a coordinate transform that allows us to obtain a closed-form solution to minimizing the PEB along one coordinate. We also prove that RELOCATE converges to the global minimum, and we compute the approximate expected rate of convergence of the algorithm. We then apply RELOCATE to the more complex case where the variance of the range measurements depends on the sensors location and where those measurements can be biased. We finally apply RELOCATE to the case where the PEB must be minimized not at a single point, but at multiple locations, so that good localization accuracy is ensured as the agent moves through the area. We show that, compared to Simulated Annealing, the algorithm yields better results faster on these more realistic scenarios. We also show that by optimally placing the sensors, significant savings in terms of number of sensors used can be achieved. Finally we illustrate that the PEB is not only a convenient theoretical lower bound, but that it can actually be closely approximated by a maximum likelihood estimator.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "localization; sensor placement; target location; tracking; ultra-wideband (UWB)", } @Article{Wang:2008:PNC, author = "Dan Wang and Qian Zhang and Jiangchuan Liu", title = "Partial network coding: {Concept}, performance, and application for continuous data collection in sensor networks", journal = j-TOSN, volume = "4", number = "3", pages = "14:1--14:??", month = may, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1362542.1362545", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:51:03 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks have been widely used for surveillance in harsh environments. In many such applications, the environmental data are continuously sensed, and data collection by a server is only performed occasionally. Hence, the sensor nodes have to temporarily store the data, and provide easy and on-hand access for the most updated data when the server approaches. Given the expensive server-to-sensor communications, the large amount of sensors and the limited storage space at each tiny sensor, continuous data collection becomes a challenging problem.\par In this article, we present partial network coding (PNC) as a generic tool for these applications. PNC generalizes the existing network coding (NC) paradigm, an elegant solution for ubiquitous data distribution and collection. Yet PNC allows efficient storage replacement for continuous data, which is a deficiency of the conventional NC. We prove that the performance of PNC is quite close to NC, except for a sub-linear overhead on storage and communications. We then address a set of practical concerns toward PNC-based continuous data collection in sensor networks. Its feasibility and superiority are further demonstrated through simulation results.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "network coding; random linear coding; sensor networks", } @Article{Ganeriwal:2008:RBF, author = "Saurabh Ganeriwal and Laura K. Balzano and Mani B. Srivastava", title = "Reputation-based framework for high integrity sensor networks", journal = j-TOSN, volume = "4", number = "3", pages = "15:1--15:??", month = may, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1362542.1362546", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:51:03 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Sensor network technology promises a vast increase in automatic data collection capabilities through efficient deployment of tiny sensing devices. The technology will allow users to measure phenomena of interest at unprecedented spatial and temporal densities. However, as with almost every data-driven technology, the many benefits come with a significant challenge in data reliability. If wireless sensor networks are really going to provide data for the scientific community, citizen-driven activism, or organizations which test that companies are upholding environmental laws, then an important question arises: How can a user trust the accuracy of information provided by the sensor network? Data integrity is vulnerable to both node and system failures. In data collection systems, faults are indicators that sensor nodes are not providing useful information. In data fusion systems the consequences are more dire; the final outcome is easily affected by corrupted sensor measurements, and the problems are no longer visibly obvious.\par In this article, we investigate a generalized and unified approach for providing information about the data accuracy in sensor networks. Our approach is to allow the sensor nodes to develop a community of trust. We propose a framework where each sensor node maintains reputation metrics which both represent past behavior of other nodes and are used as an inherent aspect in predicting their future behavior. We employ a Bayesian formulation, specifically a beta reputation system, for the algorithm steps of reputation representation, updates, integration and trust evolution. This framework is available as a middleware service on motes and has been ported to two sensor network operating systems, TinyOS and SOS. We evaluate the efficacy of this framework using multiple contexts: (1) a lab-scale test bed of Mica2 motes, (2) Avrora simulations, and (3) real data sets collected from sensor network deployments in James Reserve.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Bayesian formulation; beta reputation system; reputation; sensor networks", } @Article{Crespi:2008:TTA, author = "Valentino Crespi and George Cybenko and Guofei Jiang", title = "The theory of trackability with applications to sensor networks", journal = j-TOSN, volume = "4", number = "3", pages = "16:1--16:??", month = may, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1362542.1362547", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:51:03 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we formalize the concept of tracking in a sensor network and develop a quantitative theory of trackability of weak models that investigates the rate of growth of the number of consistent tracks given a temporal sequence of observations made by the sensor network. The phenomenon being tracked is modelled by a nondeterministic finite automaton (a weak model) and the sensor network is modelled by an observer capable of detecting events related, typically ambiguously, to the states of the underlying automaton. Formally, an input string of symbols (the sensor network observations) that is presented to a nondeterministic finite automaton, M, (the weak model) determines a set of state sequences (the tracks or hypotheses) that are capable of generating the input string. We study the growth of the size of this candidate set of tracks as a function of the length of the input string. One key result is that for a given automaton and sensor coverage, the worst-case rate of growth is either polynomial or exponential in the number of observations, indicating a kind of phase transition in tracking accuracy. These results have applications to various tracking problems of recent interest involving tracking phenomena using noisy observations of hidden states such as: sensor networks, computer network security, autonomic computing and dynamic social network analysis.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "multiple hypotheses; sensor networks; tracking", } @Article{Jaggi:2008:NOA, author = "Neeraj Jaggi and Koushik Kar and Ananth Krishnamurthy", title = "Near-optimal activation policies in rechargeable sensor networks under spatial correlations", journal = j-TOSN, volume = "4", number = "3", pages = "17:1--17:??", month = may, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1362542.1362548", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 17:51:03 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We address the problem of optimal node activation in a sensor network, where the optimization objective is represented as a global time-average utility function over the deployment area of the network. Each sensor node is rechargeable, and can hold up to K quanta of energy. When the recharge and/or discharge processes in the network are random, the problem of optimal sensor activation is a complex stochastic decision question. For the case of identical sensor coverages, we show the existence of a simple threshold policy which is asymptotically optimal with respect to the energy bucket size K, that is, the performance of this threshold policy approaches the optimal performance as K becomes large. We also show that the performance of the optimal threshold policy is robust to the degree of spatial correlation in the discharge and/or recharge processes. We then extend this approach to a general sensor network where coverage areas of different sensors could have complete, partial or no overlap with each other. We demonstrate through simulations that a local information based threshold policy, with an appropriately chosen threshold, achieves a performance which is very close to the global optimum.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "coverage; energy-efficiency; rechargeable sensors; sensor activation; sensor networks; spatial correlations", } @Article{Xu:2008:DWS, author = "Wenyuan Xu and Wade Trappe and Yanyong Zhang", title = "Defending wireless sensor networks from radio interference through channel adaptation", journal = j-TOSN, volume = "4", number = "4", pages = "18:1--18:??", month = aug, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1387663.1387664", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Radio interference, whether intentional or otherwise, represents a serious threat to assuring the availability of sensor network services. As such, techniques that enhance the reliability of sensor communications in the presence of radio interference are critical. In this article, we propose to cope with this threat through a technique called channel surfing, whereby the sensor nodes in the network adapt their channel assignments to restore network connectivity in the presence of interference. We explore two different approaches to channel surfing: coordinated channel switching, in which the entire sensor network adjusts its channel; and spectral multiplexing, in which nodes in a jammed region switch channels and nodes on the boundary of a jammed region act as radio relays between different spectral zones. For coordinated channel switching, we examine an autonomous strategy where each node detects the loss of its neighbors in order to initiate channel switching. To cope with latency issues in the autonomous strategy, we propose a broadcast-assisted channel switching strategy to more rapidly coordinate channel switching. For spectral multiplexing, we have devised both synchronous and asynchronous strategies to facilitate the scheduling of nodes in order to improve network fidelity when sensor nodes operate on multiple channels. In designing these algorithms, we have taken a system-oriented approach that has focused on exploring actual implementation issues under realistic network settings. We have implemented these proposed methods on a testbed of 30 Mica2 sensor nodes, and the experimental results show that channel surfing, in its various forms, is an effective technique for repairing network connectivity in the presence of radio interference, while not introducing significant performance-overhead.", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Channel Surfing; Jamming; Radio Interference", } @Article{Yin:2008:ARU, author = "Jie Yin and Qiang Yang and Dou Shen and Ze-Nian Li", title = "Activity recognition via user-trace segmentation", journal = j-TOSN, volume = "4", number = "4", pages = "19:1--19:??", month = aug, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1387663.1387665", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A major issue of activity recognition in sensor networks is automatically recognizing a user's high-level goals accurately from low-level sensor data. Traditionally, solutions to this problem involve the use of a location-based sensor model that predicts the physical locations of a user from the sensor data. This sensor model is often trained offline, incurring a large amount of calibration effort. In this article, we address the problem using a goal-based segmentation approach, in which we automatically segment the low-level user traces that are obtained cheaply by collecting the signal sequences as a user moves in wireless environments. From the traces we discover primitive signal segments that can be used for building a probabilistic activity model to recognize goals directly. A major advantage of our algorithm is that it can reduce a significant amount of human effort in calibrating the sensor data while still achieving comparable recognition accuracy. We present our theoretical framework for activity recognition, and demonstrate the effectiveness of our new approach using the data collected in an indoor wireless environment.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Activity recognition; motion patterns; segmentation", } @Article{Chatterjea:2008:DSO, author = "Supriyo Chatterjea and Tim Nieberg and Nirvana Meratnia and Paul Havinga", title = "A distributed and self-organizing scheduling algorithm for energy-efficient data aggregation in wireless sensor networks", journal = j-TOSN, volume = "4", number = "4", pages = "20:1--20:??", month = aug, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1387663.1387666", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks (WSNs) are increasingly being used to monitor various parameters in a wide range of environmental monitoring applications. In many instances, environmental scientists are interested in collecting raw data using long-running queries injected into a WSN for analyzing at a later stage, rather than injecting snap-shot queries containing data-reducing operators (e.g., MIN, MAX, AVG) that aggregate data. Collection of raw data poses a challenge to WSNs as very large amounts of data need to be transported through the network. This not only leads to high levels of energy consumption and thus diminished network lifetime but also results in poor data quality as much of the data may be lost due to the limited bandwidth of present-day sensor nodes. We alleviate this problem by allowing certain nodes in the network to aggregate data by taking advantage of spatial and temporal correlations of various physical parameters and thus eliminating the transmission of redundant data. In this article we present a distributed scheduling algorithm that decides when a particular node should perform this novel type of aggregation. The scheduling algorithm autonomously reassigns schedules when changes in network topology, due to failing or newly added nodes, are detected. Such changes in topology are detected using cross-layer information from the underlying MAC layer. We first present the theoretical performance bounds of our algorithm. We then present simulation results, which indicate a reduction in message transmissions of up to 85\% and an increase in network lifetime of up to 92\% when compared to collecting raw data. Our algorithm is also capable of completely eliminating dropped messages caused by buffer overflow.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "cross-layer optimization; in-network data aggregation; scheduling; self-organizing; spatio-temporal correlation; Wireless sensor network", } @Article{Lai:2008:OBE, author = "Wei Lai and Ioannis C. Paschalidis", title = "Optimally balancing energy consumption versus latency in sensor network routing", journal = j-TOSN, volume = "4", number = "4", pages = "21:1--21:??", month = aug, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1387663.1387667", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider wireless sensor networks with nodes switching ON (awake) and OFF (sleeping) to preserve energy, and transmitting data over channels with varying quality. The objective is to determine the best path from each node to a single gateway. The performance metrics we are interested in are: the expected energy consumption, and the probability that the latency exceeds a certain threshold. Under Markovian assumptions on the sleeping schedules and the channel conditions, we obtain the expected energy consumption of transmitting a packet on any path to the gateway. We also provide an upper (Chernoff) bound and a tight large deviations asymptotic for the latency probability on each path. To capture the trade-off between energy consumption and latency probability, we formulate the problem of choosing a path to minimize a weighted sum of the expected energy consumption and the exponent of the latency probability. We provide two algorithms to solve this problem: a centralized stochastic global optimization algorithm, and a distributed algorithm based on simulated annealing. The proposed methodology can also optimize over the fraction of time that sensor nodes remain ON (duty cycle).", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "energy and resource management; latency; routing; Sensor networks; sleeping schedule", } @Article{Malan:2008:IPK, author = "David J. Malan and Matt Welsh and Michael D. Smith", title = "Implementing public-key infrastructure for sensor networks", journal = j-TOSN, volume = "4", number = "4", pages = "22:1--22:??", month = aug, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1387663.1387668", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present a critical evaluation of the first known implementation of elliptic curve cryptography over F$_{2 p}$ for sensor networks based on the 8-bit, 7.3828-MHz MICA2 mote. We offer, along the way, a primer for those interested in the field of cryptography for sensor networks. We discuss, in particular, the decisions underlying our design and alternatives thereto. And we elaborate on the methodologies underlying our evaluation.\par Through instrumentation of UC Berkeley's TinySec module, we argue that, although symmetric cryptography has been tractable in this domain for some time, there has remained a need, unfulfilled until recently, for an efficient, secure mechanism for distribution of secret keys among nodes. Although public-key infrastructure has been thought impractical, we show, through analysis of our original implementation for TinyOS of point multiplication on elliptic curves, that public-key infrastructure is indeed viable for TinySec keys' distribution, even on the MICA2. We demonstrate that public keys can be generated within 34 seconds and that shared secrets can be distributed among nodes in a sensor network within the same time, using just over 1 kilobyte of SRAM and 34 kilobytes of ROM. We demonstrate that communication costs are minimal, with only 2 packets required for transmission of a public key among nodes. We make available all of our source code for other researchers to download and use. And we discuss recent results based on our work that corroborate and improve upon our conclusions.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Diffie--Hellman; DLP; ECC; ECDLP; elliptic curve cryptography; MICA2; motes; sensor networks; TinyOS; TinySec", } @Article{Song:2008:LPP, author = "Hui Song and Sencun Zhu and Wensheng Zhang and Guohong Cao", title = "Least privilege and privilege deprivation: {Toward} tolerating mobile sink compromises in wireless sensor networks", journal = j-TOSN, volume = "4", number = "4", pages = "23:1--23:??", month = aug, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1387663.1387669", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Mobile sinks are needed in many sensor network applications for efficient data collection, data querying, localized sensor reprogramming, identifying, and revoking compromised sensors, and other network maintenance. Employing mobile sinks however raises a new security challenge: if a mobile sink is given too many privileges, it will become very attractive for attack and compromise. Using a compromised mobile sink, an adversary may easily bring down or even take over the sensor network. Thus, security mechanisms that can tolerate mobile sink compromises are essential. In this article, based on the {\em principle of least privilege}, we first propose an efficient scheme to restrict the privilege of a mobile sink without impeding its ability to carry out any authorized operations for an assigned task. In addition, we present an extension to allow conditional trajectory change due to unexpected events. To further reduce the possible damage caused by a compromised mobile sink, we propose efficient message forwarding schemes for deleting the privilege assigned to a compromised mobile sink immediately after its compromise has been detected. Through detailed analysis, simulation, and real implementation, we show that our schemes are secure and efficient, and are highly practical for sensor networks consisting of the current generation of sensors.", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "key management; key revocation; Least privilege; pairwise key; sensor networks", } @Article{Pattem:2008:ISC, author = "Sundeep Pattem and Bhaskar Krishnamachari and Ramesh Govindan", title = "The impact of spatial correlation on routing with compression in wireless sensor networks", journal = j-TOSN, volume = "4", number = "4", pages = "24:1--24:??", month = aug, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1387663.1387670", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The efficacy of data aggregation in sensor networks is a function of the degree of spatial correlation in the sensed phenomenon. The recent literature has examined a variety of schemes that achieve greater data aggregation by routing data with regard to the underlying spatial correlation. A well known conclusion from these papers is that the nature of optimal routing with compression depends on the correlation level. In this article we show the existence of a simple, practical, and static correlation-unaware clustering scheme that satisfies a min-max near-optimality condition. The implication for system design is that a static correlation-unaware scheme can perform as well as sophisticated adaptive schemes for joint routing and compression.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "analytical modeling; correlated data gathering; Sensor networks", } @Article{Edara:2008:ANP, author = "Pavan Edara and Ashwin Limaye and Krithi Ramamritham", title = "Asynchronous in-network prediction: {Efficient} aggregation in sensor networks", journal = j-TOSN, volume = "4", number = "4", pages = "25:1--25:??", month = aug, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1387663.1387671", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Given a sensor network and aggregate queries over the values sensed by subsets of nodes in the network, how do we ensure that high quality results are served for the maximum possible time? The issues underlying this question relate to the fidelity of query results and lifetime of the network. To maximize both, we propose a novel technique called {\em asynchronous in-network prediction\/} incorporating two computationally efficient methods for in-network prediction of partial aggregate values. These values are propagated via a tree whose construction is cognizant of (a) the coherency requirements associated with the queries, (b) the remaining energy at the sensors, and (c) the communication and message processing delays. Finally, we exploit {\em in-network filtering\/} and {\em in-network aggregation\/} to reduce the energy consumption of the nodes in the network. Experimental results over real world data support our claim that, for aggregate queries with associated coherency requirements, a prediction-based, asynchronous scheme provides higher quality results for a longer amount of time than a synchronous scheme. Also, whereas aggregate dissemination techniques proposed so far for sensor networks appear to have to trade-off quality of data for energy efficiency, we demonstrate that this is not always necessary.", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Aggregation; coherency; energy efficient; prediction; query processing", } @Article{Yap:2008:MWA, author = "Kok-Kiong Yap and Vikram Srinivasan and Mehul Motani", title = "{MAX}: {Wide} area human-centric search of the physical world", journal = j-TOSN, volume = "4", number = "4", pages = "26:1--26:??", month = aug, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1387663.1387672", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We propose MAX, a system that facilitates human-centric search of the physical world. Instead of organizing objects a priori, it allows humans to search for and locate them as needed. Designed for the following objectives: (i) human-centric operation, (ii) privacy, and (iii) efficient searching of any tagged object, MAX provides location information in a form natural to humans, that is, with reference to identifiable landmarks (such as, ``on the dining table'') rather than precise coordinates. In the system, all physical objects --- from documents to clothing --- can be tagged, users then locate objects using an intuitive search interface. To make searching efficient, MAX adopts a hierarchical architecture consisting of tags (bound to objects), substations (bound to landmarks), and base-stations (bound to localities). Tags can be marked as either public or private, with private tags searchable only by the owner. MAX also provides for privacy of physical spaces. It requires minimal initial configuration, and is robust to reconfiguration of the physical space. We also present a methodology to design energy-optimal and delay-optimal query protocols for a variety of device choices, this optimizes system performance, and affords insight into the appropriate actions for various scenarios. We have implemented a simple prototype of MAX, demonstrating the feasibility of the system for human-centric search over several locations across a wide area. We contend that a MAX-like search system will enable sharing (e.g., books on a college campus) and trading (e.g., buying and selling used books) of physical resources, and will be the engine for a host of new applications.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Human-centric; landmark-based localization; physical world; search", } @Article{Li:2009:CNL, author = "Li Li and Thomas Kunz", title = "Cooperative node localization using nonlinear data projection", journal = j-TOSN, volume = "5", number = "1", pages = "1:1--1:??", month = feb, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1464420.1464421", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:49 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Cooperative node localization schemes that employ nonlinear data reduction often deliver higher network node position accuracy compared to many other approaches. Other advantages of such algorithms are that they require only a minimum number of anchor nodes (if we require absolute locations) and that they can be applied under both range-based and range-free conditions. This article presents a novel cooperative node localization scheme, applying an efficient neural network nonlinear projection method called Curvilinear Component Analysis (CCA). A thorough comparative performance study of the proposed scheme in different mission-critical operational network scenarios is conducted. Compared with another leading cooperative node localization algorithm, MDS-MAP, which employs Multi-Dimensional Scaling (MDS), the proposed CCA-MAP approach significantly improves position estimate accuracy in many of the scenarios. We also propose a new local edge model for range-free distance matrix approximation that considerably enhances the performance for both MDS-MAP and CCA-MAP in certain irregular network configurations which are very challenging for node positioning.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "curvilinear component analysis; Localization; multi-dimensional scaling; nonlinear mapping; simulations", } @Article{Chen:2009:SRP, author = "Yingying Chen and Konstantinos Kleisouris and Xiaoyan Li and Wade Trappe and Richard P. Martin", title = "A security and robustness performance analysis of localization algorithms to signal strength attacks", journal = j-TOSN, volume = "5", number = "1", pages = "2:1--2:??", month = feb, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1464420.1464422", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:49 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Recently, it has been noted that localization algorithms that use signal strength are susceptible to noncryptographic attacks, which consequently threatens their viability for sensor applications. In this work, we examine several localization algorithms and evaluate their robustness to attacks where an adversary attenuates or amplifies the signal strength at one or more landmarks. We study both point-based and area-based methods that employ received signal strength for localization, and propose several performance metrics that quantify the estimator's precision, bias, and error, including H{\"o}lder metrics, which quantify the variability in position space for a given variability in signal strength space. We then conduct a trace-driven evaluation of a set of representative algorithms, where we measured their performance as we applied attacks on real data from two different buildings. We found the median error degraded gracefully, with a linear response as a function of the attack strength. We also found that area-based algorithms experienced a decrease and a spatial-shift in the returned area under attack, implying that precision increases though bias is introduced for these schemes. Additionally, we observed similar values for the average H{\"o}lder metric across most of the algorithms, thereby providing strong experimental evidence that nearly all the algorithms have similar average responses to signal strength attacks with the exception of the Bayesian Networks algorithm.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Localization; robustness; sensor networks; signal strength attacks; susceptibility", } @Article{Jung:2009:SNL, author = "Deokwoo Jung and Thiago Teixeira and Andreas Savvides", title = "Sensor node lifetime analysis: {Models} and tools", journal = j-TOSN, volume = "5", number = "1", pages = "3:1--3:??", month = feb, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1464420.1464423", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:49 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article presents two lifetime models that describe two of the most common modes of operation of sensor nodes today, trigger-driven and duty-cycle driven. The models use a set of hardware parameters such as power consumption per task, state transition overheads, and communication cost to compute a node's average lifetime for a given event arrival rate. Through comparison of the two models and a case study from a real camera sensor node design we show how the models can be applied to drive architectural decisions, compute energy budgets and duty-cycles, and to preform side-by-side comparison of different platforms. Based on our models we present a MATLAB Wireless Sensor Node Platform Lifetime Prediction and Simulation Package (MATSNL). This demonstrates the use of the models using sample applications drawn from existing sensor node measurements.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "duty cycle; event arrival rate; Node lifetime; schedule-driven node; semi-Markov Chain; trigger driven node", } @Article{Hu:2009:DEH, author = "Wen Hu and Nirupama Bulusu and Chun Tung Chou and Sanjay Jha and Andrew Taylor and Van Nghia Tran", title = "Design and evaluation of a hybrid sensor network for cane toad monitoring", journal = j-TOSN, volume = "5", number = "1", pages = "4:1--4:??", month = feb, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1464420.1464424", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:49 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article investigates a wireless acoustic sensor network application --- monitoring amphibian populations in the monsoonal woodlands of northern Australia. Our goal is to use automatic recognition of animal vocalizations to census the populations of native frogs and the invasive introduced species, the cane toad. This is a challenging application because it requires high frequency acoustic sampling, complex signal processing, wide area sensing coverage and long-lived unattended operation.\par We set up two prototypes of wireless sensor networks that recognize vocalizations of up to nine frog species found in northern Australia. Our first prototype consists of only resource-rich Stargate devices. Our second prototype is more complex and consists of a hybrid mixture of Stargates and inexpensive, resource-poor Mica2 devices operating in concert. In the hybrid system, the Mica2s are used to collect acoustic samples, and expand the sensor network coverage. The Stargates are used for resource-intensive tasks such as fast Fourier transforms (FFTs) and machine learning.\par The hybrid system incorporates four algorithms designed to account for the sampling, processing, energy, and communication bottlenecks of the Mica2s (1) high frequency sampling, (2) thresholding and noise reduction, to reduce data transmission by up to 90\%, (3) sampling scheduling, which exploits the sensor network redundancy to increase the effective sample processing rate, and (4) harvesting-aware energy management, which exploits sensor energy harvesting capabilities to extend the system lifetime.\par Our evaluation shows the performance of our systems over a range of scenarios, and demonstrate that the feasibility and benefits of a hybrid systems approach justify the additional system complexity.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "acoustic; application; high frequency sampling; hybrid; Sensor networks; solar energy", } @Article{Dietrich:2009:LWS, author = "Isabel Dietrich and Falko Dressler", title = "On the lifetime of wireless sensor networks", journal = j-TOSN, volume = "5", number = "1", pages = "5:1--5:??", month = feb, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1464420.1464425", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:49 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Network lifetime has become the key characteristic for evaluating sensor networks in an application-specific way. Especially the availability of nodes, the sensor coverage, and the connectivity have been included in discussions on network lifetime. Even quality of service measures can be reduced to lifetime considerations. A great number of algorithms and methods were proposed to increase the lifetime of a sensor network --- while their evaluations were always based on a particular definition of network lifetime. Motivated by the great differences in existing definitions of sensor network lifetime that are used in relevant publications, we reviewed the state of the art in lifetime definitions, their differences, advantages, and limitations. This survey was the starting point for our work towards a generic definition of sensor network lifetime for use in analytic evaluations as well as in simulation models --- focusing on a formal and concise definition of accumulated network lifetime and total network lifetime. Our definition incorporates the components of existing lifetime definitions, and introduces some additional measures. One new concept is the ability to express the service disruption tolerance of a network. Another new concept is the notion of time-integration: in many cases, it is sufficient if a requirement is fulfilled over a certain period of time, instead of at every point in time. In addition, we combine coverage and connectivity to form a single requirement called connected coverage. We show that connected coverage is different from requiring noncombined coverage and connectivity. Finally, our definition also supports the concept of graceful degradation by providing means of estimating the degree of compliance with the application requirements. We demonstrate the applicability of our definition based on the surveyed lifetime definitions as well as using some example scenarios to explain the various aspects influencing sensor network lifetime.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "connectivity; coverage; lifetime; longevity; Sensor networks", } @Article{Law:2009:EEL, author = "Yee Wei Law and Marimuthu Palaniswami and Lodewijk {Van Hoesel} and Jeroen Doumen and Pieter Hartel and Paul Havinga", title = "Energy-efficient link-layer jamming attacks against wireless sensor network {MAC} protocols", journal = j-TOSN, volume = "5", number = "1", pages = "6:1--6:??", month = feb, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1464420.1464426", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:49 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A typical wireless sensor node has little protection against radio jamming. The situation becomes worse if energy-efficient jamming can be achieved by exploiting knowledge of the data link layer. Encrypting the packets may help to prevent the jammer from taking actions based on the content of the packets, but the temporal arrangement of the packets induced by the nature of the protocol might unravel patterns that the jammer can take advantage of, even when the packets are encrypted.\par By looking at the packet interarrival times in three representative MAC protocols, S-MAC, LMAC, and B-MAC, we derive several jamming attacks that allow the jammer to jam S-MAC, LMAC, and B-MAC energy efficiently. The jamming attacks are based on realistic assumptions. The algorithms are described in detail and simulated. The effectiveness and efficiency of the attacks are examined. In addition, we validate our simulation model by comparing its results with measurements obtained from actual implementation on our sensor node prototypes. We show that it takes little effort to implement such effective jammers, making them a realistic threat.\par Careful analysis of other protocols belonging to the respective categories of S-MAC, LMAC, and B-MAC reveals that those protocols are, to some extent, also susceptible to our attacks. The result of this investigation provides new insights into the security considerations of MAC protocols.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "clustering; denial-of-service attacks; expectation maximization; jamming; MAC protocols", } @Article{Bruck:2009:LRS, author = "Jehoshua Bruck and Jie Gao and Anxiao (Andrew) Jiang", title = "Localization and routing in sensor networks by local angle information", journal = j-TOSN, volume = "5", number = "1", pages = "7:1--7:??", month = feb, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1464420.1464427", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:49 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Location information is useful both for network organization and for sensor data integrity. In this article, we study the anchor-free 2D localization problem by using local angle measurements. We prove that given a unit disk graph and the angles between adjacent edges, it is NP-hard to find a valid embedding in the plane such that neighboring nodes are within distance 1 from each other and non-neighboring nodes are at least distance $\sqrt 2 / 2$ away. Despite the negative results, however, we can find a planar spanner of a unit disk graph by using only local angles. The planar spanner can be used to generate a set of virtual coordinates that enable efficient and local routing schemes such as geographical routing or approximate shortest path routing. We also proposed a practical anchor-free embedding scheme by solving a linear program. We show by simulation that it gives both a good local embedding, with neighboring nodes embedded close and non-neighboring nodes far away, and a satisfactory global view such that geographical routing and approximate shortest path routing on the embedded graph are almost identical to those on the original (true) embedding.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "embedding; geographical routing; localization; planar spanner subgraph; Sensor networks; wireless networks", } @Article{Zhou:2009:VRC, author = "Zongheng Zhou and Samir R. Das and Himanshu Gupta", title = "Variable radii connected sensor cover in sensor networks", journal = j-TOSN, volume = "5", number = "1", pages = "8:1--8:??", month = feb, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1464420.1464428", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:49 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "One of the useful approaches to exploit redundancy in a sensor network is to keep active only a small subset of sensors that are sufficient to cover the region required to be monitored. The set of active sensors should also form a connected communication graph, so that they can autonomously respond to application queries and/or tasks. Such a set of active sensors is known as a connected sensor cover, and the problem of selecting a minimum connected sensor cover has been well studied when the transmission radius and sensing radius of each sensor is fixed. In this article, we address the problem of selecting a minimum energy-cost connected sensor cover, when each sensor node can vary its sensing and transmission radius; larger sensing or transmission radius entails higher energy cost.\par For the aforesaid problem, we design various centralized and distributed algorithms, and compare their performance through extensive experiments. One of the designed centralized algorithms (called CGA) is shown to perform within an $O(\log n)$ factor of the optimal solution, where $n$ is the size of the network. We have also designed a localized algorithm based on Voronoi diagrams which is empirically shown to perform very close to CGA and, due to its communication-efficiency, results in significantly prolonging the network lifetime. We also extend the aforementioned algorithms to incorporate fault tolerance. In particular, we show how to extend the algorithms to address the minimum energy-cost connected sensor $k$-cover problem, in which every point in the query region needs to be covered by at least $k$ distinct active sensors. The CGA preserves the approximation bound in this case. We also propose a localized topology control scheme to preserve $k$-connectivity, and use it to extend the Voronoi-based approach to computing a minimum energy-cost $k_1$-connected $k_2$-cover. We study the performance of our proposed algorithms through extensive simulations.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "connectivity; coverage; energy conservation; sensor networks; Topology control", } @Article{Vicaire:2009:ALT, author = "Pascal Vicaire and Tian He and Qing Cao and Ting Yan and Gang Zhou and Lin Gu and Liqian Luo and Radu Stoleru and John A. Stankovic and Tarek F. Abdelzaher", title = "Achieving long-term surveillance in {VigilNet}", journal = j-TOSN, volume = "5", number = "1", pages = "9:1--9:??", month = feb, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1464420.1464429", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:22:49 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Energy efficiency is a fundamental issue for outdoor sensor network systems. This article presents the design and implementation of multidimensional power management strategies in VigilNet, a major recent effort to support long-term surveillance using power-constrained sensor devices. A novel tripwire service is integrated with an effective sentry and duty cycle scheduling in order to increase the system lifetime, collaboratively. The tripwire service partitions a network into distinct, nonoverlapping sections and allows each section to be scheduled independently. Sentry scheduling selects a subset of nodes, the sentries, which are turned on while the remaining nodes save energy. Duty cycle scheduling allows the active sentries themselves to be turned on and off, further lowering the average power draw. The multidimensional power management strategies proposed in this article were fully implemented within a real sensor network system using the XSM platform. We evaluate key system parameters using a network of 200 XSM nodes in an outdoor environment, and an analytical probabilistic model. We evaluate network lifetime using a simulation of a 10,000-node network that uses measured XSM power values. These evaluations demonstrate the effectiveness of our integrated approach and identify a set of lessons and guidelines, useful for the future development of energy-efficient sensor systems. One of the key results indicates that the combination of the three presented power management techniques is able to increase the lifetime of a realistic network from 4 days to 200 days.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "and longevity; Applications of sensor and actuator networks; connectivity; coverage; energy and resource management; energy conservation; network protocols; sensor networks; tracking", } @Article{Li:2009:UCM, author = "Mo Li and Yunhao Liu", title = "Underground coal mine monitoring with wireless sensor networks", journal = j-TOSN, volume = "5", number = "2", pages = "10:1--10:??", month = mar, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1498915.1498916", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:16 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Environment monitoring in coal mines is an important application of wireless sensor networks (WSNs) that has commercial potential. We discuss the design of a Structure-Aware Self-Adaptive WSN system, SASA. By regulating the mesh sensor network deployment and formulating a collaborative mechanism based on a regular beacon strategy, SASA is able to rapidly detect structure variations caused by underground collapses. We further develop a sound and robust mechanism for efficiently handling queries under instable circumstances. A prototype is deployed with 27 mica2 motes in a real coal mine. We present our implementation experiences as well as the experimental results. To better evaluate the scalability and reliability of SASA, we also conduct a large-scale trace-driven simulation based on real data collected from the experiments.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "coal mine; structure monitoring; underground; Wireless sensor networks", } @Article{Lim:2009:DLA, author = "Hyuk Lim and Jennifer C. Hou", title = "Distributed localization for anisotropic sensor networks", journal = j-TOSN, volume = "5", number = "2", pages = "11:1--11:??", month = mar, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1498915.1498917", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:16 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we address the issue of localization in anisotropic sensor networks. Anisotropic networks differ from isotropic networks in that they possess properties that vary according to the direction of measurement. Anisotropic characteristics result from various factors such as the geographic shape of the region (nonconvex region), different node densities, irregular radio patterns, and anisotropic terrain conditions. In order to characterize anisotropic features, we devise a linear mapping method that projects one embedding space built upon proximity measures into geographic distance space by using the truncated singular value decomposition (SVD) pseudo-inverse technique. This transformation retains as much topological information as possible and reduces the effect of measurement noise on the estimates of geographic distances. We show via simulation that the proposed localization method outperforms DV-hop, DV-distance, and MDS-MAP, and makes robust and accurate estimates of sensor locations in both isotropic and anisotropic sensor networks.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Localization; sensor networks; singular value decomposition", } @Article{Zhu:2009:SSF, author = "Xianjin Zhu and Rik Sarkar and Jie Gao", title = "Segmenting a sensor field: {Algorithms} and applications in network design", journal = j-TOSN, volume = "5", number = "2", pages = "12:1--12:??", month = mar, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1498915.1498918", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:16 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The diversity of the deployment settings of sensor networks is naturally inherited from the diversity of geographical features of the embedded environment, and greatly influences network design. Many sensor network protocols in the literature implicitly assume that sensor nodes are deployed inside a simple geometric region, without considering possible obstacles and holes in the deployment environment. When the real deployment setting deviates from that, we often observe degraded performance. Thus, it is highly desirable to have a generic approach to handle sensor fields with complex shapes. In this article, we propose a segmentation algorithm that partitions an irregular sensor field into nicely shaped pieces such that algorithms and protocols that assume a nice sensor field can be applied inside each piece. Across the segments, problem dependent structures specify how the segments and data collected in these segments are integrated. Our segmentation algorithm does not require any extra knowledge (e.g., sensor locations) and only uses network connectivity information. This unified spatial-partitioning approach makes the protocol design become flexible and independent of deployment specifics. Existing protocols are still reusable with segmentation, and the development of new topology-adaptive protocols becomes much easier. We verified the correctness of the algorithm on various topologies and evaluated the performance improvements by integrating shape segmentation with several fundamental problems in network design.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "flow complex; network design; sensor networks; Shape segmentation; topology-adaptive protocols", } @Article{Manulis:2009:SMF, author = "Mark Manulis and J{\"o}rg Schwenk", title = "Security model and framework for information aggregation in sensor networks", journal = j-TOSN, volume = "5", number = "2", pages = "13:1--13:??", month = mar, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1498915.1498919", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:16 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Information aggregation is an important operation in wireless sensor networks (WSNs) executed for the purpose of monitoring and reporting environmental data. Due to the performance constraints of sensor nodes the in-network form of the aggregation is especially attractive since it allows saving expensive resources during frequent network queries. Easy accessibility of networks and nodes and almost no physical protection against corruptions raise high security challenges. Protection against attacks aiming to falsify the aggregated result is considered to be of prime importance.\par In this article we design the first general framework for secure information aggregation in WSNs focusing on scenarios where aggregation is performed by one of its nodes. The framework achieves security against node corruptions and is based solely on the symmetric cryptographic primitives that are more suitable for WSNs in terms of efficiency. We analyze performance of the framework and unlike many previous approaches increase confidence in it by a rigorous proof of security within the specially designed {\em formal security model.\/}", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Aggregation; framework; in-network processing; provable security; wireless sensor network", } @Article{Huang:2009:SSF, author = "Pei Huang and Hongyang Chen and Guoliang Xing and Yongdong Tan", title = "{SGF}: a state-free gradient-based forwarding protocol for wireless sensor networks", journal = j-TOSN, volume = "5", number = "2", pages = "14:1--14:??", month = mar, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1498915.1498920", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:16 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Limitation on available resources is a major challenge in wireless sensor networks. Due to high rates of unexpected node/link failures, robust data delivery through multiple hops also becomes a critical issue. In this article we present a state-free gradient-based forwarding (SGF) protocol to address these challenges. Nodes running SGF do not maintain states of neighbors or network topology and thus can scale to very large networks. Without using routing tables, SGF builds a cost field called {\em gradient\/} that provides each node the direction to forward data. The maintenance of gradient is purely driven by data transmissions and hence incurs little overhead. To adapt to transient channel variations and topology changes, the forwarder of a routing node is selected opportunistically among multiple candidate nodes through a distributed contention process. Simulation results show that SGF achieves significant energy savings and outperforms several existing data forwarding protocols in terms of packet delivery ratio and end-to-end delay.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "energy conservation; gradient; power control; robust performance; Sensor networks; state-free", } @Article{Kulathumani:2009:TDS, author = "Vinodkrishnan Kulathumani and Anish Arora and Mukundan Sridharan and Murat Demirbas", title = "{Trail}: a distance-sensitive sensor network service for distributed object tracking", journal = j-TOSN, volume = "5", number = "2", pages = "15:1--15:??", month = mar, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1498915.1498921", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:16 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Distributed observation and control of mobile objects via static wireless sensors demands timely information in a {\em distance-sensitive\/} manner: Information about closer objects is required more often and more quickly than that of farther objects. In this article, we present a wireless sensor network protocol, Trail, that supports distance-sensitive tracking of mobile objects for in-network subscribers upon demand. Trail achieves a find time that is linear in the distance from a subscriber to an object, via a distributed data structure that is updated only locally when the object moves. Notably, Trail does not partition the network into a hierarchy of clusters and clusterheads, and as a result Trail has lower maintenance costs, is more locally fault tolerant, and it better utilizes the network in terms of load balancing and minimizing the size of the data structure needed for tracking. Moreover, Trail is reliable and energy efficient, despite the network dynamics that are typical of wireless sensor networks. Trail can be refined by tuning certain parameters, thereby yielding a family of protocols that are suited for different application settings such as rate of queries, rate of updates, and network size. We evaluate the performance of Trail by analysis, simulations in a $90 \times 90$ sensor network, and experiments on 105 Mica2 nodes in the context of a pursuer-evader control application.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "applications of sensor actuator networks; data storage and query; Distributed tracking; energy efficiency; fault tolerance; network protocol; scalability", } @Article{Kulkarni:2009:EEM, author = "Sandeep Kulkarni and Limin Wang", title = "Energy-efficient multihop reprogramming for sensor networks", journal = j-TOSN, volume = "5", number = "2", pages = "16:1--16:??", month = mar, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1498915.1498922", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:16 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Reprogramming of sensor networks is an important and challenging problem, as it is often necessary to reprogram the sensors in place. In this article, we propose MNP, a multihop reprogramming service designed for sensor networks. One of the problems in reprogramming is the issue of message collision. To reduce the problem of collision, we propose a sender selection algorithm that attempts to guarantee that in a given neighborhood there is at most one source transmitting the program at a time. Furthermore, our sender selection is greedy in that it tries to select the sender that is expected to have the most impact. We use pipelining to enable fast data propagation. MNP is energy efficient because it reduces the active radio time of a sensor node by putting the node into ``sleep'' state when its neighbors are transmitting a segment that is not of interest. We call this type of sleep contention sleep. To further reduce the energy consumption, we add noreq sleep, where sensor node goes to sleep if none of its neighbors is interested in receiving the segment it is advertising. We also introduce an optional init sleep to reduce the energy consumption in the initial phase of reprogramming. Finally, we investigate the performance of MNP in different network settings.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "energy efficiency; network reprogramming; Sensor networks", } @Article{Manohar:2009:PCS, author = "Pallavi Manohar and S. Sundhar Ram and D. Manjunath", title = "Path coverage by a sensor field: {The} nonhomogeneous case", journal = j-TOSN, volume = "5", number = "2", pages = "17:1--17:??", month = mar, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1498915.1498923", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:16 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We analyze the statistical properties of the coverage of a one-dimensional path induced by a two-dimensional nonhomogeneous random sensor network. Sensor locations form a nonhomogeneous Poisson process and sensing area for the sensors are circles of random independent and identically distributed radii. We first characterize the coverage of a straight-line path by the nonhomogeneous one-dimensional Boolean model. We then obtain an equivalent $M_t / G_t / \infty$, queue whose busy period statistics is the same as the coverage statistics of the line. We obtain $k$-coverage statistics for an arbitrary point and a segment on the $x$-axis. We provide upper and lower bounds on the probability of complete $k$-coverage of a segment. We illustrate all our results for the case of the sensor deployment having a ``Laplacian'' intensity function.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Analysis; k -coverage of paths; nonhomogeneous queues; nonhomogeneous sensor deployment; sensor network", } @Article{Lazos:2009:AET, author = "Loukas Lazos and Radha Poovendran and James A. Ritcey", title = "Analytic evaluation of target detection in heterogeneous wireless sensor networks", journal = j-TOSN, volume = "5", number = "2", pages = "18:1--18:??", month = mar, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1498915.1498924", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:16 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we address the problem of target detection in Wireless Sensor Networks (WSNs). We formulate the target detection problem as a line-set intersection problem and use integral geometry to analytically characterize the probability of target detection for both stochastic and deterministic deployments. Compared to previous work, we analyze WSNs where sensors have heterogeneous sensing capabilities. For the stochastic case, we evaluate the probability that the target is detected by at least $k$ sensors and compute the free path until the target is first detected. For the deterministic case, we show an analogy between the target detection problem and the problem of minimizing the average symbol error probability in 2D digital modulation schemes. Motivated by this analogy, we propose a heuristic sensor placement algorithm, called DATE, that makes use of well-known signal constellations for determining good WSN constellations. We also propose a heuristic called CDATE for connected WSN constellations, that yields high target detection probability.", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "heterogeneous; Target detection; wireless sensor networks", } @Article{Kho:2009:DCA, author = "Johnsen Kho and Alex Rogers and Nicholas R. Jennings", title = "Decentralized control of adaptive sampling in wireless sensor networks", journal = j-TOSN, volume = "5", number = "3", pages = "19:1--19:??", month = may, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1525856.1525857", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:43 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The efficient allocation of the limited energy resources of a wireless sensor network in a way that maximizes the information value of the data collected is a significant research challenge. Within this context, this article concentrates on adaptive sampling as a means of focusing a sensor's energy consumption on obtaining the most important data. Specifically, we develop a principled information metric based upon Fisher information and Gaussian process regression that allows the information content of a sensor's observations to be expressed. We then use this metric to derive three novel decentralized control algorithms for information-based adaptive sampling which represent a trade-off in computational cost and optimality. These algorithms are evaluated in the context of a deployed sensor network in the domain of flood monitoring. The most computationally efficient of the three is shown to increase the value of information gathered by approximately 83\%, 27\%, and 8\% per day compared to benchmarks that sample in a na{\"\i}ve nonadaptive manner, in a uniform nonadaptive manner, and using a state-of-the-art adaptive sampling heuristic (USAC) correspondingly. Moreover, our algorithm collects information whose total value is approximately 75\% of the optimal solution (which requires an exponential, and thus impractical, amount of time to compute).", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Adaptive sampling algorithm; decentralized decision mechanism; Gaussian process regression; information metric", } @Article{Castelluccia:2009:EPS, author = "Claude Castelluccia and Aldar C-F. Chan and Einar Mykletun and Gene Tsudik", title = "Efficient and provably secure aggregation of encrypted data in wireless sensor networks", journal = j-TOSN, volume = "5", number = "3", pages = "20:1--20:??", month = may, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1525856.1525858", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:43 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks (WSNs) are composed of tiny devices with limited computation and battery capacities. For such resource-constrained devices, data transmission is a very energy-consuming operation. To maximize WSN lifetime, it is essential to minimize the number of bits sent and received by each device. One natural approach is to aggregate sensor data along the path from sensors to the sink. Aggregation is especially challenging if end-to-end privacy between sensors and the sink (or aggregate integrity) is required. In this article, we propose a simple and provably secure encryption scheme that allows efficient additive aggregation of encrypted data. Only one modular addition is necessary for ciphertext aggregation. The security of the scheme is based on the indistinguishability property of a pseudorandom function (PRF), a standard cryptographic primitive. We show that aggregation based on this scheme can be used to efficiently compute statistical values, such as mean, variance, and standard deviation of sensed data, while achieving significant bandwidth savings. To protect the integrity of the aggregated data, we construct an end-to-end aggregate authentication scheme that is secure against outsider-only attacks, also based on the indistinguishability property of PRFs.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Authentication; cryptography; privacy; pseudorandom functions; secure data aggregation; stream ciphers; wireless sensor networks", } @Article{Cevher:2009:ASN, author = "Volkan Cevher and Lance M. Kaplan", title = "Acoustic sensor network design for position estimation", journal = j-TOSN, volume = "5", number = "3", pages = "21:1--21:??", month = may, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1525856.1525859", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:43 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we develop tractable mathematical models and approximate solution algorithms for a class of integer optimization problems with probabilistic and deterministic constraints, with applications to the design of distributed sensor networks that have limited connectivity. For a given deployment region size, we calculate the Pareto frontier of the sensor network utility at the desired probabilities for $d$-connectivity and $k$-coverage. As a result of our analysis, we determine (1) the number of sensors of different types to deploy from a sensor pool, which offers a cost vs. performance trade-off for each type of sensor, (2) the minimum required radio transmission ranges of the sensors to ensure connectivity, and (3) the lifetime of the sensor network. For generality, we consider randomly deployed sensor networks and formulate constrained optimization technique to obtain the localization performance. The approach is guided and validated using an unattended acoustic sensor network design. Finally, approximations of the complete statistical characterization of the acoustic sensor networks are given, which enable average network performance predictions of any combination of acoustic sensors.", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Bayesian experimental design; dynamic programming; sensor networks", } @Article{Luo:2009:DIE, author = "Liqian Luo and Qing Cao and Chengdu Huang and Lili Wang and Tarek F. Abdelzaher and John A. Stankovic and Michael Ward", title = "Design, implementation, and evaluation of {EnviroMic}: a storage-centric audio sensor network", journal = j-TOSN, volume = "5", number = "3", pages = "22:1--22:??", month = may, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1525856.1525860", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:43 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article presents the design, implementation, and evaluation of {\em EnviroMic}, a low-cost experimental prototype of a novel distributed acoustic monitoring, storage, and trace retrieval system designed for disconnected operation. Our intended use of acoustic monitoring is to study animal populations in the wild. Since a permanent connection to the outside world is not assumed and due to the relatively large size of audio traces, the system must optimally exploit available resources such as energy and network storage capacity. Towards that end, we design, prototype, and evaluate distributed algorithms for coordinating acoustic recording tasks, reducing redundancy of data stored by nearby sensors, filtering out silence, and balancing storage utilization in the network. For experimentation purposes, we implement EnviroMic on a TinyOS-based platform and systematically evaluate its performance through both indoor testbed experiments and an outdoor deployment. Results demonstrate up to a four-fold improvement in effective storage capacity of the network compared to uncoordinated recording.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "acoustics; applications; distributed storage; group management; Sensor networks", } @Article{De:2009:DAM, author = "Pradip De and Yonghe Liu and Sajal K. Das", title = "Deployment-aware modeling of node compromise spread in wireless sensor networks using epidemic theory", journal = j-TOSN, volume = "5", number = "3", pages = "23:1--23:??", month = may, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1525856.1525861", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:43 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Motivated by recently surfacing viruses that can spread over the air interfaces, in this article, we investigate the potentially disastrous threat of node compromise spreading in wireless sensor networks. We assume such a compromise originating from a single infected node, can propagate to other sensor nodes via communication and pre-established mutual trust. We focus on the possible epidemic breakout of such propagations where the whole network may fall victim to the attack. Using epidemic theory, we model and analyze this spreading process and identify key factors determining potential outbreaks. In particular, we perform our study on random graphs precisely constructed according to the parameters of the network, such as distance, key sharing constrained communication and node recovery, thereby reflecting the true characteristics therein. Moreover, a comparative study of the epidemic propagation is performed based on the effects of two types of sensor deployment strategies, viz., uniform random and group-based deployment. The analytical results provide deep insights in designing potential defense strategies against this threat. Furthermore, through extensive simulations, we validate the model and perform investigations on the system dynamics. Our analysis and simulation results indicate that the uniform random deployment is more vulnerable to an epidemic outbreak than the group based deployment strategy.", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "epidemic theory; group-based deployment; random graph; Random key predistribution; sensor networks", } @Article{Maierbacher:2009:LCC, author = "Gerhard Maierbacher and Jo{\~a}o Barros", title = "Low-complexity coding and source-optimized clustering for large-scale sensor networks", journal = j-TOSN, volume = "5", number = "3", pages = "24:1--24:??", month = may, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1525856.1525862", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:43 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider the distributed source coding problem in which correlated data picked up by scattered sensors has to be encoded separately and transmitted to a common receiver, subject to a rate-distortion constraint. Although near-to-optimal solutions based on Turbo and LDPC codes exist for this problem, in most cases the proposed techniques do not scale to networks of hundreds of sensors. We present a scalable solution based on the following key elements: (a) distortion-optimized index assignments for low-complexity distributed quantization, (b) source-optimized hierarchical clustering based on the Kullback--Leibler distance and (c) sum-product decoding on specific factor graphs exploiting the correlation of the data.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Distributed source coding; hierarchical clustering; quantizer design; source and correlation models", } @Article{Ni:2009:SND, author = "Kevin Ni and Nithya Ramanathan and Mohamed Nabil Hajj Chehade and Laura Balzano and Sheela Nair and Sadaf Zahedi and Eddie Kohler and Greg Pottie and Mark Hansen and Mani Srivastava", title = "Sensor network data fault types", journal = j-TOSN, volume = "5", number = "3", pages = "25:1--25:??", month = may, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1525856.1525863", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:43 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This tutorial presents a detailed study of sensor faults that occur in deployed sensor networks and a systematic approach to model these faults. We begin by reviewing the fault detection literature for sensor networks. We draw from current literature, our own experience, and data collected from scientific deployments to develop a set of commonly used features useful in detecting and diagnosing sensor faults. We use this feature set to systematically define commonly observed faults, and provide examples of each of these faults from sensor data collected at recent deployments.", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Data integrity; fault; sensor network", } @Article{Wettergren:2009:OPD, author = "Thomas A. Wettergren and Russell Costa", title = "Optimal placement of distributed sensors against moving targets", journal = j-TOSN, volume = "5", number = "3", pages = "26:1--26:??", month = may, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1525856.1525864", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:43 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article addresses the problem of deploying a sparse network of sensors for surveillance of moving targets. The sensor networks of interest consist of sensors which perform independent binary detection on a target, and report detections to a central node for fusion. An optimization framework is developed for placement of sensors within a bounded search region, given sensor performance characteristics, prior information on anticipated target characteristics, and a distributed detection criteria. Individual sensor performance is represented parametrically as are priors on target dynamics. Several numerical examples are included that illustrate the utility of the optimization approach.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "coverage; optimization; Sensor networks", } @Article{Rajamani:2009:IGA, author = "Vasanth Rajamani and Sanem Kabadayi and Christine Julien", title = "An interrelational grouping abstraction for heterogeneous sensors", journal = j-TOSN, volume = "5", number = "3", pages = "27:1--27:??", month = may, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1525856.1525865", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:23:43 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In wireless sensor network applications, the potential to use cooperation to resolve user queries remains largely untapped. Efficiently answering a user's questions requires identifying the correct set of nodes that can answer the question and enabling coordination between them. In this article, we propose a {\em query domain\/} abstraction that allows an application to dynamically specify the nodes best suited to answering a particular query. Selecting the ideal set of heterogeneous sensors entails answering two fundamental questions --- {\em how\/} are the selected sensors related to one another, and {\em where\/} should the resulting sensor coalition be located. We introduce two abstractions, the {\em proximity function\/} and the {\em reference function}, to precisely specify each of these concerns within a query. All nodes in the query domain must satisfy any provided proximity function, a user-defined function that constrains the relative relationship among the group of nodes (e.g., based on a property of the network or physical environment or on logical properties of the nodes). The selected set of nodes must also satisfy any provided reference function, a mechanism to scope the location of the query domain to a specified area of interest (e.g., within a certain distance from a specified reference point). In this article, we model these abstractions and present a set of protocols that accomplish this task with varying degrees of correctness. We evaluate their performance through simulation and highlight the tradeoffs between protocol overhead and correctness.", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "clustering; energy-efficiency; Heterogeneous sensor networks; proximity functions; querying abstraction", } @Article{Kamat:2009:TPW, author = "Pandurang Kamat and Wenyuan Xu and Wade Trappe and Yanyong Zhang", title = "Temporal privacy in wireless sensor networks: {Theory} and practice", journal = j-TOSN, volume = "5", number = "4", pages = "28:1--28:??", month = nov, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1614379.1614380", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:11 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Although the content of sensor messages describing ``events of interest'' may be encrypted to provide confidentiality, the context surrounding these events may also be sensitive and therefore should be protected from eavesdroppers. An adversary armed with knowledge of the network deployment, routing algorithms, and the base-station (data sink) location can infer the temporal patterns of interesting events by merely monitoring the arrival of packets at the sink, thereby allowing the adversary to remotely track the spatio-temporal evolution of a sensed event. In this paper we introduce the problem of temporal privacy for delay-tolerant sensor networks, and propose adaptive buffering at intermediate nodes on the source-sink routing path to obfuscate temporal information from the adversary. We first present the effect of buffering on temporal privacy using an information-theoretic formulation, and then examine the effect that delaying packets has on buffer occupancy. We observe that temporal privacy and efficient buffer utilization are contrary objectives, and then present an adaptive buffering strategy that effectively manages these tradeoffs. Finally, we evaluate our privacy enhancement strategies using simulations, where privacy is quantified in terms of the adversary's mean square error.", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "privacy; security; Sensor networks; temporal privacy", } @Article{Liu:2009:CEE, author = "Sha Liu and Kai-Wei Fan and Prasun Sinha", title = "{CMAC}: an energy-efficient {MAC} layer protocol using convergent packet forwarding for wireless sensor networks", journal = j-TOSN, volume = "5", number = "4", pages = "29:1--29:??", month = nov, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1614379.1614381", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:11 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Low duty cycle operation is critical to conserve energy in wireless sensor networks. Traditional wake-up scheduling approaches either require periodic synchronization messages or incur high packet delivery latency due to the lack of any synchronization. To simultaneously achieve the seemingly contradictory goals of energy efficiency and low latency, the design of a new low duty-cycle MAC layer protocol called Convergent MAC (CMAC) is presented. CMAC avoids synchronization overhead while supporting low latency. By using zero communication when there is no traffic, CMAC allows sensor nodes to operate at very low duty cycles. When carrying traffic, CMAC first uses anycast to wake up forwarding nodes, and then converges gradually from route-suboptimal anycast with unsynchronized duty cycling to route-optimal unicast with synchronized scheduling. To validate our design and provide a usable module for the research community, CMAC has been implemented in TinyOS and evaluated on the Kansei testbed consisting of 105 XSM nodes. The results show that CMAC at 1\% duty cycle significantly outperforms BMAC at 1\% in terms of latency, throughput and energy efficiency. The performance of CMAC is also compared with other protocols using simulations, in which the results show for 1\% and lower duty cycles, CMAC exhibits similar throughput and latency as CSMA/CA using much less energy, and outperforms SMAC, DMAC and GeRaF in almost all aspects.", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Aggressive RTS; anycast; CMAC; convergent forwarding; MAC; wireless sensor networks", } @Article{Shrivastava:2009:TTB, author = "Nisheeth Shrivastava and Raghuraman Mudumbai and Upamanyu Madhow and Subhash Suri", title = "Target tracking with binary proximity sensors", journal = j-TOSN, volume = "5", number = "4", pages = "30:1--30:??", month = nov, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1614379.1614382", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:11 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits while providing minimal descriptions of the estimated target trajectory. Using geometric and probabilistic analysis of an idealized model, we prove that the achievable spatial resolution in localizing a target's trajectory is of the order of $1/\rho R$, where $R$ is the sensing radius and $\rho$ is the sensor density per unit area. We provide a geometric algorithm for computing an economical (in descriptive complexity) piecewise linear path that approximates the trajectory within this fundamental limit of accuracy. We employ analogies between binary sensing and sampling theory to contend that only a ``lowpass'' approximation of the trajectory is attainable, and explore the implications of this observation for estimating the target's velocity. We also consider nonideal sensing, employing particle filters to average over noisy sensor observations, and geometric postprocessing of the particle filter output to provide an economical piecewise linear description of the trajectory. In addition to simulation results validating our approaches for both idealized and nonideal sensing, we report on lab-scale experiments using motes with acoustic sensors.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "binary sensing; distributed algorithms; fundamental limits; Sensor networks; target tracking", } @Article{Lederer:2009:CBL, author = "Sol Lederer and Yue Wang and Jie Gao", title = "Connectivity-based localization of large-scale sensor networks with complex shape", journal = j-TOSN, volume = "5", number = "4", pages = "31:1--31:??", month = nov, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1614379.1614383", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:11 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the correct network layout, that is, avoid global flips where a part of the network folds on top of another. Our algorithm first selects landmarks on network boundaries with sufficient density, then constructs the landmark Voronoi diagram and its dual combinatorial Delaunay complex on these landmarks. The key insight is that the combinatorial Delaunay complex is provably {\em globally rigid\/} and has a {\em unique\/} realization in the plane. Thus an embedding of the landmarks by simply gluing the Delaunay triangles properly recovers the faithful network layout. With the landmarks nicely localized, the rest of the nodes can easily localize themselves by trilateration to nearby landmark nodes. This leads to a practical and accurate localization algorithm for large networks using only network connectivity. Simulations on various network topologies show surprisingly good results. In comparison, previous connectivity-based localization algorithms such as multidimensional scaling and rubberband representation generate globally flipped or distorted localization results.", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Combinatorial Delaunay Complex; Embedding; Graph Rigidity; Localization; Sensor Networks", } @Article{Shi:2009:OBS, author = "Yi Shi and Y. Thomas Hou", title = "Optimal base station placement in wireless sensor networks", journal = j-TOSN, volume = "5", number = "4", pages = "32:1--32:??", month = nov, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1614379.1614384", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:11 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Base station location has a significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particularly challenging due to its coupling with data routing. This article presents an approximation algorithm that can guarantee $(1 - \epsilon)$-optimal network lifetime performance for base station placement problem with any desired error bound $\epsilon > 0$. The proposed $(1 - \epsilon)$-optimal approximation algorithm is based on several novel techniques that makes it possible to reduce an infinite search space to a finite-element search space for base station location. The first technique used in this reduction is to discretize cost parameter (associated with energy consumption) with performance guarantee. Subsequently, the continuous search space can be broken up into a finite number of subareas. The second technique is to exploit the cost property of each subarea and represent it by a novel notion called fictitious cost point, each with guaranteed cost bounds. We give a proof that the proposed base station placement algorithm is $(1 - \epsilon)$-optimal. This approximation algorithm is simpler and faster than a state-of-the-art algorithm and represents the best known result to the base station placement problem.", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Approximation algorithm; base station placement; network lifetime; sensor network", } @Article{Mathur:2009:ULP, author = "Gaurav Mathur and Peter Desnoyers and Paul Chukiu and Deepak Ganesan and Prashant Shenoy", title = "Ultra-low power data storage for sensor networks", journal = j-TOSN, volume = "5", number = "4", pages = "33:1--33:??", month = nov, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1614379.1614385", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:11 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Local storage is required in many sensor network applications, both for archival of detailed event information, as well as to overcome sensor platform memory constraints. Recent gains in energy efficiency of new-generation NAND flash storage have strengthened the case for in-network storage by data-centric sensor network applications. We argue that current storage solutions offering a simple file system abstraction are inadequate for sensor applications to exploit storage. Instead, we propose Capsule --- a rich, flexible and portable object storage abstraction that offers stream, file, array, queue and index storage objects for data storage and retrieval. Further, Capsule supports checkpointing and rollback of object state for fault tolerance. Our experiments demonstrate that Capsule provides platform independence, greater functionality and greater energy efficiency than existing storage solutions.", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "embedded systems; energy efficiency; file system; flash memory; objects; sensors; storage system", } @Article{Paschalidis:2009:RDS, author = "Ioannis Ch. Paschalidis and Dong Guo", title = "Robust and distributed stochastic localization in sensor networks: {Theory} and experimental results", journal = j-TOSN, volume = "5", number = "4", pages = "34:1--34:??", month = nov, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1614379.1614386", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:11 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present a robust localization system allowing wireless sensor networks to determine the physical location of their nodes. The coverage area is partitioned into regions and we seek to identify the region of a sensor based on observations by stationary clusterheads. Observations (e.g., signal strength) are assumed random. We pose the localization problem as a composite multihypothesis testing problem, develop the requisite theory, and address the problem of optimally placing clusterheads. We show that localization decisions can be distributed by appropriate in-network processing. The approach is validated in a testbed yielding promising results.", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "hypothesis testing; information theory; localization; optimal deployment; Sensor networks; testbed", } @Article{Deng:2009:MDF, author = "Jing Deng", title = "{Multihop\slash Direct Forwarding (MDF)} for static wireless sensor networks", journal = j-TOSN, volume = "5", number = "4", pages = "35:1--35:??", month = nov, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1614379.1614387", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:11 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The success of Wireless Sensor Networks (WSNs) depends largely on efficient information delivery from target areas toward data sinks. The problem of data forwarding is complicated by the severe energy constraints of sensors in WSNs. In this work, we propose and analyze a data forwarding scheme, termed Multihop/Direct Forwarding (MDF), for WSNs where sensor nodes forward data traffic toward a common data sink. In the MDF scheme, a node splits outgoing traffic into at most two branches: one is sent to a node that is $h$ units away; the other is sent directly to the data sink. The value of $h$ is chosen to minimize the overall energy consumption of the network. The direct transmission is employed to balance the energy consumption of nodes at different locations and to avoid the so-called hot spot problem in data forwarding. In order to calculate its traffic splitting ratio, a node only needs to know the distance toward the common data sink and that of the farthest node. Our analytical and simulation results show that the MDF scheme performs close to, in terms of energy efficiency and network lifetime, the optimum data forwarding rules, which are more complex and computation intensive.", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Energy efficient; multihop forwarding; wireless sensor networks", } @Article{Lachenmann:2009:MLG, author = "Andreas Lachenmann and Klaus Herrmann and Kurt Rothermel and Pedro Jos{\'e} Marr{\'o}n", title = "On meeting lifetime goals and providing constant application quality", journal = j-TOSN, volume = "5", number = "4", pages = "36:1--36:??", month = nov, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1614379.1614388", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:11 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Most work in sensor networks tries to maximize network lifetime. However, for many applications the required lifetime is known in advance. Therefore, application quality should rather be maximized for that given time. {\em Levels}, the approach presented in this article, is a programming abstraction for energy-aware sensor network applications that helps to meet such a user-defined lifetime goal by deactivating optional functionality.\par With this programming abstraction, the application developer defines so-called {\em energy levels}. Functionality in energy levels is deactivated if the required lifetime cannot be met otherwise. The runtime system uses data about the energy consumption of different levels to compute an optimal level assignment that maximizes each node's quality for the time remaining.\par As described in this paper, {\em Levels\/} includes a completely distributed coordination algorithm that balances energy level assignments and keeps the application quality of the network roughly constant over time. In this approach, each node computes its schedule based on those of its neighbors.\par As the evaluation shows, applications using {\em Levels\/} can accurately meet given lifetime goals with only small fluctuations in application quality. In addition, the runtime overhead both for computation and for communication is negligible.", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "coordination; energy; lifetime goal; programming abstraction; Wireless sensor network", } @Article{Gandhi:2009:CEM, author = "Sorabh Gandhi and Subhash Suri and Emo Welzl", title = "Catching elephants with mice: {Sparse} sampling for monitoring sensor networks", journal = j-TOSN, volume = "6", number = "1", pages = "1:1--1:??", month = dec, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1653760.1653761", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:34 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We propose a scalably efficient scheme for detecting large-scale physically correlated events in sensor networks. Specifically, we show that in a network of $n$ sensors arbitrarily distributed in the plane, a sample of $O(1/\epsilon \log 1/\epsilon)$ sensor nodes ({\em mice\/}) is sufficient to catch any, and {\em only those}, events that affect $\Omega(\epsilon n)$ nodes ({\em elephants\/}), for any 0 \par While nearly optimal in theory, due to implicit constant factors, these ``scale-free'' bounds still prove too large in practice if applied blindly. We therefore propose heuristic improvements and perform empirical parameter tuning to counter the pessimism inherent in these theoretical estimates. Using a variety of data distributions and event geometries, we show through simulations that the final scheme is eminently scalable and practical, say, for $n \geq 1000$. The overall simplicity and generality of our technique suggests that it is well suited for a wide class of sensornet applications, including monitoring of physical environments, network anomalies, network security, or any abstract binary event that affects a significant number of nodes in the network.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chen:2009:MGQ, author = "Ai Chen and Ten H. Lai and Dong Xuan", title = "Measuring and guaranteeing quality of barrier coverage for general belts with wireless sensors", journal = j-TOSN, volume = "6", number = "1", pages = "2:1--2:??", month = dec, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1653760.1653762", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:34 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Sensors may fail due to various reasons such as heat, malicious activity, environmental hazards, extended use, and lack of power. As more and more sensors fail, certain desired properties such as barrier coverage will diminish and eventually fall below a desired level. In such a case, the network will have to be repaired. It is therefore desirable to have mechanisms to monitor network properties. In this article, we are interested in measuring the quality of barrier coverage, which is known to be an appropriate model of coverage for movement detection applications such as intrusion detection.\par In the literature, researchers only consider whether or not a sensor network provides barrier coverage. This is equivalent to measuring its quality as either 0 or 1. We believe quality of barrier coverage is not binary and propose a metric for measuring it. If the measured quality is short of a desired value, we further identify all local regions that need to be repaired. The identified regions are minimal in the sense that if one of them is not repaired then the resulting network will still be short of quality. We also discuss how to actually repair a region.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "barrier coverage; measuring; quality; repairing; Wireless sensor networks", } @Article{Jurdak:2009:DBO, author = "Raja Jurdak and Antonio G. Ruzzelli and Gregory M. P. O'hare and Russell Higgs", title = "Directed broadcast with overhearing for sensor networks", journal = j-TOSN, volume = "6", number = "1", pages = "3:1--3:??", month = dec, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1653760.1653763", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:34 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The efficient management of scarce network resources, including energy and bandwidth, represents a central challenge for wireless sensor networks. The current trend in resource management relies on the introduction of control mechanisms, such as control message exchanges, node-specific addressing, and storage of partial network state information. These mechanisms typically incur communication and processing overhead that does not scale well for larger or denser networks. Instead of introducing control mechanisms for network resource management, this article proposes and evaluates a Directed Broadcast with Overhearing (DBO) approach for sensor networks that combines directed broadcast at the network layer with CSMA and packet overhearing at the MAC layer. Through avoidance of control messaging and exchange of network state information, DBO trades off limited packet duplication overhead for control messaging overhead. This article introduces an analytical model that provides the basis for DBO evaluation and for analysis of the approach's transient packet retransmissions, route convergence, and energy consumption in the average and worst cases. We also present the model implementation details and the simulation experiments that explore the suitability of DBO for networks of different sizes with three different radio models that vary the width of grey regions, and we compare DBO's energy consumption against conventional unicast beacon-based and snooping-based routing protocols. The results indicate that DBO's route convergence requires an average of five hops for ideal radio reception, seven hops for narrow grey regions, and twelve hops for wide grey regions. These results confirm that DBO shifts energy consumption from critical nodes near the base station to nodes near the source. The overall energy consumption of limited packet duplication overhead with DBO compared to unicast routing shrinks for medium- to large-size networks, rendering it more favorable than conventional communication approaches for large and dense sensor networks.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "architecture; Cross-layer; directed broadcast; overhearing; protocols; sensor networks", } @Article{Ruj:2009:KPU, author = "Sushmita Ruj and Bimal Roy", title = "Key predistribution using combinatorial designs for grid-group deployment scheme in wireless sensor networks", journal = j-TOSN, volume = "6", number = "1", pages = "4:1--4:??", month = dec, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1653760.1653764", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:34 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We propose a new grid-group deployment scheme in wireless sensor networks. We use combinatorial designs for key predistribution in sensor nodes. The deployment region is divided into square regions. The predistribution scheme has the advantage that all nodes within a particular region can communicate with each other directly and nodes which lie in a different regions can communicate via special nodes called agents which have more resources than the general nodes. The number of agents in a region is always three, whatever the size of the network. We give measures of resiliency taking the Lee distance into account. Apart from considering the resiliency in terms of fraction of links broken, we also consider the resiliency as the number of nodes and regions disconnected when some sensor are compromised. This second measure, though very important, had not been studied so far in key predistribution schemes which use deployment knowledge. We find that the resiliency as the fraction of links compromised is better than existing schemes. The number of keys preloaded in each sensor node is much less than all existing schemes and nodes are either directly connected or connected via two hop paths. The deterministic key predistribution schemes result in constant-time computation overhead for shared key discovery and path key establishment.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Combinatorial design; deployment; key predistribution; Lee distance; secure communication; transversal design", } @Article{Sadek:2009:EEC, author = "Ahmed K. Sadek and Wei Yu and K. J. Ray Liu", title = "On the energy efficiency of cooperative communications in wireless sensor networks", journal = j-TOSN, volume = "6", number = "1", pages = "5:1--5:??", month = dec, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1653760.1653765", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:34 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Cooperative communications represent a potential candidate to combat the effects of channel fading and to increase the transmit energy efficiency in wireless sensor networks with the downside being the increased complexity. In sensor networks the power consumed in the receiving and processing circuitry can constitute a significant portion of the total consumed power. By taking into consideration such overhead, an analytical framework for studying the energy efficiency trade-off of cooperation in sensor networks is presented. This trade-off is shown to depend on several parameters such as the receive and processing power, the required quality-of-service, the power amplifier loss, and several other factors. The analytical and numerical results reveal that for small distance separation between the source and destination, direct transmission is more energy efficient than relaying. The results also reveal that equal power allocation performs as well as optimal power allocation for some scenarios. The effects of the relay location and the number of employed relays on energy efficiency are also investigated in this work. Moreover, there are experimental results conducted to verify the channel model assumed in the article.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "cooperative communications; diversity; energy efficiency; power allocation; Sensor networks", } @Article{Eisenman:2009:BMS, author = "Shane B. Eisenman and Emiliano Miluzzo and Nicholas D. Lane and Ronald A. Peterson and Gahng-Seop Ahn and Andrew T. Campbell", title = "{BikeNet}: a mobile sensing system for cyclist experience mapping", journal = j-TOSN, volume = "6", number = "1", pages = "6:1--6:??", month = dec, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1653760.1653766", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:34 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present BikeNet, a mobile sensing system for mapping the cyclist experience. Built leveraging the MetroSense architecture to provide insight into the real-world challenges of people-centric sensing, BikeNet uses a number of sensors embedded into a cyclist's bicycle to gather quantitative data about the cyclist's rides. BikeNet uses a dual-mode operation for data collection, using opportunistically encountered wireless access points in a delay-tolerant fashion by default, and leveraging the cellular data channel of the cyclist's mobile phone for real-time communication as required. BikeNet also provides a Web-based portal for each cyclist to access various representations of her data, and to allow for the sharing of cycling-related data (for example, favorite cycling routes) within cycling interest groups, and data of more general interest (for example, pollution data) with the broader community. We present: a description and prototype implementation of the system architecture based on customized Moteiv Tmote Invent motes and sensor-enabled Nokia N80 mobile phones; an evaluation of sensing and inference that quantifies cyclist performance and the cyclist environment; a report on networking performance in an environment characterized by bicycle mobility and human unpredictability; and a description of BikeNet system user interfaces.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Applications; bicycling; recreation; systems", } @Article{Rajasegarar:2009:EAW, author = "Sutharshan Rajasegarar and James C. Bezdek and Christopher Leckie and Marimuthu Palaniswami", title = "Elliptical anomalies in wireless sensor networks", journal = j-TOSN, volume = "6", number = "1", pages = "7:1--7:??", month = dec, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1653760.1653767", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:34 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Anomalies in wireless sensor networks can occur due to malicious attacks, faulty sensors, changes in the observed external phenomena, or errors in communication. Defining and detecting these interesting events in energy-constrained situations is an important task in managing these types of networks. A key challenge is how to detect anomalies with few false alarms while preserving the limited energy in the network. In this article, we define different types of anomalies that occur in wireless sensor networks and provide formal models for them. We illustrate the model using statistical parameters on a dataset gathered from a real wireless sensor network deployment at the Intel Berkeley Research Laboratory. Our experiments with a novel distributed anomaly detection algorithm show that it can detect elliptical anomalies with exactly the same accuracy as that of a centralized scheme, while achieving a significant reduction in energy consumption in the network. Finally, we demonstrate that our model compares favorably to four other well-known schemes on four datasets.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "anomaly detection; Elliptical anomalies; multivariate analysis; outlier detection; security; wireless sensor networks", } @Article{Cheng:2009:DAN, author = "Bing Hwa Cheng and Lieven Vandenberghe and Kung Yao", title = "Distributed algorithm for node localization in wireless ad-hoc networks", journal = j-TOSN, volume = "6", number = "1", pages = "8:1--8:??", month = dec, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1653760.1653768", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:34 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present a distributed algorithm for node localization based on the Gauss--Newton method. In this algorithm, each node updates its own location estimate using the pairwise distance measurements and the local information it receives from the neighboring nodes. Once the location estimate is updated, the sensor node broadcasts the updated estimate to all the neighboring nodes. A distributed and scalable local scheduling algorithm for updating nodes in the network is presented to avoid the use of the global coordinator or a routing loop. We analytically show that the proposed distributed algorithm converges under certain practical assumptions of the network. The performance of the algorithm is evaluated using both simulation and experimental results. Quantitative comparisons among different distributed algorithms are also presented.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Distributed optimization; Gauss--Newton; node localization", } @Article{Wang:2009:SST, author = "Ronghua Wang and Wenliang Du and Xiaogang Liu and Peng Ning", title = "{ShortPK}: a short-term public key scheme for broadcast authentication in sensor networks", journal = j-TOSN, volume = "6", number = "1", pages = "9:1--9:??", month = dec, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1653760.1653769", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:24:34 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Broadcast authentication is an important functionality in sensor networks. Energy constraints on sensor nodes and the real-time nature of the broadcasts render many of the existing solutions impractical: previous works focusing primarily on symmetric key schemes have difficulties in achieving real-time authentication. Public Key Cryptography (PKC), however, can satisfy the real-time requirements, and recent trends indicate that public key is becoming feasible for sensor networks.\par However, PKC operations are still expensive computations. It is impractical to use PKC in the conventional ways for broadcast authentication in sensor networks. To reduce costs, we propose {\em ShortPK}, an efficient Short-term Public Key broadcast authentication scheme. The basic idea is to use short-length public/private keys, but limit their lifetime to only a short period of time. To cover a long period of time, we need to use many public/private key pairs; distributing these public keys to sensors is a challenging problem. We describe a progressive key distribution scheme that is secure, efficient, and packet-loss resilient. We compare our scheme with the traditional 160-bit ECC public key schemes, and show that our scheme can achieve a significant improvement on energy consumption.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "communication; public key; Sensor networks", } @Article{Xu:2010:CGM, author = "Xiaochun Xu and Nageswara S. V. Rao and Sartaj Sahni", title = "A computational geometry method for localization using differences of distances", journal = j-TOSN, volume = "6", number = "2", pages = "10:1--10:??", month = feb, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1689239.1689240", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:25:00 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present a computational geometry method for the problem of estimating the location of a source in the plane using measurements of distance-differences to it. Compared to existing solutions to this well-studied problem, this method is: (a) computationally more efficient and adaptive in that its precision can be controlled as a function of the number of computational operations, and (b) robust with respect to measurement and computational errors, and is not susceptible to numerical instabilities typical of existing linear algebraic or quadratic methods. This method employs a binary search on a distance-difference curve in the plane using a second distance-difference as the objective function. We show the correctness of this method by establishing the unimodality of directional derivative of the objective function within each of a small number of regions of the plane, wherein a suitable binary search is supported. The computational complexity of this method is $O(\log (1 / \gamma))$, where the computed solution is guaranteed to be within a distance $\gamma$ of the actual location of the source. We present simulation results to compare this method with existing DTOA localization methods.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "distance-difference triangulation; DTOA localization; geometric search; sensor networks", } @Article{Nordio:2010:IQE, author = "Alessandro Nordio and Carla-Fabiana Chiasserini and Emanuele Viterbo", title = "The impact of quasi-equally spaced sensor topologies on signal reconstruction", journal = j-TOSN, volume = "6", number = "2", pages = "11:1--11:??", month = feb, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1689239.1689241", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:25:00 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A wireless sensor network with randomly deployed nodes can be used to provide an irregular sampling of a physical field of interest. We assume that a sink node collects the data gathered by the sensors and uses a linear filter for the reconstruction of a bandlimited scalar field defined over a $d$-dimensional domain. Sensors' locations are assumed to be known at the sink node, up to a certain position error. We then take the mean square error (MSE) of the reconstructed field as performance metric, and evaluate the effect of both uniform and quasi-equally spaced sensor layouts on the quality of the reconstructed field. We define a parameter that provides a measure of the regularity of the sensors deployment, and, through asymptotic analysis, we derive the MSE in the case of different sensor spatial distributions. For two of them, an approximate closed form expression is obtained. We validate our analysis through numerical results, and we show that an excellent match exists between analysis and simulation even for a small number of sensors.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "irregular sampling; performance evaluation; Sensor networks; signal reconstruction", } @Article{Sang:2010:LAO, author = "Lifeng Sang and Anish Arora and Hongwei Zhang", title = "On link asymmetry and one-way estimation in wireless sensor networks", journal = j-TOSN, volume = "6", number = "2", pages = "12:1--12:??", month = feb, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1689239.1689242", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:25:00 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Link asymmetry is one of the unique challenges that wireless sensor networks pose in the design of network protocols. We observe, based on testbed experiments, that a substantial percentage of links are asymmetric, many are even unidirectional. We also find that the reliability of synchronous acknowledgments is considerably higher than that of asynchronous messages. Thus the norm of estimating link quality bidirectionally via asynchronous beacons underestimates the link reliability of asymmetric links. This leads us to investigate how to exploit asymmetric links in order to improve network functions such as convergecast routing in sensor networks via one-way link estimation. We propose a new one-way link metric ETF (for the {\em expected number of transmissions over forward links\/}) and present a local procedure for its estimation. We use ETF to identify reliable forward links, and we use dynamic retransmission thresholding for error control. Via experiments on testbeds of CC1000 radios and CC2420 radios (an IEEE 802.15.4-compliant radio), we quantify the performance improvement in ETF as compared with ETX. We also study the performance improvement of ETF over ETX when no special mechanism is employed to discover asymmetric links or to control retransmissions.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "link estimation; routing; Sensor network", } @Article{Reddy:2010:UMP, author = "Sasank Reddy and Min Mun and Jeff Burke and Deborah Estrin and Mark Hansen and Mani Srivastava", title = "Using mobile phones to determine transportation modes", journal = j-TOSN, volume = "6", number = "2", pages = "13:1--13:??", month = feb, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1689239.1689243", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:25:00 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "As mobile phones advance in functionality and capability, they are being used for more than just communication. Increasingly, these devices are being employed as instruments for introspection into habits and situations of individuals and communities. Many of the applications enabled by this new use of mobile phones rely on contextual information. The focus of this work is on one dimension of context, the transportation mode of an individual when outside. We create a convenient (no specific position and orientation setting) classification system that uses a mobile phone with a built-in GPS receiver and an accelerometer. The transportation modes identified include whether an individual is stationary, walking, running, biking, or in motorized transport. The overall classification system consists of a decision tree followed by a first-order discrete Hidden Markov Model and achieves an accuracy level of 93.6\% when tested on a dataset obtained from sixteen individuals.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Activity classification; mobile phones; transportation mode inference", } @Article{Carbunar:2010:QPW, author = "Bogdan Carbunar and Yang Yu and Weidong Shi and Michael Pearce and Venu Vasudevan", title = "Query privacy in wireless sensor networks", journal = j-TOSN, volume = "6", number = "2", pages = "14:1--14:??", month = feb, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1689239.1689244", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:25:00 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Existing mechanisms for querying wireless sensor networks leak client interests to the servers performing the queries. The leaks are not only in terms of specific regions of interest but also of client access patterns. In this article we introduce the problem of preserving the privacy of clients querying a wireless sensor network owned by untrusted organizations. We first propose an efficient protocol, SPYC, that ensures full client privacy in settings where the servers providing access to the network are honest-but-curious and whose collaboration does not extend beyond well-defined administrative purposes. Furthermore, we study the same query privacy problem in a setting where servers exhibit malicious behavior or where powerful external attackers have access to sensor network traffic information. In this setting we propose two metrics for quantifying the privacy achieved by a client's query sequence. We then extend SPYC with a suite of practical algorithms, then analyze the privacy and efficiency levels they provide. Our TOSSIM simulations show that the proposed extensions are communication efficient while significantly improving client privacy levels.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "data integrity; Data storage and query processing; privacy; security", } @Article{Ni:2010:DRS, author = "Jinfeng Ni and Li Zhou and Chinya V. Ravishankar", title = "Dealing with random and selective attacks in wireless sensor systems", journal = j-TOSN, volume = "6", number = "2", pages = "15:1--15:??", month = feb, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1689239.1689245", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:25:00 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present a framework for analyzing the effects of random and selective compromises (using order statistics) in sensor networks. We discuss the problem of ensuring data integrity at the source and during transit in sensor networks, and present an analysis of the reliability of reports from mobile collectors. No analysis has appeared in the literature of source integrity for mobile nodes, or of selective attacks in sensor networks. We address transit data integrity by presenting mGKE, a key establishment scheme for general group-based sensor deployments, and present a detailed analytical and experimental comparison of mGKE with current schemes. mGKE outperforms current methods in terms of resilience, connectivity, and memory and communication overhead.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Attack models; fault tolerance; mobile sensors", } @Article{Srinivasan:2010:ESL, author = "Kannan Srinivasan and Prabal Dutta and Arsalan Tavakoli and Philip Levis", title = "An empirical study of low-power wireless", journal = j-TOSN, volume = "6", number = "2", pages = "16:1--16:??", month = feb, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1689239.1689246", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:25:00 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present empirical measurements of the packet delivery performance of the latest sensor platforms: Micaz and Telos motes. In this article, we present observations that have implications to a set of common assumptions protocol designers make while designing sensornet protocols --- specifically --- the MAC and network layer protocols. We first distill these common assumptions in to a conceptual model and show how our observations support or dispute these assumptions. We also present case studies of protocols that do not make these assumptions. Understanding the implications of these observations to the conceptual model can improve future protocol designs.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "802.15.4; low-power wireless networks; metrics; Wireless link; wireless measurement study; wireless protocol design", } @Article{Ingelrest:2010:SAS, author = "Fran{\c{c}}ois Ingelrest and Guillermo Barrenetxea and Gunnar Schaefer and Martin Vetterli and Olivier Couach and Marc Parlange", title = "{SensorScope}: {Application-specific} sensor network for environmental monitoring", journal = j-TOSN, volume = "6", number = "2", pages = "17:1--17:??", month = feb, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1689239.1689247", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:25:00 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "SensorScope is a turnkey solution for environmental monitoring systems, based on a wireless sensor network and resulting from a collaboration between environmental and network researchers. Given the interest in climate change, environmental monitoring is a domain where sensor networks will have great impact by providing high resolution spatio-temporal data for long periods of time. SensorScope is such a system, which has already been successfully deployed multiple times in various environments (e.g., mountainous, urban). Here, we describe the overall hardware and software architectures and especially focus on the sensor network itself. We also describe one of our most prominent deployments, on top of a rock glacier in Switzerland, which resulted in the description of a micro-climate phenomenon leading to cold air release from a rock-covered glacier in a region of high alpine risks. Another focus of this paper is the description of what happened behind the scenes to turn SensorScope from a laboratory experiment into successful outdoor deployments in harsh environments. Illustrated by various examples, we point out many lessons learned while working on the project. We indicate the importance of simple code, well suited to the application, as well as the value of close interaction with end-users in planning and running the network and finally exploiting the data.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Architecture; deployment; environmental monitoring; implementation; wireless sensor network", } @Article{Zhu:2010:FTR, author = "Mengxia Zhu and Song Ding and Qishi Wu and R. R. Brooks and N. S. V. Rao and S. S. Iyengar", title = "Fusion of threshold rules for target detection in wireless sensor networks", journal = j-TOSN, volume = "6", number = "2", pages = "18:1--18:??", month = feb, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1689239.1689248", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 16 15:25:00 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We propose a binary decision fusion rule that reaches a global decision on the presence of a target by integrating local decisions made by multiple sensors. Without requiring a priori probability of target presence, the fusion threshold bounds derived using Chebyshev's inequality ensure a higher hit rate and lower false alarm rate compared to the weighted averages of individual sensors. The Monte Carlo-based simulation results show that the proposed approach significantly improves target detection performance, and can also be used to guide the actual threshold selection in practical sensor network implementation under certain error rate constraints.", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "binary decision fusion; Chebyshev inequality; false alarm rate; Hit rate; ROC curve; wireless sensor network", } @Article{Ko:2010:HNU, author = "Teresa Ko and Shaun Ahmadian and John Hicks and Mohammad Rahimi and Deborah Estrin and Stefano Soatto and Sharon Coe and Michael P. Hamilton", title = "Heartbeat of a nest: {Using} imagers as biological sensors", journal = j-TOSN, volume = "6", number = "3", pages = "19:1--19:??", month = jun, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1754414.1754415", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present a scalable end-to-end system for vision-based monitoring of natural environments, and illustrate its use for the analysis of avian nesting cycles. Our system enables automated analysis of thousands of images, where manual processing would be infeasible. We automate the analysis of raw imaging data using statistics that are tailored to the task of interest. These ``features'' are a representation to be fed to classifiers that exploit spatial and temporal consistencies. Our testbed can detect the presence or absence of a bird with an accuracy of 82\%, count eggs with an accuracy of 84\%, and detect the inception of the nesting stage within a day. Our results demonstrate the challenges and potential benefits of using imagers as biological sensors. An exploration of system performance under varying image resolution and frame rate suggest that an {\em in situ\/} adaptive vision system is technically feasible.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "computer vision; image network; sensor network; system deployment", } @Article{Saukh:2010:BRL, author = "Olga Saukh and Robert Sauter and Matthias Gauger and Pedro Jos{\'e} Marr{\'o}n", title = "On boundary recognition without location information in wireless sensor networks", journal = j-TOSN, volume = "6", number = "3", pages = "20:1--20:??", month = jun, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1754414.1754416", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Boundary recognition is an important and challenging issue in wireless sensor networks when no coordinates or distances are available. The distinction between inner and boundary nodes of the network can provide valuable knowledge to a broad spectrum of algorithms. This article tackles the challenge of providing a scalable and range-free solution for boundary recognition that does not require a high node density. We explain the challenges of accurately defining the boundary of a wireless sensor network with and without node positions and provide a new definition of network boundary in the discrete domain. Our solution for boundary recognition approximates the boundary of the sensor network by determining the majority of inner nodes using geometric constructions, which guarantee that for a given $d$, a node lies inside of the construction for a $d$-quasi unit disk graph model of the wireless sensor network. Moreover, such geometric constructions make it possible to compute a guaranteed distance from a node to the boundary. We present a fully distributed algorithm for boundary recognition based on these concepts and perform a detailed complexity analysis. We provide a thorough evaluation of our approach and show that it is applicable to dense as well as sparse deployments.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "boundary definition; boundary recognition; d-quasi unit disk graphs; unit disk graphs; wireless sensor networks", } @Article{Ning:2010:DST, author = "Xu Ning and Christos G. Cassandras", title = "Dynamic sleep time control in wireless sensor networks", journal = j-TOSN, volume = "6", number = "3", pages = "21:1--21:??", month = jun, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1754414.1754417", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Idle listening is a major source of energy waste in wireless sensor networks. It can be reduced through Low-Power Listening (LPL) techniques in which a node is allowed to sleep for a significant amount of time. In contrast to conventional fixed sleep time policies, we introduce a novel dynamic sleep time control approach that further reduces control packet energy waste by utilizing known data traffic statistics. We propose two distinct approaches to dynamically compute the sleep time, depending on the objectives and constraints of the network. The first approach provides a dynamic sleep time policy that guarantees a specified average delay at the sender node resulting from packets waiting for the end of a sleep interval at the receiver. The second approach determines the optimal policy that minimizes total energy consumed. In the case where data traffic statistics are unknown, we propose an adaptive learning algorithm to estimate them online and develop corresponding sleep time computation algorithms. Simulation results are included to illustrate the use of dynamic sleep time control and to demonstrate how it dominates fixed sleep time methods. An implementation of our approach on a commercial sensor node supports the computational feasibility of the proposed approach.", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "energy management; learning; low-power listening; stochastic processes", } @Article{Wang:2010:EED, author = "Jing Wang and Yonghe Liu and Sajal K. Das", title = "Energy-efficient data gathering in wireless sensor networks with asynchronous sampling", journal = j-TOSN, volume = "6", number = "3", pages = "22:1--22:??", month = jun, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1754414.1754418", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A low sampling rate leads to reduced congestion and hence energy consumption in the resource-constrained wireless sensor networks. In this article, we propose asynchronous sampling that shifts the sampling time instances of sensor nodes from each other. For lossy data gathering scenarios, the proposed approach provides more information about the physical phenomena in terms of increased entropy at a low sampling rate. For lossless data gathering scenarios, on the other hand, the sampling rate is lowered without sacrificing critical knowledge required for signal reconstruction. As lower sampling rates lead to smaller energy consumption for processing and transmitting the collected sensory data, the proposed asynchronous sampling strategies are capable of achieving a better trade-off between the lifetime of the network and the quality of collected information. In addition to mathematical analysis, simulation results based on real data also verify the benefits of our asynchronous sampling.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "asynchronous sampling; data gathering; energy efficiency; models; temporal-spatial correlation; wireless sensor networks", } @Article{Sharma:2010:SFD, author = "Abhishek B. Sharma and Leana Golubchik and Ramesh Govindan", title = "Sensor faults: {Detection} methods and prevalence in real-world datasets", journal = j-TOSN, volume = "6", number = "3", pages = "23:1--23:??", month = jun, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1754414.1754419", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Various sensor network measurement studies have reported instances of transient faults in sensor readings. In this work, we seek to answer a simple question: How often are such faults observed in real deployments? We focus on three types of transient faults, caused by faulty sensor readings that appear abnormal. To understand the prevalence of such faults, we first explore and characterize four qualitatively different classes of fault detection methods. Rule-based methods leverage domain knowledge to develop heuristic rules for detecting and identifying faults. Estimation methods predict ``normal'' sensor behavior by leveraging sensor correlations, flagging anomalous sensor readings as faults. Time-series-analysis-based methods start with an a priori model for sensor readings. A sensor measurement is compared against its predicted value computed using time series forecasting to determine if it is faulty. Learning-based methods infer a model for the ``normal'' sensor readings using training data, and then statistically detect and identify classes of faults.\par We find that these four classes of methods sit at different points on the accuracy/robustness spectrum. Rule-based methods can be highly accurate, but their accuracy depends critically on the choice of parameters. Learning methods can be cumbersome to train, but can accurately detect and classify faults. Estimation methods are accurate, but cannot classify faults. Time-series-analysis-based methods are more effective for detecting short duration faults than long duration ones, and incur more false positives than the other methods. We apply these techniques to four real-world sensor datasets and find that the prevalence of faults as well as their type varies with datasets. All four methods are qualitatively consistent in identifying sensor faults, lending credence to our observations. Our work is a first step towards automated online fault detection and classification.", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "data integrity; fault detection; fault prevalence; sensor networks; statistical techniques", } @Article{Shen:2010:EDD, author = "Chung-Ching Shen and William L. Plishker and Dong-Ik Ko and Shuvra S. Bhattacharyya and Neil Goldsman", title = "Energy-driven distribution of signal processing applications across wireless sensor networks", journal = j-TOSN, volume = "6", number = "3", pages = "24:1--24:??", month = jun, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1754414.1754420", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor network (WSN) applications have been studied extensively in recent years. Such applications involve resource-limited embedded sensor nodes that have small size and low power requirements. Based on the need for extended network lifetimes in WSNs in terms of energy use, the energy efficiency of computation and communication operations in the sensor nodes becomes critical. Digital Signal Processing (DSP) applications typically require intensive data processing operations and as a result are difficult to implement directly in resource-limited WSNs. In this article, we present a novel design methodology for modeling and implementing computationally intensive DSP applications applied to wireless sensor networks. This methodology explores efficient modeling techniques for DSP applications, including data sensing and processing; derives formulations of Energy-Driven Partitioning (EDP) for distributing such applications across wireless sensor networks; and develops efficient heuristic algorithms for finding partitioning results that maximize the network lifetime. To address such an energy-driven partitioning problem, this article provides a new way of aggregating data and reducing communication traffic among nodes based on application analysis. By considering low data token delivery points and the distribution of computation in the application, our approach finds energy-efficient trade-offs between data communication and computation.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "DSP; energy efficiency; network lifetime; speech recognition; wireless sensor networks", } @Article{Zhang:2010:DMM, author = "Zhiguo Zhang and Ajay D. Kshemkalyani and Sol M. Shatz", title = "Dynamic multiroot, multiquery processing based on data sharing in sensor networks", journal = j-TOSN, volume = "6", number = "3", pages = "25:1--25:??", month = jun, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1754414.1754421", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Applications that exploit the capabilities of sensor networks have triggered significant research on query processing in sensor systems. Energy constraints make optimizing query processing particularly important. This article addresses multiroot, multiquery optimization for region queries. The work focuses on application-layer issues exploiting query semantics. The article formulates three algorithms: a na{\"\i}ve algorithm, without data sharing, and a static and heuristic data-sharing algorithm. The heuristic algorithm allows sharing of partially aggregated results of preconfigured geographic regions and exploits the location attribute of sensor nodes as a grouping criterion. Simulation studies indicate the potential for significant energy savings with the proposed algorithms.", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "distributed query processing; geographic coverage; multiquery optimization; sensor networks", } @Article{Lee:2010:NLO, author = "Huang Lee and Abtin Keshavarzian and Hamid Aghajan", title = "Near-lifetime-optimal data collection in wireless sensor networks via spatio-temporal load balancing", journal = j-TOSN, volume = "6", number = "3", pages = "26:1--26:??", month = jun, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1754414.1754422", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In wireless sensor networks, periodic data collection appears in many applications. During data collection, messages from sensor nodes are periodically collected and sent back to a set of base stations for processing. In this article, we present and analyze a near-lifetime-optimal and scalable solution for data collection in stationary wireless sensor networks and an energy-efficient packet exchange mechanism. In our solution, instead of using a fixed network topology, we construct a set of communication topologies and apply each topology to different data collection cycles. We not only use the flexibility in distributing the traffic load across different routes in the network (spatial load balancing), but also balance the energy consumption in the time domain (temporal load balancing). We show that this method achieves an average energy consumption rate very close to the optimal value found by network flow optimization techniques. To increase the scalability, we further extend our solution such that it can be applied to networks with multiple base stations where each base station only stores part of the network configuration, cooperating with each other to find a global solution in a distributed manner. The proposed methods are analyzed and evaluated by simulations.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "distributed algorithms; energy-efficient data collection; lifetime optimization; routing and scheduling design; wireless sensor networks", } @Article{Padhy:2010:UBA, author = "Paritosh Padhy and Rajdeep K. Dash and Kirk Martinez and Nicholas R. Jennings", title = "A utility-based adaptive sensing and multihop communication protocol for wireless sensor networks", journal = j-TOSN, volume = "6", number = "3", pages = "27:1--27:??", month = jun, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1754414.1754423", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:19 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article reports on the development of a utility-based mechanism for managing sensing and communication in cooperative multisensor networks. The specific application on which we illustrate our mechanism is that of GlacsWeb. This is a deployed system that uses battery-powered sensors to collect environmental data related to glaciers which it transmits back to a base station so that it can be made available world-wide to researchers. In this context, we first develop a sensing protocol in which each sensor locally adjusts its sensing rate based on the value of the data it believes it will observe. The sensors employ a Bayesian linear model to decide their sampling rate and exploit the properties of the Kullback--Leibler divergence to place an appropriate value on the data. Then, we detail a communication protocol that finds optimal routes for relaying this data back to the base station based on the cost of communicating it (derived from the opportunity cost of using the battery power for relaying data). Finally, we empirically evaluate our protocol by examining the impact on efficiency of a static network topology, a dynamic network topology, the size of the network, the degree of dynamism of the environment, and the mobility of the nodes. In so doing, we demonstrate that the efficiency gains of our new protocol, over the currently implemented method over a 6 month period, are 78\%, 133\%, 100\%, and 93\%, respectively. Furthermore, we show that our system performs at 65\%, 70\%, 63\%, and 70\% of the theoretical optimal, respectively, despite being a distributed protocol that operates with incomplete knowledge of the environment.", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "adaptive sampling; cost of communication; data gathering; dynamic environment; energy efficiency; network lifetime; sensor networks", } @Article{Puccinelli:2010:RDD, author = "Daniele Puccinelli and Martin Haenggi", title = "Reliable data delivery in large-scale low-power sensor networks", journal = j-TOSN, volume = "6", number = "4", pages = "28:1--28:??", month = jul, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1777406.1777407", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:44 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In data collection applications of low-end sensor networks, a major challenge is ensuring reliability without a significant goodput degradation. Short hops over high-quality links minimize per-hop transmissions, but long routes may cause congestion and load imbalance. Longer links can be exploited to build shorter routes, but poor links may have a high energy cost. There exists a complex interplay among routing performance (reliability, goodput, energy efficiency), link estimation, congestion control, and load balancing; we design a routing architecture, Arbutus, that exploits this interplay, and perform an extensive experimental evaluation on testbeds of 100-150 Berkeley motes.", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "congestion control; load balancing; routing; wireless sensor networks", } @Article{Dong:2010:SRV, author = "Jing Dong and Kurt E. Ackermann and Brett Bavar and Cristina Nita-Rotaru", title = "Secure and robust virtual coordinate system in wireless sensor networks", journal = j-TOSN, volume = "6", number = "4", pages = "29:1--29:??", month = jul, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1777406.1777408", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:44 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Virtual Coordinate System (VCS)-based routing provides a practical, efficient, and scalable means for point-to-point routing in wireless sensor networks. Several VCS-based routing protocols have been proposed in the last few years, all assuming that nodes behave correctly. However, many applications require deploying sensor networks in adversarial environments, making VCS-based routing protocols vulnerable to numerous attacks.\par In this article, we study the security of VCS-based routing protocols, with a focus on the unique component of VCS-based routing protocols, the virtual coordinate system. We first identify the security requirements of a correctly functioning VCS-based routing protocol and a set of novel attacks that can result in the violation of each of the identified requirements. The attacks target the underlying virtual coordinate system and can be mounted with low resources. However, they are epidemic in nature and are highly destructive to system performance. We then propose lightweight defense mechanisms designed specifically for resource-constrained sensor networks against each of the identified attacks. The proposed techniques require only local information on sensor nodes and take into account the unreliable nature of wireless links and network churn. Finally, we evaluate experimentally the impact of the attacks and the effectiveness of our defense mechanisms using a well-known VCS-based routing protocol, BVR. Our experiments show that the proposed techniques successfully mitigate all the identified attacks under a realistic link model and even at a high level of network churn.", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "beacon vector routing; routing; secure beacon vector routing; security; sensor network routing; virtual coordinate system", } @Article{Gao:2010:CLC, author = "Jie Gao and Radu Sion and Sol Lederer", title = "Collaborative location certification for sensor networks", journal = j-TOSN, volume = "6", number = "4", pages = "30:1--30:??", month = jul, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1777406.1777409", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:44 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Location information is of essential importance in sensor networks deployed for generating location-specific event reports. When such networks operate in hostile environments, it becomes imperative to guarantee the correctness of event location claims. In this article we address the problem of assessing location claims of untrusted (potentially compromised) nodes. The mechanisms introduced here prevent a compromised node from generating illicit event reports for locations other than its own. This is important because by compromising ``easy target'' sensors (say, sensors on the perimeter of the field that's easier to access), the adversary should not be able to impact data flows associated with other (``premium target'') regions of the network.\par To achieve this goal, in a process we call {\em location certification}, data routed through the network is ``tagged'' by participating nodes with ``belief'' ratings, collaboratively assessing the probability that the claimed source location is indeed correct. The effectiveness of our solution relies on the joint knowledge of participating nodes to assess the truthfulness of claimed locations. By collaboratively generating and propagating a set of ``belief'' ratings with transmitted data and event reports, the network allows authorized parties (e.g., final data sinks) to evaluate a metric of trust for the claimed location of such reports. Belief ratings are derived from a data model of observed past routing activity. The solution is shown to feature a strong ability to detect false location claims and compromised nodes. For example, incorrect claims as small as 2 hops (from the actual location) are detected with over 90\% accuracy.\par Finally, these new location certification mechanisms can be deployed in tandem with traditional secure localization, yet do not require it, and, in a sense, can serve to minimize the need thereof.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "location certification; security; sensor networks; systems", } @Article{Venkatasubramanian:2010:PVB, author = "Krishna K. Venkatasubramanian and Sandeep K. S. Gupta", title = "Physiological value-based efficient usable security solutions for body sensor networks", journal = j-TOSN, volume = "6", number = "4", pages = "31:1--31:??", month = jul, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1777406.1777410", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:44 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A Body Sensor Network (BSN) is a network of economically powered, wireless, wearable, and implanted health monitoring sensors, designed to continually collect and communicate health information from the host they are deployed on. Due to the sensitive nature of the data collected, securing BSNs is important for privacy preservation and protecting the host from bodily harm.\par In this article, we present Physiological Value-based Security (PVS), a usable and efficient way of securing intersensor communication schemes for BSNs. The PVS scheme distributes the key used for securing a particular message along with the message itself, by hiding it using physiological values. In this way, it not only eliminates the need for any explicit key distribution, but also reduces the number of keys required at each node to meet all its secure communication requirements.\par We further demonstrate the use of the PVS scheme in securing {\em cluster\/} topology formation in BSNs. Traditional protocols for cluster formation do not consider security and are therefore susceptible to malicious attacks. We present a PVS-based cluster formation protocol which mitigates these attacks. Performance analysis of the protocol shows that compared to cluster formation protocols secured with non-PVS-based key distribution schemes, it performs efficiently.", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "body sensor networks; efficiency; environmentally-coupled security; physiological values; secure cluster formation; usable security", } @Article{Wang:2010:DEE, author = "Zijian Wang and Eyuphan Bulut and Boleslaw K. Szymanski", title = "Distributed energy-efficient target tracking with binary sensor networks", journal = j-TOSN, volume = "6", number = "4", pages = "32:1--32:??", month = jul, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1777406.1777411", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:44 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Target tracking is a typical and important cooperative sensing application of wireless sensor networks. We study it in its most basic form, assuming a binary sensing model in which each sensor returns only 1-bit information regarding target's presence or absence within its sensing range. A novel, real-time and distributed target tracking algorithm is introduced. The algorithm is energy efficient and fault tolerant. It estimates the target location, velocity, and trajectory in a distributed and asynchronous manner. The accuracy of the algorithm is analytically derived under an ideal binary sensing model and extensive simulations of ideal, imperfect, and faulty sensing models show that the algorithm achieves good performance. It outperforms other published algorithms by yielding highly accurate estimates of the target's location, velocity, and trajectory.", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "binary sensor networks; distributed algorithms; energy efficient; target tracking", } @Article{Vedantam:2010:ADE, author = "Satish Vedantam and Urbashi Mitra and Ashutosh Sabharwal", title = "Asymptotic distortion exponents for the estimation of time-varying channels in multihop sensor networks", journal = j-TOSN, volume = "6", number = "4", pages = "33:1--33:??", month = jul, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1777406.1777412", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:44 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The problem of time-varying channel estimation in multihop sensor networks is examined. Two relay processing methods are explored: amplify-and-forward and encode-and-forward. Bounds on the end-to-end distortion for all internode channel estimates are computed for these two relay processing schemes. Performance is analyzed via the asymptotic limit of the decay rate of the end-to-end distortion with respect to SNR at high SNR. It is also established that asymptotically in SNR, amplify-and-forward can outperform encode-and-forward and in fact can achieve the maximum possible distortion exponent (distortion decay rate) order of unity. Linear and many-to-one topologies are then examined and it is shown that orthogonal access in the many-to-one network is optimal.", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "communication and estimation; joint communication and estimation; rate distortion theory", } @Article{Paek:2010:TAT, author = "Jeongyeup Paek and Ben Greenstein and Omprakash Gnawali and Ki-Young Jang and August Joki and Marcos Vieira and John Hicks and Deborah Estrin and Ramesh Govindan and Eddie Kohler", title = "The {Tenet} architecture for tiered sensor networks", journal = j-TOSN, volume = "6", number = "4", pages = "34:1--34:??", month = jul, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1777406.1777413", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:44 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Most sensor network research and software design has been guided by an architectural principle that permits multinode data fusion on small-form-factor, resource-poor nodes, or {\em motes}. While we were among the earliest promoters of this approach, through experience we found that this principle leads to fragile and unmanageable systems and explore an alternative. The {\em Tenet architecture\/} is motivated by the observation that future large-scale sensor network deployments will be {\em tiered}, consisting of motes in the lower tier and {\em masters}, relatively unconstrained 32-bit platform nodes, in the upper tier. Tenet constrains multinode fusion to the master tier while allowing motes to process locally-generated sensor data. This simplifies application development and allows mote-tier software to be reused. Applications running on masters {\em task\/} motes by composing task descriptions from a novel tasklet library. Our Tenet implementation also contains a robust and scalable networking subsystem for disseminating tasks and reliably delivering responses. We show that a Tenet pursuit-evasion application exhibits performance comparable to a mote-native implementation while being considerably more compact. We also present two real-world deployments of Tenet system: a structural vibration monitoring application at Vincent Thomas Bridge and an imaging-based habitat monitoring application at James Reserve, and show that tiered architecture scales network capacity and allows reliable delivery of high rate data.$^1$", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "motes; network architecture; sensor networks; tiered network", } @Article{Zhang:2010:RPA, author = "Lei Zhang and Ligang Liu and Craig Gotsman and Steven J. Gortler", title = "An as-rigid-as-possible approach to sensor network localization", journal = j-TOSN, volume = "6", number = "4", pages = "35:1--35:??", month = jul, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1777406.1777414", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:44 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present a novel approach to localization of sensors in a network given a subset of noisy inter-sensor distances. The algorithm is based on ``stitching'' together local structures by solving an optimization problem requiring the structures to fit together in an ``As-Rigid-As-Possible'' manner, hence the name ARAP. The local structures consist of reference ``patches'' and reference triangles, both obtained from inter-sensor distances. We elaborate on the relationship between the ARAP algorithm and other state-of-the-art algorithms, and provide experimental results demonstrating that ARAP is significantly less sensitive to sparse connectivity and measurement noise. We also show how ARAP may be distributed.", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "as-rigid-as-possible; embedding; localization; sensor networks", } @Article{Rowaihy:2010:SMA, author = "Hosam Rowaihy and Matthew P. Johnson and Ou Liu and Amotz Bar-Noy and Theodore Brown and Thomas La Porta", title = "Sensor-mission assignment in wireless sensor networks", journal = j-TOSN, volume = "6", number = "4", pages = "36:1--36:??", month = jul, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1777406.1777415", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Jul 15 18:24:44 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "When a sensor network is deployed, it is typically required to support multiple simultaneous missions. Schemes that assign sensing resources to missions thus become necessary. In this article, we formally define the sensor-mission assignment problem and discuss some of its variants. In its most general form, this problem is NP-hard. We propose algorithms for the different variants, some of which include approximation guarantees. We also propose distributed algorithms to assign sensors to missions which we adapt to include energy-awareness to extend network lifetime. Finally, we show comprehensive simulation results comparing these solutions to an upper bound on the optimal solution.", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "mission assignment; resource allocation; wireless sensor networks", } @Article{Kusy:2010:RDS, author = "Branislav Kus{\'y} and Isaac Amundson and Janos Sallai and Peter V{\"o}lgyesi and Akos L{\'e}deczi and Xenofon Koutsoukos", title = "{RF} {Doppler} shift-based mobile sensor tracking and navigation", journal = j-TOSN, volume = "7", number = "1", pages = "1:1--1:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1806895.1806896", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:33:47 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Mobile wireless sensors require position updates for tracking and navigation. We present a localization technique that uses the Doppler shift in radio transmission frequency observed by stationary sensors. We consider two scenarios. In the first, the mobile node is carried by a person. In the second, the mobile node controls a robot. In both approaches the mobile node transmits an RF signal, and infrastructure nodes measure the Doppler-shifted frequency. Such measurements enable us to calculate the position and velocity of the mobile transmitter. Our experimental results demonstrate that this technique is viable and accurate for resource-constrained mobile sensor tracking and navigation.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Doppler effect; localization; navigation; Sensor networks; tracking", } @Article{Zhang:2010:RTD, author = "Jun Zhang and Xiaohua Jia and Guoliang Xing", title = "Real-time data aggregation in contention-based wireless sensor networks", journal = j-TOSN, volume = "7", number = "1", pages = "2:1--2:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1806895.1806897", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:33:47 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We investigate the problem of delay constrained maximal information collection for CSMA-based wireless sensor networks. We study how to allocate the maximal allowable transmission delay at each node, such that the amount of information collected at the sink is maximized and the total delay for the data aggregation is within the given bound. We formulate the problem by using dynamic programming and propose an optimal algorithm for the optimal assignment of transmission attempts. Based on the analysis of the optimal solution, we propose a distributed greedy algorithm. It is shown to have a similar performance as the optimal one.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "CSMA/CA; data aggregation; delay constrained transmission; real-time traffic; Sensor networks", } @Article{Kwon:2010:RLS, author = "Youngmin Kwon and Kirill Mechitov and Sameer Sundresh and Wooyoung Kim and Gul Agha", title = "Resilient localization for sensor networks in outdoor environments", journal = j-TOSN, volume = "7", number = "1", pages = "3:1--3:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1806895.1806898", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:33:47 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The process of determining the physical locations of nodes in a wireless sensor network is known as {\em localization}. Self-localization is critical for large-scale sensor networks, because manual or assisted localization is often impractical due to time requirements, economic constraints, or inherent limitations of the deployment scenarios. We propose scalable solutions for reliably localizing wireless sensor networks in environments conducive to several types of ranging errors. We follow a hybrid hardware-software approach for acoustic ranging or radio interferometry to acquire internode distance measurements, and a resilient self-localization algorithm to compute the node location estimates. The acoustic ranging method improves on previous work, extending the practical measurement range up to 35 m in grassy outdoor environments, achieving a distance-invariant median measurement error of about 1\% (33 cm). The localization algorithm is based on {\em least-squares scaling\/} with soft constraints. Empirical evaluation using ranging results obtained from sensor network field experiments and simulations confirms that our approach is more resilient than multidimensional scaling (MDS) algorithms against large-magnitude ranging errors and sparse range measurements: conditions that are common in large-scale outdoor sensor network deployments.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "least-squares scaling; localization; MDS; multidimensional scaling; multilateration; Wireless sensor networks", } @Article{Sugihara:2010:SCS, author = "Ryo Sugihara and Rajesh K. Gupta", title = "Speed control and scheduling of data mules in sensor networks", journal = j-TOSN, volume = "7", number = "1", pages = "4:1--4:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1806895.1806899", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:33:47 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Unlike traditional multihop forwarding among stationary sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more attention. The use of mobility significantly reduces the energy consumption at sensor nodes, elongating the functional lifetime of the network. However, a drawback is an increased data delivery latency. Reducing the latency through optimizing the motion of data mules is critical for this approach to thrive. In this article, we focus on the problem of motion planning, specifically, determination of the speed of the data mule and the scheduling of the communication tasks with the sensors. We consider three models of mobility capability of the data mule to accommodate different types of vehicles. Under each mobility model, we design optimal and heuristic algorithms for different problems: single data mule case, single data mule with periodic data generation case, and multiple data mules case. We compare the performance of the heuristic algorithm with a naive algorithm and also with the multihop forwarding approach by numerical experiments. We also compare one of the optimal algorithms with a previously proposed method to see how our algorithm improves the performance and is also useful in practice. As far as we know, this study is the first of a kind that provides a systematic understanding of the motion planning problem of data mules.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Controlled mobility; linear programming; motion planning; scheduling; simulation", } @Article{Hu:2010:TTW, author = "Wen Hu and Hailun Tan and Peter Corke and Wen Chan Shih and Sanjay Jha", title = "Toward trusted wireless sensor networks", journal = j-TOSN, volume = "7", number = "1", pages = "5:1--5:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1806895.1806900", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:33:47 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article presents the design and implementation of a trusted sensor node that provides Internet-grade security at low system cost. We describe trustedFleck, which uses a commodity Trusted Platform Module (TPM) chip to extend the capabilities of a standard wireless sensor node to provide security services such as {\em message integrity, confidentiality, authenticity}, and {\em system integrity\/} based on RSA public-key and XTEA-based symmetric-key cryptography. In addition trustedFleck provides secure storage of private keys and provides platform configuration registers (PCRs) to store system configurations and detect code tampering. We analyze system performance using metrics that are important for WSN applications such as computation time, memory size, energy consumption and cost. Our results show that trustedFleck significantly outperforms previous approaches (e.g., TinyECC) in terms of these metrics while providing stronger security levels. Finally, we describe a number of examples, built on trustedFleck, of symmetric key management, secure RPC, secure software update, and {\em remote attestation}.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "public key (PK); remote attestation; RSA; TPM; trusted computing; Wireless sensor networks", } @Article{Miller:2010:RER, author = "Chris Miller and Christian Poellabauer", title = "Reliable and efficient reprogramming in sensor networks", journal = j-TOSN, volume = "7", number = "1", pages = "6:1--6:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1806895.1806901", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:33:47 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Retasking and remote programming of sensor networks is an essential functionality to make these networks practical and effective. As the availability of more capable sensor nodes increases and new functional implementations continue to be proposed, these large collections of wireless nodes will need the ability to update and upgrade the software packages they are running. In order to do this, the new binary file must be distributed to all nodes in the network. Making a physical connection with each individual node is impractical in large wireless networks. Standard flooding mechanisms are too energy-costly and computationally expensive and they may interfere with the network's current tasks. A reliable method for distributing new code or binary files to every node in a wireless sensor network is needed. We propose a reprogramming/retasking framework for sensor networks that is energy efficient, responsive, and reliable, while maintaining a stable network.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Broadcast; energy efficiency; minimum energy broadcast; reliable distribution; reprogramming; retasking; sensor networks", } @Article{Lim:2010:RRP, author = "Jun Bum Lim and Beakcheol Jang and Suyoung Yoon and Mihail L. Sichitiu and Alexander G. Dean", title = "{RaPTEX}: {Rapid} prototyping tool for embedded communication systems", journal = j-TOSN, volume = "7", number = "1", pages = "7:1--7:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1806895.1806902", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:33:47 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Advances in microprocessors, memory, and radio technology have enabled the emergence of embedded systems that rely on communication systems to exchange information and coordinate their activities in spatially distributed applications. However, developing embedded communication systems that satisfy specific application requirements is a challenge due to the many tradeoffs imposed by different choices of underlying protocols and their parameters. Furthermore, evaluating the correctness and performance of the design and implementation before deploying it is a nontrivial task due to the complexity of the resulting system. This article presents the design and implementation of RaPTEX, a rapid prototyping tool for embedded communication systems, especially well suited for wireless sensor networks (WSNs), consisting of three major subsystems: a toolbox, an analytical performance estimation framework, and an emulation environment. We use a hierarchical approach in the design of the toolbox to facilitate the composition of the network stack. For fast exploration of the tradeoff space at design time, we build an analytical performance estimation model for energy consumption, delay, and throughput. For realistic performance evaluation, we design and implement a hybrid, accurate, yet scalable, emulation environment. Through three use cases, we study the tradeoff space for different protocols and topologies, and highlight the benefits of using RaPTEX for designing and evaluating embedded communication systems for WSNs.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "analytical performance modeling; rapid prototyping tool; RaPTEX; real code simulation; TinyOS; Wireless sensor networks", } @Article{Wang:2010:MLL, author = "Chao Wang and Parameswaran Ramanathan and Kewal K. Saluja", title = "Modeling latency --- lifetime trade-off for target detection in mobile sensor networks", journal = j-TOSN, volume = "7", number = "1", pages = "8:1--8:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1806895.1806903", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:33:47 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Two important measures of performance for the surveillance applications of the mobile sensor networks are detection latency and system lifetime. Previous work on modeling detection delay has assumed that sensor measurements are delivered to the fusion center with zero delay. Such approaches can require excessive energy, resulting into reduced lifetime. This article argues that a trade-off between detection latency and system lifetime can be made by employing an energy aware transmission scheme. The article formulates the trade-off as an optimization problem, and presents an analytic method to model both detection latency and system lifetime. The model is substantiated by using simulation.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "energy efficiency; Mobile sensor networks; target detection", } @Article{Kalpakis:2010:ESA, author = "Konstantinos Kalpakis", title = "Everywhere sparse approximately optimal minimum energy data gathering and aggregation in sensor networks", journal = j-TOSN, volume = "7", number = "1", pages = "9:1--9:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1806895.1806904", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:33:47 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider two related data gathering problems for wireless sensor networks (WSNs). The MLDA problem is concerned with maximizing the system lifetime $T$ so that we can perform $T$ rounds of data gathering with in-network aggregation, given the initial available energy of the sensors. The $M^2$ EDA problem is concerned with minimizing the maximum energy consumed by any one sensor when performing $T$ rounds of data gathering with in-network aggregation, for a given $T$.\par We provide an effective algorithm for finding an everywhere sparse integral solution to the $M^2$ EDA problem which is within a factor of $\alpha = 1+ 4 n / T$ of the optimum, where $n$ is the number of nodes. A solution is everywhere sparse if the number of communication links for any subset $X$ of nodes is $O(X)$, in our case at most $4 |X|$. Since often $T = \omega(n)$, we obtain the first everywhere sparse, asymptotically optimal integral solutions to the $M^2$ EDA problem. Everywhere sparse solutions are desirable since then almost all sensors have small number of incident communication links and small overhead for maintaining state.\par We also show that the MLDA and $M^2$ EDA problems are essentially equivalent, in the sense that we can obtain an optimal fractional solution to an instance of the MLDA problem by scaling an optimal fractional solution to a suitable instance of the $M^2$ EDA problem. As a result, our algorithm is effective at finding everywhere sparse, asymptotically optimal, integral solutions to the MLDA problem, when the initial available energy of the sensors is sufficient for supporting optimal system lifetime which is $\omega(n)$.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Energy management; in-network aggregation; lifetime maximization; sparsity communication topology; wireless sensor networks", } @Article{Langendoen:2010:AMPa, author = "Koen Langendoen and Andreas Meier", title = "Analyzing {MAC} protocols for low data-rate applications", journal = j-TOSN, volume = "7", number = "1", pages = "10:1--10:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1806895.1806905", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:33:47 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The fundamental wireless sensors network (WSN) requirement to be energy-efficient has produced a whole range of specialized medium access control (MAC) protocols. They differ in how performance (latency, throughput) is traded off for a reduction in energy consumption. The question ``which protocol is best?'' is difficult to answer because (i) this depends on specific details of the application requirements and hardware characteristics involved, and (ii) protocols have mainly been assessed individually with each outperforming the canonical S-MAC protocol, but with different simulators, hardware platforms, and workloads. This article addresses that void for low data-rate applications where collisions are of little concern, making an analytical approach tractable in which latency and energy consumption are modeled as functions of key protocol parameters (duty cycle, slot length, number of slots, etc.). By exhaustive search we determine the Pareto-optimal protocol settings for a given workload (data rate, network topology). Of the protocols compared we find that WiseMAC strikes the best latency versus energy-consumption tradeoff across the range of workloads considered. In particular, its random access scheme in combination with local synchronization not only minimizes protocol overhead, but also maximizes the available channel bandwidth.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Energy efficiency; performance modeling; sensor networks", } @Article{Martin:2010:KPH, author = "Keith M. Martin and Maura B. Paterson and Douglas R. Stinson", title = "Key predistribution for homogeneous wireless sensor networks with group deployment of nodes", journal = j-TOSN, volume = "7", number = "2", pages = "11:1--11:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1824766.1824767", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:03 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Recent literature contains proposals for key predistribution schemes for sensor networks in which nodes are deployed in separate groups. In this article we consider the implications of group deployment for the connectivity and resilience of a key predistribution scheme. We propose a flexible scheme, based on the structure of a resolvable transversal design. We demonstrate that this scheme permits effective trade-offs between resilience, connectivity and storage requirements within a group-deployed environment as compared with other schemes in the literature, and show that group deployment can be used to increase network connectivity, without increasing storage requirements or sacrificing resilience.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Group-based deployment; key predistribution; wireless sensor networks", } @Article{Liaskovitis:2010:LRS, author = "Periklis G. Liaskovitis and Curt Schurgers", title = "Leveraging redundancy in sampling-interpolation applications for sensor networks: a spectral approach", journal = j-TOSN, volume = "7", number = "2", pages = "12:1--12:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1824766.1824768", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:03 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "An important class of sensor network applications aims at estimating the spatiotemporal behavior of a physical phenomenon, such as temperature variations over an area of interest. In such a scenario, the network essentially acts as a distributed sampling system. However, unlike in the event detection case, the notion of sensing range is largely meaningless for sampling-interpolation applications. As a result, existing techniques to exploit sensing redundancy in event detection settings, which rely on the existence of such sensing range, become unusable. Instead, this article presents a new method to exploit redundancy for the sampling class of applications by selecting a suitable set of sensors to act as sampling points. Through online estimation of process characteristics, sufficiently accurate interpolation can be achieved. We illustrate an algorithm to obtain multiple disjoint sets and demonstrate significant reductions in the number of active sensors for a wide range of synthetic sensor data.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "energy efficiency; Hilbert space; sampling; sensing topology management; Sensor networks; sensor selection; spatial monitoring", } @Article{Machado:2010:CPC, author = "Renita Machado and Wensheng Zhang and Guiling Wang and Sirin Tekinay", title = "Coverage properties of clustered wireless sensor networks", journal = j-TOSN, volume = "7", number = "2", pages = "13:1--13:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1824766.1824769", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:03 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article studies clustered wireless sensor networks (WSNs), a realistic topology resulting from common deployment methods. We study coverage in {\em naturally clustered\/} networks of wireless sensor nodes, as opposed to WSNs where clustering is facilitated by selection. We show that along with increasing the vacancy in random placement of nodes in a WSN, it also alters the connectivity properties in the network. We analyze varying levels of redundancy to determine the probability of coverage in the network. The phenomenon of clustering in networks of wireless sensor nodes raises interesting questions for future research and development. The article provides a foundation for the design to optimize network performance with the constraint of sensing coverage.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "clustering; coverage; Wireless sensor networks", } @Article{Jurcik:2010:DWC, author = "Petr Jurcik and Anis Koub{\^a}a and Ricardo Severino and M{\'a}rio Alves and Eduardo Tovar", title = "Dimensioning and worst-case analysis of cluster-tree sensor networks", journal = j-TOSN, volume = "7", number = "2", pages = "14:1--14:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1824766.1824770", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:03 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Modeling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand their behavior under the worst-case conditions and to make the appropriate design choices. This is particular relevant for time-sensitive WSN applications, where the timing behavior of the network protocols (message transmission must respect deadlines) impacts on the correct operation of these applications. In that direction this article contributes with a methodology based on Network Calculus, which enables quick and efficient worst-case dimensioning of static or even dynamically changing cluster-tree WSNs where the data sink can either be static or mobile. We propose closed-form recurrent expressions for computing the worst-case end-to-end delays, buffering and bandwidth requirements across any source-destination path in a cluster-tree WSN. We show how to apply our methodology to the case of IEEE 802.15.4/ZigBee cluster-tree WSNs. Finally, we demonstrate the validity and analyze the accuracy of our methodology through a comprehensive experimental study using commercially available technology, namely TelosB motes running TinyOS.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Cluster-tree; IEEE 802.15.4; network calculus; network dimensioning; sensor networks; worst-case analysis; ZigBee", } @Article{Mottola:2010:AWS, author = "Luca Mottola and Gian Pietro Picco and Matteo Ceriotti and {\c{S}}tefan Gun{\u{a}} and Amy L. Murphy", title = "Not all wireless sensor networks are created equal: a comparative study on tunnels", journal = j-TOSN, volume = "7", number = "2", pages = "15:1--15:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1824766.1824771", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:03 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks (WSNs) are envisioned for a number of application scenarios. Nevertheless, the few in-the-field experiences typically focus on the features of a specific system, and rarely report about the characteristics of the target environment, especially with respect to the behavior and performance of low-power wireless communication. The TRITon project, funded by our local administration, aims to improve safety and reduce maintenance costs of road tunnels, using a WSN-based control infrastructure. The access to real tunnels within TRITon gives us the opportunity to experimentally assess the peculiarities of this environment, hitherto not investigated in the WSN field. We report about three deployments: (i) an operational road tunnel, enabling us to assess the impact of vehicular traffic; (ii) a nonoperational tunnel, providing insights into analogous scenarios (e.g., underground mines) without vehicles; (iii) a vineyard, serving as a baseline representative of the existing literature. Our setup, replicated in each deployment, uses mainstream WSN hardware, and popular MAC and routing protocols. We analyze and compare the deployments with respect to reliability, stability, and asymmetry of links, the accuracy of link quality estimators, and the impact of these aspects on MAC and routing layers. Our analysis shows that a number of criteria commonly used in the design of WSN protocols do not hold in tunnels. Therefore, our results are useful for designing networking solutions operating efficiently in similar environments.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "link quality; low-power wireless communications; network topologies; topology characterization; tunnel environment; Wireless sensor networks", } @Article{Strasser:2010:DRJ, author = "Mario Strasser and Boris Danev and Srdjan {\v{C}}apkun", title = "Detection of reactive jamming in sensor networks", journal = j-TOSN, volume = "7", number = "2", pages = "16:1--16:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1824766.1824772", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:03 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "An integral part of most security- and safety-critical applications is a dependable and timely alarm notification. However, owing to the resource constraints of wireless sensor nodes (i.e., their limited power and spectral diversity), ensuring a timely and jamming-resistant delivery of alarm messages in applications that rely on wireless sensor networks is a challenging task. With current alarm forwarding schemes, blocking of an alarm by jamming is straightforward and jamming is very likely to remain unnoticed. In this work, we propose a novel jamming detection scheme as a solution to this problem. Our scheme is able to identify the cause of bit errors for individual packets by looking at the received signal strength during the reception of these bits and is well-suited for the protection of reactive alarm systems with very low network traffic. We present three different techniques for the identification of bit errors based on: predetermined knowledge, error correcting codes, and limited node wiring. We perform a detailed evaluation of the proposed solution and validate our findings experimentally with Chipcon CC1000 radios. The results show that our solution effectively detects sophisticated jamming attacks that cannot be detected with existing techniques and enables the formation of robust sensor networks for dependable delivery of alarm notifications. Our scheme also meets the high demands on the energy efficiency of reactive surveillance applications as it can operate without introducing additional wireless network traffic.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Jamming detection; reactive jamming; sensor networks", } @Article{Paschalidis:2010:SAD, author = "Ioannis Ch. Paschalidis and Yin Chen", title = "Statistical anomaly detection with sensor networks", journal = j-TOSN, volume = "7", number = "2", pages = "17:1--17:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1824766.1824773", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:03 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We seek to detect statistically significant temporal or spatial changes in either the underlying process the sensor network is monitoring or in the network operation itself. These changes may point to faults, adversarial threats, misbehavior, or other anomalies that require intervention. To that end, we introduce a new statistical anomaly detection framework that uses Markov models to characterize the ``normal'' behavior of the sensor network. We develop a series of Markov models, including tree-indexed Markov chains which can model its spatial structure. For each model, an anomaly-free probability law is estimated from past traces. We leverage large deviations techniques to develop optimal anomaly detection rules for each corresponding Markov model, assessing whether its most recent empirical measure is consistent with the anomaly-free probability law. A series of simulation results, some with real sensor data, validate the effectiveness of the proposed anomaly detection algorithms.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "anomaly detection; large deviations; Sensor networks", } @Article{Yau:2010:QMS, author = "David K. Y. Yau and Nung Kwan Yip and Chris Y. T. Ma and Nageswara S. V. Rao and Mallikarjun Shankar", title = "Quality of monitoring of stochastic events by periodic and proportional-share scheduling of sensor coverage", journal = j-TOSN, volume = "7", number = "2", pages = "18:1--18:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1824766.1824774", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:03 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We analyze the quality of monitoring (QoM) of stochastic events by a periodic sensor which monitors a point of interest (PoI) for $q$ time every $p$ time. We show how the amount of information captured at a PoI is affected by the proportion $q/p$, the time interval $p$ over which the proportion is achieved, the event type in terms of its stochastic arrival dynamics and staying times and the utility function. The periodic PoI sensor schedule happens in two broad contexts. In the case of static sensors, a sensor monitoring a PoI may be periodically turned off to conserve energy, thereby extending the lifetime of the monitoring until the sensor can be recharged or replaced. In the case of mobile sensors, a sensor may move between the PoIs in a repeating visit schedule. In this case, the PoIs may vary in importance, and the scheduling objective is to distribute the sensor's coverage time in proportion to the importance levels of the PoIs. Based on our QoM analysis, we optimize a class of periodic mobile coverage schedules that can achieve such proportional sharing while maximizing the QoM of the total system.", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "mobile coverage; periodic scheduling; proportional sharing; Sensor network", } @Article{Langendoen:2010:AMPb, author = "Koen Langendoen and Andreas Meier", title = "Analyzing {MAC} protocols for low data-rate applications", journal = j-TOSN, volume = "7", number = "2", pages = "19:1--19:??", month = aug, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1824766.1824775", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:03 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The fundamental WSN requirement to be energy-efficient has produced a whole range of specialized Medium Access Control (MAC) protocols. They differ in how performance (latency, throughput) is traded off for a reduction in energy consumption. The question ``which protocol is best?'' is difficult to answer because (i) this depends on specific details of the application requirements and hardware characteristics involved, and (ii) protocols have mainly been assessed individually with each outperforming the canonical S-MAC protocol, but with different simulators, hardware platforms, and workloads. This article addresses that void for low data-rate applications where collisions are of little concern, making an analytical approach tractable in which latency and energy consumption are modeled as a function of key protocol parameters (duty cycle, slot length, number of slots, etc.). By exhaustive search we determine the Pareto-optimal protocol settings for a given workload (data rate, network topology). Of the protocols compared we find that WiseMAC strikes the best latency vs. energy-consumption trade-off across the range of workloads considered. In particular, its random access scheme in combination with local synchronization does not only minimize protocol overhead, but also maximizes the available channel bandwidth.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Energy efficiency; performance modeling; sensor networks", } @Article{Paek:2010:RRC, author = "Jeongyeup Paek and Ramesh Govindan", title = "{RCRT}: {Rate-controlled} reliable transport protocol for wireless sensor networks", journal = j-TOSN, volume = "7", number = "3", pages = "20:1--20:??", month = sep, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1807048.1807049", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:21 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Emerging high-rate applications (imaging, structural monitoring, acoustic localization) will need to transport large volumes of data concurrently from several sensors. These applications are also loss-intolerant. A key requirement for such applications, then, is a protocol that reliably transports sensor data from many sources to one or more sinks without incurring congestion collapse. In this article, we discuss RCRT, a rate-controlled reliable transport protocol suitable for constrained sensor nodes. RCRT uses end-to-end explicit loss recovery, but places all the congestion detection and rate adaptation functionality in the sinks. This has two important advantages: efficiency and flexibility. Because sinks make rate allocation decisions, they are able to achieve greater efficiency since they have a more comprehensive view of network behavior. For the same reason, it is possible to alter the rate allocation decisions (for example, from one that ensures that all nodes get the same rate, to one that ensures that nodes get rates in proportion to their demands), without modifying sensor code at all. We evaluate RCRT extensively on a 40-node wireless sensor network testbed and show that RCRT achieves 1.7 times the rate achieved by IFRC and 1.4 times that of WRCP, two recently proposed interference-aware distributed rate-control protocols. We also present results from a 3-month-long 19-node real world deployment of RCRT in an imaging application and show that RCRT works well in real long-term deployments.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "centralized; congestion control; reliable; Sensor networks; tiered network; transport protocol", } @Article{Chin:2010:ILL, author = "Jren-Chit Chin and Nageswara S. V. Rao and David K. Y. Yau and Mallikarjun Shankar and Yong Yang and Jennifer C. Hou and Srinivasagopalan Srivathsan and Sitharama Iyengar", title = "Identification of low-level point radioactive sources using a sensor network", journal = j-TOSN, volume = "7", number = "3", pages = "21:1--21:??", month = sep, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1807048.1807050", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:21 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Identification of a low-level point radioactive source amidst background radiation is achieved by a network of radiation sensors using a two-step approach. Based on measurements from three or more sensors, a geometric difference triangulation method or an $N$-sensor localization method is used to estimate the location and strength of the source. Then a sequential probability ratio test based on current measurements and estimated parameters is employed to finally decide: (1) the presence of a source with the estimated parameters, or (2) the absence of the source, or (3) the insufficiency of measurements to make a decision. This method achieves specified levels of false alarm and missed detection probabilities, while ensuring a close-to-minimal number of measurements for reaching a decision. This method minimizes the ghost-source problem of current estimation methods, and achieves a lower false alarm rate compared with current detection methods. This method is tested and demonstrated using: (1) simulations, and (2) a test-bed that utilizes the scaling properties of point radioactive sources to emulate high intensity ones that cannot be easily and safely handled in laboratory experiments.", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "detection and localization; Point radioactive source; sequential probability ratio test", } @Article{Zheng:2010:ODD, author = "Rong Zheng and Khuong Vu and Amit Pendharkar and Gangbing Song", title = "Obstacle discovery in distributed actuator and sensor networks", journal = j-TOSN, volume = "7", number = "3", pages = "22:1--22:??", month = sep, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1807048.1807051", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:21 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Distributed active sensing is a new sensing paradigm, where active sensors (aka actuators) as illuminating sources and passive sensors as receivers are distributed in a field, and collaboratively detect events of interest. In this paper, we study the fundamental properties of distributed actuator and sensor networks (DASNs) in detecting and localizing obstacles. A novel notion of ``exposure'' is defined, which quantifies the dimension limitations in detectability. Using simple geometric constructs, we propose polynomial-time algorithms to compute the exposure and bounding regions where the center of the obstacles may lie.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Active sensing; conflict regions; exposure; Segment Voronoi Diagram", } @Article{Djidjev:2010:AAC, author = "Hristo N. Djidjev", title = "Approximation algorithms for computing minimum exposure paths in a sensor field", journal = j-TOSN, volume = "7", number = "3", pages = "23:1--23:??", month = sep, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1807048.1807052", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:21 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The exposure of a path $p$ in a sensor field is a measure of the likelihood that an object traveling along $p$ is detected by at least one sensor from a network of sensors, and is formally defined as an integral over all points $x$ of $p$ of the sensibility (the strength of the signal coming from $x$) times the element of path length. The minimum exposure path (MEP) problem is, given a pair of points $x$ and $y$ inside a sensor field, to find a path between $x$ and $y$ of minimum exposure. In this article we introduce the first rigorous treatment of the problem, designing an approximation algorithm for the MEP problem with guaranteed performance characteristics. Given a convex polygon $p$ of size $n$ with $O(n)$ sensors inside it and any real number $\epsilon > 0$, our algorithm finds a path in $p$ whose exposure is within a $1 + \epsilon$ factor of the exposure of the MEP, in time $O(n / \epsilon^2 \psi \log n)$, where $\psi$ is a geometric characteristic of the field. We also describe a framework for a faster implementation of our algorithm, which reduces the time by a factor of approximately $\theta (1 / \epsilon)$, while keeping the same approximation ratio.", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "approximation algorithms; coverage; minimum exposure paths; Sensor networks; shortest paths", } @Article{Schmid:2010:ICP, author = "Thomas Schmid and Roy Shea and Zainul Charbiwala and Jonathan Friedman and Mani B. Srivastava and Young H. Cho", title = "On the interaction of clocks, power, and synchronization in duty-cycled embedded sensor nodes", journal = j-TOSN, volume = "7", number = "3", pages = "24:1--24:??", month = sep, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1807048.1807053", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:21 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The efficiency of the time synchronization service in wireless sensor networks is tightly connected to the design of the radio, the quality of the clocking hardware, and the synchronization algorithm employed. While improvements can be made on all levels of the system, over the last few years most work has focused on the algorithmic level to minimize message exchange and in radio architectures to provide accurate time-stamping mechanisms. Surprisingly, the influences of the underlying clock system and its impact on the overall synchronization accuracy has largely been unstudied.\par In this work, we investigate the impact of the clocking subsystem on the time synchronization service and address, in particular, the influence of changes in environmental temperature on clock drift in highly duty-cycled wireless sensor nodes. We also develop formulas that help the system architect choose the optimal resynchronization period to achieve a given synchronization accuracy. We find that the synchronization accuracy has a two region behavior. In the first region, the synchronization accuracy is limited by quantization error, while int he second region changes in environmental temperature impact the achievable accuracy. We verify our analytic results in simulation and real hardware experiments.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "clocks; duty-cycling; Oscillator; temperature effects; time synchronization", } @Article{Peleg:2010:LSC, author = "David Peleg and Liam Roditty", title = "Localized spanner construction for ad hoc networks with variable transmission range", journal = j-TOSN, volume = "7", number = "3", pages = "25:1--25:??", month = sep, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1807048.1807054", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:21 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article presents an algorithm for constructing a spanner for ad hoc networks whose nodes have {\em variable\/} transmission range. Almost all previous spanner constructions for ad hoc networks assumed that all nodes in the network have the same transmission range. This allowed a succinct representation of the network as a unit disk graph, serving as the basis for the construction. In contrast, when nodes have variable transmission range, the ad hoc network must be modeled by a general disk graph. Whereas unit disk graphs are undirected, general disk graphs are directed. This complicates the construction of a spanner for the network, since currently there are no efficient constructions of low-stretch spanners for general directed graphs. Nevertheless, in this article it is shown that the class of disk graphs enjoys (efficiently constructible) spanners of quality similar to that of unit disk graph spanners. Moreover, it is shown that the new construction can be performed in a localized fashion. Our results use only simple packing arguments, hence all algorithms work for every metric space of constant doubling dimension.", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "Directed graphs; distributed algorithms; spanners", } @Article{Ling:2010:APA, author = "Yibei Ling and Chung-Min Chen and Shigang Chen", title = "Analysis of power-aware buffering schemes in wireless sensor networks", journal = j-TOSN, volume = "7", number = "3", pages = "26:1--26:??", month = sep, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1807048.1807055", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:21 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We study the power-aware buffering problem in battery-powered sensor networks, focusing on the fixed-size and fixed-interval buffering schemes. The main motivation is to address the yet poorly understood size variation-induced effect on power-aware buffering schemes. Our theoretical analysis elucidates the fundamental differences between the fixed-size and fixed-interval buffering schemes in the presence of data-size variation. It shows that data-size variation has detrimental effects on the power expenditure of the fixed-size buffering in general, and reveals that the size variation induced effects can be either mitigated by a positive skewness or promoted by a negative skewness in size distribution. By contrast, the fixed-interval buffering scheme has an obvious advantage of being eminently immune to the data-size variation. Hence the fixed-interval buffering scheme is a risk-averse strategy for its robustness in a variety of operational environments. In addition, based on the fixed-interval buffering scheme, we establish the power consumption relationship between child nodes and parent node in a static data-collection tree, and give an in-depth analysis of the impact of child bandwidth distribution on the parent's power consumption.\par This study is of practical significance: it sheds new light on the relationship among power consumption of buffering schemes, power parameters of radio module and memory bank, data arrival rate, and data-size variation, thereby providing well-informed guidance in determining an optimal buffer size (interval) to maximize the operational lifespan of sensor networks.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "algorithm analysis; Power-aware buffering schemes", } @Article{Efrat:2010:FDA, author = "Alon Efrat and David Forrester and Anand Iyer and Stephen G. Kobourov and Cesim Erten and Ozan Kilic", title = "Force-directed approaches to sensor localization", journal = j-TOSN, volume = "7", number = "3", pages = "27:1--27:??", month = sep, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1807048.1807057", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Oct 8 18:34:21 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "As the number of applications of sensor networks increases, so does the interest in sensor network localization, that is, in recovering the correct position of each node in a network of sensors from partial connectivity information such as adjacency, range, or angle between neighboring nodes. In this article, we consider the anchor-free localization problem in sensor networks that report possibly noisy range information and angular information about the relative order of each sensor's neighbors. Previously proposed techniques seem to successfully reconstruct the original positions of the nodes for relatively small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with nonconvex or nonsimple underlying topology. Moreover, the distributed nature of the problem makes some of the centralized techniques inapplicable in distributed settings. To address these problems we describe a multiscale dead-reckoning (MSDR) algorithm that scales well for large networks, can reconstruct complex underlying topologies, and is resilient to noise. The MSDR algorithm takes its roots from classic force-directed graph layout computation techniques. These techniques are augmented with a multiscale extension to handle the scalability issue and with a dead-reckoning extension to overcome the problems arising with nonsimple topologies. Furthermore, we show that the distributed version of the MSDR algorithm performs as well as, if not better than, its centralized counterpart, as shown by the quality of the layout, measured in terms of the accuracy of the computed pairwise distances between sensors in the network.", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", keywords = "force-directed; node localization; Sensor networks", } @Article{Holland:2011:OPL, author = "Matthew Holland and Tianqi Wang and Bulent Tavli and Alireza Seyedi and Wendi Heinzelman", title = "Optimizing physical-layer parameters for wireless sensor networks", journal = j-TOSN, volume = "7", number = "4", pages = "28:1--28:??", month = feb, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1921621.1921622", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Mar 28 11:54:52 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chan:2011:SFP, author = "Aldar C-F. Chan and Claude Castelluccia", title = "A security framework for privacy-preserving data aggregation in wireless sensor networks", journal = j-TOSN, volume = "7", number = "4", pages = "29:1--29:??", month = feb, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1921621.1921623", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Mar 28 11:54:52 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Panta:2011:EIC, author = "Rajesh Krishna Panta and Saurabh Bagchi and Samuel P. Midkiff", title = "Efficient incremental code update for sensor networks", journal = j-TOSN, volume = "7", number = "4", pages = "30:1--30:??", month = feb, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1921621.1921624", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Mar 28 11:54:52 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Krause:2011:RSP, author = "Andreas Krause and Carlos Guestrin and Anupam Gupta and Jon Kleinberg", title = "Robust sensor placements at informative and communication-efficient locations", journal = j-TOSN, volume = "7", number = "4", pages = "31:1--31:??", month = feb, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1921621.1921625", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Mar 28 11:54:52 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wan:2011:EEC, author = "Chieh-Yih Wan and Shane B. Eisenman and Andrew T. Campbell", title = "Energy-efficient congestion detection and avoidance in sensor networks", journal = j-TOSN, volume = "7", number = "4", pages = "32:1--32:??", month = feb, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1921621.1921626", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Mar 28 11:54:52 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2011:OSM, author = "Guiling Wang and Mary Jane Irwin and Haoying Fu and Piotr Berman and Wensheng Zhang and Tom La Porta", title = "Optimizing sensor movement planning for energy efficiency", journal = j-TOSN, volume = "7", number = "4", pages = "33:1--33:??", month = feb, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1921621.1921627", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Mar 28 11:54:52 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Keeler:2011:MFG, author = "Holger P. Keeler and Peter G. Taylor", title = "A model framework for greedy routing in a sensor network with a stochastic power scheme", journal = j-TOSN, volume = "7", number = "4", pages = "34:1--34:??", month = feb, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1921621.1921628", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Mar 28 11:54:52 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Cai:2011:CSD, author = "Haiyan Cai and Xiaohua Jia and Mo Sha", title = "Critical sensor density for partial connectivity in large area wireless sensor networks", journal = j-TOSN, volume = "7", number = "4", pages = "35:1--35:??", month = feb, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1921621.1921629", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Mar 28 11:54:52 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhu:2011:SNL, author = "Yuanchen Zhu and Steven J. Gortler and Dylan Thurston", title = "Sensor network localization using sensor perturbation", journal = j-TOSN, volume = "7", number = "4", pages = "36:1--36:??", month = feb, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1921621.1921630", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Mar 28 11:54:52 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Sugihara:2011:PPD, author = "Ryo Sugihara and Rajesh K. Gupta", title = "Path Planning of Data Mules in Sensor Networks", journal = j-TOSN, volume = "8", number = "1", pages = "1:1--1:??", month = aug, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1993042.1993043", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Sep 5 17:03:48 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2011:MMR, author = "Xiaorui Wang and Xiaodong Wang and Xing Fu and Guoliang Xing", title = "{MCRT}: Multichannel Real-Time Communications in Wireless Sensor Networks", journal = j-TOSN, volume = "8", number = "1", pages = "2:1--2:??", month = aug, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1993042.1993044", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Sep 5 17:03:48 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Dereszynski:2011:SMD, author = "Ethan W. Dereszynski and Thomas G. Dietterich", title = "Spatiotemporal Models for Data-Anomaly Detection in Dynamic Environmental Monitoring Campaigns", journal = j-TOSN, volume = "8", number = "1", pages = "3:1--3:??", month = aug, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1993042.1993045", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Sep 5 17:03:48 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Sarkar:2011:HSG, author = "Rik Sarkar and Xianjin Zhu and Jie Gao", title = "Hierarchical Spatial Gossip for Multiresolution Representations in Sensor Networks", journal = j-TOSN, volume = "8", number = "1", pages = "4:1--4:??", month = aug, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1993042.1993046", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Sep 5 17:03:48 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Singh:2011:MTT, author = "Jaspreet Singh and Rajesh Kumar and Upamanyu Madhow and Subhash Suri and Richard Cagley", title = "Multiple-Target Tracking With Binary Proximity Sensors", journal = j-TOSN, volume = "8", number = "1", pages = "5:1--5:??", month = aug, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1993042.1993047", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Sep 5 17:03:48 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{He:2011:PPP, author = "Wenbo He and Xue Liu and Hoang Viet Nguyen and Klara Nahrstedt and Tarek Abdelzaher", title = "{PDA}: Privacy-Preserving Data Aggregation for Information Collection", journal = j-TOSN, volume = "8", number = "1", pages = "6:1--6:??", month = aug, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1993042.1993048", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Sep 5 17:03:48 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{DiFrancesco:2011:DCW, author = "Mario {Di Francesco} and Sajal K. Das and Giuseppe Anastasi", title = "Data Collection in Wireless Sensor Networks with Mobile Elements: a Survey", journal = j-TOSN, volume = "8", number = "1", pages = "7:1--7:??", month = aug, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1993042.1993049", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Sep 5 17:03:48 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Busnel:2011:ADT, author = "Yann Busnel and Leonardo Querzoni and Roberto Baldoni and Marin Bertier and Anne-Marie Kermarrec", title = "Analysis of Deterministic Tracking of Multiple Objects Using a Binary Sensor Network", journal = j-TOSN, volume = "8", number = "1", pages = "8:1--8:??", month = aug, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1993042.1993050", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Sep 5 17:03:48 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2011:DSS, author = "Qian Wang and Kui Ren and Shucheng Yu and Wenjing Lou", title = "Dependable and Secure Sensor Data Storage with Dynamic Integrity Assurance", journal = j-TOSN, volume = "8", number = "1", pages = "9:1--9:??", month = aug, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1145/1993042.1993051", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Sep 5 17:03:48 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ayday:2012:DAA, author = "Erman Ayday and Farshid Delgosha and Faramarz Fekri", title = "Data authenticity and availability in multihop wireless sensor networks", journal = j-TOSN, volume = "8", number = "2", pages = "10:1--10:??", month = mar, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2140522.2140523", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Apr 6 18:38:19 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Security services such as data confidentiality, authenticity, and availability are critical in wireless sensor networks (WSNs) deployed in adversarial environments. Due to the resource constrain's of sensor nodes, the existing protocols currently in use in adhoc networks cannot be employed in WSNs. In this article, we propose a protocol called location-aware network-coding security (LNCS) that provides all the aforementioned security services. By dividing the terrain into nonoverlapping cells, the nodes take advantage of the location information to derive different location-binding keys. The key idea in LNCS is that all the nodes involved in the protocol collaborate in every phase. We employ random network coding in order to provide data availability significantly higher than that in other schemes. A hash tree-based authentication mechanism is utilized to filter the bogus packets enroute. We provide a comparison between our scheme and previously proposed schemes. The results reveal significant improvement in data availability while maintaining the same level of data confidentiality and authenticity.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Shirmohammadi:2012:SLS, author = "Babak Shirmohammadi and Camillo J. Taylor", title = "Self-localizing smart camera networks", journal = j-TOSN, volume = "8", number = "2", pages = "11:1--11:??", month = mar, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2140522.2140524", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Apr 6 18:38:19 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article describes a novel approach to localizing networks of embedded cameras and sensors. In this scheme, the cameras and the sensors are equipped with controllable light sources (either visible or infrared), which are used for signaling. Each camera node can then determine automatically the bearing to all of the nodes that are visible from its vantage point. By fusing these measurements with the measurements obtained from onboard accelerometers, the camera nodes are able to determine the relative positions and orientations of other nodes in the network. The method uses angular measurements derived from images, rather than range measurements derived from time-of-flight or signal attenuation. The scheme can be implemented relatively easily with commonly available components, and it scales well since the localization calculations exploit the sparse structure of the system of measurements. Additionally, the method provides estimates of camera orientation which cannot be determined solely from range measurements. The localization technology could serve as a basic capability on which higher-level applications could be built. The method could also be used to automatically survey the locations of sensors of interest, to implement distributed surveillance systems, or to analyze the structure of a scene, based on images obtained from multiple registered vantage points. It also provides a mechanism for integrating the imagery obtained from the cameras with the measurements obtained from distributed sensors.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Karumbu:2012:DOE, author = "Premkumar Karumbu and Venkata K. Prasanthi and Anurag Kumar", title = "Delay optimal event detection on ad hoc wireless sensor networks", journal = j-TOSN, volume = "8", number = "2", pages = "12:1--12:??", month = mar, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2140522.2140525", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Apr 6 18:38:19 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider a small extent sensor network for event detection, in which nodes periodically take samples and then contend over a random access network to transmit their measurement packets to the fusion center. We consider two procedures at the fusion center for processing the measurements. The Bayesian setting, is assumed, that is, the fusion center has a prior distribution on the change time. In the first procedure, the decision algorithm at the fusion center is network--oblivious and makes a decision only when a complete vector of measurements taken at a sampling instant is available. In the second procedure, the decision algorithm at the fusion center is network--aware and processes measurements as they arrive, but in a time-causal order. In this case, the decision statistic depends on the network delays, whereas in the network--oblivious case, the decision statistic does not. This yields a Bayesian change-detection problem with a trade-off between the random network delay and the decision delay that is, a higher sampling rate reduces the decision delay but increases the random access delay. Under periodic sampling, in the network--oblivious case, the structure of the optimal stopping rule is the same as that without the network, and the optimal change detection delay decouples into the network delay and the optimal decision delay without the network. In the network--aware case, the optimal stopping problem is analyzed as a partially observable Markov decision process, in which the states of the queues and delays in the network need to be maintained. A sufficient decision statistic is the network state and the posterior probability of change having occurred, given the measurements received and the state of the network. The optimal regimes are studied using simulation.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chang:2012:PRS, author = "Shih-Ying Chang and Yue-Hsun Lin and Hung-Min Sun and Mu-En Wu", title = "Practical {RSA} signature scheme based on periodical rekeying for wireless sensor networks", journal = j-TOSN, volume = "8", number = "2", pages = "13:1--13:??", month = mar, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2140522.2140526", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Apr 6 18:38:19 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Broadcast is an efficient communication channel on wireless sensor networks. Through authentic broadcast, deployed sensors can perform legitimate actions issued by a base station. According to previous literature, a complete solution for authentic broadcast is digital signature based on asymmetric cryptography. However, asymmetric cryptography utilizes expensive operations, which result in computational bottlenecks. Among these cryptosystems, Elliptic Curve Cryptography (ECC) seems to be the most efficient and the most popular choice. Unfortunately, signature verification in ECC is not efficient enough. In this article, we propose an authentic broadcast scheme based on RSA. Unlike conventional approaches, the proposed scheme adopts short moduli to enhance performance. Meanwhile, the weakness of short moduli can be fixed with rekeying strategies. To minimize the rekeying overhead, a Multi-Modulus RSA generation algorithm, which can reduce communication overhead by 50\%, is proposed. We implemented the proposed scheme on MICAz. On 512-bit moduli, each verification spends at most 0.077 seconds, which is highly competitive with other public-key cryptosystems.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Cao:2012:ITM, author = "Zhen Cao and Hui Deng and Zhi Guan and Zhong Chen", title = "Information-theoretic modeling of false data filtering schemes in wireless sensor networks", journal = j-TOSN, volume = "8", number = "2", pages = "14:1--14:??", month = mar, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2140522.2140527", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Apr 6 18:38:19 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "False data filtering schemes are designed to filter out false data injected by malicious sensors; they keep the network immune to bogus event reports. Theoretic understanding of false data filtering schemes and guidelines to further improve their designs are still lacking. This article first presents an information-theoretic model of false data filtering schemes. From the information-theoretic view, we define the scheme's filtering capacity C$_{F i}$ as the uncertainty-reduction ratio of the target input variable, given the output. This metric not only performs better than existing metrics but also implies that only by optimizing the false negative rate and false positive rate simultaneously, can we promote a scheme's overall performance. Based on the investigation from the modeling efforts, we propose HiFi, a hybrid authentication-based false data filtering scheme. HiFi leverages the benefits of both symmetric and asymmetric cryptography and achieves a high filtering capacity, as well as low computation and communication overhead. Performance analysis demonstrates that our proposed metric is rational and useful, and that HiFi is effective and energy efficient.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Sun:2012:QCC, author = "Xusheng Sun and Edward J. Coyle", title = "Quantization, channel compensation, and optimal energy allocation for estimation in sensor networks", journal = j-TOSN, volume = "8", number = "2", pages = "15:1--15:??", month = mar, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2140522.2140528", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Apr 6 18:38:19 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In clustered networks of wireless sensors, each sensor collects noisy observations of the environment, quantizes these observations into a local estimate of finite length, and forwards them through one or more noisy wireless channels to the cluster head (CH). The measurement noise is assumed to be zero-mean and have finite variance, and each wireless hop is modeled as a binary symmetric channel (BSC) with a known crossover probability. A novel scheme is proposed that uses dithered quantization and channel compensation to ensure that each sensor's local estimate received by the CH is unbiased. The CH fuses these unbiased local estimates into a global one, using a best linear unbiased estimator (BLUE). Analytical and simulation results show that the proposed scheme can achieve much smaller mean square error (MSE) than two other common schemes, while using the same amount of energy. The sensitivity of the proposed scheme to errors in estimates of the crossover probability of the BSC channel is studied by both analysis and simulation. We then determine both the minimum energy required for the network to produce an estimate with a prescribed error variance and how this energy must be allocated amongst the sensors in the multihop network.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Erdem:2012:EPH, author = "U{\u{g}}ur Murat Erdem and Stan Sclaroff", title = "Event prediction in a hybrid camera network", journal = j-TOSN, volume = "8", number = "2", pages = "16:1--16:??", month = mar, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2140522.2140529", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Apr 6 18:38:19 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Given a hybrid camera layout-one containing, for example, static and active cameras-and people moving around following established traffic patterns, our goal is to predict a subset of cameras, respective camera parameter settings, and future time windows that will most likely lead to success the vision tasks, such as, face recognition when a camera observes an event of interest. We propose an adaptive probabilistic model that accrues temporal camera correlations over time as the cameras report observed events. No extrinsic, intrinsic, or color calibration of cameras is required. We efficiently obtain the camera parameter predictions using a modified Sequential Monte Carlo method. We demonstrate the performance of the model in an example face detection scenario in both simulated and real environment experiments, using several active cameras.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Eswaran:2012:UBB, author = "Sharanya Eswaran and Archan Misra and Flavio Bergamaschi and Thomas La Porta", title = "Utility-based bandwidth adaptation in mission-oriented wireless sensor networks", journal = j-TOSN, volume = "8", number = "2", pages = "17:1--17:??", month = mar, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2140522.2140530", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Apr 6 18:38:19 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article develops a utility-based optimization framework for resource sharing by multiple competing missions in a mission-oriented wireless sensor network (WSN) environment. Prior work on network utility maximization (NUM) based optimization has focused on unicast flows with sender-based utilities in either wireline or wireless networks. In this work, we develop a generalized NUM model to consider three key new features observed in mission-centric WSN environments: (i) the definition of the utility of an individual mission (receiver) as a joint function of data from multiple sensor sources; (ii) the consumption of each sender's (sensor) data by multiple missions; and (iii) the multicast-tree-based dissemination of each sensor's data flow, using link-layer broadcasts to exploit the ``wireless broadcast advantage'' in data forwarding. We show how a price-based, distributed protocol (WSN-NUM) can ensure optimal and proportionally fair rate allocation across multiple missions, without requiring any coordination among missions or sensors. We also discuss techniques to improve the speed of convergence of the protocol, which is essential in an environment as dynamic as the WSN. Further, we analyze the impact of various network and protocol parameters on the bandwidth utilization of the network, using a discrete-event simulation of a stationary wireless network. Finally, we corroborate our simulation-based performance results of the WSN-NUM protocol with an implementation of an 802.11b network.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ilyas:2012:DPA, author = "Muhammad U. Ilyas and Hayder Radha", title = "A dynamic programming approach to maximizing a statistical measure of the lifetime of sensor networks", journal = j-TOSN, volume = "8", number = "2", pages = "18:1--18:??", month = mar, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2140522.2140531", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Apr 6 18:38:19 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The inherent many-to-one flow of traffic in wireless sensor networks (WSNs) produces a skewed distribution of energy consumption rates, leading to the early demise of those sensors that are critical to the ability of surviving nodes to communicate their measurements to the base station. Numerous previous approaches aimed at balancing the consumption of energy in wireless networks are either too complex or do not address problems unique to the flow of traffic in WSNs. In this article, we propose the use of a dynamic programming algorithm (DPA), an operational, low-complexity algorithm, used in conjunction with four different route discovery algorithms. We perform complexity analysis, statistical evaluation of changes in power consumption rates effected, and verify spatial redistribution of energy consumption of sensors in the network. Our results on multihop networks of 100 randomly placed nodes show that, on average, the two best performing variants of DPA yield a reduction of up to 28\% and 36\% in power consumption rate variance at the cost of raising average power consumption by 15\% and 21\%, respectively. Computational complexities of DPA variants range from $O(N^3)$ to $O(N^4)$, which is significantly lower than linear search of the solution space of $O(N!^{N i})$. Analysis by diffusion plots shows that DPA reduces power consumption of sensors that experience the highest power consumption under the shortest path routes.", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Cucuringu:2012:SNL, author = "Mihai Cucuringu and Yaron Lipman and Amit Singer", title = "Sensor network localization by eigenvector synchronization over the {Euclidean} group", journal = j-TOSN, volume = "8", number = "3", pages = "19:1--19:??", month = jul, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240092.2240093", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:35 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present a new approach to localization of sensors from noisy measurements of a subset of their Euclidean distances. Our algorithm starts by finding, embedding, and aligning uniquely realizable subsets of neighboring sensors called patches. In the noise-free case, each patch agrees with its global positioning up to an unknown rigid motion of translation, rotation, and possibly reflection. The reflections and rotations are estimated using the recently developed eigenvector synchronization algorithm, while the translations are estimated by solving an overdetermined linear system. The algorithm is scalable as the number of nodes increases and can be implemented in a distributed fashion. Extensive numerical experiments show that it compares favorably to other existing algorithms in terms of robustness to noise, sparse connectivity, and running time. While our approach is applicable to higher dimensions, in the current article, we focus on the two-dimensional case.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Xiong:2012:CBP, author = "Kaiqi Xiong and Ronghua Wang and Wenliang Du and Peng Ning", title = "Containing bogus packet insertion attacks for broadcast authentication in sensor networks", journal = j-TOSN, volume = "8", number = "3", pages = "20:1--20:??", month = jul, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240092.2240094", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:35 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Broadcast is a critical communication primitive in wireless sensor networks. The multihop nature of sensor networks makes it necessary for sensor nodes to forward broadcast messages so that the messages can reach an entire network. Authentication of broadcast messages is an important but challenging problem in sensor networks. Public key cryptography (PKC) has been used recently to address this problem. However, PKC-based authentication techniques are susceptible to bogus packet insertion attacks in which attackers keep broadcasting bogus messages and force resource-constrained sensor nodes to forward such messages. Moreover, because it takes time to do signature verifications, it is impractical for each node to authenticate every received message before forwarding it. In this article, we propose a dynamic window scheme to thwart the aforementioned bogus packet insertion attacks which permits sensor nodes to efficiently broadcast messages. Within this scheme, a sensor node has the ability to determine whether or not to verify an incoming message before forwarding the message. We further study the property of this dynamic window scheme and investigate the best strategy for thwarting bogus packet insertion attacks. We propose three strategies for finding the optimal parameters by an improved additive increase multiplicative decrease (AIMD) window updating function so that the proposed dynamic window scheme can achieve the best overall performance with respect to the authentication and forwarding times of messages. Numerical validations show that our proposed scheme performs very well in terms of energy saving and broadcast delays based on three different metrics, including average authentication delays, the percentage of nodes receiving fake messages, and the percentage of nodes forwarding fake messages.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wettergren:2012:OMP, author = "Thomas A. Wettergren and Russell Costa", title = "Optimal multiobjective placement of distributed sensors against moving targets", journal = j-TOSN, volume = "8", number = "3", pages = "21:1--21:??", month = jul, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240092.2240095", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:35 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider the optimal deployment of a sparse network of sensors against moving targets, under multiple conflicting objectives of search. The sensor networks of interest consist of sensors which perform independent binary detection on a target, and report detections to a central control authority. A multiobjective optimization framework is developed to find optimal trade-offs as a function of sensor deployment, between the conflicting objectives of maximizing the Probability of Successful Search ( P$_{SS}$ ) and minimizing the Probability of False Search ( P$_{FS}$ ), in a bounded search region of interest. The search objectives are functions of unknown sensor locations (represented parametrically by a probability density function), given sensor performance parameters, statistical priors on target behavior, and distributed detection criteria. Numerical examples illustrating the utility of this approach for varying target behaviors are given.", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Johnson:2012:MMB, author = "Matthew P. Johnson and Deniz Sari{\"o}z and Amotz Bar-Noy and Theodore Brown and Dinesh Verma and Chai W. Wu", title = "More is more: The benefits of denser sensor deployment", journal = j-TOSN, volume = "8", number = "3", pages = "22:1--22:??", month = jul, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240092.2240096", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:35 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Positioning disk-shaped sensors to optimize certain coverage parameters is a fundamental problem in ad hoc sensor networks. The hexagon lattice arrangement is known to be optimally efficient in the plane, even though 20.9\% of the area is unnecessarily covered twice, however, the arrangement is very rigid-any movement of a sensor from its designated grid position (due to, e.g., placement error or obstacle avoidance) leaves some region uncovered, as would the failure of any one sensor. In this article, we consider how to arrange sensors in order to guarantee multiple coverage, that is, $k$-coverage for some value $k > 1$. A naive approach is to superimpose multiple hexagon lattices, but for robustness reasons, we may wish to space sensors evenly apart. We present two arrangement methods for $k$-coverage: (1) optimizing a Riesz energy function in order to evenly distribute nodes, and (2) simply shrinking the hexagon lattice and making it denser. The first method often approximates the second, and so we focus on the latter. We show that a density increase tantamount to $k$ copies of the lattice can yield $k'$-coverage, for $k' > k$ (e.g., $k = 11$, $k' = 12$ and $k = 21$, $k' = 24$), by exploiting the double-coverage regions. Our examples' savings provably converge in the limit to the $\approx 20.9\%$ maximum. We also provide analogous results for the square lattice and its $\approx 57\%$ inefficiency (e.g., $k = 3$, $k' = 4$ and $k = 5$, $k' = 7$) and show that for multi-coverage for some values of $k'$, the square lattice can actually be more efficient than the hexagon lattice. We also explore other benefits of shrinking the lattice: Doing so allows all sensors to move about their intended positions independently while nonetheless guaranteeing full coverage and can also allow us to tolerate probabilistic sensor failure when providing $1$-coverage or $k$-coverage. We conclude by construing the shrinking factor as a budget to be divided among these three benefits.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ni:2012:SND, author = "Kevin Ni and Greg Pottie", title = "Sensor network data fault detection with maximum a posteriori selection and {Bayesian} modeling", journal = j-TOSN, volume = "8", number = "3", pages = "23:1--23:??", month = jul, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240092.2240097", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:35 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Current sensor networks experience many faults that hamper the ability of scientists to draw significant inferences. We develop a method to systematically identify when these faults occur so that proper corrective action can be taken. We propose an adaptable modular framework that can utilize different modeling methods and approaches to identifying trustworthy sensors. We focus on using hierarchical Bayesian space-time (HBST) modeling to model the phenomenon of interest, and use maximum a posteriors selection to identify a set of trustworthy sensors. Compared to an analogous linear autoregressive system, we achieve excellent fault detection when the HBST model accurately represents the phenomenon.", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bartolini:2012:SAR, author = "Novella Bartolini and Tiziana Calamoneri and Tom {La Porta} and Chiara Petrioli and Simone Silvestri", title = "Sensor activation and radius adaptation {(SARA)} in heterogeneous sensor networks", journal = j-TOSN, volume = "8", number = "3", pages = "24:1--24:??", month = jul, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240092.2240098", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:35 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In order to prolong the lifetime of a wireless sensor network (WSN) devoted to monitoring an area of interest, a useful means is to exploit network redundancy, activating only the sensors that are strictly necessary for coverage and making them work with the minimum necessary sensing radius. In this article, we introduce the first algorithm that reduces sensor coverage redundancy through joint Sensor Activation and sensing Radius Adaptation (SARA) in general application scenarios comprising two classes of devices: sensors with variable sensing radius and sensors with fixed sensing radius. This device heterogeneity is explicitly addressed by modeling the coverage problem through Voronoi-Laguerre diagrams that, differently from Voronoi diagrams, allow for correctly identifying each sensor coverage region depending on the sensor current radius and the radii of its neighboring nodes. SARA executes quickly with guaranteed termination and, given the currently available nodes, it always guarantees maximum coverage. By means of extensive simulations, we show that SARA obtains remarkable improvements with respect to previous solutions, ensuring, in networks with heterogeneous nodes, longer network lifetime and wider coverage.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Iwanicki:2012:CHR, author = "Konrad Iwanicki and Maarten {Van Steen}", title = "A case for hierarchical routing in low-power wireless embedded networks", journal = j-TOSN, volume = "8", number = "3", pages = "25:1--25:??", month = jul, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240092.2240099", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:35 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Hierarchical routing has often been mentioned as an appealing point-to-point routing technique for wireless sensor networks (sensornets). While there is a volume of analytical and high-level simulation results demonstrating its merits, there has been little work evaluating it in actual sensornet settings. This article bridges the gap between theory and practice. Having analyzed a number of proposed hierarchical routing protocols, we have developed a framework that captures the common characteristics of the protocols and identifies design points at which the protocols differ. We use a sensornet implementation of the framework in TOSSIM and on a 60-node testbed to study various trade-offs that hierarchical routing introduces, as well as to compare the performance of hierarchical routing with the performance of other routing techniques, namely shortest-path routing, compact routing, and beacon vector routing. The results show that hierarchical routing is a compelling routing technique also in practice. In particular, despite only logarithmic routing state, it can offer small routing stretch: an average of $ \aprox $ 1.25 and a 99th percentile of 2. It can also be robust, minimizing the maintenance traffic or the latency of reacting to changes in the network. Moreover, the trade-offs offered by hierarchical routing are attractive for many sensornet applications when compared to the other routing techniques. For example, in terms of routing state, hierarchical routing can offer scalability at least an order of magnitude better than compact routing, and at the same time, in terms of routing stretch, its performance is within 10--15\% of that of compact routing; in addition, this performance can further be tuned to a particular application. Finally, we also identify a number of practical issues and limitations of which we believe sensornet developers adopting hierarchical routing should be aware.", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Karakaya:2012:CEC, author = "Mahmut Karakaya and Hairong Qi", title = "Coverage estimation for crowded targets in visual sensor networks", journal = j-TOSN, volume = "8", number = "3", pages = "26:1--26:??", month = jul, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240092.2240100", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:35 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Coverage estimation is one of the fundamental problems in sensor networks. Coverage estimation in visual sensor networks (VSNs) is more challenging than in conventional 1-D (omnidirectional) scalar sensor networks (SSNs) because of the directional sensing nature of cameras and the existence of visual occlusion in crowded environments. This article represents a first attempt toward a closed-form solution for the visual coverage estimation problem in the presence of occlusions. We investigate a new target detection model, referred to as the certainty-based target detection (as compared to the traditional uncertainty-based target detection ) to facilitate the formulation of the visual coverage problem. We then derive the closed-form solution for the estimation of the visual coverage probability based on this new target detection model that takes visual occlusions into account. According to the coverage estimation model, we further propose an estimate of the minimum sensor density that suffices to ensure a visual K-coverage in a crowded sensing field. Simulation is conducted which shows extreme consistency with results from theoretical formulation, especially when the boundary effect is considered. Thus, the closed-form solution for visual coverage estimation is effective when applied to real scenarios, such as efficient sensor deployment and optimal sleep scheduling.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Misra:2012:LPB, author = "Sudip Misra and Sweta Singh", title = "Localized policy-based target tracking using wireless sensor networks", journal = j-TOSN, volume = "8", number = "3", pages = "27:1--27:??", month = jul, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240092.2240101", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:35 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless Sensor Networks (WSN)-based surveillance applications necessitate tracking a target's trajectory with a high degree of precision. Further, target tracking schemes should consider energy consumption in these resource-constrained networks. In this work, we propose an energy-efficient target tracking algorithm, which minimizes the number of nodes in the network that should be activated for tracking the movement of the target. We model the movement of a target based on the Gauss Markov Mobility Model [Camp et al. 2002]. On detecting a target, the cluster head which detects it activates an optimal number of nodes within its cluster, so that these nodes start sensing the target. A Markov Decision Process (MDP)-based framework is designed to adaptively determine the optimal policy for selecting the nodes localized with each cluster. As the distance between the node and the target decreases, the Received Signal Strength (RSS) increases, thereby increasing the precision of the readings of sensing the target at each node. Simulations show that our proposed algorithm is energy-efficient. Also, the accuracy of the tracked trajectory varies between 50\% to 1\% over time.", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Gabale:2012:PMT, author = "Vijay Gabale and Kameswari Chebrolu and Bhaskaran Raman and Sagar Bijwe", title = "{PIP}: a multichannel, {TDMA}-based {MAC} for efficient and scalable bulk transfer in sensor networks", journal = j-TOSN, volume = "8", number = "4", pages = "28:1--28:??", month = sep, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240116.2240117", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:36 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we consider the goal of achieving high throughput in a wireless sensor network. Our work is set in the context of those wireless sensor network applications which collect and transfer bulk data. We present PIP (Packets in Pipe), a MAC primitive for use by the transport module to achieve high throughput. PIP has a unique set of features: (a) it is a multihop connection-oriented primitive, (b) it is TDMA based, (c) it uses multiple radio channels, and (d) it is centrally controlled. This represents a significant shift from prior MAC protocols for bulk data transfer. PIP has several desirable properties: (a) its throughput degrades only slightly with increasing number of hops, (b) it is robust to variable wireless error rates, (c) it performs well even without any flow control, and (d) requires only small queue sizes to operate well. We substantiate these properties with a prototype implementation of PIP on the Tmote-Sky CC2420-based platform. PIP achieves about eleven times better throughput than the state-of-the-art prior work, over a network depth of 24 hops. We also show that PIP can be interagted with duty cycling, and that PIP can support streaming data from/to flash at little overhead.", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Dyo:2012:WDD, author = "Vladimir Dyo and Stephen A. Ellwood and David W. Macdonald and Andrew Markham and Niki Trigoni and Ricklef Wohlers and Cecilia Mascolo and Bence P{\'a}sztor and Salvatore Scellato and Kharsim Yousef", title = "{WILDSENSING}: Design and deployment of a sustainable sensor network for wildlife monitoring", journal = j-TOSN, volume = "8", number = "4", pages = "29:1--29:??", month = sep, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240116.2240118", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:36 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The increasing adoption of wireless sensor network technology in a variety of applications, from agricultural to volcanic monitoring, has demonstrated their ability to gather data with unprecedented sensing capabilities and deliver it to a remote user. However, a key issue remains how to maintain these sensor network deployments over increasingly prolonged deployments. In this article, we present the challenges that were faced in maintaining continual operation of an automated wildlife monitoring system over a one-year period. This system analyzed the social colocation patterns of European badgers ( Meles meles ) residing in a dense woodland environment using a hybrid RFID-WSN approach. We describe the stages of the evolutionary development, from implementation, deployment, and testing, to various iterations of software optimization, followed by hardware enhancements, which in turn triggered the need for further software optimization. We highlight the main lessons learned: the need to factor in the maintenance costs while designing the system; to consider carefully software and hardware interactions; the importance of rapid prototyping for initial deployment (this was key to our success); and the need for continuous interaction with domain scientists which allows for unexpected optimizations.", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Dutta:2012:MVE, author = "Prabal Dutta and Stephen Dawson-Haggerty and Yin Chen and Chieh-Jan Mike Liang and Andreas Terzis", title = "{A-MAC}: a versatile and efficient receiver-initiated link layer for low-power wireless", journal = j-TOSN, volume = "8", number = "4", pages = "30:1--30:??", month = sep, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240116.2240119", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:36 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present A-MAC, a receiver-initiated link layer for low-power wireless networks that supports several services under a unified architecture, and does so more efficiently and scalably than prior approaches. A-MAC's versatility stems from layering unicast, broadcast, wakeup, pollcast, and discovery above a single, flexible synchronization primitive. A-MAC's efficiency stems from optimizing this primitive and with it the most consequential decision that a low-power link makes: whether to stay awake or go to sleep after probing the channel. Today's receiver-initiated protocols require more time and energy to make this decision, and they exhibit worse judgment as well, leading to many false positives and negatives, and lower packet delivery ratios. A-MAC begins to make this decision quickly, and decides more conclusively and correctly in both the negative and affirmative. A-MAC's scalability comes from reserving one channel for the initial handshake and different channels for data transfer. Our results show that: (i) a unified implementation is possible; (ii) A-MAC's idle listening power increases by just 1.12$\times$ under interference, compared to 17.3$\times$ for LPL and 54.7$\times$ for RI-MAC; (iii) A-MAC offers high single-hop delivery ratios; (iv) network wakeup is faster and more channel efficient than LPL; and (v) collection routing performance exceeds the state-of-the-art.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Guha:2012:ALT, author = "Santanu Guha and Kurt Plarre and Daniel Lissner and Somnath Mitra and Bhagavathy Krishna and Prabal Dutta and Santosh Kumar", title = "{AutoWitness}: Locating and tracking stolen property while tolerating {GPS} and radio outages", journal = j-TOSN, volume = "8", number = "4", pages = "31:1--31:??", month = sep, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240116.2240120", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:36 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present AutoWitness, a system to deter, detect, and track personal property theft, improve historically dismal stolen property recovery rates, and disrupt stolen property distribution networks. A property owner embeds a small tag inside the asset to be protected, where the tag lies dormant until it detects vehicular movement. Once moved, the tag uses inertial sensor-based dead reckoning to estimate position changes, but to reduce integration errors, the relative position is reset whenever the sensors indicate the vehicle has stopped. The sequence of movements, stops, and turns are logged in compact form and eventually transferred to a server using a cellular modem after both sufficient time has passed (to avoid detection) and RF power is detectable (hinting cellular access may be available). Eventually, the trajectory data are sent to a server which attempts to match a path to the observations. The algorithm uses a Hidden Markov Model of city streets and Viterbi decoding to estimate the most likely path. The proposed design leverages low-power radios and inertial sensors, is immune to intransit cloaking, and supports post hoc path reconstruction. Our prototype demonstrates technical viability of the design; the volume market forces driving machine-to-machine communications will soon make the design economically viable.", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhu:2012:ALT, author = "Ting Zhu and Yu Gu and Tian He and Zhi-Li Zhang", title = "Achieving long-term operation with a capacitor-driven energy storage and sharing network", journal = j-TOSN, volume = "8", number = "4", pages = "32:1--32:??", month = sep, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240116.2240121", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:36 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Energy is the most precious resource in sensor networks. The ability to move energy around makes it feasible to build distributed energy storage systems that can robustly extend the lifetime of networked sensor systems. eShare supports the concept of energy sharing among multiple embedded sensor devices by providing designs for energy routers (i.e., energy storage and routing devices) and related energy access and network protocols. In a nutshell, energy routers exchange energy sharing control information using their data network while sharing energy freely among connected embedded sensor devices using their energy network. To improve sharing efficiency subject to energy leakage, we develop an effective energy charging and discharging mechanism using an array of ultra-capacitors as the main component of an energy router. We extensively evaluate our system under seven real-world settings. Results indicate our charging and discharging control can effectively minimize the energy leaked away. Moreover, the energy sharing protocol can quantitatively share 113J energy with 96.82\% accuracy in less than 2 seconds.", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wu:2012:SSM, author = "Xiaopei Wu and Mingyan Liu and Yue Wu", title = "In-situ soil moisture sensing: Optimal sensor placement and field estimation", journal = j-TOSN, volume = "8", number = "4", pages = "33:1--33:??", month = sep, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240116.2240122", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:36 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We study the problem of optimal sensor placement in the context of soil moisture sensing. We show that the soil moisture data possesses some unique features that can be used together with the commonly used Gaussian assumption to construct more scalable, robust, and better performing placement algorithms. Specifically, there exists a coarse-grained monotonic ordering of locations in their soil moisture level over time, both in terms of its first and second moments, a feature much more stable than the soil moisture process itself at these locations. This motivates a clustered sensor placement scheme, where locations are classified into clusters based on the ordering of the mean, with the number of sensors placed in each cluster determined by the ordering of the variances. We show that under idealized conditions the greedy mutual information maximization algorithm applied globally is equivalent to that applied cluster by cluster, but the latter has the advantage of being more scalable. Extensive numerical experiments are performed on a set of three-dimensional soil moisture data generated by a state-of-the-art soil moisture simulator. Our results show that our clustering approach outperforms applying the same algorithms globally, and is very robust to lack of training and errors in training data.", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Baccour:2012:RLQ, author = "Nouha Baccour and Anis Koub{\^a}a and Luca Mottola and Marco Antonio Z{\'u}{\~n}iga and Habib Youssef and Carlo Alberto Boano and M{\'a}rio Alves", title = "Radio link quality estimation in wireless sensor networks: a survey", journal = j-TOSN, volume = "8", number = "4", pages = "34:1--34:??", month = sep, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240116.2240123", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:36 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Radio link quality estimation in Wireless Sensor Networks (WSNs) has a fundamental impact on the network performance and also affects the design of higher-layer protocols. Therefore, for about a decade, it has been attracting a vast array of research works. Reported works on link quality estimation are typically based on different assumptions, consider different scenarios, and provide radically different (and sometimes contradictory) results. This article provides a comprehensive survey on related literature, covering the characteristics of low-power links, the fundamental concepts of link quality estimation in WSNs, a taxonomy of existing link quality estimators, and their performance analysis. To the best of our knowledge, this is the first survey tackling in detail link quality estimation in WSNs. We believe our efforts will serve as a reference to orient researchers and system designers in this area.", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Nath:2012:TAH, author = "Swaprava Nath and Venkatesan N. Ekambaram and Anurag Kumar and P. Vijay Kumar", title = "Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks", journal = j-TOSN, volume = "8", number = "4", pages = "35:1--35:??", month = sep, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240116.2240124", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:36 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Choi:2012:NFE, author = "Wook Choi and Giacomo Ghidini and Sajal K. Das", title = "A novel framework for energy-efficient data gathering with random coverage in wireless sensor networks", journal = j-TOSN, volume = "8", number = "4", pages = "36:1--36:??", month = sep, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2240116.2240125", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Nov 6 18:02:36 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In wireless sensor networks, different applications feature different requirements in terms of such performance metrics as sensing coverage and data reporting latency. In most applications, it is usually sufficient to provide a Desired Sensing Coverage (DSC) lower than full coverage at any instance with the guarantee that the whole area will eventually be covered within a specified delay bound. Due to the fact that these applications are also expected to run for longer periods of time and at the same time battery recharging and replacement are costly, energy consumption in wireless sensor networks should be minimized while achieving the application goals. In this article, we propose a novel framework for application-specific data gathering which exploits a trade-off between coverage and latency, thereby minimizing energy consumption and extending the network lifetime. The proposed energy-efficient, constant-time, randomized scheme, called Coverage-Adaptive raNdom SEnsor sElection (CANSEE), selects a subset of k sensors to report at each round so as to fulfill the application-specific requirement of desired sensing coverage and bounded latency, instead of always guaranteeing full coverage and minimum latency. We present a probabilistic model to estimate: (i) the connectivity of those selected k sensors and the number of additional sensors needed to guarantee connectivity; (ii) a lower bound on k in each round; and (iii) the probability of almost surely having k data reporters using the Chernoff bound. The immediate event detection capability achieved by the proposed CANSEE scheme is also analyzed to compare the performance of our framework with other data gathering schemes that allow 100\% coverage. Simulation results demonstrate that our framework leads to a significant conservation of energy (and thus extended network lifetime) with a small trade-off between coverage and data reporting latency, yet providing the required data reporting capability.", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Osborne:2012:RTI, author = "Michael A. Osborne and Stephen J. Roberts and Alex Rogers and Nicholas R. Jennings", title = "Real-time information processing of environmental sensor network data using {Bayesian Gaussian} processes", journal = j-TOSN, volume = "9", number = "1", pages = "1:1--1:??", month = nov, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2379799.2379800", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:51 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we consider the problem faced by a sensor network operator who must infer, in real time, the value of some environmental parameter that is being monitored at discrete points in space and time by a sensor network. We describe a powerful and generic approach built upon an efficient multi-output Gaussian process that facilitates this information acquisition and processing. Our algorithm allows effective inference even with minimal domain knowledge, and we further introduce a formulation of Bayesian Monte Carlo to permit the principled management of the hyperparameters introduced by our flexible models. We demonstrate how our methods can be applied in cases where the data is delayed, intermittently missing, censored, and/or correlated. We validate our approach using data collected from three networks of weather sensors and show that it yields better inference performance than both conventional independent Gaussian processes and the Kalman filter. Finally, we show that our formalism efficiently reuses previous computations by following an online update procedure as new data sequentially arrives, and that this results in a four-fold increase in computational speed in the largest cases considered.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Boers:2012:SCI, author = "Nicholas M. Boers and Ioanis Nikolaidis and Pawel Gburzynski", title = "Sampling and classifying interference patterns in a wireless sensor network", journal = j-TOSN, volume = "9", number = "1", pages = "2:1--2:??", month = nov, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2379799.2379801", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:51 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The low-powered transmissions in a wireless sensor network (WSN) are highly susceptible to interference from external sources. Our work is a step towards enabling WSN devices to better understand the interference in their environment so that they can adapt to it and communicate more efficiently. We extend our previous work in which we collected received signal strength traces using mote-class synchronized receivers at sample rates that are, to the best of our knowledge, higher than previously described in the literature. These traces contain distinct interference patterns, each with a different potential for being exploited by cognitive radio strategies. In order to exploit a pattern, however, a node must first recognize it. Given the energy and space constraints of a node, we explore succinct decision tree classifiers for the two most disruptive patterns. We expand on a basic feature set to incorporate attributes based on the dip statistic and the Lomb periodogram, both of which address specific, empirically observed behaviour, and we show their positive impact on both the decision tree structure and the overall classification performance. Moreover, we present an approximation of the periodogram that makes its construction feasible for mote-class devices, and we describe the simplification's impact on classification performance.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhang:2012:ACI, author = "Jun Zhang and Xiaohua Jia and Yuan Zhou", title = "Analysis of capacity improvement by directional antennas in wireless sensor networks", journal = j-TOSN, volume = "9", number = "1", pages = "3:1--3:??", month = nov, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2379799.2379802", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:51 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article we analyze capacity improvement by directional antennas over omni antennas in wireless sensor networks. The capacity in our analysis is the end-to-end per-node throughput. We analyze the typical traffic pattern for sensor networks, where traffics are destined to or originated from the sink. The main results of our analysis are summarized as follows. (1) The network capacity is $ O (1 / N) $ for both omni and directional antennas, where $N$ is the number of sensor nodes in the network. (2) In the case of line deployment, the capacity ratio of directional antennas over omni antennas is bounded by $ (2 q + 3) / (2 q - 1) $, where q is the ratio of the interference radius to the transmission radius. (3) In the case of two-dimensional deployment, the capacity for using directional antennas is $ O(1 / \theta) $ for $ m = 2 $, and $ O (\lg m / \theta^2 \lg (1 / \theta)) $ for $ m > 2 $, where $m$ is the number of radios (antennas) on each node and \theta is the beamwidth of antennas. (4) When there are $ n > 1 $ sinks, the capacity has a non-monotonic relationship with the transmission radius. The optimal transmission radius depends on the ratio of $ n / q $. (5) The capacity ratio of directional antennas over omni antennas in multi-channel networks decreases as the channel number/radio number ratio $ c / m $ increases.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liang:2012:DSE, author = "Jinling Liang and Zidong Wang and Bo Shen and Xiaohui Liu", title = "Distributed state estimation in sensor networks with randomly occurring nonlinearities subject to time delays", journal = j-TOSN, volume = "9", number = "1", pages = "4:1--4:??", month = nov, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2379799.2379803", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:51 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article is concerned with a new distributed state estimation problem for a class of dynamical systems in sensor networks. The target plant is described by a set of differential equations disturbed by a Brownian motion and randomly occurring nonlinearities (RONs) subject to time delays. The RONs are investigated here to reflect network-induced randomly occurring regulation of the delayed states on the current ones. Through available measurement output transmitted from the sensors, a distributed state estimator is designed to estimate the states of the target system, where each sensor can communicate with the neighboring sensors according to the given topology by means of a directed graph. The state estimation is carried out in a distributed way and is therefore applicable to online application. By resorting to the Lyapunov functional combined with stochastic analysis techniques, several delay-dependent criteria are established that not only ensure the estimation error to be globally asymptotically stable in the mean square, but also guarantee the existence of the desired estimator gains that can then be explicitly expressed when certain matrix inequalities are solved. A numerical example is given to verify the designed distributed state estimators.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kasirajan:2012:NDA, author = "Priya Kasirajan and Carl Larsen and S. Jagannathan", title = "A new data aggregation scheme via adaptive compression for wireless sensor networks", journal = j-TOSN, volume = "9", number = "1", pages = "5:1--5:??", month = nov, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2379799.2379804", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:51 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Data aggregation is necessary for extending the network lifetime of wireless sensor nodes with limited processing and power capabilities, since energy expended in transmitting a single data bit would be at least several orders of magnitude higher when compared to that needed for a 32-bit computation. Therefore, in this article, a novel nonlinear adaptive pulse coded modulation-based compression (NADPCMC) scheme is proposed for data aggregation in a wireless sensor network (WSN). The NADPCMC comprises of two estimators-one at the source or transmitter and the second one at the destination node. The estimator at the source node approximates the data value for each sample. The difference between the data sample and its estimate is quantized and transmitted to the next hop node instead of the actual data sample, thus reducing the amount of data transmission and rending energy savings. A similar estimator at the next hop node or base station reconstructs the original data. It is demonstrated that repeated application of the NADPCMC scheme along the route in a WSN results in data aggregation. Satisfactory performance of the proposed scheme in terms of distortion, compression ratio, and energy efficiency and in the presence of estimation and quantization errors for data aggregation is demonstrated using the Lyapunov approach. Then the performance of the proposed scheme is contrasted with the available compression schemes in an NS-2 environment through several benchmarking datasets. Simulation and hardware results demonstrate that almost 50\% energy savings with low distortion levels below 5\% and low overhead are observed when compared to no compression. Iteratively applying the proposed compression scheme at the cluster head nodes along the routes over the network yields an additional improvement of 20\% in energy savings per aggregation with an overall distortion below 8\%.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Shuai:2012:TMP, author = "Zaihong Shuai and Sangseok Yoon and Songhwai Oh and Ming-Hsuan Yang", title = "Traffic modeling and prediction using sensor networks: Who will go where and when?", journal = j-TOSN, volume = "9", number = "1", pages = "6:1--6:??", month = nov, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2379799.2379805", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:51 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We propose a probabilistic framework for modeling and predicting traffic patterns using information obtained from wireless sensor networks. For concreteness, we apply the proposed framework to a smart building application in which traffic patterns of humans are modeled and predicted through human detection and matching of their images taken from cameras at different locations. Experiments with more than 100,000 images of over 40 subjects demonstrate promising results in traffic pattern prediction using the proposed algorithm. The algorithm can also be applied to other applications, including surveillance, traffic monitoring, abnormality detection, and location-based services. In addition, the long-term deployment of the network can be used for security, energy conservation, and utilization improvement of smart buildings.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Pietro:2012:SHU, author = "Roberto Di Pietro and Di Ma and Claudio Soriente and Gene Tsudik", title = "Self-healing in unattended wireless sensor networks", journal = j-TOSN, volume = "9", number = "1", pages = "7:1--7:??", month = nov, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2379799.2379806", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:51 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks (WSNs) appeal to a wide range of applications that involve the monitoring of various physical phenomena. However, WSNs are subject to many threats. In particular, lack of pervasive tamper-resistant hardware results in sensors being easy targets for compromise. Having compromised a sensor, the adversary learns all the sensor secrets, allowing it to later encrypt/decrypt or authenticate messages on behalf of that sensor. This threat is particularly relevant in the novel unattended wireless sensor networks (UWSNs) scenario. UWSNs operate without constant supervision by a trusted sink. UWSN's unattended nature and increased exposure to attacks prompts the need for special techniques geared towards regaining security after being compromised. In this article, we investigate cooperative self-healing in UWSNs and propose various techniques to allow unattended sensors to recover security after compromise. Our techniques provide seamless healing rates even against a very agile and powerful adversary. The effectiveness and viability of our proposed techniques are assessed by thorough analysis and supported by simulation results. Finally, we introduce some real-world issues affecting UWSN deployment and provide some solutions for them as well as a few open problems calling for further investigation.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kim:2012:LSV, author = "Younghun Kim and Heemin Park and Mani B. Srivastava", title = "A longitudinal study of vibration-based water flow sensing", journal = j-TOSN, volume = "9", number = "1", pages = "8:1--8:??", month = nov, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2379799.2379807", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:51 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present a long-term and cross-sectional study of a vibration-based water flow rate monitoring system in practical environments and scenarios. In our earlier research, we proved that a water flow monitoring system with vibration sensors is feasible by deploying and evaluating it in a small-scale laboratory setting. To validate the proposed system, the system was deployed in existing environments-two houses and a public restroom-and in two different laboratory test settings. With the collected data, we first demonstrate various aspects of the system's performance, including sensing stability, sensor node lifetime, the stability of autonomous sensor calibration, time to adaptation, and deployment complexity. We then discuss the practical challenges and lessons from the full-scale deployments. The evaluation results show that our water monitoring solution is a practical, quick-to-deploy system with a less than 5\% average flow estimation error.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Jeong:2012:PTM, author = "Jaein Jeong and David Culler", title = "A practical theory of micro-solar power sensor networks", journal = j-TOSN, volume = "9", number = "1", pages = "9:1--9:??", month = nov, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2379799.2379808", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:51 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Building a micro-solar power system is challenging because it must address long-term system behavior under highly variable solar energy and consider a large design space. We develop a practical theory of micro-solar power systems that is materialized in a simulation suite that models component and system behavior over a long time scale and in an external environment that depends on time, location, weather, and local variations. This simulation provides sufficient accuracy to guide specific design choices in a large design space. Unlike the many macro-solar calculators, this design tool models detailed behavior of milliwatt systems in the worst conditions, rather than typical behavior of kilowatt systems in the best conditions. Our simulation suite is validated with a concrete design of micro-solar power systems, the HydroWatch node. With our simulation suite, micro-solar power systems can be designed in a systematic fashion. Putting the model and empirical vehicle together, the design choices in each component of a micro-solar power system are studied to reach a deployable candidate. The deployment is evaluated by analyzing the effects of different solar profiles across the network. The analysis from the deployment can be used to refine the next system-design iteration.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2013:MTP, author = "Xiaodong Wang and Xiaorui Wang and Guoliang Xing and Yanjun Yao", title = "Minimum transmission power configuration in real-time sensor networks with overlapping channels", journal = j-TOSN, volume = "9", number = "2", pages = "10:1--10:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Multi-channel communications can effectively reduce channel competition and interference in a wireless sensor network and thus achieve increased throughput and improved end-to-end delay guarantees with reduced power consumption. However, existing work relies only on a small number of orthogonal channels, resulting in degraded performance when a large number of data flows need to be transmitted on different channels. In this article, we conduct empirical studies to investigate interferences among overlapping channels. Our results show that overlapping channels can also be utilized for improved real-time performance if the node transmission power is carefully configured. In order to minimize the overall transmission power consumption of a network with multiple data flows under end-to-end delay constraints, we formulate a constrained optimization problem to configure the transmission power level of every node and assign overlapping channels to different data flows. Since the optimization problem has an exponential computational complexity, we then present a heuristic algorithm designed based on simulated annealing to find a suboptimal solution. Our extensive empirical results on a 33-mote testbed demonstrate that our algorithm achieves better real-time performance and less power consumption than two baselines, including a scheme using only orthogonal channels.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tang:2013:EED, author = "Bin Tang and Neeraj Jaggi and Haijie Wu and Rohini Kurkal", title = "Energy-efficient data redistribution in sensor networks", journal = j-TOSN, volume = "9", number = "2", pages = "11:1--11:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We address the energy-efficient data redistribution problem in data-intensive sensor networks (DISNs). In a DISN, a large volume of data gets generated, which is first stored in the network and is later collected for further analysis when the next uploading opportunity arises. The key concern in DISNs is to be able to redistribute the data from data-generating nodes into the network under limited storage and energy constraints at the sensor nodes. We formulate the data redistribution problem where the objective is to minimize the total energy consumption during this process while guaranteeing full utilization of the distributed storage capacity in the DISNs. We show that the problem is APX-hard for arbitrary data sizes; therefore, a polynomial time approximation algorithm is unlikely. For unit data sizes, we show that the problem is equivalent to the minimum cost flow problem, which can be solved optimally. However, the optimal solution's centralized nature makes it unsuitable for large-scale distributed sensor networks. Thus, we design a distributed algorithm for the data redistribution problem which performs very close to the optimal, and compare its performance with various intuitive heuristics. The distributed algorithm relies on potential function-based computations, incurs limited message and computational overhead at both the sensor nodes and data generator nodes, and is easily implementable in a distributed manner. We analytically study the convergence and performance of the proposed algorithm and demonstrate its near-optimal performance and scalability under various network scenarios. In addition, we implement the distributed algorithm in TinyOS, evaluate it using TOSSIM simulator, and show that it outperforms EnviroStore, the only existing scheme for data redistribution in sensor networks, in both solution quality and message overhead. Finally, we extend the proposed algorithm to avoid disproportionate energy consumption at different sensor nodes without compromising the solution quality.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Noshadi:2013:BOD, author = "Hyduke Noshadi and Foad Dabiri and Saro Meguerdichian and Miodrag Potkonjak and Majid Sarrafzadeh", title = "Behavior-oriented data resource management in medical sensing systems", journal = j-TOSN, volume = "9", number = "2", pages = "12:1--12:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wearable sensing systems have recently enabled a variety of medical monitoring and diagnostic applications in wireless health. The need for multiple sensors and constant monitoring leads these systems to be power hungry and expensive with short operating lifetimes. We introduce a novel methodology that takes advantage of contextual and semantic properties in human behavior to enable efficient design and optimization of such systems from the data and information point of view. This, in turn, directly influences the wireless communication and local processing power consumption. We exploit intrinsic space and temporal correlations between sensor data while considering both user and system contextual behavior. Our goal is to select a small subset of sensors that accurately capture and/or predict all possible signals of a fully instrumented wearable sensing system. Our approach leverages novel modeling, partitioning, and behavioral optimization, which consists of signal characterization, segmentation and time shifting, mutual signal prediction, and a simultaneous minimization composed of subset sensor selection and opportunistic sampling. We demonstrate the effectiveness of the technique on an insole instrumented with 99 pressure sensors placed in each shoe, which cover the bottom of the entire foot, resulting in energy reduction of 72\% to 97\% for error rates of 5\% to 17.5\%.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Park:2013:MSA, author = "Pangun Park and Carlo Fischione and Karl Henrik Johansson", title = "Modeling and stability analysis of hybrid multiple access in the {IEEE 802.15.4} protocol", journal = j-TOSN, volume = "9", number = "2", pages = "13:1--13:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "To offer flexible quality of service to several classes of applications, the medium access control (MAC) protocol of IEEE 802.15.4 wireless sensor networks (WSNs) combines the advantages of a random access with contention with a time division multiple access (TDMA) without contention. Understanding reliability, delay, and throughput is essential to characterizing the fundamental limitations of the MAC and optimizing its parameters. Nevertheless, there is not yet a clear investigation of the achievable performance of hybrid MAC. In this article, an analytical framework for modeling the behavior of the hybrid MAC protocol of the IEEE 802.15.4 standard is proposed. The main challenge for an accurate analysis is the coexistence of the stochastic behavior of the random access and the deterministic behavior of the TDMA scheme. The analysis is done in three steps. First, the contention access scheme of the IEEE 802.15.4 exponential back-off process is modeled through an extended Markov chain that takes into account channel, retry limits, acknowledgements, unsaturated traffic, and superframe period. Second, the behavior of the TDMA access scheme is modeled by another Markov chain. Finally, the two chains are coupled to obtain a complete model of the hybrid MAC. By using this model, the network performance in terms of reliability, average packet delay, average queuing delay, and throughput is evaluated through both theoretical analysis and experiments. The protocol has been implemented and evaluated on a testbed with off-the-shelf wireless sensor devices to demonstrate the utility of the analysis in a practical setup. It is established that the probability density function of the number of received packets per superframe follows a Poisson distribution. It is determined under which conditions the guaranteed time slot allocation mechanism of IEEE 802.15.4 is stable. It is shown that the mutual effect between throughput of the random access and the TDMA scheme for a fixed superframe length is critical to maximizing the overall throughput of the hybrid MAC. In high traffic load, the throughput of the random access mechanism dominates over TDMA due to the constrained use of TDMA in the standard. Furthermore, it is shown that the effect of imperfect channels and carrier sensing on system performance heavily depends on the traffic load and limited range of the protocol parameters. Finally, it is argued that the traffic generation model established in this article may be used to design an activation timer mechanism in a modified version of the CSMA/CA algorithm that guarantees a stable network performance.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Taherkordi:2013:OSN, author = "Amir Taherkordi and Frederic Loiret and Romain Rouvoy and Frank Eliassen", title = "Optimizing sensor network reprogramming via in situ reconfigurable components", journal = j-TOSN, volume = "9", number = "2", pages = "14:1--14:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless reprogramming of sensor nodes is a critical requirement in long-lived wireless sensor networks (WSNs) addressing several concerns, such as fixing bugs, upgrading the operating system and applications, and adapting applications behavior according to the physical environment. In such resource-poor platforms, the ability to efficiently delimit and reconfigure the necessary portion of sensor software-instead of updating the full binary image-is of vital importance. However, most existing approaches in this field have not been adopted widely to date due to the extensive use of WSN resources or lack of generality. In this article, we therefore consider WSN programming models and runtime reconfiguration models as two interrelated factors and we present an integrated approach for addressing efficient reprogramming in WSNs. The middleware solution we propose, {$<$ scp$<$RemoWare$<$}/{scp$<$}, is characterized by mitigating the cost of post-deployment software updates on sensor nodes via the notion of in situ reconfigurability and providing a component-based programming abstraction in order to facilitate the development of dynamic WSN applications. Our evaluation results show that {$<$ scp$<$RemoWare$<$}/{scp$<$} imposes a very low energy overhead in code distribution and component reconfiguration and consumes approximately 6\% of the total code memory on a {$<$ scp$<$TelosB$<$}/{scp$<$} sensor platform.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chong:2013:SLP, author = "Poh Kit Chong and Daeyoung Kim", title = "Surface-level path loss modeling for sensor networks in flat and irregular terrain", journal = j-TOSN, volume = "9", number = "2", pages = "15:1--15:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Many wireless sensor network applications require sensor nodes to be deployed on the ground or other surfaces. However, there has been little effort to characterize the large- and small-scale path loss for surface-level radio communications. We present a comprehensive measurement of path loss and fading characteriztics for surface-level sensor nodes in the 400 MHz band in both flat and irregular outdoor terrain in an effort to improve the understanding of surface-level sensor network communications performance and to increase the accuracy of sensor network modeling and simulation. Based on our measurement results, we characterize the spatial small-scale area fading effects as a Rician distribution with a distance-dependent K-factor. We also propose a new semi-empirical path loss model for outdoor surface-level wireless sensor networks called the Surface-Level Irregular Terrain (SLIT) model. We verify our model by comparing measurement results with predicted values obtained from high-resolution digital elevation model (DEM) data and computer simulation for the 400 MHz and 2.4 GHz band. Finally, we discuss the impact of the SLIT model and demonstrate through simulation the effects when SLIT is used as the path loss model for existing sensor network protocols.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ercan:2013:OTP, author = "Ali O. Ercan and Abbas El Gamal and Leonidas J. Guibas", title = "Object tracking in the presence of occlusions using multiple cameras: a sensor network approach", journal = j-TOSN, volume = "9", number = "2", pages = "16:1--16:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article describes a sensor network approach to tracking a single object in the presence of static and moving occluders using a network of cameras. To conserve communication bandwidth and energy, we combine a task-driven approach with camera subset selection. In the task-driven approach, each camera first performs simple local processing to detect the horizontal position of the object in the image. This information is then sent to a cluster head to track the object. We assume the locations of the static occluders to be known, but only prior statistics on the positions of the moving occluders are available. A noisy perspective camera measurement model is introduced, where occlusions are captured through occlusion indicator functions. An auxiliary particle filter that incorporates the occluder information is used to track the object. The camera subset selection algorithm uses the minimum mean square error of the best linear estimate of the object position as a metric, and tracking is performed using only the selected subset of cameras. Using simulations and preselected subsets of cameras, we investigate (i) the dependency of the tracker performance on the accuracy of the moving occluder priors, (ii) the trade-off between the number of cameras and the occluder prior accuracy required to achieve a prescribed tracker performance, and (iii) the importance of having occluder priors to the tracker performance as the number of occluders increases. We find that computing moving occluder priors may not be worthwhile, unless it can be obtained cheaply and to high accuracy. We also investigate the effect of dynamically selecting the subset of camera nodes used in tracking on the tracking performance. We show through simulations that a greedy selection algorithm performs close to the brute-force method and outperforms other heuristics, and the performance achieved by greedily selecting a small fraction of the cameras is close to that of using all the cameras.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tan:2013:FBV, author = "Rui Tan and Guoliang Xing and Jinzhu Chen and Wen-Zhan Song and Renjie Huang", title = "Fusion-based volcanic earthquake detection and timing in wireless sensor networks", journal = j-TOSN, volume = "9", number = "2", pages = "17:1--17:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Volcano monitoring is of great interest to public safety and scientific explorations. However, traditional volcanic instrumentation such as broadband seismometers are expensive, power hungry, bulky, and difficult to install. Wireless sensor networks (WSNs) offer the potential to monitor volcanoes on unprecedented spatial and temporal scales. However, current volcanic WSN systems often yield poor monitoring quality due to the limited sensing capability of low-cost sensors and unpredictable dynamics of volcanic activities. In this article, we propose a novel quality-driven approach to achieving real-time, distributed, and long-lived volcanic earthquake detection and timing. By employing novel in-network collaborative signal processing algorithms, our approach can meet stringent requirements on sensing quality (i.e., low false alarm/missing rate, short detection delay, and precise earthquake onset time) at low power consumption. We have implemented our algorithms in TinyOS and conducted extensive evaluation on a testbed of 24 TelosB motes as well as simulations based on real data traces collected during 5.5 months on an active volcano. We show that our approach yields near-zero false alarm/missing rate, less than one second of detection delay, and millisecond precision earthquake onset time while achieving up to six-fold energy reduction over the current data collection approach.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Li:2013:SAH, author = "Ming Li and Shucheng Yu and Joshua D. Guttman and Wenjing Lou and Kui Ren", title = "Secure ad hoc trust initialization and key management in wireless body area networks", journal = j-TOSN, volume = "9", number = "2", pages = "18:1--18:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The body area network (BAN) is a key enabling technology in e-healthcare. An important security issue is to establish initial trust relationships among the BAN devices before they are actually deployed and generate necessary shared secret keys to protect the subsequent wireless communications. Due to the ad hoc nature of the BAN and the extreme resource constraints of sensor devices, providing secure as well as efficient and user-friendly trust initialization is a challenging task. Traditional solutions for wireless sensor networks mostly depend on key predistribution, which is unsuitable for a BAN in many ways. In this article, we propose group device pairing (GDP), a user-aided multi-party authenticated key agreement protocol. Through GDP, a group of sensor devices that have no pre-shared secrets establish initial trust by generating various shared secret keys out of an unauthenticated channel. Devices authenticate themselves to each other with the aid of a human user who performs visual verifications. The GDP supports fast batch deployment, addition and revocation of sensor devices, does not rely on any additional hardware device, and is mostly based on symmetric key cryptography. We formally prove the security of the proposed protocols, and we implement GDP on a sensor network testbed and report performance evaluation results.", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kamal:2013:PLA, author = "Abu Raihan M. Kamal and Chris Bleakley and Simon Dobson", title = "{Packet-Level Attestation (PLA)}: a framework for in-network sensor data reliability", journal = j-TOSN, volume = "9", number = "2", pages = "19:1--19:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks (WSN) show enormous potential for collection and analysis of physical data in real-time. Many papers have proposed methods for improving the network reliability of WSNs. However, real WSN deployments show that sensor data-faults are very common. Several server-side data reliability techniques have been proposed to detect these faults and impute missing or erroneous data. Typically, these techniques reduce the lifetime of the network due to redundant data transmission, increase latency, and are computation and storage intensive. Herein, we propose Packet-Level Attestation (PLA), a novel framework for sensor data reliability assessment. It exploits the spatial correlation of data sensed at nearby sensors. The method does not incur additional transmission of control message between source and sink; instead, a verifier node sends a validation certificate as part of the regular data packet. PLA was implemented in TinyOS on TelosB motes and its performances was assessed. Simulations were performed to determine its scalability. It incurs only an overhead of 1.45\% in terms of packets transmitted. Fault detection precision of the framework varied from 100\% to 99.48\%. Comparisons with existing methods for data reliability analysis showed a significant reduction in data transmission, prolonging the network lifetime.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Lai:2013:MHW, author = "Ted Tsung-Te Lai and Wei-Ju Chen and Yu-Han Tiffany Chen and Polly Huang and Hao-Hau Chu", title = "Mapping hidden water pipelines using a mobile sensor droplet", journal = j-TOSN, volume = "9", number = "2", pages = "20:1--20:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This study presents several extensions to our previous work on the PipeProbe system, a mobile sensor system for identifying the spatial topology of hidden water pipelines (i.e., non-moldable pipes such as copper and PVC) behind walls or under floors [Lai et al. 2010]. The PipeProbe system works by dropping a tiny wireless sensor capsule into the source of a water pipeline. As the PipeProbe capsule traverses the pipelines, it gathers and transmits pressure and angular velocity readings. Through spatiotemporal analysis of these sensor readings, the proposed algorithm locates all turning points in the pipelines and maps their 3D spatial topology. This study expands upon previous research by developing new sensing techniques that identify variable-diameter pipes and differentiate 90-degree pipe turns from 45-degree pipe bends.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chen:2013:LBC, author = "Phoebus Chen and Kirak Hong and Nikhil Naikal and S. Shankar Sastry and Doug Tygar and Posu Yan and Allen Y. Yang and Lung-Chung Chang and Leon Lin and Simon Wang and Edgar Lobat{\'o}n and Songhwai Oh and Parvez Ahammad", title = "A low-bandwidth camera sensor platform with applications in smart camera networks", journal = j-TOSN, volume = "9", number = "2", pages = "21:1--21:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Smart camera networks have recently emerged as a new class of sensor network infrastructure that is capable of supporting high-power in-network signal processing and enabling a wide range of applications. In this article, we provide an exposition of our efforts to build a low-bandwidth wireless camera network platform, called CITRIC, and its applications in smart camera networks. The platform integrates a camera, a microphone, a frequency-scalable (up to 624 MHz) CPU, 16 MB FLASH, and 64 MB RAM onto a single device. The device then connects with a standard sensor network mote to form a wireless camera mote. With reasonably low power consumption and extensive algorithmic libraries running on a decent operating system that is easy to program, CITRIC is ideal for research and applications in distributed image and video processing. Its capabilities of in-network image processing also reduce communication requirements, which has been high in other existing camera networks with centralized processing. Furthermore, the mote easily integrates with other low-bandwidth sensor networks via the IEEE 802.15.4 protocol. To justify the utility of CITRIC, we present several representative applications. In particular, concrete research results will be demonstrated in two areas, namely, distributed coverage hole identification and distributed object recognition.", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2013:MSA, author = "Dan Wang and Jiangchuan Liu and Qian Zhang", title = "On mobile sensor assisted field coverage", journal = j-TOSN, volume = "9", number = "2", pages = "22:1--22:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Providing field coverage is a key task in many sensor network applications. With unevenly distributed static sensors, quality coverage with acceptable network lifetime is often difficult to achieve. Fortunately, recent advances on embedded and robotic systems make mobile sensors possible, and we suggest that a small set of mobile sensors can be leveraged toward a cost-effective solution for field coverage. There are, however, a series of fundamental questions to be answered in such a hybrid network of static and mobile sensors: (1) Given the expected coverage quality and system lifetime, how many mobile sensors should be deployed? (2) What are the necessary coverage contributions from each type of sensors? (3) What working and moving patterns should the sensors adopt to achieve the desired coverage contributions? In this article, we offer an analytical study on these problems, and the results lead to a practical system design. Specifically, we present an optimal algorithm for calculating the contributions from different types of sensors, which fully exploits the potentials of the mobile sensors and maximizes the network lifetime. We then present a random walk model for the mobile sensors. The model is distributed with very low control overhead. Its parameters can be fine-tuned to match the moving capability of different mobile sensors and the demands from a broad spectrum of applications. A node collaboration scheme is then introduced to further enhance the system performance. We demonstrate through analysis and simulation that, in our mobile assisted design, a small set of mobile sensors can effectively address the uneven distribution of the static sensors and significantly improve the coverage quality.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Jurdak:2013:EEL, author = "Raja Jurdak and Peter Corke and Alban Cotillon and Dhinesh Dharman and Chris Crossman and Guillaume Salagnac", title = "Energy-efficient localization: {GPS} duty cycling with radio ranging", journal = j-TOSN, volume = "9", number = "2", pages = "23:1--23:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "GPS is a commonly used and convenient technology for determining absolute position in outdoor environments, but its high power consumption leads to rapid battery depletion in mobile devices. An obvious solution is to duty cycle the GPS module, which prolongs the device lifetime at the cost of increased position uncertainty while the GPS is off. This article addresses the trade-off between energy consumption and localization performance in a mobile sensor network application. The focus is on augmenting GPS location with more energy-efficient location sensors to bound position estimate uncertainty while GPS is off. Empirical GPS and radio contact data from a large-scale animal tracking deployment is used to model node mobility, radio performance, and GPS. Because GPS takes a considerable, and variable, time after powering up before it delivers a good position measurement, we model the GPS behavior through empirical measurements of two GPS modules. These models are then used to explore duty cycling strategies for maintaining position uncertainty within specified bounds. We then explore the benefits of using short-range radio contact logging alongside GPS as an energy-inexpensive means of lowering uncertainty while the GPS is off, and we propose strategies that use RSSI ranging and GPS back-offs to further reduce energy consumption. Results show that our combined strategies can cut node energy consumption by one third while still meeting application-specific positioning criteria.", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Xiao:2013:RLA, author = "Qingjun Xiao and Kai Bu and Zhijun Wang and Bin Xiao", title = "Robust localization against outliers in wireless sensor networks", journal = j-TOSN, volume = "9", number = "2", pages = "24:1--24:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In wireless sensor networks, a critical system service is the localization service that determines the locations of geographically distributed sensor nodes. The raw data used by this service are the distance measurements between neighboring nodes and the position knowledge of anchor nodes. However, these raw data may contain outliers that strongly deviate from their true values, which include both the outlier distances and the outlier anchors. These outliers can severely degrade the accuracy of the localization service. Therefore, we need a robust localization algorithm that can reject these outliers. Previous studies in this field mainly focus on enhancing multilateration with outlier rejection ability, since multilateration is a primitive operation used by localization service. But patch merging, a powerful operation for increasing the percentage of localizable nodes in sparse networks, is almost neglected. We thus propose a robust patch merging operation that can reject outliers for both multilateration and patch merging. Based on this operation, we further propose a robust network localization algorithm called RobustLoc. This algorithm makes two major contributions. (1) RobustLoc can achieve a high percentage of localizable nodes in both dense and sparse networks. In contrast, previous methods based on robust multilateration almost always fail in sparse networks with average degrees between 5 and 7. Our experiments show that RobustLoc can localize about 90\% of nodes in a sparse network with 5.5 degrees. (2) As far as we know, RobustLoc is the first to uncover the differences between outlier distances and outlier anchors. Our simulations show that RobustLoc can reject colluding outlier anchors reliably in both convex and concave networks.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Keller:2013:SNC, author = "Lorenzo Keller and Emre Atsan and Katerina Argyraki and Christina Fragouli", title = "{SenseCode}: Network coding for reliable sensor networks", journal = j-TOSN, volume = "9", number = "2", pages = "25:1--25:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Designing a communication protocol for sensor networks often involves obtaining the right trade-off between energy efficiency and end-to-end packet error rate. In this article, we show that network coding provides a means to elegantly balance these two goals. We present the design and implementation of SenseCode, a collection protocol for sensor networks-and, to the best of our knowledge, the first such implemented protocol to employ network coding. SenseCode provides a way to gracefully introduce a configurable amount of redundant information into the network, thereby decreasing end-to-end packet error rate in the face of packet loss. We compare SenseCode to the best (to our knowledge) existing alternative and show that it reduces end-to-end packet error rate in highly dynamic environments, while consuming a comparable amount of network resources. We have implemented SenseCode as a TinyOS module and evaluate it through extensive TOSSIM simulations.", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yang:2013:BTI, author = "Zheng Yang and Lirong Jian and Chenshu Wu and Yunhao Liu", title = "Beyond triangle inequality: Sifting noisy and outlier distance measurements for localization", journal = j-TOSN, volume = "9", number = "2", pages = "26:1--26:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Knowing accurate positions of nodes in wireless ad hoc and sensor networks is essential for a wide range of pervasive and mobile applications. However, errors are inevitable in distance measurements and we observe that a small number of outliers can degrade localization accuracy drastically. To deal with noisy and outlier ranging results, triangle inequality, is often employed in existing approaches. Our study shows that triangle inequality has many limitations, which make it far from accurate and reliable. In this study, we formally define the outlier detection problem for network localization and build a theoretical foundation to identify outliers based on graph embeddability and rigidity theory. Our analysis shows that the redundancy of distance measurements plays an important role. We then design a bilateration generic cycles-based outlier detection algorithm, and examine its effectiveness and efficiency through a network prototype implementation of MicaZ motes as well as extensive simulations. The results show that our design significantly improves the localization accuracy by wisely rejecting outliers.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Syed:2013:TRM, author = "Affan A. Syed and John Heidemann and Wei Ye", title = "Tones for real: Managing multipath in underwater acoustic wakeup", journal = j-TOSN, volume = "9", number = "2", pages = "27:1--27:??", month = mar, year = "2013", CODEN = "????", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun May 5 09:18:52 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The principles of sensor networks-low-power, wireless, in-situ sensing with many inexpensive sensors-are only recently penetrating into underwater research. Acoustic communication is best suited for underwater communication, with much lower attenuation than RF, but acoustic propagation is five orders-of-magnitude slower than RF, so propagation times stretch to hundreds of milliseconds. Low-power wakeup tones are present in new underwater acoustic modems, and when added to applications and MAC protocols they reduce energy consumption wasted on idle listening. Unfortunately, underwater acoustic tones suffer from self-multipath-echoes unique to the latency that can completely defeat their protocol advantages. We introduce Self-Reflection Tone Learning (SRTL), a novel approach where nodes use Bayesian techniques to address interference by learning to discriminate self-reflections from noise and independent communication. We present detailed experiments using an acoustic modem in controlled and uncontrolled, in-air and underwater environments. These experiments demonstrate that SRTL's knowledge corresponds to physical-world predictions, that it can cope with underwater noise and reasonable levels of artificial noise, and that it can track a changing multipath environment. Simulations confirm that these real-world experiments generalize over a wide range of conditions.", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tan:2013:SLC, author = "Rui Tan and Guoliang Xing and Zhaohui Yuan and Xue Liu and Jianguo Yao", title = "System-level calibration for data fusion in wireless sensor networks", journal = j-TOSN, volume = "9", number = "3", pages = "28:1--28:??", month = may, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2480730.2480731", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:24 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks are typically composed of low-cost sensors that are deeply integrated in physical environments. As a result, the sensing performance of a wireless sensor network is inevitably undermined by biases in imperfect sensor hardware and the noises in data measurements. Although a variety of calibration methods have been proposed to address these issues, they often adopt the device-level approach that becomes intractable for moderate-to large-scale networks. In this article, we propose a two-tier system-level calibration approach for a class of sensor networks that employ data fusion to improve the sensing performance. In the first tier of our calibration approach, each sensor learns its local sensing model from noisy measurements using an online algorithm and only transmits a few model parameters. In the second tier, sensors' local sensing models are then calibrated to a common system sensing model. Our approach fairly distributes computation overhead among sensors and significantly reduces the communication overhead of calibration compared with the device-level approach. Based on this approach, we develop an optimal model calibration scheme that maximizes the target detection probability of a sensor network under bounded false alarm rate. Our approach is evaluated by both experiments on a testbed of TelosB motes and extensive simulations based on synthetic datasets as well as data traces collected in a real vehicle detection experiment. The results demonstrate that our system-level calibration approach can significantly boost the detection performance of sensor networks in scenarios with low signal-to-noise ratios.", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Blumrosen:2013:ERB, author = "Gaddi Blumrosen and Bracha Hod and Tal Anker and Danny Dolev and Boris Rubinsky", title = "Enhancing {RSSI-based} tracking accuracy in wireless sensor networks", journal = j-TOSN, volume = "9", number = "3", pages = "29:1--29:??", month = may, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2480730.2480732", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:24 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In recent years, the demand for high-precision tracking systems has significantly increased in the field of Wireless Sensor Network (WSN). A new tracking system based on exploitation of Received Signal Strength Indicator (RSSI) measurements in WSN is proposed. The proposed system is designed in particular for WSNs that are deployed in close proximity and can transmit data at a high transmission rate. The close proximity and an optimized transmit power level enable accurate conversion of RSSI measurements to range estimates. Having an adequate transmission rate enables spatial-temporal correlation between consecutive RSSI measurements. In addition, advanced statistical and signal processing methods are used to mitigate channel distortion and to compensate for packet loss. The system is evaluated in indoor conditions and achieves tracking resolution of a few centimeters which is compatible with theoretical bounds.", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Klein:2013:LSA, author = "Daniel J. Klein and Sriram Venkateswaran and Jason T. Isaacs and Jerry Burman and Tien Pham and Jo{\~a}o Hespanha and Upamanyu Madhow", title = "Localization with sparse acoustic sensor network using {UAVs} as information-seeking data mules", journal = j-TOSN, volume = "9", number = "3", pages = "30:1--30:??", month = may, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2480730.2480733", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:24 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We propose and demonstrate a novel architecture for on-the-fly inference while collecting data from sparse sensor networks. In particular, we consider source localization using acoustic sensors dispersed over a large area, with the individual sensors located too far apart for direct connectivity. An Unmanned Aerial Vehicle (UAV) is employed for collecting sensor data, with the UAV route adaptively adjusted based on data from sensors already visited, in order to minimize the time to localize events of interest. The UAV therefore acts as a information-seeking data mule, not only providing connectivity, but also making Bayesian inferences from the data gathered in order to guide its future actions. The system we demonstrate has a modular architecture, comprising efficient algorithms for acoustic signal processing, routing the UAV to the sensors, and source localization. We report on extensive field tests which not only demonstrate the effectiveness of our general approach, but also yield specific practical insights into GPS time synchronization and localization accuracy, acoustic signal and channel characteristics, and the effects of environmental phenomena.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Feng:2013:EED, author = "Jing Feng and Yung-Hsiang Lu and Byunghoo Jung and Dimitrios Peroulis and Y. Charlie Hu", title = "Energy-efficient data dissemination using beamforming in wireless sensor networks", journal = j-TOSN, volume = "9", number = "3", pages = "31:1--31:??", month = may, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2480730.2480734", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:24 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Energy conservation is essential in Wireless Sensor Networks (WSNs) because of limited energy in nodes' batteries. Collaborative beamforming uses multiple transmitters to form antenna arrays; the electromagnetic waves from these antenna arrays can create constructive interferences at the receiver and increase the transmission distance. Each transmitter can use lower power and save energy, since the energy consumption is spread over multiple transmitters. Each beamforming transmission requires multiple collaborative transmitters. Repetitively using the same transmitters will deplete their energy and create coverage holes in the sensing area. To prevent holes, energy should be balanced by using different transmitters. This article investigates the factors that can affect the energy consumption and network lifetime when using beamforming. We present an algorithm for selecting the transmitters in order to prolong the network lifetime. Compared with an existing beamforming transmitters scheduling algorithm, our algorithm doubles the network lifetime. When compared with direct transmission or multihop transmissions towards a receiver far away from the sensing area, our approach can increase the network's lifetime substantially.", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Sarkar:2013:DCR, author = "Rik Sarkar and Xianjin Zhu and Jie Gao", title = "Distributed and compact routing using spatial distributions in wireless sensor networks", journal = j-TOSN, volume = "9", number = "3", pages = "32:1--32:??", month = may, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2480730.2480735", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:24 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In traditional routing, the routing tables store shortest paths to all other destinations and have size linear in the size of the network, which is not scalable for resource-constrained networks such as wireless sensor networks. In this article we show that by storing selectively a much smaller set of routing paths in the routing tables one can get low-stretch, compact routing schemes. Our routing scheme includes an approximate distance oracle with which one can obtain approximate shortest path length estimates to destinations. This distance oracle can be obtained, for example, by a landmark-based scheme, or in case of sensor networks, from the geographic distance between node locations. With an approximate distance oracle one can attempt greedy routing by forwarding to the neighbor whose estimate is closer to the destination. But there is no guarantee of delivery nor of the routing path length. We augment the distance oracle by storing, for each node $u$, routing paths to $ O(\log^2 n) $ strategically selected nodes that serve as intermediate destinations. These nodes are selected with probability proportional to $ 1 / r^\rho $, where $r$ is the distance to $u$ and $ \rho $ is a suitable constant for the network. Then we derive a set of sufficient conditions to select the next step at each stage of routing, such that these conditions can be verified locally and guarantee $ 1 + \epsilon $ stretch routing on any metric. These conditions serve as the ``greedy routing'' or local decision rule. On graphs of bounded growth, our scheme guarantees $ 1 + \epsilon $ stretch routing with high probability, with an average routing table size of $ O(\sqrt n \log^2 n) $. This scheme is favorable for its simplicity, generality, and blindness to any global state. It demonstrates that global routing properties could emerge from purely distributed and uncoordinated routing table design.", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Li:2013:AEE, author = "Wei Li and Fl{\'a}via C. Delicato and Albert Y. Zomaya", title = "Adaptive energy-efficient scheduling for hierarchical wireless sensor networks", journal = j-TOSN, volume = "9", number = "3", pages = "33:1--33:??", month = may, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2480730.2480736", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:24 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Most Wireless Sensor Network (WSN) applications require distributed signal and collaborative data processing. One of the critical issues for enabling collaborative processing in WSNs is how to schedule tasks in a systematic way, including assigning tasks to sensor nodes, and determining their execution and communication sequence. Since WSN nodes are very resource constrained, mainly regarding their energy supply, one major concern when scheduling tasks in such environments is to minimize and balance the energy consumption, so that the system operational lifetime is maximized. We propose a heuristic-based three-phase algorithm (TPTS) for allocating tasks to multiple clusters in hierarchical WSNs that aims at finding a scheduling scheme that minimizes the overall energy consumption and balances the workload of the system while meeting the application's deadline. The performance of the proposed algorithm and the effect of several parameters on its behavior were evaluated by simulations, with promising results. The experimental results show that the time and energy performance of TPTS are close to the time and energy of benchmarks in most cases, while load balance is always provided.", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yang:2013:TSS, author = "Yi Yang and Min Shao and Sencun Zhu and Guohong Cao", title = "Towards statistically strong source anonymity for sensor networks", journal = j-TOSN, volume = "9", number = "3", pages = "34:1--34:??", month = may, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2480730.2480737", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:24 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "For sensor networks deployed to monitor and report real events, event source anonymity is an attractive and critical security property, which unfortunately is also very difficult and expensive to achieve. This is not only because adversaries may attack against sensor source privacy through traffic analysis, but also because sensor networks are very limited in resources. As such, a practical trade-off between security and performance is desirable. In this article, for the first time we propose the notion of statistically strong source anonymity, under a challenging attack model where a global attacker is able to monitor the traffic in the entire network. We propose a scheme called FitProbRate, which realizes statistically strong source anonymity for sensor networks. We demonstrate the robustness of our scheme under various statistical tests that might be employed by the attacker to detect real events. Our analysis and simulation results show that our scheme, besides providing source anonymity, can significantly reduce real event reporting latency compared to two baseline schemes. However, the degree of source anonymity in the FitProbRate scheme might decrease as real message rate increases. We propose a dynamic mean scheme which has better performance under high real message rates. Simulation results show that the dynamic mean scheme is capable of increasing the attacker's false positive rate and decreasing the attacker's Bayesian detection rate significantly even under high-rate continuous real messages.", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Xu:2013:RTR, author = "Yinsheng Xu and Fengyuan Ren and Tao He and Chuang Lin and Canfeng Chen and Sajal K. Das", title = "Real-time routing in wireless sensor networks: a potential field approach", journal = j-TOSN, volume = "9", number = "3", pages = "35:1--35:??", month = may, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2480730.2480738", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:24 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless Sensor Networks (WSNs) are embracing an increasing number of real-time applications subject to strict delay constraints. Utilizing the methodology of potential field in physics, in this article we effectively address the challenges of real-time routing in WSNs. In particular, based on a virtual composite potential field, we propose the Potential-based Real-Time Routing (PRTR) protocol that supports real-time routing using multipath transmission. PRTR minimizes delay for real-time traffic and alleviates possible congestions simultaneously. Since the delay bounds of real-time flows are extremely important, the end-to-end delay bound for a single flow is derived based on the Network Calculus theory. The simulation results show that PRTR minimizes the end-to-end delay for real-time routing, and also guarantees a tight bound on the delay.", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Jiang:2013:PMW, author = "Xiaoye Jiang and Mo Li and Yuan Yao and Leonidas Guibas", title = "Property management in wireless sensor networks with overcomplete radon bases", journal = j-TOSN, volume = "9", number = "3", pages = "36:1--36:??", month = may, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2480730.2480739", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:24 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article presents a scalable algorithm for managing property information about moving objects tracked by a sensor network. Property information is obtained via distributed sensor observations, but will be corrupted when objects mix up with each other. The association between properties and objects then becomes ambiguous. We build a novel representation framework, exploiting an overcomplete Radon basis dictionary to model property uncertainty in such circumstances. By making use of the combinatorial structure of the basis design and sparse representations we can efficiently approximate the underlying probability distribution of the association between target properties and tracks, overcoming the exponential space that would otherwise be required. Based on the proposed theories, we design a fully distributed algorithm on wireless sensor networks. We conduct comparative simulations and the results validate the effectiveness of our approach.", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Shpungin:2013:IMS, author = "Hanan Shpungin and Michael Segal", title = "Improved multicriteria spanners for ad-hoc networks under energy and distance metrics", journal = j-TOSN, volume = "9", number = "4", pages = "37:1--37:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489254", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We study the problem of spanner construction in wireless ad-hoc networks through power assignments under two spanner models-distance and energy. In particular, we are interested in asymmetric power assignments so that the induced communication graph holds good distance and energy stretch factors simultaneously. In addition, we consider the following optimization objectives: low total energy consumption, low interference level, low hopdiameter, and high network lifetime. Two node deployment scenarios are studied: random and deterministic. For n random nodes distributed uniformly and independently in a unit square, we present several power assignments with varying construction-time complexities. The results are based on various geometric properties of random points and shortest path tree constructions. Due to the probabilistic nature of this scenario, the probability of our results converges to one as the number of network nodes, n, increases. For the deterministic case, we present two power assignments with nontrivial bounds. These are established in addition to shortcut edges that satisfy desired threshold stretch. To the best of our knowledge, these are the first results for spanner construction in wireless ad-hoc networks with provable bounds for both energy and distance metrics simultaneously. Our power assignments, in addition, try optimizing additional network properties, such as network lifetime, interference, and hop diameter.", acknowledgement = ack-nhfb, articleno = "37", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Sundaram:2013:DTW, author = "Vinaitheerthan Sundaram and Patrick Eugster and Xiangyu Zhang and Vamsidhar Addanki", title = "Diagnostic tracing for wireless sensor networks", journal = j-TOSN, volume = "9", number = "4", pages = "38:1--38:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489255", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks are typically deployed in harsh environments, thus post-deployment failures are not infrequent. An execution trace containing events in their order of execution could play a crucial role in postmortem diagnosis of these failures. Obtaining such a trace however is challenging due to stringent resource constraints. We propose an efficient approach to intraprocedural and interprocedural control-flow tracing that generates traces of all interleaving concurrent events and of the control-flow paths taken inside those events. We demonstrate the effectiveness of our approach with the help of case studies and illustrate its low overhead through measurements and simulations.", acknowledgement = ack-nhfb, articleno = "38", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kwon:2013:PES, author = "Youngmin Kwon and Gul Agha", title = "Performance evaluation of sensor networks by statistical modeling and {Euclidean} model checking", journal = j-TOSN, volume = "9", number = "4", pages = "39:1--39:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489256", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Modeling and evaluating the performance of large-scale wireless sensor networks (WSNs) is a challenging problem. The traditional method for representing the global state of a system as a cross product of the states of individual nodes in the system results in a state space whose size is exponential in the number of nodes. We propose an alternative way of representing the global state of a system: namely, as a probability mass function (pmf) which represents the fraction of nodes in different states. A pmf corresponds to a point in a Euclidean space of possible pmf values, and the evolution of the state of a system is represented by trajectories in this Euclidean space. We propose a novel performance evaluation method that examines all pmf trajectories in a dense Euclidean space by exploring only finite relevant portions of the space. We call our method Euclidean model checking. Euclidean model checking is useful both in the design phase-where it can help determine system parameters based on a specification-and in the evaluation phase-where it can help verify performance properties of a system. We illustrate the utility of Euclidean model checking by using it to design a time difference of arrival (TDoA) distance measurement protocol and to evaluate the protocol's implementation on a 90-node WSN. To facilitate such performance evaluations, we provide a Markov model estimation method based on applying a standard statistical estimation technique to samples resulting from the execution of a system.", acknowledgement = ack-nhfb, articleno = "39", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Sheu:2013:ACC, author = "Jang-Ping Sheu and Guey-Yun Chang and Shan-Hung Wu and Yen-Ting Chen", title = "Adaptive $k$-coverage contour evaluation and deployment in wireless sensor networks", journal = j-TOSN, volume = "9", number = "4", pages = "40:1--40:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489257", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The problem of coverage is a fundamental issue in wireless sensor networks. In this article, we consider two subproblems: k -coverage contour evaluation and k -coverage rate deployment. The former aims to evaluate, up to k, the coverage level of any location inside a monitored area, while the latter aims to determine the locations of a given set of sensors to guarantee the maximum increment of k -coverage rate when they are deployed into the area. For the k -coverage contour evaluation problem, a nonuniform-grid-based approach is proposed. We prove that the computation cost of our approach is at most the square root of existing solutions. Based on our k -coverage contour evaluation scheme, a greedy k -coverage rate deployment scheme ( k -CRD) is proposed, which is shown to be an order faster than existing studies for k -coverage rate deployment. The k -CRD can incorporate two different heuristics to further reduce its running time. Simulation results show that k -CRD with these heuristics can be significantly more time efficient without causing much degradation in the coverage rate of final deployment.", acknowledgement = ack-nhfb, articleno = "40", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Alippi:2013:HFS, author = "Cesare Alippi and Romolo Camplani and Cristian Galperti and Antonio Marullo and Manuel Roveri", title = "A high-frequency sampling monitoring system for environmental and structural applications", journal = j-TOSN, volume = "9", number = "4", pages = "41:1--41:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489258", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "High-frequency sampling is not only a prerogative of high-energy physics or machinery diagnostic monitoring: critical environmental and structural health monitoring applications also have such a challenging constraint. Moreover, such unique design constraints are often coupled with the requirement of high synchronism among the distributed acquisition units, minimal energy consumption, and large communication bandwidth. Such severe constraints have led scholars to suggest wired centralized monitoring solutions, which have only recently been complemented with wireless technologies. This article suggests a hybrid wireless-wired monitoring system combining the advantages of wireless and wired technologies within a distributed high-frequency-sampling framework. The suggested architecture satisfies the mentioned constraints, thanks to an ad-hoc design of the hardware, the availability of efficient energy management policies, and up-to-date harvesting mechanisms. At the same time, the architecture supports adaptation capabilities by relying on the remote reprogrammability of key application parameters. The proposed architecture has been successfully deployed in the Swiss-Italian Alps to monitor the collapse of rock faces in three geographical areas.", acknowledgement = ack-nhfb, articleno = "41", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2013:DDD, author = "Xiaodong Wang and Xiaorui Wang and Liu Liu and Guoliang Xing", title = "{DutyCon}: a dynamic duty-cycle control approach to end-to-end delay guarantees in wireless sensor networks", journal = j-TOSN, volume = "9", number = "4", pages = "42:1--42:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489259", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "It is well known that periodically putting nodes into sleep can effectively save energy in wireless sensor networks at the cost of increased communication delays. However, most existing work mainly focuses on the static sleep scheduling, which cannot guarantee the desired delay when the network conditions change dynamically. In many applications with user-specified end-to-end delay requirements, the duty cycle of every node should be tuned individually at runtime based on the network conditions to achieve the desired end-to-end delay guarantees and energy efficiency. In this article, we propose DutyCon, a control theory-based dynamic duty-cycle control approach. DutyCon decomposes the end-to-end delay guarantee problem into a set of single-hop delay guarantee problems along each data flow in the network. We then formulate the single-hop delay guarantee problem as a dynamic feedback control problem and design the controller rigorously, based on feedback control theory, for analytic assurance of control accuracy and system stability. DutyCon also features a queuing delay adaptation scheme that adapts the duty cycle of each node to unpredictable incoming packet rates, as well as a novel energy-balancing approach that extends the network lifetime by dynamically adjusting the delay requirement allocated to each hop. Our empirical results on a hardware testbed demonstrate that DutyCon can effectively achieve the desired trade-off between end-to-end delay and energy conservation. Extensive simulation results also show that DutyCon outperforms two baseline sleep scheduling protocols by having more energy savings while meeting the end-to-end delay requirements.", acknowledgement = ack-nhfb, articleno = "42", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Voulkidis:2013:EEW, author = "Artemis C. Voulkidis and Markos P. Anastasopoulos and Panayotis G. Cottis", title = "Energy efficiency in wireless sensor networks: a game-theoretic approach based on coalition formation", journal = j-TOSN, volume = "9", number = "4", pages = "43:1--43:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489260", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A coalitional game theoretic scheme is proposed that aims at maximizing wireless sensor network lifetime under specified QoS. Employing a small number of nodes of increased computing power and lifetime called representatives, an adaptive clustering scheme is proposed where neighboring nodes form coalitions in order to increase energy efficiency at the cost of controllable data-accuracy reduction. The coalition formation is globally optimized by the representatives. The spatial correlation of the sensed phenomenon measurements is exploited to formulate a cooperation scheme that reduces drastically the number of node transmissions. The specifications regarding the accuracy of the collected data determine the extent of coalition formation. The efficiency and stability of the proposed coalitional scheme are studied through simulations.", acknowledgement = ack-nhfb, articleno = "43", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Abrardo:2013:GTD, author = "Andrea Abrardo and Lapo Balucanti and Alessandro Mecocci", title = "A game theory distributed approach for energy optimization in {WSNs}", journal = j-TOSN, volume = "9", number = "4", pages = "44:1--44:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489261", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "One of the major sources of energy waste in wireless sensor networks (WSNs) is idle listening, that is, the cost of actively listening for potential packets. This article focuses on reducing idle-listening time via a dynamic duty-cycling technique which aims at optimizing the sleep interval between consecutive wake-ups. We considered a receiver-initiated MAC method for WSNs in which the sender waits for a beacon signal from the receiver before starting to transmit. Since each sender receives beacon signals from several nodes, the data are routed on multiple paths in a data collection network. In this context, we propose an optimization framework for minimizing the energy waste of the most power-hungry node of the network. To this aim, we first derive an analytic model that predicts nodes' energy consumption. Then, we use the model to derive a distributed optimization technique. Simulation results via NS-2 simulator are included to illustrate the accuracy of the model, and numerical results assess the validity of the proposed scheme.", acknowledgement = ack-nhfb, articleno = "44", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Munishwar:2013:CAV, author = "Vikram P. Munishwar and Nael B. Abu-Ghazaleh", title = "Coverage algorithms for visual sensor networks", journal = j-TOSN, volume = "9", number = "4", pages = "45:1--45:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489262", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Visual sensor networks (VSNs) are becoming increasingly popular in a number of application domains. A distinguishing characteristic of VSNs is to self-configure to minimize the need for operator control and to improve scalability. One of the areas of self-configuration is camera coverage control that is, how should cameras adjust their field-of-views to cover maximum targets? This is an NP-hard problem. We show that the existing heuristics have a number of weaknesses that influence both coverage and overhead. Therefore, we first propose a computationally efficient centralized heuristic that provides near-optimal coverage for small-scale networks. However, it requires significant communication and computation overhead, making it unsuitable for large-scale networks. Thus, we develop a distributed algorithm that outperforms the existing distributed algorithm with lower communication overhead, at the cost of coverage accuracy. We show that the proposed heuristics guarantee to cover at least half of the targets covered by the optimal solution. Finally, to gain benefits of both centralized and distributed algorithms, we propose a hierarchical algorithm where cameras are decomposed into neighborhoods that coordinate their coverage using an elected local coordinator. We observe that the hierarchical algorithm provides scalable near-optimal coverage with networking cost significantly less than that of centralized and distributed solutions.", acknowledgement = ack-nhfb, articleno = "45", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yen:2013:DLM, author = "Li-Hsing Yen and Che-Ming Lin and Victor C. M. Leung", title = "Distributed lifetime-maximized target coverage game", journal = j-TOSN, volume = "9", number = "4", pages = "46:1--46:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489263", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor nodes are usually densely deployed to completely cover (monitor) a set of targets. Consequently, redundant sensor nodes that are not currently needed in the covering task can be powered off to conserve energy. These sensors can take over the covering task later to prolong network lifetime. The coverage problem, concerns picking up a set of working sensors that collectively meet the coverage requirements. The problem is complicated by the possibility that targets may have different coverage requirements while sensor nodes may have different amounts of energy. This article proposes a game-theoretic approach to the coverage problem, where each sensor autonomously decides its state with a simple rule based on local information. We give rigorous proofs to show stability, correctness, and efficiency of the proposed game. Implementation variants of the game consider specific issues, such as game convergence time and different amounts of sensor energy. Simulation results show significant improvement in network lifetime by the proposed approach when compared with representative alternatives.", acknowledgement = ack-nhfb, articleno = "46", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ji:2013:CBS, author = "Shouling Ji and Jing (Selena) He and A. Selcuk Uluagac and Raheem Beyah and Yingshu Li", title = "{Cell}-based snapshot and continuous data collection in wireless sensor networks", journal = j-TOSN, volume = "9", number = "4", pages = "47:1--47:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489264", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Data collection is a common operation of wireless sensor networks (WSNs). The performance of data collection can be measured by its achievable network capacity. However, most existing works focus on the network capacity of unicast, multicast or/and broadcast. In this article, we study the snapshot/continuous data collection (SDC/CDC) problem under the physical interference model for randomly deployed dense WSNs. For SDC, we propose a Cell-Based Path Scheduling (CBPS) algorithm based on network partitioning. Theoretical analysis shows that its achievable network capacity is order-optimal. For CDC, a novel Segment-Based Pipeline Scheduling (SBPS) algorithm is proposed which combines the pipeline technique and the compressive data gathering technique. Theoretical analysis shows that SBPS significantly speeds up the CDC process and achieves a high network capacity.", acknowledgement = ack-nhfb, articleno = "47", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bisdikian:2013:QVI, author = "Chatschik Bisdikian and Lance M. Kaplan and Mani B. Srivastava", title = "On the quality and value of information in sensor networks", journal = j-TOSN, volume = "9", number = "4", pages = "48:1--48:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489265", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The increasing use of sensor-derived information from planned, ad-hoc, and/or opportunistically deployed sensor networks provides enhanced visibility to everyday activities and processes, enabling fast-paced data-to-decision in personal, social, civilian, military, and business contexts. The value that information brings to this visibility and ensuing decisions depends on the quality characteristics of the information gathered. In this article, we highlight, refine, and extend upon our past work in the areas of quality and value of information (QoI and VoI) for sensor networks. Specifically, we present and elaborate on our two-layer QoI/VoI definition, where the former relates to context-independent aspects and the latter to context-dependent aspects of an information product. Then, we refine our taxonomy of pertinent QoI and VoI attributes anchored around a simple ontological relationship between the two. Finally, we introduce a framework for scoring and ranking information products based on their VoI attributes using the analytic hierarchy multicriteria decision process, illustrated via a simple example.", acknowledgement = ack-nhfb, articleno = "48", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Fu:2013:TBE, author = "Huai-Lei Fu and Phone Lin and Yuguang Fang and Ting-Yu Wang", title = "Trade-off between energy efficiency and report validity for mobile sensor networks", journal = j-TOSN, volume = "9", number = "4", pages = "49:1--49:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489266", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Mobile sensor networks (MSNs) have been widely deployed to provide a ubiquitous solution to real-time monitoring applications such as traffic data collection in vehicular ad-hoc networks (VANETs), ocean data collection in underwater sensor networks (UWSNs), and biodata collection in wireless body area networks (WBANs). One major issue for designing MSNs is the energy-validity trade-off, that is, the trade-off between the energy efficiency for mobile sensors (MSs) and the validity of sensing reports. In this article, we propose a novel mechanism, Energy-Efficient Distributedly Controlled Reporting (E$^2$ DCR), to mitigate the energy consumption for MSs in real-time monitoring applications while keeping the sensing report valid. In this mechanism, we design dynamic sleeping adjustment (DSA) algorithms to adjust an MS's sleeping period using a heuristic method to reduce energy consumption. We provide analytical models to evaluate the performance of E$^2$ DCR in terms of the power savings and report validity. It has been shown that with E$^2$ DCR, MSs can report with less energy consumption while satisfying delay constraints for real-time monitoring applications.", acknowledgement = ack-nhfb, articleno = "49", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Pongaliur:2013:SNS, author = "Kanthakumar Pongaliur and Li Xiao", title = "Sensor node source privacy and packet recovery under eavesdropping and node compromise attacks", journal = j-TOSN, volume = "9", number = "4", pages = "50:1--50:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489267", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Securing a sensor network poses a variety of problems. Of those, an important one is of providing privacy to the event-detecting sensor node and integrity to the data gathered by the node. Compromised source privacy can inadvertently leak event location. Safeguarding the privacy of the source node is important, as sensor networks hold critical roles in military application, tracking endangered species, etc. Existing techniques in sensor networks use either random walk path or generate fake event packets to make it hard for an adversary to trace back to the source, since encryption alone may not help prevent a traffic analysis attack. In this work, without using traditional overhead-intensive methods, we present a scheme for hiding source information using cryptographic techniques incurring lower overhead. The packet is modified en route by dynamically selected nodes to make it difficult for a malicious entity to trace back the packet to a source node and also to prevent packet spoofing. This is important because the adversary model considers a super-local eavesdropper having the ability to compromise sensor nodes. Additionally, we provide a method for the base station to recover corrupted packets and identify the location of the compromised node. We analyze the ability of our proposed scheme to withstand different attacks and demonstrate its efficiency in terms of overhead and functionality when compared to existing work.", acknowledgement = ack-nhfb, articleno = "50", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Eslami:2013:RFW, author = "Ali Eslami and Mohammad Nekoui and Hossein Pishro-Nik and Faramarz Fekri", title = "Results on finite wireless sensor networks: Connectivity and coverage", journal = j-TOSN, volume = "9", number = "4", pages = "51:1--51:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489268", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Many analytic results for the connectivity, coverage, and capacity of wireless networks have been reported for the case where the number of nodes, n, tends to infinity (large-scale networks). The majority of these results have not been extended for small or moderate values of n; whereas in many practical networks, n is not very large. In this article, we consider finite (small-scale) wireless sensor networks. We first show that previous asymptotic results provide poor approximations for such networks. We provide a set of differences between small-scale and large-scale analysis and propose a methodology for analysis of finite sensor networks. Furthermore, we consider two models for such networks: unreliable sensor grids and sensor networks with random node deployment. We provide easily computable expressions for bounds on the coverage and connectivity of these networks. With validation from simulations, we show that the derived analytic expressions give very good estimates of such quantities for finite sensor networks. Our investigation confirms the fact that small-scale networks possess unique characteristics different from their large-scale counterparts, necessitating the development of a new framework for their analysis and design.", acknowledgement = ack-nhfb, articleno = "51", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Huang:2013:CEA, author = "Xiaolong Huang and Izhak Rubin", title = "Capacity- and energy-aware activation of sensor nodes for area phenomenon reproduction using wireless network transport", journal = j-TOSN, volume = "9", number = "4", pages = "52:1--52:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489269", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider a sensor network involving sensors placed in specific locations. An area phenomenon is detected and tracked by activated sensors. The area phenomenon is modeled to consist of K spatially distributed point phenomena. The activated sensors collect data samples characterizing the parameters of the involved point phenomena. They compress observed data readings and transport them to a processing center. The center processes the received data to derive estimates of the point phenomena's parameters. Our sensing stochastic process models account for distance-dependent observation noise perturbations as well as noise correlations. At the processing center, sample mean calculations are used to derive the estimates of the underlying area phenomenon's parameters. We develop computationally efficient algorithms to determine the specific set of sensors for activation under capacity and energy resource constraints so that a sufficiently low reproduction distortion level is attained. We derive lower bounds on the realizable levels of the distortion measure. Using illustrative cases, we demonstrate one of our algorithms to yield distortion levels that are very close to the lower bound, while other lower-complexity schemes often yield distortion levels relatively close to the lower bound.", acknowledgement = ack-nhfb, articleno = "52", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Forte:2013:TAS, author = "Domenic Forte and Ankur Srivastava", title = "Thermal-aware sensor scheduling for distributed estimation", journal = j-TOSN, volume = "9", number = "4", pages = "53:1--53:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489270", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A sensor network is a distributed system where sensor nodes autonomously collect local data and collaborate to solve global problems. Recent work has shown that sensor functionality varies with node temperature. Extreme temperatures can decrease node/network lifetime by leading to premature hardware failure and reducing battery capacity. Furthermore, high temperatures can increase sensor measurement noise and disrupt communication between overheated sensor nodes, thereby interfering with their ability to contribute valuable information to collaborative tasks. In the past, sensor networks only consisted of low-end devices with limited power, computational capabilities, and available bandwidth. Such devices would only experience high temperatures in harsh environments. However, sensor networks are now envisioned for applications that require higher-end devices, such as smart cameras, smart phones, and laptops. The power dissipated by such devices is much larger than low-end sensors and can create thermal emergencies in sensor hardware even in calm environments. In this article, we present unique management opportunities for distributed estimation tasks in sensor networks consisting of high-end devices prone to thermal issues. We attempt to balance both thermal- and performance-related constraints by examining trade-offs between sensor sampling rate, number of sensors, node temperature, and state estimation error. Initially, we devise a scheduling algorithm which can achieve a desired real-time performance constraint while maintaining a thermal limit on temperature assuming identical nodes in the network. Then, we extend the concept to a network consisting of heterogeneous sensor nodes. Analytical results and simulation experiments are done for state estimation with a Kalman filter for simplicity, but our main contributions should easily extend to any form of estimation with measurable error. Results show that our policies can successfully balance the trade-offs between thermal- and performance-related constraints. Note that our analyses, schemes, and results are less applicable to low-end sensors whose operation does not cause high node temperature. This work is most suited for high-performance sensors and upper-tier sensors which experience greater workloads.", acknowledgement = ack-nhfb, articleno = "53", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Porter:2013:MSE, author = "Barry Porter and Geoff Coulson and Utz Roedig", title = "Managing software evolution in large-scale wireless sensor and actuator networks", journal = j-TOSN, volume = "9", number = "4", pages = "54:1--54:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2489253.2489271", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:26 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor and actuator networks (WSANs) will increasingly require support for managed software evolution: that is, systematic, ongoing, efficient and nondisruptive means of updating the software running on the nodes of a WSAN. While aspects of this requirement have been examined in the literature, the big picture remains largely untouched, resulting in the generally static WSAN deployments we see today. In this article, we propose a comprehensive approach to managed software evolution. Our approach has the following key features: (i) it supports divergent evolution of the WSAN's software, such that different nodes can evolve along different lines (e.g., to meet the needs of different stakeholders, or to address localized adaptations) and (ii) it supports both instructed and autonomous evolution such that nodes can be instructed to change their software configuration or can evolve their own configuration (e.g., to manage rapidly-changing environmental conditions where remote micromanagement would be infeasible due to the high latency of the WSAN environment). We present the four intra-WSAN protocols that comprise our solution, along with an accompanying server-side infrastructure, and evaluate our approach at scale.", acknowledgement = ack-nhfb, articleno = "54", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Qin:2013:MUA, author = "Fei Qin and John E. Mitchell", title = "{AS-MAC}: Utilizing the adaptive spreading code length for wireless sensor networks", journal = j-TOSN, volume = "10", number = "1", pages = "1:1--1:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529921", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In many modern advanced Wireless Sensor Network (WSN) applications, the system is expected to deliver intensive traffic loads in harsh RF environment. In this article, an MAC protocol has been proposed which will utilize the adaptive spreading code length technique to increase network performance for these applications. In this architecture, the system can automatically determine the time varying channel quality and set the optimum spreading code length to maximize the throughput while minimizing the energy usage. Due to this adaptive feature, the system is able to deliver reliable wireless service even in the harsh RF environment. The design of such a protocol is also backwards compatible to enable its employment in both traditional and advanced WSN scenarios. Finally, the proposed protocol has been implemented in a COTS WSN platform to obtain the experimental result, which demonstrates the ability of being implemented on typical resource constraints WSN devices. The experimental results have shown the efficiency advantages of the proposed MAC protocol delivering 139\% higher throughput as well as having better energy performance than the standard IEEE 802.15.4 system.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chen:2013:EET, author = "Jiming Chen and Junkun Li and Shibo He and Tian He and Yu Gu and Youxian Sun", title = "On energy-efficient trap coverage in wireless sensor networks", journal = j-TOSN, volume = "10", number = "1", pages = "2:1--2:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529973", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In wireless sensor networks (WSNs), trap coverage has recently been proposed to trade off between the availability of sensor nodes and sensing performance. It offers an efficient framework to tackle the challenge of limited resources in large-scale sensor networks. Currently, existing works only studied the theoretical foundation of how to decide the deployment density of sensors to ensure the desired degree of trap coverage. However, practical issues, such as how to efficiently schedule sensor node to guarantee trap coverage under an arbitrary deployment, are still left untouched. In this article, we formally formulate the Minimum Weight Trap Cover Problem and prove it is an NP-hard problem. To solve the problem, we introduce a bounded approximation algorithm, called Trap Cover Optimization (TCO) to schedule the activation of sensors while satisfying specified trap coverage requirement. We design Localized Trap Coverage Protocol as the localized implementation of TCO. The performance of Minimum Weight Trap Coverage we find is proved to be at most $ O(\rho) $ times of the optimal solution, where $ \rho $ is the density of sensor nodes in the region. To evaluate our design, we perform extensive simulations to demonstrate the effectiveness of our proposed algorithm and show that our algorithm achieves at least 14\% better energy efficiency than the state-of-the-art solution.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2013:AFV, author = "Yi Wang and Guohong Cao", title = "Achieving full-view coverage in camera sensor networks", journal = j-TOSN, volume = "10", number = "1", pages = "3:1--3:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529974", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Camera sensors are different from traditional scalar sensors, as cameras at different positions can form very different views of the object. However, traditional coverage model does not consider this intrinsic property of camera sensors. To address this issue, a novel model called full-view coverage is proposed. It uses the angle between the object's facing direction and the camera's viewing direction to measure the quality of coverage. An object is full-view covered if there is always a camera to cover it no matter which direction it faces and the camera's viewing direction is sufficiently close to the object's facing direction. An efficient method is proposed for full-view coverage detection in any given camera sensor networks, and a sufficient condition on the sensor density needed for full-view coverage in a random uniform deployment is derived. In addition, the article shows a necessary and sufficient condition on the sensor density for full-view coverage in a triangular lattice-based deployment. Based on the full-view coverage model, the article further studies the barrier coverage problem. Existing weak and strong barrier coverage models are extended by considering direction issues in camera sensor networks. With these new models, weak/strong barrier coverage verification problems are introduced, and new detection methods are proposed and evaluated.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{ODonovan:2013:GSW, author = "Tony O'Donovan and James Brown and Felix B{\"u}sching and Alberto Cardoso and Jos{\'e} Cec{\'\i}lio and Jose {Do {\'O}} and Pedro Furtado and Paulo Gil and Anja Jugel and Wolf-Bastian P{\"o}ttner and Utz Roedig and Jorge S{\'a} Silva and Ricardo Silva and Cormac J. Sreenan and Vasos Vassiliou and Thiemo Voigt and Lars Wolf and Zinon Zinonos", title = "The {GINSENG} system for wireless monitoring and control: Design and deployment experiences", journal = j-TOSN, volume = "10", number = "1", pages = "4:1--4:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529975", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Today's industrial facilities, such as oil refineries, chemical plants, and factories, rely on wired sensor systems to monitor and control the production processes. The deployment and maintenance of such cabled systems is expensive and inflexible. It is, therefore, desirable to replace or augment these systems using wireless technology, which requires us to overcome significant technical challenges. Process automation and control applications are mission-critical and require timely and reliable data delivery, which is difficult to provide in industrial environments with harsh radio environments. In this article, we present the GINSENG system which implements performance control to allow us to use wireless sensor networks for mission-critical applications in industrial environments. GINSENG is a complete system solution that comprises on-node system software, network protocols, and back-end systems with sophisticated data processing capability. GINSENG assumes that a deployment can be carefully planned. A TDMA-based MAC protocol, tailored to the deployment environment, is employed to provide reliable and timely data delivery. Performance debugging components are used to unintrusively monitor the system performance and identify problems as they occur. The article reports on a real-world deployment of GINSENG in an especially challenging environment of an operational oil refinery in Sines, Portugal. We provide experimental results from this deployment and share the experiences gained. These results demonstate the use of GINSENG for sensing and actuation and allow an assessment of its ability to operate within the required performance bounds. We also identify shortcomings that manifested during the evaluation phase, thus giving a useful perspective on the challenges that have to be overcome in these harsh application settings.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Razzaque:2013:CWS, author = "M. A. Razzaque and Chris Bleakley and Simon Dobson", title = "Compression in wireless sensor networks: a survey and comparative evaluation", journal = j-TOSN, volume = "10", number = "1", pages = "5:1--5:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2528948", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks (WSNs) are highly resource constrained in terms of power supply, memory capacity, communication bandwidth, and processor performance. Compression of sampling, sensor data, and communications can significantly improve the efficiency of utilization of three of these resources, namely, power supply, memory and bandwidth. Recently, there have been a large number of proposals describing compression algorithms for WSNs. These proposals are diverse and involve different compression approaches. It is high time that these individual efforts are put into perspective and a more holistic view taken. In this article, we take a step in that direction by presenting a survey of the literature in the area of compression and compression frameworks in WSNs. A comparative study of the various approaches is also provided. In addition, open research issues, challenges and future research directions are highlighted.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tan:2013:CBA, author = "Guang Tan and Hongbo Jiang and Shengkai Zhang and Zhimeng Yin and Anne-Marie Kermarrec", title = "Connectivity-based and anchor-free localization in large-scale {$2$D\slash $3$D} sensor networks", journal = j-TOSN, volume = "10", number = "1", pages = "6:1--6:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529976", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A connectivity-based and anchor-free three-dimensional localization (CATL) scheme is presented for large-scale sensor networks with concave regions. It distinguishes itself from previous work with a combination of three features: (1) it works for networks in both 2D and 3D spaces, possibly containing holes or concave regions; (2) it is anchor-free and uses only connectivity information to faithfully recover the original network topology, up to scaling and rotation; (3) it does not depend on the knowledge of network boundaries, which suits it well to situations where boundaries are difficult to identify. The key idea of CATL is to discover the notch nodes, where shortest paths bend and hop-count-based distance starts to significantly deviate from the true Euclidean distance. An iterative protocol is developed that uses a notch-avoiding multilateration mechanism to localize the network. Simulations show that CATL achieves accurate localization results with a moderate per-node message cost.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yuan:2013:STA, author = "Yi Yuan and Dawei Pan and Dan Wang and Xiaohua Xu and Yu Peng and Xiyuan Peng and Peng-Jun Wan", title = "A study towards applying thermal inertia for energy conservation in rooms", journal = j-TOSN, volume = "10", number = "1", pages = "7:1--7:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529050", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We are in an age where people are paying increasing attention to energy conservation around the world. The heating and air-conditioning systems of buildings introduce one of the largest chunks of energy expenses. In this article, we make a key observation that after a meeting or a class ends in a room, the indoor temperature will not immediately increase to the outdoor temperature. We call this phenomenon thermal inertia. Thus, if we arrange subsequent meetings in the same room rather than in a room that has not been used for some time, we can take advantage of such undissipated cool or heated air and conserve energy. Though many existing energy conservation solutions for buildings can intelligently turn off facilities when people are absent, we believe that understanding thermal inertia can lead system designs to go beyond on-and-off-based solutions to a wider realm. We propose a framework for exploring thermal inertia in room management. Our framework contains two components. (1) The energy-temperature correlation model captures the relation between indoor temperature change and energy consumption. (2) The energy-aware scheduling algorithms: given information for the relation between energy and temperature change, energy-aware scheduling algorithms arrange meetings not only based on common restrictions, such as meeting time and room capacity requirement, but also energy consumptions. We identify the interface between these components so further works towards same on direction can make efforts on individual components. We develop a system to verify our framework. First, it has a wireless sensor network to collect indoor, outdoor temperature and electricity expenses of the heating or air-conditioning devices. Second, we build an energy-temperature correlation model for the energy expenses and the corresponding room temperature. Third, we develop room scheduling algorithms. In detail, we first extend the current sensor hardware so that it can record the electricity expenses in re-heating or re-cooling a room. As the sensor network needs to work unattendedly, we develop a hardware board for long-range communications so that the Imote2 can send data to a remote server without a computer relay close by. An efficient two-tiered sensor network is developed with our extended Imote2 and TelosB sensors. We apply laws of thermodynamics and build a correlation model of the energy needed to re-cool a room to a target temperature. Such model requires parameter calibration and uses the data collected from the sensor network for model refinement. Armed with the energy-temperature correlation model, we develop an optimal algorithm for a specified case, and we further develop two fast heuristics for different practical scenarios. Our demo system is validated with real deployment of a sensor network for data collection and thermodynamics model calibration. We conduct a comprehensive evaluation with synthetic room and meeting configurations, as well as real class schedules and classroom topologies of The Hong Kong Polytechnic University, academic calendar year of Spring 2011. We observe 20\% energy savings as compared with the current schedules.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ammari:2013:JCD, author = "Habib M. Ammari", title = "Joint $k$-coverage and data gathering in sparsely deployed sensor networks --- Impact of purposeful mobility and heterogeneity", journal = j-TOSN, volume = "10", number = "1", pages = "8:1--8:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529978", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Coverage is one of the fundamental concepts in the design of wireless sensor networks (WSNs) in the sense that the monitoring quality of a phenomenon depends on the quality of service provided by the sensors in terms of how well a field of interest is covered. It enables the sensors to detect any event that may occur in the field, thus, meeting the application-specific requirements. Several applications require k --- coverage, where each point in the field is covered by at least k sensors, which helps increase data availability to ensure better data reliability. Achieving k -coverage of a field of interest becomes a more challenging issue in sparsely deployed WSNs. Though the problem of coverage in WSNs has been well studied in the literature, only little research efforts have been devoted to the case of sparsely deployed WSNs. Thus, in this article, we investigate the problem of k -coverage in sparse WSNs using static and mobile sensors, which do not necessarily have the same communication range, sensing range, and energy supply. Precisely, we propose an optimized, generalized framework for k -coverage in sparsely deployed WSNs, called k -SCHEMES, which exploits sensor heterogeneity and mobility. First, we characterize k -coverage using heterogeneous sensors based on Helly 's Theorem. Second, we introduce our energy-efficient four-tier architecture to achieve mobile k -coverage of a region of interest in a field. Third, on top of this architecture, we suggest two data-gathering protocols, called direct data-gathering and forwarding chain-based data-gathering, using the concept of mobile proxy sink. We found that the second data-gathering protocol outperforms the first one. For energy-efficient forwarding, we compute the minimum transmission distance between any pair of consecutive mobile proxy sinks forming the forwarding chain as well as the corresponding optimum number of mobile proxy sinks in this chain. We corroborate our analysis with several simulation results.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ko:2013:GSC, author = "Ren-Song Ko and Po-Liang Lin and Pei-Yu Chiang", title = "{Gauss--Seidel} correction algorithm: a macroscopic model-derived routing algorithm for {WSNs}", journal = j-TOSN, volume = "10", number = "1", pages = "9:1--9:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529190", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A Gauss--Seidel correction (GSC) routing algorithm for wireless sensor networks is presented in which packets are transmitted with additional information which can be exchanged among nodes to correct the current routing paths and achieve load balancing. The problem considered here is single-class routing to one/multiple sinks with lifetime maximization as the objective. The formulation to correct the routing paths is not heuristic and takes its theoretical basis from a macroscopic model, that is, based on a set of partial differential equations iteratively solved by the Gauss--Seidel method. We then theoretically investigate the convergence of GSC. Furthermore, an initial value estimation algorithm is presented to alleviate the long-path problem during the delivery of the first several packets, thus accelerating the convergence of GSC. Simulation results show that GSC effectively achieves load balancing, particularly for regions of interest with holes.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yang:2013:ASS, author = "Ou Yang and Wendi Heinzelman", title = "An adaptive sensor sleeping solution based on sleeping multipath routing and duty-cycled {MAC} protocols", journal = j-TOSN, volume = "10", number = "1", pages = "10:1--10:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529977", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Various applications of wireless sensor networks require multihop data transmission over error-prone wireless links, hence multipath routing can be used to meet the application's reliability requirement. On the other hand, wireless sensors are usually battery powered, and thus it is very important to save energy in order to prolong the network lifetime. In this article, we propose (1) Sleeping Multipath Routing, which can trade off reliability and network lifetime by dynamically activating an optimal number of paths to support the application's reliability requirement and putting the rest of the sensors to sleep, and (2) an adaptive sensor sleeping solution, which includes Sleeping Multipath Routing, a duty-cycled MAC protocol, and cross-layer coordination to further prolong the network lifetime by putting sensors to sleep at both the routing and the MAC layers. Our proposed Sleeping Multipath Routing and adaptive sensor sleeping solution can be implemented on any multipath routing protocol that discovers multiple disjoint paths between two nodes, and any duty-cycled MAC protocol that has fixed cycle length. We show an example of implementing our adaptive sensor sleeping solution using Directed Diffusion and S-MAC. Simulation results show that our proposed adaptive sensor sleeping solution outperforms single-layer sensor sleeping with a longer network lifetime with required reliability support. Moreover, our proposed adaptive sensor sleeping solution can significantly prolong the network lifetime when the application's reliability requirement varies over time, or when the number of alive nodes in the network changes over time.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Oller:2013:DDP, author = "Joaquim Oller and Ilker Demirkol and Jordi Casademont and Josep Paradells", title = "Design, development, and performance evaluation of a low-cost, low-power wake-up radio system for wireless sensor networks", journal = j-TOSN, volume = "10", number = "1", pages = "11:1--11:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529452", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Energy-efficient operation is a challenge for wireless sensor networks (WSNs). A common method employed for this purpose is duty-cycled operation, which extends battery lifetime yet incurs several types of energy wastes and challenges. A promising alternative to duty-cycled operation is the use of wake-up radio (WuR), where the main microcontroller unit (MCU) and transceiver, that is, the two most energy-consuming elements, are kept in energy-saving mode until a special signal from another node is received by an attached, secondary, ultra-low power receiver. Next, this so-called wake-up receiver generates an interrupt to activate the receiver node's MCU and, consequently, the main radio. This article presents a complete wake-up radio design that targets simplicity in design for the monetary cost and flexibility concerns, along with a good operation range and very low power consumption. Both the transmitter (WuTx) and the receiver (WuRx) designs are presented with the accompanying physical experiments for several design alternatives. Detailed analysis of the end system is provided in terms of both operational distance (more than 10 m) and current consumption (less than 1 $ \mu $A). As a reference, a commercial WuR system is analyzed and compared to the presented system by expressing the trade-offs and advantages of both systems.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Park:2013:DCO, author = "Pangun Park and Sinem Coleri Ergen and Carlo Fischione and Alberto Sangiovanni-Vincentelli", title = "Duty-cycle optimization for {IEEE 802.15.4} wireless sensor networks", journal = j-TOSN, volume = "10", number = "1", pages = "12:1--12:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529979", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Most applications of wireless sensor networks require reliable and timely data communication with maximum possible network lifetime under low traffic regime. These requirements are very critical especially for the stability of wireless sensor and actuator networks. Designing a protocol that satisfies these requirements in a network consisting of sensor nodes with traffic pattern and location varying over time and space is a challenging task. We propose an adaptive optimal duty-cycle algorithm running on top of the IEEE 802.15.4 medium access control to minimize power consumption while meeting the reliability and delay requirements. Such a problem is complicated because simple and accurate models of the effects of the duty cycle on reliability, delay, and power consumption are not available. Moreover, the scarce computational resources of the devices and the lack of prior information about the topology make it impossible to compute the optimal parameters of the protocols. Based on an experimental implementation, we propose simple experimental models to expose the dependency of reliability, delay, and power consumption on the duty cycle at the node and validate it through extensive experiments. The coefficients of the experimental-based models can be easily computed on existing IEEE 802.15.4 hardware platforms by introducing a learning phase without any explicit information about data traffic, network topology, and medium access control parameters. The experimental-based model is then used to derive a distributed adaptive algorithm for minimizing the power consumption while meeting the reliability and delay requirements in the packet transmission. The algorithm is easily implementable on top of the IEEE 802.15.4 medium access control without any modifications of the protocol. An experimental implementation of the distributed adaptive algorithm on a test bed with off-the-shelf wireless sensor devices is presented. The experimental performance of the algorithms is compared to the existing solutions from the literature. The experimental results show that the experimental-based model is accurate and that the proposed adaptive algorithm attains the optimal value of the duty cycle, maximizing the lifetime of the network while meeting the reliability and delay constraints under both stationary and transient conditions. Specifically, even if the number of devices and their traffic configuration change sharply, the proposed adaptive algorithm allows the network to operate close to its optimal value. Furthermore, for Poisson arrivals, the duty-cycle protocol is modeled as a finite capacity queuing system in a star network. This simple analytical model provides insights into the performance metrics, including the reliability, average delay, and average power consumption of the duty-cycle protocol.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kominami:2013:CSO, author = "Daichi Kominami and Masashi Sugano and Masayuki Murata and Takaaki Hatauchi", title = "Controlled and self-organized routing for large-scale wireless sensor networks", journal = j-TOSN, volume = "10", number = "1", pages = "13:1--13:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529920", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Improving the scalability and robustness of wireless sensor networks is an important task, and much research on self-organization has been conducted toward this end. However, desired behavior is not yet guaranteed in much larger networks based on pure self-organization. In this article, we propose a controlled potential-based routing protocol implementing a novel controlled self-organization scheme that also allows for external control. The scheme obtains close-to-optimal network behavior by this external control which controls a part of nodes in the network. We show that global traffic flow can be controlled through simulation experiments with a multi-sink sensor network. For example, traffic loads can be equalized among heterogeneously distributed sink nodes, and load balancing among the relay nodes based on remaining energy can bring an approximate four times extension of network lifetime. The proposed method is furthermore robust to message loss and resilient to failure of the sink node.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Cuevas:2013:SDS, author = "{\'A}ngel Cuevas and Manuel Urue{\~n}a and Gustavo de Veciana and Aditya Yadav", title = "{STARR-DCS}: Spatio-temporal adaptation of random replication for data-centric storage", journal = j-TOSN, volume = "10", number = "1", pages = "14:1--14:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529980", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article presents a novel framework for data-centric storage (DCS) in a wireless sensor and actor network (WSAN) that employs a randomly selected set of data replication nodes, which also change over time. This enables reductions in the average network traffic and energy consumption by adapting the number of replicas to applications' traffic, while balancing energy burdens by varying their locations. To that end, we propose and validate a simple model to determine the optimal number of replicas, in terms of minimizing average traffic/energy consumption, based on measurements of applications' production and consumption traffic. Simple mechanisms are proposed to decide when the current set of replication nodes should be changed, to enable new applications and nodes to efficiently bootstrap into a working WSAN, to recover from failing nodes, and to adapt to changing conditions. Extensive simulations demonstrate that our approach can extend a WSAN's lifetime by at least 60\%, and up to a factor of $10 \times $ depending on the lifetime criterion being considered. The feasibility of the proposed framework has been validated in a prototype with 20 resource-constrained motes, and the results obtained via simulation for large WSANs have been also corroborated in that prototype.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Misra:2013:ART, author = "Prasant Misra and Navinda Kottege and Branislav Kusy and Diethelm Ostry and Sanjay Jha", title = "Acoustical ranging techniques in embedded wireless sensor networked devices", journal = j-TOSN, volume = "10", number = "1", pages = "15:1--15:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529981", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Location sensing provides endless opportunities for a wide range of applications in GPS-obstructed environments, where, typically, there is a need for a higher degree of accuracy. In this article, we focus on robust range estimation, an important prerequisite for fine-grained localization. Motivated by the promise of acoustic in delivering high ranging accuracy, we present the design, implementation, and evaluation of acoustic (both ultrasound and audible) ranging systems. We distill the limitations of acoustic ranging and present efficient signal designs and detection algorithms to overcome the challenges of coverage, range, accuracy/resolution, tolerance to Doppler's effect, and audible intensity. We evaluate our proposed techniques experimentally on TWEET, a low-power platform purpose-built for acoustic ranging applications. Our experiments demonstrate an operational range of 20m (outdoor) and an average accuracy $ \approx $ 2cm in the ultrasound domain. Finally, we present the design of an audible-range acoustic tracking service that encompasses the benefits of a near-inaudible acoustic broadband chirp and approximately two times increase in Doppler tolerance to achieve better performance.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Gnawali:2013:CER, author = "Omprakash Gnawali and Rodrigo Fonseca and Kyle Jamieson and Maria Kazandjieva and David Moss and Philip Levis", title = "{CTP}: an efficient, robust, and reliable collection tree protocol for wireless sensor networks", journal = j-TOSN, volume = "10", number = "1", pages = "16:1--16:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529988", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We describe CTP, a collection routing protocol for wireless sensor networks. CTP uses three techniques to provide efficient, robust, and reliable routing in highly dynamic network conditions. CTP's link estimator accurately estimates link qualities by using feedback from both the data and control planes, using information from multiple layers through narrow, platform-independent interfaces. Second, CTP uses the Trickle algorithm to time the control traffic, sending few beacons in stable topologies yet quickly adapting to changes. Finally, CTP actively probes the topology with data traffic, quickly discovering and fixing routing failures. Through experiments on 13 different testbeds, encompassing seven platforms, six link layers, and multiple densities and frequencies, and detailed observations of a long-running sensor network application that uses CTP, we study how these three techniques contribute to CTP's overall performance.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kamthe:2013:IWL, author = "Ankur Kamthe and Miguel {\'A}. Carreira-Perpi{\~n}{\'a}n and Alberto E. Cerpa", title = "Improving wireless link simulation using multilevel {Markov} models", journal = j-TOSN, volume = "10", number = "1", pages = "17:1--17:??", month = nov, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2529991", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:30 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Modeling the behavior of 802.15.4 links is a nontrivial problem, because 802.15.4 links experience different level of dynamics at short and long time scales. This makes the design of a suitable model that combines the different dynamics at different time scales a nontrivial problem. We propose a novel multilevel approach, the M{\&}M model, involving hidden Markov models (HMMs) and mixtures of multivariate Bernoullis (MMBs) for modeling the long and short time-scale behavior of wireless links from 802.15.4 test beds. We characterize the synthetic traces generated from our model of the wireless link in terms of the mean and variance of the packet reception rates from the data traces, comparison of distributions of run lengths, and conditional packet delivery functions of successive packet receptions (1's) and losses (0's). Our results show that when compared to the closest-fit pattern matching model in TOSSIM, the proposed modeling approach is able to mimic the behavior of the data traces quite closely, with differences in packet reception rates of the empirical and simulated traces of less than 1.9\% on average and 6.6\% in the worst case. Moreover, the simulated links from our proposed approach were able to account for long runs of 1's and 0's as observed in empirical data traces.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Karakaya:2014:CLV, author = "Mahmut Karakaya and Hairong Qi", title = "Collaborative localization in visual sensor networks", journal = j-TOSN, volume = "10", number = "2", pages = "18:1--18:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2529999", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Collaboration in visual sensor networks is essential not only to compensate for the limitations of each sensor node but also to tolerate inaccurate information generated by faulty sensors. This article focuses on the design of a collaborative target localization algorithm that is resilient to sensor faults. We first develop a distributed solution to fault-tolerant target localization based on a so-called certainty map. To tolerate potential sensor faults, a voting mechanism is adopted and a threshold value needs to be specified which is the key to the realization of the distributed solution. Analytical study is conducted to derive the lower and upper bounds for the threshold such that the probability of faulty sensors negatively impacts the localization performance is less than a small value. Second, we focus on the detection and correction of one type of sensor faults, error in camera orientation. We construct a generative image model in each camera based on the detected target location to estimate camera's orientation, detect inaccuracies in camera orientations and correct them before they cascade. Based on results obtained from both simulation and real experiments, we show that the proposed method is effective in localization accuracy as well as fault detection and correction performance.", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wan:2014:DDA, author = "Jiuqing Wan and Li Liu", title = "Distributed data association in smart camera networks using belief propagation", journal = j-TOSN, volume = "10", number = "2", pages = "19:1--19:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530000", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "One of the fundamental requirements for visual surveillance with smart camera networks is the correct association of camera's observations with the tracks of objects under tracking. Most of the current systems work in a centralized manner in that the observations on all cameras need to be transmitted to a central server where some data association algorithm is running. Recently some works have been shown for distributed data association based solely on appearance observation. However, how to perform distributed association inference using both appearance and spatio-temporal information is still unclear. In this article, we present a novel method for estimating the posterior distribution of the label of each observation, indicating which of the objects it comes from, based on belief propagation between neighboring cameras. We develop distributed forward and backward inference algorithms for online and offline application, respectively, and further extend the algorithms to the case of unreliable detection. We also incorporate the proposed inference algorithms into distributed EM framework to simultaneously solve the problem of data association and appearance model learning in a completely distributed manner. The proposed method is verified on artificial data and on real world observations collected by a camera networks in an office building.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Esterle:2014:SEV, author = "Lukas Esterle and Peter R. Lewis and Xin Yao and Bernhard Rinner", title = "Socio-economic vision graph generation and handover in distributed smart camera networks", journal = j-TOSN, volume = "10", number = "2", pages = "20:1--20:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530001", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article we present an approach to object tracking handover in a network of smart cameras, based on self-interested autonomous agents, which exchange responsibility for tracking objects in a market mechanism, in order to maximise their own utility. A novel ant-colony inspired mechanism is used to learn the vision graph, that is, the camera neighbourhood relations, during runtime, which may then be used to optimise communication between cameras. The key benefits of our completely decentralised approach are on the one hand generating the vision graph online, enabling efficient deployment in unknown scenarios and camera network topologies, and on the other hand relying only on local information, increasing the robustness of the system. Since our market-based approach does not rely on a priori topology information, the need for any multicamera calibration can be avoided. We have evaluated our approach both in a simulation study and in network of real distributed smart cameras.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Deligiannis:2014:PRW, author = "Nikos Deligiannis and Frederik Verbist and J{\"u}rgen Slowack and Rik van de Walle and Peter Schelkens and Adrian Munteanu", title = "Progressively refined {Wyner--Ziv} video coding for visual sensors", journal = j-TOSN, volume = "10", number = "2", pages = "21:1--21:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530279", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wyner-Ziv video coding constitutes an alluring paradigm for visual sensor networks, offering efficient video compression with low complexity encoding characteristics. This work presents a novel hash-driven Wyner-Ziv video coding architecture for visual sensors, implementing the principles of successively refined Wyner-Ziv coding. To this end, so-called side-information refinement levels are constructed for a number of grouped frequency bands of the discrete cosine transform. The proposed codec creates side-information by means of an original overlapped block motion estimation and pixel-based multihypothesis prediction technique, specifically built around the pursued refinement strategy. The quality of the side-information generated at every refinement level is successively improved, leading to gradually enhanced Wyner-Ziv coding performance. Additionally, this work explores several temporal prediction structures, including a new hierarchical unidirectional prediction structure, providing both temporal scalability and low delay coding. Experimental results include a thorough evaluation of our novel Wyner-Ziv codec, assessing the impact of the proposed successive refinement scheme and the supported temporal prediction structures for a wide range of hash configurations and group of pictures sizes. The results report significant compression gains with respect to benchmark systems in Wyner-Ziv video coding (e.g., up to 42.03\% over DISCOVER) as well as versus alternative state-of-the-art schemes refining the side-information.", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Shin:2014:PDC, author = "Paul J. Shin and Johnny Park and Avinash C. Kak", title = "A predictive duty cycle adaptation framework using augmented sensing for wireless camera networks", journal = j-TOSN, volume = "10", number = "2", pages = "22:1--22:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530280", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Energy efficiency dominates practically every aspect of the design of a wireless sensor network and duty cycling is an important tool for achieving high energy efficiencies. Duty cycling for wireless camera networks meant for tracking objects is made complex by the nodes having to anticipate the arrival of the objects in their field-of-view. The consequences of an object arriving in the view-region of a camera when it is sleeping need no elaboration. Our work presents a predictive framework to provide nodes with an ability to anticipate the arrival of objects in the field-of-view of their cameras. Our predictive framework differs from others in that the nodes whose duty cycles are increased are at least one step removed from the immediate neighborhood of the nodes where the objects are currently visible. By eliminating the need for the currently busiest nodes to also be in charge of informing their nonbusy immediate neighbors to get ready for object arrival, we end up with a more robust strategy for updating the duty cycle at the nodes where the objects are highly likely to appear soon. The proposed scheme works by using an existing MAC header bit that is already in the 802.15.4 protocol and, in that sense, our anticipatory approach for notifying the nodes about the current state of the object location entails no additional expenditure of energy. Our contribution includes evaluations based on large-scale simulations as well as real experiments with an Imote2-based wireless camera network.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tessens:2014:CST, author = "Linda Tessens and Marleen Morbee and Hamid Aghajan and Wilfried Philips", title = "Camera selection for tracking in distributed smart camera networks", journal = j-TOSN, volume = "10", number = "2", pages = "23:1--23:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530281", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Tracking persons with multiple cameras with overlapping fields of view instead of with one camera leads to more robust decisions. However, operating multiple cameras instead of one requires more processing power and communication bandwidth, which are limited resources in practical networks. When the fields of view of different cameras overlap, not all cameras are equally needed for localizing a tracking target. When only a selected set of cameras do processing and transmit data to track the target, a substantial saving of resources is achieved. The recent introduction of smart cameras with on-board image processing and communication hardware makes such a distributed implementation of tracking feasible. We present a novel framework for selecting cameras to track people in a distributed smart camera network that is based on generalized information-theory. By quantifying the contribution of one or more cameras to the tracking task, the limited network resources can be allocated appropriately, such that the best possible tracking performance is achieved. With the proposed method, we dynamically assign a subset of all available cameras to each target and track it in difficult circumstances of occlusions and limited fields of view with the same accuracy as when using all cameras.", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Gruenwedel:2014:LCS, author = "Sebastian Gruenwedel and Vedran Jelaca and Jorge Oswaldo Nino-Castaneda and Peter van Hese and Dimitri van Cauwelaert and Dirk van Haerenborgh and Peter Veelaert and Wilfried Philips", title = "Low-complexity scalable distributed multicamera tracking of humans", journal = j-TOSN, volume = "10", number = "2", pages = "24:1--24:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530282", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Real-time tracking of people has many applications in computer vision, especially in the domain of surveillance. Typically, a network of cameras is used to solve this task. However, real-time tracking remains challenging due to frequent occlusions and environmental changes. Besides, multicamera applications often require a trade-off between accuracy and communication load within a camera network. In this article, we present a real-time distributed multicamera tracking system for the analysis of people in a meeting room. One contribution of the article is that we provide a scalable solution using smart cameras. The system is scalable because it requires a very small communication bandwidth and only light-weight processing on a ``fusion center'' which produces final tracking results. The fusion center can thus be cheap and can be duplicated to increase reliability. In the proposed decentralized system all low level video processing is performed on smart cameras. The smart cameras transmit a compact high-level description of moving people to the fusion center, which fuses this data using a Bayesian approach. A second contribution in our system is that the camera-based processing takes feedback from the fusion center about the most recent locations and motion states of tracked people into account. Based on this feedback and background subtraction results, the smart cameras generate a best hypothesis for each person. We evaluate the performance (in terms of precision and accuracy) of the tracker in indoor and meeting scenarios where individuals are often occluded by other people and/or furniture. Experimental results are presented based on the tracking of up to 4 people in a meeting room of 9 m by 5 m using 6 cameras. In about two hours of data, our method has only 0.3 losses per minute and can typically measure the position with an accuracy of 21 cm. We compare our approach to state-of-the-art methods and show that our system performs at least as good as other methods. However, our system is capable to run in real-time and therefore produces instantaneous results.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ilie:2014:OCA, author = "Adrian Ilie and Greg Welch", title = "Online control of active camera networks for computer vision tasks", journal = j-TOSN, volume = "10", number = "2", pages = "25:1--25:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530283", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Large networks of cameras have been increasingly employed to capture dynamic events for tasks such as surveillance and training. When using active cameras to capture events distributed throughout a large area, human control becomes impractical and unreliable. This has led to the development of automated approaches for online camera control. We introduce a new automated camera control approach that consists of a stochastic performance metric and a constrained optimization method. The metric quantifies the uncertainty in the state of multiple points on each target. It uses state-space methods with stochastic models of target dynamics and camera measurements. It can account for occlusions, accommodate requirements specific to the algorithms used to process the images, and incorporate other factors that can affect their results. The optimization explores the space of camera configurations over time under constraints associated with the cameras, the predicted target trajectories, and the image processing algorithms. The approach can be applied to conventional surveillance tasks (e.g., tracking or face recognition), as well as tasks employing more complex computer vision methods (e.g., markerless motion capture or 3D reconstruction).", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kuo:2014:CWA, author = "Thomas Kuo and Zefeng Ni and Santhoshkumar Sunderrajan and B. S. Manjunath", title = "Calibrating a wide-area camera network with non-overlapping views using mobile devices", journal = j-TOSN, volume = "10", number = "2", pages = "26:1--26:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530284", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In a wide-area camera network, cameras are often placed such that their views do not overlap. Collaborative tasks such as tracking and activity analysis still require discovering the network topology including the extrinsic calibration of the cameras. This work addresses the problem of calibrating a fixed camera in a wide-area camera network in a global coordinate system so that the results can be shared across calibrations. We achieve this by using commonly available mobile devices such as smartphones. At least one mobile device takes images that overlap with a fixed camera's view and records the GPS position and 3D orientation of the device when an image is captured. These sensor measurements (including the image, GPS position, and device orientation) are fused in order to calibrate the fixed camera. This article derives a novel maximum likelihood estimation formulation for finding the most probable location and orientation of a fixed camera. This formulation is solved in a distributed manner using a consensus algorithm. We evaluate the efficacy of the proposed methodology with several simulated and real-world datasets.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{deLeo:2014:MVS, author = "Carter de Leo and B. S. Manjunath", title = "Multicamera video summarization and anomaly detection from activity motifs", journal = j-TOSN, volume = "10", number = "2", pages = "27:1--27:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530285", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Camera network systems generate large volumes of potentially useful data, but extracting value from multiple, related videos can be a daunting task for a human reviewer. Multicamera video summarization seeks to make this task more tractable by generating a reduced set of output summary videos that concisely capture important portions of the input set. We present a system that approaches summarization at the level of detected activity motifs and shortens the input videos by compacting the representation of individual activities. Additionally, redundancy is removed across camera views by omitting from the summary activity occurrences that can be predicted by other occurrences. The system also detects anomalous events within a unified framework and can highlight them in the summary. Our contributions are a method for selecting useful parts of an activity to present to a viewer using activity motifs and a novel framework to score the importance of activity occurrences and allow transfer of importance between temporally related activities without solving the correspondence problem. We provide summarization results for a two camera network, an eleven camera network, and data from PETS 2001. We also include results from Amazon Mechanical Turk human experiments to evaluate how our visualization decisions affect task performance.", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhang:2014:AIP, author = "Hongwei Zhang and Xin Che and Xiaohui Liu and Xi Ju", title = "Adaptive instantiation of the protocol interference model in wireless networked sensing and control", journal = j-TOSN, volume = "10", number = "2", pages = "28:1--28:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530286", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Interference model is the basis of MAC protocol design in wireless networked sensing and control, and it directly affects the efficiency and predictability of wireless messaging. To exploit the strengths of both the physical and the protocol interference models, we analyze how network traffic, link length, and wireless signal attenuation affect the optimal instantiation of the protocol model. We also identify the inherent trade-off between reliability and throughput in the model instantiation. Our analysis sheds light on the open problem of efficiently optimizing the protocol model instantiation. Based on the analytical results, we propose the physical-ratio-K (PRK) interference model as a reliability-oriented instantiation of the protocol model. Via analysis, simulation, and testbed-based measurement, we show that PRK-based scheduling achieves a network throughput very close to (e.g., 95\%) what is enabled by physical-model-based scheduling while ensuring the required packet delivery reliability. The PRK model inherits both the high fidelity of the physical model and the locality of the protocol model, thus it is expected to be suitable for distributed protocol design. These findings shed new light on wireless interference models; they also suggest new approaches to MAC protocol design in the presence of uncertainties in network and environmental conditions as well as application QoS requirements.", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kapnadak:2014:OND, author = "Vibhav Kapnadak and Edward J. Coyle", title = "Optimal nonuniform deployment of sensors for distributed detection in wireless sensor networks", journal = j-TOSN, volume = "10", number = "2", pages = "29:1--29:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530288", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We determine the optimal nonuniform spatial density of nodes in a single-hop Wireless Sensor Network (WSN) whose task is the distributed detection of a target within its sensing field. The optimization approach accounts for such factors as the Medium Access Control (MAC) protocol being used, the wireless channel's propagation characteristics, a randomized sleep/wake-up scheduling protocol, network coverage constraints, the energy consumed, the time to reach a decision, and the number of nodes in the network. The node density that minimizes the average Decision Error Probability (DEP) when a node at the center of the network serves as the Cluster Head (CH) is shown to be a function of the distance from this CH. The solution of this optimization problem and simulations demonstrate both the significant performance improvement provided by nonuniform spatial densities and the trade-offs that are possible amongst energy, network lifetime, detection performance, and time to reach a decision.", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2014:MLA, author = "Dong Wang and Lance Kaplan and Tarek F. Abdelzaher", title = "Maximum likelihood analysis of conflicting observations in social sensing", journal = j-TOSN, volume = "10", number = "2", pages = "30:1--30:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530289", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article addresses the challenge of truth discovery from noisy social sensing data. The work is motivated by the emergence of social sensing as a data collection paradigm of growing interest, where humans perform sensory data collection tasks. Unlike the case with well-calibrated and well-tested infrastructure sensors, humans are less reliable, and the likelihood that participants' measurements are correct is often unknown a priori. Given a set of human participants of unknown trustworthiness together with their sensory measurements, we pose the question of whether one can use this information alone to determine, in an analytically founded manner, the probability that a given measurement is true. In our previous conference paper, we offered the first maximum likelihood solution to the aforesaid truth discovery problem for corroborating observations only. In contrast, this article extends the conference paper and provides the first maximum likelihood solution to handle the cases where measurements from different participants may be conflicting. The article focuses on binary measurements. The approach is shown to outperform our previous work used for corroborating observations, the state-of-the-art fact-finding baselines, as well as simple heuristics such as majority voting.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Khan:2014:TIC, author = "Mohammad Maifi Hasan Khan and Hieu Khac Le and Hossein Ahmadi and Tarek F. Abdelzaher and Jiawei Han", title = "Troubleshooting interactive complexity bugs in wireless sensor networks using data mining techniques", journal = j-TOSN, volume = "10", number = "2", pages = "31:1--31:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530290", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article presents a tool for uncovering bugs due to interactive complexity in networked sensing applications. Such bugs are not localized to one component that is faulty, but rather result from complex and unexpected interactions between multiple often individually nonfaulty components. Moreover, the manifestations of these bugs are often not repeatable, making them particularly hard to find, as the particular sequence of events that invokes the bug may not be easy to reconstruct. Because of the distributed nature of failure scenarios, our tool looks for sequences of events that may be responsible for faulty behavior, as opposed to localized bugs such as a bad pointer in a module. We identified several challenges in applying discriminative sequence mining for root cause analysis when the system fails to perform as expected and presented our solutions to those challenges. We also present two alternative schemes, namely, two-stage mining and the progressive discriminative sequence mining to address the scalability challenge. An extensible framework is developed where a front-end collects runtime data logs of the system being debugged and an offline back-end uses frequent discriminative pattern mining to uncover likely causes of failure. We provided several case studies where we applied our tool successfully to troubleshoot the cause of the problem. We uncovered a kernel-level race condition bug in the LiteOS operating system and a protocol design bug in the directed diffusion protocol. We also presented a case study of debugging a multichannel MAC protocol that was found to exhibit corner cases of poor performance (worse than single-channel MAC). The tool helped to uncover event sequences that lead to a highly degraded mode of operation. Fixing the problem significantly improved the performance of the protocol. We also evaluated the extensions presented in this article. Finally, we provided a detailed analysis of tool overhead in terms of memory requirements and impact on the running application.", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kusy:2014:RDR, author = "Branislav Kusy and David Abbott and Christian Richter and Cong Huynh and Mikhail Afanasyev and Wen Hu and Michael Br{\"u}nig and Diethelm Ostry and Raja Jurdak", title = "Radio diversity for reliable communication in sensor networks", journal = j-TOSN, volume = "10", number = "2", pages = "32:1--32:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530291", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Radio connectivity in wireless sensor networks is highly intermittent due to unpredictable and time-varying noise and interference patterns in the environment. Because link qualities are not predictable prior to deployment, current deterministic solutions to unreliable links, such as increasing network density or transmission power, require overprovisioning of network resources and do not always improve reliability. We propose a new dual-radio network architecture to improve communication reliability in wireless sensor networks. Specifically, we show that radio transceivers operating at well-separated frequencies and spatially separated antennas offer robust communication, high link diversity, and better interference mitigation. We derive the optimal parameters for the dual-transceiver setup from frequency and space diversity in theory. We observe that frequency diversity holds the most benefits as long as the antennas are sufficiently separated to prevent coupling. Our experiments on an indoor/outdoor testbed confirm the theoretical predictions and show that radio diversity can significantly improve end-to-end delivery rates and network stability at only a small increase in energy cost over a single radio. Simulation experiments further validate the improvements in multiple topology configurations, but also reveal that the benefits of radio diversity are coupled to the number of available routing paths to the destination.", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Mavrinac:2014:CQS, author = "Aaron Mavrinac and Xiang Chen and Yonghong Tan", title = "Coverage quality and smoothness criteria for online view selection in a multi-camera network", journal = j-TOSN, volume = "10", number = "2", pages = "33:1--33:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530373", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The problem of online selection of monocular view sequences for an arbitrary task in a calibrated multi-camera network is investigated. An objective function for the quality of a view sequence is derived from a novel task-oriented, model-based instantaneous coverage quality criterion and a criterion of the smoothness of view transitions over time. The former is quantified by a priori information about the camera system, environment, and task generally available in the target application class. The latter is derived from qualitative definitions of undesirable transition effects. A scalable online algorithm with robust suboptimal performance is presented based on this objective function. Experimental results demonstrate the performance of the method-and therefore the criteria-as well as its robustness to several identified sources of nonsmoothness.", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Thai:2014:DTV, author = "My T. Thai and Ravi Tiwari and Raja Bose and Abdelsalam Helal", title = "On detection and tracking of variant phenomena clouds", journal = j-TOSN, volume = "10", number = "2", pages = "34:1--34:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530525", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Phenomena clouds are characterized by nondeterministic, dynamic variations of shapes, sizes, direction, and speed of motion along multiple axes. The phenomena detection and tracking should not be limited to some traditional applications such as oil spills and gas clouds but also be utilized to more accurately observe other types of phenomena such as walking motion of people. This wider range of applications requires more reliable, in-situ techniques that can accurately adapt to the dynamics of phenomena. Unfortunately, existing works which only focus on simple and well-defined shapes of phenomena are no longer sufficient. In this article, we present a new class of applications together with several distributed algorithms to detect and track phenomena clouds, regardless of their shapes and movement direction. We first propose a distributed algorithm for in-situ detection and tracking of phenomena clouds in a sensor space. We next provide a mathematical model to optimize the energy consumption, on which we further propose a localized algorithm to minimize the resource utilization. Our proposed approaches not only ensure low processing and networking overhead at the centralized query processor but also minimize the number of sensors which are actively involved in the detection and tracking processes. We validate our approach using both real-life smart home applications and simulation experiments, which confirm the effectiveness of our proposed algorithms. We also show that our algorithms result in significant reduction in resource usage and power consumption as compared to contemporary stream-based approaches.", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kamal:2014:FDW, author = "Abu Raihan M. Kamal and Chris J. Bleakley and Simon Dobson", title = "Failure detection in wireless sensor networks: a sequence-based dynamic approach", journal = j-TOSN, volume = "10", number = "2", pages = "35:1--35:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530526", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless Sensor Network (WSN) technology has recently moved out of controlled laboratory settings to real-world deployments. Many of these deployments experience high rates of failure. Common types of failure include node failure, link failure, and node reboot. Due to the resource constraints of sensor nodes, existing techniques for fault detection in enterprise networks are not applicable. Previously proposed WSN fault detection algorithms either rely on periodic transmission of node status data or inferring node status based on passive information collection. The former approach significantly reduces network lifetime, while the latter achieves poor accuracy in dynamic or large networks. Herein, we propose Sequence-Based Fault Detection (SBFD), a novel framework for network fault detection in WSNs. The framework exploits in-network packet tagging using the Fletcher checksum and server-side network path analysis to efficiently deduce the path of all packets sent to the sink. The sink monitors the extracted packet paths to detect persistent path changes which are indicative of network failures. When a failure is suspected, the sink uses control messages to check the status of the affected nodes. SBFD was implemented in TinyOS on TelosB motes and its performance was assessed in a testbed network and in TOSSIM simulation. The method was found to achieve a fault detection accuracy of 90.7\% to 95.0\% for networks of 25 to 400 nodes at the cost of 0.164\% to 0.239\% additional control packets and a 0.5\% reduction in node lifetime due to in-network packet tagging. Finally, a comparative study was conducted with existing solutions.", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Donmez:2014:APC, author = "Mehmet Yunus Donmez and Sinan Isik and Cem Ersoy", title = "Analysis of a prioritized contention model for multimedia wireless sensor networks", journal = j-TOSN, volume = "10", number = "2", pages = "36:1--36:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530527", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Emerging multimedia applications for sensor networks require the co-existence of different types of traffic with different QoS provisions in terms of latency and throughput. Prioritization-based service differentiation mechanisms are applied in all layers of communication to satisfy the QoS requirements of each traffic class. The prioritization in the contention is one of these differentiation methods applied in the medium access layer. In this article, we propose an analytical model for the contention latencies and energy expenditures of different classes in a prioritized contention structure with uniform backoff scheme. The contention window is divided into three partitions which are allocated for the use of only high-priority, both priorities, and only low-priority classes. We further generalize the model for binary exponential backoff schemes and for more than two priority classes. In the analysis, we explore the optimum sizes of these partitions in terms of contention latency and the total energy expenditure for each priority class. Our model is also useful for the evaluation of various recent contention prioritization schemes in WSNs.", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liu:2014:DDL, author = "Tao Liu and Alberto E. Cerpa", title = "Data-driven link quality prediction using link features", journal = j-TOSN, volume = "10", number = "2", pages = "37:1--37:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2530535", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Mar 13 07:56:33 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "As an integral part of reliable communication in wireless networks, effective link estimation is essential for routing protocols. However, due to the dynamic nature of wireless channels, accurate link quality estimation remains a challenging task. In this article, we propose 4C, a novel link estimator that applies link quality prediction along with link estimation. Our approach is data driven and consists of three steps: data collection, offline modeling, and online prediction. The data collection step involves gathering link quality data, and based on our analysis of the data, we propose a set of guidelines for the amount of data to be collected in our experimental scenarios. The modeling step includes offline prediction model training and selection. We present three prediction models that utilize different machine learning methods, namely, naive Bayes classifier, logistic regression, and artificial neural networks. Our models take a combination of PRR and the physical-layer information, that is, Received Signal Strength Indicator (RSSI), Signal-to-Noise Ratio (SNR), and Link Quality Indicator (LQI) as input, and output the success probability of delivering the next packet. From our analysis and experiments, we find that logistic regression works well among the three models with small computational cost. Finally, the third step involves the implementation of 4C, a receiver-initiated online link quality prediction module that computes the short temporal link quality. We conducted extensive experiments in the Motelab and our local indoor testbeds, as well as an outdoor deployment. Our results with single- and multiple-senders experiments show that with 4C, CTP improves the average cost of delivering a packet by 20\% to 30\%. In some cases, the improvement is larger than 45\%.", acknowledgement = ack-nhfb, articleno = "37", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Li:2014:TEF, author = "Zhenjiang Li and Mo Li and Yunhao Liu", title = "Towards Energy-Fairness in Asynchronous Duty-Cycling Sensor Networks", journal = j-TOSN, volume = "10", number = "3", pages = "38:1--38:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2490256", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we investigate the problem of controlling node sleep intervals so as to achieve the min-max energy fairness in asynchronous duty-cycling sensor networks. We propose a mathematical model to describe the energy efficiency of such networks and observe that traditional sleep interval setting strategies, for example, operating sensor nodes with an identical sleep interval, or intuitive control heuristics, for example, greedily increasing sleep intervals of sensor nodes with high energy consumption rates, hardly perform well in practice. There is an urgent need to develop an efficient sleep interval control strategy for achieving fair and high energy efficiency. To this end, we theoretically formulate the Sleep Interval Control (SIC) problem and find out that it is a convex optimization problem. By utilizing the convex property, we decompose the original problem and propose a distributed algorithm, called GDSIC. In GDSIC, sensor nodes can tune sleep intervals through a local information exchange such that the maximum energy consumption rate of the network approaches to be minimized. The algorithm is self-adjustable to the traffic load variance and is able to serve as a unified framework for a variety of asynchronous duty-cycling MAC protocols. We implement our approach in a prototype system and test its feasibility and applicability on a 50-node testbed. We further conduct extensive trace-driven simulations to examine the efficiency and scalability of our algorithm with various settings.", acknowledgement = ack-nhfb, articleno = "38", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Hauer:2014:LHM, author = "Jan-Hinrich Hauer", title = "Leveraging Human Mobility for Communication in Body Area Networks", journal = j-TOSN, volume = "10", number = "3", pages = "39:1--39:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2491110", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "When a person is walking the RF signal strength of an on-body communication link may exhibit significant fluctuation with peak-to-peak amplitudes beyond 20 dB. Instantaneous signal strength may be noisy, but the smoothed signal typically exhibits a period that matches the person's stride period. We present an opportunistic packet scheduler that extracts a set of Received Signal Strength Indicator (RSSI) samples from application traffic and utilizes an accelerometer to monitor the person's gait cycle. Packets are scheduled based on previous RSSI peaks and the current offset within the gait cycle. We formulate the task of finding a nonoverlapping packet schedule among the different body area network (BAN) devices as a linear programming problem and present an efficient way of solving it with the simplex method. Our experimental evaluation shows that outdoors BAN links with PRR (ratio of correctly received to transmitted packets) values between 50\% and 90\% can typically be turned into reliable links with PRR values well above 90\%. Indoors the improvements are smaller, but still significant at low transmission power. The main price is an increase in packet delivery latency. The energy consumed by the devices is marginal, but the coordinator spends more energy due to signal processing.", acknowledgement = ack-nhfb, articleno = "39", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Guo:2014:DFN, author = "Shuo Guo and Heng Zhang and Ziguo Zhong and Jiming Chen and Qing Cao and Tian He", title = "Detecting Faulty Nodes with Data Errors for Wireless Sensor Networks", journal = j-TOSN, volume = "10", number = "3", pages = "40:1--40:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2594773", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless Sensor Networks (WSN) promise researchers a powerful instrument for observing sizable phenomena with fine granularity over long periods. Since the accuracy of data is important to the whole system's performance, detecting nodes with faulty readings is an essential issue in network management. As a complementary solution to detecting nodes with functional faults, this article, proposes FIND, a novel method to detect nodes with data faults that neither assumes a particular sensing model nor requires costly event injections. After the nodes in a network detect a natural event, FIND ranks the nodes based on their sensing readings as well as their physical distances from the event. FIND works for systems where the measured signal attenuates with distance. A node is considered faulty if there is a significant mismatch between the sensor data rank and the distance rank. Theoretically, we show that average ranking difference is a provable indicator of possible data faults. FIND is extensively evaluated in simulations and two test bed experiments with up to 25 MicaZ nodes. Evaluation shows that FIND has a less than 5\% miss detection rate and false alarm rate in most noisy environments.", acknowledgement = ack-nhfb, articleno = "40", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tan:2014:CPL, author = "Guang Tan and Hongbo Jiang and Jun Liu and Anne-Marie Kermarrec", title = "Convex Partitioning of Large-Scale Sensor Networks in Complex Fields: Algorithms and Applications", journal = j-TOSN, volume = "10", number = "3", pages = "41:1--41:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2594772", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "When a sensor network grows large, or when its topology becomes complex (e.g., containing many holes), network algorithms designed with a smaller or simpler setting in mind may be rendered rather inefficient. We propose to address this problem using a divide and conquer approach: the network is divided into convex pieces by a distributed convex partitioning protocol, using connectivity information only. A convex network partition exhibits some desirable properties that allow traditional algorithms to work to their full advantage. Based on this, we can achieve relatively high performance for an algorithm by combining algorithmic actions within individual partitions. We consider two important applications: virtual-coordinate-based geographic routing and connectivity-based localization. The former benefits from convex partition's friendliness to network embedding, which is crucial to generating accurate virtual coordinates for the nodes, while the latter leverages the fact that shortest paths are largely straight for node pairs within a convex partition. Experimental results show that the convex partition approach can significantly improve the performance of both applications in comparison with state-of-the-art solutions.", acknowledgement = ack-nhfb, articleno = "41", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Erickson:2014:OMP, author = "Varick L. Erickson and Miguel {\'A}. Carreira-Perpi{\~n}{\'a}n and Alberto E. Cerpa", title = "Occupancy Modeling and Prediction for Building Energy Management", journal = j-TOSN, volume = "10", number = "3", pages = "42:1--42:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2594771", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Heating, cooling and ventilation accounts for 35\% energy usage in the United States. Currently, most modern buildings still condition rooms assuming maximum occupancy rather than actual usage. As a result, rooms are often over-conditioned needlessly. Thus, in order to achieve efficient conditioning, we require knowledge of occupancy. This article shows how real time occupancy data from a wireless sensor network can be used to create occupancy models, which in turn can be integrated into building conditioning system for usage-based demand control conditioning strategies. Using strategies based on sensor network occupancy model predictions, we show that it is possible to achieve 42\% annual energy savings while still maintaining American Society of Heating, Refrigerating and Air-Conditioning Engineers (ASHRAE) comfort standards.", acknowledgement = ack-nhfb, articleno = "42", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Nguyen:2014:CMF, author = "Diep N. Nguyen and Marwan Krunz", title = "A Cooperative {MIMO} Framework for Wireless Sensor Networks", journal = j-TOSN, volume = "10", number = "3", pages = "43:1--43:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2499381", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We explore the use of cooperative multi-input multi-output (MIMO) communications to prolong the lifetime of a wireless sensor network (WSN). Single-antenna sensor nodes are clustered into virtual antenna arrays that can act as virtual MIMO (VMIMO) nodes. We design a distributed cooperative clustering protocol (CCP), which exploits VMIMO's diversity gain by optimally selecting the cooperating nodes (CNs) within each cluster and balancing their energy consumption. The problem of optimal CN selection at the transmit and receive clusters is formulated as a nonlinear binary program. Aiming at minimizing the imbalance in the residual energy at various nodes, we decompose this problem into two subproblems: finding the optimal number of CNs (ONC) in a cluster and the CN assignment problem. For the ONC problem, we first analyze the energy efficiency of two widely used VMIMO methods: distributed Space Time Block Code (DSTBC) and distributed Vertical-Bell Laboratories-Layered-Space-Time (DVBLAST). Our analysis provides an upper bound on the optimal number of CN nodes, which greatly reduces the computational complexity of the ONC problem. The second subproblem is addressed by assigning CNs based on the residual battery energy. To make CCP scalable to large WSNs, we propose a multihop energy-balanced routing mechanism for clustered WSNs (C-EBR) with a novel cost metric. Finally, we derive sufficient conditions on the intra- and intercluster ranges, under which CCP guarantees connectivity of the intercluster topology. Extensive simulations show that the proposed approach dramatically improves the network lifetime.", acknowledgement = ack-nhfb, articleno = "43", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Pottner:2014:CST, author = "Wolf-Bastian P{\"o}ttner and Hans Seidel and James Brown and Utz Roedig and Lars Wolf", title = "Constructing Schedules for Time-Critical Data Delivery in Wireless Sensor Networks", journal = j-TOSN, volume = "10", number = "3", pages = "44:1--44:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2494528", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks for industrial process monitoring and control require highly reliable and timely data delivery. To match performance requirements, specialised schedule based medium access control (MAC) protocols are employed. In order to construct an efficient system, it is necessary to find a schedule that can support the given application requirements in terms of data delivery latency and reliability. Furthermore, additional requirements such as transmission power may have to be taken into account when constructing the schedule. In this article, we show how such schedule can be constructed. We describe methods and tools to collect the data necessary as input for schedule calculation. Moreover, due to the high complexity of schedule calculation, we also introduce a heuristic. We evaluate the proposed methods in a real-world process automation and control application deployed in an oil refinery and further present a long-term experiment in an office environment. Additionally, we discuss a framework for schedule life-cycle management.", acknowledgement = ack-nhfb, articleno = "44", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ghaffarkhah:2014:DNC, author = "Alireza Ghaffarkhah and Yasamin Mostofi", title = "Dynamic Networked Coverage of Time-Varying Environments in the Presence of Fading Communication Channels", journal = j-TOSN, volume = "10", number = "3", pages = "45:1--45:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2594769", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we study the problem of dynamic coverage of a set of points of interest (POIs) in a time-varying environment. We consider the scenario where a physical quantity is constantly growing at certain rates at the POIs. A number of mobile agents are then deployed to periodically cover (sense or service) the POIs and keep the physical quantity under control bounded at all the POIs. We assume a communication-constrained operation, where the mobile agents need to communicate to a fixed remote station over realistic wireless links to complete their coverage task. We then propose novel mixed-integer linear programs (MILPs) to design periodic trajectories and TX power policies for the mobile agents that minimize the total energy (the summation of motion and communication energy) consumption of the mobile agents in each period, while (1) guaranteeing the boundedness of the quantity of interest at all the POIs, and (2) meeting the constraints on the connectivity of the mobile agents, the frequency of covering the POIs, and the total energy budget of the mobile agents. We furthermore provide a probabilistic analysis of the problem. Our results show the superior performance of the proposed framework for dynamic coverage in realistic fading environments.", acknowledgement = ack-nhfb, articleno = "45", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liu:2014:TAL, author = "Tao Liu and Alberto E. Cerpa", title = "Temporal Adaptive Link Quality Prediction with Online Learning", journal = j-TOSN, volume = "10", number = "3", pages = "46:1--46:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2594766", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Link quality estimation is a fundamental component of the low-power wireless network protocols and is essential for routing protocols in Wireless Sensor Networks (WSNs). However, accurate link quality estimation remains a challenging task due to the notoriously dynamic and unpredictable wireless environment. In this article we argue that, in addition to the estimation of current link quality, prediction of the future link quality is more important for the routing protocol to establish low-cost delivery paths. We propose to apply machine learning methods to predict the link quality in the near future to facilitate the utilization of intermediate links with frequent quality changes. Moreover, we show that, by using online learning methods, our adaptive link estimator (TALENT) adapts to network dynamics better than statically trained models without the need of a priori data collection for training the model before deployment. We implemented TALENT in TinyOS with Low-Power Listening (LPL) and conducted extensive experiments in three testbeds. Our experimental results show that the addition of TALENT increases the delivery efficiency 1.95 times on average compared with a 4B, state-of-the-art link quality estimator, as well as improves the end-to-end delivery rate when tested on three different wireless testbeds.", acknowledgement = ack-nhfb, articleno = "46", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tovar:2014:CFS, author = "Benjamin Tovar and Fred Cohen and Leonardo Bobadilla and Justin Czarnowski and Steven M. Lavalle", title = "Combinatorial Filters: Sensor Beams, Obstacles, and Possible Paths", journal = j-TOSN, volume = "10", number = "3", pages = "47:1--47:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2594767", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A problem is introduced in which a moving body (robot, human, animal, vehicle, and so on) travels among obstacles and binary detection beams that connect between obstacles or barriers. Each beam can be viewed as a virtual sensor that may have many possible alternative implementations. The task is to determine the possible body paths based only on sensor observations that each simply report that a beam crossing occurred. This is a basic filtering problem encountered in many settings, under a variety of sensing modalities. Filtering methods are presented that reconstruct the set of possible paths at three levels of resolution: (1) the possible sequences of regions (bounded by beams and obstacles) visited, (2) equivalence classes of homo-topic paths, and (3) the possible numbers of times the path winds around obstacles. In the simplest case, all beams are disjoint, distinguishable, and directed. More complex cases are then considered, allowing for any amount of beams overlapping, indistinguishability, and lack of directional information. The method was implemented in simulation. An inexpensive, low-energy, easily deployable architecture was also created which implements the beam model and validates the methods of the article with experiments.", acknowledgement = ack-nhfb, articleno = "47", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Hariharan:2014:ESF, author = "Srikanth Hariharan and Chatschik Bisdikian and Lance M. Kaplan and Tien Pham", title = "Efficient Solutions Framework for Optimal Multitask Resource Assignments for Data Fusion in Wireless Sensor Networks", journal = j-TOSN, volume = "10", number = "3", pages = "48:1--48:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2594768", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Motivated by the need to judiciously allocate scarce sensing resources to attain the highest benefit for the applications that sensor networks serve, in this article we develop a flexible solutions methodology for maximizing the overall reward attained, subject to constraints on the resource demands under fairly general reward or demand functions. We map a broad class of related problems for data fusion in wireless sensor networks into an integer programming problem and provide an iterative Lagrangian relaxation technique to solve it. Each iteration step involves solving for a maximum-weight independent set of an appropriately constructed graph, which, in many cases, can be obtained in polynomial time. We apply our methodology to the problem of tracking targets moving over a period of time through a nonhomogeneous, energy-constrained sensor field. With rewards represented by the quality of information attained in tracking, we study its trade-offs and relationship with energy consumption and periodic measurement taking. We finally illustrate other applications of our framework in sensor networks.", acknowledgement = ack-nhfb, articleno = "48", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liu:2014:DAF, author = "Hongbo Liu and Hui Wang and Yingying Chen and Dayong Jia", title = "Defending against Frequency-Based Attacks on Distributed Data Storage in Wireless Networks", journal = j-TOSN, volume = "10", number = "3", pages = "49:1--49:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2594774", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "As wireless networks become more pervasive, the amount of the wireless data is rapidly increasing. One of the biggest challenges of wide adoption of distributed data storage is how to store these data securely. In this work, we study the frequency-based attack, a type of attack that is different from previously well-studied ones, that exploits additional adversary knowledge of domain values and/or their exact/approximate frequencies to crack the encrypted data. To cope with frequency-based attacks, the straightforward 1-to-1 substitution encryption functions are not sufficient. We propose a data encryption strategy based on 1-to- n substitution via dividing and emulating techniques to defend against the frequency-based attack, while enabling efficient query evaluation over encrypted data. We further develop two frameworks, incremental collection and clustered collection, which are used to defend against the global frequency-based attack when the knowledge of the global frequency in the network is not available. Built upon our basic encryption schemes, we derive two mechanisms, direct emulating and dual encryption, to handle updates on the data storage for energy-constrained sensor nodes and wireless devices. Our preliminary experiments with sensor nodes and extensive simulation results show that our data encryption strategy can achieve high security guarantee with low overhead.", acknowledgement = ack-nhfb, articleno = "49", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Emokpae:2014:SRB, author = "Lloyd Emokpae and Mohamed Younis", title = "Surface-Reflection-Based Communication and Localization in Underwater Sensor Networks", journal = j-TOSN, volume = "10", number = "3", pages = "50:1--50:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2537130", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Most communication and localization algorithms in underwater environments have been constrained by dependencies on the Line Of Sight (LOS), which is hard to guarantee due to the inherent node mobility. This constraint hinders node discovery and ad hoc formation in underwater networks and limits the performance of routing protocols. This article introduces a novel Surface-Based Reflection (SBR) model that uses a homomorphic deconvolution technique to establish water-surface-reflected communication links. We then propose a Surface-Based Reflection Anchor-free Localization (SBR-AL) algorithm that can be employed by the individual nodes to establish a relative coordinate system. Our approach also employs a switch-beamed directional antenna model that allows each node to use the LOS estimated from SBR-AL to enable directional communication which is beneficial for higher Signal-to-Noise Ratios (SNR). The relative locations can facilitate the various network operation functions such as geo-routing and collision-free medium access. The simulation results confirm the effectiveness of the proposed approach.", acknowledgement = ack-nhfb, articleno = "50", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yu:2014:CCW, author = "Zuoming Yu and Jin Teng and Xiaole Bai and Dong Xuan and Weijia Jia", title = "Connected Coverage in Wireless Networks with Directional Antennas", journal = j-TOSN, volume = "10", number = "3", pages = "51:1--51:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2594770", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we address a new unexplored problem: what are the optimal patterns to achieve connected coverage in wireless networks with directional antennas. As their name implies, directional antennas can focus their transmission energy in a certain direction. This feature leads to lower cross-interference and larger communication distance. It has been shown that, with proper scheduling mechanisms, directional antennas may substantially improve networking performance in wireless networks. In this article, we propose a set of deployment patterns to achieve full coverage and up to 2-connectivity under two different antenna models, namely the sector model and the knob model. These patterns are optimal under most combinations of communication and sensing ranges. We also introduce with detailed analysis several fundamental theorems and conjectures. Finally, we examine a more realistic physical model, where there might be strong interference and both the sensing range and the communication range might be irregular. The results show that our designed patterns work well even in unstable and fickle physical environments.", acknowledgement = ack-nhfb, articleno = "51", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Xia:2014:MMU, author = "Ming Xia and Yabo Dong and Wenyuan Xu and Xiangyang Li and Dongming Lu", title = "{MC 2}: Multimode User-Centric Design of Wireless Sensor Networks for Long-Term Monitoring", journal = j-TOSN, volume = "10", number = "3", pages = "52:1--52:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2509856", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Real-world, long-running wireless sensor networks (WSNs) require intense user intervention in the development, hardware testing, deployment, and maintenance stages. A majority of network design is network centric and focuses primarily on network performance, for example, efficient sensing and reliable data delivery. Although several tools have been developed to assist debugging and fault diagnosis, it is yet to systematically examine the underlying heavy burden that users face throughout the lifetime of WSNs. In this article, we propose a general Multimode user-CentriC (MC$^2$) framework that can, with simple user inputs, adjust itself to assist user operation and thus reduce the users' burden at various stages. In particular, we have identified utilities that are essential at each stage and grouped them into modes. In each mode, only the corresponding utilities will be loaded, and modes can be easily switched using the customized MC$^2$ sensor platform. As such, we reduce the runtime interference between various utilities and simplify their development as well as their debugging. We validated our MC$^2$ software and the sensor platform in a long-lived microclimate monitoring system deployed at a wildland heritage site, Mogao Grottoes. In our current system, 241 sensor nodes have been deployed in 57 caves, and the network has been running for over five years. Our experimental validation shows that the MC$^2$ framework shortens the time for network deployment and maintenance, and makes network maintenance doable by field experts (in our case, historians).", acknowledgement = ack-nhfb, articleno = "52", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ramos:2014:TRM, author = "Heitor S. Ramos and Alejandro C. Frery and Azzedine Boukerche and Eduardo M. R. Oliveira and Antonio A. F. Loureiro", title = "Topology-Related Metrics and Applications for the Design and Operation of Wireless Sensor Networks", journal = j-TOSN, volume = "10", number = "3", pages = "53:1--53:??", month = apr, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2512328", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 21 09:27:49 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The use of topological features, more specifically, the importance of an element related to its structural position, is a subject widely studied in the literature. For instance, the theory of complex networks provides centrality measures that have been applied to a large variety of fields (e.g., social sciences and biology). In this work, we propose a new topological measure, the Sink Betweenness (SBet), which stems from the theory of complex networks but is adapted to Wireless Sensor Networks (WSNs) to capture relevant information for this kind of network. We also provide a distributed algorithm to calculate it, and show its applicability to two different scenarios. The first one is focused on data fusion applications for event-driven WSNs, where we devise a tree-based data collection algorithm that takes advantage of node centrality to improve the data fusion efficiency. The second scenario is focused on energy balancing problems, more specifically in a problem called energy hole, where nodes closer to the sink are more likely to relay a larger number of packets than those that are further. This phenomenon is strongly related to the topology induced by the deployment of nodes along the sensor field, and it can be effectively captured by the SBet metric. Thus, we devise a data collection algorithm that is able to distribute the relay task more evenly. Simulation results show that the SBet metric can be satisfactorily used in both scenarios. We compare the proposed approach with some of the most efficient available data fusion algorithms, and show that the proposed algorithm generates consistently good-quality data collection infrastructures which require significantly smaller overhead. The use of SBet allows to alleviate the energy-hole effects by evenly balancing the relay load, and thus increasing the network lifetime. These two applications illustrate how the topology awareness can be used to improve different network functions in a WSN.", acknowledgement = ack-nhfb, articleno = "53", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Li:2014:FOT, author = "Huan Li and Dong Liang and Lihui Xie and Gong Zhang and Krithi Ramamritham", title = "Flash-Optimized Temporal Indexing for Time-Series Data Storage on Sensor Platforms", journal = j-TOSN, volume = "10", number = "4", pages = "62:1--62:??", month = jun, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2526687", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 16:46:56 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "While it is essential to exploit in-network processing in wireless sensor networks in order to save bandwidth and energy, we are constrained by the limited storage available in off-the-shelf sensor devices. NAND flash memory has great potential for extending storage capacity for sensor applications. Since each sensor platform is typically equipped with limited main memory and sensor data, as well as the fact that queries are temporal, existing flash index or file systems for general portable devices are not suitable for sensor networks. We propose Time-Log Tree (TL-Tree), a novel unbalanced and cascaded structure, that takes advantage of available flash capacity while making use of the time-series property as a primary feature for optimizing both memory and energy constraints. Extensive experiments show TL-Tree's ability to utilize both flash capacity and temporal locality to support sensor data processing. Compared to other schemes, it achieves much better access and energy savings for different kinds of random and temporal range queries. In addition, TL-Tree can also be easily extended to support value-based queries. We have developed a hardware board that includes a raw 128MB NAND flash chip on MicaZ mote. We have also implemented a flash driver and the TL-Tree to demonstrate the practicality of this idea.", acknowledgement = ack-nhfb, articleno = "62", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tas:2014:LCI, author = "Baris Tas and Nihat Altiparmak and Ali Saman Tosun", title = "Low-Cost Indoor Location Management for Robots Using {IR} Leds and an {IR} Camera", journal = j-TOSN, volume = "10", number = "4", pages = "63:1--63:??", month = jun, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2536713", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 16:46:56 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Many applications in wireless sensor networks can benefit from position information. However, existing accurate solutions for indoor environments are costly. Radio-Frequency (RF)-based approaches are not suitable for some indoor environments such as factory floors where heavy machinery can cause interference. We propose a low-cost and simple location management system using infrared (IR) leds and the Wii Remote Controller (WRC) which has an IR camera. The proposed solution is motivated by the need to find the location of a mobile robot used for data collection in a wireless sensor network. In the proposed schemes, the WRC is placed vertically on the mobile robot pointing upward and IR leds are placed irregularly on the ceiling. The mobile robot determines its position using the relative positions of the IR leds detected by the WRC. The WRC senses a few IR leds at a time, and they are differentiated using the irregularity among them. We analyze the problem theoretically and show that there exist limitations for covering large areas. We also discuss how to overcome these limitations. For small coverage areas, we provide optimal solutions using linear programming. The proposed scheme uses the resources efficiently and can cover a large area using a single WRC and multiple IR leds. We have simulation results including nonvertical placements of the WRC. The proposed scheme is easy to implement and requires minimal bandwidth for location management.", acknowledgement = ack-nhfb, articleno = "63", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Laoudias:2014:FFT, author = "Christos Laoudias and Michalis P. Michaelides and Christos G. Panayiotou", title = "{ftTRACK}: Fault-Tolerant Target Tracking in Binary Sensor Networks", journal = j-TOSN, volume = "10", number = "4", pages = "64:1--64:??", month = jun, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2538509", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 16:46:56 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The provision of accurate and reliable localization and tracking information for a target moving inside a binary Wireless Sensor Network (WSN) is quite challenging, especially when sensor failures due to hardware and/or software malfunctions or adversary attacks are considered. Most tracking algorithms assume fault-free scenarios and exploit all binary sensor observations, thus their accuracy may degrade when faults are present in the field. Spatiotemporal information available while the target is traversing the sensor field can be used not only for tracking the target, but also for detecting certain types of faults that appear highly correlated both in time and space. Our main contribution is ftTRACK, a target tracking architecture that is resilient to sensor faults and consists of three main components, namely the sensor health-state estimator, a fault-tolerant localization algorithm, and a location smoothing component. The key idea in the ftTRACK architecture lies in the sensor health-state estimator that leverages spatiotemporal information from previous estimation steps to intelligently choose which sensors to employ in the localization and tracking tasks. Simulation results indicate that ftTRACK maintains a high level of tracking accuracy, even when a large number of sensors fail.", acknowledgement = ack-nhfb, articleno = "64", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Nabi:2014:ECM, author = "Majid Nabi and Marc Geilen and Twan Basten and Milos Blagojevic", title = "Efficient Cluster Mobility Support for {TDMA}-Based {MAC} Protocols in Wireless Sensor Networks", journal = j-TOSN, volume = "10", number = "4", pages = "65:1--65:??", month = jun, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2594793", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 16:46:56 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Node mobility is a key feature of using Wireless Sensor Networks (WSNs) in many sensory applications, such as healthcare. The Medium Access Control (MAC) protocol should properly support the mobility in the network. In particular, mobility is complicated for contention-free protocols like Time Division Multiple Access (TDMA). An efficient access to the shared medium is scheduled based on the node's local neighborhood. This neighborhood may vary over time due to node movement or other dynamics. In scenarios including body-area networking, for instance, some clusters of nodes move together, creating further challenges but also opportunities. This article presents a MAC protocol, MCMAC, that provides efficient support for cluster mobility in TDMA-based MAC protocols in WSNs. The proposed protocol exploits a hybrid contention-free and contention-based communication approach to support cluster mobility. This relieves the protocol from rescheduling demand due to frequent node movements. Moreover, we propose a listening scheduling mechanism to avoid idle listening to mobile nodes that leads to a considerable energy saving for sensor nodes. The protocol is validated by performing several experiments in a real-world large-scale deployment including several mobile clusters. The protocol is also evaluated by extensive simulation of networks with various scales and configurations.", acknowledgement = ack-nhfb, articleno = "65", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kazmi:2014:RWS, author = "Aqeel H. Kazmi and Michael J. O'Grady and Declan T. Delaney and Antonio G. Ruzzelli and Gregory M. P. O'Hare", title = "A Review of Wireless-Sensor-Network-Enabled Building Energy Management Systems", journal = j-TOSN, volume = "10", number = "4", pages = "66:1--66:??", month = jun, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2532644", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 16:46:56 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Reducing energy consumption within buildings has been an active area of research in the past decade; more recently, there has been an increased influx of activity, motivated by a variety of issues including legislative, tax-related, as well as an increased awareness of energy-related issues. Energy usage both in commercial and residential buildings represents a significant portion of overall energy consumption; however, much of this may be categorized as waste, that is, energy usage that does not fulfil a definite purpose. In the past decade, the viability of Wireless Sensor Network (WSN) technologies has been demonstrated, leading to increased possibilities for novel services for building energy management. This development has resulted in numerous approaches being proposed for harnessing WSNs for energy management and conservation. This article surveys the state-of-the-art in building energy management systems. A generic architecture is proposed after which a detailed taxonomy of existing documented systems is presented. Gaps in the literature are highlighted and directions for future research identified.", acknowledgement = ack-nhfb, articleno = "66", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ghadimi:2014:ORL, author = "Euhanna Ghadimi and Olaf Landsiedel and Pablo Soldati and Simon Duquennoy and Mikael Johansson", title = "Opportunistic Routing in Low Duty-Cycle Wireless Sensor Networks", journal = j-TOSN, volume = "10", number = "4", pages = "67:1--67:??", month = jun, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2533686", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 16:46:56 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Opportunistic routing is widely known to have substantially better performance than unicast routing in wireless networks with lossy links. However, wireless sensor networks are usually duty cycled, that is, they frequently enter sleep states to ensure long network lifetime. This renders existing opportunistic routing schemes impractical, as they assume that nodes are always awake and can overhear other transmissions. In this article we introduce ORW, a practical opportunistic routing scheme for wireless sensor networks. ORW uses a novel opportunistic routing metric, EDC, that reflects the expected number of duty-cycled wakeups that are required to successfully deliver a packet from source to destination. We devise distributed algorithms that find the EDC-optimal forwarding and demonstrate using analytical performance models and simulations that EDC-based opportunistic routing results in significantly reduced delay and improved energy efficiency compared to traditional unicast routing. In addition, we evaluate the performance of ORW in both simulations and testbed-based experiments. Our results show that ORW reduces radio duty cycles on average by 50\% (up to 90\% on individual nodes) and delays by 30\% to 90\% when compared to the state-of-the-art.", acknowledgement = ack-nhfb, articleno = "67", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bhuiyan:2014:SPM, author = "Md Zakirul Alam Bhuiyan and Guojun Wang and Jiannong Cao and Jie Wu", title = "Sensor Placement with Multiple Objectives for Structural Health Monitoring", journal = j-TOSN, volume = "10", number = "4", pages = "68:1--68:??", month = jun, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2533669", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 16 16:46:56 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Structural health monitoring (SHM) refers to the process of implementing a damage detection and characterization strategy for engineering structures. Its objective is to monitor the integrity of structures and detect and pinpoint the locations of possible damages. Although wired network systems still dominate in SHM applications, it is commonly believed that wireless sensor network (WSN) systems will be deployed for SHM in the near future, due to their intrinsic advantages. However, the constraints (e.g., communication, fault tolerance, energy) of WSNs must be considered before their deployment on structures. In this article, we study the methodology of sensor placement optimization for WSN-based SHM. Sensor placement plays a vital role in SHM applications, where sensor nodes are placed on critical locations that are of civil/structural engineering importance. We design a three-phase sensor placement approach, named TPSP, aiming to achieve the following objectives: finding a high-quality placement for a given set of sensors that satisfies the engineering requirements, ensuring communication efficiency and reliability and low placement complexity, and reducing the probability of failures in a WSN. Along with the sensor placement, we enable sensor nodes to develop ``connectivity trees'' in such a way that maintaining structural health state and network connectivity, for example, in case of a sensor fault, can be done in a distributed manner. The trees are constructed once (unlike dynamic clusters or trees) and do not incur additional communication costs for the WSN. We optimize the performance of TPSP by considering multiple objectives: low communication cost, fault tolerance, and lifetime prolongation. We validate the effectiveness and performance of TPSP through both simulations using real datasets and a proof-of-concept system on a physical structure.", acknowledgement = ack-nhfb, articleno = "68", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Premnath:2014:EHR, author = "Sriram Nandha Premnath and Jessica Croft and Neal Patwari and Sneha Kumar Kasera", title = "Efficient High-Rate Secret Key Extraction in Wireless Sensor Networks Using Collaboration", journal = j-TOSN, volume = "11", number = "1", pages = "2:1--2:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2541289", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Secret key establishment is a fundamental requirement for private communication between two entities. In this article, we propose and evaluate a new approach for secret key extraction where multiple sensors collaborate in exchanging probe packets and collecting channel measurements. Essentially, measurements from multiple channels have a substantially higher differential entropy compared to the measurements from a single channel, thereby resulting in more randomness in the information source for key extraction, and this in turn produces stronger secret keys. We also explore the fundamental trade-off between the quadratic increase in the number of measurements of the channels due to multiple nodes per group versus a linear reduction in the sampling rate and a linear increase in the time gap between bidirectional measurements. To experimentally evaluate collaborative secret key extraction in wireless sensor networks, we first build a simple yet flexible testbed with multiple TelosB sensor nodes. Next, we perform large-scale experiments with different configurations of collaboration. Our experiments show that in comparison to the $ 1 \times 1 $ configuration, collaboration among sensor nodes significantly increases the secret bit extraction per second, per probe, as well as per millijoule of transmission energy. In addition, we show that the collaborating nodes can improve the performance further when they exploit both space and frequency diversities.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Li:2014:PSA, author = "Xu Li and Greg Fletcher and Amiya Nayak and Ivan Stojmenovic", title = "Placing Sensors for Area Coverage in a Complex Environment by a Team of Robots", journal = j-TOSN, volume = "11", number = "1", pages = "3:1--3:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2632149", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Existing solutions to carrier-based sensor placement by a single robot in a bounded unknown Region of Interest (ROI) do not guarantee full area coverage or termination. We propose a novel localized algorithm, named Back-Tracking Deployment (BTD). To construct a full coverage solution over the ROI, mobile robots (carriers) carry static sensors as payloads and drop them at the visited empty vertices of a virtual square, triangular, or hexagonal grid. A single robot will move in a predefined order of directional preference until a dead end is reached. Then it back-tracks to the nearest sensor adjacent to an empty vertex (an ``entrance'' to an unexplored/uncovered area) and resumes regular forward movement and sensor dropping from there. To save movement steps, the back-tracking is carried out along a locally identified shortcut. We extend the algorithm to support multiple robots that move independently and asynchronously. Once a robot reaches a dead end, it will back-track, giving preference to its own path. Otherwise, it will take over the back-track path of another robot by consulting with neighboring sensors. We prove that BTD terminates within finite time and produces full coverage when no (sensor or robot) failures occur. We also describe an approach to tolerate failures and an approach to balance workload among robots. We then evaluate BTD in comparison with the only competing algorithms SLD [Chang et al. 2009a] and LRV [Batalin and Sukhatme 2004] through simulation. In a specific failure-free scenario, SLD covers only 40--50\% of the ROI, whereas BTD covers it in full. BTD involves significantly (80\%) less robot moves and messages than LRV.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Sen:2014:RRP, author = "Rijurekha Sen and Abhinav Maurya and Bhaskaran Raman and Rupesh Mehta and Ramkrishnan Kalyanaraman and Amarjeet Singh", title = "{Road-RFSense}: a Practical {RF} Sensing-Based Road Traffic Estimation System for Developing Regions", journal = j-TOSN, volume = "11", number = "1", pages = "4:1--4:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2560189", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "An unprecedented rate of growth in the number of vehicles has resulted in acute road congestion problems worldwide, especially in many developing countries. In this article, we present Road-RFSense, a practical RF sensing--based road traffic estimation system for developing regions. Our first contribution is a new mechanism to sense road occupancy, based on variation in RF link characteristics, when line of sight between a transmitter-receiver pair is obstructed. We design algorithms to classify traffic states into two classes, free-flow versus congested, at timescales of 20 seconds with greater than 90\% accuracy. We also present a traffic queue length measurement system, where a network of RF sensors can correlate the traffic state classification decisions of individual sensors and detect traffic queue length in real time. Deployment of our system on a Mumbai road gives correct estimates, validated against 9 hours of image-based ground truth. Our third contribution is a large-scale data-driven study, in collaboration with city traffic authorities, to answer questions regarding road-specific classification model training. Finally, we explore multilevel classification into seven different traffic states using a larger set of RF-based features and careful choice of classification algorithms.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Anagnostopoulos:2014:APC, author = "Christos Anagnostopoulos and Stathes Hadjiefthymiades", title = "Advanced Principal Component-Based Compression Schemes for Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "1", pages = "7:1--7:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2629330", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article proposes two models that improve the Principal Component-based Context Compression (PC3) model for contextual information forwarding among sensor nodes in a Wireless Sensor Network (WSN). The proposed models (referred to as iPC3 and oPC3) address issues associated with the control of multivariate contextual information transmission in a stationary WSN. Because WSN nodes are typically battery equipped, the primary design goal of the models is to optimize the amount of energy used for data transmission while retaining data accuracy at high levels. The proposed energy conservation techniques and algorithms are based on incremental principal component analysis and optimal stopping theory. iPC3 and oPC3 models are presented and compared with PC3 and other models found in the literature through simulations. The proposed models manage to extend the lifetime of a WSN application by improving energy efficiency within WSN.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wu:2014:DPF, author = "Xiuchao Wu and Kenneth N. Brown and Cormac J. Sreenan", title = "Data Pre-Forwarding for Opportunistic Data Collection in Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "1", pages = "8:1--8:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2629369", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Opportunistic data collection in wireless sensor networks uses passing smartphones to collect data from sensor nodes, thus avoiding the cost of multiple static sink nodes. Based on the observed mobility patterns of smartphone users, sensor data should be preforwarded to the nodes that are visited more frequently with the aim of improving network throughput. In this article, we construct a formal network model and an associated theoretical optimization problem to maximize the throughput subject to energy constraints of sensor nodes. Since a centralized controller is not available in opportunistic data collection, data pre-forwarding (DPF) must operate as a distributed mechanism in which each node decides when and where to forward data based on local information. Hence, we develop a simple distributed DPF mechanism with two heuristic algorithms, implement this proposal in Contiki-OS, and evaluate it thoroughly. We demonstrate empirically, in simulations, that our approach is close to the optimal solution obtained by a centralized algorithm. We also demonstrate that this approach performs well in scenarios based on real mobility traces of smartphone users. Finally, we evaluate our proposal on a small laboratory testbed, demonstrating that the distributed DPF mechanism with heuristic algorithms performs as predicted by simulations, and thus that it is a viable technique for opportunistic data collection through smartphones.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yang:2014:DOL, author = "Shusen Yang and Julie A. Mccann", title = "Distributed Optimal Lexicographic Max-Min Rate Allocation in Solar-Powered Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "1", pages = "9:1--9:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2630882", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Understanding the optimal usage of fluctuating renewable energy in wireless sensor networks (WSNs) is complex. Lexicographic max-min (LM) rate allocation is a good solution but is nontrivial for multihop WSNs, as both fairness and sensing rates have to be optimized through the exploration of all possible forwarding routes in the network. All current optimal approaches to this problem are centralized and offline, suffering from low scalability and large computational complexity-typically solving O( N$^2$ ) linear programming problems for N -node WSNs. This article presents the first optimal distributed solution to this problem with much lower complexity. We apply it to solar-powered wireless sensor networks (SP-WSNs) to achieve both LM optimality and sustainable operation. Based on realistic models of both time-varying solar power and photovoltaic-battery hardware, we propose an optimization framework that integrates a local power management algorithm with a global distributed LM rate allocation scheme. The optimality, convergence, and efficiency of our approaches are formally proven. We also evaluate our algorithms via experiments on both solar-powered MICAz motes and extensive simulations using real solar energy data and practical power parameter settings. The results verify our theoretical analysis and demonstrate how our approach outperforms both the state-of-the-art centralized optimal and distributed heuristic solutions.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Shan:2014:BML, author = "Mengfan Shan and Guihai Chen and Dijun Luo and Xiaojun Zhu and Xiaobing Wu", title = "Building Maximum Lifetime Shortest Path Data Aggregation Trees in Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "1", pages = "11:1--11:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2629662", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In wireless sensor networks, the spanning tree is usually used as a routing structure to collect data. In some situations, nodes do in-network aggregation to reduce transmissions, save energy, and maximize network lifetime. Because of the restricted energy of sensor nodes, how to build an aggregation tree of maximum lifetime is an important issue. It has been proved to be NP-complete in previous works. As shortest path spanning trees intuitively have short delay, it is imperative to find an energy-efficient shortest path tree for time-critical applications. In this article, we first study the problem of building maximum lifetime shortest path aggregation trees in wireless sensor networks. We show that when restricted to shortest path trees, building maximum lifetime aggregation trees can be solved in polynomial time. We present a centralized algorithm and design a distributed protocol for building such trees. Simulation results show that our approaches greatly improve the lifetime of the network and are very effective compared to other solutions. We extend our discussion to networks without aggregation and present interesting results.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Barenboim:2014:DEO, author = "Leonid Barenboim and Shlomi Dolev and Rafail Ostrovsky", title = "Deterministic and Energy-Optimal Wireless Synchronization", journal = j-TOSN, volume = "11", number = "1", pages = "13:1--13:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2629493", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider the problem of clock synchronization in a wireless setting where processors must minimize the number of times their radios are used to save energy. Energy efficiency is a central goal in wireless networks, especially if energy resources are severely limited, as occurs in sensor and ad hoc networks, and in many other settings. The problem of clock synchronization is fundamental and intensively studied in the field of distributed algorithms. In the current setting, the problem is to synchronize clocks of m processors that wake up in arbitrary time points, such that the maximum difference between wake-up times is bounded by a positive integer $n$. (Time intervals are appropriately discretized to allow communication of all processors that are awake in the same discrete time unit.) Currently, the best-known results for synchronization for single-hop networks of m processors is a randomized algorithm due to Bradonjic et al. [2009] of $ O(\sqrt n / m \cdot \polylog (n)) $ radio use times per processor, and a lower bound of $ \Omega (\sqrt n / m)$. The main open question left in their work is to close the poly-log gap between the upper and the lower bound, and to derandomize their probabilistic construction and eliminate error probability. This is exactly what we do in this article. That is, we show a deterministic algorithm with radio use of $ \Theta (\sqrt n / m) $, which exactly matches the lower bound proven in Bradonjic et al. [2009] to a small multiplicative constant. Therefore, our algorithm is optimal in terms of energy efficiency and completely resolves a long sequence of works in this area [Bradonjic et al. 2009; Moscribroda et al. 2006; McGlynn and Borbash 2001; Polastre et al. 2004]. Moreover, our algorithm is optimal in terms of running time as well. To achieve these results, we devise a novel adaptive technique that determines the times when devices power their radios on and off. This technique may be of independent interest. In addition, we prove several lower bounds on the energy efficiency of algorithms for multihop networks. Specifically, we show that any algorithm for multihop networks must have radio use of $ \Omega (\sqrt n) $ per processor. Our lower bounds hold even for specific kinds of networks, such as networks modeled by unit disk graphs and highly connected graphs. Our results imply that the simple deterministic algorithm devised for two-processor networks in Bradonjic et al. [2009] with efficiency $ O (\sqrt n) $ can be used in multihop networks, and it is the most efficient solution in terms of energy use.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Fan:2014:BCS, author = "Haosheng Fan and Minming Li and Xianwei Sun and Peng-Jun Wan and Yingchao Zhao", title = "Barrier Coverage by Sensors with Adjustable Ranges", journal = j-TOSN, volume = "11", number = "1", pages = "14:1--14:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2629518", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "One of the most fundamental tasks of wireless sensor networks is to provide coverage of the deployment region. We study the coverage of a line interval with a set of wireless sensors with adjustable coverage ranges. Each coverage range of a sensor is an interval centered at that sensor whose length is decided by the power the sensor chooses. The objective is to find a range assignment with the minimum cost. There are two variants of the optimization problem. In the discrete variant, each sensor can only choose from a finite set of powers, whereas in the continuous variant, each sensor can choose power from a given interval. For the discrete variant of the problem, a polynomial-time exact algorithm is designed. For the continuous variant of the problem, NP-hardness of the problem is proved and followed by an ILP formulation. Then, constant-approximation algorithms are designed when the cost for all sensors is proportional to $ r^\kappa $ for some constant $ \kappa \geq 1 $, where $r$ is the covering radius corresponding to the chosen power. Specifically, if $ \kappa = 1$, we give a 1.25-approximation algorithm and a fully polynomial-time approximation scheme; if $ \kappa > 1$, we give a 2-approximation algorithm. We also show that the approximation analyses are tight.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zordan:2014:PLC, author = "Davide Zordan and Borja Martinez and Ignasi Vilajosana and Michele Rossi", title = "On the Performance of Lossy Compression Schemes for Energy Constrained Sensor Networking", journal = j-TOSN, volume = "11", number = "1", pages = "15:1--15:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2629660", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Lossy temporal compression is key for energy-constrained wireless sensor networks (WSNs), where the imperfect reconstruction of the signal is often acceptable at the data collector, subject to some maximum error tolerance. In this article, we evaluate a number of selected lossy compression methods from the literature and extensively analyze their performance in terms of compression efficiency, computational complexity, and energy consumption. Specifically, we first carry out a performance evaluation of existing and new compression schemes, considering linear, autoregressive, FFT-\slash DCT- and wavelet-based models, by looking at their performance as a function of relevant signal statistics. Second, we obtain formulas through numerical fittings to gauge their overall energy consumption and signal representation accuracy. Third, we evaluate the benefits that lossy compression methods bring about in interference-limited multihop networks, where the channel access is a source of inefficiency due to collisions and transmission scheduling. Our results reveal that the DCT-based schemes are the best option in terms of compression efficiency but are inefficient in terms of energy consumption. Instead, linear methods lead to substantial savings in terms of energy expenditure by, at the same time, leading to satisfactory compression ratios, reduced network delay, and increased reliability performance.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Karvonen:2014:CLO, author = "Heikki Karvonen and Carlos Pomalaza-R{\'a}ez and Matti H{\"a}m{\"a}l{\"a}inen", title = "A Cross-Layer Optimization Approach for Lower Layers of the Protocol Stack in Sensor Networks", journal = j-TOSN, volume = "11", number = "1", pages = "16:1--16:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2590810", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A cross-layer optimization approach for the physical and medium access control layers of wireless sensor networks is introduced in this article. This approach includes a Markov chain model, simulations, and analytical derivations that are applied to the analysis of sensor networks using impulse radio ultra-wideband signals with noncoherent energy detection. This type of communication system has low-power transmission requirements and noise like signal characteristics with low interference to other wireless systems. The energy efficiency of different Reed--Solomon code rates and uncoded case are studied in a star topology network, where slotted Aloha, as defined in the IEEE 802.15.4a standard, is used as the medium access protocol. Analytical and simulation results clearly show the potential energy gains that can be achieved with the proposed optimization approach that can be also used in the evaluation and optimization of other combinations of physical and medium access control protocols.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Won:2014:LSG, author = "Myounggyu Won and Radu Stoleru", title = "A Low-Stretch-Guaranteed and Lightweight Geographic Routing Protocol for Large-Scale Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "1", pages = "18:1--18:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2629659", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Geographic routing is well suited for large-scale wireless sensor networks (WSNs) because it is nearly stateless. One important challenge is that network holes may arbitrarily increase the routing path length. Fortunately, recent studies have shown that constant path stretch is achievable using nonlocal information. The constant stretch, however, is possible at the cost of high communication and storage overhead: a source node must complete a ``path-setup'' process prior to data transmission by exchanging a message with a destination node using a default geographic routing (e.g., GPSR). In this article, we propose the first geographic routing protocol (LVGR) that provably achieves worst-case stretch of $ \Theta (D / \gamma) $ (where $D$ is the diameter of the network and $ \gamma $ is the communication range of nodes) with low communication and storage overhead. LVGR represents a hole as a convex hull, the internal structure of which is represented as a local visibility graph. Based on the convex hulls and local visibility graphs, LVGR generates paths with guaranteed stretch. Through theoretical analysis and extensive simulations, we prove the worst-case stretch of LVGR and demonstrate that LVGR reduces communication overhead by up to 97\% and storage overhead by up to 60\%, compared with the state of the art.", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Lu:2014:SBH, author = "Jiakang Lu and Yamina Taskin Shams and Kamin Whitehouse", title = "Smart Blueprints: How Simple Sensors Can Collaboratively Map Out Their Own Locations in the Home", journal = j-TOSN, volume = "11", number = "1", pages = "19:1--19:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2629441", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Off-the-shelf home automation technology is making it easier than ever for people to convert their own homes into smart homes. However, manual configuration is tedious and error-prone. In this article, we present and compare a family of solutions that automatically generate a map of the home and the devices within it using data from the smart home sensors themselves (e.g., light and motion sensors). These solutions can be used to automatically configure home automation systems or to automatically produce an intuitive map-like interface for visualizing sensor data and interacting with controllers. We call our approach Smart Blueprints because it automatically maps out the unique configuration of each smart home. We demonstrate the Smart Blueprints using a variety of sensor combinations, including light sensors, motion sensors, and magnetometers deployed on the doors and/or windows of the home. For evaluation of each combination on sensor-map generation, we deployed more than 200 sensors in seven different houses at different locations and compared the ability to use a variety of techniques to map out the configuration. We show that, in almost all houses, our system can automatically narrow the configuration down to 1--5 candidates per home using only one week of collected data.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Dezfouli:2014:CEM, author = "Behnam Dezfouli and Marjan Radi and Kamin Whitehouse and Shukor Abd Razak and Hwee-Pink Tan", title = "{CAMA}: Efficient Modeling of the Capture Effect for Low-Power Wireless Networks", journal = j-TOSN, volume = "11", number = "1", pages = "20:1--20:??", month = aug, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2629352", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Aug 26 18:16:52 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Network simulation is an essential tool for the design and evaluation of wireless network protocols, and realistic channel modeling is essential for meaningful analysis. Recently, several network protocols have demonstrated substantial network performance improvements by exploiting the capture effect, but existing models of the capture effect are still not adequate for protocol simulation and analysis. Physical-level models that calculate the signal-to-interference-plus-noise ratio (SINR) for every incoming bit are too slow to be used for large-scale or long-term networking experiments, and link-level models such as those currently used by the NS2 simulator do not accurately predict protocol performance. In this article, we propose a new technique called the capture modeling algorithm (CAMA) that provides the simulation fidelity of physical-level models while achieving the simulation time of link-level models. We confirm the validity of CAMA through comparison with the empirical traces of the experiments conducted by various numbers of CC1000 and CC2420-based nodes in different scenarios. Our results indicate that CAMA can accurately predict the packet reception, corruption, and collision detection rates of real radios, while existing models currently used by the NS2 simulator produce substantial prediction error.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Dong:2015:ORC, author = "Wei Dong and Chun Chen and Jiajun Bu and Wen Liu", title = "Optimizing Relocatable Code for Efficient Software Update in Networked Embedded Systems", journal = j-TOSN, volume = "11", number = "2", pages = "22:1--22:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2629479", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Recent advances in Microelectronic Mechanical Systems (MEMS) and wireless communication technologies have fostered the rapid development of networked embedded systems like wireless sensor networks. System software for these self-organizing systems often needs to be updated for a variety of reasons. We present a holistic software update (i.e., reprogramming) system called R3 for networked embedded systems. R3 has two salient features. First, the binary differencing algorithm within R3 (R3diff) ensures an optimal result in terms of the delta size under a configurable cost measure. Second, the similarity preserving method within R3 (R3sim) optimizes the binary code format for achieving a large similarity with a small metadata overhead. Overall, R3 achieves the smallest delta size compared with other software update approaches such as Stream, Rsync, RMTD, Zephyr, Hermes, and R2 (e.g., 50\%--99\% reduction compared to Stream and about 20\%--40\% reduction compared to R2). R3's implementation on TelosB/TinyOS is lightweight and efficient. We release our code at http://code.google.com/p/r3-dongw.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Basha:2015:NDS, author = "Elizabeth Basha and Raja Jurdak and Daniela Rus", title = "In-Network Distributed Solar Current Prediction", journal = j-TOSN, volume = "11", number = "2", pages = "23:1--23:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2629593", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Long-term sensor network deployments demand careful power management. While managing power requires understanding the amount of energy harvestable from the local environment, current solar prediction methods rely only on recent local history, which makes them susceptible to high variability. In this article, we present a model and algorithms for distributed solar current prediction based on multiple linear regression to predict future solar current based on local, in situ climatic and solar measurements. These algorithms leverage spatial information from neighbors and adapt to the changing local conditions not captured by global climatic information. We implement these algorithms on our Fleck platform and run a 7-week-long experiment validating our work. In analyzing our results from this experiment, we determined that computing our model requires an increased energy expenditure of 4.5mJ over simpler models (on the order of 10$^{-7}$ \% of the harvested energy) to gain a prediction improvement of 39.7\%.", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Song:2015:ETP, author = "Wen-Zhan Song and Mingsen Xu and Debraj De and Deukhyoun Heo and Jong-Hoon Kim and Byeong-Sam Kim", title = "{ECPC}: Toward Preserving Downtime Data Persistence in Disruptive Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "2", pages = "24:1--24:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2629584", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Sensor networks have particularly important applications in challenging environments. However, those challenging environments also pose significant challenges to network sustainability and reliability. In such environments, the network often becomes disruptive and even unavailable during downtime. This results in undesired loss of valuable spatial-temporal sensor data. Data persistence can be achieved by using in-situ encoding and caching of data through distributed mechanisms. However, the existing methods in the literature are mainly based on network random walks, which not only incur significant communication overhead, but also are prone to network or node failures. In this article, we present ECPC, a distributed E rasure C oding with randomized P ower C ontrol protocol for preserving data in disruptive sensor networks. ECPC only requires each sensor node to perform several rounds of broadcast in its neighborhood at some randomly chosen radio transmission power levels, and thus it incurs low communication overhead. We proved that ECPC achieves the expected code degree distribution and pseudo-global randomness of erasure coding principles. We have also evaluated the performance of ECPC by comparing it with several key related approaches in the literature (such as EDFC and RCDS). The performance comparisons validate that our proposed ECPC protocol can reach higher data reliability under varying node failure probabilities. In addition, ECPC protocol is also shown to be scalable with different network sizes.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Iwanicki:2015:BMU, author = "Konrad Iwanicki and Przemyslaw Horban and Piotr Glazar and Karol Strzelecki", title = "Bringing Modern Unit Testing Techniques to Sensornets", journal = j-TOSN, volume = "11", number = "2", pages = "25:1--25:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2629422", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Unit testing, an important facet of software quality assurance, is underappreciated by wireless sensor network (sensornet) developers. This is likely because our tools lag behind the rest of the computing field. As a remedy, we present a new framework that enables modern unit testing techniques in sensornets. Although the framework takes a holistic approach to unit testing, its novelty lies mainly in two aspects. First, to boost test development, it introduces embedded mock modules that automatically abstract out dependencies of tested code. Second, to automate test assessment, it provides embedded code coverage tools that identify untested control flow paths in the code. We demonstrate that in sensornets these features pose unique problems, solving which requires dedicated support from the compiler and operating system. However, the solutions have the potential to offer substantial benefits. In particular, they reduce the unit test development effort by a few factors compared to existing solutions. At the same time, they facilitate obtaining full code coverage, compared to merely 57--72\% that can be achieved with integration tests. They also allow for intercepting and reporting many classes of runtime failures, thereby simplifying the diagnosis of software flaws. Finally, they enable fine-grained management of the quality of sensornet software.", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wu:2015:SSM, author = "Xiaopei Wu and Qingsi Wang and Mingyan Liu", title = "In-situ Soil Moisture Sensing: Measurement Scheduling and Estimation Using Sparse Sampling", journal = j-TOSN, volume = "11", number = "2", pages = "26:1--26:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2629439", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider the problem of monitoring soil moisture evolution using a wireless network of in-situ underground sensors. To reduce cost and prolong lifetime, it is highly desirable to rely on fewer measurements and estimate with higher accuracy the original signal (the temporal evolution of soil moisture). In this article, we explore the use of results from the theory of sparse sampling, including Compressive Sensing (CS) and Matrix Completion (MC), in this application context. We first consider the problem of reconstructing the soil moisture process at a single location using CS. Our physical constraint leads to very sparse measurement matrices, which makes finding a suitable representation basis very challenging: it needs to make the underlying signal sufficiently sparse while at the same time being sufficiently incoherent with the measurement matrix, two common preconditions for CS techniques to work well. We construct a representation basis by exploiting unique features of soil moisture evolution and show that this basis attains a very good tradeoff between its ability to sparsify the signal and its incoherence with measurement matrices that are consistent with our physical constraints. We next consider the problem of jointly reconstructing soil moisture processes at multiple locations, assuming sparse measurements can be taken at each location. We show that the spatial soil moisture process enjoys a low-rank property, a priority for MC. Accordingly, we introduce a spatiotemporal measurement matrix and apply the MC framework to reconstruct the soil moisture field. Extensive numerical evaluation is performed on both real, high-resolution soil moisture data and simulated data and through comparison with a closed-loop scheduling approach. Our results demonstrate that, for a single location, a uniform measurement scheduling followed by CS recovery results in a very nice tradeoff between estimation accuracy, sampling rate, flexibility, and feasibility in implementation. When multiple locations are available, our results show that joint reconstruction using MC in general produces better estimation accuracy than using a single location alone, but it requires the use of independent and random measurement schedules across locations. We also show that these sparse sampling techniques can be augmented so as to be robust against sporadic data outliers/corruption caused by, for example, intermittent sensor faults.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Panigrahi:2015:ESN, author = "Trilochan Panigrahi and Ganapati Panda and Bernard Mulgrew", title = "Error Saturation Nonlinearities for Robust Incremental {LMS} over Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "2", pages = "27:1--27:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2629667", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The data collected by sensor nodes over a geographical region is contaminated with Gaussian and impulsive noise. The conventional gradient-based distributed adaptive estimation algorithms exhibit good performance in the presence of Gaussian noise but perform poorly in impulsive noise environments. Therefore, the objective of this article is to propose a robust distributed adaptive algorithm that alleviates the effect of impulsive noise. An error saturation nonlinearity-based robust distributed strategy is proposed in an incremental cooperative network to estimate the desired parameters in impulsive noise. The steady-state analysis of the proposed error saturation nonlinearity incremental least mean squares (SNILMS) algorithm is carried out by employing the spatial-temporal energy conservation principle. Both theoretical and simulation results show that the presence of the error nonlinearity has made the proposed SNILMS algorithm robust to impulsive noise.", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Li:2015:IGS, author = "Mo Li and Pengfei Zhou and Yuanqing Zheng and Zhenjiang Li and Guobin Shen", title = "{IODetector}: a Generic Service for Indoor\slash Outdoor Detection", journal = j-TOSN, volume = "11", number = "2", pages = "28:1--28:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2659466", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The location and context switching, especially the indoor/outdoor switching, provides essential and primitive information for upper-layer mobile applications. In this article, we present IODetector: a lightweight sensing service that runs on the mobile phone and detects the indoor/outdoor environment in a fast, accurate, and efficient manner. Constrained by the energy budget, IODetector primarily leverages lightweight sensing resources, such as light sensors, magnetism sensors, and cell tower signals. For universal applicability, IODetector assumes no prior knowledge (e.g., fingerprints) of the environment and uses only on-board sensors common to mainstream mobile phones. Being a generic and lightweight service component, IODetector greatly benefits many location-based and context-aware applications. We prototype the IODetector on Android mobile phones and evaluate the system comprehensively with data collected from 34 traces that include 133 different places during a 6-week period, employing different phone models. We further perform a case study where we make use of IODetector to instantly infer the GPS availability and localization accuracy in different indoor/outdoor environments.", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Klonowski:2015:MRD, author = "Marek Klonowski and Miroslaw Kutylowski and Michal Ren and Katarzyna Rybarczyk", title = "Mixing in Random Digraphs with Application to the Forward-Secure Key Evolution in Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "2", pages = "29:1--29:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2637482", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A key distribution scheme for wireless sensor networks based on a system of dynamic, pairwise keys is considered. In the scheme, each pair of communicating nodes shares pairwise symmetric keys and changes them at every transmission using a set of hashing functions. This article examines security aspects of the protocol. The most important issue is to ensure that it is infeasible for an adversary to restrict exhaustive key search to a subset of the keyspace. This desirable property holds if, after a small number of random key transitions, the distribution of keys among the nodes is close to uniform. The article provides a rigorous mathematical analysis of the distribution of keys and supplements it with experimental results. The problem is reduced to the question of determining mixing time and the stationary distribution of a random walk on a random digraph. It is shown that with probability close to 1, the mixing time is of small order and the fluctuations of the distribution are limited. This ensures the ongoing security of the protocol by making the communications forward secure and protecting against node compromise.", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chen:2015:SSH, author = "Jinzhu Chen and Rui Tan and Yu Wang and Guoliang Xing and Xiaorui Wang and Xiaodong Wang and Bill Punch and Dirk Colbry", title = "A Sensor System for High-Fidelity Temperature Distribution Forecasting in Data Centers", journal = j-TOSN, volume = "11", number = "2", pages = "30:1--30:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2675353", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Data centers have become a critical computing infrastructure in the era of cloud computing. Temperature monitoring and forecasting are essential for preventing server shutdowns because of overheating and improving a data center's energy efficiency. This article presents a novel cyber-physical approach for temperature forecasting in data centers, one that integrates Computational Fluid Dynamics (CFD) modeling, in situ wireless sensing, and real-time data-driven prediction. To ensure forecasting fidelity, we leverage the realistic physical thermodynamic models of CFD to generate transient temperature distribution and calibrate it using sensor feedback. Both simulated temperature distribution and sensor measurements are then used to train a real-time prediction algorithm. As a result, our approach reduces not only the computational complexity of online temperature modeling and prediction, but also the number of deployed sensors, which enables a portable, noninvasive thermal monitoring solution that does not rely on the infrastructure of a monitored data center. We extensively evaluated the proposed system on a rack of 15 servers and a testbed of five racks and 229 servers in a small-scale production data center. Our results show that our system can predict the temperature evolution of servers with highly dynamic workloads at an average error of 0.52$^\ocirc $C, within a duration up to 10 minutes. Moreover, our approach can reduce the required number of sensors by 67\% while maintaining desirable prediction fidelity.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Salmani:2015:RRR, author = "Vahid Salmani and Pai H. Chou", title = "Resilient Round Robin: a Lightweight Deterministic {MAC} Primitive", journal = j-TOSN, volume = "11", number = "2", pages = "31:1--31:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2661638", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider the goal of adaptively controlling access to medium in wireless sensor networks with minimal footprint and complexity. Lightweight protocols are desirable in general and inevitable in some real-world applications such as infant monitoring. We assume high-data-rate, resource-constrained wireless sensor nodes in a star network. We take a deterministic approach to contention resolution to achieve bounded latency on data transmissions while reducing the overhead. In addition to simplicity and small footprint, our approach requires fewer message exchanges compared to the state of the art. We then present a lightweight hybrid protocol that is seamlessly integrated with the proposed contention-resolution scheme, one better suited for delay-sensitive applications with real-time constraints by providing determinism. Another feature of the proposed protocol is that it requires carrier-sensing hardware only on the base station but not on the sensor nodes. The average probing complexity of our protocol in a highly dynamic network is O ( n /log n ) per round, and experimental results show the proposed scheme to be scalable and highly adaptive to the contention level.", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Fortuna:2015:FDC, author = "Carolina Fortuna and Mihael Mohorcic", title = "A Framework for Dynamic Composition of Communication Services", journal = j-TOSN, volume = "11", number = "2", pages = "32:1--32:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2678216", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We propose a framework for dynamic composition of communication services that is well suited for facilitating research and prototyping on real experimental infrastructures of remotely configurable embedded devices. By using the concept of composability, our framework supports modular component development for various networking functions, thereby promoting code reuse. The framework consists of four components: the physical testbed, the module library, the declarative language, and the workbench. Its reference implementation, ProtoStack, developed using semantic web technologies, supports remote experimentation on sensor platform-based infrastructure and is thus well suited also for experimenters who do not possess their own physical experimentation infrastructure. We illustrate how ProtoStack supports research in service-oriented networks and cognitive networking. The cost of increased flexibility and prototyping speed of the protocol stack is paid in terms of increased memory footprint, processing speed, and energy consumption. Compared to the most related noncomposable approach, the CRime library used by ProtoStack has a 16--17\% larger footprint, takes 2.4 times longer to execute an open-send-recv-close sequence, and consumes 1.6\% more power in doing so. Even though with ProtoStack more resources are consumed by the node, the tradeoff in terms of prototyping speed pays off.", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yang:2015:PBD, author = "Yong Yang and Lu Su and Mohammad Khan and Michael Lemay and Tarek Abdelzaher and Jiawei Han", title = "Power-Based Diagnosis of Node Silence in Remote High-End Sensing Systems", journal = j-TOSN, volume = "11", number = "2", pages = "33:1--33:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2661639", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Troubleshooting unresponsive sensor nodes is a significant challenge in remote sensor network deployments. While prior work often targets low-end sensor networks, this article introduces a novel diagnostic tool, called the telediagnostic powertracer, geared for remote high-end sensing systems. Leveraging special properties of high-end systems, this in situ troubleshooting tool uses external power measurements to determine the internal health condition of an unresponsive node and the most likely cause of its failure. We develop our own low-cost power meter with low-bandwidth radio, propose both passive and active sampling schemes to measure the power consumption of the host node, and then report the measurements to a base station, hence allowing remote (i.e., tele-) diagnosis. The tool was deployed and tested in a remote solar-powered sensing system for acoustic and visual environmental monitoring. It was shown to successfully distinguish between several categories of failures that cause unresponsive behavior including energy depletion, antenna damage, radio disconnection, system crashes, and anomalous reboots. It was also able to determine the internal health conditions of an unresponsive node, such as the presence or absence of sensing and data storage activities (for each of multiple applications). The article explores the feasibility of building such a remote diagnostic tool from the standpoint of economy, scale, and diagnostic accuracy. The main novelty lies in its use of power consumption as a side channel, which has more availability than other I/O ports, to diagnose sensing system failures.", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Steine:2015:DRA, author = "Marcel Steine and Marc Geilen and Twan Basten", title = "A Distributed Reconfiguration Approach for Quality-of-Service Provisioning in Dynamic Heterogeneous Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "2", pages = "34:1--34:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2663354", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless Sensor Networks (WSNs) are commonly deployed in dynamic environments where events, such as moving sensor nodes and changing external interference, impact the performance, or Quality of Service (QoS), of the network. QoS is expressed by the values of multiple, possibly conflicting, network quality metrics, such as network lifetime and maximum latency of communicating a packet to the sink. Sufficient QoS should be provided by the WSN to ensure that the end-user can successfully use the WSN to perform its application. We propose a distributed reconfiguration approach that actively maintains a sufficient level of QoS at runtime for a heterogeneous WSN in a dynamic environment. Every node uses a feedback control strategy to resolve any difference between the current and required QoS of the network by adapting controllable parameters of the protocol stack. Example parameters are the transmission power and maximum number of packet retransmissions. Nodes collaborate such that, with the combined adaptations, the required network QoS is achieved. The behavior of the reconfiguration approach and the tradeoffs involved are analyzed in detail. With the use of simulations and experiments with actual deployments, we show that our approach allows a better optimization of QoS objectives while constraints are met; for example, it achieves the same packet loss with a significantly longer lifetime, compared to current (re-)configuration approaches.", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Viswanatha:2015:EER, author = "Kumar Viswanatha and Sharadh Ramaswamy and Ankur Saxena and Kenneth Rose", title = "Error\slash Erasure-Resilient and Complexity-Constrained Zero-Delay Distributed Coding for Large-Scale Sensor Networks", journal = j-TOSN, volume = "11", number = "2", pages = "35:1--35:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2663352", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "There has been considerable interest in distributed source coding (DSC) in recent years, primarily due to its potential contributions to low-power sensor networks. However, two major obstacles pose an existential threat to practical deployment of such techniques: the exponential growth of decoding complexity with network size and coding rates and the critical requirement of resilience to bit errors and erasures, given the severe channel conditions in many wireless sensor network applications. This article proposes a novel, unified approach for large-scale, error/erasure-resilient DSC that incorporates an optimally designed, nearest neighbor classifier-based decoding framework, where the design explicitly controls performance versus decoding complexity. Motivated by the highly nonconvex nature of the cost function, we present a deterministic annealing-based optimization algorithm for the joint design of the system parameters, which further enhances the performance over the greedy iterative descent technique. Simulation results on both synthetic and real sensor network data provide strong evidence for performance gains compared to other state-of-the-art techniques and may open the door to practical deployment of DSC in large sensor networks. Moreover, the framework provides a principled way to naturally scale to large networks while constraining decoder complexity, thereby enabling performance gains that increase with network size.", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bagchi:2015:ORC, author = "Amitabha Bagchi and Sainyam Galhotra and Tarun Mangla and Cristina M. Pinotti", title = "Optimal Radius for Connectivity in Duty-Cycled Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "2", pages = "36:1--36:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2663353", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We investigate the condition on transmission radius needed to achieve connectivity in duty-cycled wireless sensor networks (briefly, DC-WSNs). First, we settle a conjecture of Das et al. [2012] and prove that the connectivity condition on random geometric graphs (RGGs), given by Gupta and Kumar [1989], can be used to derive a weakly sufficient condition to achieve connectivity in DC-WSNs. To find a stronger result, we define a new vertex-based random connection model that is of independent interest. Following a proof technique of Penrose [1991], we prove that when the density of the nodes approaches infinity, then a finite component of size greater than 1 exists with probability 0 in this model. We use this result to obtain an optimal condition on node transmission radius that is both necessary and sufficient to achieve connectivity and is hence optimal. The optimality of such a radius is also tested via simulation for two specific duty-cycle schemes, called the contiguous and the random selection duty-cycle schemes. Finally, we design a minimum-radius duty-cycling scheme that achieves connectivity with a transmission radius arbitrarily close to the one required in random geometric graphs. The overhead in this case is that we have to spend some time computing the schedule.", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Knox:2015:WFI, author = "D. A. Knox and T. Kunz", title = "Wireless Fingerprints Inside a Wireless Sensor Network", journal = j-TOSN, volume = "11", number = "2", pages = "37:1--37:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2658999", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We discriminate between different SiLabs IEEE 802.15.4 2.4GHz RF sources using the Ettus Labs USRP1 Software-Defined Radio. The wireless fingerprinting method implemented on the USRP1 device exploits differences in the phase attributes of demodulated data samples. The method does not require the use of expensive spectrum analyzer equipment and the associated high sampling and processing rates with such equipment. Instead, data sample inputs are used, sampled at a rate of 4MHz. This makes implementation using real Wireless Sensor Network nodes feasible and allows wireless fingerprints to be gathered inside each node in a network. This is important since wireless fingerprints degrade over distance, making distributed implementations more attractive. With our method, the USRP1 classifies accurately over a wide range of network conditions, including time and transmission distance. Performance is also stable for different receiving devices. We achieve average classification accuracies of 99.6\% at short range, 95.3\% at medium range, and 81.9\% at long range when classifying a limited sample of five devices from the same manufacturer.", acknowledgement = ack-nhfb, articleno = "37", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Hsieh:2015:EBC, author = "Hung-Yun Hsieh and Chih-Hua Chang and Wei-Chih Liao", title = "Not Every Bit Counts: Data-Centric Resource Allocation for Correlated Data Gathering in Machine-to-Machine Wireless Networks", journal = j-TOSN, volume = "11", number = "2", pages = "38:1--38:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2700270", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Many applications involving machine-to-machine (M2M) communications are characterized by the large amount of data to transport. To support these M2M applications, we argue in this article that instead of focusing on serving individual machines with better quality, one should focus on solutions that can better serve the data itself. To substantiate, we consider the application of data gathering from a set of machines that communicate directly to an aggregator. Since the aggregator has limited radio resources, the problem arises as to how the resource can be effectively utilized for supporting such an application. We investigate ``data-centric'' resource allocation that aims to maximize information entropy of data collected through selecting the subset of machines to transmit, determining the amount of resources to allocate, and scheduling the sequence of transmissions. We present two instantiations of the problems when machines can perform distributed source coding or dependent source coding based on the data overheard from neighboring machines and then propose algorithms for solving the joint optimization problems. Evaluation results show that compared to conventional ``machine-centric'' resource allocation that aims to maximize the aggregate data rates or number of supported machines, ``data-centric'' resource allocation exhibits significant performance gain in terms of the quality of data that can be collected for the given amount of radio resources.", acknowledgement = ack-nhfb, articleno = "38", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ko:2015:DRS, author = "Jeonggil Ko and Jongsoo Jeong and Jongjun Park and Jong Arm Jun and Omprakash Gnawali and Jeongyeup Paek", title = "{DualMOP--RPL}: Supporting Multiple Modes of Downward Routing in a Single {RPL} Network", journal = j-TOSN, volume = "11", number = "2", pages = "39:1--39:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2700261", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:14 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "RPL is an IPv6 routing protocol for low-power and lossy networks (LLNs) designed to meet the requirements of a wide range of LLN applications including smart grid AMIs, home and building automation, industrial and environmental monitoring, health care, wireless sensor networks, and the Internet of Things (IoT) in general with thousands and millions of nodes interconnected through multihop mesh networks. RPL constructs tree-like routing topology rooted at an LLN border router (LBR) and supports bidirectional IPv6 communication to and from the mesh devices by providing both upward and downward routing over the routing tree. In this article, we focus on the interoperability of downward routing and supporting its two modes of operations (MOPs) defined in the RPL standard (RFC 6550). Specifically, we show that there exists a serious connectivity problem in RPL protocol when two MOPs are mixed within a single network, even for standard-compliant implementations, which may result in network partitions. To address this problem, this article proposes DualMOP-RPL, an enhanced version of RPL, which supports nodes with different MOPs for downward routing to communicate gracefully in a single RPL network while preserving the high bidirectional data delivery performance. DualMOP-RPL allows multiple overlapping RPL networks in the same geographical regions to cooperate as a single densely connected network even if those networks are using different MOPs. This will not only improve the link qualities and routing performances of the networks but also allow for network migrations and alternate routing in the case of LBR failures. We evaluate DualMOP-RPL through extensive simulations and testbed experiments and show that our proposal eliminates all the problems we have identified.", acknowledgement = ack-nhfb, articleno = "39", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bui:2015:SAS, author = "Nicola Bui and Michele Rossi", title = "Staying Alive: System Design for Self-Sufficient Sensor Networks", journal = j-TOSN, volume = "11", number = "3", pages = "40:1--40:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2700269", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:17 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Self-sustainability is a crucial step for modern sensor networks. Here, we offer an original and comprehensive framework for autonomous sensor networks powered by renewable energy sources. We decompose our design into two nested optimization steps: the inner step characterizes the optimal network operating point subject to an average energy consumption constraint, while the outer step provides online energy management policies that make the system energetically self-sufficient in the presence of unpredictable and intermittent energy sources. Our framework sheds new light into the design of pragmatic schemes for the control of energy-harvesting sensor networks and permits to gauge the impact of key sensor network parameters, such as the battery capacity, the harvester size, the information transmission rate, and the radio duty cycle. We analyze the robustness of the obtained energy management policies in the cases where the nodes have differing energy inflow statistics and where topology changes may occur, devising effective heuristics. Our energy management policies are finally evaluated considering real solar radiation traces, validating them against state-of-the-art solutions, and describing the impact of relevant design choices in terms of achievable network throughput and battery-level dynamics.", acknowledgement = ack-nhfb, articleno = "40", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Du:2015:SPM, author = "Wan Du and Zikun Xing and Mo Li and Bingsheng He and Lloyd Hock Chye Chua and Haiyan Miao", title = "Sensor Placement and Measurement of Wind for Water Quality Studies in Urban Reservoirs", journal = j-TOSN, volume = "11", number = "3", pages = "41:1--41:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2700265", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:17 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We study the water quality in an urban district, where the surface wind distribution is an essential input but undergoes high spatial and temporal variations due to the impact of surrounding buildings. In this work, we develop an optimal sensor placement scheme to measure the wind distribution over a large urban reservoir using a limited number of wind sensors. Unlike existing solutions that assume Gaussian process of target phenomena, this study measures the wind that inherently exhibits strong non-Gaussian yearly distribution. By leveraging the local monsoon characteristics of wind, we segment a year into different monsoon seasons that follow a unique distribution respectively. We also use computational fluid dynamics to learn the spatial correlation of wind. The output of sensor placement is a set of the most informative locations to deploy the wind sensors, based on the readings of which we can accurately predict the wind over the entire reservoir in real time. Ten wind sensors are deployed. The in-field measurement results of more than 3 months suggest that the proposed sensor placement and spatial prediction scheme provides accurate wind measurement that outperforms the state-of-the-art Gaussian model based on interpolation-based approaches.", acknowledgement = ack-nhfb, articleno = "41", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Lin:2015:TSN, author = "Shan Lin and Gang Zhou and Mo'taz Al-Hami and Kamin Whitehouse and Yafeng Wu and John A. Stankovic and Tian He and Xiaobing Wu and Hengchang Liu", title = "Toward Stable Network Performance in Wireless Sensor Networks: a Multilevel Perspective", journal = j-TOSN, volume = "11", number = "3", pages = "42:1--42:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2700272", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:17 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Many applications in wireless sensor networks require communication performance that is both consistent and of high quality. Unfortunately, performance of current network protocols can vary significantly because of various interferences and environmental changes. Current protocols estimate link quality based on the reception of probe packets over a short time period. This method is neither efficient nor accurate enough to capture the dramatic variations of link quality. Therefore, we propose a link metric called competence that characterizes links over a longer period of time. We combine competence with current short-term estimations in routing algorithm designs. To further improve network performance, we have designed a distributed route maintenance framework based on feedback control solutions. This framework allows every link along an end-to-end (E2E) path to adjust its link protocol parameters, such as transmission power and number of retransmissions, to ensure specified E2E reliability and latency under dynamic link qualities. Our solutions are evaluated in both extensive simulations and real system experiments. In real system evaluations with 48 T-Motes, our overall solution improves E2E packet delivery ratio over existing solutions by up to 40\% while reducing transmission energy consumption by up to 22\%. Importantly, our solution also achieves more stable and better transient performance than current approaches.", acknowledgement = ack-nhfb, articleno = "42", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Nguyen:2015:GEE, author = "Nam Tuan Nguyen and Rong Zheng and Jie Liu and Zhu Han", title = "{GreenLocs}: an Energy-Efficient Indoor Place Identification Framework", journal = j-TOSN, volume = "11", number = "3", pages = "43:1--43:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2700271", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:17 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Understanding indoor mobility patterns of people is important in applications such as targeted advertisement, microclimate control, and delivery of anticipatory notifications. In this article, we devise GreenLocs, a nonparametric, profiling-free, yet lightweight and energy-efficient inference framework, to identify recurring and new places that mobile users visit indoor. Combining WiFi scans and accelerometer readings, GreenLocs can accurately decide a new place and a revisited place with just a few radio signal strength (RSS) samples. GreenLocs consists of three major building blocks, namely, missing data handling algorithms, a nonparametric Bayesian inference model, and a stopping rule, which significantly increases the energy efficiency of the system. GreenLocs is shown to be robust to signal variations and missing data through experimental evaluations using traces collected from mobile phones of different brands/models.", acknowledgement = ack-nhfb, articleno = "43", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Shu:2015:TLW, author = "Yuanchao Shu and Peng Cheng and Yu Gu and Jiming Chen and Tian He", title = "{TOC}: Localizing Wireless Rechargeable Sensors with Time of Charge", journal = j-TOSN, volume = "11", number = "3", pages = "44:1--44:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2700257", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:17 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The wireless rechargeable sensor network is a promising platform for long-term applications such as inventory management, supply chain monitoring, and so on. For these applications, sensor localization is one of the most fundamental challenges. Different from a traditional sensor node, a wireless rechargeable sensor has to be charged above a voltage level by the wireless charger in order to support its sensing, computation, and communication operations. In this work, we consider the scenario where a mobile charger stops at different positions to charge sensors and propose a novel localization design that utilizes the unique Time of Charge (TOC) sequences among wireless rechargeable sensors. Specifically, we introduce two efficient region dividing methods, Internode Division and Interarea Division, to exploit TOC differences from both temporal and spatial dimensions to localize individual sensor nodes. To further optimize the system performance, we introduce both an optimal charger stop planning algorithm for the single-sensor case and a suboptimal charger stop planning algorithm for the generic multisensor scenario with a provable performance bound. We have extensively evaluated our design by both testbed experiments and large-scale simulations. The experiment and simulation results show that by as less as five stops, our design can achieve sub-meter accuracy and the performance is robust under various system conditions.", acknowledgement = ack-nhfb, articleno = "44", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Xu:2015:HDA, author = "Xi Xu and Rashid Ansari and Ashfaq Khokhar and Athanasios V. Vasilakos", title = "Hierarchical Data Aggregation Using Compressive Sensing {(HDACS)} in {WSNs}", journal = j-TOSN, volume = "11", number = "3", pages = "45:1--45:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2700264", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:17 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Energy efficiency is one of the key objectives in data gathering in wireless sensor networks (WSNs). Recent research on energy-efficient data gathering in WSNs has explored the use of Compressive Sensing (CS) to parsimoniously represent the data. However, the performance of CS-based data gathering methods has been limited since the approaches failed to take advantage of judicious network configurations and effective CS-based data aggregation procedures. In this article, a novel Hierarchical Data Aggregation method using Compressive Sensing (HDACS) is presented, which combines a hierarchical network configuration with CS. Our key idea is to set multiple compression thresholds adaptively based on cluster sizes at different levels of the data aggregation tree to optimize the amount of data transmitted. The advantages of the proposed model in terms of the total amount of data transmitted and data compression ratio are analytically verified. Moreover, we formulate a new energy model by factoring in both processor and radio energy consumption into the cost, especially the computation cost incurred in relatively complex algorithms. We also show that communication cost remains dominant in data aggregation in the practical applications of large-scale networks. We use both the real-world data and synthetic datasets to test CS-based data aggregation schemes on the SIDnet-SWANS simulation platform. The simulation results demonstrate that the proposed HDACS model guarantees accurate signal recovery performance. It also provides substantial energy savings compared with existing methods.", acknowledgement = ack-nhfb, articleno = "45", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Lambrou:2015:OCD, author = "Theofanis P. Lambrou", title = "Optimized Cooperative Dynamic Coverage in Mixed Sensor Networks", journal = j-TOSN, volume = "11", number = "3", pages = "46:1--46:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2700260", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:17 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article considers the problem of improving the dynamic coverage and event detection time of mixed wireless sensor networks (WSNs). We consider mixed WSNs that consist of sparse static sensor deployments and mobile sensors that move continuously to monitor uncovered (vacant) areas in the sensor field. Mobile sensors move autonomously and cooperatively by executing a path planning algorithm. Using a simplified scenario, the article derives the optimal path strategy for a single mobile sensor to search two nonconnected uncovered regions with the minimum average detection delay or with the maximum dynamic coverage. The resulting optimal strategy confirms that it is better to search areas that are less likely to hide a target but are located closer to the mobile node, rather than heading toward the most likely area. Based on the insights gained from the simplified scenario and the theory of coverage processes, the article proposes a surrogate method to approximate the best searching neighborhood radius (a design parameter of the path planning algorithm) that optimizes the dynamic coverage and event detection time capabilities of mixed WSN deployments. Extensive simulation results indicate that this approach can achieve very good results, both for a single and for multiple collaborating mobile sensors.", acknowledgement = ack-nhfb, articleno = "46", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Suresh:2015:TOM, author = "Mahima Agumbe Suresh and Wei Zhang and Weijiao Gong and Radu Stoleru and Amin Rasekh and M. Katherine Banks", title = "Toward Optimal Monitoring of Flow-Based Systems Using Mobile Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "3", pages = "48:1--48:??", month = feb, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2700256", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 3 12:36:17 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Monitoring flow-based systems (FBS) (e.g., water distribution systems, oil and gas pipelines, the human cardiovascular system) is of paramount importance considering their economic and health impacts. FBS monitoring typically has been achieved by costly, complex, static sensors that are strategically placed. To reduce the cost of monitoring, we propose a mobile wireless sensor network (WSN) system comprised of mobile sensors (their movement aided by the inherent flow in the FBS) and static beacons that aid in locating sensors. This article presents the first complete architectural design, algorithms, and protocols for optimal monitoring of FBS. Our proposed solution includes sensing and communication models, MAC and group management protocols for sensor and beacon communication, and algorithms for sensor and beacon placement. We compare our proposed solution with the state of the art through extensive simulations and a proof-of-concept system implementation. We demonstrate performance improvements, such as a dramatic reduction (a factor of 91) in the number of sensors when the sensing range is marginally (2.5 times) increased.", acknowledgement = ack-nhfb, articleno = "48", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bagaa:2015:DLL, author = "Miloud Bagaa and Mohamed Younis and Djamel Djenouri and Abdelouahid Derhab and Nadjib Badache", title = "Distributed Low-Latency Data Aggregation Scheduling in Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "3", pages = "49:1--49:??", month = may, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2744198", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu May 28 17:43:09 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article considers the data aggregation scheduling problem, where a collision-free schedule is determined in a distributed way to route the aggregated data from all the sensor nodes to the base station within the least time duration. The algorithm proposed in this article (Distributed algorithm for Integrated tree Construction and data Aggregation (DICA)) intertwines the tree formation and node scheduling to reduce the time latency. Furthermore, while forming the aggregation tree, DICA maximizes the available choices for parent selection at every node, where a parent may have the same, lower, or higher hop count to the base station. The correctness of the DICA is formally proven, and upper bounds for time and communication overhead are derived. Its performance is evaluated through simulation and compared with six delay-aware aggregation algorithms. The results show that DICA outperforms competing schemes. The article also presents a general hardware-in-the-loop framework (DAF) for validating data aggregation schemes on Wireless Sensor Networks (WSNs). The framework factors in practical issues such as clock synchronization and the sensor node hardware. DICA is implemented and validated using this framework on a test bed of sensor motes that runs TinyOS 2.x, and it is compared with a distributed protocol (DAS) that is also implemented using the proposed framework.", acknowledgement = ack-nhfb, articleno = "49", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kumar:2015:GEB, author = "Dheeraj Kumar and Sutharshan Rajasegarar and Marimuthu Palaniswami", title = "Geospatial Estimation-Based Auto Drift Correction in Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "3", pages = "50:1--50:??", month = may, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2736697", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu May 28 17:43:09 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks are often deployed in large numbers, over a large geographical region, in order to monitor the phenomena of interest. Sensors used in the sensor networks often suffer from random or systematic errors such as drift and bias. Even if they are calibrated at the time of deployment, they tend to drift as time progresses. Consequently, the progressive manual calibration of such a large-scale sensor network becomes impossible in practice. In this article, we address this challenge by proposing a collaborative framework to automatically detect and correct the drift in order to keep the data collected from these networks reliable. We propose a novel scheme that uses geospatial estimation-based interpolation techniques on measurements from neighboring sensors to collaboratively predict the value of phenomenon being observed. The predicted values are then used iteratively to correct the sensor drift by means of a Kalman filter. Our scheme can be implemented in a centralized as well as distributed manner to detect and correct the drift generated in the sensors. For centralized implementation of our scheme, we compare several kriging- and nonkriging-based geospatial estimation techniques in combination with the Kalman filter, and show the superiority of the kriging-based methods in detecting and correcting the drift. To demonstrate the applicability of our distributed approach on a real world application scenario, we implement our algorithm on a network consisting of Wireless Sensor Network (WSN) hardware. We further evaluate single as well as multiple drifting sensor scenarios to show the effectiveness of our algorithm for detecting and correcting drift. Further, we address the issue of high power usage for data transmission among neighboring nodes leading to low network lifetime for the distributed approach by proposing two power saving schemes. Moreover, we compare our algorithm with a blind calibration scheme in the literature and demonstrate its superiority in detecting both linear and nonlinear drifts.", acknowledgement = ack-nhfb, articleno = "50", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhang:2015:ARF, author = "Shigeng Zhang and Xuan Liu and Jianxin Wang and Jiannong Cao and Geyong Min", title = "Accurate Range-Free Localization for Anisotropic Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "3", pages = "51:1--51:??", month = may, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2746343", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu May 28 17:43:09 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Position information plays a pivotal role in wireless sensor network (WSN) applications and protocol/algorithm design. In recent years, range-free localization algorithms have drawn much research attention due to their low cost and applicability to large-scale WSNs. However, the application of range-free localization algorithms is restricted because of their dramatic accuracy degradation in practical anisotropic WSNs, which is mainly caused by large error of distance estimation. Distance estimation in the existing range-free algorithms usually relies on a unified per hop length (PHL) metric between nodes. But the PHL between different nodes might be greatly different in anisotropic WSNs, resulting in large error in distance estimation. We find that, although the PHL between different nodes might be greatly different, it exhibits significant locality; that is, nearby nodes share a similar PHL to anchors that know their positions in advance. Based on the locality of the PHL, a novel distance estimation approach is proposed in this article. Theoretical analyses show that the error of distance estimation in the proposed approach is only one-fourth of that in the state-of-the-art pattern-driven scheme (PDS). An anchor selection algorithm is also devised to further improve localization accuracy by mitigating the negative effects from the anchors that are poorly distributed in geometry. By combining the locality-based distance estimation and the anchor selection, a range-free localization algorithm named {\underline{S}}elective {\underline{M}}ultilateration (SM) is proposed. Simulation results demonstrate that SM achieves localization accuracy higher than $ 0.3 r $, where $r$ is the communication radius of nodes. Compared to the state-of-the-art solution, SM improves the distance estimation accuracy by up to 57\% and improves localization accuracy by up to 52\% consequently.", acknowledgement = ack-nhfb, articleno = "51", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Naveen:2015:RSC, author = "K. P. Naveen and Anurag Kumar", title = "Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "3", pages = "52:1--52:??", month = may, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2757280", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu May 28 17:43:09 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-wake cycling nodes, we are interested in the local decision problem faced by a node that has ``custody'' of a packet and has to choose one among a set of next-hop relay nodes to forward the packet toward the sink. Each relay is associated with a ``reward'' that summarizes the benefit of forwarding the packet through that relay. We seek a solution to this local problem, the idea being that such a solution, if adopted by every node, could provide a reasonable heuristic for the end-to-end forwarding problem. Toward this end, we propose a local {\em relay\/} selection {problem} consisting of a forwarding node and a collection of relay nodes, with the relays waking up sequentially at random times. At each relay wake-up instant, the forwarder can choose to {\em probe\/} a relay to learn its reward value, based on which the forwarder can then decide whether to {\em stop\/} (and forward its packet to the chosen relay) or to {\em continue\/} to wait for further relays to wake up. The forwarder's objective is to select a relay so as to minimize a combination of waiting delay, reward, and probing cost. The local decision problem can be considered as a variant of the asset selling problem studied in the operations research literature. We formulate the local problem as a Markov decision process (MDP) and characterize the solution in terms of {\em stopping\/} sets and {\em probing\/} sets. We provide results illustrating the structure of the stopping sets, namely, the (lower bound) threshold and the stage independence properties. Regarding the probing sets, we make an interesting conjecture that these sets are characterized by upper bounds. Through simulation experiments, we provide valuable insights into the performance of the optimal local forwarding and its use as an end-to-end forwarding heuristic.", acknowledgement = ack-nhfb, articleno = "52", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ali:2015:AHC, author = "Azad Ali and Abdelmajid Khelil and Neeraj Suri and Mohammadreza Mahmudimanesh", title = "Adaptive Hybrid Compression for Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "4", pages = "53:1--53:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2754932", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless Sensor Networks (WSNs) are often deployed to sample the desired environmental attributes and deliver the acquired samples to a central station, termed as the sink, for processing as needed by the application. Many applications stipulate high granularity and data accuracy that results in high data volumes. However, sensor nodes are battery powered, and sending the requested large amounts of data rapidly depletes their energy. Fortunately, environmental attributes (e.g., temperature, pressure) often exhibit spatial and temporal correlations. Moreover, a large class of applications such as scientific analysis and simulations tolerate high latency for sensor data collection. Hence, we exploit the spatiotemporal correlation of sensor readings while benefiting from possible data delivery latency tolerance to minimize the amount of data to be transported to the sink. Accordingly, we develop a fully distributed adaptive hybrid compression scheme that exploits both spatial and temporal data redundancies and fuses both temporal and spatial compression for maximal data compression with accuracy guarantees. We present two main contributions: (i) an adaptive modeling technique that allows frugal and maximized temporal compression on resource-constraint sensor nodes by exploiting the data collection latency, and (ii) a novel model-based hierarchical clustering technique that allows for maximized spatial compression resulting into a hybrid compression scheme. Compared to the existing spatiotemporal compression approaches, our approach is fully decentralized and the proposed clustering scheme is based on sensor data models rather than instantaneous sensor data values, which allows merging nearby nodes with similar models into large clusters over a longer period of time rather than specific time instances. The analysis for computation and message overheads, the analysis for theoretical compressibility, and simulations using real-world data demonstrate that our proposed scheme can provide significant communication/energy savings without sacrificing the accuracy of collected data.", acknowledgement = ack-nhfb, articleno = "53", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Jafarizadeh:2015:ADL, author = "Saber Jafarizadeh and Abbas Jamalipour", title = "Adapting Distributed {LT} codes to {Y}-Networks: an Abstraction of Collection Tree in Sensor Networks", journal = j-TOSN, volume = "11", number = "4", pages = "54:1--54:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2764459", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The conventional approach for collecting data in sensor networks is the combination of automatic repeat-request techniques with a collection tree scheme in which all routes end up in the sink node. A high number of acknowledgments and retransmissions is the main drawback of this scheme. Erasure-correcting codes, in particular Fountain codes, can be employed to reduce the number of retransmissions. In the collection tree scheme, it is common for multiple routes to share a bottleneck. In such scenarios, to reach the optimal network throughput, it is necessary to combine the Fountain codes and Network Coding (NC) technique. Y-networks can be considered as an abstraction to this scenario. This article proposes a new algorithm, namely, Adaptive Distributed LT code (ADLT), for combining LT codes with NC in Y-networks. The ADLT algorithm enables belief propagation decoding by employing a novel technique called degree distribution updating, to preserve Robust Soliton degree distribution at destination. Unlike previously proposed algorithms in the literature, the ADLT algorithm has the flexibility to handle any number of sources with different block sizes and transmission rates, where sources perform standard LT coding. Simulation results confirm that the performance of the ADLT algorithm is close to that of standard LT code.", acknowledgement = ack-nhfb, articleno = "54", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Hu:2015:SSB, author = "Shaohan Hu and Lu Su and Hengchang Liu and Hongyan Wang and Tarek F. Abdelzaher", title = "{SmartRoad}: {Smartphone}-Based Crowd Sensing for Traffic Regulator Detection and Identification", journal = j-TOSN, volume = "11", number = "4", pages = "55:1--55:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2770876", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article we present SmartRoad, a crowd-sourced road sensing system that detects and identifies traffic regulators, traffic lights, and stop signs, in particular. As an alternative to expensive road surveys, SmartRoad works on participatory sensing data collected from GPS sensors from in-vehicle smartphones. The resulting traffic regulator information can be used for many assisted-driving or navigation systems. In order to achieve accurate detection and identification under realistic and practical settings, SmartRoad automatically adapts to different application requirements by (i) intelligently choosing the most appropriate information representation and transmission schemes, and (ii) dynamically evolving its core detection and identification engines to effectively take advantage of any external ground truth information or manual label opportunity. We implemented SmartRoad on a vehicular smartphone test bed, and deployed it on 35 external volunteer users' vehicles for two months. Experiment results show that SmartRoad can robustly, effectively, and efficiently carry out the detection and identification tasks.", acknowledgement = ack-nhfb, articleno = "55", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tian:2015:SSH, author = "Jie Tian and Tan Yan and Xin Gao and Guiling Wang", title = "Scheduling Survivability-Heterogeneous Sensor Networks for Critical Location Surveillance", journal = j-TOSN, volume = "11", number = "4", pages = "56:1--56:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2764914", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Sensor nodes deployed outdoors for field surveillance are subject to environmental detriments. In this article, we propose a heterogeneous sensor network composed of sensor nodes with different environmental survivability to make it robust to environmental damage and keep it at a reasonable cost. We, for the first time, study the scheduling problem in such heterogeneous sensor networks for critical location surveillance applications. Our goal is to monitor all the critical points for as long as possible under different environmental conditions. We identify the underlying problem, theoretically prove its NP-complete nature, and propose a novel adaptive greedy scheduling algorithm to solve the problem. The algorithm incorporates several heuristics to schedule the activity of both regular and robust sensors to monitor all the critical points, while at the same time minimizing and balancing the network energy consumption. Simulation results show that our algorithm efficiently solves the problem and outperforms other alternatives.", acknowledgement = ack-nhfb, articleno = "56", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Xu:2015:OEE, author = "Lijie Xu and Guihai Chen and Jiannong Cao and Shan Lin and Haipeng Dai and Xiaobing Wu and Fan Wu", title = "Optimizing Energy Efficiency for Minimum Latency Broadcast in Low-Duty-Cycle Sensor Networks", journal = j-TOSN, volume = "11", number = "4", pages = "57:1--57:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2753763", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Multihop broadcasting in low-duty-cycle Wireless Sensor Networks (WSNs) is a very challenging problem, since every node has its own working schedule. Existing solutions usually use unicast instead of broadcast to forward packets from a node to its neighbors according to their working schedules, which is, however, not energy efficient. In this article, we propose to exploit the broadcast nature of wireless media to further save energy for low-duty-cycle networks, by adopting a novel broadcasting communication model. The key idea is to let some early wake-up nodes postpone their wake-up slots to overhear broadcasting messages from its neighbors. This model utilizes the spatiotemporal locality of broadcast to reduce the total energy consumption, which can be essentially characterized by the total number of broadcasting message transmissions. Based on such model, we aim at minimizing the total number of broadcasting message transmissions of a broadcast for low-duty-cycle WSNs, subject to the constraint that the broadcasting latency is optimal. We prove that it is NP-hard to find the optimal solution, and design an approximation algorithm that can achieve a polylogarithmic approximation ratio. Extensive simulation results show that our algorithm outperforms the traditional solutions in terms of energy efficiency.", acknowledgement = ack-nhfb, articleno = "57", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Schieferdecker:2015:LFD, author = "Dennis Schieferdecker", title = "Location-Free Detection of Network Boundaries", journal = j-TOSN, volume = "11", number = "4", pages = "58:1--58:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2795232", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A novel algorithm is proposed for the distributed and location-free detection of boundaries in sensor networks. The approach allows a node to decide autonomously, based solely on connectivity information of a small 2-hop neighborhood, whether it is in the interior of the network or on its fringes. This makes the presented algorithm well suited for scenarios that include mobility or dynamic changes to the network topology. The algorithm is compared qualitatively and quantitatively to multiple previous approaches. Various models and network settings are considered in extensive simulations. Even though the algorithm uses less information than most other approaches, it yields significantly better results. It is very robust against variations in node degree and does not rely on simplified assumptions of the communication model. Moreover, the approach is easy to implement on real sensor nodes, as it requires little computational power.", acknowledgement = ack-nhfb, articleno = "58", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Branco:2015:TFS, author = "Adriano Branco and Francisco Sant'anna and Roberto Ierusalimschy and Noemi Rodriguez and Silvana Rossetto", title = "{Terra}: Flexibility and Safety in Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "4", pages = "59:1--59:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2811267", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Terra is a system for programming wireless sensor network (WSN) applications. It combines the use of configurable virtual machines with a reactive scripting language that can be statically analyzed to avoid unbounded execution and memory conflicts. This approach allows the flexibility of remotely uploading code on motes to be combined with a set of guarantees for the programmer. The choice of the specific set of components in a virtual machine configuration defines the abstraction level seen by the application script. We describe a specific component library built for Terra, which we designed taking into account the functionality commonly needed in WSN applications --- typically for sense and control. We also discuss the programming environment resulting from the combination of a statically analyzable scripting language with this library of components. Finally, we evaluate Terra by measuring its overhead in a basic application and discussing its use and cost in a typical monitoring WSN scenario.", acknowledgement = ack-nhfb, articleno = "59", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Feldman:2015:IGS, author = "Dan Feldman and Cynthia Sung and Andrew Sugaya and Daniela Rus", title = "{iDiary}: From {GPS} Signals to a Text-Searchable Diary", journal = j-TOSN, volume = "11", number = "4", pages = "60:1--60:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2814569", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article describes iDiary, a system that takes as input GPS data streams generated by users' phones and turns them into textual descriptions of the trajectories. The system features a user interface similar to Google Search that allows users to type text queries on their activities (e.g., ``Where did I buy books?'') and receive textual answers based on their GPS signals. iDiary uses novel algorithms for semantic compression and trajectory clustering of massive GPS signals in parallel to compute the critical locations of a user. We encode these problems as follows. The $k$-segment mean is a $k$-piecewise linear function that minimizes the regression distance to the signal. The $ (k, m)$-segment mean has an additional constraint that the projection of the $k$ segments on $ R^d$ consists of only $ m \leq k$ segments. A coreset for this problem is a smart compression of the input signal that allows computation of a $ (1 + \epsilon)$-approximation to its $k$-segment or $ (k, m)$-segment mean in $ O (n \log n)$ time for arbitrary constants $ \epsilon $, $k$, and $m$. We use coresets to obtain a parallel algorithm that scans the signal in one pass, using space and update time per point that is polynomial in $ \log n$. Using an external database, we then map these locations to textual descriptions and activities so that we can apply text mining techniques on the resulting data (e.g., LSA or transportation mode recognition). We provide experimental results for both the system and algorithms and compare them to existing commercial and academic state of the art. This is the first GPS system that enables text-searchable activities from GPS data.", acknowledgement = ack-nhfb, articleno = "60", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ebrahimi:2015:NCA, author = "Dariush Ebrahimi and Chadi Assi", title = "Network Coding-Aware Compressive Data Gathering for Energy-Efficient Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "4", pages = "61:1--61:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2829953", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article investigates the joint application of compressive sensing (CS) and network coding (NC) to the problem of energy-efficient data gathering in wireless sensor networks. We consider the problem of optimally constructing forwarding trees to carry compressed data to projection nodes. Each compressed dataset refers to a weighted aggregation (or sum) of sensed measurements from network sensors collected at one projection node. Projection nodes then forward their received compressed data to the sink, which subsequently recovers the original measurements. This aggregation technique, based on CS, is shown to reduce significantly the number of transmissions in the network. We observe that the presence of multiple forwarding trees gives rise to many-to-many communication patterns in sensor networks that, in turn, can be exploited to perform NC on the compressed data being forwarded on these trees. Such a technique will further reduce the number of transmissions required to gather the measurements, resulting in a better network-wide energy efficiency. This article addresses the problem of NC--aware construction of forwarding/aggregation trees. We present a mathematical model to optimally construct such forwarding trees, which encourage NC operations on the compressed data. Owing to its complexity, we further develop algorithmic methods (both centralized and distributed) for solving the problem and analyze their complexities. We show that our algorithmic methods are scalable and accurate, with worst-case optimality gap not exceeding 3.96\% in the studied scenarios. We also show that, when both NC and compressive data gathering are considered jointly, performance gains (reduction in number of transmissions) of up to 30\% may be attained. Finally, we show that the proposed methods distribute the workload of data gathering throughout the network nodes uniformly, resulting in extended network life times.", acknowledgement = ack-nhfb, articleno = "61", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Margolies:2015:EHA, author = "Robert Margolies and Maria Gorlatova and John Sarik and Gerald Stanje and Jianxun Zhu and Paul Miller and Marcin Szczodrak and Baradwaj Vigraham and Luca Carloni and Peter Kinget and Ioannis Kymissis and Gil Zussman", title = "{Energy-Harvesting Active Networked Tags (EnHANTs)}: Prototyping and Experimentation", journal = j-TOSN, volume = "11", number = "4", pages = "62:1--62:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2831236", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article focuses on a new type of wireless devices in the domain between RFIDs and sensor networks-Energy-Harvesting Active Networked Tags (EnHANTs). Future EnHANTs will be small, flexible, and self-powered devices that can be attached to objects that are traditionally not networked (e.g., books, furniture, toys, produce, and clothing). Therefore, they will provide the infrastructure for various tracking applications and can serve as one of the enablers for the Internet of Things. We present the design considerations for the EnHANT prototypes, developed over the past 4 years. The prototypes harvest indoor light energy using custom organic solar cells, communicate and form multihop networks using ultra-low-power Ultra-Wideband Impulse Radio (UWB-IR) transceivers, and dynamically adapt their communications and networking patterns to the energy harvesting and battery states. We describe a small-scale testbed that uniquely allows evaluating different algorithms with trace-based light energy inputs. Then, we experimentally evaluate the performance of different energy-harvesting adaptive policies with organic solar cells and UWB-IR transceivers. Finally, we discuss the lessons learned during the prototype and testbed design process.", acknowledgement = ack-nhfb, articleno = "62", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhang:2015:GND, author = "Desheng Zhang and Tian He and Yunhuai Liu and Yu Gu and Fan Ye and Raghu K. Ganti and Hui Lei", title = "Generic Neighbor Discovery Accelerations in Mobile Applications", journal = j-TOSN, volume = "11", number = "4", pages = "63:1--63:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2832914", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "As a supporting primitive of many mobile applications, neighbor discovery identifies nearby devices so that they can exchange information and collaborate in a peer-to-peer manner. To date, discovery schemes trade a long latency for energy efficiency and require a collaborative duty cycle pattern, and thus they are not suitable for interactive mobile applications where a user is unable to configure others' devices. In this article, we propose Acc, which serves as an on-demand generic discovery accelerating middleware for many deterministic neighbor discovery schemes. Acc leverages the discovery capabilities of neighbor devices, supporting both direct and indirect neighbor discoveries. Further, we present a proactive online rendezvous maintenance mechanism, which is used to reduce delays for the detection of leaving of neighbors. Our evaluations show that Acc -assisted discovery schemes reduce latency by up to 51.8\% compared to schemes consuming the same amount of energy. More importantly, to prove the real-world value of Acc, we further present and evaluate a Crowd-Alert application where Acc is employed by taxi drivers to accelerate selection of a direction with fewer competing taxis and more potential passengers, based on a 280GB dataset of more than 14,000 taxis in Shenzhen, the most crowded city in China.", acknowledgement = ack-nhfb, articleno = "63", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chen:2015:RMR, author = "Li Chen and Jeremy Warner and Pak Lam Yung and Dawei Zhou and Wendi Heinzelman and Ilker Demirkol and Ufuk Muncuk and Kaushik Chowdhury and Stefano Basagni", title = "{REACH $2$-Mote}: a Range-Extending Passive Wake-Up Wireless Sensor Node", journal = j-TOSN, volume = "11", number = "4", pages = "64:1--64:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2829954", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A wireless sensor network that employs passive radio wake-up of the sensor nodes can reduce the energy cost for unnecessary idle listening and communication overhead, extending the network lifetime. A passive wake-up radio is powered by the electromagnetic waves transmitted by a wake-up transmitter rather than a battery on the sensor node. However, this method of powering the wake-up radio results in a short wake-up range, which limits the performance of a passive wake-up radio sensor network. In this article, we describe our design of a passive wake-up radio sensor node-REACH$^2$ -Mote-using a high-efficiency, energy-harvesting module and a very low power wake-up circuit to achieve an extended wake-up range. We implemented REACH$^2$ -Mote in hardware and performed field tests to characterize its performance. The experimental results show that REACH$^2$ -Mote can achieve a wake-up range of 44 feet. We also modeled REACH$^2$ -Mote and evaluated its performance through simulations, comparing its performance to that of another passive wake-up radio approach, an active wake-up radio approach, and a conventional duty cycling approach. The simulation results show that REACH$^2$ -Mote can significantly extend the network lifetime while achieving high packet delivery rate and low latency.", acknowledgement = ack-nhfb, articleno = "64", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liu:2016:TMT, author = "Chin-Jung Liu and Pei Huang and Li Xiao", title = "{TAS-MAC}: a Traffic-Adaptive Synchronous {MAC} Protocol for Wireless Sensor Networks", journal = j-TOSN, volume = "12", number = "1", pages = "1:1--1:??", month = mar, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2835180", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:25 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Duty cycling improves energy efficiency but limits throughput and introduces significant end-to-end delay in wireless sensor networks. In this article, we present a traffic-adaptive synchronous MAC protocol (TAS-MAC), which is a high-throughput, low-delay MAC protocol tailored for low power consumption. It achieves high throughput by adapting time division multiple access (TDMA) to a novel traffic-adaptive allocation mechanism that assigns time slots only to nodes located on active routes. TAS-MAC reduces the end-to-end delay by notifying all nodes on active routes of incoming traffic in advance. These nodes will claim time slots for data transmission and forward a packet through multiple hops in a cycle. The desirable traffic-adaptive feature is achieved by decomposing traffic notification and data-transmission scheduling into two phases, specializing their duties and improving their efficiency, respectively. Simulation results and experiments on TelosB motes demonstrate that the two-phase design significantly improves the throughput of current synchronous MAC protocols and achieves the similar low delay of slot-stealing-assisted TDMA with much lower power consumption.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Restuccia:2016:OLS, author = "Francesco Restuccia and Sajal K. Das", title = "Optimizing the Lifetime of Sensor Networks with Uncontrollable Mobile Sinks and {QoS} Constraints", journal = j-TOSN, volume = "12", number = "1", pages = "2:1--2:??", month = mar, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2873059", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:25 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In past literature, it has been demonstrated that the use of mobile sinks (MSs) increases dramatically the lifetime of wireless sensor networks (WSNs). In applications where the MSs are humans, animals, or transportation systems, the mobility of the MSs is often uncontrollable and could also be random and unpredictable. This implies the necessity of algorithms tailored to handle uncertainty on the MS mobility. In this article, we define the lifetime optimization of a WSN in the presence of uncontrollable sink mobility and Quality of Service (QoS) constraints. After defining an ideal scheme (called Oracle ) which provably maximizes network lifetime, we present a novel Swarm-Intelligence-based Sensor Selection Algorithm (SISSA), which optimizes network lifetime and meets predefined QoS constraints. Then we mathematically analyze SISSA and derive analytical bounds on energy consumption, number of messages exchanged, and convergence time. The algorithm is experimentally evaluated on practical experimental setups, and its performances are compared to that by the optimal Oracle scheme, as well as with the IEEE 802.15.4 MAC and TDMA schemes. Results conclude that SISSA provides on the average the 56\% of the lifetime provided by Oracle and outperforms IEEE 802.15.4 and TDMA in terms of yielded network lifetime.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wu:2016:EMC, author = "Yafeng Wu and Kin Sum Liu and John A. Stankovic and Tian He and Shan Lin", title = "Efficient Multichannel Communications in Wireless Sensor Networks", journal = j-TOSN, volume = "12", number = "1", pages = "3:1--3:??", month = mar, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2840808", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:25 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article demonstrates how to use multiple channels to improve communication performance in Wireless Sensor Networks (WSNs). We first investigate multichannel realities in WSNs through intensive empirical experiments with Micaz motes. Our study shows that current multichannel protocols are not suitable for WSNs because of the small number of available channels and unavoidable time errors found in real networks. With these observations, we propose a novel tree-based, multichannel scheme for data collection applications, which allocates channels to disjoint trees and exploits parallel transmissions among trees. In order to minimize interference within trees, we define a new channel assignment problem that is proven NP-complete. Then, we propose a greedy channel allocation algorithm that outperforms other schemes in dense networks with a small number of channels. We implement our protocol, called the Tree-based, Multichannel Protocol (TMCP), in a real testbed. To adjust to networks with link quality heterogeneity, an extension of TMCP is also proposed. Through both simulation and real experiments, we show that TMCP can significantly improve network throughput and reduce packet losses. More important, evaluation results show that TMCP better accommodates multichannel realities found in WSNs than other multichannel protocols.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Sharma:2016:NOD, author = "Gokarna Sharma and Costas Busch", title = "Near-Optimal Deterministic {Steiner} Tree Maintenance in Sensor Networks", journal = j-TOSN, volume = "12", number = "1", pages = "4:1--4:??", month = mar, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2854155", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:25 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider the group-communication maintenance problem between a set of k mobile agents that are tracked by a static sensor network. We develop a scalable deterministic distributed algorithm for maintaining a Steiner tree of the agents so that group communication between them can be provided with the minimum total cost possible. The main idea is that our algorithm maintains a virtual tree of mobile agents that can be immediately converted to an actual Steiner tree at all times. Our algorithm achieves the Steiner tree with total length at most O (log k ) times the length of the optimal Steiner tree in the constant-doubling graph model. The total communication cost (the number of messages) to maintain the Steiner tree is only O ({minlog n, log D }) times the optimal communication cost, where n and D, respectively, are the number of nodes and the diameter of the constant-doubling network. We also develop improved algorithms for the mobile k -center, sparse-aggregation, and distributed-matching problems. Experimental evaluation results show the benefits of our algorithms compared to previous algorithms. These four problems are NP-hard and, to the best of our knowledge, our algorithms are the first near-optimal deterministic algorithms for maintaining approximate solutions to these important network problems with low maintenance costs in a distributed setting.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Voulgaris:2016:DNL, author = "Spyros Voulgaris and Matthew Dobson and Maarten {Van Steen}", title = "Decentralized Network-Level Synchronization in Mobile Ad Hoc Networks", journal = j-TOSN, volume = "12", number = "1", pages = "5:1--5:??", month = mar, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2880223", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:25 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Energy is the scarcest resource in ad hoc wireless networks, particularly in wireless sensor networks requiring a long lifetime. Intermittently switching the radio on and off is widely adopted as the most effective way to keep energy consumption low. This, however, prevents the very goal of communication, unless nodes switch their radios on at synchronized intervals-a rather nontrivial coordination task. In this article, we address the problem of synchronizing node radios to a single universal schedule in wireless mobile ad hoc networks that can potentially consist of thousands of nodes. More specifically, we are interested in operating the network with duty cycles that can be less than 1\% of the total cycle time. We identify the fundamental issues that govern cluster merging and provide a detailed comparison of various policies using extensive simulations based on a variety of mobility patterns. We propose a specific scheme that allows a 4,000-node network to stay synchronized with a duty cycle of approximately 0.7\%. Our work is based on an existing, experimental MAC protocol that we use for real-world applications and is validated in a real network of around 120 mobile nodes.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Lin:2016:AAT, author = "Shan Lin and Fei Miao and Jingbin Zhang and Gang Zhou and Lin Gu and Tian He and John A. Stankovic and Sang Son and George J. Pappas", title = "{ATPC}: Adaptive Transmission Power Control for Wireless Sensor Networks", journal = j-TOSN, volume = "12", number = "1", pages = "6:1--6:??", month = mar, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2746342", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:25 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Extensive empirical studies presented in this article confirm that the quality of radio communication between low-power sensor devices varies significantly with time and environment. This phenomenon indicates that the previous topology control solutions, which use static transmission power, transmission range, and link quality, might not be effective in the physical world. To address this issue, online transmission power control that adapts to external changes is necessary. This article presents ATPC, a lightweight algorithm for Adaptive Transmission Power Control in wireless sensor networks. In ATPC, each node builds a model for each of its neighbors, describing the correlation between transmission power and link quality. With this model, we employ a feedback-based transmission power control algorithm to dynamically maintain individual link quality over time. The intellectual contribution of this work lies in a novel pairwise transmission power control, which is significantly different from existing node-level or network-level power control methods. Also different from most existing simulation work, the ATPC design is guided by extensive field experiments of link quality dynamics at various locations over a long period of time. The results from the real-world experiments demonstrate that (1) with pairwise adjustment, ATPC achieves more energy savings with a finer tuning capability, and (2) with online control, ATPC is robust even with environmental changes over time.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Dressler:2016:MBW, author = "Falko Dressler and Margit Mutschlechner and Bijun Li and R{\"u}diger Kapitza and Simon Ripperger and Christopher Eibel and Benedict Herzog and Timo H{\"o}nig and Wolfgang Schr{\"o}der-Preikschat", title = "Monitoring Bats in the Wild: On Using Erasure Codes for Energy-Efficient Wireless Sensor Networks", journal = j-TOSN, volume = "12", number = "1", pages = "7:1--7:??", month = mar, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2875426", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:25 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We explore the advantages of using Erasure Codes (ECs) in a very challenging sensor networking scenario, namely, monitoring and tracking bats in the wild. The mobile bat nodes collect contact information that needs to be transmitted to stationary base stations whenever they are in communication range. We are particularly interested in improving the overall communication reliability of the wireless communication. The mobile nodes are capable of storing a few 100kB of data and to exchange contact information in aggregated form. Due to the continuous flight of the bats and the forest environment, the wireless channel quality varies quickly and, thus, the communication is in general assumed to be highly unreliable. Given the very strict energy constraints of the mobile node and the inherently asymmetric channels, conventional techniques such as full data replication or Automatic Repeat Request to improve the communication reliability are prohibitive. In this work, we investigate the tradeoff between reliability achieved and the cost in form of additional transmissions, that is, the additional energy costs. Our energy measurements on a real platform combined with larger-scale simulation of the wireless communication clearly indicate the advantages of using ECs in our scenario. The results are also applicable in other configurations when unreliable communication channels meet tight energy budgets.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Midi:2016:NLF, author = "Daniele Midi and Elisa Bertino", title = "Node or Link? {Fine}-Grained Analysis of Packet-Loss Attacks in Wireless Sensor Networks", journal = j-TOSN, volume = "12", number = "2", pages = "8:1--8:??", month = may, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2886103", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:26 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In wireless sensor networks, packet losses are often an indicator of possible undergoing attacks. Therefore, security solutions aiming at providing comprehensive protection must include functions for packet-loss detection. Determining the actual cause of these losses is crucial to a quick and automated reaction to the attack, be it a simple reporting of the attack or a more sophisticated action such as packet rerouting and retransmission. Packet losses in wireless sensor networks can be caused by either attacks affecting the nodes or attacks focused on the wireless links. The efficacy of the response to such attacks is highly dependent on an accurate identification of the actual attack cause. Therefore, approaches to correctly identifying the cause of packet losses are needed. The work presented in this article addresses this problem by designing and implementing a fine-grained analysis (FGA) tool that investigates packet-loss events and reports their most likely cause. Our FGA tool profiles the wireless links between the nodes, as well as their neighborhood, by leveraging resident parameters, such as RSSI and LQI, available within every received packet. The design of the system is fully distributed and event-driven, and its low overhead makes it suitable for resource-constrained entities such as wireless motes. We have validated our approach through real-world experiments, showing that our FGA tool is effective in differentiating between the various attacks that may affect nodes and links.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Anagnostopoulos:2016:ADD, author = "Christos Anagnostopoulos and Stathes Hadjiefthymiades and Kostas Kolomvatsos", title = "Accurate, Dynamic, and Distributed Localization of Phenomena for Mobile Sensor Networks", journal = j-TOSN, volume = "12", number = "2", pages = "9:1--9:??", month = may, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2882966", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:26 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present a robust, dynamic scheme for the automatic self-deployment and relocation of mobile sensor nodes (e.g., unmanned ground vehicles, robots) around areas where phenomena take place. Our scheme aims (i) to sense environmental contextual parameters and accurately capture the spatiotemporal evolution of a certain phenomenon (e.g., fire, air contamination) and (ii) to fully automate the deployment process by letting nodes relocate, self-organize (and self-reorganize), and optimally cover the focus area. Our intention is to ``opportunistically'' modify the previous placement of nodes to attain high-quality phenomenon monitoring. The required intelligence is fully distributed within the mobile sensor network so the deployment algorithm is executed incrementally by different nodes. The presented algorithm adopts the Particle Swarm Optimization technique, which yields very promising results as reported in the article (performance assessment). Our findings show that the proposed algorithm captures a certain phenomenon with very high accuracy while maintaining the networkwide energy expenditure at low levels. Random occurrences of similar phenomena put stress upon the algorithm which manages to react promptly and efficiently manage the available sensing resources in the broader setting.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Doudou:2016:GTF, author = "Messaoud Doudou and Jose M. Barcelo-Ordinas and Djamel Djenouri and Jorge Garcia-Vidal and Abdelmadjid Bouabdallah and Nadjib Badache", title = "Game Theory Framework for {MAC} Parameter Optimization in Energy-Delay Constrained Sensor Networks", journal = j-TOSN, volume = "12", number = "2", pages = "10:1--10:??", month = may, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2883615", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:26 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Optimizing energy consumption and end-to-end (e2e) packet delay in energy-constrained, delay-sensitive wireless sensor networks is a conflicting multiobjective optimization problem. We investigate the problem from a game theory perspective, where the two optimization objectives are considered as game players. The cost model of each player is mapped through a generalized optimization framework onto protocol-specific MAC parameters. From the optimization framework, a game is first defined by the Nash bargaining solution (NBS) to assure energy consumption and e2e delay balancing. Secondy, the Kalai-Smorodinsky bargaining solution (KSBS) is used to find an equal proportion of gain between players. Both methods offer a bargaining solution to the duty-cycle MAC protocol under different axioms. As a result, given the two performance requirements (i.e., the maximum latency tolerated by the application and the initial energy budget of nodes), the proposed framework allows to set tunable system parameters to reach a fair equilibrium point that dually minimizes the system latency and energy consumption. For illustration, this formulation is applied to six state-of-the-art wireless sensor network (WSN) MAC protocols: B-MAC, X-MAC, RI-MAC, SMAC, DMAC, and LMAC. The article shows the effectiveness and scalability of such a framework in optimizing protocol parameters that achieve a fair energy-delay performance trade-off under the application requirements.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kulau:2016:IRU, author = "Ulf Kulau and Felix B{\"u}sching and Lars Wolf", title = "{IdealVolting}: Reliable Undervolting on Wireless Sensor Nodes", journal = j-TOSN, volume = "12", number = "2", pages = "11:1--11:??", month = may, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2885500", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:26 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The energy consumption of Wireless Sensor Networks (WSNs) correlates with the voltage level at which the nodes are powered-a lowered voltage leads to a prolonged lifetime of nodes and networks. Operating nodes at voltage levels below the recommendation-so-called undervolting-saves energy but is accompanied by an increased risk of failures. In this article, we show that a WSN can still work reliably, even if the voltage recommendations are violated. We show that there is a correlation between temperature and error-proneness at the same voltage level and that ideal voltage levels depend on environmental conditions. Especially in outdoor deployments, temperatures fluctuate often and heavily. Additionally, we show that these ideal voltage levels are different for each individual node. To deal with these individual variations and varying temperatures, we present a supervised learning strategy that is able to keep the nodes in uncritical states even if environmental conditions are constantly and heavily changing while saving as much energy as possible by constantly adapting the voltage level of these nodes to an individually ideal level. All measurements were performed on sensor node prototypes that are also presented in this article. In detailed evaluations, it is shown (i) that a single node will never run in the same unsafe state twice, (ii) that only five known bias points are needed to predict nearly all temperature dependencies for an individual node, and, thus, (iii) that a system of undervolted nodes can be as reliable as a conventionally powered network while prolonging the lifetime by more than 40\%.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Xu:2016:EET, author = "Miao Xu and Wenyuan Xu and Tingrui Han and Zhiyun Lin", title = "Energy-Efficient Time Synchronization in Wireless Sensor Networks via Temperature-Aware Compensation", journal = j-TOSN, volume = "12", number = "2", pages = "12:1--12:??", month = may, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2876508", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:26 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Time synchronization is critical for wireless sensor networks (WSNs) because data fusion and duty cycling schemes all rely on synchronized schedules. Traditional synchronization protocols assume that wireless channels are available around the clock. However, this assumption is not true for WSNs deployed in intertidal zones. In this article, we present TACO, a synchronization scheme for WSNs with intermittent wireless channels and volatile environmental temperatures. TACO estimates the correlation of clock skews and temperatures by solving a constrained least squares problem and continuously adjusts the local time with the predicted clock skews according to temperatures. Our experiment conducted in an intertidal zone shows that TACO can greatly reduce the clock drift and prolong the resynchronization intervals.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Restuccia:2016:IMP, author = "Francesco Restuccia and Sajal K. Das and Jamie Payton", title = "Incentive Mechanisms for Participatory Sensing: Survey and Research Challenges", journal = j-TOSN, volume = "12", number = "2", pages = "13:1--13:??", month = may, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2888398", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:26 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Participatory sensing is a powerful paradigm that takes advantage of smartphones to collect and analyze data beyond the scale of what was previously possible. Given that participatory sensing systems rely completely on the users' willingness to submit up-to-date and accurate information, it is paramount to effectively incentivize users' active and reliable participation. In this article, we survey existing literature on incentive mechanisms for participatory sensing systems. In particular, we present a taxonomy of existing incentive mechanisms for participatory sensing systems, which are subsequently discussed in depth by comparing and contrasting different approaches. Finally, we discuss an agenda of open research challenges in incentivizing users in participatory sensing.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liang:2016:MLS, author = "Weifa Liang and Wenzheng Xu and Xiaojiang Ren and Xiaohua Jia and Xiaola Lin", title = "Maintaining Large-Scale Rechargeable Sensor Networks Perpetually via Multiple Mobile Charging Vehicles", journal = j-TOSN, volume = "12", number = "2", pages = "14:1--14:??", month = may, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2898357", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:26 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless energy transfer technology based on magnetic resonant coupling has been emerging as a promising technology for wireless sensor networks (WSNs) by providing controllable yet perpetual energy to sensors. In this article, we study the deployment of the minimum number of mobile charging vehicles to charge sensors in a large-scale WSN so that none of the sensors will run out of energy, for which we first advocate a flexible on-demand charging paradigm that decouples sensor energy charging scheduling from the design of sensing data routing protocols. We then formulate a novel optimization problem of scheduling mobile charging vehicles to charge life-critical sensors in the network with an objective to minimize the number of mobile charging vehicles deployed, subject to the energy capacity constraint on each mobile charging vehicle. As the problem is NP-hard, we instead propose an approximation algorithm with a provable performance guarantee if the energy consumption of each sensor during each charging tour is negligible. Otherwise, we devise a heuristic algorithm by modifying the proposed approximation algorithm. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are very promising, and the solutions obtained are fractional of the optimal ones. To the best of our knowledge, this is the first approximation algorithm with a nontrivial approximation ratio for a novel scheduling problem of multiple mobile charging vehicles for charging sensors.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wu:2016:RFM, author = "Fang-Jing Wu and Hsiu-Chi Hsu and Chien-Chung Shen and Yu-Chee Tseng", title = "Range-Free Mobile Actor Relocation in a Two-Tiered Wireless Sensor and Actor Network", journal = j-TOSN, volume = "12", number = "2", pages = "15:1--15:??", month = may, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2903145", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:26 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Two-tiered wireless sensor and actor networks (WSANs) have been proposed to enhance network capabilities, where a set of resource-rich mobile nodes (termed actors ) form a connected backbone to relay sensing data from static sensors to the sink and sometimes are requested by sensors to perform a particular action. Such a two-tiered WSAN facilitates scalability and can efficiently reduce the energy consumption incurred by conventional hop-by-hop relaying via only sensors. However, relocating actors to achieve both connectivity and load balance is a challenge, especially when there is no location information of the nodes. Connectivity ensures that the actors are connected, whereas load balance ensures that actors collect and originate a similar amount of sensory data from the sensors. In this article, we formulate the Connected and Balanced Mobile Actor Relocation (CBMAR) optimization problem to address both connectivity and load balance and prove that the problem is NP-hard. We thus propose a dual-mode distributed actor relocation protocol that does not rely on any location information of nodes to relocate actors. The idea is to locally form virtual Voronoi cells of actors (termed covering cells ) based on the lower-tiered topology, where each actor locally recruits its own sensor members to form its own covering cell. By maintaining the covering cell, each actor locally relocates itself toward a sensor along the lower-tiered topology. Extensive simulation results show that the protocol can achieve both objectives of connectivity and load balance with low moving and communication overheads.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Moran:2016:BMS, author = "Bill Moran and Fred Cohen and Zengfu Wang and Sofia Suvorova and Douglas Cochran and Tom Taylor and Peter Farrell and Stephen Howard", title = "Bounds on Multiple Sensor Fusion", journal = j-TOSN, volume = "12", number = "2", pages = "16:1--16:??", month = may, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2903722", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jun 20 06:55:26 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider the problem of fusing measurements in a sensor network, where the sensing regions overlap and data are nonnegative real numbers, possibly resulting from a count of indistinguishable discrete entities. Because of overlaps, it is generally impossible to fuse this information to arrive at an accurate value of the overall amount or count of material present in the union of the sensing regions. Here we study the computation of the range of overall values consistent with the data and provide several results. Posed as a linear programming problem, this leads to questions associated with the geometry of the sensor regions, specifically the arrangement of their nonempty intersections. We define a computational tool called the fusion polytope, based on the geometry of the sensing regions. Its properties are explored, and in particular, a topological necessary and sufficient condition for this to be in the positive orthant, a property that considerably simplifies calculations, is provided. We show that in two dimensions, inflated tiling schemes based on rectangular regions fail to satisfy this condition, whereas inflated tiling schemes based on hexagons do.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Choi:2016:DIM, author = "Woohyeok Choi and Jeungmin Oh and Taiwoo Park and Seongjun Kang and Miri Moon and Uichin Lee and Inseok Hwang and Darren Edge and Junehwa Song", title = "Designing Interactive Multiswimmer Exergames: a Case Study", journal = j-TOSN, volume = "12", number = "3", pages = "17:1--17:??", month = aug, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2888399", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 29 16:37:29 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The unique aquatic nature of swimming makes it difficult to use social or technical strategies to mitigate the tediousness of monotonous exercises. In this study, we propose the use of a smartphone-based multiplayer exergame named MobyDick. MobyDick is designed to be played while swimming, where a team of swimmers collaborate to hunt down a virtual monster. To this end, we take into account both human factors and technical challenges under swimming contexts. First, we perform a comparative analysis of a variety of wireless networking technologies in the aquatic environment and identify various technical constraints on wireless networking. Second, we develop a swimming activity recognition system to enable precise and real-time game inputs. Third, we devise a multiplayer game design by employing the unique interaction mode viable in an underwater environment, where the abilities of human communication are highly limited. Finally, we prototype MobyDick on waterproof off-the-shelf Android phones, and we deploy it in real swimming pool environments ( n = 8). Our qualitative analysis of user interview data reveals certain unique aspects of multiplayer swimming games.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhang:2016:CSL, author = "Desheng Zhang and Tian He and Fan Zhang and Mingming Lu and Yunhuai Liu and Haengju Lee and Sang H. Son", title = "Carpooling Service for Large-Scale Taxicab Networks", journal = j-TOSN, volume = "12", number = "3", pages = "18:1--18:??", month = aug, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2897517", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 29 16:37:29 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Carpooling has long held the promise of reducing gas consumption by decreasing mileage to deliver coriders. Although ad hoc carpools already exist in the real world through private arrangements, little research on the topic has been done. In this article, we present the first systematic work to design, implement, and evaluate a carpool service, called coRide, in a large-scale taxicab network intended to reduce total mileage for less gas consumption. Our coRide system consists of three components, a dispatching cloud server, passenger clients, and an onboard customized device, called TaxiBox. In the coRide design, in response to the delivery requests of passengers, dispatching cloud servers calculate cost-efficient carpool routes for taxicab drivers and thus lower fares for the individual passengers. To improve coRide 's efficiency in mileage reduction, we formulate an NP-hard route calculation problem under different practical constraints. We then provide (1) an optimal algorithm using Linear Programming, (2) a 2-approximation algorithm with a polynomial complexity, and (3) its corresponding online version with a linear complexity. To encourage coRide 's adoption, we present a win-win fare model as the incentive mechanism for passengers and drivers to participate. We test the performance of coRide by a comprehensive evaluation with a real-world trial implementation and a data-driven simulation with 14,000 taxi data from the Chinese city Shenzhen. The results show that compared with the ground truth, our service can reduce 33\% of total mileage; with our win-win fare model, we can lower passenger fares by 49\% and simultaneously increase driver profit by 76\%.", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Jhumka:2016:NVC, author = "Arshad Jhumka and Luca Mottola", title = "Neighborhood View Consistency in Wireless Sensor Networks", journal = j-TOSN, volume = "12", number = "3", pages = "19:1--19:??", month = aug, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2901296", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 29 16:37:29 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks (WSNs) are characterized by localized interactions, that is, protocols are often based on message exchanges within a node's direct radio range. We recognize that for these protocols to work effectively, nodes must have consistent information about their shared neighborhoods. Different types of faults, however, can affect this information, severely impacting a protocol's performance. We factor this problem out of existing WSN protocols and argue that a notion of neighborhood view consistency (NVC) can be embedded within existing designs to improve their performance. To this end, we study the problem from both a theoretical and a system perspective. We prove that the problem cannot be solved in an asynchronous system using any of Chandra and Toueg's failure detectors. Because of this, we introduce a new software device called pseudocrash failure detector (PCD), study its properties, and identify necessary and sufficient conditions for solving NVC with PCDs. We prove that, in the presence of transient faults, NVC is impossible to solve with any PCDs, thus define two weaker specifications of the problem. We develop a global algorithm that satisfies both specifications in the presence of unidirectional links, and a localized algorithm that solves the weakest specification in networks of bidirectional links. We implement the latter atop two different WSN operating systems, integrate our implementations with four different WSN protocols, and run extensive micro-benchmarks and full-stack experiments on a real 90-node WSN testbed. Our results show that the performance significantly improves for NVC-equipped protocols; for example, the Collection Tree Protocol (CTP) halves energy consumption with higher data delivery.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Minakov:2016:CSR, author = "Ivan Minakov and Roberto Passerone and Alessandra Rizzardi and Sabrina Sicari", title = "A Comparative Study of Recent Wireless Sensor Network Simulators", journal = j-TOSN, volume = "12", number = "3", pages = "20:1--20:??", month = aug, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2903144", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 29 16:37:29 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Over recent years, the continuous interest in wireless sensor networks (WSNs) has led to the appearance of new modeling methods and simulation environments for WSN applications. A broad variety of different simulation tools have been designed to explore and validate WSN systems before actual implementation and real-world deployment. These tools address different design aspects and offer various simulation abstractions to represent and model real-world behavior. In this article, we present a comprehensive comparative study of mainstream open-source simulation tools for WSNs. Two benchmark applications are designed to evaluate the frameworks with respect to the simulation runtime performance, network throughput, communication medium modeling, packet reception rate, network latency, and power consumption estimation accuracy. Such metrics are also evaluated against measurements on physical prototypes. Our experiments show that the tools produce equivalent results from a functional point of view and capacity to model communication phenomena, while the ability to model details of the execution platform significantly impacts the runtime simulation performance and the power estimation accuracy. The benchmark applications are also made available in the public domain for further studies.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Rathore:2016:CAS, author = "Heena Rathore and Venkataramana Badarla and Supratim Shit", title = "Consensus-Aware Sociopsychological Trust Model for Wireless Sensor Networks", journal = j-TOSN, volume = "12", number = "3", pages = "21:1--21:??", month = aug, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2903721", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 29 16:37:29 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Security plays a vital role in Wireless Sensor Networks (WSN) for providing reliability to the network. In WSN, where nodes, in addition to having their inbuilt capability of sensing, processing, and communicating data, also possess certain risks. These risks expose them to attacks and bring in many security challenges. Many researchers are engaged in developing innovative design paradigms to address security issues by developing trust management systems. In WSN, trust is important for the establishment of cooperation among the sensor nodes. The article presents a sociopsychological model for detecting fraudulent nodes in WSN. The three factors, viz. ability, benevolence, and integrity, are used for the computation of trust. Furthermore, the article provides a novel consensus-aware sociopsychological approach to deal even in the presence of higher number of fraudulent nodes than benevolent nodes. The proposed work has been implemented in the LabVIEW platform and extensive simulations were carried out to study its performance. Additionally, it is experimentally evaluated on a testbed of size 16 nodes to obtain results that demonstrate the accuracy and robustness of the proposed model.", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2016:CBS, author = "Chen Wang and Hongbo Jiang and Yan Dong", title = "Connectivity-Based Space Filling Curve Construction Algorithms in High Genus {$3$D} Surface {WSNs}", journal = j-TOSN, volume = "12", number = "3", pages = "22:1--22:??", month = aug, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2907947", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 29 16:37:29 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Many applications in wireless sensor networks (WSNs) require that sensor observations in a given monitoring area are aggregated in a serial fashion. This demands a routing path to be constructed traversing all sensors in that area, which is also needed to linearize the network. In this article, we present SURF, a Space filling cURve construction scheme for high genus three-dimensional (3D) surFace WSNs, yielding a traversal path provably aperiodic (that is, any node is covered at most a constant number of times). SURF first utilizes the hop-count distance function to construct the iso-contour in discrete settings, and then it uses the concept of the Reeb graph and the maximum cut set to divide the network into different regions. Finally, it conducts a novel serial traversal scheme, enabling the traversal within and between regions. To the best of our knowledge, SURF is the first high genus 3D surface WSN targeted and pure connectivity-based solution for linearizing the networks. It is fully distributed and highly scalable, requiring a nearly constant storage and communication cost per node in the network. To incorporate adaptive density of the constructed space filling curve, we also design a second algorithm, called SURF$^+$, which makes use of parameterized spiral-like curves to cover the 3D surface and thus can yield a multiresolution SFC adapting to different requirements on travel budget or fusion delay. The application combining both algorithms for in-network data storage and retrieval in high genus 3D surface WSNs is also presented. Extensive simulations on several representative networks demonstrate that both algorithms work well on high genus 3D surface WSNs.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Hossain:2016:NDM, author = "A. K. M. Mahtab Hossain and Cormac J. Sreenan and Rodolfo {De Paz Alberola}", title = "Neighbour-Disjoint Multipath for Low-Power and Lossy Networks", journal = j-TOSN, volume = "12", number = "3", pages = "23:1--23:??", month = aug, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2914792", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 29 16:37:29 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we describe a neighbour disjoint multipath (NDM) scheme that is shown to be more resilient amidst node or link failures compared to the two well-known node disjoint and edge disjoint multipath techniques. A centralised NDM was first conceptualised in our initial published work utilising the spatial diversity among multiple paths to ensure robustness against localised poor channel quality or node failures. Here, we further introduce a distributed version of our NDM algorithm adapting to the low-power and lossy network (LLN) characteristics. We implement our distributed NDM algorithm in Contiki OS on top of LOADng-a lightweight On-demand Ad hoc Distance Vector Routing protocol. We compare this implementation's performance with a standard IPv6 Routing Protocol for Low power and Lossy Networks (RPL), and also with basic LOADng, running in the Cooja simulator. Standard performance metrics such as packet delivery ratio, end-to-end latency, overhead and average routing table size are identified for the comparison. The results and observations are provided considering a few different application traffic patterns, which serve to quantify the improvements in robustness arising from NDM. The results are confirmed by experiments using a public sensor network testbed with over 100 nodes.", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bhatti:2016:EHW, author = "Naveed Anwar Bhatti and Muhammad Hamad Alizai and Affan A. Syed and Luca Mottola", title = "Energy Harvesting and Wireless Transfer in Sensor Network Applications: Concepts and Experiences", journal = j-TOSN, volume = "12", number = "3", pages = "24:1--24:??", month = aug, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2915918", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 29 16:37:29 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Advances in micro-electronics and miniaturized mechanical systems are redefining the scope and extent of the energy constraints found in battery-operated wireless sensor networks (WSNs). On one hand, ambient energy harvesting may prolong the systems' lifetime or possibly enable perpetual operation. On the other hand, wireless energy transfer allows systems to decouple the energy sources from the sensing locations, enabling deployments previously unfeasible. As a result of applying these technologies to WSNs, the assumption of a finite energy budget is replaced with that of potentially infinite, yet intermittent, energy supply, profoundly impacting the design, implementation, and operation of WSNs. This article discusses these aspects by surveying paradigmatic examples of existing solutions in both fields and by reporting on real-world experiences found in the literature. The discussion is instrumental in providing a foundation for selecting the most appropriate energy harvesting or wireless transfer technology based on the application at hand. We conclude by outlining research directions originating from the fundamental change of perspective that energy harvesting and wireless transfer bring about.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2016:EEA, author = "Yu Wang and Rui Tan and Guoliang Xing and Jianxun Wang and Xiaobo Tan and Xiaoming Liu", title = "Energy-Efficient Aquatic Environment Monitoring Using {Smartphone}-Based Robots", journal = j-TOSN, volume = "12", number = "3", pages = "25:1--25:??", month = aug, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2932190", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Aug 29 16:37:29 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Monitoring aquatic environment is of great interest to the ecosystem, marine life, and human health. This article presents the design and implementation of Samba-an aquatic surveillance robot that integrates an off-the-shelf Android smartphone and a robotic fish to monitor harmful aquatic processes such as oil spills and harmful algal blooms. Using the built-in camera of the smartphone, Samba can detect spatially dispersed aquatic processes in dynamic and complex environment. To reduce the excessive false alarms caused by the nonwater area (e.g., trees on the shore), Samba segments the captured images and performs target detection in the identified water area only. However, a major challenge in the design of Samba is the high energy consumption resulted from continuous image segmentation. We propose a novel approach that leverages the power-efficient inertial sensors on smartphones to assist image processing. In particular, based on the learned mapping models between inertial and visual features, Samba uses real-time inertial sensor readings to estimate the visual features that guide image segmentation, significantly reducing the energy consumption and computation overhead. Samba also features a set of lightweight and robust computer vision algorithms, which detect harmful aquatic processes based on their distinctive color features. Last, Samba employs a feedback-based rotation control algorithm to adapt to spatiotemporal development of the target aquatic process. We have implemented a Samba prototype and evaluated it through extensive field experiments, lab experiments, and trace-driven simulations. The results show that Samba can achieve a 94\% detection rate, a 5\% false alarm rate, and a lifetime up to nearly 2 months.", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Dong:2016:SOC, author = "Jie Dong and David B. Smith and Leif W. Hanlen", title = "Socially Optimal Coexistence of Wireless Body Area Networks Enabled by a Non-Cooperative Game", journal = j-TOSN, volume = "12", number = "4", pages = "26:1--26:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2932191", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we enable the coexistence of multiple wireless body area networks (BANs) using a finite repeated non-cooperative game for transmit power control. With no coordination amongst these personal sensor networks, the proposed game maximizes each network's packet delivery ratio (PDR) at low transmit power. In this context, we provide a novel utility function, which gives reduced benefit to players with higher transmission power, and a subsequent reduction in radio interference to other coexisting BANs. Considering the purpose of inter-BAN interference mitigation, PDR is expressed as a compressed exponential function of inverse signal-to-interference-and-noise ratio, so it is essentially a function of transmit powers of all coexisting BANs. It is shown that a unique Nash Equilibrium (NE) exists, and hence there is a subgame-perfect equilibrium, considering best response at each stage independent of history. In addition, the NE is conjectured to be the socially optimal solution according to all possible action profiles. Realistic and extensive on- and inter-body channel models are employed. Results confirm the effectiveness of the proposed scheme in better interference management, greater reliability, and reduced transmit power when compared with other schemes that can be applied in BANs.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Perazzo:2016:SPW, author = "Pericle Perazzo and Lorenzo Taponecco and Antonio A. D'amico and Gianluca Dini", title = "Secure Positioning in Wireless Sensor Networks through Enlargement Miscontrol Detection", journal = j-TOSN, volume = "12", number = "4", pages = "27:1--27:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2943782", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks enable a wealth of new applications in areas such as military, medical, environmental, transportation, smart city, and so on. In many of these scenarios, we need to measure in a secure way the positions of the sensors. Existing range-based techniques for secure positioning require a burdensome infrastructure, with many fixed anchors. Reducing the infrastructure would reduce deployment cost and foster the adoption of secure positioning solutions in wireless sensor networks. In this article, we propose SPEM, a secure positioning system based on multilateration and ultra-wideband (UWB) distance bounding protocols. The key idea behind SPEM is to leverage the low probability that an adversary has of controlling enlargement attacks against UWB. We estimate such a probability by a thorough study and signal-level simulations of the UWB physical layer. We test SPEM both in a simulated environment and in a real indoor environment using real UWB transceivers. We show that SPEM needs far less infrastructure than state-of-the-art solutions ( --- 22\% to --- 93\%, depending on the anchor deployment method), while achieving high levels of security against smart and determined adversaries.", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Xie:2016:LLI, author = "Bo Xie and Kongyang Chen and Guang Tan and Mingming Lu and Yunhuai Liu and Jie Wu and Tian He", title = "{LIPS}: a Light Intensity-Based Positioning System for Indoor Environments", journal = j-TOSN, volume = "12", number = "4", pages = "28:1--28:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2953880", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article presents a Light Intensity--based Positioning System (LIPS) for indoor environments. The system uses off-the-shelf light-emitting diode lamps as signal sources and light sensors as signal receivers. The design is inspired by the observation that a light sensor has deterministic sensitivity to both the distance and incident angle of a light signal, an under-utilized feature of photodiodes now widely found on mobile devices. We develop a stable and accurate light intensity model to capture the phenomenon, based on which a new positioning principle, Multi-Face Light Positioning, is established that uses three collocated sensors to uniquely determine the receiver's position, assuming merely a single source of light. We have implemented a prototype on both dedicated embedded systems and smartphones. Experimental results show average positioning accuracy within 0.4m across different environments, with high stability against interferences from obstacles, ambient lights, temperature variation, and so on.", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhao:2016:CCA, author = "Yawei Zhao and Deke Guo and Jia Xu and Pin Lv and Tao Chen and Jianping Yin", title = "{CATS}: Cooperative Allocation of Tasks and Scheduling of Sampling Intervals for Maximizing Data Sharing in {WSNs}", journal = j-TOSN, volume = "12", number = "4", pages = "29:1--29:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2955102", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Data sharing among multiple sampling tasks significantly reduces energy consumption and communication cost in low-power wireless sensor networks (WSNs). Conventional proposals have already scheduled the discrete point sampling tasks to decrease the amount of sampled data. However, less effort has been expended for applications that generate continuous interval sampling tasks. Moreover, most pioneering work limits its view to schedule sampling intervals of tasks on a single sensor node and neglects the process of task allocation in WSNs. Therefore, the gained efforts in prior work cannot benefit a large-scale WSN because the performance of a scheduling method is sensitive to the strategy of task allocation. Broadening the scope to an entire network, this article is the first work to maximize data sharing among continuous interval sampling tasks by jointly optimizing task allocation and scheduling of sampling intervals in WSNs. First, we formalize the joint optimization problem and prove it NP-hard. Second, we present the COMBINE operation, which is the crucial ingredient of our solution. COMBINE is a 2-factor approximate algorithm for maximizing data sharing among overlapping tasks. Furthermore, our heuristic named CATS is proposed. CATS is 2-factor approximate algorithm for jointly allocating tasks and scheduling sampling intervals so as to maximize data sharing in the entire network. Extensive empirical study is conducted on a testbed of 50 sensor nodes to evaluate the effectiveness of our methods. In addition, the scalability of our methods is verified by utilizing TOSSIM, a widely used simulation tool. The experimental results indicate that our methods successfully reduce the volume of sampled data and decrease energy consumption significantly.", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2016:BTD, author = "Chen Wang and Wei Wei and Hongzhi Lin and Hongbo Jiang and John C. S. Lui", title = "{BLOW--UP}: Toward Distributed and Scalable Space Filling Curve Construction in {$3$D} Volumetric {WSNs}", journal = j-TOSN, volume = "12", number = "4", pages = "30:1--30:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2956551", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In wireless sensor networks (WSNs), a space filling curve (SFC) refers to a path passing through all nodes in the network, with each node visited at least once. By enforcing a linear order of the sensor nodes through an SFC, many applications in WSNs concerning serial operations on both sensor nodes and sensor data can be performed, with examples including serial data fusion and path planning of mobile nodes. Although a few studies have made efforts to find such SFCs in WSNs, they primarily target 2D planar or 3D surface settings and cannot be directly applied to 3D volumetric WSNs due to considerably more complex geometric features and topology shapes that the 3D volumetric settings introduce. This article presents BLOW-UP, a distributed, scalable, and connectivity-based algorithm to construct an SFC for a 3D volumetric WSN (or alternatively to linearize the 3D volumetric network). The main idea of BLOW-UP is to decompose the given 3D volumetric network into a series of connected and closed layers, and the nodes are traversed layer by layer, incrementally from the innermost to the outermost, yielding an SFC covering the entire network, provably at least once and at most a constant number of times. To the best of our knowledge, BLOW-UP is the first algorithm that realizes linearization in 3D volumetric WSNs. It does not require advance knowledge of location or distance information. It is also scalable with a nearly constant per-node storage cost and message cost. Extensive simulations under various networks demonstrate its effectiveness on nodes' covered times, coverage rate, and covering speed.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2016:FTM, author = "Tian Wang and Zhen Peng and Junbin Liang and Sheng Wen and Md Zakirul Alam Bhuiyan and Yiqiao Cai and Jiannong Cao", title = "Following Targets for Mobile Tracking in Wireless Sensor Networks", journal = j-TOSN, volume = "12", number = "4", pages = "31:1--31:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2968450", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Traditional tracking solutions in wireless sensor networks based on fixed sensors have several critical problems. First, due to the mobility of targets, a lot of sensors have to keep being active to track targets in all potential directions, which causes excessive energy consumption. Second, when there are holes in the deployment area, targets may fail to be detected when moving into holes. Third, when targets stay at certain positions for a long time, sensors surrounding them have to suffer heavier work pressure than do others, which leads to a bottleneck for the entire network. To solve these problems, a few mobile sensors are introduced to follow targets directly for tracking because the energy capacity of mobile sensors is less constrained and they can detect targets closely with high tracking quality. Based on a realistic detection model, a solution of scheduling mobile sensors and fixed sensors for target tracking is proposed. Moreover, the movement path of mobile sensors has a provable performance bound compared to the optimal solution. Results of extensive simulations show that mobile sensors can improve tracking quality even if holes exist in the area and can reduce energy consumption of sensors effectively.", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Dong:2016:THR, author = "Jie Dong and Yu Ge and David B. Smith", title = "Two-Hop Relay-Assisted Cooperative Communication in Wireless Body Area Networks: an Empirical Study", journal = j-TOSN, volume = "12", number = "4", pages = "32:1--32:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2979679", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The pervasive use of wireless body area networks (BANs) has incurred potential inter-BAN interference, which can cause severe performance degradation. In this article, the coexistence of BANs is experimentally performed. A relay-assisted cooperative communications scheme is implemented in a real IEEE 802.15.4-based BAN system with a beacon-enabled mode and guaranteed time slot (GTS) scheduling. As far as we know, it is the first experimental work that enables real-time investigation of the effectiveness of cooperative communications in BANs for co-channel radio interference mitigation. First- and second-order statistics, including outage probability, level crossing rate (LCR), and average fade/nonfade duration, are calculated from the measured effective channel gains of the device-to-coordinator links across all superframes. Empirical results demonstrate significant advantages of using two-hop relay-assisted communications over traditional star topology BAN. Advantages include a maximum of a 10dB increase in channel gain threshold at an outage probability of 10\%, which corresponds to a guideline for a 10\% maximum packet error rate as specified in the IEEE BAN standard; a reduction in the level crossing rate by a factor of 5 at a channel gain threshold of --- 100dB; and an average nonfade duration prolonged by a factor of 5 at the same threshold.", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Pham:2016:QLR, author = "Congduc Pham", title = "{QoS} for Long-Range Wireless Sensors Under Duty-Cycle Regulations with Shared Activity Time Usage", journal = j-TOSN, volume = "12", number = "4", pages = "33:1--33:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2979678", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Long-range radio can connect sensors/IoT devices without complex and costly deployment of relay nodes. However, this flexibility comes with stricter legal regulations such as maximum radio activity time per 1-hour period. Under such constraints it is difficult to provide service guarantees, which is quite paradoxical when devices are deployed for surveillance systems. The approach we propose allows devices to go ``exceptionally'' beyond the activity time limitation by borrowing time from other devices. The mechanism is not intended to be used on a regular basis, where a device is commissioned to always report data at a rate that makes it consuming more than the allowed duty-cycle limitation, but to offer a ``last chance'' solution for providing better surveillance service guarantees while globally satisfying duty-cycle regulations. The proposition has been implemented on our long-range image sensor platform, and preliminary experiments show that it can maintain the system's consistency and keep the number of control messages small while being capable of handling sleep-wakeup behavior and dynamic insertion of new devices. Although initially targeted for image sensors, the proposition can also be deployed to increase the quality of service of traditional sensors by guaranteeing that important messages can be sent despite the duty-cycle regulation limit.", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kim:2016:REE, author = "Hyung-Sin Kim and Myung-Sup Lee and Young-June Choi and Jeonggil Ko and Saewoong Bahk", title = "Reliable and Energy-Efficient Downward Packet Delivery in Asymmetric Transmission Power-Based Networks", journal = j-TOSN, volume = "12", number = "4", pages = "34:1--34:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2983532", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In low-power wireless networks, maintaining multihop connectivity is considered effective in constructing communication routes between individual nodes to a gateway. Since sensor networks are typically used for data collection, multihop routing protocols are designed to find routes optimal in upward directions. As sensor networks become widely applied to diverse applications, efficient downward traffic delivery also becomes important. To achieve this, we consider an asymmetric transmission power-based network (APN), where a power-supplied gateway uses high-power radios to cover the entire network via single-hop transmission, whereas common nodes use low-power transmissions. For effective APN operations, we propose a single-hop downlink protocol (SHDP) that consists of direct downlink transmission, local acknowledgment, neighbor forwarding, and contention resolution among the destination's neighbors. We evaluate SHDP through mathematical analysis, simulations, and testbed experiments. Our proposal outperforms other competitive multihop routing protocols. Specifically, SHDP shows high packet delivery performance and lowers the duty cycle greatly while reducing the packet transmission overhead by {$>$50}\%.", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ammari:2016:KCC, author = "Habib M. Ammari", title = "{$3$D-$k$ Cov-ComFor}: an Energy-Efficient Framework for Composite Forwarding in Three-Dimensional Duty-Cycled $k$-Covered Wireless Sensor Networks", journal = j-TOSN, volume = "12", number = "4", pages = "35:1--35:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2822894", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Most existing work on coverage, connectivity, and geographic forwarding considers a two-dimensional (2D) space, where the sensors are deployed in a 2D field. However, there are several cases where the 2D assumption is not valid for the design of those types of wireless sensor networks (WSNs), such as underwater sensor deployment and sensors deployed on the trees of different heights in a forest. In this article, we investigate the problem of $k$-coverage in three-dimensional (3D) WSNs, where each point in a 3D field is covered by at least $k$ sensors simultaneously. Moreover, it is commonly assumed in most of the work on the problem of geographic forwarding in WSNs that all the sensors are always on (or active) during the network operational lifetime, and, particularly, during data forwarding. However, this type of design is neither practical nor efficient for the sensors whose energy is crucial and limited. Therefore, we consider geographic forwarding in 3D duty-cycled $k$-covered WSNs, where the sensors can switch between on and off states (i.e., duty-cycled sensors) to save energy. First, we provide a rigorous analysis of the $k$-coverage problem in 3D WSNs using Helly's Theorem and the Reuleaux tetrahedron model, and compute the sensor spatial density to $k$-cover a 3D field. Second, based on this analysis, we compute a lower bound and an upper bound on the number of overlapping Reuleaux tetrahedra that are necessary to fill a 3D convex shape, such as the sensing sphere of a sensor. Third, using these results, we present a localized (i.e., based on local information of one-hop neighbors), pseudo-distributed (i.e., not fully distributed) protocol to achieve $k$-coverage of a 3D field with a reduced number of active sensors, while ensuring connectivity between them. Fourth, we discuss our composite geographic forwarding protocol for 3D duty-cycled $k$-covered WSNs using a combination of deterministic and opportunistic schemes to forward sensed data towards the sink. We will study the problem of 3D space filling (or space covering) in the context of the above-mentioned problems in 3D WSNs. Fifth, we relax two widely used assumptions, namely sensor homogeneity and sensing range convexity, to generalize our $k$-coverage protocol in 3D space. Last, we show several simulation results of our framework for joint $k$-coverage and composite geographic for warding in 3D duty-cycled WSNs, called 3D-$k$Cov-ComFor. We found a close-to-perfect match between our theoretical and simulation results.", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Gao:2016:NSS, author = "Mingjie Gao and Ka-Fai Cedric Yiu and Sven Nordholm and Yinyu Ye", title = "On a New {SDP--SOCP} Method for Acoustic Source Localization Problem", journal = j-TOSN, volume = "12", number = "4", pages = "36:1--36:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2968449", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Acoustic source localization has many important applications. Convex relaxation provides a viable approach of obtaining good estimates very efficiently. There are two popular convex relaxation methods using either semi-definite programming (SDP) or second-order cone programming (SOCP). However, the performances of the methods have not been studied properly in the literature and there is no comparison in terms of accuracy and performance. The aims of this article are twofold. First of all, we study and compare several convex relaxation methods. We demonstrate, by numerical examples, that most of the convex relaxation methods cannot localize the source exactly, even in the performance limit when the time difference of arrival (TDOA) information is exact. In addressing this problem, we propose a novel mixed SDP-SOCP relaxation model and study the characteristics of the optimal solutions and its localizable region. Furthermore, an error correction scheme for the proposed SDP-SOCP model is developed so that exact localization can be achieved in the performance limit. Experimental data have been collected in a room with two different array configurations to demonstrate our proposed approach.", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Li:2016:TLL, author = "Yimei Li and Yao Liang", title = "Temporal Lossless and Lossy Compression in Wireless Sensor Networks", journal = j-TOSN, volume = "12", number = "4", pages = "37:1--37:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2990196", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Energy efficiency is one of the most critical issues in the design and deployment of Wireless Sensor Networks (WSNs). Data compression is an important approach to reducing energy consumption of data gathering in multihop sensor networks. Existing compression algorithms only apply to either lossless or lossy data compression, but not to both. This article presents a generalized predictive coding framework for unified lossless and lossy data compression. In addition, we devise a novel algorithm for lossless compression to significantly improve data compression performance for various data collections and applications in WSNs. Rigorous simulations show our proposed framework and compression algorithm outperform several recent popular compression algorithms for WSNs such as Lossless Entropy Compression (LEC), S-Lempel--Ziv--Welch (LZW), and Lightweight Temporal Compression (LTC) using various real-world sensor datasets, demonstrating the merit of the proposed framework for unified temporal lossless and lossy data compression in WSNs.", acknowledgement = ack-nhfb, articleno = "37", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Midi:2017:SRP, author = "Daniele Midi and Salmin Sultana and Elisa Bertino", title = "A System for Response and Prevention of Security Incidents in Wireless Sensor Networks", journal = j-TOSN, volume = "13", number = "1", pages = "1:1--1:??", month = feb, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/2996195", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Resource constraints, unattended operating environments, and communication phenomena make Wireless Sensor Networks (WSNs) susceptible to operational failures and security attacks. However, applications often impose stringent requirements on data reliability and service availability, due to the deployment of sensor networks in various critical infrastructures. Given the failure- and attack-prone nature of sensor networks, enabling sensor networks to continuously provide their services as well as to effectively recover from attacks is a crucial requirement. We present Kinesis, a security incident response system designed to keep WSNs functional despite anomalies or attacks and to recover from attacks without significant interruption. Kinesis is quick and effective in responding to incidents, distributed in nature, dynamic in selecting response actions based on the context, and lightweight in terms of response policy specification, communication, and energy overhead. A per-node single timer-based distributed strategy to select the most effective response executor in a neighborhood makes the system simple and scalable, while achieving load balancing and redundant action optimization. We implement Kinesis in TinyOS and measure its performance for various application and network layer incidents. Extensive TOSSIM simulations and testbed experiments show that Kinesis successfully counteracts anomalies/attacks and behaves consistently under various attack scenarios and rates.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Park:2017:ESN, author = "Yongtae Park and Jihun Ha and Hyogon Kim and Jeonggil Ko", title = "Enabling Sensor Network to {Smartphone} Interaction Using Software Radios", journal = j-TOSN, volume = "13", number = "1", pages = "2:1--2:??", month = feb, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3002177", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Recent advances in smartphone processing power have opened the possibilities for them to act as the processing component of software-defined radios (SDRs). For low-power sensor network systems using various communication protocols, this means that smartphones, when equipped with an SDR, can be their system management end-devices, (potentially) without the need for external communication modules. Nevertheless, the high processor and energy usage overhead of SDRs remains a major technical barrier that blocks the practical adoption of smartphone-based SDRs. In this work, we show that implementation flexibility at the software can relax this overhead. Specifically, we show, using an implementation of the low-power listening (LPL) Medium Access Control (MAC), that software improvements have the potential to significantly reduce the operational overhead of SDRs. Moreover, we show that implementing packet reception filters can help further reduce the performance overhead without sacrificing application-level message exchange qualities. Empirical results with a smartphone-based SDR suggest that by combining LPL with packet reception filters, the processing and energy overhead can be reduced by two to three orders of magnitude. We not only see this as a chance to practically realize smartphones as a wireless sensing system controller but also believe that the experiences with practical smartphone-based SDRs can provide guidelines for future wireless protocol and low-power radio designs that are suitable for mobile computing environments.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Cheong:2017:AKK, author = "Se-Hang Cheong and Yain-Whar Si", title = "Accelerating the {Kamada--Kawai} Algorithm for Boundary Detection in a Mobile Ad Hoc Network", journal = j-TOSN, volume = "13", number = "1", pages = "3:1--3:??", month = feb, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3005718", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Force-directed algorithms such as the Kamada-Kawai algorithm have shown promising results for solving the boundary detection problem in a mobile ad hoc network. However, the classical Kamada-Kawai algorithm does not scale well when it is used in networks with large numbers of nodes. It also produces poor results in non-convex networks. To address these problems, this article proposes an improved version of the Kamada-Kawai algorithm. The proposed extension includes novel heuristics and algorithms that achieve a faster energy level reduction. Our experimental results show that the improved algorithm can significantly shorten the processing time and detect boundary nodes with an acceptable level of accuracy.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Adu-Manu:2017:WQM, author = "Kofi Sarpong Adu-Manu and Cristiano Tapparello and Wendi Heinzelman and Ferdinand Apietu Katsriku and Jamal-Deen Abdulai", title = "Water Quality Monitoring Using Wireless Sensor Networks: Current Trends and Future Research Directions", journal = j-TOSN, volume = "13", number = "1", pages = "4:1--4:??", month = feb, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3005719", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Water is essential for human survival. Although approximately 71\% of the world is covered in water, only 2.5\% of this is fresh water; hence, fresh water is a valuable resource that must be carefully monitored and maintained. In developing countries, 80\% of people are without access to potable water. Cholera is still reported in more than 50 countries. In Africa, 75\% of the drinking water comes from underground sources, which makes water monitoring an issue of key concern, as water monitoring can be used to track water quality changes over time, identify existing or emerging problems, and design effective intervention programs to remedy water pollution. It is important to have detailed knowledge of potable water quality to enable proper treatment and also prevent contamination. In this article, we review methods for water quality monitoring (WQM) from traditional manual methods to more technologically advanced methods employing wireless sensor networks (WSNs) for in situ WQM. In particular, we highlight recent developments in the sensor devices, data acquisition procedures, communication and network architectures, and power management schemes to maintain a long-lived operational WQM system. Finally, we discuss open issues that need to be addressed to further advance automatic WQM using WSNs.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2017:SNP, author = "Changda Wang and Elisa Bertino", title = "Sensor Network Provenance Compression Using Dynamic {Bayesian} Networks", journal = j-TOSN, volume = "13", number = "1", pages = "5:1--5:??", month = feb, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/2997653", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Provenance records the history of data acquisition and transmission. In wireless sensor networks (WSNs), provenance is critical for many different purposes, including assessing the trustworthiness of data acquired and forwarded by sensors, supporting situation awareness, and detecting early signs of attacks. However, a major drawback in provenance for WSNs is its size. It is thus critical to develop efficient techniques for provenance encoding. A major issue of previously proposed provenance encoding techniques is that the size of the provenance either expands too fast with increases in the number of packet transmission hops or is very sensitive to the WSN's topology, i.e., the size of the provenance expands drastically with changes in the WSN's topology. In this article, we propose a novel provenance encoding technique based on dynamic Bayesian network and overlapped arithmetic coding scheme, which addresses such an issue. Through theoretical analysis, simulation, and testbed experiments, we show that our scheme outperforms other WSN lightweight provenance schemes with respect to provenance size and energy consumption.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Xu:2017:GKG, author = "Weitao Xu and Chitra Javali and Girish Revadigar and Chengwen Luo and Neil Bergmann and Wen Hu", title = "{Gait-Key}: a Gait-Based Shared Secret Key Generation Protocol for Wearable Devices", journal = j-TOSN, volume = "13", number = "1", pages = "6:1--6:??", month = feb, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3023954", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Recent years have witnessed a remarkable growth in the number of smart wearable devices. For many of these devices, an important security issue is to establish an authenticated communication channel between legitimate devices to protect the subsequent communications. Due to the wireless nature of the communication and the extreme resource constraints of sensor devices, providing secure, efficient, and user-friendly device pairing is a challenging task. Traditional solutions for device pairing mostly depend on key predistribution, which is unsuitable for wearable devices in many ways. In this article, we design Gait-Key, a shared secret key generation scheme that allows two legitimate devices to establish a common cryptographic key by exploiting users' walking characteristics (gait). The intuition is that the sensors on different locations on the same body experience similar accelerometer signals when the user is walking. However, one main challenge is that the accelerometer also captures motion signals produced by other body parts (e.g., swinging arms). We address this issue by using the blind source separation technique to extract the informative signal produced by the unique gait patterns. Our experimental results show that Gait-Key can generate a common 128-bit key for two legitimate devices with 98.3\% probability. To demonstrate the feasibility, the proposed key generation scheme is implemented on modern smartphones. The evaluation results show that the proposed scheme can run in real time on modern mobile devices and incurs low system overhead.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2017:EWN, author = "Shuai Wang and Song Min Kim and Zhimeng Yin and Tian He", title = "Encode When Necessary: Correlated Network Coding Under Unreliable Wireless Links", journal = j-TOSN, volume = "13", number = "1", pages = "7:1--7:??", month = feb, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3023953", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Recent research has shown that network coding has great potential to improve network performance in wireless communication. The performance of network coding in real-world scenarios, however, varies dramatically. It is reported that network coding brings negligible improvements but extra coding overhead in some scenarios. In this article, for the first time, we analyze the impact of link correlation on network coding and quantify the coding benefits. We propose correlated coding, which encodes packets only when performance improvement is achieved. Correlated coding uses only one-hop information, which makes it work in a fully distributed manner and introduces minimal communication overhead. The highlight of the design is its broad applicability and effectiveness. We implement the design with four broadcast protocols and three unicast protocols, and we evaluate them extensively on one 802.11 testbed and three 802.15.4 testbeds. The experimental results show that (i) more coding operations do not lead to fewer transmissions, and (ii) compared to existing network coding protocols, the number of transmissions is reduced with lower coding overhead.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bedogni:2017:PAF, author = "Luca Bedogni and Andreas Achtzehn and Marina Petrova and Petri M{\"a}h{\"o}nen and Luciano Bononi", title = "Performance Assessment and Feasibility Analysis of {IEEE 802.15.4m} Wireless Sensor Networks in {TV} Grayspaces", journal = j-TOSN, volume = "13", number = "1", pages = "8:1--8:??", month = feb, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3021499", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:36 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In this article, we assess the viability of underlay sensor networks in frequencies used by an incumbent digital TV broadcasting system, that is, in the so-called TV grayspaces (TVGS). Grayspace operations are particularly interesting when other unlicensed bands are overcrowded, for example, due to high-volume WiFi operations. We simulate the operational characteristics of the recent IEEE 802.15.4m standard for low-rate wireless personal area networks to evaluate the performance degradation of an incumbent Digital Video Broadcasting --- Terrestrial (DVB-T) system if a secondary network of low-power low-rate devices are co-deployed in the same frequency bands. Our results show that short sensor messages will not disrupt the DVB-T service due to the existing error-correction capabilities. Furthermore, if sufficient separation distances to primary transmitters are maintained, transmit powers are sufficient to achieve reasonable connectivity levels of the secondary network. In order to obtain realistic figures on the predicted feasibility of grayspace sensor networks, we study the deployment constraints of a hypothetical secondary network co-located with the TV broadcasting network of Germany. Our analysis shows that if we aim to support a minimum sensor-sensor distance, no universal coverage can be maintained in this country. While our quantitative results are specific to Germany, we deem them indicative for the expected results also in other potential deployments. We found that while a secondary wireless sensor network in TVGS is technically possible, the necessary constraints on operational parameters and service levels for TVGS co-existence will significantly limit its practical viability.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tan:2017:JDC, author = "Rui Tan and Sheng-Yuan Chiu and Hoang Hai Nguyen and David K. Y. Yau and Deokwoo Jung", title = "A Joint Data Compression and Encryption Approach for Wireless Energy Auditing Networks", journal = j-TOSN, volume = "13", number = "2", pages = "9:1--9:??", month = jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3027489", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:37 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Fine-grained real-time metering is a fundamental service of wireless energy auditing networks, where metering data is transmitted from embedded wireless power meters to gateways for centralized processing, storage, and forwarding. Due to limited meter capability and wireless bandwidth, the increasing sampling rates and network scales needed to support new energy auditing applications pose significant challenges to metering data fidelity and secrecy. This article exploits the compression and encryption properties of compressive sensing (CS) to design a joint data compression and encryption (JICE) approach that addresses these two challenges simultaneously. Compared with a conventional signal processing pipeline that compresses and encrypts data sequentially, JICE reduces computation and space complexities due to its simple design. It thus leaves more processor time and available buffer space for handling lossy wireless transmissions. Moreover, JICE features an adaptive reconfiguration mechanism that selects the signal representation basis of CS at runtime among several candidate bases to achieve the best fidelity of the recovered data at the gateways. This mechanism enables JICE to adapt to changing power consumption patterns. On a smart plug platform, we implemented JICE and several baseline approaches including downsampling, lossless compression, and the pipeline approach. Extensive testbed experiments show that JICE achieves higher data delivery ratios and lower recovery distortions under a range of realistic settings. In particular, at a meter sampling rate of 8 Hz, JICE increases the number of meters supported by a gateway by 50\%, compared with the commonly used pipeline approach, while keeping a signal distortion rate lower than 5\%.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Mohammad:2017:IPS, author = "Mobashir Mohammad and Manjunath Doddavenkatappa and Mun Choon Chan", title = "Improving Performance of Synchronous Transmission-Based Protocols Using Capture Effect over Multichannels", journal = j-TOSN, volume = "13", number = "2", pages = "10:1--10:??", month = jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3043790", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:37 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Synchronous transmission has been exploited recently for accelerating fundamental operations of wireless sensor networks like data dissemination, data collection, and network-wide agreement by an order of magnitude. Although these protocols (e.g., Glossy) have shown to be highly reliable for small packet sizes, the use of large packet sizes coupled with an excessive number of simultaneous transmissions can reduce reliability significantly. Our work is motivated by the observation that capture effect can improve the reliability of synchronous transmission. We experimentally study the effect of physical layer capture and identify guidelines in which it can be exploited to enhance reliability. Based on these observations, we propose Syncast, a data dissemination protocol that improves over Glossy by exploiting capture effect over multichannels. The evaluation shows that Syncast provides a robust, reliable, and scalable data dissemination of large packets with lower end-to-end delay and up to 92\% reduced radio-on-time.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Li:2017:AHA, author = "Ji Li and Siyao Cheng and Zhipeng Cai and Jiguo Yu and Chaokun Wang and Yingshu Li", title = "Approximate Holistic Aggregation in Wireless Sensor Networks", journal = j-TOSN, volume = "13", number = "2", pages = "11:1--11:??", month = jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3027488", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:37 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Holistic aggregations are popular queries for users to obtain detailed summary information from Wireless Sensor Networks. An aggregation operation is holistic if there is no constant bound on the size of the storage needed to describe a sub-aggregation. Since holistic aggregation cannot be distributable, it requires that all the sensory data should be sent to the sink in order to obtain the exact holistic aggregation results, which costs lots of energy. However, in most applications, exact holistic aggregation results are not necessary; instead, approximate results are acceptable. To save energy as much as possible, we study the approximated holistic aggregation algorithms based on uniform sampling. In this article, four holistic aggregation operations, frequency, distinct-count, rank, and quantile, are investigated. The mathematical methods to construct their estimators and determine optional sample size are proposed, and the correctness of these methods are proved. Four corresponding distributed holistic algorithms to derive $ (\epsilon, \delta)$-approximate aggregation results are given. The solid theoretical analysis and extensive simulation results show that all the proposed algorithms have high performance on the aspects of accuracy and energy consumption.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Teng:2017:IIO, author = "Xiaoqiang Teng and Deke Guo and Yulan Guo and Xiaolei Zhou and Zeliu Ding and Zhong Liu", title = "{IONavi}: an Indoor-Outdoor Navigation Service via Mobile Crowdsensing", journal = j-TOSN, volume = "13", number = "2", pages = "12:1--12:??", month = jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3043948", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:37 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The proliferation of mobile computing has prompted navigation to be one of the most attractive and promising applications. Conventional designs of navigation systems mainly focus on either indoor or outdoor navigation. However, people have a strong need for navigation from a large open indoor environment to an outdoor destination in real life. This article presents IONavi, a joint navigation solution, which can enable passengers to easily deploy indoor-outdoor navigation service for subway transportation systems in a crowdsourcing way. Any self-motivated passenger records and shares individual walking traces from a location inside a subway station to an uncertain outdoor destination within a given range, such as one kilometer. IONavi further extracts navigation traces from shared individual traces, each of which is not necessary to be accurate. A subsequent following user achieves indoor-outdoor navigation services by tracking a recommended navigation trace. Extensive experiments are conducted on a subway transportation system. The experimental results indicate that IONavi exhibits outstanding navigation performance from an uncertain location inside a subway station to an outdoor destination. Although IONavi is to enable indoor-outdoor navigation for subway transportation systems, the basic idea can naturally be extended to joint navigation from other open indoor environments to outdoor environments.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{He:2017:ISA, author = "Bin He and Gang Li", title = "Intelligent Self-Adaptation Data Behavior Control Inspired by Speech Acts", journal = j-TOSN, volume = "13", number = "2", pages = "13:1--13:??", month = jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3051125", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:37 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless sensor networks (WSNs) are a promising technology for collecting information by utilizing various types of small-sized sensors. Implementing efficient data acquisition and transmission is important for real-time monitoring and data analysis, owing to massive and heterogeneous data with low precision. In this work, the data behavior model inspired by speech acts is built, including the data correlation model and the data comment model. Intelligent self-adaptation data behavior control is then proposed, of which the main idea is to make sensor nodes (SNs) process data intelligently. In the proposed data behavior control, the temporal compression behavior is achieved through variable-cycle transmission and the multivariate spatial compression behavior is motivated by compressed sensing (CS) theory. The multivariate spatial-temporal compression composed of the above two compression behaviors can adjust itself through data comment behaviors including the large-cycle error self-correction behavior based on the node credibility and the large-cycle event self-adaptation behavior based on the information granularity. The data behavior control presented has been validated by the experiments in the Shanghai metro tunnel. The experiment results show that these intelligent data behaviors inspired by speech acts can make WSNs more effective and intelligent with no change in the existing network structure.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yang:2017:VSS, author = "Zhicheng Yang and Parth H. Pathak and Yunze Zeng and Xixi Liran and Prasant Mohapatra", title = "Vital Sign and Sleep Monitoring Using Millimeter Wave", journal = j-TOSN, volume = "13", number = "2", pages = "14:1--14:??", month = jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3051124", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:37 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Continuous monitoring of human's breathing and heart rates is useful in maintaining better health and early detection of many health issues. Designing a technique that can enable contactless and ubiquitous vital sign monitoring is a challenging research problem. This article presents mmVital, a system that uses 60GHz millimeter wave (mmWave) signals for vital sign monitoring. We show that the mmWave signals can be directed to human's body and the Received Signal Strength (RSS) of the reflections can be analyzed for accurate estimation of breathing and heart rates. We show how the directional beams of mmWave can be used to monitor multiple humans in an indoor space concurrently. mmVital also provides sleep monitoring with sleeping posture identification and detection of central apnea and hypopnea events. It relies on a novel human finding procedure where a human can be located within a room by reflection loss-based object/human classification. We evaluate mmVital using a 60GHz testbed in home and office environment and show that it provides the mean estimation error of 0.43 breaths per minute (Bpm; breathing rate) and 2.15 beats per minute (bpm; heart rate). Also, it can locate the human subject with 98.4\% accuracy within 100ms of dwell time on reflection. We also demonstrate that mmVital is effective in monitoring multiple people in parallel and even behind a wall.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zarepour:2017:SSE, author = "Eisa Zarepour and Mahbub Hassan and Chun Tung Chou and Adesoji A. Adesina", title = "{SEMON}: Sensorless Event Monitoring in Self-Powered Wireless Nanosensor Networks", journal = j-TOSN, volume = "13", number = "2", pages = "15:1--15:??", month = jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3064838", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:37 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "A conventional wireless sensor network node consists of a number of components: microprocessor, memory, sensor, and radio. Advances in nanotechnology have enabled the miniaturization of these components, thus enabling wireless nanoscale sensor networks (WNSN). Due to their small size, WNSN nodes are expected to be powered by harvesting energy from the environment. Unfortunately, there is a mismatch in the energy that can be harvested and the energy required to power all the aforementioned components in a WNSN node. In this article, we propose a simplified sensor node architecture for event detection. We call our architecture Sensorless Event MONitoring in self-powered WNSNs (SEMON). A SEMON node consists of only an energy harvester and a radio with minimal processing capacity. We assume that each event to be monitored will generate a different amount of energy, and we can therefore use this amount of energy as the signature of an event. When an event occurs, a SEMON node harvests the energy released by the event and turns it into a radio pulse with an amplitude proportional to the harvested energy. A remote station is used to decode the amplitude of the pulse to recognize the event that has occurred. We propose two methods for the remote station to decode the events that have occurred. The first method is based on thresholds. The second method makes use of an event model that gives the probability that a sequence of events will occur. This enables us to formulate the decoding problem using Hidden Markov Models. We study the decoding performance of both methods. Finally, we provide a case study on using the SEMON architecture to monitor the chemical reactions inside a reactor.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Hester:2017:RRE, author = "Josiah Hester and Lanny Sitanayah and Timothy Scott and Jacob Sorber", title = "Realistic and Repeatable Emulation of Energy Harvesting Environments", journal = j-TOSN, volume = "13", number = "2", pages = "16:1--16:??", month = jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3064839", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jul 24 09:36:37 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Harvesting energy from the environment makes it possible to deploy tiny sensors for long periods of time, with little or no required maintenance; however, this free energy makes testing and experimentation difficult. Environmental energy sources vary widely and are often difficult both to predict and to reproduce in the lab during testing. These variations are also behavior dependent-a factor that leaves application engineers unable to make even simple comparisons between algorithms or hardware configurations, using traditional testing approaches. In this article, we describe the design and evaluation of Ekho, an emulator capable of recording energy harvesting conditions and accurately recreating those conditions in the lab. This makes it possible to conduct realistic and repeatable experiments involving energy harvesting devices. Ekho is a general-purpose, mobile tool that supports a wide range of harvesting technologies. We demonstrate, using a working prototype, that Ekho is capable of reproducing solar, Radio Frequency (RF), and kinetic energy harvesting environments accurately and consistently. Our results show that Ekho can recreate harvesting-dependent program behaviors by emulating energy harvesting conditions accurately to within 77.4 $ \mu $ A for solar and 15.0 $ \mu $ A for kinetic environments, and can emulate RF energy harvesting conditions consistently.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Dezfouli:2017:RRT, author = "Behnam Dezfouli and Marjan Radi and Octav Chipara", title = "{REWIMO}: a Real-Time and Reliable Low-Power Wireless Mobile Network", journal = j-TOSN, volume = "13", number = "3", pages = "17:1--17:??", month = sep, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3046677", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:48 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Industrial applications and cyber-physical systems rely on real-time wireless networks to deliver data in a timely and reliable manner. However, existing solutions provide these guarantees only for stationary nodes. In this article, we present REWIMO, a solution for real-time and reliable communications in mobile networks. REWIMO has a two-tier architecture composed of (i) infrastructure nodes and (ii) mobile nodes that associate with infrastructure nodes as they move. REWIMO employs an on-join bandwidth reservation approach and benefits from a set of techniques to efficiently reserve bandwidth for each mobile node at the time of its admission and over its potential data forwarding paths. To ensure association of mobile nodes with infrastructure nodes over high-quality links, REWIMO uses the two-phase scheduling technique to coordinate neighbor discovery with data transmission. To mitigate the overhead of handling network dynamics, REWIMO employs an additive scheduling algorithm, which is capable of additive bandwidth reservation without modifying existing schedules. Compared to the algorithms used by static real-time wireless networks, the techniques and the algorithms employed by REWIMO result in a significant increase in real-time capacity, enhanced reliability, and considerably faster handling of network dynamics.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kartakis:2017:RSO, author = "Sokratis Kartakis and Shusen Yang and Julie A. Mccann", title = "Reliability or Sustainability: Optimal Data Stream Estimation and Scheduling in Smart Water Networks", journal = j-TOSN, volume = "13", number = "3", pages = "18:1--18:??", month = sep, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3064840", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:48 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "As a typical cyber-physical system (CPS), smart water distribution networks require monitoring of underground water pipes with high sample rates for precise data analysis and water network control. Due to poor underground wireless channel quality and long-range communication requirements, high transmission power is typically adopted to communicate high-speed sensor data streams, posing challenges for long-term sustainable monitoring. In this article, we develop the first sustainable water sensing system, exploiting energy harvesting opportunities from water flows. Our system does this by scheduling the transmission of a subset of the data streams, whereas other correlated streams are estimated using autoregressive models based on the sound-velocity propagation of pressure signals inside water networks. To compute the optimal scheduling policy, we formalize a stochastic optimization problem to maximize the estimation reliability while ensuring the system's sustainable operation under dynamic conditions. We develop data transmission scheduling (DTS), an asymptotically optimal scheme, and FAST-DTS, a lightweight online algorithm that can adapt to arbitrary energy and correlation dynamics. Using more than 170 days of real data from our smart water system deployment and conducting in vitro experiments to our small-scale testbed, our evaluation demonstrates that Fast-DTS significantly outperforms three alternatives, considering data reliability, energy utilization, and sustainable operation.", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Penil:2017:HLD, author = "Pablo Pe{\~n}il and Alvaro D{\'\i}az and Hector Posadas and Julio Medina and Pablo S{\'a}nchez", title = "High-Level Design of Wireless Sensor Networks for Performance Optimization Under Security Hazards", journal = j-TOSN, volume = "13", number = "3", pages = "19:1--19:??", month = sep, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3078359", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:48 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The increasing complexity of current wireless sensor networks requires efficient methodologies to fulfill the strict constraints typically imposed in terms of power consumption and system performance. Furthermore, security issues are also becoming key features due to their impact on system behavior. As a consequence, new design frameworks are required to enable developers to model and address security risks from the very beginning of the WSN design process, while optimizing system performance. For this purpose, this article presents a design framework for modeling and simulating WSNs under external attacks. In this framework, the WSN is specified by using UML/MARTE models, from which automatic code generation enables fast, host-compiled simulation. The resulting information enables early detection of weaknesses in WSN designs and simplifies further exploration of design solutions. Minor modifications in the UML models are sufficient to automatically simulate and evaluate each design alternative in an iterative way. As a result, designers can develop more secure and optimized WSN systems with reduced design times and effort.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tan:2017:URP, author = "Rui Tan and Dennis E. Phillips and Mohammad-Mahdi Moazzami and Guoliang Xing and Jinzhu Chen", title = "Unsupervised Residential Power Usage Monitoring Using a Wireless Sensor Network", journal = j-TOSN, volume = "13", number = "3", pages = "20:1--20:??", month = sep, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3078240", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:48 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Appliance-level power usage monitoring may help conserve electricity in homes. Several existing systems achieve this goal by exploiting appliances' power usage signatures identified in labor-intensive in situ training processes. Recent work shows that autonomous power usage monitoring can be achieved by supplementing a smart meter with distributed sensors that detect the working states of appliances. However, sensors must be carefully installed for each appliance, resulting in a high installation cost. This article presents Supero -the first ad hoc sensor system that can monitor appliance power usage without supervised training. By exploiting multisensor fusion and unsupervised machine learning algorithms, Supero can classify the appliance events of interest and autonomously associate measured power usage with the respective appliances. Our extensive evaluation in five real homes shows that Supero can estimate the energy consumption with errors less than 7.5\%. Moreover, nonprofessional users can quickly deploy Supero with considerable flexibility.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yoon:2017:FBC, author = "Hee Jung Yoon and Ho-Kyeong Ra and Can Basaran and Sang Hyuk Son and Taejoon Park and Jeonggil Ko", title = "Fuzzy Bin-Based Classification for Detecting Children's Presence with {$3$D} Depth Cameras", journal = j-TOSN, volume = "13", number = "3", pages = "21:1--21:??", month = sep, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3079764", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:48 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "With the advancement of technology in various domains, many efforts have been made to design advanced classification engines that aid the protection of civilians and their properties in different settings. In this work, we focus on a set of the population which is probably the most vulnerable: children. Specifically, we present ChildSafe, a classification system that exploits ratios of skeletal features extracted from children and adults using a 3D depth camera to classify visual characteristics between the two age groups. Specifically, we combine the ratio information into one bag-of-words feature for each sample, where each word is a histogram of the ratios. ChildSafe analyzes the words that are normalized within and between the two age groups and implements a fuzzy bin-based classification method that represents bin-boundaries using fuzzy sets. We train and evaluate ChildSafe using a large dataset of visual samples collected from 150 elementary school children and 150 adults, ranging in age from 7 to 50. Our results suggest that ChildSafe successfully detects children with a proper classification rate of up to 94\%, a false-negative rate as low as 1.82\%, and a low false-positive rate of 5.14\%. We envision this work as a first step, an effective subsystem for designing child safety applications.", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yu:2017:EEC, author = "Xiaohan Yu and Seung Jun Baek", title = "Energy-Efficient Collection of Sparse Data in Wireless Sensor Networks Using Sparse Random Matrices", journal = j-TOSN, volume = "13", number = "3", pages = "22:1--22:??", month = sep, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3085576", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:48 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We consider the energy efficiency of collecting sparse data in wireless sensor networks using compressive sensing (CS). We use a sparse random matrix as the sensing matrix, which we call Sparse Random Sampling (SRS). In SRS, only a randomly selected subset of nodes, called the source nodes, are required to report data to the sink. Given the source nodes, we intend to construct a data gathering tree such that (1) it is rooted at the sink and spans every source node and (2) the minimum residual energy of the tree nodes after the data collection is maximized. We first show that this problem is NP-complete and then develop a polynomial time algorithm to approximately solve the problem. We greedily construct a sequence of data gathering trees over multiple rounds and propose a polynomial-time algorithm to collect linearly combined measurements at each round. We show that the proposed algorithm is provably near-optimal. Simulation and experimental results show that the proposed algorithm excels not only in increasing the minimum residual energy, but also in extending the network lifetime.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ghosh:2017:MBY, author = "Avishek Ghosh and Arpan Chattopadhyay and Anish Arora and Anurag Kumar", title = "Measurement Based As-You-Go Deployment of Two-Connected Wireless Relay Networks", journal = j-TOSN, volume = "13", number = "3", pages = "23:1--23:??", month = sep, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3085577", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:48 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Motivated by the need for impromptu or as-you-go deployment of wireless sensor networks in some situations, we study the problem of optimal sequential deployment of wireless sensors and relays along a line (e.g., a forest trail) of unknown length. Starting from the sink node (e.g., a base station), a ``deployment agent'' walks along the line, stops at equally spaced points (``potential'' relay locations), placing relays at some of these points, until he reaches a location at which the source node (i.e., the sensor) needs to be placed, the objective being to create a multihop wireless relay network between the source and the sink. The deployment agent decides whether to place a relay or not at each of the potential locations, depending upon the link quality measurements to the previously placed relays. In this article, we seek to design efficient deployment algorithms for this class of problems, to achieve the objective of 2-connectivity in the deployed network. We ensure multi-connectivity by allowing each node to communicate with more than one neighbouring node. By proposing a network cost objective that is additive over the deployed relays, we formulate the relay placement problem as a Markov decision process. We provide structural results for the optimal policy and evaluate the performance of the optimal policy via numerical exploration. Computation of such an optimal deployment policy requires a statistical model for radio propagation; we extract this model from the raw data collected via measurements in a forestlike environment. To validate the results obtained from the numerical study, we provide an experimental study of algorithms for 2-connected network deployment.", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Rathore:2017:MEB, author = "Punit Rathore and Dheeraj Kumar and Sutharshan Rajasegarar and Marimuthu Palaniswami", title = "Maximum Entropy-Based Auto Drift Correction Using High- and Low-Precision Sensors", journal = j-TOSN, volume = "13", number = "3", pages = "24:1--24:??", month = sep, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3085579", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:48 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "With the advancement in the Internet of Things (IoT) technologies, variety of sensors including inexpensive, low-precision sensors with sufficient computing and communication capabilities are increasingly deployed for monitoring large geographical areas. One of the problems with the use of inexpensive sensors is that they often suffer from random or systematic errors such as drift. The sensor drift is the result of slow changes that occur in the measurement driven by aging, loss of calibration, and changes in the phenomena being monitored over a time period. These drifting sensors need to be calibrated automatically for continuous and reliable monitoring. Existing methods for drift detection and correction do not consider the measurement errors or uncertainties present in those inexpensive low-precision sensors, hence, resulting in unreliable drift estimates. In this article, we propose a novel framework to automatically detect and correct the drifts by employing Bayesian Maximum Entropy (BME) and Kalman filtering (KF) techniques. The BME method is a spatiotemporal estimation method that incorporates the measurement errors of low-precision sensors as interval quantities along with the high-precision sensor measurements in their computations. Our scheme can be implemented in a centralized as well as in a distributed manner to detect and correct the drift generated in the sensors. For the centralized scheme, we compare several Kriging-based estimation techniques in combination with KF, and show the superiority of our proposed BME-based method in detecting and correcting the drift. We also propose a multivariate BME framework for drift detection, in which multiple features can be used to improve the drift estimates. To demonstrate the applicability of our distributed approach on a real-world application scenario, we implemented our algorithm on each wireless sensor node in order to perform in-network drift detection. The evaluation on real IoT datasets gathered from an indoor and an outdoor deployments reveal the superiority of our method in correctly identifying and correcting the drifts that develop in the sensors, in real time, compared to the existing approaches in the literature.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Razzaque:2017:QBA, author = "M. A. Razzaque and Muta Tah Hira and Mukta Dira", title = "{QoS} in Body Area Networks: a Survey", journal = j-TOSN, volume = "13", number = "3", pages = "25:1--25:??", month = sep, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3085580", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:48 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Body Area Networks (BANs) are becoming increasingly popular and have shown great potential in real-time monitoring of the human body. With the promise of being cost-effective and unobtrusive and facilitating continuous monitoring, BANs have attracted a wide range of monitoring applications, including medical and healthcare, sports, and rehabilitation systems. Most of these applications are real time and life critical and require a strict guarantee of Quality of Service (QoS) in terms of timeliness, reliability, and so on. Recently, there has been a number of proposals describing diverse approaches or frameworks to achieve QoS in BANs (i.e., for different layers or tiers and different protocols). This survey put these individual efforts into perspective and presents a more holistic view of the area. In this regard, this article identifies a set of QoS requirements for BAN applications and shows how these requirements are linked in a three-tier BAN system and presents a comprehensive review of the existing proposals against those requirements. In addition, open research issues, challenges, and future research directions in achieving these QoS in BANs are highlighted.", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Griffiths:2017:EDS, author = "Erin Griffiths and Avinash Kalyanaraman and Juhi Ranjan and Kamin Whitehouse", title = "An Empirical Design Space Analysis of Doorway Tracking Systems for Real-World Environments", journal = j-TOSN, volume = "13", number = "4", pages = "26:1--26:??", month = dec, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3089157", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:49 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Doorway tracking systems track people's room location by instrumenting the doorways rather than instrumenting the rooms themselves-resulting in fewer sensors and less monitoring while still providing location information on occupants. In this article, we explore what is required to make doorway tracking a practical solution. We break a doorway tracking system into multiple independent design components, including both sensor and algorithmic design. Informed by this design, we construct a doorway tracking system and analyze how different combinations of these design components affect tracking accuracy. We perform a six-day in situ study in a ten-room house with two volunteers to analyze how these design components respond to the natural types and frequencies of errors in a real-world setting. To reflect the needs of different application classes, we analyze these design components using three different evaluation metrics: room accuracy, duration accuracy, and transition accuracy. Results indicate that doorway tracking can achieve 99.5\% room accuracy on average in controlled settings and 96\% room accuracy in in situ settings. This is contrasted against the 76\% in situ setting room accuracy of Doorjamb, a doorway tracking system whose design implements only a limited number of components in our proposed doorway tracking system design space. We describe the differences between the data in the in situ and controlled settings, and provide guidelines about how to design a doorway tracking system for a given application's accuracy requirements.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Han:2017:TTA, author = "Yu Han and Yunsi Fei", title = "{TARS}: a Traffic-Adaptive Receiver-Synchronized {MAC} Protocol for Underwater Sensor Networks", journal = j-TOSN, volume = "13", number = "4", pages = "27:1--27:??", month = dec, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3105149", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:49 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Efficient medium access control (MAC) is desirable for underwater sensor networks (UWSNs). However, designing an efficient underwater MAC protocol is challenging due to the long propagation delay of the underwater acoustic channel and spatial-temporal uncertainty. In this article, we propose a novel Traffic-Adaptive Receiver-Synchronized underwater MAC protocol, TARS, for throughput maximization. We divide time into equal-sized slots, each the size of one packet transmission time plus a guard time to cope with network dynamics. We adjust the packet transmission phase in a slot, determined by the sender-receiver distance, to align packet receptions for collision reduction. Both the sound propagation speed variation and the node mobility are considered in setting the transmission phase and slot size. We employ a queue-aware utility-optimization framework to determine the optimal transmission strategies dynamically, taking into account both the interference and data queue status. Extensive simulation results show that compared to the existing representative protocols, TARS achieves better performance with higher network throughput and lower packet delay (e.g., about 13\%--146\% higher in throughput and 13\%--21\% lower in delay than others in a mobile ad hoc network), as well as robustness under network mobility. Thus, TARS is highly suitable for mobile and traffic-varying UWSNs.", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Shaabana:2017:ICI, author = "Ala Shaabana and Rong Zheng and Zhipeng Xu", title = "Inferring Clothing Insulation Levels Using Mechanisms of Heat Transfer", journal = j-TOSN, volume = "13", number = "4", pages = "28:1--28:??", month = dec, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3105136", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:49 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "To maintain productivity and alertness, individuals must be thermally comfortable in the space they occupy (whether it is a cubicle, a room, a car, etc.). However, it is often difficult to non-intrusively assess an occupant's ``thermal comfort,'' and hence most HVAC engineers adopt fixed temperature settings to ``err on the safe side.'' These set temperatures can be too hot or too cold for individuals wearing different clothing, and as a result lead to feelings of discomfort as well as wastage of energy. Since humans dress to target a comfortable thermal sensation, it is reasonable to assume that clothing is an important measure of current thermal sensation. To this end, we develop SiCILIA, a platform that extracts physical and personal variables of an occupant's thermal environment to infer the amount of clothing insulation without human intervention. The proposed inference algorithm builds upon theories of body heat transfer and is corroborated by empirical data. SiCILIA was tested in a vehicle with a passenger-controlled HVAC system. Experimental results show that the algorithm is capable of accurately predicting an occupant's thermal insulation with a mean prediction error of 0.07clo.", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yin:2017:THM, author = "Yafeng Yin and Lei Xie and Yuanyuan Fan and Sanglu Lu", title = "Tracking Human Motions in Photographing: a Context-Aware Energy-Saving Scheme for Smart Phones", journal = j-TOSN, volume = "13", number = "4", pages = "29:1--29:??", month = dec, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3085578", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:49 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Due to the portability of smart phones, more and more people tend to take photos with smart phones. However, energy-saving continues to be a thorny problem, since photographing is a rather power hungry function. To extend the battery life of phones while taking photos, we propose a context-aware energy-saving scheme called ``SenSave.'' SenSave senses the user's activities during photographing and adopts suitable energy-saving strategies accordingly. SenSave works based on the observation that a lot of energy during photographing is wasted in preparations before shooting. By leveraging the low power-consuming embedded sensors, such as accelerometer and gyroscope, we can recognize the user's activities and reduce unnecessary energy consumption. Besides, by maintaining an activity state machine, SenSave can determine the user's activity progressively and improve the recognition accuracy. Experiment results show that SenSave can recognize the user's activities with an average accuracy of 95.5\% and reduce the energy consumption during photographing by 30.0\%, when compared to the approach by frequently turning ON/OFF the camera or screen. Additionally, we enhance ``SenSave'' by introducing an extended Markov chain to predict the next activity state and adopt the energy-saving strategy in advance. Then, we can reduce the energy consumption during photographing by 36.1\%.", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Sun:2017:ITC, author = "Boyuan Sun and Qiang Ma and Shanfeng Zhang and Kebin Liu and Yunhao Liu", title = "{iSelf}: Towards Cold-Start Emotion Labeling Using Transfer Learning with {Smartphones}", journal = j-TOSN, volume = "13", number = "4", pages = "30:1--30:??", month = dec, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3121049", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:49 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "It has been a consensus that a certain relationship exists between personal emotions and usage pattern of the smartphone. Based on users' emotions and personalities, more and more applications are developed to provide intelligent automation services on the smartphone, such as music recommendations or stranger introductions on social networking sites. Most existing work studies this relationship by learning large amounts of samples, which are manually labeled and collected from smartphone users. The manual labeling process, however, is very time-consuming and labor-intensive. To address this issue, we propose iSelf, a system that provides a general service of automatic detection of a user's emotions in cold-start conditions with a smartphone. With the technology of transfer learning, iSelf achieves high accuracy given only a few labeled samples. We also embed a hybrid public/personal inference engine and validation system into iSelf, to make it maintain updates continuously. Through extensive experiments in real traces, the inferring accuracy is tested above 74\% and can be improved increasingly through validation and updates. The application program interface has been open online for other developers.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Peyravi:2017:LMD, author = "Hassan Peyravi and Rahul Sehgal", title = "Link Modeling and Delay Analysis in Networks with Disruptive Links", journal = j-TOSN, volume = "13", number = "4", pages = "31:1--31:??", month = dec, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3133322", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:49 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Delay- and Disruption-Tolerant Networks (DTNs) refer to a range of networks with link intermittency that is mainly driven by mobility, predictable or unpredictable network environmental conditions. Examples of DTNs include interplanetary networks, battlefield networks, smart highways, remote sensing, and animal-movement outposts. There exist a number of mobility models describing the operation of various DTNs. One common characteristic that all mobility models share is the distribution of contact time and inter-contact time between nodes. Predicting an end-to-end delay in networks with disruptive links is more complicated than predicting the delay in connected networks. Disruptive patterns and underlying routing algorithms play a major role in an end-to-end delay modeling. In this article, we introduce a new model that can be used to estimate the end-to-end delay in networks with intermittent links. The model incorporates the two non-deterministic delay distributions, namely link intermittency and tandem queuing delay distributions. The model is based on an open queuing system with exponentially distributed link intermittency. The model gives a close approximation of the average end-to-end delay and the delay variance in closed forms. Simulation results on various networks and under different traffic conditions confirm the accuracy of the model within the conventional bounds of statistical significance.", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Harb:2017:DBD, author = "Hassan Harb and Abdallah Makhoul and David Laiymani and Ali Jaber", title = "A Distance-Based Data Aggregation Technique for Periodic Sensor Networks", journal = j-TOSN, volume = "13", number = "4", pages = "32:1--32:??", month = dec, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3132682", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:49 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Monitoring phenomena and environments is an emergent and required field in our today systems and applications. Hence, wireless sensor networks (WSNs) have attracted considerable attention from the research community as an efficient way to explore various kinds of environments. Sensor networks applications can be useful in different domains (terrestrial, underwater, space exploration, etc.). However, one of the major constraints in such networks is the energy consumption that increases when data transmission increases. Consequently, optimizing data transmission is one of the most significant criteria in WSNs that can conserve energy of sensors and extend network lifetime. In this article, we propose an efficient data transmission protocol that consists in two phases of data aggregation. Our proposed protocol searches, in the first phase, similarities between measures collected by each sensor. In the second phase, it uses distance-based functions to find similarity between sets of collected data. The main goal of these phases is to reduce the data transmitted from both sensors and cluster-heads (CHs) in a clustering-based scheme network. To evaluate the performance of the proposed protocol, experiments on real sensor data from both terrestrial and underwater networks have been conducted. Compared to other existing techniques, simulation and real experimentations show that our protocol can be effectively used to reduce data transmission and increase network lifetime, while still keeping data integrity of the collected data.", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chen:2017:DEM, author = "Xinlei Chen and Aveek Purohit and Shijia Pan and Carlos Ruiz and Jun Han and Zheng Sun and Frank Mokaya and Patric Tague and Pei Zhang", title = "Design Experiences in Minimalistic Flying Sensor Node Platform through {SensorFly}", journal = j-TOSN, volume = "13", number = "4", pages = "33:1--33:??", month = dec, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3131779", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:49 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Indoor emergency response situations, such as urban fire, are characterized by dangerous constantly changing operating environments with little access to situational information for first responders. In situ information about the conditions, such as the extent and evolution of an indoor fire, can augment rescue efforts and reduce risk to emergency personnel. Static sensor networks that are pre-deployed or manually deployed have been proposed but are less practical due to need for large infrastructure, lack of adaptivity, and limited coverage. Controlled-mobility in sensor networks, that is, the capability of nodes to move as per network needs can provide the desired autonomy to overcome these limitations. In this article, we present SensorFly, a controlled-mobile aerial sensor network platform for indoor emergency response application. The miniature, low-cost sensor platform has capabilities to self deploy, achieve three-dimensional sensing, and adapt to node and network disruptions in harsh environments. We describe hardware design trade-offs, the software architecture, and the implementation that enables limited-capability nodes to collectively achieve application goals. Through the indoor fire monitoring application scenario, we validate that the platform can achieve coverage and sensing accuracy that matches or exceeds static sensor networks and provide higher adaptability and autonomy.", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Restuccia:2017:QIM, author = "Francesco Restuccia and Nirnay Ghosh and Shameek Bhattacharjee and Sajal K. Das and Tommaso Melodia", title = "Quality of Information in Mobile Crowdsensing: Survey and Research Challenges", journal = j-TOSN, volume = "13", number = "4", pages = "34:1--34:??", month = dec, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3139256", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Mon Jan 22 09:19:49 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Smartphones have become the most pervasive devices in people's lives and are clearly transforming the way we live and perceive technology. Today's smartphones benefit from almost ubiquitous Internet connectivity and come equipped with a plethora of inexpensive yet powerful embedded sensors, such as an accelerometer, a gyroscope, a microphone, and a camera. This unique combination has enabled revolutionary applications based on the mobile crowdsensing paradigm, such as real-time road traffic monitoring, air and noise pollution, crime control, and wildlife monitoring, just to name a few. Differently from prior sensing paradigms, humans are now the primary actors of the sensing process, since they become fundamental in retrieving reliable and up-to-date information about the event being monitored. As humans may behave unreliably or maliciously, assessing and guaranteeing Quality of Information (QoI) becomes more important than ever. In this article, we provide a new framework for defining and enforcing the QoI in mobile crowdsensing and analyze in depth the current state of the art on the topic. We also outline novel research challenges, along with possible directions of future work.", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Cheong:2018:BND, author = "Se-Hang Cheong and Yain-Whar Si", title = "Boundary Node Detection and Unfolding of Complex Non-Convex Ad Hoc Networks", journal = j-TOSN, volume = "14", number = "1", pages = "1:1--1:??", month = mar, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3154424", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:24 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Complex non-convex ad hoc networks (CNCAH) contain intersecting polygons and edges. In many instances, the layouts of these networks are not entirely convex in shape. In this article, we propose a Kamada-Kawai-based algorithm called W-KK-MS for boundary node detection problems, which is capable of aligning node positions while achieving high sensitivity, specificity, and accuracy in producing a visual drawing from the input network topology. The algorithm put forward in this article selects and assigns weights to top- k nodes in each iteration to speed up the updating process of nodes. We also propose a novel approach to detect and unfold stacked regions in CNCAH networks. Experimental results show that the proposed algorithms can achieve fast convergence on boundary node detection in CNCAH networks and are able to successfully unfold stacked regions. The design and implementation of a prototype system called ELnet for analyzing CNCAH networks is also described in this article. The ELnet system is capable of generating synthetic networks for testing, integrating with force-directed algorithms, and visualizing and analyzing algorithms' outcomes.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Koukoutsidis:2018:ESA, author = "Ioannis Koukoutsidis", title = "Estimating Spatial Averages of Environmental Parameters Based on Mobile Crowdsensing", journal = j-TOSN, volume = "14", number = "1", pages = "2:1--2:??", month = mar, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3154423", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:24 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Mobile crowdsensing can facilitate environmental surveys by leveraging sensor-equipped mobile devices that carry out measurements covering a wide area in a short time without bearing the costs of traditional field work. In this article, we examine statistical methods to perform an accurate estimate of the mean value of an environmental parameter in a region based on such measurements. The main focus is on estimates produced by considering the mobile device readings at a random instant in time. We compare stratified sampling with different stratification weights to sampling without stratification as well as an appropriately modified version of systematic sampling. Our main result is that stratification with weights proportional to stratum areas can produce significantly smaller bias for a moderate number of strata and gets arbitrarily close to the true area average as the number of mobiles increases. The performance of the methods is evaluated for an application scenario where we estimate the mean area temperature in a linear region that exhibits the so-called Urban Heat Island effect, with mobile users moving in the region according to the Random Waypoint Model.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tavakoli:2018:DIA, author = "Rasool Tavakoli and Majid Nabi and Twan Basten and Kees Goossens", title = "Dependable Interference-Aware Time-Slotted Channel Hopping for Wireless Sensor Networks", journal = j-TOSN, volume = "14", number = "1", pages = "3:1--3:??", month = mar, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3158231", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:24 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "IEEE 802.15.4 Time-Slotted Channel Hopping (TSCH) aims to improve communication reliability in Wireless Sensor Networks (WSNs) by reducing the impact of the medium access contention, multipath fading, and blocking of wireless links. While TSCH outperforms single-channel communications, cross-technology interference on the license-free ISM bands may affect the performance of TSCH-based WSNs. For applications such as in-vehicle networks for which interference is dynamic over time, it leads to non-guaranteed reliability of the communications over time. This article proposes an Enhanced version of the TSCH protocol together with a Distributed Channel Sensing technique (ETSCH+DCS) that dynamically detects good quality channels to be used for communication. The quality of channels is extracted using a combination of a central and a distributed channel-quality estimation technique. The central technique uses Non-Intrusive Channel-quality Estimation (NICE) technique that proactively performs energy detections in the idle part of each timeslot at the coordinator of the network. NICE enables ETSCH to follow dynamic interference, while it does not reduce throughput of the network. The distributed channel quality estimation technique is executed by all the nodes in the network, based on their communication history, to detect interference sources that are hidden from the coordinator. We did two sets of lab experiments with controlled interferers and a number of simulations using real-world interference datasets to evaluate ETSCH. Experimental and simulation results show that ETSCH improves reliability of network communications, compared to basic TSCH and the state-of-the-art solution. In some experimental scenarios NICE itself has been able to increase the average packet reception ratio by 22\% and shorten the length of burst packet losses by half, compared to the plain TSCH protocol. Further experiments show that DCS can reduce the effect of hidden interference (which is not detectable by NICE) on the packet reception ratio of the affected links by 50\%.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bhandari:2018:CCF, author = "Ravi Bhandari and Bhaskaran Raman and K. K. Ramakrishnan and Deepthi Chander and Naveen Aggarwal and Divya Bansal and Mahima Choudhary and Nisha Moond and Aneesh Bansal and Megha Chaudhary", title = "{CrowdLoc}: Cellular Fingerprinting for Crowds by Crowds", journal = j-TOSN, volume = "14", number = "1", pages = "4:1--4:??", month = mar, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3155326", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:24 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Determining the location of a mobile user is central to several crowd-sensing applications. Using a Global Positioning System is not only power-hungry, but also unavailable in many locations. While there has been work on cellular-based localization, we consider an unexplored opportunity to improve location accuracy by combining cellular information across multiple mobile devices located near each other. For instance, this opportunity may arise in the context of public transport units having multiple travelers. Based on theoretical analysis and an extensive experimental study on several public transportation routes in two cities, we show that combining cellular information across nearby phones considerably improves location accuracy. Combining information across phones is especially useful when a phone has to use another phone's fingerprint database, in a fingerprinting-based localization scheme. Both the median and 90 percentile errors reduce significantly. The location accuracy also improves irrespective of whether we combine information across phones connected to the same or different cellular operators. Sharing information across phones can raise privacy concerns. To address this, we have developed an id-free broadcast mechanism, using audio as a medium, to share information among mobile phones. We show that such communication can work effectively on smartphones, even in real-life, noisy-road conditions.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Illiano:2018:DRG, author = "Vittorio P. Illiano and Andrea Paudice and Luis Mu{\~n}oz-Gonz{\'a}lez and Emil C. Lupu", title = "Determining Resilience Gains From Anomaly Detection for Event Integrity in Wireless Sensor Networks", journal = j-TOSN, volume = "14", number = "1", pages = "5:1--5:??", month = mar, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3176621", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:24 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Measurements collected in a wireless sensor network (WSN) can be maliciously compromised through several attacks, but anomaly detection algorithms may provide resilience by detecting inconsistencies in the data. Anomaly detection can identify severe threats to WSN applications, provided that there is a sufficient amount of genuine information. This article presents a novel method to calculate an assurance measure for the network by estimating the maximum number of malicious measurements that can be tolerated. In previous work, the resilience of anomaly detection to malicious measurements has been tested only against arbitrary attacks, which are not necessarily sophisticated. The novel method presented here is based on an optimization algorithm, which maximizes the attack's chance of staying undetected while causing damage to the application, thus seeking the worst-case scenario for the anomaly detection algorithm. The algorithm is tested on a wildfire monitoring WSN to estimate the benefits of anomaly detection on the system's resilience. The algorithm also returns the measurements that the attacker needs to synthesize, which are studied to highlight the weak spots of anomaly detection. Finally, this article presents a novel methodology that takes in input the degree of resilience required and automatically designs the deployment that satisfies such a requirement.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Mokaya:2018:MEI, author = "Frank Mokaya and Hae Young Noh and Roland Lucas and Pei Zhang", title = "{MyoVibe}: Enabling Inertial Sensor-Based Muscle Activation Detection In High-Mobility Exercise Environments", journal = j-TOSN, volume = "14", number = "1", pages = "6:1--6:??", month = mar, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3149127", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:24 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Incorrect muscle activation can lead to sub-optimal performance, muscle imbalance, and eventually bodily injury. Consequently, assessing muscle activation is important for both excelling in exercise, athletics, and professional sports in general. Existing techniques for assessing muscle activation, such as electromyography, are invasive, requiring needles inserted directly into the muscle or electrodes that have considerable placement requirements (shaving, gels, etc.). This makes them unsuitable for active environments. In addition, factors such as body motion noise that results from the high-impact movements encountered in active sports environments easily corrupt sensor data. This compounds the unsuitability of these systems in the sports and exercise arena. As a result, such systems have been explored mostly in clinical rather than sports-based scenarios. We present MyoVibe, a system for sensing and determining muscle activation in high-mobility, high-impact exercise scenarios. MyoVibe senses and interprets multiple muscle vibration signals obtained from a wearable network of accelerometers to determine muscle activation. By utilizing a diverse feature set combined with the simple yet effective motion artifact mitigation technique, MyoVibe can reduce inertial sensor noise in these high-mobility exercises. As a result, MyoVibe can detect muscle activation with greater than 97\% accuracy.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Movassaghi:2018:OSA, author = "Samaneh Movassaghi and David B. Smith and Mehran Abolhasan and Abbas Jamalipour", title = "Opportunistic Spectrum Allocation for Interference Mitigation Amongst Coexisting Wireless Body Area Networks", journal = j-TOSN, volume = "14", number = "2", pages = "7:1--7:??", month = jul, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3139257", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless Body Area Networks (WBANs) are seen as the enabling technology for developing new generations of medical applications, such as remote health monitoring. As such it is expected that WBANs will predominantly transport mission-critical and delay sensitive data. A key strategy towards building a reliable WBAN is to ensure such networks are highly immune to interference. To achieve this, new and intelligent wireless spectrum allocation strategies are required not only to avoid interference, but also to make best-use of the limited available spectrum. This article presents a new spectrum allocation scheme referred to as Smart Channel Assignment (SCA), which maximizes the resource usage and transmission speed by deploying a partially-orthogonal channel assignment scheme between coexisting WBANs as well as offering a convenient tradeoff among spectral reuse efficiency, transmission rate, and outage. Detailed analytical studies verify that the proposed SCA strategy is robust to variations in channel conditions, increase in sensor node-density within each WBAN, and an increase in number of coexisting WBANs.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Cichon:2018:ACA, author = "Jacek Cicho{\'n} and Karol Gotfryd", title = "Average Counting via Approximate Histograms", journal = j-TOSN, volume = "14", number = "2", pages = "8:1--8:??", month = jul, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3177922", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We propose a new algorithm for the classical averaging problem for distributed wireless sensors networks. This subject has been studied extensively and there are many clever algorithms in the literature. These algorithms are based on the idea of local exchange of information. They behave well in dense networks (e.g., in networks whose connections form a complete graph), but their convergence to the real average is very slow in linear or cyclic graphs. Our solution is different. In order to calculate the average, we first build an approximate histogram of observed data; then, from this histogram, we estimate the average. In our solution, we use the extreme propagation technique and probabilistic counters. It allows us to find the approximation of the average of a set of measurements done by sensor network with arbitrary precision, controlled by two parameters. Our method requires O(D) rounds, where D is the diameter of the network. We study the message complexity of this algorithm and show that it is of order O(log n) for each node, where n is the size of the network.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chandio:2018:NWE, author = "Yasra Chandio and J{\'o} {\'A}gila Bitsch and Affan A. Syed and Muhammad Hamad Alizai", title = "Networking Wireless Energy in Embedded Networks", journal = j-TOSN, volume = "14", number = "2", pages = "9:1--9:??", month = jul, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3185753", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless energy transfer has recently emerged as a promising alternative to realize the vision of perpetual embedded sensing. However, this technology transforms the notion of energy from merely a node's local commodity to, similarly to data, a deployment-wide shareable resource. The challenges of managing a shareable energy resource are much more complicated and radically different from the research of the past decade: Besides energy-efficient operation of individual devices, we also need to optimize networkwide energy distribution. To counteract these challenges, we propose an energy stack, a layered software model for energy management in future transiently powered embedded networks. An initial specification of the energy stack, which is based on the historically successful layered approach for data networking, consists of three layers: (i) the transfer layer, which deals with the physical transfer of energy; (ii) the scheduling layer, which optimizes energy distribution over a single hop; and (iii) the network layer, creates a global view of the energy in the network for optimizing its networkwide distribution. As a contribution, we define the interfacing APIs between these layers, delineate their responsibilities, identify corresponding challenges, and provide a first implementation of the energy stack. Our evaluation, using both experimental deployments and high-level simulations, establishes the feasibility of a layered solution to energy management under transient power.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Adu-Manu:2018:EHW, author = "Kofi Sarpong Adu-Manu and Nadir Adam and Cristiano Tapparello and Hoda Ayatollahi and Wendi Heinzelman", title = "Energy-Harvesting Wireless Sensor Networks {(EH-WSNs)}: a Review", journal = j-TOSN, volume = "14", number = "2", pages = "10:1--10:??", month = jul, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3183338", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Wireless Sensor Networks (WSNs) are crucial in supporting continuous environmental monitoring, where sensor nodes are deployed and must remain operational to collect and transfer data from the environment to a base-station. However, sensor nodes have limited energy in their primary power storage unit, and this energy may be quickly drained if the sensor node remains operational over long periods of time. Therefore, the idea of harvesting ambient energy from the immediate surroundings of the deployed sensors, to recharge the batteries and to directly power the sensor nodes, has recently been proposed. The deployment of energy harvesting in environmental field systems eliminates the dependency of sensor nodes on battery power, drastically reducing the maintenance costs required to replace batteries. In this article, we review the state-of-the-art in energy-harvesting WSNs for environmental monitoring applications, including Animal Tracking, Air Quality Monitoring, Water Quality Monitoring, and Disaster Monitoring to improve the ecosystem and human life. In addition to presenting the technologies for harvesting energy from ambient sources and the protocols that can take advantage of the harvested energy, we present challenges that must be addressed to further advance energy-harvesting-based WSNs, along with some future work directions to address these challenges.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Pannuto:2018:HUW, author = "Pat Pannuto and Benjamin Kempke and Li-Xuan Chuo and David Blaauw and Prabal Dutta", title = "{Harmonium}: Ultra Wideband Pulse Generation with Bandstitched Recovery for Fast, Accurate, and Robust Indoor Localization", journal = j-TOSN, volume = "14", number = "2", pages = "11:1--11:??", month = jul, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3185752", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We introduce Harmonium, a novel ultra wideband (UWB) RF localization architecture that achieves decimeter-scale accuracy indoors. Harmonium strikes a balance between tag simplicity and processing complexity to provide fast and accurate indoor location estimates. Harmonium uses only commodity components and consists of a small, inexpensive, lightweight, and FCC-compliant UWB transmitter or tag, fixed infrastructure anchors with known locations, and centralized processing that calculates the tag's position. Anchors employ a new frequency-stepped narrowband receiver architecture that rejects narrowband interferers and extracts high-resolution timing information without the cost or complexity of traditional UWB approaches. In a complex indoor environment, 90\% of position estimates obtained with Harmonium exhibit less than 31 cm of error with an average of 9 cm of inter-sample noise. In non-line-of-sight conditions (i.e., through-wall), 90\% of position error is less than 42 cm. The tag draws 75 mW when actively transmitting, or 3.9 mJ per location fix at the 19 Hz update rate. Tags weigh 3 g and cost \$4.50 USD at modest volumes. Furthermore, VLSI-based design concepts are identified for a simple, low-power realization of the Harmonium tag to offer a roadmap for the realization of Harmonium concepts in future integrated systems. Harmonium introduces a new design point for indoor localization and enables localization of small, fast objects such as micro quadrotors, devices previously restricted to expensive optical motion capture systems.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Viswanathan:2018:EEG, author = "Sreejaya Viswanathan and Rui Tan and David K. Y. Yau", title = "Exploiting Electrical Grid for Accurate and Secure Clock Synchronization", journal = j-TOSN, volume = "14", number = "2", pages = "12:1--12:??", month = jul, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3195182", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Desynchronized clocks among network nodes in critical infrastructures can degrade system performance and even lead to safety incidents. Clock synchronization protocols based on network message exchanges, though widely used in current network systems, are susceptible to delay attacks against the packet transmission. This vulnerability cannot be solved by conventional security measures, such as encryption, and remains an open problem. This article proposes to use the sine voltage waveform of a utility power grid to synchronize network nodes connected to the same grid. Our experiments demonstrate that minute fluctuations of the voltage's cycle length encode fine-grained global time information in Singapore's utility grid. Based on this key result, we develop a clock synchronization approach that achieves good accuracy and is provably secure against packet-delay attacks. Implementation results show that our approach achieves an average synchronization error of 0.1 ms between two network nodes that are deployed in office and residential buildings 10 km apart. When the proposed system is deployed within the same floor of an office building, the error reduces to 10 \mu s. When there are heavy industrial loads close to one of the two nodes 10 km apart, the system can still maintain subsecond accuracy. Moreover, when the two nodes are deployed within the same building floor with industrial loads nearby, the average synchronization error is 34 \mu", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Li:2018:NTP, author = "Yang Li and Rui Tan and David K. Y. Yau", title = "Natural Timestamps in Powerline Electromagnetic Radiation", journal = j-TOSN, volume = "14", number = "2", pages = "13:1--13:??", month = jul, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3199676", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The continuous fluctuation of electric network frequency (ENF) presents a fingerprint indicative of time, which we call natural timestamp. This article studies the time accuracy of these natural timestamps obtained from powerline electromagnetic radiation (EMR), which is mainly excited by powerline voltage oscillations at the rate of the ENF. However, since the EMR signal is often weak and noisy, extracting the ENF is challenging, especially on resource-limited sensor platforms. We design an efficient EMR conditioning algorithm and evaluate the time accuracy of EMR natural timestamps on two representative classes of IoT platforms-a high-end single-board computer with a customized EMR antenna and a low-end mote with a normal conductor wire acting as EMR antenna. Extensive measurements at six sites in a city, which are away from each other for up to 24km, show that the high-end and low-end nodes achieve median time errors of about 50ms and 150ms, respectively. To demonstrate the use of the EMR natural timestamps, we discuss three applications: time recovery, runtime clock verification, and secure clock synchronization.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bhotto:2018:NBS, author = "MD. Zulfiquar Ali Bhotto and Wee Peng Tay", title = "Non-{Bayesian} Social Learning with Observation Reuse and Soft Switching", journal = j-TOSN, volume = "14", number = "2", pages = "14:1--14:??", month = jul, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3199513", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We propose a non-Bayesian social learning update rule for agents in a network, which minimizes the sum of the Kullback--Leibler divergence between the true distribution generating the agents' local observations and the agents' beliefs (parameterized by a hypothesis set), and a weighted varentropy-related term. The varentropy-related term allows us to control the rate of convergence of our update rule, which also reuses some of the most recent observations of each agent to speed up convergence. Under mild technical conditions, we show that the belief of each agent concentrates on the optimal hypothesis set, and we derive a bound for the convergence rate. Furthermore, to overcome the performance degradation due to misinforming agents, who use a corrupted likelihood functions in their belief updates, we propose to use multiple social networks that update their beliefs independently and a convex combination mechanism among the beliefs of all the networks. Simulations with applications to location identification and group recommendation demonstrate that our proposed methods offer improvements over two other current state-of-the art non-Bayesian social learning algorithms.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{King:2018:DCC, author = "Alex King and Utz Roedig", title = "Differentiating Clear Channel Assessment Using Transmit Power Variation", journal = j-TOSN, volume = "14", number = "2", pages = "15:1--15:??", month = jul, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3209044", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Clear Channel Assessment (CCA) is a core element of Wireless Sensor Network (WSN) Medium Access Control (MAC) protocols which is used on the transmitter and receiver sides. Current CCA implementations cannot determine the device type occupying the media, leaving nodes unable to differentiate between WSN traffic and interference. However, this would be valuable as MAC protocols benefit from reacting differently depending on the channel occupier. In this article, we describe a method called Power Differentiating Clear Channel Assessment (P-DCCA). Transmitters vary the output power of the radio while the packet is being sent. Receivers are able to identify signals with this characteristic, enabling a Differentiating Clear Channel Assessment (DCCA) check to reveal if the medium is currently occupied by WSN traffic or other interference. We present an implementation and thorough evaluation of Power P-DCCA. Using ContikiMAC as an example, we describe how P-DCCA can be integrated within MAC protocols. We show via large-scale testbed experiments and deployments that P-DCCA enabled networks have a significant improved performance. For example, we show that a P-DCCA enabled network can improve Packet Reception Rate (PRR) by up to a factor of 10 while reducing energy usage by more than 80\% under heavy interference.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Noh:2018:ISI, author = "Hae Young Noh and Xiaofan (Fred) Jiang and Pei Zhang", title = "Introduction to the Special Issue on {BuildSys'17}", journal = j-TOSN, volume = "14", number = "3--4", pages = "16:1--16:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3289594", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Andersen:2018:DAB, author = "Michael P. Andersen and John Kolb and Kaifei Chen and Gabe Fierro and David E. Culler and Randy Katz", title = "Democratizing Authority in the Built Environment", journal = j-TOSN, volume = "14", number = "3--4", pages = "17:1--17:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3199665", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Operating systems and applications in the built environment have relied upon central authorization and management mechanisms that restrict their scalability, especially with respect to administrative overhead. We propose a new set of primitives encompassing syndication, security, and service execution that unifies the management of applications and services across the built environment, while enabling participants to individually delegate privilege across multiple administrative domains with no loss of security or manageability. We show how to leverage a decentralized authorization syndication platform to extend the design of building operating systems beyond the single administrative domain of a building. The authorization system leveraged is based on blockchain smart contracts to permit decentralized and democratized delegation of authorization without central trust. Upon this, a publish/subscribe syndication tier and a containerized service execution environment are constructed. Combined, these mechanisms solve problems of delegation, federation, device protection and service execution that arise throughout the built environment. We leverage a high-fidelity city-scale emulation to verify the scalability of the authorization tier, and briefly describe a prototypical democratized operating system for the built environment using this foundation. This is an extension of work presented in Ref. [3].", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Fierro:2018:DAQ, author = "Gabe Fierro and David E. Culler", title = "Design and Analysis of a Query Processor for {Brick}", journal = j-TOSN, volume = "14", number = "3--4", pages = "18:1--18:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3199666", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Brick is a recently proposed metadata schema and ontology for describing building components and the relationships between them. It represents buildings as directed labeled graphs using the RDF data model. Using the SPARQL query language, building-agnostic applications query a Brick graph to discover the set of resources and relationships they require to operate. Latency-sensitive applications, such as user interfaces, demand response, and model-predictive control, require fast queries-conventionally less than 100ms. We benchmark a set of popular open source and commercial SPARQL databases against three real Brick models using seven application queries and find that none of them meet this performance target. This lack of performance can be attributed to design decisions that optimize for queries over large graphs consisting of billions of triples but give poor spatial locality and join performance on the small dense graphs typical of Brick. We present the design and evaluation of HodDB, a RDF/SPARQL database for Brick built over a node-based index structure. HodDB performs Brick queries 3--$ 700 \times $ faster than leading SPARQL databases and consistently meets the 100ms threshold, enabling the portability of important latency-sensitive building applications. This article is an extension of a previously published work [16].", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bhardwaj:2018:AAT, author = "Romil Bhardwaj and Gopi Krishna Tummala and Ganesan Ramalingam and Ramachandran Ramjee and Prasun Sinha", title = "{AutoCalib}: Automatic Traffic Camera Calibration at Scale", journal = j-TOSN, volume = "14", number = "3--4", pages = "19:1--19:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3199667", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Emerging smart cities are typically equipped with thousands of outdoor cameras. However, these cameras are usually not calibrated, i.e., information such as their precise mounting height and orientation is not available. Calibrating these cameras allows measurement of real-world distances from the video, thereby enabling a wide range of novel applications such as identifying speeding vehicles and city road planning. Unfortunately, robust camera calibration is a manual process today and is not scalable. In this article, we propose AutoCalib, a system for scalable, automatic calibration of traffic cameras. AutoCalib exploits deep learning to extract selected key-point features from car images in the video and uses a novel filtering and aggregation algorithm to automatically produce a robust estimate of the camera calibration parameters from just hundreds of samples. We have implemented AutoCalib as a service on Azure that takes in a video segment and computes the camera calibration parameters. Using video from real-world traffic cameras, we show that AutoCalib is able to estimate real-world distances with an error of less than 12\%.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Silva:2018:FPD, author = "Nuno Silva and Eduardo R. B. Marques and Lu{\'\i}s M. B. Lopes", title = "{Flux}: a Platform for Dynamically Reconfigurable Mobile Crowd-Sensing", journal = j-TOSN, volume = "14", number = "3--4", pages = "20:1--20:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3200202", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Flux is a platform for dynamically reconfigurable crowd-sensing using mobile devices like smartphones and tablets, programmed under a notion of region-based sensing. Each region is defined by a set of physical constraints that determine the sensing scope, e.g., based on device position or other environmental variables, plus a set of periodic tasks that perform the actual sensing. The resulting behavior is inherently dynamic: as a device's state changes, e.g., moves in space, it enters and/or leaves different regions, thereby changing the set of active tasks; moreover, regions can be added, deleted, and reprogrammed on-the-fly. Flux makes use of a domain-specific language for sensing tasks that is compiled into abstract bytecode, later executed by a low-footprint virtual machine within a device, guaranteeing runtime safety by construction. For region/task dissemination, Flux employs a broker that holds a changeable region configuration plus gateways that mirror the configuration throughout different network access points to which devices connect. Sensing data is streamed by devices to gateways and then back to the broker. Live or archived data streams are in turn fed by the broker to data-processing clients, which interface with the broker using a publish/subscribe API. We conducted two case-study experiments illustrating Flux: a single-region deployment to monitor WiFi signal quality, and a multi-region deployment to monitor noise, temperature, and places-of-interest based on device movement.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Arief-Ang:2018:SRO, author = "Irvan B. Arief-Ang and Margaret Hamilton and Flora D. Salim", title = "A Scalable Room Occupancy Prediction with Transferable Time Series Decomposition of {CO$_2$} Sensor Data", journal = j-TOSN, volume = "14", number = "3--4", pages = "21:1--21:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3217214", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Human occupancy counting is crucial for both space utilisation and building energy optimisation. In the current article, we present a semi-supervised domain adaptation method for carbon dioxide --- Human Occupancy Counter Plus Plus (DA-HOC++), a robust way to estimate the number of people within one room by using data from a carbon dioxide sensor. In our previous work, the proposed Seasonal Decomposition for Human Occupancy Counting (SD-HOC) model can accurately predict the number of individuals when the training and labelled data are adequately available. DA-HOC++ is able to predict the number of occupants with minimal training data: as little as 1 day's data. DA-HOC++ accurately predicts indoor human occupancy for five different rooms across different countries using a model trained from a small room and adapted to other rooms. We evaluate DA-HOC++ with two baseline methods: a support vector regression technique and an SD-HOC model. The results demonstrate that DA-HOC++'s performance on average is better by 10.87\% in comparison to SVR and 8.65\% in comparison to SD-HOC.", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wei:2018:SSA, author = "Peter Wei and Xiaoqi Chen and Jordan Vega and Stephen Xia and Rishikanth Chandrasekaran and Xiaofan Jiang", title = "A Scalable System for Apportionment and Tracking of Energy Footprints in Commercial Buildings", journal = j-TOSN, volume = "14", number = "3--4", pages = "22:1--22:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3218582", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We propose a system that tracks each occupant's personal share of energy use, or ``energy footprint,'' inside commercial building environments and provides insights to occupants on the real-time energy impact of their actions. We propose a new space-centric policy for fair apportionment of energy in shared environments and demonstrate a method for automatically determining space-centric energy zones. In this work, we design and implement ePrints, a system for tracking personalized energy usage in real-time. ePrints supports different apportionment policies, with microsecond-level footprint computation time and graceful scaling with size of building, frequency of energy updates, and rate of occupant location changes. Finally, we present applications enabled by our system, such as mobile and wearable applications to provide users timely feedback on the energy impacts of their actions, as well as applications to provide energy saving suggestions and inform building-level policies.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Han:2018:SHO, author = "Jun Han and Shijia Pan and Manal Kumar Sinha and Hae Young Noh and Pei Zhang and Patrick Tague", title = "Smart Home Occupant Identification via Sensor Fusion Across On-Object Devices", journal = j-TOSN, volume = "14", number = "3--4", pages = "23:1--23:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3218584", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Occupant identification proves crucial in many smart home applications such as automated home control and activity recognition. Previous solutions are limited in terms of deployment costs, identification accuracy, or usability. We propose SenseTribute, a novel occupant identification solution that makes use of existing and prevalent on-object sensors that are originally designed to monitor the status of objects to which they are attached. SenseTribute extracts richer information content from such on-object sensors and analyzes the data to accurately identify the person interacting with the objects. This approach is based on the physical phenomenon that different occupants interact with objects in different ways. Moreover, SenseTribute may not rely on users' true identities, so the approach works even without labeled training data. However, resolution of information from a single on-object sensor may not be sufficient to differentiate occupants, which may lead to errors in identification. To overcome this problem, SenseTribute operates over a sequence of events within a user activity, leveraging recent work on activity segmentation. We evaluate SenseTribute using real-world experiments by deploying sensors on five distinct objects in a kitchen and inviting participants to interact with the objects. We demonstrate that SenseTribute can correctly identify occupants in 96\% of trials without labeled training data, while per-sensor identification yields only 74\% accuracy even with training data.", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Kuppannagari:2018:ODN, author = "Sanmukh R. Kuppannagari and Rajgopal Kannan and Viktor K. Prasanna", title = "Optimal Discrete Net-Load Balancing in Smart Grids with High {PV} Penetration", journal = j-TOSN, volume = "14", number = "3--4", pages = "24:1--24:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3218583", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Mitigating supply-demand mismatch is critical for smooth power grid operation. Traditionally, load curtailment techniques such as demand response have been used for this purpose. However, these cannot be the only component of a net-load balancing framework for smart grids with high PV penetration. These grids sometimes exhibit supply surplus, causing overvoltages. Currently, these are mitigated using voltage manipulation techniques such as Volt-Var Optimizations, which are computationally expensive, thereby increasing the complexity of grid operations. Taking advantage of recent technological developments that enable rapid selective connection of PV modules of an installation to the grid, we develop a unified net-load balancing framework that performs both load and solar curtailment. We show that when the available curtailment values are discrete, this problem is NP-hard and we develop bounded approximation algorithms. Our algorithms produce fast solutions, given the tight timing constraints required for grid operation, while ensuring that practical constraints such as fairness, network capacity limits, and so forth are satisfied. We also develop an online algorithm that performs net-load balancing using only data available for the current interval. Using both theoretical analysis and practical evaluations, we show that our net-load balancing algorithms provide solutions that are close to optimal in a small amount of time.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bashir:2018:MPC, author = "Noman Bashir and David Irwin and Prashant Shenoy and Jay Taneja", title = "Mechanisms and Policies for Controlling Distributed Solar Capacity", journal = j-TOSN, volume = "14", number = "3--4", pages = "25:1--25:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3219811", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The rapid expansion of intermittent grid-tied solar capacity is making the job of balancing electricity's real-time supply and demand increasingly challenging. Recent work proposes mechanisms for actively controlling solar power in the grid at individual sites by enabling software to cap it as a fraction of its time-varying maximum output. However, while enforcing an equal fraction of each solar site's time-varying maximum output results in ``fair'' short-term contributions of solar power across all sites, it does not result in ``fair'' long-term contributions of solar energy. Enforcing fair long-term energy access is important when controlling distributed solar capacity, since limits on solar output impact the compensation users receive for net metering and the battery capacity required to store excess solar energy. This discrepancy arises from fundamental differences in enforcing ``fair'' access to the grid to contribute solar energy, compared to analogous fair sharing in networks and processors. To address the problem, we first present both a centralized and distributed algorithm to enable control of distributed solar capacity that enforces fair grid energy access. We then present multiple policies that show how utilities can leverage this new distributed rate-limiting mechanism to reduce variations in grid demand from intermittent solar generation.", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Abbas:2018:IHG, author = "Samar Abbas and Abu Bakar and Yasra Chandio and Khadija Hafeez and Ayesha Ali and Tariq M. Jadoon and Muhammad Hamad Alizai", title = "Inverted {HVAC}: Greenifying Older Buildings, One Room at a Time", journal = j-TOSN, volume = "14", number = "3--4", pages = "26:1--26:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3229063", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Emerging countries predominantly rely on room-level air conditioning units (window ACs, space heaters, ceiling fans) for thermal comfort. These distributed units have manual, decentralized control leading to suboptimal energy usage for two reasons: excessive setpoints by individuals and inability to interleave different conditioning units for energy savings. We propose a novel inverted HVAC approach: cheaply retrofitting these distributed units with ``on-off'' control and providing centralized control augmented with room and environmental sensors. Our binary control approach exploits an understanding of device consumption characteristics and factors this into the control algorithms to reduce consumption. We implement this approach as Hawadaar in a prototype 180ft$^2$ room to evaluate its efficacy over a 7-month period experiencing both hot and cold climates. Through a post analysis, we show that our on-off algorithms are not far from a theoretically optimal approach based on a priori information that precisely knows the optimal control points to minimize consumption. We collect enough evidence to plausibly scale our empirical evaluation, demonstrating countrywide benefits: with just 20\% market penetration, Hawadaar can save up to 6\% of electricity per capita in residential and commercial sectors-resulting in a substantial countrywide impact.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Khalil:2018:SPI, author = "Nacer Khalil and Omprakash Gnawali and Driss Benhaddou and Jaspal Subhlok", title = "{SonicDoor}: a Person Identification System Based on Modeling of Shape, Behavior, and Walking Patterns", journal = j-TOSN, volume = "14", number = "3--4", pages = "27:1--27:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3229064", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Non-intrusive occupant identification enables numerous applications in Smart Buildings such as personalization of climate and lighting. Current techniques do not scale beyond 20 people, whereas commercial buildings have 100 or more people. This article proposes a new method to identify occupants by sensing their body shape, movement, and walking patterns as they walk through a SonicDoor, a door instrumented with three ultrasonic sensors. The proposed method infers contextual information, such as paths and historical walks through different doors of the building. Each SonicDoor is instrumented with ultrasonic ping sensors, one on top sensing height and two on the sides of the door sensing width of the person walking through the door. SonicDoor detects a walking event and analyzes it to infer whether the Walker is using a phone, holding a handbag, or wearing a backpack. It extracts a set of features from the walking event and corrects them using a set of transformation functions to mitigate the bias. We deployed five SonicDoors in a real building for two months and collected data consisting of over 9,000 walking events spanning over 170 people. The proposed method identifies 100 occupants with an accuracy of 90.2\%, which makes it suitable for commercial buildings.", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Cauchi:2018:MSB, author = "Nathalie Cauchi and Khaza Anuarul Hoque and Marielle Stoelinga and Alessandro Abate", title = "Maintenance of Smart Buildings using Fault Trees", journal = j-TOSN, volume = "14", number = "3--4", pages = "28:1--28:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3232616", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Timely maintenance is an important means of increasing system dependability and life span. Fault Maintenance trees (FMTs) are an innovative framework incorporating both maintenance strategies and degradation models and serve as a good planning platform for balancing total costs (operational and maintenance) with dependability of a system. In this work, we apply the FMT formalism to a Smart Building application and propose a framework that efficiently encodes the FMT into Continuous Time Markov Chains. This allows us to obtain system dependability metrics such as system reliability and mean time to failure, as well as costs of maintenance and failures over time, for different maintenance policies. We illustrate the pertinence of our approach by evaluating various dependability metrics and maintenance strategies of a Heating, Ventilation, and Air-Conditioning system.", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Hu:2018:SIC, author = "Chuang Hu and Wei Bao and Dan Wang and Yi Qian and Muqiao Zheng and Shi Wang", title = "{sTube+}: an {IoT} Communication Sharing Architecture for Smart After-sales Maintenance in Buildings", journal = j-TOSN, volume = "14", number = "3--4", pages = "29:1--29:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3274283", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Nowadays, manufacturers want to send the data of their products to the cloud so that they can conduct analysis and improve their operation, maintenance, and services. Manufacturers are looking for a self-contained solution. This is because their products are deployed in a large number of different buildings, and it is neither feasible for a vendor to negotiate with each building to use the building's network (e.g., WiFi) nor practical to establish its own network infrastructure. The vendor can rent a dedicated channel from an ISP to act as a thing-to-cloud communication (TCC) link for each of its IoT devices. The readily available choices, e.g., 3G, is over costly for most IoT devices. ISPs are developing cheaper choices for TCC links, yet we expect that the number of choices for TCC links will be small as compared to hundreds or thousands of requirements on different costs and data rates from IoT applications. We address this issue by proposing a communication sharing architecture sTube+, sharing tube. The objective of sTube+ is to organize a greater number of IoT devices, with heterogeneous data communication and cost requirements, to efficiently share fewer choices of TCC links and transmit their data to the cloud. We take a design of centralized price optimization and distributed network control. More specifically, we architect a layered architecture for data delivery, develop algorithms to optimize the overall monetary cost, and prototype a fully functioning system of sTube+. We evaluate sTube+ by both experiments and simulations. In addition, we develop a case study on smart maintenance of chillers and pumps, using sTube+ as the underlying network architecture.", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Sangogboye:2018:FPP, author = "Fisayo Caleb Sangogboye and Ruoxi Jia and Tianzhen Hong and Costas Spanos and Mikkel Baun Kj{\ae}rgaard", title = "A Framework for Privacy-Preserving Data Publishing with Enhanced Utility for Cyber-Physical Systems", journal = j-TOSN, volume = "14", number = "3--4", pages = "30:1--30:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3275520", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Cyber-physical systems have enabled the collection of massive amounts of data in an unprecedented level of spatial and temporal granularity. Publishing these data can prosper big data research, which, in turn, helps improve overall system efficiency and resiliency. The main challenge in data publishing is to ensure the usefulness of published data while providing necessary privacy protection. In our previous work (Jia et al. 2017a), we presented a privacy-preserving data publishing framework (referred to as PAD hereinafter), which can guarantee k -anonymity while achieving better data utility than traditional anonymization techniques. PAD learns the information of interest to data users or features from their interactions with the data publishing system and then customizes data publishing processes to the intended use of data. However, our previous work is only applicable to the case where the desired features are linear in the original data record. In this article, we extend PAD to nonlinear features. Our experiments demonstrate that for various data-driven applications, PAD can achieve enhanced utility while remaining highly resilient to privacy threats.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Shah:2018:DGC, author = "Vijay K. Shah and Shameek Bhattacharjee and Simone Silvestri and Sajal K. Das", title = "Designing Green Communication Systems for Smart and Connected Communities via Dynamic Spectrum Access", journal = j-TOSN, volume = "14", number = "3--4", pages = "31:1--31:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3274284", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Smart and connected communities (SCCs) are emerging as a novel paradigm that allows the community residents to be connected with surrounding environments through smart technologies. However, there remain important challenges to fully exploit the potential of SCCs in improving societal well-being and prosperity. In particular, there is a need for designing green communication systems that are also capable of providing high quality of service (QoS) to distribute and collect information to and from SCCs. However, simultaneously satisfying both of these criteria is difficult due to varying demands posed by heterogeneous sensing modalities, lack of dedicated infrastructure in rural/sub-urban areas, and certain sustainability constraints. While low-power short-range technologies often fail to achieve high QoS, using 3G or 4G technologies (LTE, LTE-A, GSM) for SCCs will eventually face spectrum scarcity and cross technology interference. In recent times, Dynamic spectrum access (DSA) has been proposed as a solution to overcome policy constraints and improve spectrum scarcity by spectrum sharing. In this article, we show that harnessing DSA in the context of SCCs can also achieve notable benefits in terms of energy efficiency and sustainability. Specifically, we propose a novel architecture for designing sustainable SCCs using a small-scale DSA-enabled overlay network that improves end-to-end energy efficiency of the network while guaranteeing QoS. We also propose a dynamic spectrum band selection approach that intelligently matches any message requirement to a suitable band type by exploiting distinct electro-magnetic characteristics of various bands. Since data generated in SCCs are typically valuable only when delivered within a certain hard (or soft ) deadline, we formulate a linear optimization problem for determining the most energy-efficient path that ensures a delivery time within the hard deadline. After proving that such a problem is NP-Hard, we propose an exact pseudo-polynomial time dynamic programming algorithm to solve it followed by a polynomial time greedy heuristic. Additionally, we formulate a non-linear optimization problem to find the optimal path when the message delivery time is defined as a soft deadline and extend our greedy heuristic to handle soft deadlines. Compared to the homogeneous band access approaches that opportunistically access free channels within a given spectrum band, our extensive simulation study shows that the proposed dynamic multi-band selection approach significantly improves the achievable energy efficiency while meeting various hard and soft deadlines.", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Teng:2019:CTU, author = "Xiaoqiang Teng and Deke Guo and Yulan Guo and Xiaolei Zhou and Zhong Liu", title = "{CloudNavi}: Toward Ubiquitous Indoor Navigation Service with {$3$D} Point Clouds", journal = j-TOSN, volume = "15", number = "1", pages = "1:1--1:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3216722", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3216722", abstract = "The rapid development of mobile computing has prompted indoor navigation to be one of the most attractive and promising applications. Conventional designs of indoor navigation systems depend on either infrastructures or indoor floor maps. This article presents CloudNavi, a ubiquitous indoor navigation solution, which relies on the point clouds acquired by the 3D camera embedded in a mobile device. Particularly, CloudNavi first efficiently infers the walking trace of each user from captured point clouds and inertial data. Many shared walking traces and associated point clouds are combined to generate the point cloud traces, which are then used to generate a 3D path-map. Accordingly, CloudNavi can accurately estimate the location of a user by fusing point clouds and inertial data using a particle filter algorithm and then guiding the user to its destination from its current location. Extensive experiments are conducted on office building and shopping mall datasets. Experimental results indicate that CloudNavi exhibits outstanding navigation performance in both office buildings and shopping malls and obtains around 34\% improvement compared with the state-of-the-art method.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhang:2019:DEF, author = "Qingquan Zhang and Yao Yao and Ting Zhu and Ziqiao Zhou and Wei Xu and Ping Yi and Sheng Xiao", title = "Dynamic Enhanced Field Division: an Advanced Localizing and Tracking Middleware", journal = j-TOSN, volume = "15", number = "1", pages = "2:1--2:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3216721", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3216721", abstract = "Tracking moving objects is always a critical challenge in cyber-physical systems. Researchers have proposed many tracking algorithms. However, most of the proposed algorithms cannot be used for on-demand deployment because of the unavailable preset fingerprints (prior landmark or context information) in their assumption. Another issue is that those algorithms with models built in an interference-free environment cannot work in interference-rich environments. To address those issues, we propose a localizing and tracking algorithm called Enhanced Field Division (EFD), which dynamically divides the field into areas with unique signatures and tracks the target without any fingerprints. We also implemented a proof-of-concept localization platform to demonstrate the tracking accuracy and the algorithm performance in practical, interference-rich environments.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Tiloca:2019:DDS, author = "Marco Tiloca and Domenico {De Guglielmo} and Gianluca Dini and Giuseppe Anastasi and Sajal K. Das", title = "{DISH}: {DIstributed SHuffling} Against Selective Jamming Attack in {IEEE 802.15.4e TSCH} Networks", journal = j-TOSN, volume = "15", number = "1", pages = "3:1--3:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3241052", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3241052", abstract = "The MAC standard amendment IEEE 802.15.4e is designed to meet the requirements of industrial and critical applications. In particular, the Time Slotted Channel Hopping (TSCH) mode divides time into periodic, equally sized, slotframes composed of transmission timeslots. Then, it combines time slotted access with multichannel and channel hopping capabilities, providing large network capacity, high reliability, and predictable latency while ensuring energy efficiency. Since every network node considers the same timeslots at each slotframe and selects physical channels according to a periodic function, TSCH produces a steady channel utilization pattern. This can be exploited by a selective jammer to entirely thwart communications of a victim node in a way that is stealthy, effective, and extremely energy efficient. This article shows how a selective jamming attack can be successfully performed even though TSCH uses the IEEE 802.15.4e security services. Furthermore, we propose DISH, a countermeasure which randomly permutes the timeslot and channel utilization patterns at every slotframe in a consistent and completely distributed way without requiring any additional message exchange. We have implemented DISH for the Contiki OS and tested its effectiveness on TelosB sensor nodes. Quantitative analysis for different network configurations shows that DISH effectively contrasts selective jamming with negligible performance penalty.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Silvestri:2019:FIS, author = "Simone Silvestri and Rahul Urgaonkar and Murtaza Zafer and Bong Jun Ko", title = "A Framework for the Inference of Sensing Measurements Based on Correlation", journal = j-TOSN, volume = "15", number = "1", pages = "4:1--4:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3272035", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3272035", abstract = "Sensor networks are commonly adopted to collect a variety of measurements in indoor and outdoor settings. However, collecting such measurements from every node in the network, although providing high accuracy and resolution of the phenomena of interest, may easily cause sensors' battery depletion. In this article, we show that measurement correlation can be successfully exploited to reduce the amount of data collected in the network without significantly sacrificing the monitoring accuracy. In particular, we propose an online adaptive measurement technique with which a subset of nodes are dynamically chosen as monitors while the measurements of the remaining nodes are estimated using the computed correlations. We propose an estimation framework based on jointly Gaussian distributed random variables, and we formulate an optimization problem to select the monitors under a total cost constraint. We show that the problem is NP-Hard and propose three efficient heuristics. We also develop statistical approaches that automatically switch between learning and estimation phases to take into account the variability occurring in real networks. Simulations carried out on real-world traces show that our approach outperforms previous solutions based on compressed sensing, and it can be successfully applied to the real application of solar irradiance prediction of photovoltaics systems.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Restuccia:2019:FFO, author = "Francesco Restuccia and Pierluca Ferraro and Timothy S. Sanders and Simone Silvestri and Sajal K. Das and Giuseppe {Lo Re}", title = "{FIRST}: a Framework for Optimizing Information Quality in Mobile Crowdsensing Systems", journal = j-TOSN, volume = "15", number = "1", pages = "5:1--5:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3267105", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3267105", abstract = "Thanks to the collective action of participating smartphone users, mobile crowdsensing allows data collection at a scale and pace that was once impossible. The biggest challenge to overcome in mobile crowdsensing is that participants may exhibit malicious or unreliable behavior, thus compromising the accuracy of the data collection process. Therefore, it becomes imperative to design algorithms to accurately classify between reliable and unreliable sensing reports. To address this crucial issue, we propose a novel Framework for optimizing Information Reliability in Smartphone-based participaTory sensing (FIRST) that leverages mobile trusted participants (MTPs) to securely assess the reliability of sensing reports. FIRST models and solves the challenging problem of determining before deployment the minimum number of MTPs to be used to achieve desired classification accuracy. After a rigorous mathematical study of its performance, we extensively evaluate FIRST through an implementation in iOS and Android of a room occupancy monitoring system and through simulations with real-world mobility traces. Experimental results demonstrate that FIRST reduces significantly the impact of three security attacks (i.e., corruption, on/off, and collusion) by achieving a classification accuracy of almost 80\% in the considered scenarios. Finally, we discuss our ongoing research efforts to test the performance of FIRST as part of the National Map Corps project.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Saifullah:2019:CEW, author = "Abusayeed Saifullah and Sriram Sankar and Jie Liu and Chenyang Lu and Ranveer Chandra and Bodhi Priyantha", title = "{CapNet}: Exploiting Wireless Sensor Networks for Data Center Power Capping", journal = j-TOSN, volume = "15", number = "1", pages = "6:1--6:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3278624", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3278624", abstract = "As the scale and density of data centers continue to grow, cost-effective data center management (DCM) is becoming a significant challenge for enterprises hosting large-scale online and cloud services. Machines need to be monitored, and the scale of operations mandates an automated management with high reliability and real-time performance. The limitations of today's typical DCM network are many-fold. Primarily, it is a fixed wired network, and hence scaling it for a large number of servers increases its cost. In addition, with server densities increasing over recent years, this network also has to be cabled correctly and the management of this network parallels the complexity of managing a data network, since it needs to be networked with multiple switches and routers. In this article, we propose a wireless sensor network as a cost-effective networking solution for DCM while satisfying the reliability and latency performance requirements of DCM. We have developed CapNet, a real-time wireless sensor network for power capping, a time-critical DCM function for power management in a cluster of servers. CapNet employs an efficient event-driven protocol that triggers data collection only on the detection of a potential power capping event. We deploy and evaluate CapNet in a data center. Using server power traces, our experimental results on a cluster of 480 servers inside the data center show that CapNet can meet the real-time requirements of power capping. CapNet demonstrates the feasibility and efficacy of wireless sensor networks for time-critical DCM applications.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liu:2019:GFS, author = "Yunhuai Liu and Qian Zhang and Lionel Ni", title = "A General Framework for Spectrum Sensing Using Dedicated Spectrum Sensor Networks", journal = j-TOSN, volume = "15", number = "1", pages = "7:1--7:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3275244", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3275244", abstract = "Efficient spectrum sensing is essential for the successful application of the Dynamic Spectrum Assignment (DSA) technology in Cognitive Radio Networks (CRNs). In conventional spectrum sensing schemes, secondary users (SUs) have to intelligently schedule their sensing and accessing so that the spectrum opportunities are thoroughly exploited while the primary users are not harmed. In this article, we propose a new sensing service model in which a Spectrum Sensor Network (SSN) is employed for spectrum sensing tasks. We will describe the general framework for this SSN-enabled CRN and present the major challenges in such an architecture. We will address one of these challenges and formulate it as a boundary detection problem with unknown erroneous inputs. A novel cooperative boundary detection algorithm is designed which explores recent advances in Support Vector Machines (SVM) and computational geometry. We prove that cooperative spectrum sensing can asymptotically approach the optimal solution. Real testbed as well as comprehensive simulation experiments are conducted, and the results show that, compared with the traditional schemes, cooperative boundary detection can dramatically reduce the spectrum sensing overhead and improve the effectiveness of DSA.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Jiang:2019:MED, author = "Shiqi Jiang and Zhenjiang Li and Pengfei Zhou and Mo Li", title = "{Memento}: an Emotion-driven Lifelogging System with Wearables", journal = j-TOSN, volume = "15", number = "1", pages = "8:1--8:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3281630", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3281630", abstract = "Due to the increasing popularity of mobile devices, the usage of lifelogging has dramatically expanded. People collect their daily memorial moments and share with friends on the social network, which is an emerging lifestyle. We see great potential of lifelogging applications along with rapid recent growth of the wearables market, where more sensors are introduced to wearables, i.e., electroencephalogram (EEG) sensors, that can further sense the user's mental activities, e.g., emotions. In this article, we present the design and implementation of Memento, an emotion-driven lifelogging system on wearables. Memento integrates EEG sensors with smart glasses. Since memorable moments usually coincides with the user's emotional changes, Memento leverages the knowledge from the brain-computer-interface domain to analyze the EEG signals to infer emotions and automatically launch lifelogging based on that. Towards building Memento on Commercial off-the-shelf wearable devices, we study EEG signals in mobility cases and propose a multiple sensor fusion based approach to estimate signal quality. We present a customized two-phase emotion recognition architecture, considering both the affordability and efficiency of wearable-class devices. We also discuss the optimization framework to automatically choose and configure the suitable lifelogging method (video, audio, or image) by analyzing the environment and system context. Finally, our experimental evaluation shows that Memento is responsive, efficient, and user-friendly on wearables.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Miao:2019:PPT, author = "Chenglin Miao and Wenjun Jiang and Lu Su and Yaliang Li and Suxin Guo and Zhan Qin and Houping Xiao and Jing Gao and Kui Ren", title = "Privacy-Preserving Truth Discovery in Crowd Sensing Systems", journal = j-TOSN, volume = "15", number = "1", pages = "9:1--9:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3277505", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3277505", abstract = "The recent proliferation of human-carried mobile devices has given rise to the crowd sensing systems. However, the sensory data provided by individual participants are usually not reliable. To better utilize such sensory data, the topic of truth discovery, whose goal is to estimate user quality and infer reliable aggregated results through quality-aware data aggregation, has drawn significant attention. Though able to improve aggregation accuracy, existing truth discovery approaches fail to address the privacy concerns of individual users. In this article, we propose a novel privacy-preserving truth discovery (PPTD) framework, which can protect not only users' sensory data but also their reliability scores derived by the truth discovery approaches. The key idea of the proposed framework is to perform weighted aggregation on users' encrypted data using a homomorphic cryptosystem, which can guarantee both high accuracy and strong privacy protection. In order to deal with large-scale data, we also propose to parallelize PPTD with MapReduce framework. Additionally, we design an incremental PPTD scheme for the scenarios where the sensory data are collected in a streaming manner. Extensive experiments based on two real-world crowd sensing systems demonstrate that the proposed framework can generate accurate aggregated results while protecting users' private information.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhang:2019:WEM, author = "Qian Zhang and Fan Li and Song Yang and Yu Wang", title = "{W3W}: Energy Management of Hybrid Energy Supplied Sensors for {Internet of Things}", journal = j-TOSN, volume = "15", number = "1", pages = "10:1--10:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3280964", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3280964", abstract = "The usage of hybrid energy supplied sensors in the Internet of Things has enabled longer lifetime of sensors and expanded scope of applications. These sensors can combine advantages of environmental energy harvesting techniques and wireless energy harvesting techniques. However, how to coordinate them is still a challenge and has not been studied extensively. In this article, we present a system based on mobile crowd wireless charging to manage energy of hybrid energy supplied sensors. When environmental energy is insufficient, the system will utilize smart devices carried by mobile users as chargers to provide wireless energy. We construct and study a W3W problem in the system: when to leverage mobile crowd wireless charging to support rechargeable sensors, where to perform wireless energy transfer, and whom to allocate and incentivize as chargers to maximize useful energy value over all sensors subject to a budget. In order to control the actual quality of wireless energy charging, we propose a design principle named task completion trustfulness. We consider offline and online conditions and design corresponding algorithms with incentive allocations. Extensive simulations are conducted to demonstrate the effectiveness of our algorithms, which also validates our theoretical results.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{He:2019:EBS, author = "Liang He and Linghe Kong and Yu Gu and Cong Liu and Tian He and Kang G. Shin", title = "Extending Battery System Operation via Adaptive Reconfiguration", journal = j-TOSN, volume = "15", number = "1", pages = "11:1--11:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3284556", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3284556", abstract = "Large-scale battery packs are commonly used in applications such as electric vehicles (EVs) and smart grids. Traditionally, to provide stable voltage to the loads, voltage regulators are used to convert battery packs' output voltage to those of the loads' required levels, causing power loss especially when the difference between the supplied and required voltages is large or when the load is light. In this article, we address this issue via a reconfiguration framework for the battery system. By abstracting the battery system as a cell graph, we develop an adaptive reconfiguration algorithm to identify the desired system configurations based on real-time load requirements. Our design is evaluated via both prototype-based experiments, EV driving trace-based emulations, and large-scale simulations. The results demonstrate an extended system operation time of up to $ 5 \times $, especially when facing severe cell imbalance.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Leng:2019:NMM, author = "Quan Leng and Wei-Ju Chen and Pei-Chi Huang and Yi-Hung Wei and Aloysius K. Mok and Song Han", title = "Network Management of Multicluster {RT-WiFi} Networks", journal = j-TOSN, volume = "15", number = "1", pages = "12:1--12:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3283451", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3283451", abstract = "Applying wireless technologies in cyber-physical systems (CPSs) has received significant attention in recent years. In our previous work, a high-speed and flexible real-time wireless communication protocol called RT-WiFi was designed to support a wide range of CPSs, and we presented an implementation with a single access point (AP). To serve the CPS applications with communication nodes geographically distributed over a large area, multicluster RT-WiFi networks with multiple APs need to be deployed. Although effective scheduling algorithms have been designed to schedule tasks in RT-WiFi networks with a single AP, uncoordinated packet transmissions from multicluster RT-WiFi networks may suffer from cochannel interferences that cause performance degradation. The multicluster RT-WiFi network management problem is to resolve the cochannel interference through channel assignment for clusters and through phasing assignment for communication tasks. In this article, we first derive a conjunctive normal form encoding of the problem and design a TScheduler that searches feasible solutions through the SAT solver. A novel LRTree Scheduler is further designed to solve the problem in chain graphs while keeping the number of used channels small and the network management overhead low. A testbed of the multicluster RT-WiFi network is deployed to validate the design of the multicluster RT-WiFi network and evaluate the performance of the proposed scheduling algorithms compared to the contention-based methods in regular WiFi networks. Performance of these scheduling algorithms in large-scale networks is further evaluated through extensive simulations on both static and dynamic multicluster RT-WiFi networks.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Jia:2019:ORC, author = "Riheng Jia and Jinbei Zhang and Xiao-Yang Liu and Peng Liu and Luoyi Fu and Xinbing Wang", title = "Optimal Rate Control for Energy-Harvesting Systems with Random Data and Energy Arrivals", journal = j-TOSN, volume = "15", number = "1", pages = "13:1--13:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3293535", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3293535", abstract = "Due to the random and dynamic energy-harvesting process, it is challenging to conduct optimal rate control in Energy-Harvesting Communication Systems (EHCSs). Existing works mainly focus on two cases: (1) the traffic load is infinite (as long as there is energy, there is data to transmit), in which the objective is to optimize the rate control policy subject to the dynamic energy arrivals, thus maximizing the average system throughput; and (2) the traffic load is finite, in which the objective is to optimize the rate control policy, thus minimizing the time by which all packets are delivered. In this work, we focus on the optimal rate control of EHCSs from another important and practical perspective, where the data and energy arrivals are both random. Given any deadline of T, our goal is to maximize the total throughput in [0, T ]. Specifically, two scenarios are considered: (1) energy is ready before the transmission; and (2) energy arrives randomly during the transmission. In both scenarios, we assume that the data arrive randomly during the transmission. For the first scenario, we develop a novel Stepwise Searching Algorithm (SSA) based on the cumulative curve methodology, which is shown to achieve the optimal solution and the complexity grows only linearly with the problem size. In addition, the SSA can provide a simple and appealing graphical visualization of approximating the optimal solution. For the second scenario, we provide a simplified case study that can be solved by the SSA with low computation overhead and demonstrate the difficulties in solving the general setting, which initiates a first step toward the full understanding of the scenario when energy arrives randomly during the transmission.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liu:2019:ROA, author = "Yang Liu and Yonghang Jiang and Zhenjiang Li and Jianping Wang", title = "Rulers on Our Arms: Waving to Measure Object Size through Contactless Sensing", journal = j-TOSN, volume = "15", number = "1", pages = "14:1--14:??", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3289183", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3289183", abstract = "In this article, we propose a mobile system, Aware, which turns our wearable or mobile device into a ruler. It can estimate the size of objects that could be large in size and not directly touchable by the user. Such a design will enable a rich set of applications that count on the size information of surrounding environments/objects. Aware purely utilizes the motion sensors on the device for object size measures. It can also integrate with the crowdsourcing feature for both performance improvement and result sharing. We propose a series of key techniques to address three major challenges in the Aware design: (1) user's angle of line-of-sights to the object is used in the size measure but motion sensors track only the angle of arm's waving, (2) motion sensors are noisy that require novel and effective data processing techniques, otherwise the errors could easily overwhelm the final result, and (3) in the crowdsourcing mode, Aware needs to identify vicinal objects of similar sizes and effectively fuse the measured sizes that correspond to the same object. We consolidate the above designs and implement Aware on Android platforms. Extensive experiments with four users show that Aware can achieve accurate measurement performance for the objects of various sizes in both indoor and outdoor environments.", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Li:2019:RCF, author = "Lanlan Li and Haipeng Dai and Guihai Chen and Jiaqi Zheng and Wanchun Dou and Xiaobing Wu", title = "Radiation Constrained Fair Charging for Wireless Power Transfer", journal = j-TOSN, volume = "15", number = "2", pages = "15:1--15:??", month = apr, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3289182", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3289182", abstract = "Recently, wireless power transfer technology (WPT) has attracted considerable attention and become a promising technology to prolong the lifetime of wireless sensor networks (WSNs) by providing perpetual energy to sensors. However, electromagnetic radiation (EMR) incurred by WPT is largely overlooked in most of the existing literature. In this article, we first propose and study the radiation constrained fair charging problem for WPT, i.e., maximizing the minimum utility of sensors by adjusting the power of wireless chargers with no EMR intensity at any location in the field exceeding a given threshold $ R_t $. To address this problem, we first adopt an area discretization method to transform it from nonlinear to linear. Then, we propose four algorithms to deal with the reformulated problem, i.e., 1/3 and 1/4 Approximation Algorithms, Primal-Dual algorithm, and area division algorithm. In particular, the area division algorithm is not only fully distributed but also provably achieves an approximation ratio of (1 --- \epsilon ). Further, we conduct extensive simulations and build a field testbed to verify our theoretical findings. Our simulation results show that the approximation ratios of the proposed algorithms hold; the Primal-Dual and area division algorithms have comparable performance of the optimal results and outperform baseline algorithms obviously.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liando:2019:KUF, author = "Jansen C. Liando and Amalinda Gamage and Agustinus W. Tengourtius and Mo Li", title = "Known and Unknown Facts of {LoRa}: Experiences from a Large-scale Measurement Study", journal = j-TOSN, volume = "15", number = "2", pages = "16:1--16:??", month = apr, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3293534", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3293534", abstract = "Long Range (LoRa) is a Low-power Wide-area Network technology designed for the Internet of Things. In recent years, it has gained significant momentum among industrial and research communities. Patented by Semtech, LoRa makes use of chirp spread spectrum modulation to deliver data with promises of long battery life, far-reaching communication distances, and a high node density at the cost of data rate. In this article, we conduct a series of experiments to verify the claims made by Semtech on LoRa technology. Our results show that LoRa is capable of communicating over 10km under line-of-sight environments. However, under non-line-of-sight environments, LoRa's performance is severely affected by obstructions such as buildings and vegetations. Moreover, the promise of prolonged battery life requires extreme tuning of parameters. Last, a LoRa gateway supports up to 6,000 nodes with PRR requirement of \>70\%. This study also explores the relationship between LoRa transmission parameters and proposes an algorithm to determine optimal settings in terms of coverage and power consumption under non-line-of-sight environments. It further investigates the impact of LoRa Wide-area Networks on energy consumption and network capacity along with implementation of a LoRa medium access mechanism and possible gains brought forth by implementing such a mechanism.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Demetri:2019:LLA, author = "Silvia Demetri and Gian Pietro Picco and Lorenzo Bruzzone", title = "{LaPS}: {LiDAR}-assisted Placement of Wireless Sensor Networks in Forests", journal = j-TOSN, volume = "15", number = "2", pages = "17:1--17:??", month = apr, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3293500", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3293500", abstract = "The deployment of a wireless sensor network (WSN) is crucial to its reliability and performance. Yet, node placement is typically determined in-field via effort-demanding trial-and-error procedures, because existing approaches over-simplify the radio environment; this especially holds for forests, the focus of this article, where trees greatly affect communication. We present LaPS (LiDAR-assisted Placement for wireless Sensor networks), an approach exploiting remote sensing to identify the best node placement automatically and prior to deployment. Airborne Light Detection and Ranging (LiDAR) data acquired for the target forest are automatically processed to estimate its properties (e.g., tree position and diameter) that, once incorporated into a specialized path loss model, enable per-link estimates of the radio signal attenuation induced by trees. Finally, a genetic algorithm explores placement options by evolving toward a (sub-)optimal solution while satisfying the user's spatial and network requirements, whose formulation is very flexible and broadly applicable. Our experiments, focused on a real forest, confirm that LaPS yields topologies of significantly higher quality w.r.t. approaches using a regular placement or a standard path loss model. Further, the ability to quickly explore the impact that changes in user requirements have on topology is invaluable to improve the operation of WSNs and reduce the effort of their in-field deployment.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Alghamdi:2019:RAM, author = "Wael Alghamdi and Mohsen Rezvani and Hui Wu and Salil S. Kanhere", title = "Routing-Aware and Malicious Node Detection in a Concealed Data Aggregation for {WSNs}", journal = j-TOSN, volume = "15", number = "2", pages = "18:1--18:??", month = apr, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3293537", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3293537", abstract = "Data aggregation in Wireless Sensor Networks (WSNs) can effectively reduce communication overheads and reduce the energy consumption of sensor nodes. A WSN needs to be not only energy efficient but also secure. Various attacks may make data aggregation unsecure. We investigate the reliable and secure end-to-end data aggregation problem considering selective forwarding attacks and modification attacks in homogeneous WSNs, and propose two data aggregation approaches. Our approaches, namely Sign-Share and Sham-Share, use secret sharing and signatures to allow aggregators to aggregate the data without understanding the contents of messages and the base station to verify the aggregated data and retrieve the raw data from the aggregated data. To the best of our knowledge, this is the first lightweight en-routing malicious node detection in concealed data aggregation. We have performed an extensive simulation to compare our approaches and the two state-of-the-art approaches PIP and RCDA-HOMO. The simulation results show that both Sign-Share and Sham-Share consume a reasonable amount of time in processing and aggregating the data. The simulation results show that our first approach achieved an average network lifetime of 102.33\% over PIP and average aggregation energy consumption of 74.93\%. In addition, it achieved an average aggregation processing time and sensor data processing time of 95.4\% and 90.34\% over PIP and 98.7\% and 92.07\% over RCDA-HOMO, respectively, and it achieved an average network delay of 71.95\% over PIP. Although RCDA-HOMO is completely a different technique, a comparison was performed to measure the computational overhead.", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Niu:2019:REA, author = "Qun Niu and Mingkuan Li and Suining He and Chengying Gao and S.-H. Gary Chan and Xiaonan Luo", title = "Resource-efficient and Automated Image-based Indoor Localization", journal = j-TOSN, volume = "15", number = "2", pages = "19:1--19:??", month = apr, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3284555", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3284555", abstract = "Image-based indoor localization has aroused much interest recently because it requires no infrastructure support. Previous approaches on image-based localization, due to their computation and storage requirements, often process queries at servers. This does not scale well, incurs round-trip delay, and requires constant network connectivity. Many also require users to manually confirm the shortlisted matched landmarks, which is inconvenient, slow, and prone to selection error. To overcome these limitations, we propose a highly automated (in terms of image confirmation after taking images) image-based localization algorithm (HAIL), distributed in mobile devices. HAIL achieves resource efficiency (in terms of storage and processing) by keeping only distinguishing visual features for each landmark, and employing the efficient k-d tree to search for features. It further utilizes motion sensors and map constraints to enhance the localization accuracy without user operation. We have implemented HAIL on Android platforms and conducted extensive experiments in a food plaza and a premium shopping mall. Experimental results show that it achieves much higher localization accuracy (reducing the localization error by more than 20\%) and computation efficiency (by more than 40\% in time) as compared with the state-of-the-art approaches.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2019:EEC, author = "Wei Wang and Tiantian Xie and Xin Liu and Yao Yao and Ting Zhu", title = "{ECT}: Exploiting Cross-Technology Transmission for Reducing Packet Delivery Delay in {IoT} Networks", journal = j-TOSN, volume = "15", number = "2", pages = "20:1--20:??", month = apr, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3293536", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3293536", abstract = "Recent advances in cross-technology communication have significantly improved the spectrum efficiency in the same Industrial, Scientific, and Medical band among heterogeneous wireless devices (e.g., WiFi and ZigBee). However, further performance improvement in the whole network is hampered because the cross-technology network layer is missing. As the first cross-technology network layer design, our work, named ECT, opens a promising direction for significantly reducing the packet delivery delay via collaborative and concurrent cross-technology communication between WiFi and ZigBee devices. Specifically, ECT can dynamically change the nodes' priorities and reduce the delivery delay from high-priority nodes under unreliable links. The key idea of ECT is to leverage the concurrent transmission of important data and raw data from ZigBee nodes to the WiFi access point. We extensively evaluate ECT under different network settings, and results show that our ECT's packet delivery delay is more than 29 times lower than the current state-of-the-art solution.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yu:2019:PIM, author = "Ruiyun Yu and Jiannong Cao and Rui Liu and Wenyu Gao and Xingwei Wang and Junbin Liang", title = "Participant Incentive Mechanism Toward Quality-Oriented Sensing: Understanding and Application", journal = j-TOSN, volume = "15", number = "2", pages = "21:1--21:??", month = apr, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3303703", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3303703", abstract = "The ubiquity of ever-more-capable mobile devices, especially smartphones, brings forth participatory sensing to collect and interpret information. It can achieve unprecedented quantity of data. However, it is arduous to guarantee quality of data because everyone can contribute data without scrutinization. It is an important issue in quality-oriented participatory sensing. Our idea to address this issue is motivating participants to contribute accurate data for improving data quality directly. In this article, we propose a reputation-based incentive mechanism, RIM, to realize the idea. More specifically, we identify the participants who collect the accurate data and regard them as the reputable ones. Then, the reputable participants are granted a higher chance to obtain rewards so that other people will try to follow such users and become reputable as well. Namely, RIM can encourage and steer users to collect accurate data in the long term. We analyze our incentive mechanism by formalization and premise implications. For a feasibility study of participatory sensing and verification of the implications, we implement and deploy a participatory sensing application focusing on monitoring environmental noise in a specific location as a case study and conduct a simulation based on the case study to further evaluate the proposed incentive mechanism. The results from the case study and the simulation present that RIM can remarkably increase the quality of collected data in participatory sensing while corroborating our theoretical implications.", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yang:2019:NAK, author = "Zheng Yang and Junyu Lai and Yingbing Sun and Jianying Zhou", title = "A Novel Authenticated Key Agreement Protocol With Dynamic Credential for {WSNs}", journal = j-TOSN, volume = "15", number = "2", pages = "22:1--22:??", month = apr, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3303704", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3303704", abstract = "Public key cryptographic primitive (e.g., the famous Diffie--Hellman key agreement, or public key encryption) has recently been used as a standard building block in authenticated key agreement (AKA) constructions for wireless sensor networks (WSNs) to provide perfect forward secrecy (PFS), where the expensive cryptographic operation (i.e., exponentiation calculation) is involved. However, realizing such complex computation on resource-constrained wireless sensors is inefficient and even impossible on some devices. In this work, we introduce a new AKA scheme with PFS for WSNs without using any public key cryptographic primitive. To achieve PFS, we rely on a new dynamic one-time authentication credential that is regularly updated in each session. In particular, each value of the authentication credential is wisely associated with at most one session key that enables us to fulfill the security goal of PFS. Furthermore, the proposed scheme enables the principals to identify whether they have been impersonated previously. We highlight that our scheme can be very efficiently implemented on sensors since only hash function and XOR operation are required.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bhargava:2019:LFA, author = "Kriti Bhargava and Stepan Ivanov and Diarmuid McSweeney and William Donnelly", title = "Leveraging Fog Analytics for Context-Aware Sensing in Cooperative Wireless Sensor Networks", journal = j-TOSN, volume = "15", number = "2", pages = "23:1--23:??", month = apr, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3306147", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3306147", abstract = "In this article, we present a fog computing technique for real-time activity recognition and localization on-board wearable Internet of Things(IoT) devices. Our technique makes joint use of two light-weight analytic methods-Iterative Edge Mining(IEM) and Cooperative Activity Sequence-based Map Matching(CASMM). IEM is a decision-tree classifier that uses acceleration data to estimate the activity state. The sequence of activities generated by IEM is analyzed by the CASMM method for identifying the location. The CASMM method uses cooperation between devices to improve accuracy of classification and then performs map matching to identify the location. We evaluate the performance of our approach for activity recognition and localization of animals. The evaluation is performed using real-world acceleration data of cows collected during a pilot study at a Dairygold-sponsored farm in Kilworth, Ireland. The analysis shows that our approach can achieve a localization accuracy of up to 99\%. In addition, we exploit the location-awareness of devices and present an event-driven communication approach to transmit data from the IoT devices to the cloud. The delay-tolerant communication facilitates context-aware sensing and significantly improves energy profile of the devices. Furthermore, an array-based implementation of IEM is discussed, and resource assessment is performed to verify its suitability for device-based implementation.", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liu:2019:LCR, author = "Chen Liu and Dingyi Fang and Xinyan Liu and Dan Xu and Xiaojiang Chen and Chieh-Jan Mike Liang and Baoying Liu and Zhanyong Tang", title = "Low-Cost and Robust Geographic Opportunistic Routing in a Strip Topology Wireless Network", journal = j-TOSN, volume = "15", number = "2", pages = "24:1--24:??", month = apr, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3309701", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3309701", abstract = "Wireless sensor networks (WSNs) have been used for many long-term monitoring applications with the strip topology that is ubiquitous in the real-world deployment, such as pipeline monitoring, water quality monitoring, vehicle monitoring, and Great Wall monitoring. The efficiency of routing strategy has been playing a key role in serving such monitoring applications. In this article, we first present a robust geographic opportunistic routing (GOR) approach-LIght Propagation Selection (LIPS)-that can provide a short path with low energy consumption, communication overhead, and packet loss. To overcome the complication caused by the multi-turning point structure, we propose the virtual Plane mirror (VPM) algorithm, inspired by the light propagation, which is to map the strip topology into the straight one logically. We then select partial neighbors as the candidates to avoid blindly involving all next-hop neighbors and ensure the data transmission along the correct direction. Two implementation problems of VPM-transmission spread angle and the communication range-are thoroughly analyzed based on the percolation theory. Based on the preceding candidate selection algorithms, we propose a GOR algorithm in the strip topology network. By theoretical analysis and extensive simulation, we illustrate the validity and higher transmission performance of LIPS in strip WSNs. In addition, we have proved that the length of the path in LIPS is two times the length of the shortest path via geometrical analysis. Simulation results show that the transmission success rate of our approach is 26.37\% higher than the state-of-the-art approach, and the communication overhead and energy consumption rate are 33.11\% and 40.23\% lower, respectively.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Sutton:2019:BLL, author = "Felix Sutton and Reto {Da Forno} and Jan Beutel and Lothar Thiele", title = "{BLITZ}: Low Latency and Energy-Efficient Communication for Event-Triggered Wireless Sensing Systems", journal = j-TOSN, volume = "15", number = "2", pages = "25:1--25:??", month = apr, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3309702", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3309702", abstract = "Event-triggered wireless sensing systems are an important class of wireless sensor network, where the detection of non-deterministic events enables the monitoring and control of processes in industries such as manufacturing, healthcare, and agriculture. The system properties of low latency, energy efficiency, and adaptability make event-triggered wireless sensing systems a key technological enabler for the Industrial Internet of Things. Wireless sensing systems based on periodic multi-hop communication exhibit a fundamental trade-off between latency and energy efficiency, which is unfavorable for event-triggered application scenarios. To address this technological gap, we present Blitz, the first communication architecture that combines asynchronous and synchronous flooding primitives to facilitate low latency and energy-efficient multi-hop communication of non-deterministic events. Blitz also incorporates a novel scheme for mitigating erroneous wake-ups, which is shown analytically and experimentally to further reduce energy consumption. We present a prototype implementation of Blitz and evaluate its performance in an indoor testbed deployment. Experiments show that BLITZ supports a mean latency as low as 108.9ms for an 8-bit event packet and its associated data packet of 32 bytes through a 4-hop network, and a power dissipation of 16 \mu W during periods of inactivity.", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Shaabana:2019:CPH, author = "Ala Shaabana and Rong Zheng", title = "{CRONOS}: a Post-hoc Data Driven Multi-Sensor Synchronization Approach", journal = j-TOSN, volume = "15", number = "3", pages = "26:1--26:??", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3309703", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3309703", abstract = "Data synchronization is crucial in ubiquitous computing systems, where heterogeneous sensor devices, modalities, and different communication capabilities and protocols are the norm. A common notion of time among devices is required to make sense of their sensing data. Traditional synchronization methods rely on wireless communication between devices to synchronize, potentially incurring computational and power costs. Furthermore, they are unsuitable for synchronizing data streams that have already been collected. We present CRONOS: a post-hoc, data-driven framework for sensor data synchronization for wearable and Internet-of-Things devices that takes advantage of independent, omni-present motion events in the data streams of two or more sensors. Experimental results on pairwise and multi-sensor synchronization show a drift improvement as high as 98\% and a mean absolute synchronization error of approximately 6ms for multi-sensor synchronization with sensors sampling at 100Hz.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chang:2019:PPN, author = "Sang-Yoon Chang and Sristi Lakshmi Sravana Kumar and Yih-Chun Hu and Younghee Park", title = "Power-Positive Networking: Wireless-Charging-Based Networking to Protect Energy against Battery {DoS} Attacks", journal = j-TOSN, volume = "15", number = "3", pages = "27:1--27:??", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3317686", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3317686", abstract = "Energy is required for networking and computation and is a valuable resource for unplugged systems such as mobile, sensor, and embedded systems. Energy denial-of-service (DoS) attack where a remote attacker exhausts the victim's battery via networking remains a critical challenge for the device availability. While prior literature proposes mitigation- and detection-based solutions, we propose to eliminate the vulnerability entirely by offloading the power requirements to the entity who makes the networking requests. To do so, we build communication channels using wireless charging signals (as opposed to the traditional radio-frequency signals), so that the communication and the power transfer are simultaneous and inseparable, and use the channels to build power-positive networking (PPN). PPN also offloads the computation-based costs to the requester, enabling authentication and other tasks considered too power-hungry for battery-operated devices. In this article, we study the energy DoS attack impacts on off-the-shelf embedded system platforms (Raspberry Pi and the ESP 8266 system-on-chip (SoC) module), present PPN, implement and build a Qi-charging-technology-compatible prototype, and use the prototype for evaluations and analyses. Our prototype, built on the hardware already available for wireless charging, effectively defends against energy DoS and supports simultaneous power and data transfer.", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yin:2019:SBM, author = "Junjie Yin and Zheng Yang and Hao Cao and Tongtong Liu and Zimu Zhou and Chenshu Wu", title = "A Survey on {Bluetooth 5.0} and {Mesh}: New Milestones of {IoT}", journal = j-TOSN, volume = "15", number = "3", pages = "28:1--28:??", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3317687", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3317687", abstract = "Ubiquitous connectivity among objects is the future of the coming Internet of Things era. Technologies are competing fiercely to fulfill this goal, but none of them can fit into all application scenarios. However, efforts are still made to expand application ranges of certain technologies. Shortly after the adoption of its newest version, Bluetooth 5.0, the Bluetooth Special Interest Group released another new specification on network topology: Bluetooth Mesh. Combined together, those two bring Bluetooth to a brand new stage. However, current works related to it only focus on part of the new Bluetooth, and discussion over the entire one is lacking. Therefore, in this survey, we conduct an investigation toward the new Bluetooth from a comprehensive perspective. Through this, we show that the new Bluetooth not only consolidates its strengths in original application fields but also brings alterations and opportunities to new ones, making it a strong competitor in the future for providing complete solutions to meet the demands of seamless communications in the Internet of Things area.", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Jellali:2019:BDS, author = "Zakia Jellali and Le{\"\i}la Najjar Atallah and Sofiane Cherif", title = "Bi-dimensional Signal Compression Based on Linear Prediction Coding: Application to {WSN}", journal = j-TOSN, volume = "15", number = "3", pages = "29:1--29:??", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3317688", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3317688", abstract = "The big data phenomenon has gained much attention in the wireless communications field. Addressing big data is a challenging and time-demanding task that requires a large computational infrastructure to ensure successful data processing and analysis. In such a context, data compression helps to reduce the amount of data required to represent redundant information while reliably preserving the original content as much as possible. We here consider Compressed Sensing (CS) theory for extracting critical information and representing it with substantially reduced measurements of the original data. For CS application, it is, however, required to design a convenient sparsifying basis or transform. In this work, a large amount of bi-dimensional (2D) correlated signals are considered for compression. The envisaged application is that of data collection in large scale Wireless Sensor Networks. We show that, using CS, it is possible to recover a large amount of data from the collection of a reduced number of sensors readings. In this way, CS use makes it possible to recover large data sets with acceptable accuracy as well as reduced global scale cost. For sparsifying basis search, in addition to conventional sparsity-inducing methods, we propose a new transformation based on Linear Prediction Coding (LPC) that effectively exploits correlation between neighboring data. The steps of data aggregation using CS include sparse compression basis design and then decomposition matrix construction and recovery algorithm application. Comparisons to the case of one-dimensional (1D) reading and to conventional 2D compression methods show the benefit from the better exploitation of the correlation by herein envisaged 2D processing. Simulation results on both synthetic and real WSN data demonstrate that the proposed LPC approach with 2D scenario realizes significant reconstruction performance enhancement compared to former conventional transformations.", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wang:2019:CMC, author = "Liang Wang and Zhiwen Yu and Dingqi Yang and Tao Ku and Bin Guo and Huadong Ma", title = "Collaborative Mobile Crowdsensing in Opportunistic {D2D} Networks: a Graph-based Approach", journal = j-TOSN, volume = "15", number = "3", pages = "30:1--30:??", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3317689", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3317689", abstract = "With the remarkable proliferation of smart mobile devices, mobile crowdsensing has emerged as a compelling paradigm to collect and share sensor data from surrounding environment. In many application scenarios, due to unavailable wireless network or expensive data transfer cost, it is desirable to offload crowdsensing data traffic on opportunistic device-to-device (D2D) networks. However, coupling between mobile crowdsensing and D2D networks, it raises new technical challenges caused by intermittent routing and indeterminate settings. Considering the operations of data sensing, relaying, aggregating, and uploading simultaneously, in this article, we study collaborative mobile crowdsensing in opportunistic D2D networks. Toward the concerns of sensing data quality, network performance and incentive budget, Minimum-Delay-Maximum-Coverage (MDMC) problem and Minimum-Overhead-Maximum-Coverage (MOMC) problem are formalized to optimally search a complete set of crowdsensing task execution schemes over user, temporal, and spatial three dimensions. By exploiting mobility traces of users, we propose an unified graph-based problem representation framework and transform MDMC and MOMC problems to a connection routing searching problem on weighted directed graphs. Greedy-based recursive optimization approaches are proposed to address the two problems with a divide-and-conquer mode. Empirical evaluation on both real-world and synthetic datasets validates the effectiveness and efficiency of our proposed approaches.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liu:2019:ECO, author = "Daibo Liu and Zhichao Cao and Yuan He and Xiaoyu Ji and Mengshu Hou and Hongbo Jiang", title = "Exploiting Concurrency for Opportunistic Forwarding in Duty-Cycled {IoT} Networks", journal = j-TOSN, volume = "15", number = "3", pages = "31:1--31:??", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3322496", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3322496", abstract = "Due to limited energy supply of Internet of Things (Zhao et al. 2018) (IoT) devices, asynchronous duty cycle radio management is widely adopted to save energy. Since the sleep schedules of nodes are unsynchronized, a sender has to repeatedly send frames to coordinate with its receiver or keep sleeping until the receiver's wake-up time will come according to receiver's sleep-wake schedule. In such contexts, opportunistic forwarding, which takes the earliest forwarding opportunity instead of a deterministic forwarder, shows great advantage in utilizing channel resource for duty-cycled IoT networks. The multiple forwarding choices with temporal and spatial diversity increase the chance of collision tolerance in opportunistic forwarding, potentially enhancing the overall performance of duty-cycled multi-hop networks. However, since the current channel contention mechanisms mainly focus on collision avoidance, it is too conservative to exploit concurrency. To address this problem, in this article, we propose COF to fully exploit the potential Concurrency for Opportunistic Forwarding in duty-cycled IoT networks. COF achieves concurrent transmission by: (i) measuring conditional link quality under the interference of on-going transmissions, and then (ii) further modeling the benefit of potential concurrency opportunities. According to the expected benefit of concurrency, COF decides whether or not to transmit in concurrent way. COF also adopts concurrency flag and signal features to avoid data collision caused by disordered concurrent transmissions and enhance the accuracy of conditional link quality estimation. COF can be easily integrated into the conventional unsynchronized and duty-cycled protocols. We have implemented COF and evaluated its performance on a 40-node testbed. The results show that COF can effectively exploit potential concurrency in opportunistic forwarding and COF outperforms the state-of-art protocols under diverse traffic load and network density.", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Saeed:2019:RTC, author = "Ahmed Saeed and Ahmed Abdelkader and Mouhyemen Khan and Azin Neishaboori and Khaled A. Harras and Amr Mohamed", title = "On Realistic Target Coverage by Autonomous Drones", journal = j-TOSN, volume = "15", number = "3", pages = "32:1--32:??", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3325512", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3325512", abstract = "Low-cost mini-drones with advanced sensing and maneuverability enable a new class of intelligent sensing systems. To achieve the full potential of such drones, it is necessary to develop new enhanced formulations of both common and emerging sensing scenarios. Namely, several fundamental challenges in visual sensing are yet to be solved including (1) fitting sizable targets in camera frames; (2) positioning cameras at effective viewpoints matching target poses; and (3) accounting for occlusion by elements in the environment, including other targets. In this article, we introduce Argus, an autonomous system that utilizes drones to collect target information incrementally through a two-tier architecture. To tackle the stated challenges, Argus employs a novel geometric model that captures both target shapes and coverage constraints. Recognizing drones as the scarcest resource, Argus aims to minimize the number of drones required to cover a set of targets. We prove this problem is NP-hard, and even hard to approximate, before deriving a best-possible approximation algorithm along with a competitive sampling heuristic which runs up to $ 100 \times $ faster according to large-scale simulations. To test Argus in action, we demonstrate and analyze its performance on a prototype implementation. Finally, we present a number of extensions to accommodate more application requirements and highlight some open problems.", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Liu:2019:MSC, author = "Xuecheng Liu and Luoyi Fu and Jiliang Wang and Xinbing Wang and Guihai Chen", title = "Multicast Scaling of Capacity and Energy Efficiency in Heterogeneous Wireless Sensor Networks", journal = j-TOSN, volume = "15", number = "3", pages = "33:1--33:??", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3322497", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3322497", abstract = "Motivated by the requirement of heterogeneity in the Internet of Things, we initiate the joint study of capacity and energy efficiency scaling laws in heterogeneous wireless sensor networks, and so on. The whole network is composed of n nodes scattered in a square region with side length $ L = n^\alpha $, and there are $ m = n^\nu $ home points $ \{ c_j \}_{j = 1}^m $, where a generic home point $ c_j $ generates $ q_j $ nodes independently according to a stationary and rotationally invariant kernel $ k(c_j, \cdot) $. Among the $n$ nodes, we schedule $ n_s$ independent multicast sessions each consisting of $ k - 1$ destination nodes and one source node. According to the heterogeneity of nodes' distribution, we classify the network into two regimes: a cluster-dense regime and a cluster-sparse regime. For the cluster-dense regime, we construct single layer highway system using percolation theory and then build the multicast spanning tree for each multicast session. This scheme yields the $ \Omega (n^{1 / 2 + (\alpha - 1 / 2) \gamma } / n_s \sqrt k)$ per-session multicast capacity. For the cluster-sparse regime, we partition the whole network plane into several layers and construct nested highway systems. The similar multicast spanning tree yields the $ \Omega (n^{1 / 2 - (1 - \nu) \gamma / 2} / n_s \sqrt k)$ per-session multicast capacity, where \gamma is the power attenuation factor. Interestingly, we find that the bottleneck of multicast capacity attributes to the network region with largest node density, which provides a guideline for the deployment of sensor nodes in large-scale sensor networks. We further analyze the upper bound of multicast capacity and the per-session multicast energy efficiency. Using both synthetic networks and real-world networks (i.e., Greenorbs), we evaluate the asymptotic capacity and energy efficiency and find that the theoretical scaling laws are gracefully supported by the simulation results. To our best knowledge, this is the first work verifying the scaling laws using real-world large-scale sensor network data.", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Reijers:2019:IAT, author = "Niels Reijers and Chi-Sheng Shih", title = "Improved Ahead-of-time Compilation of Stack-based {JVM Bytecode} on Resource-constrained Devices", journal = j-TOSN, volume = "15", number = "3", pages = "34:1--34:??", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3341170", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3341170", abstract = "Many virtual machines exist for sensor nodes with only a few kB RAM and tens- to a few hundred kB Flash memory. They pack an impressive set of features but suffer from a slowdown of one to two orders of magnitude compared to optimised native code, reducing throughput and increasing power consumption. Compiling bytecode to native code to improve performance has been studied extensively for larger devices, but the restricted resources on sensor nodes mean most modern techniques cannot be applied. Simply replacing bytecode instructions with predefined sequences of native instructions is known to improve performance but produces code several times larger than the optimised C equivalent, limiting the size of programmes that can fit onto a device. This article identifies the major sources of overhead resulting from this basic approach and presents optimisations to remove most of the remaining performance overhead, and over half the size overhead, reducing them to 67\% and 77\%, respectively. While this increases the size of the VM, the break-even point at which this fixed cost is compensated for by the smaller code it generates, is well within the range of memory available on a sensor device, allowing us to both improve performance and load more code on a device.", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wei:2019:RCE, author = "Bo Wei and Wen Hu and Mingrui Yang and Chun Tung Chou", title = "From Real to Complex: Enhancing Radio-based Activity Recognition Using Complex-Valued {CSI}", journal = j-TOSN, volume = "15", number = "3", pages = "35:1--35:??", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3338026", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3338026", abstract = "Activity recognition is an important component of many pervasive computing applications. Radio-based activity recognition has the advantage that it does not have the privacy concern compared with camera-based solutions, and subjects do not have to carry a device on them. It has been shown channel state information (CSI) can be used for activity recognition in a device-free setting. With the proliferation of wireless devices, it is important to understand how radio frequency interference (RFI) can impact on pervasive computing applications. In this article, we investigate the impact of RFI on device-free CSI-based location-oriented activity recognition. We present data to show that RFI can have a significant impact on the CSI vectors. In the absence of RFI, different activities give rise to different CSI vectors that can be differentiated visually. However, in the presence of RFI, the CSI vectors become much noisier, and activity recognition also becomes harder. Our extensive experiments show that the performance may degrade significantly with RFI. We then propose a number of countermeasures to mitigate the impact of RFI and improve the performance. We are also the first to use complex-valued CSI along with the state-of-the-art Sparse Representation Classification method to enhance the performance in the environment with RFI.", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Cardell-Oliver:2019:BAC, author = "Rachel Cardell-Oliver and Chayan Sarkar", title = "{BuildSense}: Accurate, Cost-aware, Fault-tolerant Monitoring with Minimal Sensor Infrastructure", journal = j-TOSN, volume = "15", number = "3", pages = "36:1--36:??", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3341171", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3341171", abstract = "Buildings can achieve energy-efficiency by using solar passive design, energy-efficient structures and materials, or by optimizing their operational energy use. In each of these areas, efficiency can be improved if the physical properties of the building along with its dynamic behavior can be captured using low-cost embedded sensor devices. This opens up a new challenge of installing and maintaining the sensor devices for different types of buildings. In this article, we propose BuildSense, a sensing framework for fine-grained, long-term monitoring of buildings using a mix of physical and virtual sensors. It not only reduces the deployment and management cost of sensors but can also guarantee accurate and fault-tolerant data coverage for long-term use. We evaluate BuildSense using sensor measurements from two rammed-earth houses that were custom-designed for a challenging hot-arid climate so almost no artificial heating or cooling is required. We demonstrate that BuildSense can significantly reduce the cost of permanent physical sensors while still achieving fit-for-purpose accuracy, fault-tolerance, and stability. Overall, we were able to reduce the cost of a building sensor network by 60\% to 80\% by replacing physical sensors with virtual ones while still maintaining accuracy of $ \leq 1.0^\circ $C and fault-tolerance of two or more predictors per virtual sensor.", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Pal:2019:WFD, author = "Amitangshu Pal and Krishna Kant", title = "Water Flow Driven Sensor Networks for Leakage and Contamination Monitoring in Distribution Pipelines", journal = j-TOSN, volume = "15", number = "4", pages = "37:1--37:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3342513", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3342513", abstract = "In this article, we introduce the concept of Water Flow Driven Sensor Networks for leakage and contamination monitoring in urban water distribution systems. The unique aspect of our work is that the sensor network can be deployed in the underground water network with only access to connection points (through manholes) and driven only by water harvested energy without the need for AC power or frequent battery changes. Although water systems may be affected by a large variety of contaminants, only a few sensors can be practically deployed. Thus, many types of contaminants are sensed via ``proxy sensing,'' which may not be 100\% reliable. The main problems addressed are (a) adaptation of the network to the available energy to maximize leak/contamination detection and (b) minimal artificial water circulation or leakage to improve detectability during periods of almost zero natural water flow. The article shows, through extensive simulations, that the proposed approach can drastically reduce the leakage/contamination reporting time (from 3.5h up to $\approx$6min), and the adaptation can reduce this circulation by $\approx$33\% and yet enhance the collected/transmitted data by 30\%.", acknowledgement = ack-nhfb, articleno = "37", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chen:2019:TPO, author = "Yueyue Chen and Deke Guo and MD Zakirul Alam Bhuiyan and Ming Xu and Guojun Wang and Pin Lv", title = "Towards Profit Optimization During Online Participant Selection in Compressive Mobile Crowdsensing", journal = j-TOSN, volume = "15", number = "4", pages = "38:1--38:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3342515", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3342515", abstract = "A mobile crowdsensing (MCS) platform motivates employing participants from the crowd to complete sensing tasks. A crucial problem is to maximize the profit of the platform, i.e., the charge of a sensing task minus the payments to participants that execute the task. In this article, we improve the profit via the data reconstruction method, which brings new challenges, because it is hard to predict the reconstruction quality due to the dynamic features and mobility of participants. In particular, two Profit-driven Online Participant Selection (POPS) problems under different situations are studied in our work: (1) for S-POPS, the sensing cost of the different parts within the target area is the Same. Two mechanisms are designed to tackle this problem, including the ProSC and ProSC+. An exponential-based quality estimation method and a repetitive cross-validation algorithm are combined in the former mechanism, and the spatial distribution of selected participants are further discussed in the latter mechanism; (2) for V-POPS, the sensing cost of different parts within the target area is Various, which makes it the NP-hard problem. A heuristic mechanism called ProSCx is proposed to solve this problem, where the searching space is narrowed and both the participant quantity and distribution are optimized in each slot. Finally, we conduct comprehensive evaluations based on the real-world datasets. The experimental results demonstrate that our proposed mechanisms are more effective and efficient than baselines, selecting the participants with a larger profit for the platform.", acknowledgement = ack-nhfb, articleno = "38", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Mu:2019:ROS, author = "Di Mu and Yunpeng Ge and Mo Sha and Steve Paul and Niranjan Ravichandra and Souma Chowdhury", title = "Robust Optimal Selection of Radio Type and Transmission Power for {Internet of Things}", journal = j-TOSN, volume = "15", number = "4", pages = "39:1--39:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3342516", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3342516", abstract = "Research efforts over the last few decades produced multiple wireless technologies, which are readily available to support communication between devices in various dynamic Internet of Things (IoT) and robotics applications. However, single radio technology can hardly deliver optimal performance across all critical quality of service (QoS) dimensions under the typically varying environmental conditions or under varying distance between communicating nodes. Using a single wireless technology therefore falls short of meeting the demands of varying workloads or changing environmental conditions. Instead of pursuing a one-radio-fits-all approach, we design ARTPoS, an Adaptive Radio and Transmission Power Selection system, which makes available at runtime multiple wireless technologies (e.g., WiFi and ZigBee) and selects the radio(s) and transmission power(s) most suitable for the current conditions and requirements. The principal components of ARTPoS include new empirical models of power consumption and packet reception ratio (the latter can also be refined online) and online optimization schemes. We have implemented our system and evaluate it on the physical testbed consisting of our new embedded platforms with heterogeneous radios. Experimental results show that ARTPoS can significantly reduce the power consumption, while maintaining desired link reliability, compared to standard baselines.", acknowledgement = ack-nhfb, articleno = "39", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Gu:2019:OHB, author = "Chaojie Gu and Rui Tan and Xin Lou", title = "One-Hop Out-of-Band Control Planes for Multi-Hop Wireless Sensor Networks", journal = j-TOSN, volume = "15", number = "4", pages = "40:1--40:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3342100", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3342100", abstract = "Separation of Control and Data Planes (SCDP) is a desirable paradigm for low-power multi-hop wireless sensor networks requiring high network performance and manageability. Existing SCDP networks generally adopt an in-band control plane scheme in that the control-plane messages are delivered by their data-plane networks. The physical coupling of the two planes may lead to undesirable consequences. Recently, multi-radio platforms (e.g., TI CC1350 and OpenMote B) are increasingly available, which make the physical separation of the control and data planes possible. To advance the network architecture design, we propose to leverage on the long-range communication capability of the Low-Power Wide-Area Network (LPWAN) radios to form one-hop out-of-band control planes. LoRaWAN, an open, inexpensive, and ISM band based LPWAN radio, is chosen to prototype our out-of-band control plane called LoRaCP. Several characteristics of LoRaWAN such as downlink-uplink asymmetry and primitive ALOHA media access control need to be dealt with to achieve high reliability and efficiency. To address these challenges, a TDMA-based multi-channel transmission control is designed, which features an urgent channel and negative acknowledgment. On a testbed of 16 nodes, LoRaCP is applied to physically separate the control-plane network of the Collection Tree Protocol (CTP) from its Zigbee-based data-plane network. Extensive experiments show that LoRaCP increases CTP's packet delivery ratio from 65\% to 80\% in the presence of external interference, while consuming a per-node average radio power of 2.97mW only.", acknowledgement = ack-nhfb, articleno = "40", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Winkler:2019:DDI, author = "Daniel A. Winkler and Robert Wang and Fran{\c{c}}ois Blanchette and Miguel {\'A}. Carreira-Perpi{\~n}{\'a}n and Alberto E. Cerpa", title = "{DICTUM}: {Distributed Irrigation aCtuation with Turf hUmidity Modeling}", journal = j-TOSN, volume = "15", number = "4", pages = "41:1--41:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3342514", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3342514", abstract = "Lawns make up the largest irrigated crop by surface area in North America and carry with it a demand for over 7B gallons of freshwater each day. Despite recent developments in irrigation control and sprinkler technology, state-of-the-art irrigation systems do nothing to compensate for areas of turf with heterogeneous water needs. In this work, we overcome the physical limitations of the traditional irrigation system with the development of a sprinkler node that can sense the local soil moisture, communicate wirelessly, and actuate its own sprinkler based on a centrally computed schedule. A model is then developed to compute moisture movement from runoff, absorption, and diffusion. Integrated with an optimization framework, optimal valve scheduling can be found for each sprinkler node in the space. In a turf area covering over 10,000ft$^2$, two separate deployments with four weeks of fine-grained data collection show that DICTUM can reduce water consumption by 23.4\% over traditional campus scheduling, and by 12.3\% over state-of-the-art evapotranspiration systems while substantially improving conditions for plant health. In addition to environmental, social, and health benefits, DICTUM is shown to return its investment in 16 to 18 months based on water consumption alone.", acknowledgement = ack-nhfb, articleno = "41", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Wu:2019:EIL, author = "Hang Wu and Ziliang Mo and Jiajie Tan and Suining He and S.-H. Gary Chan", title = "Efficient Indoor Localization Based on Geomagnetism", journal = j-TOSN, volume = "15", number = "4", pages = "42:1--42:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3342517", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3342517", abstract = "Geomagnetism is promising for indoor localization due to its omnipresence, high stability, and availability of magnetometers in smartphones. Previous works often fuse it with pedometer via particles, which are computationally intensive and make strong user behavior assumptions. To overcome that, we propose Magil, an approach leveraging geomagnetism for indoor localization. To our best knowledge, this is the first piece of work using geomagnetism for smartphone localization without the need of pedometer or user walking model. Magil is applicable to any open or complex indoor environment. In the offline phase, Magil collects and stores geomagnetic fingerprints while surveyors walk indoors. In the online phase, it employs a fast algorithm to match the geomagnetic variation of the target with the stored fingerprints. Given closely matched segments, Magil constructs user trajectory efficiently with a modified shortest path formulation by selecting and connecting these matched segments. To further improve accuracy and deployability, we propose MagFi, which extends Mag il by fusing it with Wi- Fi. MagFi further collects opportunistic Wi-Fi RSSI for fingerprint construction. We have implemented both Magil and MagFi and conducted extensive experiments in our campus. Results show that our schemes outperform state-of-the-art schemes by a wide margin (often cutting localization error by 30\%).", acknowledgement = ack-nhfb, articleno = "42", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Shi:2019:DSC, author = "Tuo Shi and Siyao Cheng and Jianzhong Li and Hong Gao and Zhipeng Cai", title = "Dominating Sets Construction in {RF}-based Battery-free Sensor Networks with Full Coverage Guarantee", journal = j-TOSN, volume = "15", number = "4", pages = "43:1--43:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3352486", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3352486", abstract = "A new network architecture, named as RF-based battery-free sensor network, was proposed in recent years to overcome the lifetime limitation of traditional wireless sensor networks. In an RF-based battery-free sensor network, the battery-free nodes equip no battery and can be recharged by RF-signals. The Dominating Set (DS) is a key method to maintain the coverage of traditional WSNs, and it can be also adopted in the RF-based battery-free sensor networks. However, considering the specific features of RF-based battery-free sensor networks, the DS construction is totally different from that in traditional WSNs. Thus, the problem of constructing DS in a battery-free sensor network is deeply investigated in this article. The NP-Hardness of such problem is proved. Four approximation algorithms are proposed to deal with the snapshot and continuous DS construction requirements, respectively. The approximation ratios of these four algorithms have been analyzed, and the theoretical results show that all these four algorithms are effective. Furthermore, the electromagnetic interference problem in the RF-based battery-free sensor network is considered and defined. An approximated algorithm is proposed to solve such problem. Finally, extensive simulations are carried out. The experimental results verify that the proposed algorithms have high performance in terms of accuracy and efficiency.", acknowledgement = ack-nhfb, articleno = "43", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Yin:2019:ABC, author = "Yafeng Yin and Lei Xie and Tao Gu and Yijia Lu and Sanglu Lu", title = "{AirContour}: Building Contour-based Model for In-Air Writing Gesture Recognition", journal = j-TOSN, volume = "15", number = "4", pages = "44:1--44:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3343855", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3343855", abstract = "Recognizing in-air hand gestures will benefit a wide range of applications such as sign-language recognition, remote control with hand gestures, and ``writing'' in the air as a new way of text input. This article presents AirContour, which focuses on in-air writing gesture recognition with a wrist-worn device. We propose a novel contour-based gesture model that converts human gestures to contours in 3D space and then recognizes the contours as characters. Different from 2D contours, the 3D contours may have the problems such as contour distortion caused by different viewing angles, contour difference caused by different writing directions, and the contour distribution across different planes. To address the above problem, we introduce Principal Component Analysis (PCA) to detect the principal/writing plane in 3D space, and then tune the projected 2D contour in the principal plane through reversing, rotating, and normalizing operations, to make the 2D contour in right orientation and normalized size under a uniform view. After that, we propose both an online approach, AC-Vec, and an offline approach, AC-CNN, for character recognition. The experimental results show that AC-Vec achieves an accuracy of 91.6\% and AC-CNN achieves an accuracy of 94.3\% for gesture/character recognition, both outperforming the existing approaches.", acknowledgement = ack-nhfb, articleno = "44", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Chen:2019:BLS, author = "Kongyang Chen and Guang Tan", title = "{BikeGPS}: Localizing Shared Bikes in Street Canyons with Low-level {GPS} Cooperation", journal = j-TOSN, volume = "15", number = "4", pages = "45:1--45:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3343857", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3343857", abstract = "The past few years have witnessed a rapid growth of stationless bike sharing services. The service allows the bikes to be dropped off freely and to be found through GPS localization. In practice, the bikes are often parked in close proximity to buildings, where GPS accuracy suffers, making bike search a challenging task. This article proposes a novel approach to addressing this problem. Inspired by multi-antenna systems, our method tries to collect GPS signals from multiple distributed bikes, by organizing a group of bikes into a network, called a BikeGPS network. Formed by pedestrian users who opportunistically measure inter-bike distance via radio sensing and step tracking, the generated network permits one to map all the nodes' satellite range measurements into a single lead node 's view. By considering both signal and geometry properties of satellite raw measurements, and using an asynchronous coarse time navigation algorithm, the lead node can accurately derive the locations of all the network nodes. Experiments in real-world scenarios show that BikeGPS significantly improves the localization performance, in terms of both accuracy and solution availability, compared with the naive GPS approach and a high-level cooperative localization method.", acknowledgement = ack-nhfb, articleno = "45", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Buiquang:2019:BJD, author = "Chung Buiquang and Zhongfu Ye", title = "Blind Joint {$2$-D} {DOA}\slash Symbols Estimation for {$3$-D} Millimeter Wave Massive {MIMO} Communication Systems", journal = j-TOSN, volume = "15", number = "4", pages = "46:1--46:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3352487", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3352487", abstract = "By using a large number of antenna (sensor) elements at the receivers, massive multi-input multi-output (MIMO) offers many benefits for 5G communication systems, such as a huge spectral efficiency gain, significant reduction of latency, and robustness to interference. However, to get these benefits of massive MIMO, accuracy of the channel state information obtained at the transmitter is required. This article proposes a approach for blind joint channel/symbols estimation in 3-D millimeter wave massive MIMO systems based on tensor factorization. More specifically, we suggest a direction-of-arrival (DOA)-based channel estimation method, which provides the best performance in terms of error bound for channel estimation. We show that the massive MIMO signals can be expressed as a third-order (3-D) tensor model, where the matrices of channel (2-D DOA) and symbols can be viewed as two independent factor matrices. Such a hybrid tensorial modeling enables a blind joint estimation of 2-D DOA/symbols. To learn the tensor model, we develop two least squares--based algorithms. The first one is delta bilinear alternating least squares (DBALS) algorithm that exploits the increment values between two iterations of the factor matrices to provide the initializations for such matrices. This avoids the slow convergence caused by random initializations for factor matrices found in the traditional least squares algorithms. The other one is Vandermonde constrained DBALS that takes into account the potential Vandermonde nature structure of the DOA matrix in the DBALS algorithm. This provides the estimation for the DOA matrix and gives a better uniqueness results for the use of tensor model. The performance of the proposed approach is illustrated by means of simulation results, and a comparison is made with the recent approaches. Besides a blind joint 2-D DOA/symbols estimation, our approach offers a better performance due to avoiding the random initializations and taking in the Vandermonde structure of DOA matrix.", acknowledgement = ack-nhfb, articleno = "46", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Brachmann:2019:WFF, author = "Martina Brachmann and Olaf Landsiedel and Diana G{\"o}hringer and Silvia Santini", title = "{Whisper}: Fast Flooding for Low-Power Wireless Networks", journal = j-TOSN, volume = "15", number = "4", pages = "47:1--47:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3356341", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3356341", abstract = "This article presents Whisper, a fast and reliable protocol to flood small amounts of data into a multi-hop network. Whisper makes use of synchronous transmissions, a technique first introduced by the Glossy flooding protocol. In contrast to Glossy, Whisper does not let the radio switch from receive to transmit mode between messages. Instead, it makes nodes continuously transmit identical copies of the message and eliminates the gaps between subsequent transmissions. To this end, Whisper embeds the message to be flooded into a signaling packet that is composed of multiple packlets -where a packlet is a portion of the message payload that mimics the structure of an actual packet. A node must intercept only one of the packlets to detect that there is an ongoing transmission and that it should start forwarding the message. This allows Whisper to speed up the propagation of the flood and, thus, to reduce the overall radio-on time of the nodes. Our evaluation on the FlockLab testbed shows that Whisper achieves comparable reliability but 2$ \times $ lower radio-on time than Glossy. We further show that by embedding Whisper in an existing data collection application, we can more than double the lifetime of the network.", acknowledgement = ack-nhfb, articleno = "47", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Ma:2019:FCS, author = "Zhi Ma and Sheng Zhang and Jie Wu and Zhuzhong Qian and Yanchao Zhao and Sanglu Lu", title = "Fast Charging Scheduling under the Nonlinear Superposition Model with Adjustable Phases", journal = j-TOSN, volume = "15", number = "4", pages = "48:1--48:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3356342", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3356342", abstract = "Wireless energy transfer has been widely studied in recent decades, with existing works mainly focused on maximizing network lifetime, optimizing charging efficiency, and optimizing charging quality. All these works use a charging model with the linear superposition, which may not be the most accurate. We apply a nonlinear superposition model, and we consider the Fast Charging Scheduling problem (FCS): Given multiple chargers and a group of sensors, how can the chargers be optimally scheduled over the time dimension so that the total charging time is minimized and each sensor has at least energy E? We prove that FCS is NP-complete and propose a 2-approximation algorithm to solve it in one-dimensional (1D) line. In a 2D plane, we first consider a special case of FCS, where the initial phases of all chargers are the same, and propose an algorithm to solve it, which has a bound. Then we propose an algorithm to solve FCS in a general 2D plane. Unlike other algorithms, our algorithm does not need to calculate the combined energy of every possible combination of chargers in advance, which greatly reduces the complexity. Extensive simulations demonstrate that the performance of our algorithm performs almost as good as the optimal algorithm.", acknowledgement = ack-nhfb, articleno = "48", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Zhu:2019:BSB, author = "Tongxin Zhu and Jianzhong Li and Hong Gao and Yingshu Li", title = "Broadcast Scheduling in Battery-Free Wireless Sensor Networks", journal = j-TOSN, volume = "15", number = "4", pages = "49:1--49:??", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3356472", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Nov 2 10:03:17 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3356472", abstract = "Battery-Free Wireless Sensor Networks (BF-WSNs) are newly emerging Wireless Sensor Networks (WSNs) to break through the energy limitations of traditional WSNs. In BF-WSNs, the broadcast scheduling problem is more challenging than that in traditional WSNs. This article investigates the broadcast scheduling problem in BF-WSNs with the purpose of minimizing broadcast latency. The Minimum-Latency Broadcast Scheduling problem in BF-WSNs (MLBS-BF) is formally defined and its NP-hardness is proved. Three approximation algorithms for solving the MLBS-BF problem are proposed. The broadcast latency of the broadcast schedules produced by the proposed algorithms is analyzed. The correctness and approximation ratio of the proposed algorithms are also proved. Finally, extensive simulations are conducted to evaluate the performances of the proposed algorithms. The simulation results show that the proposed algorithms have high performance.", acknowledgement = ack-nhfb, articleno = "49", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Istomin:2020:RFR, author = "Timofei Istomin and Oana Iova and Gian Pietro Picco and Csaba Kiraly", title = "Route or Flood? {Reliable} and Efficient Support for Downward Traffic in {RPL}", journal = j-TOSN, volume = "16", number = "1", pages = "1:1--1:41", month = feb, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3355997", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Feb 15 07:56:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3355997", abstract = "Modern protocols for wireless sensor networks efficiently support multi-hop upward traffic from many sensors to a collection point, a key functionality enabling monitoring applications. However, the ever-evolving scenarios involving low-power wireless devices increasingly require support also for downward traffic, e.g., enabling a controller to issue actuation commands based on the monitored data. The IETF Routing Protocol for Low-power and Lossy Networks (RPL) is among the few tackling both traffic patterns. Unfortunately, its support for downward traffic is significantly unreliable and inefficient compared to its upward counterpart. We tackle this problem by extending RPL with mechanisms inspired by opposed, yet complementary, principles. At one extreme, we retain the route-based operation of RPL and devise techniques allowed by the standard but commonly neglected by popular implementations. At the other extreme, we rely on flooding as the main networking primitive. Inspired by these principles, we define three base mechanisms, integrate them in a popular RPL implementation, analyze their individual and combined performance, and elicit the resulting tradeoffs in scalability, reliability, and energy consumption. The evaluation relies on simulation, using both real-world topologies from a smart city scenario and synthetic grid ones, as well as on testbed experiments validating our findings from simulation. Results show that the combination of all three mechanisms into a novel protocol, T-RPL (i) yields high reliability, close to the one of flooding, (ii) with a low energy consumption, similar to route-based approaches, and (iii) improves remarkably the scalability of RPL with respect to downward traffic.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Bhandari:2020:DLD, author = "Ravi Bhandari and Akshay Uttama Nambi and Venkata N. Padmanabhan and Bhaskaran Raman", title = "Driving Lane Detection on Smartphones using Deep Neural Networks", journal = j-TOSN, volume = "16", number = "1", pages = "2:1--2:22", month = feb, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3358797", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Feb 15 07:56:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3358797", abstract = "Current smartphone-based navigation applications fail to provide lane-level information due to poor GPS accuracy. Detecting and tracking a vehicle's lane position on the road assists in lane-level navigation. For instance, it would be important to know \ldots{}", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ahmad:2020:EED, author = "Aasem Ahmad and Zdenek Hanzalek", title = "An Energy-efficient Distributed {TDMA} Scheduling Algorithm for {ZigBee}-like Cluster-tree {WSNs}", journal = j-TOSN, volume = "16", number = "1", pages = "3:1--3:41", month = feb, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3360722", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Feb 15 07:56:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3360722", abstract = "The design of Medium Access Control (MAC) protocol for Wireless Sensor Networks (WSNs) with both limited energy consumption and data delivery time is crucial for industrial and control applications. Since Time Division Multiple Access (TDMA) MAC eliminates the collision occurrence and seeks the minimization of the number of time-slots assigned to each node, the energy consumption of the nodes is reduced. Furthermore, with the proper allocation of the time-slots to the nodes, the transmission delay can be significantly reduced. In this article, we propose TDMA scheduling algorithm for Cluster-tree topology WSNs that meets the timeliness and the energy demands. The algorithm adopts an elegant approach that expresses the timing constraints of the data transmissions as an integer multiple of the length of the schedule period. Moreover, since the distributed algorithm is well-suited to the scarce resources of the WSNs, we focus on the distributed methods that allow each cluster to come up with its allocated time-slots. The algorithm is based on graph theory, such as distributed shortest path, distributed topological ordering, and distributed graph coloring algorithms. The efficiency of the algorithm, regarding the elapsed time to construct the schedule and the energy consumption, is evaluated over benchmark instances up to several thousands of nodes.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Dimri:2020:BUB, author = "Anuj Dimri and Harsimran Singh and Naveen Aggarwal and Bhaskaran Raman and K. K. Ramakrishnan and Divya Bansal", title = "{BaroSense}: Using Barometer for Road Traffic Congestion Detection and Path Estimation with Crowdsourcing", journal = j-TOSN, volume = "16", number = "1", pages = "4:1--4:24", month = feb, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3364697", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Feb 15 07:56:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3364697", abstract = "Traffic congestion on urban roadways is a serious problem requiring novel ways to detect and mitigate it. Determining the routes that lead to the traffic congestion segment is also vital in devising mitigation strategies. Further, crowdsourcing this \ldots{}", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Majid:2020:DTB, author = "Amjad Yousef Majid and Carlo Delle Donne and Kiwan Maeng and Alexei Colin and Kasim Sinan Yildirim and Brandon Lucia and Przemys{\l}aw Pawe{\l}czak", title = "Dynamic Task-based Intermittent Execution for Energy-harvesting Devices", journal = j-TOSN, volume = "16", number = "1", pages = "5:1--5:24", month = feb, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3360285", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Feb 15 07:56:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3360285", abstract = "Energy-neutral Internet of Things requires freeing embedded devices from batteries and powering them from ambient energy. Ambient energy is, however, unpredictable and can only power a device intermittently. Therefore, the paradigm of intermittent \ldots{}", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chiariotti:2020:GTA, author = "Federico Chiariotti and Chiara Pielli and Nicola Laurenti and Andrea Zanella and Michele Zorzi", title = "A Game-Theoretic Analysis of Energy-Depleting Jamming Attacks with a Learning Counterstrategy", journal = j-TOSN, volume = "16", number = "1", pages = "6:1--6:25", month = feb, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3365838", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Feb 15 07:56:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3365838", abstract = "Jamming may become a serious threat in Internet of Things networks of battery-powered nodes, as attackers can disrupt packet delivery and significantly reduce the lifetime of the nodes. In this work, we model an active defense scenario in which an \ldots{}", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Fierro:2020:MOT, author = "Gabe Fierro and Marco Pritoni and Moustafa Abdelbaky and Daniel Lengyel and John Leyden and Anand Prakash and Pranav Gupta and Paul Raftery and Therese Peffer and Greg Thomson and David E. Culler", title = "{Mortar}: an Open Testbed for Portable Building Analytics", journal = j-TOSN, volume = "16", number = "1", pages = "7:1--7:31", month = feb, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3366375", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Feb 15 07:56:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3366375", abstract = "Access to large amounts of real-world data has long been a barrier to the development and evaluation of analytics applications for the built environment. Open datasets exist, but they are limited in their span (how much data is available) and context \ldots{}", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Shen:2020:COM, author = "Shihao Shen and Yiwen Han and Xiaofei Wang and Yan Wang", title = "Computation Offloading with Multiple Agents in Edge-Computing-Supported {IoT}", journal = j-TOSN, volume = "16", number = "1", pages = "8:1--8:27", month = feb, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3372025", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Feb 15 07:56:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3372025", abstract = "With the development of the Internet of Things (IoT) and the birth of various new IoT devices, the capacity of massive IoT devices is facing challenges. Fortunately, edge computing can optimize problems such as delay and connectivity by offloading part \ldots{}", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Bui:2020:SBS, author = "Nam Bui and Anh Nguyen and Phuc Nguyen and Hoang Truong and Ashwin Ashok and Thang Dinh and Robin Deterding and Tam Vu", title = "Smartphone-Based {SpO 2} Measurement by Exploiting Wavelengths Separation and Chromophore Compensation", journal = j-TOSN, volume = "16", number = "1", pages = "9:1--9:30", month = feb, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3360725", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Feb 15 07:56:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3360725", abstract = "Patients with respiratory diseases require frequent and accurate blood oxygen level monitoring. Existing techniques, however, either need a dedicated hardware or fail to predict low saturation levels. To fill in this gap, we propose a phone-based oxygen \ldots{}", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zheng:2020:UMM, author = "Zimu Zheng and Feng Wang and Dan Wang and Liang Zhang", title = "An Urban Mobility Model with Buildings Involved: Bridging Theory to Practice", journal = j-TOSN, volume = "16", number = "1", pages = "10:1--10:24", month = feb, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3366689", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Feb 15 07:56:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3366689", abstract = "Urban Mobility Models (UMMs) are fundamental tools for estimating the population in urban sites and their spatial movements over time. Most existing UMMs were developed primarily in 2D. However, we argue that people's movements and living patterns \ldots{}", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Karapetyan:2020:MAC, author = "Areg Karapetyan and Sid Chi-Kin Chau and Khaled Elbassioni and Syafiq Kamarul Azman and Majid Khonji", title = "Multisensor Adaptive Control System for {IoT}-Empowered Smart Lighting with Oblivious Mobile Sensors", journal = j-TOSN, volume = "16", number = "1", pages = "11:1--11:21", month = feb, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3369392", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Feb 15 07:56:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3369392", abstract = "The Internet-of-Things (IoT) has engendered a new paradigm of integrated sensing and actuation systems for intelligent monitoring and control of smart homes and buildings. One viable manifestation is that of IoT-empowered smart lighting systems, which \ldots{}", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Pal:2020:SSC, author = "Amitangshu Pal and Krishna Kant", title = "Smart Sensing, Communication, and Control in Perishable Food Supply Chain", journal = j-TOSN, volume = "16", number = "1", pages = "12:1--12:41", month = feb, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3360726", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Feb 15 07:56:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3360726", abstract = "Transportation and distribution (T8D) of fresh food products is a substantial and increasing part of the economic activities throughout the world. Unfortunately, fresh food T8D not only suffers from significant spoilage and waste, but also from dismal \ldots{}", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Alaziz:2020:BBM, author = "Musaab Alaziz and Zhenhua Jia and Richard Howard and Xiaodong Lin and Yanyong Zhang", title = "In-Bed Body Motion Detection and Classification System", journal = j-TOSN, volume = "16", number = "2", pages = "13:1--13:26", month = apr, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3372023", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 21 08:21:58 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3372023", abstract = "In-bed motion detection and classification are important techniques that can enable an array of applications, among which are sleep monitoring and abnormal movement detection. In this article, we present a low-cost, low-overhead, and highly robust \ldots{}", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Kim:2020:PRJ, author = "Hyung-Sin Kim and Jeongyeup Paek and David E. Culler and Saewoong Bahk", title = "{PC-RPL}: Joint Control of Routing Topology and Transmission Power in Real Low-Power and Lossy Networks", journal = j-TOSN, volume = "16", number = "2", pages = "14:1--14:32", month = apr, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3372026", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 21 08:21:58 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3372026", abstract = "We present PC-RPL, a transmission power-controlled IPv6 routing protocol for low-power and lossy wireless networks that significantly improves the end-to-end packet delivery performance under heavy traffic compared to the standard RPL. We show through \ldots{}", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2020:CAD, author = "Jianhui Zhang and Siwen Zheng and Tianhao Zhang and Mengmeng Wang and Zhi Li", title = "Charge-Aware Duty Cycling Methods for Wireless Systems under Energy Harvesting Heterogeneity", journal = j-TOSN, volume = "16", number = "2", pages = "15:1--15:23", month = apr, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3372800", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 21 08:21:58 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3372800", abstract = "Recent works have designed systems containing tiny devices to communicate with harvested ambient energy, such as the ambient backscatter and renewable sensor networks. These systems often encounter the heterogeneity and randomness of ambient energy. \ldots{}", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ji:2020:OOP, author = "Xiaoyu Ji and Xinyan Zhou and Miao Xu and Wenyuan Xu and Yabo Dong", title = "{OPCIO}: Optimizing Power Consumption for Embedded Devices via {GPIO} Configuration", journal = j-TOSN, volume = "16", number = "2", pages = "16:1--16:28", month = apr, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3373417", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 21 08:21:58 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3373417", abstract = "Battery lifetime is one of the main challenges that impedes the deployment of energy-constrained wireless networks, such as unattended Internet-of-Things (IoT) systems. To prolong battery lifetime, the duty-cycle mode is utilized in many IoT systems, \ldots{}", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ma:2020:QST, author = "Qiang Ma and Zhichao Cao and Kebin Liu and Xin Miao", title = "{QA-Share}: Toward an Efficient {QoS}-Aware Dispatching Approach for Urban Taxi-Sharing", journal = j-TOSN, volume = "16", number = "2", pages = "17:1--17:21", month = apr, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3375406", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 21 08:21:58 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3375406", abstract = "Taxi-sharing allows occupied taxis to pick up new passengers on the fly, promising to reduce waiting time for taxi riders and increase productivity for drivers. However, it becomes more difficult to strike the balance between a driver's profit and a \ldots{}", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Renner:2020:AIL, author = "Bernd-Christian Renner and Jan Heitmann and Fabian Steinmetz", title = "{ahoi}: Inexpensive, Low-power Communication and Localization for Underwater Sensor Networks and {$ \mu $AUVs}", journal = j-TOSN, volume = "16", number = "2", pages = "18:1--18:46", month = apr, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3376921", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 21 08:21:58 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3376921", abstract = "The recent development of small, cheap AUVs enables a plethora of underwater near- and inshore applications. Among these are monitoring of wind parks, detection of pollution sources, water-quality inspection, and the support of divers during disaster \ldots{}", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Shen:2020:SCP, author = "Yiran Shen and Bowen Du and Weitao Xu and Chengwen Luo and Bo Wei and Lizhen Cui and Hongkai Wen", title = "Securing Cyber-Physical Social Interactions on Wrist-Worn Devices", journal = j-TOSN, volume = "16", number = "2", pages = "19:1--19:22", month = apr, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3378669", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 21 08:21:58 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3378669", abstract = "Since ancient Greece, handshaking has been commonly practiced between two people as a friendly gesture to express trust and respect, or form a mutual agreement. In this article, we show that such physical contact can be used to bootstrap secure cyber. \ldots{}", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2020:HDC, author = "Xinlei Chen and Carlos Ruiz and Sihan Zeng and Liyao Gao and Aveek Purohit and Stefano Carpin and Pei Zhang", title = "{H-DrunkWalk}: Collaborative and Adaptive Navigation for Heterogeneous {MAV} Swarm", journal = j-TOSN, volume = "16", number = "2", pages = "20:1--20:27", month = apr, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3382094", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 21 08:21:58 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3382094", abstract = "Large-scale micro-aerial vehicle (MAV) swarms provide promising solutions for situational awareness in applications such as environmental monitoring, urban surveillance, search and rescue, and so on. However, these scenarios do not provide localization \ldots{}", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2020:TEM, author = "Yanyan Wang and Jia Liu and Xia Wang and Xingyu Chen and Yingli Yan and Lijun Chen", title = "Time-efficient Missing Tag Identification in an Open {RFID} System", journal = j-TOSN, volume = "16", number = "3", pages = "21:1--21:27", month = aug, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3386242", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Aug 15 07:04:17 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3386242", abstract = "Radio Frequency IDentification (RFID) technology has been widely used in missing tag identification to reduce the economic loss caused by theft. Although many advanced works have been proposed, they cannot work properly in an open RFID system with \ldots{}", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Winkler:2020:OOI, author = "Daniel A. Winkler and Miguel {\'A}. Carreira-Perpi{\~n}{\'a}n and Alberto E. Cerpa", title = "{OPTICS: OPTimizing Irrigation Control at Scale}", journal = j-TOSN, volume = "16", number = "3", pages = "22:1--22:38", month = aug, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3372024", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Aug 15 07:04:17 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3372024", abstract = "Lawns, also known as turf, cover an estimated 128,000 km$^2$ in North America alone, with landscape requirements representing 30\% of freshwater consumed in the residential domain. With this consumption comes a large amount of environmental, economic, and \ldots{}", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2020:QAV, author = "Zichuan Xu and Zhiheng Zhang and Weifa Liang and Qiufen Xia and Omer Rana and Guowei Wu", title = "{QoS}-Aware {VNF} Placement and Service Chaining for {IoT} Applications in Multi-Tier Mobile Edge Networks", journal = j-TOSN, volume = "16", number = "3", pages = "23:1--23:27", month = aug, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3387705", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Aug 15 07:04:17 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3387705", abstract = "Mobile edge computing and network function virtualization (NFV) paradigms enable new flexibility and possibilities of the deployment of extreme low-latency services for Internet-of-Things (IoT) applications within the proximity of their users. However, \ldots{}", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Huang:2020:CEC, author = "Ziyao Huang and Weiwei Wu and Feng Shan and Yuxin Bian and Kejie Lu and Zhenjiang Li and Jianping Wang and Jin Wang", title = "{CoUAS}: Enable Cooperation for Unmanned Aerial Systems", journal = j-TOSN, volume = "16", number = "3", pages = "24:1--24:19", month = aug, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3388323", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Aug 15 07:04:17 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3388323", abstract = "In the past decade, unmanned aircraft systems (UASs) have been widely used in various civilian applications, most of which involve only a single unmanned aerial vehicle (UAV). In the near future, more and more UAS applications will be facilitated by the \ldots{}", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhu:2020:LED, author = "Tongxin Zhu and Jianzhong Li and Hong Gao and Yingshu Li", title = "Latency-efficient Data Collection Scheduling in Battery-free Wireless Sensor Networks", journal = j-TOSN, volume = "16", number = "3", pages = "25:1--25:21", month = aug, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3390956", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Aug 15 07:04:17 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3390956", abstract = "The lifetime of battery-powered Wireless Sensor Networks (WSNs) are limited by the batteries equipped in sensors. The appearance of Battery-free Wireless Sensor Networks (BF-WSNs) breaks through this limitation, in which battery-free sensors harvest \ldots{}", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Salimitari:2020:PTA, author = "Mehrdad Salimitari and Shameek Bhattacharjee and Mainak Chatterjee and Yaser P. Fallah", title = "A Prospect Theoretic Approach for Trust Management in {IoT} Networks Under Manipulation Attacks", journal = j-TOSN, volume = "16", number = "3", pages = "26:1--26:26", month = aug, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3392058", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Aug 15 07:04:17 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3392058", abstract = "As Internet of Things (IoT) and Cyber-Physical systems become more ubiquitous in our daily lives, it necessitates the capability to measure the trustworthiness of the aggregate data from such systems to make fair decisions. However, the interpretation \ldots{}", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chang:2020:ISS, author = "Xiangmao Chang and Cheng Peng and Guoliang Xing and Tian Hao and Gang Zhou", title = "{iSleep}: a Smartphone System for Unobtrusive Sleep Quality Monitoring", journal = j-TOSN, volume = "16", number = "3", pages = "27:1--27:32", month = aug, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3392049", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Aug 15 07:04:17 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3392049", abstract = "The quality of sleep is an important factor in maintaining a healthy life style. A great deal of work has been done for designing sleep monitoring systems. However, most of existing solutions bring invasion to users more or less due to the exploration \ldots{}", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Kaur:2020:JMC, author = "Manpreet Kaur and Flora D. Salim and Yongli Ren and Jeffrey Chan and Martin Tomko and Mark Sanderson", title = "Joint Modelling of Cyber Activities and Physical Context to Improve Prediction of Visitor Behaviors", journal = j-TOSN, volume = "16", number = "3", pages = "28:1--28:25", month = aug, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3393692", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Aug 15 07:04:17 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3393692", abstract = "This article investigates the cyber-physical behavior of users in a large indoor shopping mall by leveraging anonymized (opt in) Wi-Fi association and browsing logs recorded by the mall operators. Our analysis shows that many users exhibit a high \ldots{}", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2020:SSB, author = "Yantao Li and Hailong Hu and Zhangqian Zhu and Gang Zhou", title = "{SCANet}: Sensor-based Continuous Authentication with Two-stream Convolutional Neural Networks", journal = j-TOSN, volume = "16", number = "3", pages = "29:1--29:27", month = aug, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3397179", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Aug 15 07:04:17 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3397179", abstract = "Continuous authentication monitors the security of a system throughout the login session on mobile devices. In this article, we present SCANet, a two-stream convolutional neural network--based continuous authentication system that leverages the \ldots{}", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Miao:2020:QAO, author = "Xin Miao and Yanrong Kang and Qiang Ma and Kebin Liu and Lei Chen", title = "Quality-aware Online Task Assignment in Mobile Crowdsourcing", journal = j-TOSN, volume = "16", number = "3", pages = "30:1--30:21", month = aug, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3397180", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Aug 15 07:04:17 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3397180", abstract = "In recent years, mobile crowdsourcing has emerged as a powerful computation paradigm to harness human power to perform spatial tasks such as collecting real-time traffic information and checking product prices in a specific supermarket. A fundamental \ldots{}", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Verma:2020:QPF, author = "Rahul Kumar Verma and K. K. Pattanaik and Sourabh Bharti and Divya Saxena and Jiannong Cao", title = "A Query Processing Framework for Efficient Network Resource Utilization in Shared Sensor Networks", journal = j-TOSN, volume = "16", number = "4", pages = "31:1--31:28", month = oct, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3397809", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Oct 13 09:06:02 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3397809", abstract = "Shared Sensor Network (SSN) refers to a scenario where the same sensing and communication resources are shared and queried by multiple Internet applications. Due to the burgeoning growth in Internet applications, multiple application queries can exhibit \ldots{}", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lee:2020:DRE, author = "Tim Van Der Lee and Georgios Exarchakos and Sonia Heemstra {De Groot}", title = "Distributed Reliable and Energy-Efficient Scheduling for {LR-WPANs}", journal = j-TOSN, volume = "16", number = "4", pages = "32:1--32:20", month = oct, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3399805", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Oct 13 09:06:02 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3399805", abstract = "Pervasiveness of wireless networks drives the heterogeneity and density of devices in a vast diversity of environments. To achieve high reliability and low energy consumption while enabling pervasiveness is inherently a resource allocation problem. In \ldots{}", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhu:2020:RAH, author = "Shaoyi Zhu and Weiqing Huang and Chenggang Jia and Siye Wang and Bowen Li and Yanfang Zhang", title = "{RF-AMOC}: Human-related {RFID} Tag Movement Identification in Access Management of Carries", journal = j-TOSN, volume = "16", number = "4", pages = "33:1--33:23", month = oct, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3399678", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Oct 13 09:06:02 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3399678", abstract = "The use of radio-frequency identification (RFID) technology in supply chain has been a fairly mature application in recent years, which can be extended to the field of carrier management for the inventory and access control of sensitive files and mobile \ldots{}", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhao:2020:DPS, author = "Ping Zhao and Jiaxin Sun and Guanglin Zhang", title = "{DAML}: Practical Secure Protocol for Data Aggregation Based on Machine Learning", journal = j-TOSN, volume = "16", number = "4", pages = "34:1--34:18", month = oct, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3404192", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Oct 13 09:06:02 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3404192", abstract = "Data aggregation based on machine learning (ML), in mobile edge computing, allows participants to send ephemeral parameter updates of local ML on their private data instead of the exact data to the untrusted aggregator. However, it still enables the \ldots{}", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cheng:2020:ICU, author = "Yushi Cheng and Xiaoyu Ji and Xiaopeng Li and Tianchen Zhang and Sharaf Malebary and Xianshan Qu and Wenyuan Xu", title = "Identifying Child Users via Touchscreen Interactions", journal = j-TOSN, volume = "16", number = "4", pages = "35:1--35:25", month = oct, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3403574", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Oct 13 09:06:02 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3403574", abstract = "With the proliferation of smart devices, children can be easily exposed to violent or adult-only content on the Internet. Without any precaution, the premature and unsupervised use of smart devices can be harmful to both children and their parents. Thus,. \ldots{}", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Fraternali:2020:AAC, author = "Francesco Fraternali and Bharathan Balaji and Yuvraj Agarwal and Rajesh K. Gupta", title = "{ACES}: Automatic Configuration of Energy Harvesting Sensors with Reinforcement Learning", journal = j-TOSN, volume = "16", number = "4", pages = "36:1--36:31", month = oct, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3404191", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Oct 13 09:06:02 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3404191", abstract = "Many modern smart building applications are supported by wireless sensors to sense physical parameters, given the flexibility they offer and the reduced cost of deployment. However, most wireless sensors are powered by batteries today, and large \ldots{}", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xing:2020:DRL, author = "Tianzhang Xing and Qing Wang and Chase Q. Wu and Wei Xi and Xiaojiang Chen", title = "{dWatch}: a Reliable and Low-Power Drowsiness Detection System for Drivers Based on Mobile Devices", journal = j-TOSN, volume = "16", number = "4", pages = "37:1--37:22", month = oct, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3407899", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Oct 13 09:06:02 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3407899", abstract = "Drowsiness detection is critical to driver safety, considering thousands of deaths caused by drowsy driving annually. Professional equipment is capable of providing high detection accuracy, but the high cost limits their applications in practice. The \ldots{}", acknowledgement = ack-nhfb, articleno = "37", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Jiang:2020:RBN, author = "Linshan Jiang and Rui Tan and Arvind Easwaran", title = "Resilience Bounds of Network Clock Synchronization with Fault Correction", journal = j-TOSN, volume = "16", number = "4", pages = "38:1--38:30", month = oct, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3409804", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Oct 13 09:06:02 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3409804", abstract = "Naturally occurring disturbances and malicious attacks can lead to faults in synchronizing the clocks of two network nodes. In this article, we investigate the fundamental resilience bounds of network clock synchronization for a system of N nodes \ldots{}", acknowledgement = ack-nhfb, articleno = "38", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2020:IMC, author = "Zhao Liu and Kenli Li and Xu Zhou and Ningbo Zhu and Keqin Li", title = "Incentive Mechanisms for Crowdsensing: Motivating Users to Preprocess Data for the Crowdsourcer", journal = j-TOSN, volume = "16", number = "4", pages = "39:1--39:24", month = oct, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3409475", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Oct 13 09:06:02 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3409475", abstract = "Crowdsensing is a popular method that leverages a crowd of sensor users to collect data. For many crowdsensing applications, the collected raw data need to be preprocessed before further analysis, and the preprocessing work is mainly done by the \ldots{}", acknowledgement = ack-nhfb, articleno = "39", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2020:PLT, author = "Daibo Liu and Zhichao Cao and Mengshu Hou and Huigui Rong and Hongbo Jiang", title = "Pushing the Limits of Transmission Concurrency for Low Power Wireless Networks", journal = j-TOSN, volume = "16", number = "4", pages = "40:1--40:29", month = oct, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3406834", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Oct 13 09:06:02 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3406834", abstract = "Concurrent transmission (CT) has been widely adopted to optimize the throughput of various data transmissions in wireless networks, such as bulk data dissemination and high-rate data collection. In CT, besides the possible data frame collision at \ldots{}", acknowledgement = ack-nhfb, articleno = "40", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Corbalan:2020:UWC, author = "Pablo Corbal{\'a}n and Gian Pietro Picco", title = "Ultra-wideband Concurrent Ranging", journal = j-TOSN, volume = "16", number = "4", pages = "41:1--41:41", month = oct, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3409477", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Oct 13 09:06:02 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3409477", abstract = "We propose a novel concurrent ranging technique for distance estimation with ultra-wideband (UWB) radios. Conventional schemes assume that the necessary packet exchanges occur in isolation to avoid collisions. Concurrent ranging relies on the \ldots{}", acknowledgement = ack-nhfb, articleno = "41", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhao:2020:UST, author = "Yi Zhao and Zimu Zhou and Wang Xu and Tongtong Liu and Zheng Yang", title = "Urban Scale Trade Area Characterization for Commercial Districts with Cellular Footprints", journal = j-TOSN, volume = "16", number = "4", pages = "42:1--42:20", month = oct, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3412372", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Oct 13 09:06:02 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3412372", abstract = "Understanding customer mobility patterns to commercial districts is crucial for urban planning, facility management, and business strategies. Trade areas are a widely applied measure to quantify where the visitors are from. Traditional trade area \ldots{}", acknowledgement = ack-nhfb, articleno = "42", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Weiss:2021:DBS, author = "Wolfgang Weiss and V{\'\i}ctor J. Exp{\'o}sito Jim{\'e}nez and Herwig Zeiner", title = "Dynamic Buffer Sizing for Out-of-order Event Compensation for Time-sensitive Applications", journal = j-TOSN, volume = "17", number = "1", pages = "1:1--1:23", month = jan, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3410403", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Mar 28 09:51:55 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3410403", abstract = "Today's sensor network implementations often comprise various types of nodes connected with different types of networks. These and various other aspects influence the delay of transmitting data and therefore of out-of-order data occurrences. This turns \ldots{}", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Dong:2021:THS, author = "Wei Dong and Borui Li and Gaoyang Guan and Zhihao Cheng and Jiadong Zhang and Yi Gao", title = "{TinyLink}: a Holistic System for Rapid Development of {IoT} Applications", journal = j-TOSN, volume = "17", number = "1", pages = "2:1--2:29", month = jan, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3412366", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Mar 28 09:51:55 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3412366", abstract = "Rapid development is essential for IoT (Internet of Things) application developers to obtain first-mover advantages and reduce the development cost. In this article, we present TinyLink, a holistic system for rapid development of IoT applications. The \ldots{}", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lin:2021:SEE, author = "Deyu Lin and Quan Wang and Weidong Min and Jianfeng Xu and Zhiqiang Zhang", title = "A Survey on Energy-Efficient Strategies in Static Wireless Sensor Networks", journal = j-TOSN, volume = "17", number = "1", pages = "3:1--3:48", month = jan, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3414315", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Mar 28 09:51:55 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3414315", abstract = "A comprehensive analysis on the energy-efficient strategy in static Wireless Sensor Networks (WSNs) that are not equipped with any energy harvesting modules is conducted in this article. First, a novel generic mathematical definition of Energy \ldots{}", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2021:RJA, author = "Gonglong Chen and Wei Dong", title = "Reactive Jamming and Attack Mitigation over Cross-Technology Communication Links", journal = j-TOSN, volume = "17", number = "1", pages = "4:1--4:25", month = jan, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3418210", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Mar 28 09:51:55 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3418210", abstract = "Recently, Cross-Technology Communication (CTC), allowing the direct communication among heterogeneous devices with incompatible physical layers, has attracted much research attention. Many efficient CTC protocols have been proposed to demonstrate its \ldots{}", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Hare:2021:PRP, author = "James Z. Hare and Junnan Song and Shalabh Gupta and Thomas A. Wettergren", title = "{POSE.R}: Prediction-based Opportunistic Sensing for Resilient and Efficient Sensor Networks", journal = j-TOSN, volume = "17", number = "1", pages = "5:1--5:41", month = jan, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3419755", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Mar 28 09:51:55 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3419755", abstract = "The article presents a distributed algorithm, called Prediction-based Opportunistic Sensing for Resilient and Efficient Sensor Networks (POSE.R), where the sensor nodes utilize predictions of the targets' positions to probabilistically control their \ldots{}", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2021:SSD, author = "Liang Liu and Bo Chen and Huadong Ma", title = "{SDCN}: Sensory Data-Centric Networking for Building the Sensing Layer of {IoT}", journal = j-TOSN, volume = "17", number = "1", pages = "6:1--6:25", month = jan, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3402452", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Mar 28 09:51:55 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3402452", abstract = "Building an open global sensing layer is critical for the Internet of Things (IoT). In this article, we present a Sensory Data-Centric Networking (SDCN) architecture for inter-networking two main networked sensing systems in IoT-wireless sensor networks \ldots{}", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yang:2021:MMN, author = "Panlong Yang and Tao Wu and Haipeng Dai and Xunpeng Rao and Xiaoyu Wang and Peng-Jun Wan and Xin He", title = "{MORE}: Multi-node Mobile Charging Scheduling for Deadline Constraints", journal = j-TOSN, volume = "17", number = "1", pages = "7:1--7:21", month = jan, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3410454", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Mar 28 09:51:55 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3410454", abstract = "Due to the merit without requiring charging cable, wireless power transfer technology has drawn rising attention as a new method to replenish energy for Wireless Rechargeable Sensor Networks. In this article, we study the mobile charger scheduling \ldots{}", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Muzaffar:2021:DEC, author = "Shahzad Muzaffar and Ibrahim (Abe) M. Elfadel", title = "Dynamic Edge-coded Protocols for Low-power, Device-to-device Communication", journal = j-TOSN, volume = "17", number = "1", pages = "8:1--8:24", month = jan, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3426181", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Mar 28 09:51:55 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3426181", abstract = "Clock and Data Recovery (CDR) has been a foundational receiver component in serial communications. Yet this component is known to add significant design complexity to the receiver and to consume significant resources in area and power. In the resource-. \ldots{}", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2021:EED, author = "Yufan Zhang and Ertao Li and Yi-Hua Zhu", title = "Energy-efficient Dual-codebook-based Backscatter Communications for Wireless Powered Networks", journal = j-TOSN, volume = "17", number = "1", pages = "9:1--9:20", month = jan, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3426885", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Mar 28 09:51:55 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3426885", abstract = "The common backscatter communications (ComBC), widely applied in wireless powered networks such as the RFID systems, exhibit the shortcoming that only a few bits are backscattered at a time due to energy limitation. It is significant to improve energy \ldots{}", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2021:EEC, author = "Yunhao Liu", title = "Editorial from the {Editor-in-Chief}", journal = j-TOSN, volume = "17", number = "2", pages = "10e:1--10e:2", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3448130", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Jun 27 07:55:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3448130", acknowledgement = ack-nhfb, articleno = "10e", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Bessos:2021:ISN, author = "Mai Ben Adar Bessos and Amir Herzberg", title = "Intercepting a Stealthy Network", journal = j-TOSN, volume = "17", number = "2", pages = "10:1--10:39", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3431223", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Jun 27 07:55:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3431223", abstract = "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 \ldots{}", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wei:2021:DDS, author = "Peter Wei and Xiaofan Jiang", title = "A Data-driven System for City-wide Energy Footprinting and Apportionment", journal = j-TOSN, volume = "17", number = "2", pages = "11:1--11:24", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3433639", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Jun 27 07:55:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3433639", abstract = "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 \ldots{}", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Roy:2021:OSD, author = "Dhrubojyoti Roy and Sangeeta Srivastava and Aditya Kusupati and Pranshu Jain and Manik Varma and Anish Arora", title = "One Size Does Not Fit All: Multi-scale, Cascaded {RNNs} for Radar Classification", journal = j-TOSN, volume = "17", number = "2", pages = "12:1--12:27", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3439957", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Jun 27 07:55:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3439957", abstract = "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 \ldots{}", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ma:2021:BEH, author = "Qiang Ma and Zhichao Cao and Wei Gong and Xiaolong Zheng", title = "{BOND}: Exploring Hidden Bottleneck Nodes in Large-scale Wireless Sensor Networks", journal = j-TOSN, volume = "17", number = "2", pages = "13:1--13:21", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3439956", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Jun 27 07:55:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3439956", abstract = "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' \ldots{}", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chang:2021:DDL, author = "Xiangmao Chang and Gangkai Li and Guoliang Xing and Kun Zhu and Linlin Tu", title = "{DeepHeart}: a Deep Learning Approach for Accurate Heart Rate Estimation from {PPG} Signals", journal = j-TOSN, volume = "17", number = "2", pages = "14:1--14:18", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3441626", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Jun 27 07:55:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3441626", abstract = "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's physical activities make it difficult to get the accurate HR estimation from \ldots{}", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2021:CQC, author = "Yuting Wang and Xiaolong Zheng and Liang Liu and Huadong Ma", title = "{CoHop}: Quantitative Correlation-based Channel Hopping for Low-power Wireless Networks", journal = j-TOSN, volume = "17", number = "2", pages = "15:1--15:29", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3440248", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Jun 27 07:55:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3440248", abstract = "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 \ldots{}", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Peng:2021:TPC, author = "Chaoqun Peng and Xinglin Zhang and Zhaojing Ou and Junna Zhang", title = "Task Planning Considering Location Familiarity in Spatial Crowdsourcing", journal = j-TOSN, volume = "17", number = "2", pages = "16:1--16:24", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3442698", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Jun 27 07:55:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3442698", abstract = "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 \ldots{}", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2021:PLB, author = "Yifan Zhang and Xinglin Zhang", title = "Price Learning-based Incentive Mechanism for Mobile Crowd Sensing", journal = j-TOSN, volume = "17", number = "2", pages = "17:1--17:24", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3447622", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Jun 27 07:55:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3447622", abstract = "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 \ldots{}", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2021:SBI, author = "Jingao Xu and Erqun Dong and Qiang Ma and Chenshu Wu and Zheng Yang", title = "Smartphone-Based Indoor Visual Navigation with Leader-Follower Mode", journal = j-TOSN, volume = "17", number = "2", pages = "18:1--18:22", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3448417", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Jun 27 07:55:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3448417", abstract = "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 \ldots{}", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2021:SER, author = "Chaohao Li and Xiaoyu Ji and Bin Wang and Kai Wang and Wenyuan Xu", title = "{SenCS}: Enabling Real-time Indoor Proximity Verification via Contextual Similarity", journal = j-TOSN, volume = "17", number = "2", pages = "19:1--19:22", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3449071", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Jun 27 07:55:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3449071", abstract = "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 \ldots{}", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Concas:2021:LCO, author = "Francesco Concas and Julien Mineraud and Eemil Lagerspetz and Samu Varjonen and Xiaoli Liu and Kai Puolam{\"a}ki and Petteri Nurmi and Sasu Tarkoma", title = "Low-Cost Outdoor Air Quality Monitoring and Sensor Calibration: a Survey and Critical Analysis", journal = j-TOSN, volume = "17", number = "2", pages = "20:1--20:44", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3446005", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sun Jun 27 07:55:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3446005", abstract = "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 \ldots{}", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sun:2021:IDC, author = "Danfeng Sun and Jia Wu and Jian Yang and Huifeng Wu", title = "Intelligent Data Collaboration in Heterogeneous-device {IoT} Platforms", journal = j-TOSN, volume = "17", number = "3", pages = "22:1--22:17", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3427912", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3427912", abstract = "The merging boundaries between edge computing and deep learning are forging a new blueprint for the Internet of Things (IoT). However, the low-quality of data in many IoT platforms, especially those composed of heterogeneous devices, is hindering the \ldots{}", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2021:SEM, author = "Beilun Wang and Jiaqi Zhang and Yan Zhang and Meng Wang and Sen Wang", title = "Scalable Estimator for Multi-task {Gaussian} Graphical Models Based in an {IoT} Network", journal = j-TOSN, volume = "17", number = "3", pages = "23:1--23:33", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3432312", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3432312", abstract = "Recently, the Internet of Things (IoT) receives significant interest due to its rapid development. But IoT applications still face two challenges: heterogeneity and large scale of IoT data. Therefore, how to efficiently integrate and process these \ldots{}", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Le:2021:DRL, author = "Duc Van Le and Rongrong Wang and Yingbo Liu and Rui Tan and Yew-Wah Wong and Yonggang Wen", title = "Deep Reinforcement Learning for Tropical Air Free-cooled Data Center Control", journal = j-TOSN, volume = "17", number = "3", pages = "24:1--24:28", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3439332", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3439332", abstract = "Air free-cooled data centers (DCs) have not existed in the tropical zone due to the unique challenges of year-round high ambient temperature and relative humidity (RH). The increasing availability of servers that can tolerate higher temperatures and RH \ldots{}", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2021:PPD, author = "Jing Wang and Libing Wu and Sherali Zeadally and Muhammad Khurram Khan and Debiao He", title = "Privacy-preserving Data Aggregation against Malicious Data Mining Attack for {IoT}-enabled Smart Grid", journal = j-TOSN, volume = "17", number = "3", pages = "25:1--25:25", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3440249", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3440249", abstract = "Internet of Things (IoT)-enabled smart grids can achieve more reliable and high-frequency data collection and transmission compared with existing grids. However, this frequent data processing may consume a lot of bandwidth, and even put the user's privacy \ldots{}", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhao:2021:LLD, author = "Guangrong Zhao and Bowen Du and Yiran Shen and Zhenyu Lao and Lizhen Cui and Hongkai Wen", title = "{LeaD}: Learn to Decode Vibration-based Communication for Intelligent {Internet of Things}", journal = j-TOSN, volume = "17", number = "3", pages = "26:1--26:25", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3440250", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3440250", abstract = "In this article, we propose, LeaD, a new vibration-based communication protocol to Learn the unique patterns of vibration to Decode the short messages transmitted to smart IoT devices. Unlike the existing vibration-based communication protocols that \ldots{}", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2021:QQA, author = "Borui Li and Wei Dong and Gaoyang Guan and Jiadong Zhang and Tao Gu and Jiajun Bu and Yi Gao", title = "{Queec}: {QoE}-aware Edge Computing for {IoT} Devices under Dynamic Workloads", journal = j-TOSN, volume = "17", number = "3", pages = "27:1--27:23", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3442363", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3442363", abstract = "Many IoT applications have the requirements of conducting complex IoT events processing (e.g., speech recognition) that are hardly supported by low-end IoT devices due to limited resources. Most existing approaches enable complex IoT event processing on \ldots{}", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2021:RND, author = "Ning Chen and Tie Qiu and Mahmoud Daneshmand and Dapeng Oliver Wu", title = "Robust Networking: Dynamic Topology Evolution Learning for {Internet of Things}", journal = j-TOSN, volume = "17", number = "3", pages = "28:1--28:23", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3446937", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3446937", abstract = "The Internet of Things (IoT) has been extensively deployed in smart cities. However, with the expanding scale of networking, the failure of some nodes in the network severely affects the communication capacity of IoT applications. Therefore, researchers \ldots{}", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2021:ECC, author = "Xiaolong Xu and Zijie Fang and Jie Zhang and Qiang He and Dongxiao Yu and Lianyong Qi and Wanchun Dou", title = "Edge Content Caching with Deep Spatiotemporal Residual Network for {IoV} in Smart City", journal = j-TOSN, volume = "17", number = "3", pages = "29:1--29:33", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3447032", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3447032", abstract = "Internet of Vehicles (IoV) enables numerous in-vehicle applications for smart cities, driving increasing service demands for processing various contents (e.g., videos). Generally, for efficient service delivery, the contents from the service providers are \ldots{}", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ju:2021:ESD, author = "Weiyu Ju and Dong Yuan and Wei Bao and Liming Ge and Bing Bing Zhou", title = "{eDeepSave}: Saving {DNN} Inference using Early Exit During Handovers in Mobile Edge Environment", journal = j-TOSN, volume = "17", number = "3", pages = "30:1--30:28", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3447267", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3447267", abstract = "Recent advances in deep neural networks (DNNs) have substantially improved the accuracy of intelligent applications. One effective scheme known as DNN partition further improves the speed of the inference by partitioning the DNN to a mobile device and its \ldots{}", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2021:CBE, author = "Meng Liu and Hongsheng Hu and Haolong Xiang and Chi Yang and Lingjuan Lyu and Xuyun Zhang", title = "Clustering-based Efficient Privacy-preserving Face Recognition Scheme without Compromising Accuracy", journal = j-TOSN, volume = "17", number = "3", pages = "31:1--31:27", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3448414", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3448414", abstract = "Recently, biometric identification has been extensively used for border control. Some face recognition systems have been designed based on Internet of Things. But the rich personal information contained in face images can cause severe privacy breach and \ldots{}", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Nguyen:2021:SSI, author = "Vanh Khuyen Nguyen and Wei Emma Zhang and Adnan Mahmood", title = "Semi-supervised Intrusive Appliance Load Monitoring in Smart Energy Monitoring System", journal = j-TOSN, volume = "17", number = "3", pages = "32:1--32:20", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3448415", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3448415", abstract = "Intrusive Load Monitoring (ILM) is a method to measure and collect the energy consumption data of individual appliances via smart plugs or smart sockets. A major challenge of ILM is automatic appliance identification, in which the system is able to \ldots{}", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liang:2021:EEC, author = "Yunji Liang and Xin Wang and Zhiwen Yu and Bin Guo and Xiaolong Zheng and Sagar Samtani", title = "Energy-efficient Collaborative Sensing: Learning the Latent Correlations of Heterogeneous Sensors", journal = j-TOSN, volume = "17", number = "3", pages = "33:1--33:28", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3448416", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3448416", abstract = "With the proliferation of Internet of Things (IoT) devices in the consumer market, the unprecedented sensing capability of IoT devices makes it possible to develop advanced sensing and complex inference tasks by leveraging heterogeneous sensors embedded \ldots{}", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2021:GGB, author = "Xin Li and Dawei Li", title = "{GPFS}: a Graph-based Human Pose Forecasting System for Smart Home with Online Learning", journal = j-TOSN, volume = "17", number = "3", pages = "34:1--34:19", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3460199", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:37 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3460199", abstract = "Forecasting human poses given a sequence of historical pose frames has several important applications, especially in the domain of smart home safety. Recently, computer vision-based human pose forecasting has made a breakthrough using deep learning \ldots{}", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Dong:2021:ESC, author = "Liang Dong and Jingao Xu and Guoxuan Chi and Danyang Li and Xinglin Zhang and Jianbo Li and Qiang Ma and Zheng Yang", title = "Enabling Surveillance Cameras to Navigate", journal = j-TOSN, volume = "17", number = "4", pages = "35:1--35:20", month = nov, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3446633", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:21:31 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3446633", abstract = "Smartphone localization is essential to a wide spectrum of applications in the era of mobile computing. The ubiquity of smartphone mobile cameras and surveillance ambient cameras holds promise for offering sub-meter accuracy localization services thanks \ldots{}", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2021:RRL, author = "Tang Liu and Baijun Wu and Wenzheng Xu and Xianbo Cao and Jian Peng and Hongyi Wu", title = "{RLC}: a Reinforcement Learning-Based Charging Algorithm for Mobile Devices", journal = j-TOSN, volume = "17", number = "4", pages = "36:1--36:23", month = jul, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3453682", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:38 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3453682", abstract = "Wireless charging has been demonstrated as a promising technology for prolonging device operational lifetimes in Wireless Rechargeable Networks (WRNs). To schedule a mobile charger to move along a predesigned trajectory to charge devices, most existing \ldots{}", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2021:ECA, author = "Quan Chen and Zhipeng Cai and Lianglun Cheng and Hong Gao and Jianzhong Li", title = "Energy-collision-aware Minimum Latency Aggregation Scheduling for Energy-harvesting Sensor Networks", journal = j-TOSN, volume = "17", number = "4", pages = "40:1--40:34", month = jul, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3461013", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:38 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3461013", abstract = "The emerging energy-harvesting technology enables charging sensor batteries with renewable energy sources, which has been effectively integrated into Wireless Sensor Networks (EH-WSNs). Due to the limited energy-harvesting capacities of tiny sensors, the \ldots{}", acknowledgement = ack-nhfb, articleno = "40", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhu:2021:DBA, author = "Yi Zhu and Abhishek Gupta and Shaohan Hu and Weida Zhong and Lu Su and Chunming Qiao", title = "Driver Behavior-aware Parking Availability Crowdsensing System Using Truth Discovery", journal = j-TOSN, volume = "17", number = "4", pages = "41:1--41:26", month = jul, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3460200", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:38 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3460200", abstract = "Spot-level parking availability information (the availability of each spot in a parking lot) is in great demand, as it can help reduce time and energy waste while searching for a parking spot. In this article, we propose a crowdsensing system called SpotE \ldots{}", acknowledgement = ack-nhfb, articleno = "41", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lin:2021:SVF, author = "Yuxiang Lin and Wei Dong and Yi Gao and Tao Gu", title = "{SateLoc}: a Virtual Fingerprinting Approach to Outdoor {LoRa} Localization Using Satellite Images", journal = j-TOSN, volume = "17", number = "4", pages = "43:1--43:28", month = jul, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3461012", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:38 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3461012", abstract = "With the increasing relevance of the Internet of Things and large-scale location-based services, LoRa localization has been attractive due to its low-cost, low-power, and long-range properties. However, existing localization approaches based on received \ldots{}", acknowledgement = ack-nhfb, articleno = "43", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhou:2021:DSS, author = "Pengzhan Zhou and Cong Wang and Yuanyuan Yang", title = "Design of Self-sustainable Wireless Sensor Networks with Energy Harvesting and Wireless Charging", journal = j-TOSN, volume = "17", number = "4", pages = "45:1--45:38", month = jul, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3459081", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jul 17 08:57:38 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3459081", abstract = "Energy provisioning plays a key role in the sustainable operations of Wireless Sensor Networks (WSNs). Recent efforts deploy multi-source energy harvesting sensors to utilize ambient energy. Meanwhile, wireless charging is a reliable energy source not \ldots{}", acknowledgement = ack-nhfb, articleno = "45", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2022:GTU, author = "Yi Zhang and Yue Zheng and Guidong Zhang and Kun Qian and Chen Qian and Zheng Yang", title = "{GaitSense}: Towards Ubiquitous Gait-Based Human Identification with {Wi-Fi}", journal = j-TOSN, volume = "18", number = "1", pages = "1:1--1:24", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3466638", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3466638", abstract = "Gait, the walking manner of a person, has been perceived as a physical and behavioral trait for human identification. Compared with cameras and wearable sensors, Wi-Fi-based gait recognition is more attractive because Wi-Fi infrastructure is almost \ldots{}", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Bezerra:2022:AMP, author = "Pamela Bezerra and Po-Yu Chen and Julie A. McCann and Weiren Yu", title = "Adaptive Monitor Placement for Near Real-time Node Failure Localisation in Wireless Sensor Networks", journal = j-TOSN, volume = "18", number = "1", pages = "2:1--2:41", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3466639", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3466639", abstract = "As sensor-based networks become more prevalent, scaling to unmanageable numbers or deployed in difficult to reach areas, real-time failure localisation is becoming essential for continued operation. Network tomography, a system and application-independent \ldots{}", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Guo:2022:TEC, author = "Xiuzhen Guo and Yuan He and Jia Zhang and Haotian Jiang and Zihao Yu and Xin Na", title = "Taming the Errors in Cross-Technology Communication: a Probabilistic Approach", journal = j-TOSN, volume = "18", number = "1", pages = "3:1--3:20", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3469031", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3469031", abstract = "Cross-Technology Communication (CTC) emerges as a technology to enable direct communication across different wireless technologies. The state of the art on CTC employs physical-level emulation. Due to the protocol incompatibility and the hardware \ldots{}", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yang:2022:ASE, author = "Fan Yang and Ashok Samraj Thangarajan and Gowri Sankar Ramachandran and Wouter Joosen and Danny Hughes", title = "{AsTAR}: Sustainable Energy Harvesting for the {Internet of Things} through Adaptive Task Scheduling", journal = j-TOSN, volume = "18", number = "1", pages = "4:1--4:34", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3467894", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3467894", abstract = "Battery-free Internet-of-Things devices equipped with energy harvesting hold the promise of extended operational lifetime, reduced maintenance costs, and lower environmental impact. Despite this clear potential, it remains complex to develop applications \ldots{}", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Song:2022:DMT, author = "Qun Song and Zhenyu Yan and Rui Tan", title = "{DeepMTD}: Moving Target Defense for Deep Visual Sensing against Adversarial Examples", journal = j-TOSN, volume = "18", number = "1", pages = "5:1--5:32", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3469032", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3469032", abstract = "Deep learning-based visual sensing has achieved attractive accuracy but is shown vulnerable to adversarial attacks. Specifically, once the attackers obtain the deep model, they can construct adversarial examples to mislead the model to yield wrong \ldots{}", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Shi:2022:ECTa, author = "Junyang Shi and Di Mu and Mo Sha", title = "Enabling Cross-technology Communication from {LoRa} to {ZigBee} via Payload Encoding in Sub-{1 GHz} Bands", journal = j-TOSN, volume = "18", number = "1", pages = "6:1--6:26", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3470452", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3470452", abstract = "Low-power wireless mesh networks (LPWMNs) have been widely used in wireless monitoring and control applications. Although LPWMNs work satisfactorily most of the time thanks to decades of research, they are often complex, inelastic to change, and difficult \ldots{}", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2022:ORP, author = "Yu Liu and Joshua Comden and Zhenhua Liu and Yuanyuan Yang", title = "Online Resource Provisioning for Wireless Data Collection", journal = j-TOSN, volume = "18", number = "1", pages = "7:1--7:2", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3470648", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3470648", abstract = "Wireless data collection requires a sequence of resource provisioning decisions due to the limited battery capacity of wireless sensors. The corresponding online resource provisioning problem is challenging. Recently, many prediction methods have been \ldots{}", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wu:2022:PFG, author = "Hang Wu and Jiajie Tan and S.-H. Gary Chan", title = "Pedometer-free Geomagnetic Fingerprinting with Casual Walking Speed", journal = j-TOSN, volume = "18", number = "1", pages = "8:1--8:21", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3470850", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3470850", abstract = "The geomagnetic field has been wildly advocated as an effective signal for fingerprint-based indoor localization due to its omnipresence and local distinctive features. Prior survey-based approaches to collect magnetic fingerprints often required \ldots{}", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lan:2022:EAC, author = "Guohao Lan and Zida Liu and Yunfan Zhang and Tim Scargill and Jovan Stojkovic and Carlee Joe-Wong and Maria Gorlatova", title = "Edge-assisted Collaborative Image Recognition for Mobile Augmented Reality", journal = j-TOSN, volume = "18", number = "1", pages = "9:1--9:31", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3469033", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3469033", abstract = "Mobile Augmented Reality (AR), which overlays digital content on the real-world scenes surrounding a user, is bringing immersive interactive experiences where the real and virtual worlds are tightly coupled. To enable seamless and precise AR experiences, \ldots{}", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gu:2022:AAS, author = "Chaojie Gu and Linshan Jiang and Rui Tan and Mo Li and Jun Huang", title = "Attack-aware Synchronization-free Data Timestamping in {LoRaWAN}", journal = j-TOSN, volume = "18", number = "1", pages = "10:1--10:31", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3474368", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3474368", abstract = "Low-power wide-area network technologies such as long-range wide-area network (LoRaWAN) are promising for collecting low-rate monitoring data from geographically distributed sensors, in which timestamping the sensor data is a critical system function. \ldots{}", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2022:ACC, author = "Ran Xu and Rakesh Kumar and Pengcheng Wang and Peter Bai and Ganga Meghanath and Somali Chaterji and Subrata Mitra and Saurabh Bagchi", title = "{ApproxNet}: Content and Contention-Aware Video Object Classification System for Embedded Clients", journal = j-TOSN, volume = "18", number = "1", pages = "11:1--11:27", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3463530", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3463530", abstract = "Videos take a lot of time to transport over the network, hence running analytics on the live video on embedded or mobile devices has become an important system driver. Considering such devices, e.g., surveillance cameras or AR/VR gadgets, are resource \ldots{}", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Giaretta:2022:SCF, author = "Alberto Giaretta and Nicola Dragoni and Fabio Massacci", title = "{S$ \times $C4IoT}: a Security-by-contract Framework for Dynamic Evolving {IoT} Devices", journal = j-TOSN, volume = "18", number = "1", pages = "12:1--12:51", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3480462", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3480462", abstract = "The Internet of Things (IoT) revolutionised the way devices, and human beings, cooperate and interact. The interconnectivity and mobility brought by IoT devices led to extremely variable networks, as well as unpredictable information flows. In turn, \ldots{}", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lu:2022:SSK, author = "Youjing Lu and Fan Wu and Qianyi Huang and Shaojie Tang and Linghe Kong and Guihai Chen", title = "Shared Secret Key Generation by Exploiting Inaudible Acoustic Channels", journal = j-TOSN, volume = "18", number = "1", pages = "13:1--13:26", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3480461", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3480461", abstract = "To build a secure wireless networking system, it is essential that the cryptographic key is known only to the two (or more) communicating parties. Existing key extraction schemes put the devices into physical proximity and utilize the common inherent \ldots{}", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2022:LQE, author = "Jia Zhang and Xiuzhen Guo and Haotian Jiang and Xiaolong Zheng and Yuan He", title = "Link Quality Estimation of Cross-Technology Communication: The Case with Physical-Level Emulation", journal = j-TOSN, volume = "18", number = "1", pages = "14:1--14:20", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3482527", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3482527", abstract = "Research on cross-technology communication (CTC) has made rapid progress in recent years. While the CTC links are complex and dynamic, how to estimate the quality of a CTC link remains an open and challenging problem. Through our observation and study, we \ldots{}", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2022:WLS, author = "Danyang Li and Jingao Xu and Zheng Yang and Chenshu Wu and Jianbo Li and Nicholas D. Lane", title = "Wireless Localization with Spatial-Temporal Robust Fingerprints", journal = j-TOSN, volume = "18", number = "1", pages = "15:1--15:23", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3488281", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jan 7 08:17:53 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3488281", abstract = "Indoor localization has gained increasing attention in the era of the Internet of Things. Among various technologies, WiFi fingerprint-based localization has become a mainstream solution. However, RSS fingerprints suffer from critical drawbacks of spatial \ldots{}", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cui:2022:SES, author = "Hang Cui and Tarek Abdelzaher", title = "{SenseLens}: an Efficient Social Signal Conditioning System for True Event Detection", journal = j-TOSN, volume = "18", number = "2", pages = "16:1--16:27", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3485047", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3485047", abstract = "This article narrows the gap between physical sensing systems that measure physical signals and social sensing systems that measure information signals by (i) defining a novel algorithm for extracting information signals (building on results from text \ldots{}).", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2022:SPM, author = "Jing Li and Weifa Liang and Zichuan Xu and Xiaohua Jia and Wanlei Zhou", title = "Service Provisioning for Multi-source {IoT} Applications in Mobile Edge Computing", journal = j-TOSN, volume = "18", number = "2", pages = "17:1--17:25", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3484200", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3484200", abstract = "We are embracing an era of Internet of Things (IoT). The latency brought by unstable wireless networks caused by limited resources of IoT devices seriously impacts the quality of services of users, particularly the service delay they experienced. Mobile \ldots{}", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2022:DCB, author = "Yantao Li and Peng Tao and Shaojiang Deng and Gang Zhou", title = "{DeFFusion}: {CNN}-based Continuous Authentication Using Deep Feature Fusion", journal = j-TOSN, volume = "18", number = "2", pages = "18:1--18:20", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3485060", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3485060", abstract = "Smartphones have become crucial and important in our daily life, but the security and privacy issues have been major concerns of smartphone users. In this article, we present DeFFusion, a CNN-based continuous authentication system using Deep Feature \ldots{}", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yan:2022:OBU, author = "Yubo Yan and Panlong Yang and Jie Xiong and Xiang-Yang Li", title = "{OpenCarrier}: Breaking the User Limit for Uplink {MU-MIMO} Transmissions With Coordinated {APs}", journal = j-TOSN, volume = "18", number = "2", pages = "19:1--19:21", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3488382", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3488382", abstract = "The global IoT market is experiencing a fast growth with a massive number of IoT/wearable devices deployed around us and even on our bodies. This trend incorporates more users to upload data frequently and timely to the APs. Previous work mainly focus on \ldots{}", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ning:2022:RST, author = "Jingyi Ning and Lei Xie and Chuyu Wang and Yanling Bu and Fu Xiao and Baoliu Ye and Sanglu Lu", title = "Revolving Scanning on Tagged Objects: {$3$D} Structure Detection of Logistics Packages via {RFID} Systems", journal = j-TOSN, volume = "18", number = "2", pages = "20:1--20:29", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3490171", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3490171", abstract = "Nowadays, detecting and evaluating the internal structure of packages becomes a crucial task for logistics systems to guarantee reliability and security. However, prior solutions such as X-ray diffraction and WiFi-based detection are not suitable for this \ldots{}", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Shi:2022:ECTb, author = "Junyang Shi and Xingjian Chen and Mo Sha", title = "Enabling Cross-technology Communication from {LoRa} to {ZigBee} in the 2.4 {GHz} Band", journal = j-TOSN, volume = "18", number = "2", pages = "21:1--21:23", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3491222", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3491222", abstract = "IEEE 802.15.4-based wireless sensor-actuator networks have been widely adopted by process industries in recent years because of their significant role in improving industrial efficiency and reducing operating costs. Today, industrial wireless sensor-. \ldots{}", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cai:2022:WTR, author = "Haofan Cai and Ge Wang and Xiaofeng Shi and Junjie Xie and Minmei Wang and Chen Qian and Shigang Chen", title = "When Tags `Read' Each Other: Enabling Low-Cost and Convenient Tag Mutual Identification", journal = j-TOSN, volume = "18", number = "2", pages = "22:1--22:22", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3494541", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3494541", abstract = "Though widely used in industrial and logistic applications, current passive Radio Frequency Identification (RFID) technology still has a fundamental limitation: Individual users who do not carry any reader find it difficult to interact with tagged items, \ldots{}", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ji:2022:DFM, author = "Xiaoyu Ji and Yushi Cheng and Juchuan Zhang and Yuehan Chi and Wenyuan Xu and Yi-Chao Chen", title = "Device Fingerprinting with Magnetic Induction Signals Radiated by {CPU} Modules", journal = j-TOSN, volume = "18", number = "2", pages = "23:1--23:28", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3495158", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3495158", abstract = "With the widespread use of smart devices, device authentication has received much attention. One popular method for device authentication is to utilize internally measured device fingerprints, such as device ID, software or hardware-based characteristics. \ldots{}", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Schroder:2022:IPB, author = "Yannic Schr{\"o}der and Lars Wolf", title = "{InPhase}: Phase-based Ranging and Localization", journal = j-TOSN, volume = "18", number = "2", pages = "24:1--24:39", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3494542", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3494542", abstract = "Ranging and subsequent localization have become more and more critical in today's factories and logistics. Tracking goods precisely enables just-in-time manufacturing processes. We present the InPhase system for ranging and localization applications. It \ldots{}", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhou:2022:CSB, author = "Siwang Zhou and Yi Lian and Daibo Liu and Hongbo Jiang and Yonghe Liu and Keqin Li", title = "Compressive Sensing Based Distributed Data Storage for Mobile Crowdsensing", journal = j-TOSN, volume = "18", number = "2", pages = "25:1--25:21", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3498321", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3498321", abstract = "Mobile crowdsensing systems typically operate centralized cloud storage management, and the environment data sensed by the participants are usually uploaded to certain central cloud servers. Instead, this article addresses the decentralized data storage \ldots{}", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Shen:2022:TMD, author = "Xingfa Shen and Chuang Li and Weijie Chen and Yongcai Wang and Quanbo Ge", title = "Transition Model-driven Unsupervised Localization Framework Based on Crowd-sensed Trajectory Data", journal = j-TOSN, volume = "18", number = "2", pages = "26:1--26:21", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3499425", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3499425", abstract = "The rapid popularization of mobile devices makes it more convenient and cost-efficient to collect synchronized WiFi received signal strength (RSS) and inertial measurement unit sequences by crowdsensing. The transition model has proven to be a promising \ldots{}", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xie:2022:GST, author = "Lei Xie and Peicheng Yang and Chuyu Wang and Tao Gu and Gaolei Duan and Xinran Lu and Sanglu Lu", title = "{GaitTracker}: {$3$D} Skeletal Tracking for Gait Analysis Based on Inertial Measurement Units", journal = j-TOSN, volume = "18", number = "2", pages = "27:1--27:27", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3502722", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3502722", abstract = "Gait rehabilitation is a common method of postoperative recovery after the user sustains an injury or disability. However, traditional gait rehabilitations are usually performed under the supervision of rehabilitation specialists, which implies that the \ldots{}", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ghosh:2022:SSE, author = "Pradipta Ghosh and Xiaochen Liu and Hang Qiu and Marcos A. M. Vieira and Gaurav S. Sukhatme and Ramesh Govindan", title = "Sensing the Sensor: Estimating Camera Properties with Minimal Information", journal = j-TOSN, volume = "18", number = "2", pages = "28:1--28:26", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3508393", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3508393", abstract = "Public outdoor surveillance cameras often have limited metadata describing their properties. Frequently, a public camera's precise position, orientation, focal length, and image center are unknown; these attributes are necessary to precisely pinpoint the \ldots{}", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Bradbury:2022:TMG, author = "Matthew Bradbury and Arshad Jhumka and Tim Watson and Denys Flores and Jonathan Burton and Matthew Butler", title = "Threat-modeling-guided Trust-based Task Offloading for Resource-constrained {Internet of Things}", journal = j-TOSN, volume = "18", number = "2", pages = "29:1--29:41", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3510424", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Apr 5 06:33:04 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3510424", abstract = "There is an increasing demand for Internet of Things (IoT) networks consisting of resource-constrained devices executing increasingly complex applications. Due to these resource constraints, IoT devices will not be able to execute expensive tasks. One \ldots{}", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{MontenegroMarin:2022:ISI, author = "Carlos Enrique {Montenegro Marin} and Paulo Alonso {Gaona Garcia} and Edward Rolando {Nu{\~n}ez Valdez}", title = "Introduction to the Special Issue on Artificial Intelligence for Underwater Sensor Networks", journal = j-TOSN, volume = "18", number = "3", pages = "30:1--30:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3557051", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3557051", acknowledgement = ack-nhfb, articleno = "30e", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Pham:2022:MLD, author = "Van-Trung Pham and Tu N. Nguyen and Bing-Hong Liu and My T. Thai and Braulio Dumba and Tong Lin", title = "Minimizing Latency for Data Aggregation in Wireless Sensor Networks: an Algorithm Approach", journal = j-TOSN, volume = "18", number = "3", pages = "30:1--30:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3450350", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3450350", abstract = "In wireless sensor networks (WSNs), especially in underwater sensor networks, the problem of reporting data to the sink with minimum latency has been widely discussed in many research works. Many studies address using data aggregation to report the same \ldots{}", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sah:2022:LEM, author = "Dinesh Kumar Sah and Tu N. Nguyen and Manjusha Kandulna and Korhan Cengiz and Tarachand Amgoth", title = "{$3$D} Localization and Error Minimization in Underwater Sensor Networks", journal = j-TOSN, volume = "18", number = "3", pages = "31:1--31:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3460435", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3460435", abstract = "Wireless sensor networks (WSNs) consist of nodes distributed in the region of interest (ROI) that forward collected data to the sink. The node's location plays a vital role in data forwarding to enhance network efficiency by reducing the packet drop rate \ldots{}", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Khosravy:2022:UIN, author = "Mahdi Khosravy and Neeraj Gupta and Nilanjan Dey and Rub{\'e}n Gonz{\'a}lez Crespo", title = "Underwater {IoT} Network by Blind {MIMO OFDM} Transceiver Based on Probabilistic {Stone}'s Blind Source Separation", journal = j-TOSN, volume = "18", number = "3", pages = "32:1--32:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3462674", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3462674", abstract = "Telecommunications systems with Multi-Input Multi-Output (MIMO) structure using Orthogonal Frequency Division Modulation (OFDM) have great potential for efficient application to a network of Internet of Things (IoT) at a high data rate. When the IoT \ldots{}", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{R:2022:ABE, author = "Kanthavel R. and Dhaya R. and Ahilan A.", title = "{AI}-Based Efficient {WUGS} Network Channel Modeling and Clustered Cooperative Communication", journal = j-TOSN, volume = "18", number = "3", pages = "33:1--33:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3469034", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3469034", abstract = "Wireless underground sensor networks (WUSNs) are sub-ground-surface sensor node networks designed to establish real-time tracking capacities in diverse underground ecosystems composed of soil, water, oil, and other materials. The contact medium is the key \ldots{}", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Pradhan:2022:TCU, author = "B. Pradhan and Gautam Srivastava and D. S. Roy and K. H. K. Reddy and Jerry Chun-Wei Lin", title = "Traffic Classification in Underwater Networks Using {SDN} and Data-Driven Hybrid Metaheuristics", journal = j-TOSN, volume = "18", number = "3", pages = "34:1--34:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3474556", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3474556", abstract = "Software-Defined Networks (SDNs), with their segregated data and control planes, has proved to be capable of managing massive amounts of data by leveraging distributed information available across the network for informed decision-making at the network \ldots{}", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Elhoseny:2022:USM, author = "Mohamed Elhoseny and Abdullah Lakhan and Ahmed Rashid and Mazin Mohammed and Karrar Abdulkareem", title = "Underwater Sensor Multi-Parameter Scheduling for Heterogeneous Computing Nodes", journal = j-TOSN, volume = "18", number = "3", pages = "35:1--35:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3476513", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3476513", abstract = "Sensor-aware distributed workflow applications are becoming increasingly popular underwater. The apps are marine operations that generate data and process it based on its characteristics. Mobile-fog-cloud paradigms, as well as computing such as sensor \ldots{}", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Tan:2022:JOR, author = "Tiao Tan and Ming Zhao and Zhiwen Zeng", title = "Joint Offloading and Resource Allocation Based on {UAV}-Assisted Mobile Edge Computing", journal = j-TOSN, volume = "18", number = "3", pages = "36:1--36:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3476512", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3476512", abstract = "Due to the birth of various new Internet of Things devices, the rapid increase of users, and the limited coverage of infrastructure, computing resources will inevitably become insufficient. Therefore, we consider an unmanned aerial vehicle (UAV)-assisted \ldots{}", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gazi:2022:RLB, author = "Firoj Gazi and Nurzaman Ahmed and Sudip Misra and Wei Wei", title = "Reinforcement Learning-Based {MAC} Protocol for Underwater Multimedia Sensor Networks", journal = j-TOSN, volume = "18", number = "3", pages = "37:1--37:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3484201", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3484201", abstract = "High propagation delay, high error probability, floating node mobility, and low data rates are the key challenges for Underwater Wireless Multimedia Sensor Networks (UMWSNs). In this article, we propose RL-MAC, a Reinforcement Learning (RL)-based Medium \ldots{}", acknowledgement = ack-nhfb, articleno = "37", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yang:2022:AAP, author = "Weizhong Yang", title = "Adversarial Attack Protection Scalar Multiplication for {WSNs} Resistance Machine-Learning Side-channel Attack", journal = j-TOSN, volume = "18", number = "3", pages = "38:1--38:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3486679", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3486679", abstract = "Wireless sensor networks (WSNs) have limited storage and low processing capabilities. However, these devices may be captured by opponents, so the security requirements are particularly strict. With the development of side-channel attacks based on the \ldots{}", acknowledgement = ack-nhfb, articleno = "38", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lv:2022:AIU, author = "Zhihan Lv and Dongliang Chen and Hailin Feng and Wei Wei and Haibin Lv", title = "Artificial Intelligence in Underwater Digital Twins Sensor Networks", journal = j-TOSN, volume = "18", number = "3", pages = "39:1--39:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3519301", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3519301", abstract = "The particularity of the marine underwater environment has brought many challenges to the development of underwater sensor networks (UWSNs). This research realized the effective monitoring of targets by UWSNs and achieved higher quality of service in \ldots{}", acknowledgement = ack-nhfb, articleno = "39", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cui:2022:ISS, author = "Laizhong Cui and Yulei Wu and Ryan Ko and Alex Ladur and Jianping Wu", title = "Introduction to the Special Section on Resiliency for {AI}-enabled Smart Critical Infrastructures for {5G} and Beyond", journal = j-TOSN, volume = "18", number = "3", pages = "40:1--40:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3538515", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3538515", acknowledgement = ack-nhfb, articleno = "40e", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sun:2022:SAC, author = "Qindong Sun and Kai Lin and Chengxiang Si and Yanyue Xu and Shancang Li and Prosanta Gope", title = "A Secure and Anonymous Communicate Scheme over the {Internet of Things}", journal = j-TOSN, volume = "18", number = "3", pages = "40:1--40:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3508392", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3508392", abstract = "Anonymous exchange of data has a strong demand in many scenarios. With the development of IoT and wireless networks, plenty of smart devices are interconnected through wireless technologies such as 5G and Wi-Fi, making it possible to use them for \ldots{}", acknowledgement = ack-nhfb, articleno = "40", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yan:2022:PPP, author = "Zheng Yan and Xinren Qian and Shushu Liu and Robert Deng", title = "Privacy Protection in {5G} Positioning and Location-based Services Based on {SGX}", journal = j-TOSN, volume = "18", number = "3", pages = "41:1--41:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3512892", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3512892", abstract = "As the sensitivity of position, the privacy protection in both 5G positioning and its further application in location-based services (LBSs) has been paid special attention and studied. Solutions based on k-anonymity, homomorphic encryption, and secure \ldots{}", acknowledgement = ack-nhfb, articleno = "41", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ming:2022:SCD, author = "Zhao Ming and Xiuhua Li and Chuan Sun and Qilin Fan and Xiaofei Wang and Victor C. M. Leung", title = "Sleeping Cell Detection for Resiliency Enhancements in {5G\slash B5G} Mobile Edge-Cloud Computing Networks", journal = j-TOSN, volume = "18", number = "3", pages = "42:1--42:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3512893", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3512893", abstract = "The rapid increase of data traffic has brought great challenges to the maintenance and optimization of 5G and beyond, and some smart critical infrastructures, e.g., small base stations (SBSs) in cellular cells, are facing serious security and failure \ldots{}", acknowledgement = ack-nhfb, articleno = "42", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sangaiah:2022:IQS, author = "Arun Kumar Sangaiah and Amir Javadpour and Pedro Pinto and Forough Ja'fari and Weizhe Zhang", title = "Improving Quality of Service in {5G} Resilient Communication with the Cellular Structure of Smartphones", journal = j-TOSN, volume = "18", number = "3", pages = "43:1--43:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3512890", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3512890", abstract = "Recent studies in information computation technology (ICT) are focusing on Next-generation networks, SDN (Software-defined networking), 5G, and 6G. Optimal working mode for device-to-device (D2D) communication is aimed at improving the quality of service \ldots{}", acknowledgement = ack-nhfb, articleno = "43", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Deng:2022:RDS, author = "Xianjun Deng and Yuan Tian and Lingzhi Yi and Laurence Tianruo Yang and Yunzhi Xia and Xiao Tang and Chenlu Zhu", title = "Resilient Deployment of Smart Nodes for Improving Confident Information Coverage in {5G} {IoT}", journal = j-TOSN, volume = "18", number = "3", pages = "44:1--44:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3526196", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3526196", abstract = "The development of 5G has brought new opportunities for the application of Internet of Things (IoT). The integration of 5G and IoT technologies promote high availability, resilience, and reliability of the network infrastructures. IoT deployment \ldots{}", acknowledgement = ack-nhfb, articleno = "44", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gai:2022:DTE, author = "Keke Gai and Qiang Xiao and Meikang Qiu and Guolei Zhang and Jianyu Chen and Yihang Wei and Yue Zhang", title = "Digital Twin-enabled {AI} Enhancement in Smart Critical Infrastructures for {5G}", journal = j-TOSN, volume = "18", number = "3", pages = "45:1--45:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3526195", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3526195", abstract = "Artificial Intelligence (AI) technology has been empowered to be a significant driven force within the edge context for powering up contemporary complex systems, such as smart critical infrastructure. Interconnectivity between physical and cyber spaces \ldots{}", acknowledgement = ack-nhfb, articleno = "45", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2022:ROC, author = "Jie Li and Yuxing Deng and Wei Sun and Weitao Li and Ruidong Li and Qiyue Li and Zhi Liu", title = "Resource Orchestration of Cloud-Edge-based Smart Grid Fault Detection", journal = j-TOSN, volume = "18", number = "3", pages = "46:1--46:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3529509", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3529509", abstract = "Real-time smart grid monitoring is critical to enhancing resiliency and operational efficiency of power equipment. Cloud-based and edge-based fault detection systems integrating deep learning have been proposed recently to monitor the grid in real time. \ldots{}", acknowledgement = ack-nhfb, articleno = "46", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2022:IVI, author = "Xu Zhang and Yangchao Zhao and Geyong Min and Wang Miao and Haojun Huang and Zhan Ma", title = "Intelligent Video Ingestion for Real-time Traffic Monitoring", journal = j-TOSN, volume = "18", number = "3", pages = "47:1--47:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3529511", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3529511", abstract = "As an indispensable part of modern critical infrastructures, cameras deployed at strategic places and prime junctions in an intelligent transportation system can help operators in observing traffic flow, identifying any emergency situation, or making \ldots{}", acknowledgement = ack-nhfb, articleno = "47", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2022:TDT, author = "Qingyang Zhang and Jie Cui and Hong Zhong and Lu Liu", title = "Toward Data Transmission Security Based on Proxy Broadcast Re-encryption in Edge Collaboration", journal = j-TOSN, volume = "18", number = "3", pages = "48:1--48:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3529510", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3529510", abstract = "With the development of IoT, more and more data is offloaded from the cloud to the edge for computing, eventually forming a collaborative computing model at the edge. However, in this model, the problem of secure data transmission has not been solved. In \ldots{}", acknowledgement = ack-nhfb, articleno = "48", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yau:2022:NIC, author = "Cheuk-Wang Yau and Sukanya Jewsakul and Man-Ho Luk and Angela P. Y. Lee and Yun-Hin Chan and Edith C. H. Ngai and Philip W. T. Pong and King-Shan Lui and Jiangchuan Liu", title = "{NB-IoT} Coverage and Sensor Node Connectivity in Dense Urban Environments: an Empirical Study", journal = j-TOSN, volume = "18", number = "3", pages = "49:1--49:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3536424", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3536424", abstract = "Wireless sensor networks have enabled smart infrastructures and novel applications. With the recent roll-out of Narrowband IoT (NB-IoT) cellular radio technology, wireless sensors can be widely deployed for data collection in cities around the world. \ldots{}", acknowledgement = ack-nhfb, articleno = "49", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wu:2022:OCO, author = "Tao Wu and Panlong Yang and Haipeng Dai and Chaocan Xiang and Wanru Xu", title = "Optimal Charging Oriented Sensor Placement and Flexible Scheduling in Rechargeable {WSNs}", journal = j-TOSN, volume = "18", number = "3", pages = "50:1--50:??", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3512888", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 16 08:35:26 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3512888", abstract = "The recent breakthroughs in Wireless Power Transfer (WPT) facilitate supporting rechargeable sensors to enrich a series of energy-consuming applications. However, most charging scheduling schemes in rechargeable wireless sensor networks (WSNs) focus on \ldots{}", acknowledgement = ack-nhfb, articleno = "50", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Qiu:2022:ISS, author = "Meikang Qiu and Ke Xu and Cheng Zhang and Tianwei Zhang", title = "Introduction to the Special Section on Energy-efficient and Secure Computing for Artificial Intelligence and Beyond", journal = j-TOSN, volume = "18", number = "4", pages = "51:1--51:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3558553", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3558553", acknowledgement = ack-nhfb, articleno = "51e", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xiang:2022:EEG, author = "Tao Xiang and Hangcheng Liu and Shangwei Guo and Yan Gan and Xiaofeng Liao", title = "{EGM}: an Efficient Generative Model for Unrestricted Adversarial Examples", journal = j-TOSN, volume = "18", number = "4", pages = "51:1--51:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3511893", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3511893", abstract = "Unrestricted adversarial examples allow the attacker to start attacks without given clean samples, which are quite aggressive and threatening. However, existing works for generating unrestricted adversary examples are quite inefficient and cannot achieve \ldots{}", acknowledgement = ack-nhfb, articleno = "51", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lin:2022:ABM, author = "Kai Lin and Jiayi Liu and Guangjie Han", title = "{AI-Based} Mean Field Game against Resource-Consuming Attacks in Edge Computing", journal = j-TOSN, volume = "18", number = "4", pages = "52:1--52:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3519303", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3519303", abstract = "With the rapid development of edge computing, a new paradigm has formed for providing the nearest end service close to the data source. However, insufficient supply of resources makes edge computing devices vulnerable to attacks, especially sensitive to \ldots{}", acknowledgement = ack-nhfb, articleno = "52", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Shi:2022:EEP, author = "Yimin Shi and Haihan Duan and Lei Yang and Wei Cai", title = "An Energy-efficient and Privacy-aware Decomposition Framework for Edge-assisted Federated Learning", journal = j-TOSN, volume = "18", number = "4", pages = "53:1--53:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3522741", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3522741", abstract = "Deep Learning (DL) is an essential technology for modern intelligent sensor network and interactive multimedia applications, having problems with user data privacy when training on a central cloud. While Federated Learning (FL) motivates to preserve user \ldots{}", acknowledgement = ack-nhfb, articleno = "53", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Qi:2022:SEI, author = "Saiyu Qi and Wei Wei and Jingxian Cheng and Yuanqing Zheng and Zhou Su and Jingning Zhang and Yong Qi", title = "Secure and Efficient Item Traceability for Cloud-Aided {IIoT}", journal = j-TOSN, volume = "18", number = "4", pages = "54:1--54:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3522740", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3522740", abstract = "Cloud computing is an essential technique to provide item traceability for industrial internet of things (IIoT) systems by providing item data sharing services. However, a malicious cloud server may prevent industrial participants from acquiring accurate \ldots{}", acknowledgement = ack-nhfb, articleno = "54", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Fan:2022:IBM, author = "Chun-I Fan and Ya-Wen Hsu and Cheng-Han Shie and Yi-Fan Tseng", title = "{ID}-Based Multireceiver Homomorphic Proxy Re-Encryption in Federated Learning", journal = j-TOSN, volume = "18", number = "4", pages = "55:1--55:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3540199", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3540199", abstract = "Data privacy has become a growing concern with advances in machine learning. Federated learning (FL) is a type of machine learning invented by Google in 2016. In FL, the main aim is to train a high-accuracy global model by aggregating the local models \ldots{}", acknowledgement = ack-nhfb, articleno = "55", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Huang:2022:EET, author = "Zijie Huang and Yulei Wu and Niccol{\`o} Tempini and Hui Lin and Hao Yin", title = "An Energy-efficient And Trustworthy Unsupervised Anomaly Detection Framework {(EATU)} for {IIoT}", journal = j-TOSN, volume = "18", number = "4", pages = "56:1--56:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3543855", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3543855", abstract = "Many anomaly detection techniques have been adopted by Industrial Internet of Things (IIoT) for improving self-diagnosing efficiency and infrastructures security. However, they are usually associated with the issues of computational-hungry and ``black box.''. \ldots{}", acknowledgement = ack-nhfb, articleno = "56", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Kung:2022:XRP, author = "S. Y. Kung", title = "{XNAS}: a Regressive\slash Progressive {NAS} for Deep Learning", journal = j-TOSN, volume = "18", number = "4", pages = "57:1--57:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3543669", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3543669", abstract = "Deep learning has achieved great and broad breakthroughs in many real-world applications. In particular, the task of training the network parameters has been masterly handled by back-propagation learning. However, the pursuit on optimal network structures \ldots{}", acknowledgement = ack-nhfb, articleno = "57", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2022:ISI, author = "Mo Li and Jiliang Wang and Swarun Kumar and Yuanqing Zheng", title = "Introduction to the Special Issue on Low Power Wide Area Networks", journal = j-TOSN, volume = "18", number = "4", pages = "58:1--58:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3586058", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3586058", acknowledgement = ack-nhfb, articleno = "58e", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Pan:2022:LES, author = "Qingrui Pan and Zhenlin An and Lei Yang and Qiongzheng Lin", title = "{LSAB}: Enhancing Spatio-temporal Efficiency of {AoA} Tracking Systems", journal = j-TOSN, volume = "18", number = "4", pages = "58:1--58:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3534123", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3534123", abstract = "Estimating the angle-of-arrival (AoA) of an RF source by using a large-sized antenna array is a classical topic in wireless systems. However, AoA tracking systems are not yet used for Internet of Things (IoT) in the real world due to their unaffordable \ldots{}", acknowledgement = ack-nhfb, articleno = "58", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Tan:2022:BCI, author = "Zhaowei Tan and Boyan Ding and Jinghao Zhao and Yunqi Guo and Songwu Lu", title = "Breaking Cellular {IoT} with Forged Data-plane Signaling: Attacks and Countermeasure", journal = j-TOSN, volume = "18", number = "4", pages = "59:1--59:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3534124", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3534124", abstract = "We devise new attacks exploiting the unprotected data-plane signaling in cellular IoT networks (a.k.a. both NB-IoT and Cat-M). We show that, despite the deployed security mechanisms on both control-plane signaling and data-plane packet forwarding, novel \ldots{}", acknowledgement = ack-nhfb, articleno = "59", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Grochla:2022:EAA, author = "Krzysztof Grochla and Anna Strzoda and Rafa{\l} Marjasz and Przemys{\l}aw G{\l}omb and Kamil Ksiazek and Zbigniew Laskarzewski", title = "Energy-Aware Algorithm for Assignment of Relays in {LP WAN}", journal = j-TOSN, volume = "18", number = "4", pages = "60:1--60:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3544561", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3544561", abstract = "The Low-Power Wide-Area Networks allow maintaining connectivity with devices over a distance of a few kilometres. However, due to the presence of obstacles, the communication range in an urban environment may be shorter, which creates multiple blind spots \ldots{}", acknowledgement = ack-nhfb, articleno = "60", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Song:2022:CEL, author = "Yihang Song and Chao Song and Li Lu and Shen Yang and Songfan Li and Chong Zhang and Qianhe Meng and Xiandong Shao and Haili Wang", title = "{Chipnet}: Enabling Large-scale Backscatter Network with Processor-free Devices", journal = j-TOSN, volume = "18", number = "4", pages = "61:1--61:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3544492", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3544492", abstract = "Differing from tremendous existing works that mainly focus on optimizing backscatter communication, Radio-to-Bus (R2B) communication utilizes backscatter to offload processors from IoT devices to the gateway, achieving processor-free devices of \ldots{}", acknowledgement = ack-nhfb, articleno = "61", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lv:2022:ERC, author = "Jiamei Lv and Gonglong Chen and Wei Dong", title = "Exploiting Rateless Codes and Cross-layer Optimization for Low-power Wide-area Networks", journal = j-TOSN, volume = "18", number = "4", pages = "62:1--62:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3544560", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3544560", abstract = "Long communication range and low energy consumption are the two most important design goals of Low-power Wide-area Networks (LPWANs); however, many prior works have revealed that the performance of LPWAN in practical scenarios is not satisfactory. \ldots{}", acknowledgement = ack-nhfb, articleno = "62", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2022:EPO, author = "Lu Wang and Xiaoke Qi and Ruifeng Huang and Kaishun Wu and Qian Zhang", title = "Exploring Partially Overlapping Channels for Low-power Wide Area Networks", journal = j-TOSN, volume = "18", number = "4", pages = "63:1--63:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3546075", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3546075", abstract = "Supporting a massive amount of Internet of Things applications requires a large pool of spectrum. DSM is a promising ecosystem to improve the spectrum efficiency. In the era of LoRaWAN, the physical hardware constraints, along with the bandwidth-hungry \ldots{}", acknowledgement = ack-nhfb, articleno = "63", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2022:DDT, author = "Zhenqiang Xu and Shuai Tong and Pengjin Xie and Jiliang Wang", title = "From Demodulation to Decoding: Toward Complete {LoRa PHY} Understanding and Implementation", journal = j-TOSN, volume = "18", number = "4", pages = "64:1--64:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3546869", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3546869", abstract = "LoRa, as a representative of Low Power Wide Area Network technology, has attracted significant attention from both academia and industry. However, the current understanding of LoRa is far from complete, and implementations have a large performance gap in \ldots{}", acknowledgement = ack-nhfb, articleno = "64", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chang:2022:MBO, author = "Xiangmao Chang and Jun Zhan and Guoliang Xing and Jun Huang and Bing Chen and Lu Zhou", title = "Measurement-Based Optimization of Cell Selection in {NB-IoT} Networks", journal = j-TOSN, volume = "18", number = "4", pages = "65:1--65:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3544017", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3544017", abstract = "Narrowband-Internet of Things (NB-IoT) is an emerging cellular communication technology designed for low-power wide-area applications. Cell selection determines the channel of user device and hence is an important issue in cellular networks. In this \ldots{}", acknowledgement = ack-nhfb, articleno = "65", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xia:2022:PSL, author = "Xianjin Xia and Ningning Hou and Yuanqing Zheng and Tao Gu", title = "{PCube}: Scaling {LoRa} Concurrent Transmissions with Reception Diversities", journal = j-TOSN, volume = "18", number = "4", pages = "66:1--66:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3545571", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3545571", abstract = "This article presents the design and implementation of PCube, a phase-based parallel packet decoder for concurrent transmissions of LoRa nodes. The key enabling technology behind PCube is a novel air-channel phase measurement technique that is able to \ldots{}", acknowledgement = ack-nhfb, articleno = "66", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sun:2022:RAL, author = "Zehua Sun and Huanqi Yang and Kai Liu and Zhimeng Yin and Zhenjiang Li and Weitao Xu", title = "Recent Advances in {LoRa}: a Comprehensive Survey", journal = j-TOSN, volume = "18", number = "4", pages = "67:1--67:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3543856", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3543856", abstract = "The vast demand for diverse applications raises new networking challenges, which have encouraged the development of a new paradigm of Internet of Things (IoT), e.g., LoRa. LoRa is a proprietary spread spectrum modulation technique that provides a solution \ldots{}", acknowledgement = ack-nhfb, articleno = "67", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sangar:2022:NTI, author = "Yaman Sangar and Yoganand Biradavolu and Bhuvana Krishnaswamy", title = "A Novel Time-Interval Based Modulation for Large-Scale, Low-Power, Wide-Area-Networks", journal = j-TOSN, volume = "18", number = "4", pages = "68:1--68:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3549543", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3549543", abstract = "Wireless communication over long distances has become the bottleneck for battery-powered, large-scale deployments. Low-power protocols like Zigbee and Bluetooth Low Energy have limited communication range, whereas long-range communication strategies like \ldots{}", acknowledgement = ack-nhfb, articleno = "68", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Alamos:2022:DLS, author = "Jos{\'e} {\'A}lamos and Peter Kietzmann and Thomas C. Schmidt and Matthias W{\"a}hlisch", title = "{DSME-LoRa}: Seamless Long-range Communication between Arbitrary Nodes in the Constrained {IoT}", journal = j-TOSN, volume = "18", number = "4", pages = "69:1--69:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3552432", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3552432", abstract = "Long-range radio communication is preferred in many IoT deployments, as it avoids the complexity of multi-hop wireless networks. LoRa is a popular, energy-efficient wireless modulation but its networking substrate LoRaWAN introduces severe limitations to \ldots{}", acknowledgement = ack-nhfb, articleno = "69", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Hessel:2022:LSE, author = "Frank Hessel and Lars Almon and Matthias Hollick", title = "{LoRaWAN} Security: an Evolvable Survey on Vulnerabilities, Attacks and their Systematic Mitigation", journal = j-TOSN, volume = "18", number = "4", pages = "70:1--70:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3561973", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3561973", abstract = "The changing vulnerability and threat landscape constantly challenge the security of wireless communication standards and protocols. For the Internet of Things (IoT), LoRaWAN is one of the dominant technologies for urban environments, industrial settings, \ldots{}", acknowledgement = ack-nhfb, articleno = "70", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Quan:2022:GMN, author = "La Van Quan and Minh Hieu Nguyen and Thanh Hung Nguyen and Kien Nguyen and Phi Le Nguyen", title = "On the Global Maximization of Network Lifetime in Wireless Rechargeable Sensor Networks", journal = j-TOSN, volume = "18", number = "4", pages = "71:1--71:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3510423", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3510423", abstract = "In a Wireless Rechargeable Sensor Network (WRSN), a mobile charger (MC) moves and supplies energy for sensor nodes to maintain the network operation. Hence, optimizing the charging schedule of MC is essential to maximize the network lifetime in WRSNs. The \ldots{}", acknowledgement = ack-nhfb, articleno = "71", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Aula:2022:ELC, author = "Kasimir Aula and Eemil Lagerspetz and Petteri Nurmi and Sasu Tarkoma", title = "Evaluation of Low-cost Air Quality Sensor Calibration Models", journal = j-TOSN, volume = "18", number = "4", pages = "72:1--72:??", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3512889", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Mar 24 06:28:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3512889", abstract = "We contribute a novel model evaluation technique that divides available measurements into training and testing sets in a way that adheres to the requirements imposed on professional monitoring stations. We perform extensive and systematic experiments with \ldots{}", acknowledgement = ack-nhfb, articleno = "72", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{An:2023:LRP, author = "Zhenlin An and Qiongzheng Lin and Lei Yang and Yi Guo and Ping Li", title = "Localizing {RFIDs} in Pixel Dimensions", journal = j-TOSN, volume = "19", number = "1", pages = "1:1--1:??", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3517012", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3517012", abstract = "Radio Frequency IDentification (RFID) is emerging as a vital technology of the Internet of Things (IoT). Billions of RFID tags have been deployed to locate daily objects such as equipment, pharmaceuticals, vehicles, and so on. Unlike previous solutions \ldots{}", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Mo:2023:PID, author = "Xiaoyun Mo and Chu Cao and Mo Li and David Z. W. Wang", title = "Predicting the Impact of Disruptions to Urban Rail Transit Systems", journal = j-TOSN, volume = "19", number = "1", pages = "2:1--2:??", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3517015", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3517015", abstract = "Service disruptions of rail transit systems have become more frequent in the past decade in urban cities, due to various reasons, such as power failures, signal errors, and so on. Smart transit cards provide detailed tapping records of commuters, which \ldots{}", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wu:2023:SDR, author = "Yue Wu and Fan Li and Yadong Xie and Yu Wang and Zheng Yang", title = "{SymListener}: Detecting Respiratory Symptoms via Acoustic Sensing in Driving Environments", journal = j-TOSN, volume = "19", number = "1", pages = "3:1--3:21", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3517014", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3517014", abstract = "Sound-related respiratory symptoms are commonly observed in our daily lives. They are closely related to illnesses, infections, or allergies but ignored by the majority. Existing detection methods either depend on specific devices, which are inconvenient \ldots{}", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2023:CLP, author = "Daibo Liu and Zhichao Cao and Hongbo Jiang and Siwang Zhou and Zhu Xiao and Fanzi Zeng", title = "Concurrent Low-power Listening: a New Design Paradigm for Duty-cycling Communication", journal = j-TOSN, volume = "19", number = "1", pages = "4:1--4:24", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3517013", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3517013", abstract = "In this article, we explore a new design paradigm of duty-cycling mechanism that supports low-power devices to fully turn channel contention into transmission opportunities. To achieve this goal, we propose Concurrent Low-power Listening (CLPL) to enable \ldots{}", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wu:2023:TDF, author = "Kaishun Wu and Yandao Huang and Minghui Qiu and Zhenkan Peng and Lu Wang", title = "Toward Device-free and User-independent Fall Detection Using Floor Vibration", journal = j-TOSN, volume = "19", number = "1", pages = "5:1--5:20", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3519302", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3519302", abstract = "The inevitable aging trend of the world's population brings a lot of challenges to the health care for the elderly. For example, it is difficult to guarantee timely rescue for single-resided elders who fall at home. Under this circumstance, a reliable \ldots{}", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Dai:2023:MMR, author = "Yuanchao Dai and Jing Wu and Yuanzhao Fan and Jin Wang and Jianwei Niu and Fei Gu and Shigen Shen", title = "{MSEva}: a Musculoskeletal Rehabilitation Evaluation System Based on {EMG} Signals", journal = j-TOSN, volume = "19", number = "1", pages = "6:1--6:23", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3522739", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3522739", abstract = "In order to better assist the rehabilitation treatment of patients with musculoskeletal injury, standard rehabilitation actions are needed to guide the musculoskeletal rehabilitation process. With more and more urgent demands, the musculoskeletal \ldots{}", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Kaswan:2023:DDM, author = "Amar Kaswan and Prasanta K. Jana and Madhusmita Dash and Anupam Kumar and Bhabani P. Sinha", title = "{DMCP}: a Distributed Mobile Charging Protocol in Wireless Rechargeable Sensor Networks", journal = j-TOSN, volume = "19", number = "1", pages = "7:1--7:29", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3526090", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3526090", abstract = "On-demand charging of sensor nodes (SNs) in wireless rechargeable sensor networks has garnered immense attention. Existing works with multiple mobile chargers (MCs) overlooked the benefits of partial charging and distributed control in large-scale \ldots{}", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Baset:2023:ART, author = "Aniqua Baset and Christopher Becker and Kurt Derr and Shamik Sarkar and Sneha Kumar Kasera", title = "{AviSense}: a Real-time System for Detection, Classification, and Analysis of Aviation Signals", journal = j-TOSN, volume = "19", number = "1", pages = "8:1--8:35", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3526089", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3526089", abstract = "Wireless systems are an integral part of aviation. Apart from their apparent use in air-to-ground communication, wireless systems play a crucial role in avionic functions including navigation and landing. An interference-free wireless environment is \ldots{}", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yin:2023:TTF, author = "Junjie Yin and Zheng Yang and Sicong Liao and Chunhui Duan and Xuan Ding and Li Zhang", title = "{TagFocus}: Towards Fine-Grained Multi-Object Identification in {RFID}-based Systems with Visual Aids", journal = j-TOSN, volume = "19", number = "1", pages = "9:1--9:22", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3526193", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3526193", abstract = "Obtaining fine-grained spatial information is of practical importance in Radio Frequency Identification (RFID)-based systems for enabling multi-object identification. However, as high-precision positioning remains impractical in commercial-off-the-shelf \ldots{}", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2023:JUS, author = "Xindi Wang and Xinyu Liu and Jianjian Wu and Wei Ju and Xiaojing Chen and Ling Shen", title = "Joint User Scheduling, Power Configuration and Trajectory Planning Strategy for {UAV}-Aided {WSNs}", journal = j-TOSN, volume = "19", number = "1", pages = "10:1--10:27", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3529508", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3529508", abstract = "The future sixth-generation (6G) communication system is promising to provide differentiated communication services for massive users worldwide. To achieve this goal, wireless sensor networks (WSNs), regarded as the critical component of the 6G system, \ldots{}", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xing:2023:WRT, author = "Tianzhang Xing and Qing Yang and Zhiping Jiang and Xinhua Fu and Junfeng Wang and Chase Q. Wu and Xiaojiang Chen", title = "{WiFine}: Real-Time Gesture Recognition Using {Wi-Fi} with Edge Intelligence", journal = j-TOSN, volume = "19", number = "1", pages = "11:1--11:24", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3532094", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3532094", abstract = "Gesture detection based on radio frequency signals has gained increasing popularity in recent years due to several benefits it has brought, such as eliminating the need to carry additional devices and providing better privacy. In traditional methods, \ldots{}", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Khan:2023:URS, author = "Usman Mahmood Khan and Raghav H. Venkatnarayan and Muhammd Shahzad", title = "Using {RF} Signals to Generate Indoor Maps", journal = j-TOSN, volume = "19", number = "1", pages = "12:1--12:30", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3534121", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3534121", abstract = "Generating maps of indoor environments beyond the line-of-sight finds applications in several areas such as planning, navigation, and security. While researchers have previously explored the use of RF signals to generate maps, prior work has two important \ldots{}", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2023:MOE, author = "Xinglin Zhang and Jinyi Zhang and Chaoqun Peng and Xiumin Wang", title = "Multimodal Optimization of Edge Server Placement Considering System Response Time", journal = j-TOSN, volume = "19", number = "1", pages = "13:1--13:20", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3534649", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3534649", abstract = "Mobile edge computing (MEC) deploys computing and storage resources close to mobile devices, enabling resource demanding applications to run on mobile devices with short network latency. In the past few years, large numbers of research works focused on \ldots{}", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lin:2023:DRA, author = "Yuxiang Lin and Yi Gao and Bingji Li and Wei Dong", title = "Detecting Rogue Access Points Using Client-agnostic Wireless Fingerprints", journal = j-TOSN, volume = "19", number = "1", pages = "14:1--14:25", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3536423", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3536423", abstract = "The broadcast nature of wireless media makes WLANs easily attacked by rogue Access Points (APs). Rogue AP attacks can potentially cause severe privacy leakage and financial loss. Hardware fingerprinting is the state-of-the-art technology to detect rogue \ldots{}", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Burman:2023:TFW, author = "Scott G. Burman and Jingya Gao and Gregory B. Pasternack and Nann A. Fangue and Paul Cadrett and Elizabeth Campbell and Dipak Ghosal", title = "{TempMesh} --- a Flexible Wireless Sensor Network for Monitoring River Temperatures", journal = j-TOSN, volume = "19", number = "1", pages = "15:1--15:28", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3542697", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3542697", abstract = "For a Chinook salmon restoration project in the lower Yuba River in California, we designed and deployed a wireless sensor network to monitor river temperatures at micro-habitat scales. The study required that temperatures be measured along a 3 km study \ldots{}", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2023:KEU, author = "Yuexin Zhang and Fengjuan Zhou and Xinyi Huang and Li Xu and Ayong Ye", title = "Key Extraction Using Ambient Sounds for Smart Devices", journal = j-TOSN, volume = "19", number = "1", pages = "16:1--16:20", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3544108", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3544108", abstract = "To secure communications, this article presents a key extraction scheme for smart devices using ambient sounds. Specifically, it is designed for the scenario when smart devices do not have any pre-loaded secrets. Moreover, it can be implemented when smart \ldots{}", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ouyang:2023:CCB, author = "Xiaomin Ouyang and Zhiyuan Xie and Jiayu Zhou and Guoliang Xing and Jianwei Huang", title = "{ClusterFL}: a Clustering-based Federated Learning System for Human Activity Recognition", journal = j-TOSN, volume = "19", number = "1", pages = "17:1--17:32", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3554980", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3554980", abstract = "Federated Learning (FL) has recently received significant interest, thanks to its capability of protecting data privacy. However, existing FL paradigms yield unsatisfactory performance for a wide class of human activity recognition (HAR) applications, \ldots{}", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sun:2023:ALA, author = "Xue Sun and Wenwen Deng and Xudong Wei and Dingyi Fang and Baochun Li and Xiaojiang Chen", title = "{Akte-Liquid}: Acoustic-based Liquid Identification with Smartphones", journal = j-TOSN, volume = "19", number = "1", pages = "18:1--18:24", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3551640", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3551640", abstract = "Liquid identification plays an essential role in our daily lives. However, existing RF sensing approaches still require dedicated hardware such as RFID readers and UWB transceivers, which are not readily available to most users. In this article, we \ldots{}", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ping:2023:NLI, author = "Haodi Ping and Yongcai Wang and Xingfa Shen and Deying Li and Wenping Chen", title = "On Node Localizability Identification in Barycentric Linear Localization", journal = j-TOSN, volume = "19", number = "1", pages = "19:1--19:26", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3547143", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3547143", abstract = "Determining whether nodes can be uniquely localized, called localizability detection, is a concomitant problem in network localization. Localizability detection under the traditional Non-Linear Localization (NLL) schema has been well explored, whereas \ldots{}", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2023:NLO, author = "Zengqi Zhang and Sheng Sun and Min Liu and Zhongcheng Li", title = "Network Lifetime Optimization in Multi-hop Industrial Cognitive Radio Sensor Networks", journal = j-TOSN, volume = "19", number = "1", pages = "20:1--20:22", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3549938", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3549938", abstract = "Industrial cognitive radio sensor networks (ICRSNs) extend channel resources by occupying the vacant licensed channels in the absence of licensed users. In ICRSNs, industrial devices should switch to a common available channel to set up a communication \ldots{}", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Luo:2023:PDD, author = "Wenjie Luo and Zhenyu Yan and Qun Song and Rui Tan", title = "Physics-directed Data Augmentation for Deep Model Transfer to Specific Sensor", journal = j-TOSN, volume = "19", number = "1", pages = "21:1--21:30", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3549076", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3549076", abstract = "Runtime domain shifts from the training phase caused by sensor characteristic variation incur performance drops of the deep learning-based sensing systems. To address this problem, existing transfer learning techniques require substantial target-domain \ldots{}", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Pal:2023:CUS, author = "Amitangshu Pal and Filippo Campagnaro and Khadija Ashraf and Md Rashed Rahman and Ashwin Ashok and Hongzhi Guo", title = "Communication for Underwater Sensor Networks: a Comprehensive Summary", journal = j-TOSN, volume = "19", number = "1", pages = "22:1--22:44", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3546827", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 29 06:50:23 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3546827", abstract = "Sensing and communication technology has been used successfully in various event monitoring applications over the last two decades, especially in places where long-term manual monitoring is infeasible. However, the major applicability of this technology \ldots{}", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2023:ISS, author = "Mu-Yen Chen and Vincenzo Piuri and Alireza Souri and Mohammad Shojafar", title = "Introduction to the Special Section on {Internet} of Behavior for Emerging Technologies", journal = j-TOSN, volume = "19", number = "2", pages = "23:1--23:3", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3589021", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3589021", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2023:CEI, author = "Yangfan Li and Kenli Li and Wei Wei and Tianyi Zhou and Cen Chen", title = "{CoRec}: an Efficient {Internet} Behavior-based Recommendation Framework with Edge-cloud Collaboration on Deep Convolution Neural Networks", journal = j-TOSN, volume = "19", number = "2", pages = "24:1--24:28", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3526191", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3526191", abstract = "Both accurate and fast mobile recommendation systems based on click behaviors analysis are crucial in e-business. Deep learning has achieved state-of-the-art accuracy and the traditional wisdom often hosts these computation-intensive models in powerful \ldots{}", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Mohammadi:2023:RDI, author = "Mojtaba Mohammadi and Abdollah Kavousi-Fard and Moslem Dehghani and Mazaher Karimi and Vincenzo Loia and Hassan Haes Alhelou and Pierluigi Siano", title = "Reinforcing Data Integrity in Renewable Hybrid {AC-DC} Microgrids from Social-Economic Perspectives", journal = j-TOSN, volume = "19", number = "2", pages = "25:1--25:19", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3512891", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3512891", abstract = "The microgrid (MG) is a complicated cyber-physical system that operates based on interactions between physical processes and computational components, which make it vulnerable to varied cyber-attacks. In this article, the impact of data integrity attack \ldots{}", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Fang:2023:TTP, author = "Hao Fang and Yiwei Liu and Chi-Hua Chen and Feng-Jang Hwang", title = "Travel Time Prediction Method Based on Spatial-Feature-based Hierarchical Clustering and Deep Multi-input Gated Recurrent Unit", journal = j-TOSN, volume = "19", number = "2", pages = "26:1--26:21", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3544976", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3544976", abstract = "Accurate travel time prediction (TTP) is a significant aspect in the intelligent transportation system (ITS). Travel times of certain road segments explicitly reflect the traffic conditions of those sections. Effective TTP of road segments is instrumental \ldots{}", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wu:2023:PFI, author = "Jimmy Ming-Tai Wu and Qian Teng and Shamsul Huda and Yeh-Cheng Chen and Chien-Ming Chen", title = "A Privacy Frequent Itemsets Mining Framework for Collaboration in {IoT} Using Federated Learning", journal = j-TOSN, volume = "19", number = "2", pages = "27:1--27:15", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3532090", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3532090", abstract = "Rapid advancement of industrial internet of things (IoT) technology has changed the supply chain network to an open system to meet the high demand for individualized products and provide better customer experiences. However the open-system supply chain \ldots{}", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yuan:2023:MOS, author = "Xiaoming Yuan and Hansen Tian and Zedan Zhang and Zheyu Zhao and Lei Liu and Arun Kumar Sangaiah and Keping Yu", title = "A {MEC} Offloading Strategy Based on Improved {DQN} and Simulated Annealing for {Internet} of Behavior", journal = j-TOSN, volume = "19", number = "2", pages = "28:1--28:20", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3532093", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3532093", abstract = "The Internet of Medical Things (IoMT) and Artificial Intelligence (AI) have brought unprecedented opportunities to meet massive behavioral data access and personalization requirements for Internet of Behavior (IoB). They facilitate the communication and \ldots{}", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lin:2023:CAS, author = "Chi Lin and Pengfei Wang and Chuanying Ji and Mohammad S. Obaidat and Lei Wang and Guowei Wu and Qiang Zhang", title = "A Contactless Authentication System Based on {WiFi CSI}", journal = j-TOSN, volume = "19", number = "2", pages = "29:1--29:20", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3532095", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3532095", abstract = "The ubiquitous and fine-grained features of WiFi signals make it promising for realizing contactless authentication. Existing methods, though yielding reasonably good performance in certain cases, are suffering from two major drawbacks: sensitivity to \ldots{}", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Mezair:2023:TAD, author = "Tinhinane Mezair and Youcef Djenouri and Asma Belhadi and Gautam Srivastava and Jerry Chun-Wei Lin", title = "Towards an Advanced Deep Learning for the {Internet} of Behaviors: Application to Connected Vehicles", journal = j-TOSN, volume = "19", number = "2", pages = "30:1--30:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3526192", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3526192", abstract = "In recent years, intensive research has been conducted to enable people to live more comfortably. Developments in the Internet of Things (IoT), big data, and artificial intelligence have taken this type of research to a new level and led to the emergence \ldots{}", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Mishra:2023:HMO, author = "Alekha Kumar Mishra and Osho Singh and Abhay Kumar and Deepak Puthal and Pradip Kumar Sharma and Biswajeet Pradhan", title = "Hybrid Mode of Operation Schemes for {P2P} Communication to Analyze End-Point Individual Behaviour in {IoT}", journal = j-TOSN, volume = "19", number = "2", pages = "31:1--31:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3548686", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3548686", abstract = "The Internet of Behavior is the recent trend in the Internet of Things (IoT), which analyzes the behaviour of individuals using huge amounts of data collected from their activities. The behavioural data collection process from an individual to a data \ldots{}", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2023:DPE, author = "Shancang Li and Shanshan Zhao and Prosanta Gope and Li Da Xu", title = "Data Privacy Enhancing in the {IoT} User\slash Device Behavior Analytics", journal = j-TOSN, volume = "19", number = "2", pages = "32:1--32:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3534648", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3534648", abstract = "The Internet of Things (IoT) is generating and processing a huge amount of data that are then used and shared to improve services and applications in various industries. The collected data are always including sensitive information (sensitive data, users, \ldots{}).", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zeng:2023:EBM, author = "Yiming Zeng and Pengzhan Zhou and Cong Wang and Ji Liu and Yuanyuan Yang", title = "Economical Behavior Modeling and Analyses for Data Collection in Edge {Internet of Things} Networks", journal = j-TOSN, volume = "19", number = "2", pages = "33:1--33:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3532092", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3532092", abstract = "Internet of Things (IoT) is progressively becoming an essential aspect of daily life that can be sensed anywhere and anytime, transforming the traditional lifestyle into a high-tech one. Numerous applications in the edge are brought to life based on IoT \ldots{}", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xie:2023:NEM, author = "Ying Xie and Xiaohui Liu and Mohammad S. Obaidat and Xiong Li and Pandi Vijayakumar", title = "Nondeterministic Evaluation Mechanism for User Recruitment in Mobile Crowd-Sensing", journal = j-TOSN, volume = "19", number = "2", pages = "34:1--34:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3546951", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3546951", abstract = "Based on the Internet of Behavior (IoB), mobile crowd-sensing (MCS) utilizes the Internet of Things (IoT) to recruit users by analyzing behavioral patterns. MCS is widely used in numerous large-scale and complex monitoring services, but it cannot provide \ldots{}", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ammari:2023:CGB, author = "Habib M. Ammari", title = "A Computational Geometry-based Approach for Planar $k$-Coverage in Wireless Sensor Networks", journal = j-TOSN, volume = "19", number = "2", pages = "35:1--35:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3564272", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3564272", abstract = "The problem of coverage is one of the most crucial issues among the problems in the lifecycle of the development of wireless sensor networks (WSNs). It is still open and stirs as much concern in the research community in this area. The problem of k -. \ldots{}", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{deOliveira:2023:MLT, author = "Leonardo L. de Oliveira and Gabriel H. Eisenkraemer and Everton A. Carara and Jo{\~a}o B. Martins and Jose Monteiro", title = "Mobile Localization Techniques for Wireless Sensor Networks: Survey and Recommendations", journal = j-TOSN, volume = "19", number = "2", pages = "36:1--36:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3561512", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3561512", abstract = "This article provides a comprehensive survey of pioneer and state-of-the-art localization algorithms based on the mobility of the network. The basic concepts of the localization task in a wireless sensor network are revisited and the most common \ldots{}", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2023:DMA, author = "Miaomiao Liu and Kang Yang and Yanjie Fu and Dapeng Wu and Wan Du", title = "Driving Maneuver Anomaly Detection Based on Deep Auto-Encoder and Geographical Partitioning", journal = j-TOSN, volume = "19", number = "2", pages = "37:1--37:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3563217", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3563217", abstract = "This paper presents GeoDMA, which processes the GPS data from multiple vehicles to detect anomalous driving maneuvers, such as rapid acceleration, sudden braking, and rapid swerving. First, an unsupervised deep auto-encoder is designed to learn a set of \ldots{}", acknowledgement = ack-nhfb, articleno = "37", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cheng:2023:ATA, author = "Xia Cheng and Mo Sha", title = "Autonomous Traffic-Aware Scheduling for Industrial Wireless Sensor-Actuator Networks", journal = j-TOSN, volume = "19", number = "2", pages = "38:1--38:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3561056", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3561056", abstract = "Recent years have witnessed rapid adoption of low-power Wireless Sensor-Actuator Networks (WSANs) in process industries. To meet the critical demand for reliable and real-time communication in harsh industrial environments, the industrial WSAN standards \ldots{}", acknowledgement = ack-nhfb, articleno = "38", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cao:2023:TRD, author = "Yetong Cao and Fan Li and Xiaochen Liu and Song Yang and Yu Wang", title = "Towards Reliable Driver Drowsiness Detection Leveraging Wearables", journal = j-TOSN, volume = "19", number = "2", pages = "39:1--39:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3560821", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3560821", abstract = "Driver drowsiness is a significant factor in road crashes. However, existing solutions for driver drowsiness detection have major drawbacks of requiring special hardware, constrained recording conditions, and cannot handle the asynchronous and \ldots{}", acknowledgement = ack-nhfb, articleno = "39", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhu:2023:DMN, author = "Xiaojun Zhu and Zhouqing Han and Shaojie Tang and Lijie Xu and Chao Dong", title = "Deploying the Minimum Number of Rechargeable {UAVs} for a Quarantine Barrier", journal = j-TOSN, volume = "19", number = "2", pages = "40:1--40:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3561303", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3561303", abstract = "To control the rapid spread of COVID-19, we consider deploying a set of Unmanned Aerial Vehicles (UAVs) to form a quarantine barrier such that anyone crossing the barrier can be detected. We use a charging pile to recharge UAVs. The problem is scheduling \ldots{}", acknowledgement = ack-nhfb, articleno = "40", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Hou:2023:DMW, author = "Ningning Hou and Xianjin Xia and Yuanqing Zheng", title = "Don't Miss Weak Packets: Boosting {LoRa} Reception with Antenna Diversities", journal = j-TOSN, volume = "19", number = "2", pages = "41:1--41:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3563698", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3563698", abstract = "LoRa technology promises to connect billions of battery-powered devices over a long range for years. However, recent studies and industrial deployment find that LoRa suffers severe signal attenuation because of signal blockage in smart cities and long \ldots{}", acknowledgement = ack-nhfb, articleno = "41", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2023:TPP, author = "Jian Wang and Jiaxin Liu and Guosheng Zhao", title = "Two-phased Participant Selection Method Based on Partial Transfer Learning in Mobile Crowdsensing", journal = j-TOSN, volume = "19", number = "2", pages = "42:1--42:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3563776", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3563776", abstract = "To solve the problem of sensing data redundancy and missing data caused by the uneven distribution of resources in mobile crowd sensing, a two-phased participant selection method based on partial transfer learning is proposed. Firstly, the data is \ldots{}", acknowledgement = ack-nhfb, articleno = "42", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Shang:2023:TCC, author = "Fei Shang and Panlong Yang and Jie Xiong and Yuanhao Feng and Xiangyang Li", title = "{Tamera}: Contactless Commodity Tracking, Material and Shopping Behavior Recognition Using {COTS RFIDs}", journal = j-TOSN, volume = "19", number = "2", pages = "43:1--43:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3563777", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3563777", abstract = "RFID technology has recently been exploited for not only identification but also fine-grained trajectory tracking and gesture recognition. While contact-based (a tag is attached to the target of interest) sensing has achieved promising results, \ldots{}", acknowledgement = ack-nhfb, articleno = "43", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gamage:2023:LEC, author = "Amalinda Gamage and Jansen Liando and Chaojie Gu and Rui Tan and Mo Li and Olivier Seller", title = "{LMAC}: Efficient Carrier-Sense Multiple Access for {LoRa}", journal = j-TOSN, volume = "19", number = "2", pages = "44:1--44:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3564530", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3564530", abstract = "Current LoRa networks including those following the LoRaWAN specification use the primitive ALOHA mechanism for media access control due to LoRa's lack of carrier sense capability. From our extensive measurements, the channel activity detection feature \ldots{}", acknowledgement = ack-nhfb, articleno = "44", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xia:2023:PAR, author = "Ming Xia and Jiaquan Jin and Biqian Liu and Yu Hen Hu and Xiaoyan Wang and Kaikai Chi", title = "Physical-Assisted Routing for Proactive Avoidance of Nomadic Obstacles in {IoT}", journal = j-TOSN, volume = "19", number = "2", pages = "45:1--45:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3565021", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3565021", abstract = "With the broadening of the radio spectrum to higher frequency bands, wireless links are more prone to blockages by nomadic obstacles. However, existing routing schemes mostly follow the network-oriented design principle, which makes it difficult to react \ldots{}", acknowledgement = ack-nhfb, articleno = "45", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yin:2023:HIG, author = "Xiaoyan Yin and Xiaoqian Mi and Sijia Yu and Yanjiao Chen and Baochun Li", title = "Harmony or Involution: Game Inspiring Age-of-Information Optimization for Edge Data Gathering in {Internet} of Things", journal = j-TOSN, volume = "19", number = "2", pages = "46:1--46:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3565022", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3565022", abstract = "Age-of-Information (AoI) has been recently reckoned as a suitable parameter to evaluate the freshness of collected information, which is essential for data retrieval in Internet of Things, especially the monitoring tasks, e.g., the operating situation of \ldots{}", acknowledgement = ack-nhfb, articleno = "46", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Dong:2023:GNN, author = "Guimin Dong and Mingyue Tang and Zhiyuan Wang and Jiechao Gao and Sikun Guo and Lihua Cai and Robert Gutierrez and Bradford Campbel and Laura E. Barnes and Mehdi Boukhechba", title = "Graph Neural Networks in {IoT}: a Survey", journal = j-TOSN, volume = "19", number = "2", pages = "47:1--47:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3565973", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri May 19 06:39:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3565973", abstract = "The Internet of Things (IoT) boom has revolutionized almost every corner of people's daily lives: healthcare, environment, transportation, manufacturing, supply chain, and so on. With the recent development of sensor and communication technology, IoT \ldots{}", acknowledgement = ack-nhfb, articleno = "47", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Shah:2023:ISI, author = "Syed Hassan A. Shah and Shahid Mumtaz and Wei Wei", title = "Introduction to the Special Issue on Cognitive Computing for {Internet of Medical Things} in Smart Healthcare", journal = j-TOSN, volume = "19", number = "3", pages = "48:1--48:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3584742", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3584742", acknowledgement = ack-nhfb, ajournal = "", articleno = "48e", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gao:2023:APM, author = "Honghao Gao and Lin Zhou and Jung Yoon Kim and Ying Li and Wanqiu Huang", title = "Applying Probabilistic Model Checking to the Behavior Guidance and Abnormality Detection for {A-MCI} Patients under Wireless Sensor Network", journal = j-TOSN, volume = "19", number = "3", pages = "48:1--48:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3499426", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3499426", abstract = "With the development of the Internet of Medical Things (IoMT), indoor wireless sensor networks (WSNs) have been used to monitor Alzheimer's disease patients daily and guide their \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "48", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ahmed:2023:DHA, author = "Usman Ahmed and Jerry Chun-Wei Lin and Gautam Srivastava", title = "Deep Hierarchical Attention Active Learning for Mental Disorder Unlabeled Data in {AIoMT}", journal = j-TOSN, volume = "19", number = "3", pages = "49:1--49:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3519304", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3519304", abstract = "In the Artificial Intelligence of Medical Things (AIoMT), Internet-Delivered Psychological Treatment (IDPT) effectively improves the quality of mental health treatments. \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "49", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Guo:2023:LCD, author = "Kehua Guo and Feihong Zhu and Xiaokang Zhou and Lingyan Zhang and Yifei Wang and Jian Kang", title = "{LesionTalk}: Core Data Extraction and Multi-class Lesion Detection in {IoT}-based Intelligent Healthcare", journal = j-TOSN, volume = "19", number = "3", pages = "50:1--50:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3526194", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3526194", abstract = "With the development of intelligent medicine, lesion detection supported by Internet of Things (IoT), big data, and deep learning has become a hotspot. However, lesion detection \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "50", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2023:TNA, author = "Gaofeng Zhang and Yu Li and Xudan Bao and Chinmay Chakarborty and Joel J. P. C. Rodrigues and Liping Zheng and Xuyun Zhang and Lianyong Qi and Mohammad R. Khosravi", title = "{TSDroid}: a Novel {Android} Malware Detection Framework Based on Temporal \& Spatial Metrics in {IoMT}", journal = j-TOSN, volume = "19", number = "3", pages = "51:1--51:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3532091", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3532091", abstract = "In the era of smart healthcare tremendous growth, plenty of smart devices facilitate cognitive computing for the purposes of lower cost, smarter diagnostic, etc. Android \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "51", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sardar:2023:SFR, author = "Alamgir Sardar and Saiyed Umer and Ranjeet Kr. Rout and Shui-Hua Wang and M. Tanveer", title = "A Secure Face Recognition for {IoT}-enabled Healthcare System", journal = j-TOSN, volume = "19", number = "3", pages = "52:1--52:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3534122", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3534122", abstract = "In Healthcare, the Internet of Things (IoT)-enabled surveillance cameras capture thousands of images every day, where face recognition provides reliable security as well as \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "52", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2023:CDS, author = "Mu-Yen Chen and Po-Ru Chiang", title = "{COVID-19} Diagnosis System Based on Chest {X}-ray Images Using Optimized Convolutional Neural Network", journal = j-TOSN, volume = "19", number = "3", pages = "53:1--53:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3558098", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3558098", abstract = "It is worth noting that this 21st century has experienced so many economic, social, cultural and political turbulences throughout the world. The 2019 novel coronavirus \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "53", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Adil:2023:CSH, author = "Muhammad Adil and Jehad Ali and Muhammad Mohsin Jadoon and Sattam Rabia Alotaibi and Neeraj Kumar and Ahmed Farouk and Houbing Song", title = "{COVID-19}: Secure Healthcare {Internet of Things} Networks, Current Trends and Challenges with Future Research Directions", journal = j-TOSN, volume = "19", number = "3", pages = "54:1--54:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3558519", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3558519", abstract = "The number of affirmed COVID-19 cases showed an enormous increase in the recent past throughout the globe. Keeping in view the catastrophic destruction of this \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "54", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Jiang:2023:ESS, author = "Jielin Jiang and Jiajie Guo and Maqbool Khan and Yan Cui and Wenmin Lin", title = "Energy-saving Service Offloading for the {Internet of Medical Things} Using Deep Reinforcement Learning", journal = j-TOSN, volume = "19", number = "3", pages = "55:1--55:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3560265", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3560265", abstract = "As a critical branch of the Internet of Things (IoT) in the medicine industry, the Internet of Medical Things (IoMT) significantly improves the quality of healthcare due to its \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "55", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sharma:2023:BBP, author = "Pratima Sharma and Suyel Namasudra and Naveen Chilamkurti and Byung-Gyu Kim and Ruben Gonzalez Crespo", title = "Blockchain-Based Privacy Preservation for {IoT-Enabled} Healthcare System", journal = j-TOSN, volume = "19", number = "3", pages = "56:1--56:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3577926", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3577926", abstract = "Blockchain technology provides a secure and reliable platform for managing data in various application areas, such as supply chain management, multimedia, financial \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "56", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2023:AAP, author = "Jinxi Li and Deke Guo and Junjie Xie and Sheng Chen", title = "Availability-aware Provision of Service Function Chains in Mobile Edge Computing", journal = j-TOSN, volume = "19", number = "3", pages = "57:1--57:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3565483", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3565483", abstract = "With the advent of Network Function Virtualization (NFV) and Mobile Edge Computing (MEC), outsourcing network functions (NFs) to the MEC is becoming popular among \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "57", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cao:2023:CCO, author = "Zhichao Cao and Xiaolong Zheng and Qiang Ma and Xin Miao", title = "{COFlood}: Concurrent Opportunistic Flooding in Asynchronous Duty Cycle Networks", journal = j-TOSN, volume = "19", number = "3", pages = "58:1--58:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3570163", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3570163", abstract = "For energy constraint wireless IoT nodes, their radios usually operate in duty cycle mode. With low maintenance and negotiation cost, asynchronous duty cycle radio \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "58", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2023:PLM, author = "Guidong Zhang and Guoxuan Chi and Yi Zhang and Xuan Ding and Zheng Yang", title = "Push the Limit of Millimeter-wave Radar Localization", journal = j-TOSN, volume = "19", number = "3", pages = "59:1--59:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3570505", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3570505", abstract = "Existing device-free localization systems have achieved centimeter-level accuracy and show their potential in a wide range of applications. However, today's radio-based solutions \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "59", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Huang:2023:RPR, author = "Qianyi Huang and Youjing Lu and Zhicheng Luo and Hao Wang and Fan Wu and Guihai Chen and Qian Zhang", title = "Rethinking Privacy Risks from Wireless Surveillance Camera", journal = j-TOSN, volume = "19", number = "3", pages = "60:1--60:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3570504", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3570504", abstract = "Wireless home surveillance cameras are gaining popularity in elderly/baby care and burglary detection in an effort to make our life safer than ever before. However, even though the \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "60", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Fan:2023:EDP, author = "Chun-I Fan and Cheng-Han Shie and Yi-Fan Tseng and Hui-Chun Huang", title = "An Efficient Data Protection Scheme Based on Hierarchical {ID}-Based Encryption for {MQTT}", journal = j-TOSN, volume = "19", number = "3", pages = "61:1--61:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3570506", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3570506", abstract = "As Internet of Things (IoT) thrives over the whole world, more and more IoT devices and IoT-based protocols have been designed and proposed in order to meet people's needs. Among \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "61", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2023:DLC, author = "Yuting Wang and Fanhao Zhang and Xiaolong Zheng and Liang Liu and Huadong Ma", title = "Decoding {LoRa} Collisions via Parallel Alignment", journal = j-TOSN, volume = "19", number = "3", pages = "62:1--62:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3571586", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3571586", abstract = "The massive connection of LoRa brings serious collision interference. Existing collision decoding methods cannot effectively deal with the adjacent collisions that occur when the \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "62", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2023:FDD, author = "Guang Wang and Yuefei Chen and Shuai Wang and Fan Zhang and Desheng Zhang", title = "{ForETaxi}: Data-Driven Fleet-Oriented Charging Resource Allocation in Large-Scale Electric Taxi Networks", journal = j-TOSN, volume = "19", number = "3", pages = "63:1--63:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3570958", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3570958", abstract = "Charging processes are the key to promoting electric taxis and improving their operational efficiency due to frequent charging activities and long charging time. Nevertheless, \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "63", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cao:2023:LHD, author = "Hangcheng Cao and Daibo Liu and Hongbo Jiang and Ruize Wang and Zhe Chen and Jie Xiong", title = "{LIPAuth}: Hand-dependent Light Intensity Patterns for Resilient User Authentication", journal = j-TOSN, volume = "19", number = "3", pages = "64:1--64:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3572909", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3572909", abstract = "Authentication mechanisms deployed on access control systems undertake the responsibility of judging user identity to prevent unauthorized individuals from illegally approaching. \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "64", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2023:MCL, author = "Lan Zhang and Daren Zheng and Mu Yuan and Feng Han and Zhengtao Wu and Mengjing Liu and Xiang-Yang Li", title = "{MultiSense}: Cross-labelling and Learning Human Activities Using Multimodal Sensing Data", journal = j-TOSN, volume = "19", number = "3", pages = "65:1--65:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3578267", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3578267", abstract = "To tap into the gold mine of data generated by Internet of Things (IoT) devices with unprecedented volume and value, there is an urgent need to efficiently and \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "65", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gunia:2023:ADM, author = "Marco Gunia and Adrian Zinke and Niko Joram and Frank Ellinger", title = "Analysis and Design of a {MuSiC}-Based Angle of Arrival Positioning System", journal = j-TOSN, volume = "19", number = "3", pages = "66:1--66:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3577927", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3577927", abstract = "In this research article, a concept for a secondary RAdio Direction And Ranging (RADAR) angle of arrival based system with cooperative targets transmitting at 2.4 GHz and using \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "66", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xia:2023:IFC, author = "Na Xia and Yin Wang and Bin Chen and Huazheng Du and Chaonong Xu and Rong Zheng", title = "{IMF$^2$O$^2$}: a Fully Connected Sensor Deployment Algorithm for Underwater Sensor Networks", journal = j-TOSN, volume = "19", number = "3", pages = "67:1--67:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3577201", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3577201", abstract = "To address the problems of node deployment schemes in existing underwater sensor networks that lack consideration of network connectivity and high deployment costs, this article \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "67", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2023:BBF, author = "Xiangjun Zhang and Weiguo Wu and Jinyu Wang and Song Liu", title = "{BiLSTM}-based Federated Learning Computation Offloading and Resource Allocation Algorithm in {MEC}", journal = j-TOSN, volume = "19", number = "3", pages = "68:1--68:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3579824", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3579824", abstract = "Mobile edge computing (MEC) driven by 5G cellular systems has recently emerged as a promising paradigm, enabling mobile devices (MDs) with limited computing \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "68", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Pramanik:2023:ALL, author = "Prithviraj Pramanik and Prasenjit Karmakar and Praveen Kumar Sharma and Soumyajit Chatterjee and Abhijit Roy and Santanu Mandal and Subrata Nandi and Sandip Chakraborty and Mousumi Saha and Sujoy Saha", title = "{AQuaMoHo}: Localized Low-cost Outdoor Air Quality Sensing over a Thermo-hygrometer", journal = j-TOSN, volume = "19", number = "3", pages = "69:1--69:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3580279", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3580279", abstract = "Efficient air quality sensing serves as one of the essential services provided in any recent smart city. Mostly facilitated by sparsely deployed Air Quality Monitoring Stations (AQMSs) \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "69", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2023:IMT, author = "Yifan Zhang and Xinglin Zhang", title = "Incentive Mechanism with Task Bundling for Mobile Crowd Sensing", journal = j-TOSN, volume = "19", number = "3", pages = "70:1--70:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3581788", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3581788", abstract = "Mobile crowd sensing (MCS) has become a powerful sensing paradigm that allows requesters to outsource sensing tasks to a crowd of mobile users. Aware of the paramount \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "70", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yang:2023:AMA, author = "Kang Yang and Xi Zhao and Jianhua Zou and Wan Du", title = "{ATPP}: a Mobile App Prediction System Based on Deep Marked Temporal Point Processes", journal = j-TOSN, volume = "19", number = "3", pages = "71:1--71:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3582555", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3582555", abstract = "Predicting the next application (app) a user will open is essential for improving the user experience, e.g., app pre-loading and app recommendation. Unlike previous \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "71", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2023:GZS, author = "Wei Wang and Qingzhong Li", title = "Generalized Zero-Shot Activity Recognition with Embedding-Based Method", journal = j-TOSN, volume = "19", number = "3", pages = "72:1--72:25", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3582690", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3582690", abstract = "Sensor-based human activity recognition aims to recognize the activities performed by people with the sensor readings. Most of existing works in this area rely on supervised \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "72", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhou:2023:IIM, author = "Wangqiu Zhou and Hao Zhou and Xiang Cui and Fengyu Zhou and Haisheng Tan and Xiang-Yang Li", title = "{IMeP}: Impedance Matching Enhanced Power-Delivered-to-Load Optimization for Magnetic {MIMO} Wireless Power Transfer System", journal = j-TOSN, volume = "19", number = "4", pages = "73:1--73:25", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3582693", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3582693", abstract = "Recently, multiple-input multiple-output (MIMO) technology has been introduced into magnetic resonant coupling (MRC) enabled wireless power transfer (WPT) systems \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "73", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Niu:2023:VTE, author = "Qun Niu and Kunxin Zhu and Suining He and Shaoqi Cen and S.-H. Gary Chan and Ning Liu", title = "{VILL}: Toward Efficient and Automatic Visual Landmark Labeling", journal = j-TOSN, volume = "19", number = "4", pages = "74:1--74:25", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3580497", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3580497", abstract = "Of all indoor localization techniques, vision-based localization emerges as a promising one, mainly due to the ubiquity of rich visual features. Visual landmarks, which present \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "74", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Rezaei:2023:SPP, author = "Yoones Rezaei and Talha Khan and Stephen Lee and Daniel Moss{\'e}", title = "Solar-powered Parking Analytics System Using Deep Reinforcement Learning", journal = j-TOSN, volume = "19", number = "4", pages = "75:1--75:27", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3584949", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3584949", abstract = "Advances in deep vision techniques and the ubiquity of smart cameras will drive the next generation of video analytics. However, video analytics applications consume vast \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "75", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Mo:2023:EOT, author = "Lei Mo and Qi Zhou and Angeliki Kritikakou and Xianghui Cao", title = "Energy Optimized Task Mapping for Reliable and Real-Time Networked Systems", journal = j-TOSN, volume = "19", number = "4", pages = "76:1--76:26", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3584985", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3584985", abstract = "Energy efficiency, real-time response, and data transmission reliability are important objectives during networked systems design. This paper aims to develop an efficient task \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "76", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Teng:2023:PID, author = "Fei Teng and Yanjiao Chen and Yushi Cheng and Xiaoyu Ji and Boyang Zhou and Wenyuan Xu", title = "{PDGes}: an Interpretable Detection Model for {Parkinson}'s Disease Using Smartphones", journal = j-TOSN, volume = "19", number = "4", pages = "77:1--77:21", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3585314", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3585314", abstract = "Parkinson's disease (PD) is a neurodegenerative disorder that severely affects the motor system of patients. Early PD detection will greatly improve the quality of lives. However, \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "77", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2023:TMW, author = "Zuyan Wang and Jun Tao and Yifan Xu and Yang Gao and Dikai Zou", title = "Toward the Minimal Wait-for Delay for Rechargeable {WSNs} with Multiple Mobile Chargers", journal = j-TOSN, volume = "19", number = "4", pages = "78:1--78:24", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3579093", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3579093", abstract = "Nowadays, the flourish of the internet of things incurs a great demand for progressive technologies to prolong the lifetime of Wireless Sensor Networks. Exploiting a fleet of \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "78", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2023:ESS, author = "Ju Wang and Xi Chen and Xue Liu and Gregory Dudek", title = "Eliminating Space Scanning: Fast {mmWave} Beam Alignment with {UWB} Radios", journal = j-TOSN, volume = "19", number = "4", pages = "79:1--79:20", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3588438", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3588438", abstract = "Due to their large bandwidth and impressive data speed, millimeter-wave (mmWave) radios are expected to play a key role in the 5G and beyond (e.g., 6G) communication networks. \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "79", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Hou:2023:JLP, author = "Ningning Hou and Xianjin Xia and Yuanqing Zheng", title = "Jamming of {LoRa PHY} and Countermeasure", journal = j-TOSN, volume = "19", number = "4", pages = "80:1--80:27", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3583137", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3583137", abstract = "LoRaWAN forms a one-hop star topology where LoRa nodes send data via one-hop uplink transmission to a LoRa gateway. If the LoRa gateway can be jammed by attackers, it \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "80", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhou:2023:CAM, author = "Wangqiu Zhou and Hao Zhou and Zhan Wang and Haisheng Tan and Xiang-Yang Li", title = "Context-Aware Magnetic {MIMO} Wireless Charging with Parallel In-Band Communication", journal = j-TOSN, volume = "19", number = "4", pages = "81:1--81:24", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3582692", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3582692", abstract = "Wireless power transfer (e.g., based on RF or magnetic) enables convenient device charging, and triggers innovative applications that typically call for faster, smarter, economic, and \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "81", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Guo:2023:BFG, author = "Zhengxin Guo and Wenyang Yuan and Linqing Gui and Biyun Sheng and Fu Xiao", title = "{BreatheBand}: a Fine-grained and Robust Respiration Monitor System Using {WiFi} Signals", journal = j-TOSN, volume = "19", number = "4", pages = "82:1--82:18", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3582079", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3582079", abstract = "Respiration is a vital indicator of the state of the human body. Monitoring human respiration enables the realization of a variety of intelligent applications, including smart medical \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "82", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wu:2023:OCC, author = "Sixu Wu and Lijie Xu and Haipeng Dai and Linfeng Liu and Fu Xiao and Jia Xu", title = "Optimizing Comprehensive Cost of Charger Deployment in Multi-hop Wireless Charging", journal = j-TOSN, volume = "19", number = "4", pages = "83:1--83:24", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3584950", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3584950", abstract = "The multi-hop wireless charging technology has attracted a lot of attention, as it largely extends the charging range of chargers. Different from the existing work with single cost \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "83", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lin:2023:SAL, author = "Qi Lin and Shuhua Peng and Yuezhong Wu and Jun Liu and Hong Jia and Wen Hu and Mahbub Hassan and Aruna Seneviratne and Chun H. Wang", title = "Subject-adaptive Loose-fitting Smart Garment Platform for Human Activity Recognition", journal = j-TOSN, volume = "19", number = "4", pages = "84:1--84:23", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3584986", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3584986", abstract = "The ability to recognize and detect changes in human posture is important in a wide range of applications such as health care and human-computer interaction. Achieving this \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "84", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wan:2023:MUR, author = "Haoran Wan and Shuyu Shi and Wenyu Cao and Wei Wang and Guihai Chen", title = "Multi-User Room-Scale Respiration Tracking Using {COTS} Acoustic Devices", journal = j-TOSN, volume = "19", number = "4", pages = "85:1--85:28", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3594220", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3594220", abstract = "Continuous domestic respiration monitoring provides vital information for diagnosing assorted diseases. In this article, we introduce RespTracker, the first continuous, \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "85", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2023:GPM, author = "Yu Zhang and Qinhan Wei and Yongcai Wang and Haodi Ping and Deying Li", title = "{GPART}: Partitioning Maximal Redundant Rigid and Maximal Global Rigid Components in Generic Distance Graphs", journal = j-TOSN, volume = "19", number = "4", pages = "86:1--86:26", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3594668", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3594668", abstract = "Partitioning the Maximal Redundant Rigid Components (MRRC) and Maximal Global Rigid Components (MGRC) in generic 2D graphs are critical problem for network structure \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "86", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2023:WRT, author = "Jian Zhang and Wu Yuan and Yanjiao Chen and Mingxi Li and Junkongshuai Wang and Qian Zhang", title = "{WIB}: Real-time, Non-intrusive Blood Pressure Detection Using Smartphones", journal = j-TOSN, volume = "19", number = "4", pages = "87:1--87:27", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3595182", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3595182", abstract = "Blood pressure (BP) is an essential vital sign related to many severe diseases, such as heart failure, kidney failure. Frequent BP detection can provide doctors more information to \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "87", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2023:TOE, author = "Jin Zhang and Hong Gao and Quan Chen and Jianzhong Li", title = "Task-oriented Energy Scheduling in Wireless Rechargeable Sensor Networks", journal = j-TOSN, volume = "19", number = "4", pages = "88:1--88:32", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3594874", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3594874", abstract = "In recent years, the flourishing of Wireless Power Transfer (WPT) technology brings Wireless Sensor Networks (WSNs) a renewable, reliable, and controllable energy source. To \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "88", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chakraborty:2023:FRS, author = "Roshni Chakraborty and Josefine Holm and Torben Bach Pedersen and Petar Popovski", title = "Finding Representative Sampling Subsets in Sensor Graphs Using Time-series Similarities", journal = j-TOSN, volume = "19", number = "4", pages = "89:1--89:32", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3595181", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3595181", abstract = "With the increasing use of Internet-of-Things-enabled sensors, it is important to have effective methods to query the sensors. For example, in a dense network of battery-driven \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "89", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2023:DIS, author = "Tao Chen and Longfei Shangguan and Zhenjiang Li and Kyle Jamieson", title = "The Design and Implementation of a Steganographic Communication System over In-Band Acoustical Channels", journal = j-TOSN, volume = "19", number = "4", pages = "90:1--90:25", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3587162", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3587162", abstract = "This article presents SoundSticker, a system for steganographic, in-band data communication over an acoustic channel. In contrast with recent works that hide bits in inaudible \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "90", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ghahroudi:2023:DND, author = "Mahsa Sadeghi Ghahroudi and Alireza Shahrabi and Seyed Mohammad Ghoreyshi and Faisal Abdulaziz Alfouzan", title = "Distributed Node Deployment Algorithms in Mobile Wireless Sensor Networks: Survey and Challenges", journal = j-TOSN, volume = "19", number = "4", pages = "91:1--91:26", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3579034", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3579034", abstract = "From the coverage and connectivity perspective, a wide range of applications in wireless sensor networks rely on node deployment algorithms to accomplish their functionalities. This is \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "91", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2023:SNA, author = "Yantao Li and Jiaxing Luo and Shaojiang Deng and Gang Zhou", title = "{SearchAuth}: Neural Architecture Search-based Continuous Authentication Using Auto Augmentation Search", journal = j-TOSN, volume = "19", number = "4", pages = "92:1--92:23", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3599727", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3599727", abstract = "Mobile devices have been playing significant roles in our daily lives, which has made device security and privacy protection extremely important. These mobile devices storing user \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "92", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Samaddar:2023:OSR, author = "Ankita Samaddar and Arvind Easwaran", title = "Online Schedule Randomization to Mitigate Timing Attacks in {5G} Periodic {URLLC} Communications", journal = j-TOSN, volume = "19", number = "4", pages = "93:1--93:26", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3600093", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3600093", abstract = "Ultra-reliable low-latency communication (URLLC) in 5G networks is designed to support time-critical applications such as industrial control systems (ICSs), where user \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "93", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Fan:2023:NPT, author = "Jinxiao Fan and Pengfei Wang and Yu Fan and Liang Liu and Huadong Ma", title = "{Num2vec}: Pre-Training Numeric Representations for Time Series Forecasting in the Sensing System", journal = j-TOSN, volume = "19", number = "4", pages = "94:1--94:23", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3599728", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3599728", abstract = "Time series forecasting in the sensing system aims to predict future values based on historical records that sensors have collected. Previous works, however, usually focus on \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "94", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2023:FGC, author = "Xinglin Zhang and Jiaqi Tian and Junna Zhang and Chaocan Xiang", title = "Fine-grained Caching and Resource Scheduling for Adaptive Bitrate Videos in Edge Networks", journal = j-TOSN, volume = "19", number = "4", pages = "95:1--95:30", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3604555", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3604555", abstract = "With the easy access to mobile networks and the proliferation of video applications, video traffic is occupying a great portion of the network traffic, which poses a new challenge of how to \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "95", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xia:2023:HSD, author = "Na Xia and Yin Wang and Qiong Wu and Chenguang Yuan and Xinyi Wen and Yue Wu and Longya Lang", title = "The Hunting-style Deployment of Underwater Sensor Networks", journal = j-TOSN, volume = "19", number = "4", pages = "96:1--96:22", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3604556", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3604556", abstract = "Underwater pollution incidents occur frequently, and obtaining accurate information about their exact location and real-time situation is helpful for promptly formulating plans to \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "96", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Dai:2023:OOP, author = "Zhigang Dai and Wenjun Lyu and Yi Ding and Yiwei Song and Yunhuai Liu", title = "{OPTI}: Order Preparation Time Inference for On-demand Delivery", journal = j-TOSN, volume = "19", number = "4", pages = "97:1--97:18", month = nov, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3592610", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:39 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3592610", abstract = "On-demand delivery has become an increasingly popular urban service in recent years as it facilitates citizens' daily lives significantly. In the fulfillment cycle, the order preparation \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "97", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Dong:2024:PSV, author = "Yiwen Dong and Amelie Bonde and Jesse R. Codling and Adeola Bannis and Jinpu Cao and Asya Macon and Gary Rohrer and Jeremy Miles and Sudhendu Sharma and Tami Brown-Brandl and Akkarit Sangpetch and Orathai Sangpetch and Pei Zhang and Hae Young Noh", title = "{PigSense}: Structural Vibration-based Activity and Health Monitoring System for Pigs", journal = j-TOSN, volume = "20", number = "1", pages = "1:1--1:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3604806", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3604806", abstract = "Precision Swine Farming has the potential to directly benefit swine health and industry profit by automatically monitoring the growth and health of pigs. We introduce the first \ldots{}", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Baddeley:2024:UCT, author = "Michael Baddeley and Carlo Alberto Boano and Antonio Escobar-Molero and Ye Liu and Xiaoyuan Ma and Victor Marot and Usman Raza and Kay R{\"o}mer and Markus Schuss and Aleksandar Stanoev", title = "Understanding Concurrent Transmissions: The Impact of Carrier Frequency Offset and {RF} Interference on Physical Layer Performance", journal = j-TOSN, volume = "20", number = "1", pages = "2:1--2:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3604430", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3604430", abstract = "The popularity of concurrent transmissions (CT) has soared after recent studies have shown their feasibility on the four physical layers specified by BLE 5, hence providing an alternative to \ldots{}", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Tang:2024:FET, author = "Jianzhi Tang and Luoyi Fu and Shiyu Liang and Fei Long and Lei Zhou and Xinbing Wang and Chenghu Zhou", title = "{FlowerCast}: Efficient Time-sensitive Multicast in Wireless Sensor Networks with Link Uncertainty", journal = j-TOSN, volume = "20", number = "1", pages = "3:1--3:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3605551", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3605551", abstract = "This article studies time-sensitive multicast in wireless sensor networks (WSNs) with link uncertainty, where information from the source needs to be delivered to multiple \ldots{}", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2024:WTS, author = "Qian Zhang and Zheng Yang and Fan Li and Biaokai Zhu and Pengpeng Chen", title = "{WVC}: Towards Secure Device Paring for Mobile Augmented Reality", journal = j-TOSN, volume = "20", number = "1", pages = "4:1--4:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3600233", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3600233", abstract = "In mobile augmented reality applications, how to build a secure device connection between two previously unassociated devices without prior set-up is challenging, which also refers \ldots{}", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yu:2024:TOD, author = "Yuning Yu and Shanglin Hsu and Andre Chen and Yutian Chen and Bin Tang", title = "Truthful and Optimal Data Preservation in Base Station-less Sensor Networks: an Integrated Game Theory and Network Flow Approach", journal = j-TOSN, volume = "20", number = "1", pages = "5:1--5:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3606263", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3606263", abstract = "We aim to preserve a large amount of data generated inside base station-less sensor networks (BSNs) while considering that sensor nodes are selfish. BSNs refer to emerging sensing \ldots{}", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Song:2024:TAC, author = "Jinke Song and Shangfeng Wan and Min Huang and Jiqiang Liu and Limin Sun and Qiang Li", title = "Toward Automatically Connecting {IoT} Devices with Vulnerabilities in the Wild", journal = j-TOSN, volume = "20", number = "1", pages = "6:1--6:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3608951", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3608951", abstract = "With the increasing number of Internet of Things (IoT) devices connected to the internet, the industry and research community have become increasingly concerned about their \ldots{}", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wei:2024:SBF, author = "Bo Wei and Weitao Xu and Mingcen Gao and Guohao Lan and Kai Li and Chengwen Luo and Jin Zhang", title = "{SolarKey}: Battery-free Key Generation Using Solar Cells", journal = j-TOSN, volume = "20", number = "1", pages = "7:1--7:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3605780", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3605780", abstract = "Solar cells have been widely used for offering energy for Internet of Things (IoT) devices. Recently, solar cells have also been used as sensors for context awareness sensing \ldots{}", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Bai:2024:IHB, author = "Xuewei Bai and Yongcai Wang and Haodi Ping and Xiaojia Xu and Deying Li and Shuo Wang", title = "{InferLoc}: Hypothesis-Based Joint Edge Inference and Localization in Sparse Sensor Networks", journal = j-TOSN, volume = "20", number = "1", pages = "8:1--8:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3608477", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3608477", abstract = "Ranging-based localization is a fundamental problem in the Internet of Things and unmanned aerial vehicle networks. However, the nodes' limited-ranging scope and users' broad \ldots{}", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2024:EAO, author = "Jianbo Li and Genji Yuan and Zheng Yang", title = "Edge-assisted Object Segmentation Using Multimodal Feature Aggregation and Learning", journal = j-TOSN, volume = "20", number = "1", pages = "9:1--9:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3612922", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3612922", abstract = "Object segmentation aims to perfectly identify objects embedded in the surrounding environment and has a wide range of applications. Most previous methods of \ldots{}", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lian:2024:EFG, author = "Jie Lian and Changlai Du and Jiadong Lou and Li Chen and Xu Yuan", title = "{EchoSensor}: Fine-grained Ultrasonic Sensing for Smart Home Intrusion Detection", journal = j-TOSN, volume = "20", number = "1", pages = "10:1--10:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3615658", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3615658", abstract = "This article presents the design and implementation of a novel intrusion detection system, called EchoSensor, which leverages speakers and microphones in smart \ldots{}", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{You:2024:PCP, author = "Wei You and Meixuan Ren and Yuzhuo Ma and Die Wu and Jilin Yang and Xuxun Liu and Tang Liu", title = "Practical Charger Placement Scheme for Wireless Rechargeable Sensor Networks with Obstacles", journal = j-TOSN, volume = "20", number = "1", pages = "11:1--11:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3614431", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3614431", abstract = "Benefitting from the maturation of Wireless Power Transfer technology, Wireless Rechargeable Sensor Networks have become a promising solution for prolonging \ldots{}", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2024:DSM, author = "Guopeng Li and Haisheng Tan and Liuyan Liu and Hao Zhou and Shaofeng H.-C. Jiang and Zhenhua Han and Xiang-Yang Li and Guoliang Chen", title = "{DAG} Scheduling in Mobile Edge Computing", journal = j-TOSN, volume = "20", number = "1", pages = "12:1--12:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3616374", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3616374", abstract = "In Mobile Edge Computing, edge servers have limited storage and computing resources that can only support a small number of functions. Meanwhile, mobile applications are \ldots{}", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ma:2024:VDQ, author = "Chaofan Ma and Wei Liang and Meng Zheng and Xiaofang Xia and Lin Chen", title = "A {Voronoi} Diagram and {Q}-Learning based Relay Node Placement Method Subject to Radio Irregularity", journal = j-TOSN, volume = "20", number = "1", pages = "13:1--13:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3617124", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3617124", abstract = "Industrial Wireless Sensor Networks (IWSNs) have been widely used in industrial applications that require highly reliable and real-time wireless transmission. A lot of works \ldots{}", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Nan:2024:LSV, author = "Ya Nan and Shiqi Jiang and Mo Li", title = "Large-scale Video Analytics with Cloud-Edge Collaborative Continuous Learning", journal = j-TOSN, volume = "20", number = "1", pages = "14:1--14:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3624478", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3624478", abstract = "Deep learning-based video analytics demands high network bandwidth to ferry the large volume of data when deployed on the cloud. When incorporated at the edge side, \ldots{}", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yang:2024:BEE, author = "Xin Yang and Omid Ardakanian", title = "{Blinder}: End-to-end Privacy Protection in Sensing Systems via Personalized Federated Learning", journal = j-TOSN, volume = "20", number = "1", pages = "15:1--15:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3623397", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3623397", abstract = "This article proposes a sensor data anonymization model that is trained on decentralized data and strikes a desirable trade-off between data utility and privacy, \ldots{}", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wu:2024:NIH, author = "Yingxiao Wu and Haocheng Ni and Changlin Mao and Jianping Han and Wenyao Xu", title = "Non-intrusive Human Vital Sign Detection Using {mmWave} Sensing Technologies: a Review", journal = j-TOSN, volume = "20", number = "1", pages = "16:1--16:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3627161", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3627161", abstract = "Non-invasive human vital sign detection has gained significant attention in recent years, with its potential for contactless, long-term monitoring. Advances in radar systems \ldots{}", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chang:2024:DCS, author = "Qingyi Chang and Dan Tao and Jiangtao Wang and Ruipeng Gao", title = "Deep Compressed Sensing based Data Imputation for Urban Environmental Monitoring", journal = j-TOSN, volume = "20", number = "1", pages = "17:1--17:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3599236", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3599236", abstract = "Data imputation is prevalent in crowdsensing, especially for Internet of Things (IoT) devices. On the one hand, data collected from sensors will inevitably be affected or damaged by \ldots{}", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Le:2024:DDE, author = "Duc Van Le and Joy Qiping Yang and Siyuan Zhou and Daren Ho and Rui Tan", title = "Design, Deployment, and Evaluation of an Industrial {AIoT} System for Quality Control at {HP} Factories", journal = j-TOSN, volume = "20", number = "1", pages = "18:1--18:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3618300", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3618300", abstract = "Enabled by the increasingly available embedded hardware accelerators, the capability of executing advanced machine learning models at the edge of the Internet of Things (IoT) \ldots{}", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Pal:2024:TWU, author = "Amitangshu Pal and Hongzhi Guo and Sijung Yang and Mustafa Alper Akkas and Xufeng Zhang", title = "Taking Wireless Underground: a Comprehensive Summary", journal = j-TOSN, volume = "20", number = "1", pages = "19:1--19:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3587934", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3587934", abstract = "The tremendous potential of sensing and communication technologies has been explored and implemented for different remote event monitoring applications over the past \ldots{}", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cai:2024:MUM, author = "Xinjun Cai and Zheng Yang and Liang Dong and Qiang Ma and Xin Miao and Zhuo Liu", title = "Multi-User Mobile Augmented Reality with {ID-Aware} Visual Interaction", journal = j-TOSN, volume = "20", number = "1", pages = "20:1--20:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3623638", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3623638", abstract = "Most existing multi-user Augmented Reality (AR) systems only support multiple co-located users to view a common set of virtual objects but lack the ability to enable each user to \ldots{}", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Pang:2024:ATC, author = "Bowen Pang and Sicong Liu and Hongli Wang and Bin Guo and Yuzhan Wang and Hao Wang and Zhenli Sheng and Zhongyi Wang and Zhiwen Yu", title = "{AdaMEC}: Towards a Context-adaptive and Dynamically Combinable {DNN} Deployment Framework for Mobile Edge Computing", journal = j-TOSN, volume = "20", number = "1", pages = "21:1--21:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3630098", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3630098", abstract = "With the rapid development of deep learning, recent research on intelligent and interactive mobile applications (e.g., health monitoring, speech recognition) has attracted \ldots{}", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Mishra:2024:MPB, author = "Rahul Mishra and Hari Prabhat Gupta", title = "A Model Personalization-based Federated Learning Approach for Heterogeneous Participants with Variability in the Dataset", journal = j-TOSN, volume = "20", number = "1", pages = "22:1--22:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3629978", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3629978", abstract = "Federated learning is an emerging paradigm that provides privacy-preserving collaboration among multiple participants for model training without sharing private data. The participants \ldots{}", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2024:VUM, author = "Junsheng Li and Ling Wang and Jie Liu and Jinshan Tang", title = "{ViST}: a Ubiquitous Model with Multimodal Fusion for Crop Growth Prediction", journal = j-TOSN, volume = "20", number = "1", pages = "23:1--23:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3627707", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3627707", abstract = "Crop growth prediction can help agricultural workers to make accurate and reasonable decisions on farming activities. Existing crop growth prediction models focus on one \ldots{}", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Huang:2024:CTP, author = "Ziyao Huang and Weiwei Wu and Chenchen Fu and Xiang Liu and Feng Shan and Jianping Wang and Xueyong Xu", title = "Communication-Topology-preserving Motion Planning: Enabling Static Routing in {UAV} Networks", journal = j-TOSN, volume = "20", number = "1", pages = "24:1--24:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3631530", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3631530", abstract = "Unmanned Aerial Vehicle (UAV) swarm offers extended coverage and is a vital solution for many applications. A key issue in UAV swarm control is to cover all targets while \ldots{}", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2024:TIC, author = "Weizheng Wang and Qing Wang and Marco Zuniga", title = "Taming Irregular Cardiac Signals for Biometric Identification", journal = j-TOSN, volume = "20", number = "1", pages = "25:1--25:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3624570", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu Dec 28 07:08:27 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3624570", abstract = "Cardiac patterns are being used to provide hard-to-forge biometric signatures in identification applications. However, this performance is obtained under controlled scenarios \ldots{}", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2024:ESI, author = "Fangyu Li and WenZhan Song and Xiaohua Xu", title = "Editorial: Special Issue on Cyber-Physical Security and Zero Trust", journal = j-TOSN, volume = "20", number = "2", pages = "26:1--26:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3634700", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3634700", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2024:RTC, author = "Di Wang and Fangyu Li and Kaibo Liu and Xi Zhang", title = "Real-time Cyber-Physical Security Solution Leveraging an Integrated Learning-Based Approach", journal = j-TOSN, volume = "20", number = "2", pages = "27:1--27:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3582009", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3582009", abstract = "Cyber-Physical Systems (CPS) has emerged as a paradigm that connects cyber and physical worlds, which provides unprecedented opportunities to realize intelligent \ldots{}", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ju:2024:RST, author = "Ying Ju and Mingjie Yang and Chinmay Chakraborty and Lei Liu and Qingqi Pei and Ming Xiao and Keping Yu", title = "Reliability-Security Tradeoff Analysis in {mmWave} Ad Hoc-based {CPS}", journal = j-TOSN, volume = "20", number = "2", pages = "28:1--28:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3582556", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3582556", abstract = "Cyber-physical systems (CPS) offer integrated resolutions for various applications by combining computer and physical components and enabling individual machines to work together \ldots{}", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Hong:2024:DIA, author = "Zhen Hong and Lingling Lu and Dehua Zheng and Jiahui Suo and Peng Sun and Raheem Beyah and Zhenyu Wen", title = "Detect Insider Attacks in Industrial Cyber-physical Systems Using Multi-physical Features-based Fingerprinting", journal = j-TOSN, volume = "20", number = "2", pages = "29:1--29:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3582691", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3582691", abstract = "ICPS software and hardware suffer from low update frequency, making it easier for insiders to bypass external defenses and launch concealed destructive attacks. To address these \ldots{}", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Miao:2024:RLF, author = "Zhuoyi Miao and Jun Yu", title = "A Robust Learning Framework for Smart Grids in Defense Against False-Data Injection Attacks", journal = j-TOSN, volume = "20", number = "2", pages = "30:1--30:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3588439", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3588439", abstract = "With the rapid development of the application of smart grids in different sectors, security management has become a major concern due to cyber attack risks. Correctly and \ldots{}", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Huang:2024:SDS, author = "Junqin Huang and Linghe Kong and Jingwei Wang and Guihai Chen and Jianhua Gao and Gang Huang and Muhammad Khurram Khan", title = "Secure Data Sharing over Vehicular Networks Based on Multi-sharding Blockchain", journal = j-TOSN, volume = "20", number = "2", pages = "31:1--31:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3579035", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3579035", abstract = "Internet of Vehicles (IoV) has become an indispensable technology to bridge vehicles, persons, and infrastructures and is promising to make our cities smarter and more \ldots{}", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yang:2024:ASC, author = "Yinghong Yang and Fenhua Bai and Zhuo Yu and Tao Shen and Yingli Liu and Bei Gong", title = "An Anonymous and Supervisory Cross-chain Privacy Protection Protocol for Zero-trust {IoT} Application", journal = j-TOSN, volume = "20", number = "2", pages = "32:1--32:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3583073", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3583073", abstract = "Internet of things (IoT) development tends to reduce the reliance on centralized servers. The zero-trust distributed system combined with blockchain technology has become a \ldots{}", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2024:CAD, author = "Junyi Liu and Yifu Tang and Haimeng Zhao and Xieheng Wang and Fangyu Li and Jingyi Zhang", title = "{CPS} Attack Detection under Limited Local Information in Cyber Security: an Ensemble Multi-Node Multi-Class Classification Approach", journal = j-TOSN, volume = "20", number = "2", pages = "33:1--33:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3585520", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3585520", abstract = "Cybersecurity breaches are common anomalies for distributed cyber-physical systems (CPS). However, the cyber security breach classification is still a difficult problem, even using \ldots{}", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Tian:2024:VRS, author = "Siben Tian and Fenhua Bai and Tao Shen and Chi Zhang and Bei Gong", title = "{VSSB-Raft}: a Secure and Efficient Zero Trust Consensus Algorithm for Blockchain", journal = j-TOSN, volume = "20", number = "2", pages = "34:1--34:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3611308", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3611308", abstract = "To solve the problems of vote forgery and malicious election of candidate nodes in the Raft consensus algorithm, we combine zero trust with the Raft consensus algorithm and \ldots{}", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2024:DRL, author = "Shun Zhang and Pengfei Lan and Benfei Duan and Zhili Chen and Hong Zhong and Neal N. Xiong", title = "{DPIVE}: a Regionalized Location Obfuscation Scheme with Personalized Privacy Levels", journal = j-TOSN, volume = "20", number = "2", pages = "35:1--35:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3572029", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3572029", abstract = "The popularity of cyber-physical systems is fueling the rapid growth of location-based services. This poses the risk of location privacy disclosure. Effective privacy \ldots{}", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhao:2024:FBR, author = "Ping Zhao and Jin Jiang and Guanglin Zhang", title = "{FedSuper}: a {Byzantine}-Robust Federated Learning Under Supervision", journal = j-TOSN, volume = "20", number = "2", pages = "36:1--36:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3630099", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3630099", abstract = "Federated Learning (FL) is a machine learning setting where multiple worker devices collaboratively train a model under the orchestration of a central server, while \ldots{}", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2024:TOL, author = "Danyang Li and Jingao Xu and Zheng Yang and Chengpei Tang", title = "Train Once, Locate Anytime for Anyone: Adversarial Learning-based Wireless Localization", journal = j-TOSN, volume = "20", number = "2", pages = "37:1--37:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3614095", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3614095", abstract = "Among numerous indoor localization systems, WiFi fingerprint-based localization has been one of the most attractive solutions, which is known to be free of extra infrastructure and \ldots{}", acknowledgement = ack-nhfb, articleno = "37", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhou:2024:SAD, author = "Zhipeng Zhou and Feng Wang and Wei Gong", title = "{i-Sample}: Augment Domain Adversarial Adaptation Models for {WiFi}-based {HAR}", journal = j-TOSN, volume = "20", number = "2", pages = "38:1--38:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3616494", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3616494", abstract = "Recently, using deep learning to achieve WiFi-based human activity recognition (HAR) has drawn significant attention. While capable of achieving accurate identification in a \ldots{}", acknowledgement = ack-nhfb, articleno = "38", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liao:2024:ESB, author = "Qianru Liao and Yongzhi Huang and Yandao Huang and Kaishun Wu", title = "An Eavesdropping System Based on Magnetic Side-Channel Signals Leaked by Speakers", journal = j-TOSN, volume = "20", number = "2", pages = "39:1--39:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3637063", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3637063", abstract = "The use of speakers in electronic devices has become widespread, but the security risks associated with micro-speakers, such as earphones, are often overlooked. Many \ldots{}", acknowledgement = ack-nhfb, articleno = "39", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Mei:2024:ELP, author = "Luoyu Mei and Zhimeng Yin and Shuai Wang and Xiaolei Zhou and Taiwei Ling and Tian He", title = "{ECRLoRa}: {LoRa} Packet Recovery under Low {SNR} via Edge-Cloud Collaboration", journal = j-TOSN, volume = "20", number = "2", pages = "40:1--40:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3604936", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3604936", abstract = "Low-Power Wide-Area Networks (LPWANs), extensively utilized for connecting billions of IoT devices, encounter wireless interference challenges in unlicensed frequency \ldots{}", acknowledgement = ack-nhfb, articleno = "40", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gu:2024:RTR, author = "Xiaolin Gu and Wenjia Wu and Aibo Song and Ming Yang and Zhen Ling and Junzhou Luo", title = "{RF-TESI}: Radio Frequency Fingerprint-based Smartphone Identification under Temperature Variation", journal = j-TOSN, volume = "20", number = "2", pages = "41:1--41:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3636462", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3636462", abstract = "Radio frequency fingerprint identification (RFFI) is a promising technique for smartphone identification. However, we find that the temperature of the RF front end in \ldots{}", acknowledgement = ack-nhfb, articleno = "41", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2024:SSE, author = "Shanyue Wang and Yubo Yan and Yujie Chen and Panlong Yang and Xiang-Yang Li", title = "{Spray}: a Spectrum-efficient and Agile Concurrent Backscatter System", journal = j-TOSN, volume = "20", number = "2", pages = "42:1--42:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3638051", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3638051", abstract = "Recent works have achieved considerable success in improving the concurrency of backscatter network. However, they do not optimize the balance between throughput and \ldots{}", acknowledgement = ack-nhfb, articleno = "42", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xia:2024:AFG, author = "Shuangqing Xia and Tianzhang Xing and Chase Q. Wu and Guoqing Liu and Jiadi Yang and Kang Li", title = "{AQMon}: a Fine-grained Air Quality Monitoring System Based on {UAV} Images for Smart Cities", journal = j-TOSN, volume = "20", number = "2", pages = "43:1--43:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3638766", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3638766", abstract = "Air quality monitoring is important to the green development of smart cities. Several technical challenges exist for intelligent, high-precision monitoring, such as computing \ldots{}", acknowledgement = ack-nhfb, articleno = "43", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{He:2024:DIN, author = "Yuan He and Jia Zhang and Rui Xi and Xin Na and Yimiao Sun and Beibei Li", title = "Detection and Identification of Non-cooperative {UAV} Using a {COTS} {mmWave} Radar", journal = j-TOSN, volume = "20", number = "2", pages = "44:1--44:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3638767", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3638767", abstract = "Small Unmanned Aerial Vehicles (UAVs) are becoming potential threats to security-sensitive areas and personal privacy. A UAV can shoot photos at height, but how to detect \ldots{}", acknowledgement = ack-nhfb, articleno = "44", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2024:INE, author = "Wen Zhang and Chen Pan and Tao Liu and Zhang, Jeff (Jun) and Mehdi Sookhak and Mimi Xie", title = "Intelligent Networking for Energy Harvesting Powered {IoT} Systems", journal = j-TOSN, volume = "20", number = "2", pages = "45:1--45:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3638765", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3638765", abstract = "As the next-generation battery substitute for IoT system, energy harvesting (EH) technology revolutionizes the IoT industry with environmental friendliness, ubiquitous \ldots{}", acknowledgement = ack-nhfb, articleno = "45", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2024:RCP, author = "Yaming Xu and Yan Wang and Boliang Li", title = "Robust Classification and {6D} Pose Estimation by Sensor Dual Fusion of Image and Point Cloud Data", journal = j-TOSN, volume = "20", number = "2", pages = "46:1--46:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3639705", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3639705", abstract = "It is an important aspect to fully leverage complementary sensors of images and point clouds for objects classification and six-dimensional (6D) pose estimation \ldots{}", acknowledgement = ack-nhfb, articleno = "46", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Shen:2024:RST, author = "Zhihao Shen and Wan Du and Xi Zhao and Jianhua Zou", title = "Retrieving Similar Trajectories from Cellular Data of Multiple Carriers at City Scale", journal = j-TOSN, volume = "20", number = "2", pages = "47:1--47:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3613245", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3613245", abstract = "Retrieving similar trajectories aims to search for the trajectories that are close to a query trajectory in spatio-temporal domain from a large trajectory dataset. This is critical \ldots{}", acknowledgement = ack-nhfb, articleno = "47", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2024:AHF, author = "Jinghui Zhang and Jiawei Wang and Yaning Li and Fa Xin and Fang Dong and Junzhou Luo and Zhihua Wu", title = "Addressing Heterogeneity in Federated Learning with Client Selection via Submodular Optimization", journal = j-TOSN, volume = "20", number = "2", pages = "48:1--48:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3638052", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3638052", abstract = "Federated learning (FL) has been proposed as a privacy-preserving distributed learning paradigm, which differs from traditional distributed learning in two main aspects: the systems \ldots{}", acknowledgement = ack-nhfb, articleno = "48", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Shi:2024:OAU, author = "Tuo Shi and Zhipeng Cai and Jianzhong Li and Hong Gao", title = "Optimize the Age of Useful Information in Edge-assisted Energy-harvesting Sensor Networks", journal = j-TOSN, volume = "20", number = "2", pages = "49:1--49:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3640342", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3640342", abstract = "The energy-harvesting sensor network is a new network architecture to further prolong the lifetime of sensor networks and enhance the quality of IoT services. Due to the \ldots{}", acknowledgement = ack-nhfb, articleno = "49", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhou:2024:MSD, author = "Zhiyuan Zhou and Xiaolei Zhou and Baoshen Guo and Shuai Wang and Tian He", title = "Multi-sensor Data-driven Route Prediction in Instant Delivery with a 3-Conversion Network", journal = j-TOSN, volume = "20", number = "2", pages = "50:1--50:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3639405", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3639405", abstract = "Route prediction in instant delivery is still challenging due to the unique characteristics compared with conventional delivery services, such as strict deadlines, overlapped \ldots{}", acknowledgement = ack-nhfb, articleno = "50", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Fan:2024:BDW, author = "Boyu Fan and Xiang Su and Sasu Tarkoma and Pan Hui", title = "Behave Differently when Clustering: a Semi-asynchronous Federated Learning Approach for {IoT}", journal = j-TOSN, volume = "20", number = "3", pages = "51:1--51:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3639825", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3639825", abstract = "The Internet of Things (IoT) has revolutionized the connectivity of diverse sensing devices, generating an enormous volume of data. However, applying machine learning \ldots{}", acknowledgement = ack-nhfb, articleno = "51", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2024:BEE, author = "Yifan Xu and Fan Dang and Kebin Liu and Zhui Zhu and Xinlei Chen and Xu Wang and Xin Miao and Haitian Zhao", title = "{BEANet}: an Energy-efficient {BLE} Solution for High-capacity Equipment Area Network", journal = j-TOSN, volume = "20", number = "3", pages = "52:1--52:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3641280", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3641280", abstract = "The digital transformation of factories has greatly increased the number of peripherals that need to connect to a network for sensing or control, resulting in a growing demand \ldots{}", acknowledgement = ack-nhfb, articleno = "52", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2024:UCU, author = "Guoming Zhang and Xiaoyu Ji and Xinyan Zhou and Donglian Qi and Wenyuan Xu", title = "Ultrasound Communication Using the Nonlinearity Effect of Microphone Circuits in Smart Devices", journal = j-TOSN, volume = "20", number = "3", pages = "53:1--53:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3631120", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3631120", abstract = "Acoustic communication has become a research focus without requiring extra hardware and facilitates numerous near-field applications such as mobile payment. To communicate, \ldots{}", acknowledgement = ack-nhfb, articleno = "53", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sun:2024:FEE, author = "Zehua Sun and Tao Ni and Huanqi Yang and Kai Liu and Yu Zhang and Tao Gu and Weitao Xu", title = "{FLoRa+}: Energy-efficient, Reliable, Beamforming-assisted, and Secure Over-the-air Firmware Update in {LoRa} Networks", journal = j-TOSN, volume = "20", number = "3", pages = "54:1--54:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3641548", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3641548", abstract = "The widespread deployment of unattended LoRa networks poses a growing need to perform Firmware Updates Over-The-Air (FUOTA). However, the FUOTA specifications \ldots{}", acknowledgement = ack-nhfb, articleno = "54", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Huang:2024:SSE, author = "Haiyang Huang and Tianhui Meng and Jianxiong Guo and Xuekai Wei and Weijia Jia", title = "{SecEG}: a Secure and Efficient Strategy against {DDoS} Attacks in Mobile Edge Computing", journal = j-TOSN, volume = "20", number = "3", pages = "55:1--55:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3641106", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3641106", abstract = "Application-layer distributed denial-of-service (DDoS) attacks incapacitate systems by using up their resources, causing service interruptions, financial losses, and more. \ldots{}", acknowledgement = ack-nhfb, articleno = "55", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cheng:2024:ECS, author = "Yushi Cheng and Boyang Zhou and Yanjiao Chen and Yi-Chao Chen and Xiaoyu Ji and Wenyuan Xu", title = "Evaluating Compressive Sensing on the Security of Computer Vision Systems", journal = j-TOSN, volume = "20", number = "3", pages = "56:1--56:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3645093", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3645093", abstract = "The rising demand for utilizing fine-grained data in deep-learning (DL) based intelligent systems presents challenges for the collection and transmission abilities of real-world \ldots{}", acknowledgement = ack-nhfb, articleno = "56", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Saxena:2024:HEA, author = "Ravi Raj Saxena and Joydeep Pal and Srinivasan Iyengar and Bhawana Chhaglani and Anurag Ghosh and Venkata N. Padmanabhan and Prabhakar T. Venkata", title = "Holistic Energy Awareness and Robustness for Intelligent Drones", journal = j-TOSN, volume = "20", number = "3", pages = "57:1--57:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3641855", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3641855", abstract = "Drones represent a significant technological shift at the convergence of on-demand cyber-physical systems and edge intelligence. However, realizing their full potential necessitates \ldots{}", acknowledgement = ack-nhfb, articleno = "57", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2024:FTM, author = "Zichuan Xu and Haiyang Qiao and Weifa Liang and Zhou Xu and Qiufen Xia and Pan Zhou and Omer F. Rana and Wenzheng Xu", title = "Flow-Time Minimization for Timely Data Stream Processing in {UAV}-Aided Mobile Edge Computing", journal = j-TOSN, volume = "20", number = "3", pages = "58:1--58:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3643813", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3643813", abstract = "Unmanned Aerial Vehicles (UAVs) have gained increasing attention by both academic and industrial communities, due to their flexible deployment and efficient line-of-sight \ldots{}", acknowledgement = ack-nhfb, articleno = "58", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Biegelmeyer:2024:ESB, author = "Anderson Biegelmeyer and Alexandre {Dos Santos Roque} and Edison {Pignaton de Freitas}", title = "An Experimental Study on {BLE 5} Mesh Applied to Public Transportation", journal = j-TOSN, volume = "20", number = "3", pages = "59:1--59:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3647641", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3647641", abstract = "Today, In-Vehicle Wireless Sensor Networks (IVWSNs) are being used by car manufacturers because it saves time in the assembling process; saves costs in the harness and \ldots{}", acknowledgement = ack-nhfb, articleno = "59", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2024:EFG, author = "Xiao Zhang and James Mariani and Li Xiao and Matt W. Mutka", title = "Exploiting Fine-grained Dimming with Improved {LiFi} Throughput", journal = j-TOSN, volume = "20", number = "3", pages = "60:1--60:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3643814", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3643814", abstract = "Optical wireless communication (OWC) shows great potential due to its broad spectrum and the exceptional intensity switching speed of LEDs. Under poor conditions, most OWC \ldots{}", acknowledgement = ack-nhfb, articleno = "60", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lian:2024:RSL, author = "Jie Lian and Xu Yuan and Jiadong Lou and Li Chen and Hao Wang and Nianfeng Tzeng", title = "Room-scale Location Trace Tracking via Continuous Acoustic Waves", journal = j-TOSN, volume = "20", number = "3", pages = "61:1--61:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3649136", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3649136", abstract = "The increasing prevalence of smart devices spurs the development of emerging indoor localization technologies for supporting diverse personalized applications at home. Given marked \ldots{}", acknowledgement = ack-nhfb, articleno = "61", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gong:2024:WSW, author = "Liangyi Gong and Hao Lin and Daibo Liu and Lanqi Yang and Hongyi Wang and Jiaxing Qiu and Zhenhua Li and Feng Qian", title = "Who Should We Blame for {Android} App Crashes? {An} In-Depth Study at Scale and Practical Resolutions", journal = j-TOSN, volume = "20", number = "3", pages = "62:1--62:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3649895", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3649895", abstract = "Android system has been widely deployed in energy-constrained IoT devices for many practical applications, such as smart phone, smart home, healthcare, fitness, and \ldots{}", acknowledgement = ack-nhfb, articleno = "62", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Du:2024:FVM, author = "Hongwei Du and Jingfang Su and Zhao Zhang and Zhenhua Duan and Cong Tian and Ding-Zhu Du", title = "Full View Maximum Coverage of Camera Sensors: Moving Object Monitoring", journal = j-TOSN, volume = "20", number = "3", pages = "63:1--63:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3649314", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3649314", abstract = "The study focuses on achieving full view coverage in a camera sensor network to effectively monitor moving objects from multiple perspectives. Three key issues are \ldots{}", acknowledgement = ack-nhfb, articleno = "63", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Laidi:2024:TST, author = "Roufaida Laidi and Djamel Djenouri and Youcef Djenouri and Jerry Chun-Wei Lin", title = "{TG-SPRED}: Temporal Graph for Sensorial Data {PREDiction}", journal = j-TOSN, volume = "20", number = "3", pages = "64:1--64:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3649892", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3649892", abstract = "This study introduces an innovative method aimed at reducing energy consumption in sensor networks by predicting sensor data, thereby extending the network's operational \ldots{}", acknowledgement = ack-nhfb, articleno = "64", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ma:2024:LAS, author = "Qiang Ma and Hao Yuan and Zhe Hu and Xu Wang and Zheng Yang", title = "A Liquidity Analysis System for Large-scale Video Streams in the Oilfield", journal = j-TOSN, volume = "20", number = "3", pages = "65:1--65:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3649222", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3649222", abstract = "This article introduces LinkStream, a liquidity analysis system based on multiple video streams designed and implemented for oilfield. LinkStream combines a variety of \ldots{}", acknowledgement = ack-nhfb, articleno = "65", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Babatunde:2024:GRE, author = "Simeon Babatunde and Arwa Alsubhi and Josiah Hester and Jacob Sorber", title = "{Greentooth}: Robust and Energy Efficient Wireless Networking for Batteryless Devices", journal = j-TOSN, volume = "20", number = "3", pages = "66:1--66:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3649221", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3649221", abstract = "Communication presents a critical challenge for emerging intermittently powered batteryless sensors. Batteryless devices that operate entirely on harvested energy often experience \ldots{}", acknowledgement = ack-nhfb, articleno = "66", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zheng:2024:PDT, author = "Xiaolong Zheng and Ruinan Li and Yuting Wang and Liang Liu and Huadong Ma", title = "{PolarScheduler}: Dynamic Transmission Control for Floating {LoRa} Networks", journal = j-TOSN, volume = "20", number = "3", pages = "67:1--67:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3652856", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3652856", abstract = "LoRa is widely deploying in aquatic environments to support various Internet of Things applications. However, floating LoRa networks suffer from serious performance \ldots{}", acknowledgement = ack-nhfb, articleno = "67", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sorbelli:2024:DBB, author = "Francesco Betti Sorbelli and Federico Cor{\'o} and Sajal K. Das and Lorenzo Palazzetti and Cristina M. Pinotti", title = "Drone-Based Bug Detection in Orchards with Nets: a Novel Orienteering Approach", journal = j-TOSN, volume = "20", number = "3", pages = "68:1--68:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3653713", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3653713", abstract = "The use of drones for collecting information and detecting bugs in orchards covered by nets is a challenging problem. The nets help in reducing pest damage, but they also constrain \ldots{}", acknowledgement = ack-nhfb, articleno = "68", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2024:HBT, author = "Pengfei Wang and Dian Jiao and Leyou Yang and Bin Wang and Ruiyun Yu", title = "Hypergraph-based Truth Discovery for Sparse Data in Mobile Crowdsensing", journal = j-TOSN, volume = "20", number = "3", pages = "69:1--69:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3649894", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3649894", abstract = "Mobile crowdsensing leverages the power of a vast group of participants to collect sensory data, thus presenting an economical solution for data collection. However, due to the \ldots{}", acknowledgement = ack-nhfb, articleno = "69", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ding:2024:EDR, author = "Xianzhong Ding and Alberto Cerpa and Wan Du", title = "Exploring Deep Reinforcement Learning for Holistic Smart Building Control", journal = j-TOSN, volume = "20", number = "3", pages = "70:1--70:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3656043", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3656043", abstract = "In recent years, the focus has been on enhancing user comfort in commercial buildings while cutting energy costs. Efforts have mainly centered on improving HVAC systems, \ldots{}", acknowledgement = ack-nhfb, articleno = "70", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2024:FTA, author = "Jiarui Zhang and Jiliang Wang", title = "{FusionTrack}: Towards Accurate Device-free Acoustic Motion Tracking with Signal Fusion", journal = j-TOSN, volume = "20", number = "3", pages = "71:1--71:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3654666", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3654666", abstract = "Acoustic motion tracking is rapidly evolving with various applications. However, existing approaches still have some limitations. Tracking based on single-frequency continuous \ldots{}", acknowledgement = ack-nhfb, articleno = "71", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2024:EAL, author = "Yijie Chen and Jiliang Wang and Jing Yang", title = "Exploiting Anchor Links for {NLOS} Combating in {UWB} Localization", journal = j-TOSN, volume = "20", number = "3", pages = "72:1--72:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3657639", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3657639", abstract = "UWB (Ultra-wideband) has been shown to be a promising technology to provide accurate positioning for the Internet of Things. However, its performance significantly degrades \ldots{}", acknowledgement = ack-nhfb, articleno = "72", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2024:TED, author = "Mingzhe Li and Wei Wang and Jin Zhang", title = "Towards Efficient and Deposit-Free Blockchain-Based Spatial Crowdsourcing", journal = j-TOSN, volume = "20", number = "3", pages = "73:1--73:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3656343", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3656343", abstract = "Spatial crowdsourcing leverages the widespread use of mobile devices to outsource tasks to a crowd of users based on their geographical location. Despite its growing popularity, \ldots{}", acknowledgement = ack-nhfb, articleno = "73", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2024:CMD, author = "Yuncan Zhang and Weifa Liang and Wenzheng Xu and Zichuan Xu and Xiaohua Jia", title = "Cost Minimization of Digital Twin Placements in Mobile Edge Computing", journal = j-TOSN, volume = "20", number = "3", pages = "74:1--74:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3658449", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3658449", abstract = "In the past decades, explosive numbers of Internet of Things (IoT) devices (objects) have been connected to the Internet, which enable users to access, control, and monitor \ldots{}", acknowledgement = ack-nhfb, articleno = "74", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Meng:2024:AAG, author = "Xiangwei Meng and Wei Liang and Zisang Xu and Kuanching Li and Muhammad Khurram Khan and Xiaoyan Kui", title = "An Anonymous Authenticated Group Key Agreement Scheme for Transfer Learning Edge Services Systems", journal = j-TOSN, volume = "20", number = "3", pages = "75:1--75:??", month = may, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3657292", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed May 22 07:19:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3657292", abstract = "The visual information processing technology based on deep learning can play many important yet assistant roles for unmanned aerial vehicles (UAV) navigation in complex \ldots{}", acknowledgement = ack-nhfb, articleno = "75", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Hu:2024:ISS, author = "Pengfei Hu and Zhe Chen and Chris Xiaoxuan Lu and Xuyu Wang and Jun Luo and Prasant Mohapatra", title = "Introduction to the Special Section on Contact-free Smart Sensing in {AIoT}", journal = j-TOSN, volume = "20", number = "4", pages = "76:1--76:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3639406", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3639406", acknowledgement = ack-nhfb, articleno = "76", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Slapnicar:2024:FRB, author = "Gasper Slapnicar and Wenjin Wang and Mitja Lustrek", title = "Feasibility of Remote Blood Pressure Estimation via Narrow-band Multi-wavelength Pulse Transit Time", journal = j-TOSN, volume = "20", number = "4", pages = "77:1--77:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3597302", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3597302", abstract = "Contact-free sensing gained much traction in the past decade. While remote monitoring of some parameters (heart rate) is approaching clinical levels of precision, others remain \ldots{}", acknowledgement = ack-nhfb, articleno = "77", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sheng:2024:LLS, author = "Biyun Sheng and Jiabin Li and Linqing Gui and Zhengxin Guo and Fu Xiao", title = "{LiteWiSys}: a Lightweight System for {WiFi-based} Dual-task Action Perception", journal = j-TOSN, volume = "20", number = "4", pages = "78:1--78:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3632177", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3632177", abstract = "As two important contents in WiFi-based action perception, detection and recognition require localizing motion regions from the entire temporal sequences and classifying the \ldots{}", acknowledgement = ack-nhfb, articleno = "78", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liao:2024:TTF, author = "Peng Liao and Xuyu Wang and Lingling An and Shiwen Mao and Tianya Zhao and Chao Yang", title = "{TFSemantic}: a Time-Frequency Semantic {GAN} Framework for Imbalanced Classification Using Radio Signals", journal = j-TOSN, volume = "20", number = "4", pages = "79:1--79:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3614096", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3614096", abstract = "Recently, wireless sensing techniques have been widely used for Internet of Things (IoT) applications. Unlike traditional device-based sensing, wireless sensing is \ldots{}", acknowledgement = ack-nhfb, articleno = "79", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2024:TSO, author = "Xiaobin Zhang and Hongzhe Xu and Jianwei Liu and Jinsong Han", title = "{TomFi}: Small Object Tracking Using Commodity {WiFi}", journal = j-TOSN, volume = "20", number = "4", pages = "80:1--80:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3588772", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3588772", abstract = "Rodent infestation has always been one of the most severe threats to humans, which to solve consumes massive manpower and resources. People usually use traps or poisons to \ldots{}", acknowledgement = ack-nhfb, articleno = "80", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2024:AFM, author = "Penghao Wang and Ruobing Jiang and Zhongwen Guo and Chao Liu", title = "{Afitness}: Fitness Monitoring on Smart Devices via Acoustic Motion Images", journal = j-TOSN, volume = "20", number = "4", pages = "81:1--81:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3592612", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3592612", abstract = "Recently, as fitness has become a popular part of people's lives, the intention to record fitness processes and assess the standards of fitness movements has grown increasingly \ldots{}", acknowledgement = ack-nhfb, articleno = "81", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2024:UCR, author = "Xun Wang and Zhizheng Yang and Wei Wang and Haipeng Dai and Shuyu Shi and Qing Gu", title = "{UltraCLR}: Contrastive Representation Learning Framework for Ultrasound-based Sensing", journal = j-TOSN, volume = "20", number = "4", pages = "82:1--82:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3597498", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3597498", abstract = "We propose UltraCLR, a new contrastive learning framework that fuses dual modulation ultrasonic sensing signals to enhance gesture representation. Most existing \ldots{}", acknowledgement = ack-nhfb, articleno = "82", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2024:ETD, author = "Zhiqiang Wang and Jiahui Hou and Guangyu Wu and Suyuan Liu and Puhan Luo and Xiangyang Li", title = "Efficient Task-driven Video Data Privacy Protection for Smart Camera Surveillance System", journal = j-TOSN, volume = "20", number = "4", pages = "83:1--83:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3625825", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3625825", abstract = "As one of the most commonly used AIoT sensors, smart cameras and their supporting services, namely cloud video surveillance (CVS) systems, have brought great convenience to \ldots{}", acknowledgement = ack-nhfb, articleno = "83", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Mei:2024:PEC, author = "Yaxin Mei and Wenhua Wang and Yuzhu Liang and Qin Liu and Shuhong Chen and Tian Wang", title = "Privacy-Enhanced Cooperative Storage Scheme for Contact-Free Sensory Data in {AIoT} with Efficient Synchronization", journal = j-TOSN, volume = "20", number = "4", pages = "84:1--84:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3617998", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3617998", abstract = "The growing popularity of contact-free smart sensing has contributed to the development of the Artificial Intelligence of Things (AIoT). The contact-free sensory data has great \ldots{}", acknowledgement = ack-nhfb, articleno = "84", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2024:WSS, author = "Xiaocheng Wang and Guiyun Fan and Rong Ding and Haiming Jin and Wentian Hao and Mingyuan Tao", title = "Water Salinity Sensing with {UAV}-Mounted {IR-UWB} Radar", journal = j-TOSN, volume = "20", number = "4", pages = "85:1--85:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3633515", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3633515", abstract = "The quality of surface water is closely related to human's production and livelihood. Water salinity is one of the key indicators of water quality assessment. Recently, there has been \ldots{}", acknowledgement = ack-nhfb, articleno = "85", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2024:WMA, author = "Tiantian Liu and Chao Wang and Zhengxiong Li and Ming-Chun Huang and Wenyao Xu and Feng Lin", title = "{Wavoice}: an {mmWave}-Assisted Noise-Resistant Speech Recognition System", journal = j-TOSN, volume = "20", number = "4", pages = "86:1--86:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3597457", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3597457", abstract = "As automatic speech recognition evolves, deployment of the voice user interface (VUI) has boomingly expanded. Especially since the COVID-19 pandemic, the VUI has gained more \ldots{}", acknowledgement = ack-nhfb, articleno = "86", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Guo:2024:LBO, author = "Qing Guo and Lei Xie and Xinran Lu and Yanling Bu and Chuyu Wang and Baoliu Ye and Sanglu Lu", title = "{LightGyro}: a Batteryless Orientation Measuring Scheme Based on Light Reflection", journal = j-TOSN, volume = "20", number = "4", pages = "87:1--87:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3597934", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3597934", abstract = "In industrial production, the orientation of facility components can indicate whether the facility is on a regular operating track. For example, when a component gets loose, the orientation \ldots{}", acknowledgement = ack-nhfb, articleno = "87", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhao:2024:TET, author = "Ruoyu Zhao and Yushu Zhang and Wenying Wen and Rushi Lan and Yong Xiang", title = "{E-TPE}: Efficient Thumbnail-Preserving Encryption for Privacy Protection in Visual Sensor Networks", journal = j-TOSN, volume = "20", number = "4", pages = "88:1--88:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3592611", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3592611", abstract = "When visual sensor networks (VSNs) enter daily life in society, they not only bring great convenience but also cause people to worry about privacy. Traditional image encryption \ldots{}", acknowledgement = ack-nhfb, articleno = "88", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Han:2024:MMB, author = "Mingda Han and Huanqi Yang and Tao Ni and Di Duan and Mengzhe Ruan and Yongliang Chen and Jia Zhang and Weitao Xu", title = "{mmSign}: {mmWave}-based Few-Shot Online Handwritten Signature Verification", journal = j-TOSN, volume = "20", number = "4", pages = "89:1--89:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3605945", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3605945", abstract = "Handwritten signature verification has become one of the most important document authentication methods that are widely used in the financial, legal, and administrative \ldots{}", acknowledgement = ack-nhfb, articleno = "89", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lu:2024:ASS, author = "Xinxin Lu and Lei Wang and Chi Lin and Xin Fan and Bin Han and Xin Han and Zhenquan Qin", title = "{AutoDLAR}: a Semi-supervised Cross-modal Contact-free Human Activity Recognition System", journal = j-TOSN, volume = "20", number = "4", pages = "90:1--90:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3607254", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3607254", abstract = "WiFi-based human activity recognition (HAR) plays an essential role in various applications such as security surveillance, health monitoring, and smart home. Existing HAR \ldots{}", acknowledgement = ack-nhfb, articleno = "90", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2024:VAS, author = "Feng Li and Jiayi Zhao and Huan Yang and Dongxiao Yu and Yuanfeng Zhou and Yiran Shen", title = "{VibHead}: an Authentication Scheme for Smart Headsets through Vibration", journal = j-TOSN, volume = "20", number = "4", pages = "91:1--91:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3614432", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3614432", abstract = "Recent years have witnessed the fast penetration of Virtual Reality (VR) and Augmented Reality (AR) systems into our daily life, the security and privacy issues of the VR/AR \ldots{}", acknowledgement = ack-nhfb, articleno = "91", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhou:2024:WCW, author = "Zhiyi Zhou and Lei Wang and Xinxin Lu and Yu Tian and Jian Fang and Bingxian Lu", title = "{Wave-CapNet}: a Wavelet Neuron-based {Wi-Fi} Sensing Model for Human Identification", journal = j-TOSN, volume = "20", number = "4", pages = "92:1--92:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3624746", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3624746", abstract = "Gait is regarded as a unique feature for identifying people, and gait recognition is the basis of various customized services of the IoT. Unlike traditional techniques for \ldots{}", acknowledgement = ack-nhfb, articleno = "92", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2024:EET, author = "Shuai Wang and Luoyu Mei and Zhimeng Yin and Hao Li and Ruofeng Liu and Wenchao Jiang and Chris Xiaoxuan Lu", title = "End-to-End Target Liveness Detection via {mmWave} Radar and Vision Fusion for Autonomous Vehicles", journal = j-TOSN, volume = "20", number = "4", pages = "93:1--93:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3628453", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3628453", abstract = "The successful operation of autonomous vehicles hinges on their ability to accurately identify objects in their vicinity, particularly living targets such as bikers and pedestrians. \ldots{}", acknowledgement = ack-nhfb, articleno = "93", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2024:WCR, author = "Youwei Zhang and Feiyu Han and Panlong Yang and Yuanhao Feng and Yubo Yan and Ran Guan", title = "{Wi-Cyclops}: Room-Scale {WiFi} Sensing System for Respiration Detection Based on Single-Antenna", journal = j-TOSN, volume = "20", number = "4", pages = "94:1--94:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3632958", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3632958", abstract = "Recent years have witnessed the emerging development of single-antenna wireless respiration detection that can be integrated into IoT devices with a single transceiver \ldots{}", acknowledgement = ack-nhfb, articleno = "94", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cao:2024:WFG, author = "Zhichao Cao and Chenning Li and Li Liu and Mi Zhang", title = "{WiVelo}: Fine-grained {Wi-Fi} Walking Velocity Estimation", journal = j-TOSN, volume = "20", number = "4", pages = "95:1--95:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3664196", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3664196", abstract = "Passive human tracking using Wi-Fi has been researched broadly in the past decade. Besides straightforward anchor point localization, velocity is another vital sign adopted by the \ldots{}", acknowledgement = ack-nhfb, articleno = "95", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2024:DBP, author = "Jiangyuan Chen and Ammar Hawbani and Xiaohua Xu and Xingfu Wang and Liang Zhao and Zhi Liu and Saeed Alsamhi", title = "A {DRL}-based Partial Charging Algorithm for Wireless Rechargeable Sensor Networks", journal = j-TOSN, volume = "20", number = "4", pages = "96:1--96:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3661999", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3661999", abstract = "Breakthroughs in Wireless Energy Transfer technologies have revitalized Wireless Rechargeable Sensor Networks. However, how to schedule mobile chargers rationally has \ldots{}", acknowledgement = ack-nhfb, articleno = "96", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cheng:2024:MML, author = "Xia Cheng and Mo Sha", title = "{MERA}: Meta-Learning Based Runtime Adaptation for Industrial Wireless Sensor-Actuator Networks", journal = j-TOSN, volume = "20", number = "4", pages = "97:1--97:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3665330", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3665330", abstract = "IEEE 802.15.4-based industrial wireless sensor-actuator networks (WSANs) have been widely deployed to connect sensors, actuators, and controllers in industrial facilities. \ldots{}", acknowledgement = ack-nhfb, articleno = "97", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yang:2024:LDP, author = "Kang Yang and Wan Du", title = "A Low-Density Parity-Check Coding Scheme for {LoRa} Networking", journal = j-TOSN, volume = "20", number = "4", pages = "98:1--98:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3665928", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3665928", abstract = "This article presents a novel system, LLDPC, $^1$ which brings Low-Density Parity-Check (LDPC) codes into Long Range (LoRa) networks to improve Forward Error Correction, a \ldots{}", acknowledgement = ack-nhfb, articleno = "98", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Du:2024:OIE, author = "Wan Du and Xianzhong Ding", title = "Optimizing Irrigation Efficiency using Deep Reinforcement Learning in the Field", journal = j-TOSN, volume = "20", number = "4", pages = "99:1--99:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3662182", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3662182", abstract = "Agricultural irrigation is a significant contributor to freshwater consumption. However, the current irrigation systems used in the field are not efficient. They rely mainly on soil \ldots{}", acknowledgement = ack-nhfb, articleno = "99", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2024:HHC, author = "Li Zhang and Xu Zhou and Danyang Li and Zheng Yang", title = "{HCCNet}: Hybrid Coupled Cooperative Network for Robust Indoor Localization", journal = j-TOSN, volume = "20", number = "4", pages = "100:1--100:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3665645", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3665645", abstract = "Accurate localization of unmanned aerial vehicle (UAV) is critical for navigation in GPS-denied regions, which remains a highly challenging topic in recent research. This article \ldots{}", acknowledgement = ack-nhfb, articleno = "100", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2024:EQO, author = "Daibo Liu and Chao Qian and Huigui Rong and Siwang Zhou and Chaocan Xiang and Hongbo Jiang", title = "Energy and {QoE} Optimization for Mobile Video Streaming with Adaptive Brightness Scaling", journal = j-TOSN, volume = "20", number = "4", pages = "101:1--101:??", month = jul, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3670999", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:00 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3670999", acknowledgement = ack-nhfb, articleno = "101", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gadre:2024:ALG, author = "Akshay Gadre and Zachary Machester and Swarun Kumar", title = "Adapting {LoRa} Ground Stations for Low-latency Imaging and Inference from {LoRa-enabled} {CubeSats}", journal = j-TOSN, volume = "20", number = "5", pages = "102:1--102:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3675170", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3675170", abstract = "Recent years have seen the rapid deployment of low-cost CubeSats in low-Earth orbit, many of which experience significant latency (several hours) from the time information is \ldots{}", acknowledgement = ack-nhfb, articleno = "102", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Mir:2024:RLC, author = "Muhammad Sarmad Shahab Mir", title = "{RGB LED} for Communication, Harvesting and Sensing in {IoT} Applications", journal = j-TOSN, volume = "20", number = "5", pages = "103:1--103:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3675169", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3675169", abstract = "RGB LED bulbs have entered the market as a promising alternative to traditional phosphor-coating LEDs to meet illumination standards. In this article, we introduce and propose \ldots{}", acknowledgement = ack-nhfb, articleno = "103", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Guo:2024:TDF, author = "Miao Guo and Shibo He and Chaojie Gu and Xiuzhen Guo and Jiming Chen and Tao Gao and Tongtong Wang", title = "Towards Distributed Flow Scheduling in {IEEE 802.1Qbv} Time-Sensitive Networks", journal = j-TOSN, volume = "20", number = "5", pages = "104:1--104:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3676848", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3676848", abstract = "Flow scheduling plays a pivotal role in enabling Time-Sensitive Networking (TSN) applications. Current flow scheduling mainly adopts a centralized scheme, posing challenges \ldots{}", acknowledgement = ack-nhfb, articleno = "104", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2024:SSE, author = "Huan Liu and Yuzhe Zhang and Xuxu Chen and Dalin Zhang and Rui Li and Tao Qin", title = "Self-Supervised {EEG} Representation Learning for Robust Emotion Recognition", journal = j-TOSN, volume = "20", number = "5", pages = "105:1--105:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3674975", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3674975", abstract = "Emotion recognition based on electroencephalography (EEG) is becoming a growing concern of researchers due to its various applications and portable devices. \ldots{}", acknowledgement = ack-nhfb, articleno = "105", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2024:TSB, author = "Shiyang Wang and Xingchen Wang and Wenjun Jiang and Chenglin Miao and Qiming Cao and Haoyu Wang and Ke Sun and Hongfei Xue and Lu Su", title = "Towards Smartphone-based {$3$D} Hand Pose Reconstruction Using Acoustic Signals", journal = j-TOSN, volume = "20", number = "5", pages = "106:1--106:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3677122", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3677122", abstract = "Accurately reconstructing 3D hand poses is a pivotal element for numerous Human-Computer Interaction applications. In this work, we propose SonicHand, the first smartphone-based \ldots{}", acknowledgement = ack-nhfb, articleno = "106", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wu:2024:UAT, author = "Yuan Wu and Yanjiao Chen and Jian Zhang and Xueluan Gong and Hongliang Bi", title = "{Ubi-AD}: Towards Ubiquitous, Passive {Alzheimer} Detection using the Smartwatch", journal = j-TOSN, volume = "20", number = "5", pages = "107:1--107:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3656174", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3656174", abstract = "Alzheimer's disease (AD) is an insidious and progressive neurodegenerative disease, and the annual relevant social cost for AD patients can reach about \$1 trillion worldwide \ldots{}", acknowledgement = ack-nhfb, articleno = "107", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2024:LAR, author = "Siheng Li and Beihong Jin and Zhi Wang and Fusang Zhang and Xiaoyong Ren and Haiqin Liu", title = "Leveraging Attention-reinforced {UWB} Signals to Monitor Respiration during Sleep", journal = j-TOSN, volume = "20", number = "5", pages = "108:1--108:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3680550", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3680550", abstract = "The respiration state during overnight sleep is an important indicator of human health. However, existing contactless solutions for sleep respiration monitoring either perform \ldots{}", acknowledgement = ack-nhfb, articleno = "108", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Guo:2024:DAC, author = "Jianxiong Guo and Xingjian Ding and Weili Wu and Ding-Zhu Du", title = "A Double Auction for Charging Scheduling among Vehicles Using {DAG}-Blockchains", journal = j-TOSN, volume = "20", number = "5", pages = "109:1--109:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3685932", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3685932", abstract = "Electric Vehicles (EVs) are becoming more and more popular in our daily life, which replaces traditional fuel vehicles to reduce carbon emissions and protect the \ldots{}", acknowledgement = ack-nhfb, articleno = "109", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Teng:2024:OCP, author = "Minyu Teng and Jingxuan Han and Jintao Xie and Jiayao Gao and Jiangfeng Li and Yang Shi", title = "Obfuscating Ciphertext-Policy Attribute-Based Re-Encryption for Sensor Networks with Cloud Storage", journal = j-TOSN, volume = "20", number = "5", pages = "110:1--110:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3687127", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3687127", abstract = "With the rapid growth of wireless sensor networks, secure data transmission, storage, and distribution in such networks has become an urgent demand. To defend against \ldots{}", acknowledgement = ack-nhfb, articleno = "110", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2024:IOG, author = "Yantao Li and Xinyang Li and Xinyu Lei and Huafeng Qin and Yiwen Hu and Gang Zhou", title = "On the Inference of Original Graph Information from Graph Embeddings", journal = j-TOSN, volume = "20", number = "5", pages = "111:1--111:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3688846", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3688846", abstract = "Graph embedding converts a graph data into a low dimensional space to preserve the original graph information. However, graph data can be reconstructed by malicious adversaries \ldots{}", acknowledgement = ack-nhfb, articleno = "111", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{He:2024:REE, author = "Min He and Yali Chen and Min Liu and Xiaokun Fan and Yuchen Zhu", title = "Reliable and Energy-Efficient Communications in Mobile Robotic Networks by Collaborative Beamforming", journal = j-TOSN, volume = "20", number = "5", pages = "112:1--112:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3678011", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3678011", abstract = "For mobile robotic networks in industrial scenarios, reliable and energy-efficient communications are crucial yet challenging. Fortunately, collaborative beamforming \ldots{}", acknowledgement = ack-nhfb, articleno = "112", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2024:URL, author = "Yantao Li and Kaijian Dan and Xinyu Lei and Huafeng Qin and Shaojiang Deng and Gang Zhou", title = "Using Reinforcement Learning to Escape Automatic Filter-based Adversarial Example Defense", journal = j-TOSN, volume = "20", number = "5", pages = "113:1--113:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3688847", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3688847", abstract = "Deep neural networks can be easily fooled by the adversarial example, which is a specially crafted example with subtle and intentional perturbations. A plethora of papers \ldots{}", acknowledgement = ack-nhfb, articleno = "113", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Mao:2024:SDB, author = "Yachen Mao and Yubo Yan and Shanyue Wang and Xiangyang Li", title = "Stabilizing Dynamic Backscatter for Swift and Accurate Object Tracking", journal = j-TOSN, volume = "20", number = "5", pages = "114:1--114:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3687479", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 24 06:50:02 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3687479", abstract = "Accurate and high-speed object movement tracking systems often face significant challenges due to signal instability caused by the object's movement and rotation. To \ldots{}", acknowledgement = ack-nhfb, articleno = "114", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Jia:2024:PDI, author = "Haifeng Jia and Yichen Wei and Yibo Pi and Cailian Chen", title = "Power-Domain Interference Graph Estimation for Multi-hop {BLE} Networks", journal = j-TOSN, volume = "20", number = "6", pages = "115:1--115:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3689635", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3689635", abstract = "Traditional wisdom for network management allocates network resources separately for the measurement and communication tasks. Heavy measurement tasks may compete \ldots{}", acknowledgement = ack-nhfb, articleno = "115", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cheng:2024:MEA, author = "Wenhui Cheng and Zixian Jiang and Chaocan Xiang and Jianglan Fu", title = "Marginal Effect-aware Multiple-Vehicle Scheduling for Road Data Collection: a Near-optimal Result", journal = j-TOSN, volume = "20", number = "6", pages = "116:1--116:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3679016", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3679016", abstract = "Vehicles equipped with abundant sensors offer a promising way for large-scale, low-cost road data collection. To realize this potential, a well-designed vehicle scheduling scheme is \ldots{}", acknowledgement = ack-nhfb, articleno = "116", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Bukhari:2024:ULR, author = "Jumana Bukhari and Zhenghao Zhang", title = "Understanding Long Range-Frequency Hopping Spread Spectrum {(LR-FHSS)} with Real-World Packet Traces", journal = j-TOSN, volume = "20", number = "6", pages = "117:1--117:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3694971", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3694971", abstract = "Long Range-Frequency Hopping Spread Spectrum (LR-FHSS) is a new physical layer option that has been recently added to the LoRa family with the promise of achieving much higher \ldots{}", acknowledgement = ack-nhfb, articleno = "117", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhu:2024:DTF, author = "Shuai Zhu and Thiemo Voigt and Fatemeh Rahimian and Jeonggil Ko", title = "On-device Training: a First Overview on Existing Systems", journal = j-TOSN, volume = "20", number = "6", pages = "118:1--118:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3696003", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3696003", abstract = "The recent breakthroughs in machine learning (ML) and deep learning (DL) have catalyzed the design and development of various intelligent systems over wide application domains. \ldots{}", acknowledgement = ack-nhfb, articleno = "118", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sun:2024:CDU, author = "Yifei Sun and Bojie Lv and Haisheng Tan and Rui Wang and Francis Lau", title = "{COSMO}: Dynamic Uploading Scheduling in {mmWave}-Based Sensor Networks with Mobile Blockers", journal = j-TOSN, volume = "20", number = "6", pages = "119:1--119:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3696790", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3696790", abstract = "Wireless sensor networks (WSNs) leveraging millimeter wave (mmWave) communication for bandwidth-demanding applications is considered in this article. Despite the large \ldots{}", acknowledgement = ack-nhfb, articleno = "119", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Niaz:2024:MCN, author = "Fahim Niaz and Jian Zhang and Yang Zheng and Muhammad Khalid and Ashfaq Niaz", title = "{mm-CUR}: a Novel Ubiquitous, Contact-free, and Location-aware Counterfeit Currency Detection in Bundles Using Millimeter-Wave Sensor", journal = j-TOSN, volume = "20", number = "6", pages = "120:1--120:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3694970", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3694970", abstract = "Abstract: Target material sensing in non-invasive and ubiquitous contexts plays an important role in various applications. Recently, a few wireless sensing systems have \ldots{}", acknowledgement = ack-nhfb, articleno = "120", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cai:2024:TBR, author = "Xinjun Cai and Jingao Xu and Kuntian Deng and Hongbo Lan and Yue Wu and Xiangwen Zhuge and Zheng Yang", title = "{TrinitySLAM}: On-board Real-time Event-image Fusion {SLAM} System for Drones", journal = j-TOSN, volume = "20", number = "6", pages = "121:1--121:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3696420", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3696420", abstract = "Drones have witnessed extensive popularity among diverse smart applications, and visual Simultaneous Localization and Mapping (SLAM) technology is commonly used to \ldots{}", acknowledgement = ack-nhfb, articleno = "121", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gao:2024:NAD, author = "Yujia Gao and Li Shen and liang Liu and Zijian Cao and Dacheng Tao and Huadong Ma and Nei Kato", title = "Neural-aware Decoupling Fusion based Personalized Federated Learning for Intelligent Sensing", journal = j-TOSN, volume = "20", number = "6", pages = "122:1--122:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3697836", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3697836", abstract = "Personalized federated learning (PFL) is a framework that targets individual models for optimization, providing better privacy and flexibility for clients. However, in \ldots{}", acknowledgement = ack-nhfb, articleno = "122", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cao:2024:CCU, author = "Xiaofeng Cao and Deke Guo and Feng Lyu and Peng Yang and Weiming Zhang", title = "{CoDe}: Customizing Urban {HD} Map Deployment Strategy with Spatio-Temporal {GPS} Trace", journal = j-TOSN, volume = "20", number = "6", pages = "123:1--123:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3689823", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3689823", abstract = "In this article, we investigate the edge cache deployment for high definition (HD) urban map provisioning, which is an essential building block for future autonomous driving. Given a \ldots{}", acknowledgement = ack-nhfb, articleno = "123", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2024:WIT, author = "Leiyang Xu and Xiaolong Zheng and Yucheng Zhang and Liang Liu and Huadong Ma", title = "{WiCAM2.0}: Imperceptible and Targeted Attack on Deep Learning based {WiFi} Sensing", journal = j-TOSN, volume = "20", number = "6", pages = "124:1--124:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3698592", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3698592", abstract = "With the widespread adoption of deep learning models in wireless sensing, substantial efforts have been made to develop sophisticated models that improve the accuracy and \ldots{}", acknowledgement = ack-nhfb, articleno = "124", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2024:ERA, author = "Zejun Xu and Wenqiang Jin and Changwei Yao and Xinyi Liu and Shuang Ma and Yu Liu and Zheng Qin and Iman Vakilinia and Daibo Liu", title = "{EM-Rhythm}: an Authentication Method for Heterogeneous {IoT} Devices", journal = j-TOSN, volume = "20", number = "6", pages = "125:1--125:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3700441", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3700441", abstract = "The popularity of IoT devices has penetrated our daily life while posing new challenges in user authentication. Today's solutions, e.g., passwords, fingerprints, and FaceIDs, \ldots{}", acknowledgement = ack-nhfb, articleno = "125", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2024:BEC, author = "Yeming Li and Borui Li and Jiamei Lv and Wei Dong", title = "{BLEdge}: Edge-centric Programming for {BLE} Applications with Multi-connection Optimization", journal = j-TOSN, volume = "20", number = "6", pages = "126:1--126:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3698201", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3698201", abstract = "Recent years have witnessed the rapid growth of IoT (Internet of Things). Bluetooth Low Energy (BLE) is one of the most popular wireless protocols to implement IoT applications \ldots{}", acknowledgement = ack-nhfb, articleno = "126", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhou:2024:DHV, author = "Ruochen Zhou and Xiaoyu Ji and Han Chen and Chen Yan and Wenyuan Xu", title = "Detecting Hidden Voice Recorders via {ADC} Electromagnetic Radiation", journal = j-TOSN, volume = "20", number = "6", pages = "127:1--127:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3700595", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3700595", abstract = "Unauthorized covert voice recording presents a significant threat to privacy-sensitive scenarios, such as confidential meetings and private conversations. Due to their \ldots{}", acknowledgement = ack-nhfb, articleno = "127", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yao:2024:SSD, author = "Yunhao Yao and Jiahui Hou and Guangyu Wu and Yihang Cheng and Mu Yuan and Puhan Luo and Zhiqiang Wang and Xiang-Yang Li", title = "{SecoInfer}: Secure {DNN} End-Edge Collaborative Inference Framework Optimizing Privacy and Latency", journal = j-TOSN, volume = "20", number = "6", pages = "128:1--128:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3694972", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3694972", abstract = "End-edge collaborative inference enhances computational efficiency by segmenting a deep neural network (DNN) model into two parts, executed across the end device and the \ldots{}", acknowledgement = ack-nhfb, articleno = "128", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2024:DBC, author = "Chunlin Li and Yong Zhang and Long Yu and Kun Jiang and Youlong Luo and Shaohua Wan", title = "{DRL}-based Content Caching Strategy With Efficient User Preference Predictions in {UAV}-assisted {VEC}", journal = j-TOSN, volume = "20", number = "6", pages = "129:1--129:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3701234", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3701234", abstract = "In vehicular edge computing, Unmanned Aerial Vehicles (UAVs) have become a feasible solution for addressing high deployment costs faced by base stations in congested roads during \ldots{}", acknowledgement = ack-nhfb, articleno = "129", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cattai:2024:GMG, author = "Tiziana Cattai and Stefania Colonnese and Domenico Garlisi and Antonino Pagano and Francesca Cuomo", title = "{GraphSmart}: a Method for Green and Accurate {IoT} Water Monitoring", journal = j-TOSN, volume = "20", number = "6", pages = "130:1--130:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3695769", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Nov 27 07:21:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3695769", abstract = "Water scarcity is nowadays a critical global concern and an efficient management of water resources is paramount. This paper presents an original approach for monitoring Water \ldots{}", acknowledgement = ack-nhfb, articleno = "130", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sun:2025:IIU, author = "Haifeng Sun and Haohua Du and Xiaojing Yu and Jiahui Hou and Lan Zhang and Xiangyang Li", title = "{IUAC}: Inaudible Universal Adversarial Attacks Against Smart Speakers", journal = j-TOSN, volume = "21", number = "1", pages = "1:1--1:??", month = jan, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3698238", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Feb 4 06:43:07 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3698238", abstract = "Intelligent voice systems are widely utilized to control smart home applications, which raises significant privacy and security concerns. Recent studies have revealed their \ldots{}.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2025:APV, author = "Jiaoyan Chen and Zhehao Cheng and Jin Liu and Xianjun Deng and Laurence T. Yang and Yihong Chen", title = "Achieving Panoramic View Coverage in Visual Mobile Crowd-Sensing Networks for Emergency Monitoring Applications", journal = j-TOSN, volume = "21", number = "1", pages = "2:1--2:??", month = jan, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3701730", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Feb 4 06:43:07 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3701730", abstract = "Visual Mobile Crowd-Sensing (VMCS) collects photos by leveraging camera embedded in mobile users' phones. There are two important issues in VMCS: determining whether photos \ldots{}.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sorbelli:2025:SMD, author = "Francesco Betti Sorbelli and Sajjad Ghobadi and Cristina M. Pinotti", title = "Single- and Multi-Depot Optimization for {UAV-Based} {IoT} Data Collection in Neighborhoods", journal = j-TOSN, volume = "21", number = "1", pages = "3:1--3:??", month = jan, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3704810", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Feb 4 06:43:07 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3704810", abstract = "In this paper, we investigate the problem of deploying the minimum number of Unmanned Aerial Vehicles (UAVs) and determining their flying tours to collect data from all \ldots{}.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2025:SAP, author = "Quan Chen and Zhipeng Cai and Jing Li and Ning Li and Lianglun Cheng and Hong Gao and Song Guo", title = "Structure-Adaptive and Power-Aware Broadcast Scheduling for Multihop Wireless-Powered {IoT} Networks", journal = j-TOSN, volume = "21", number = "1", pages = "4:1--4:??", month = jan, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3707461", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Feb 4 06:43:07 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3707461", abstract = "Wireless Power Transfer technology, which can charge IoT devices over the air, has become a promising technology for IoT networks. In wireless-powered IoT networks, \ldots{}.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2025:FDA, author = "Hao Wang and Haoran Zhang and Lu Wang and Shichang Xuan and Qian Zhang", title = "{Fedeval}: Defending Against Lazybone Attack via Multi-dimension Evaluation in Federated Learning", journal = j-TOSN, volume = "21", number = "1", pages = "5:1--5:??", month = jan, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3703631", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Feb 4 06:43:07 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3703631", abstract = "Federated learning (FL) has become a prominent paradigm for collaborative model training while ensuring data privacy. However, in resource-constrained environments, such as the \ldots{}.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2025:LYF, author = "Huimin Chen and Chaojie Gu and Lilin Xu and Rui Tan and Shibo He and Jiming Chen", title = "Listen to Your Face: a Face Authentication Scheme Based on Acoustic Signals", journal = j-TOSN, volume = "21", number = "1", pages = "6:1--6:??", month = jan, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3708324", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Feb 4 06:43:07 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3708324", abstract = "Face authentication (FA) schemes are widely adopted in smart homes nowadays. However, existing FA systems for smart appliances are commonly camera-based and hence \ldots{}.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhu:2025:TTA, author = "Yuzheng Zhu and Chengzhe Luo and Yongpan Zou and Dongping Chen and Kaishun Wu", title = "{TimbreSense}: Timbre Abnormality Detection for Bel Canto with Smart Devices", journal = j-TOSN, volume = "21", number = "1", pages = "7:1--7:??", month = jan, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3708545", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Feb 4 06:43:07 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3708545", abstract = "With the rise of mobile devices, bel canto practitioners increasingly utilize smart devices as auxiliary tools for improving their singing skills. However, they frequently encounter \ldots{}.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2025:WCS, author = "Jia Xu and Wenbin Chen and Haipeng Dai and Lijie Xu and Fu Xiao and Linfeng Liu", title = "Wireless Charging Scheduling for Long-term Utility Optimization", journal = j-TOSN, volume = "21", number = "1", pages = "8:1--8:??", month = jan, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3708990", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Feb 4 06:43:07 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3708990", abstract = "Wireless power transmission has been widely used to replenish energy for wireless sensor networks, where the energy consumption rate of sensor nodes is usually time varying \ldots{}.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Siam:2025:AIT, author = "Shakhrul Iman Siam and Hyunho Ahn and Li Liu and Samiul Alam and Hui Shen and Zhichao Cao and Ness Shroff and Bhaskar Krishnamachari and Mani Srivastava and Mi Zhang", title = "{Artificial Intelligence of Things}: a Survey", journal = j-TOSN, volume = "21", number = "1", pages = "9:1--9:??", month = jan, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3690639", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Feb 4 06:43:07 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3690639", abstract = "The integration of the Internet of Things (IoT) and modern Artificial Intelligence (AI) has given rise to a new paradigm known as the Artificial Intelligence of Things (AIoT). In this \ldots{}.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wei:2025:SWB, author = "Zhongcheng Wei and Wei Chen and Shuli Ning and Weidong Lin and Nan Li and Bin Lian and Xiang Sun and Jijun Zhao", title = "A Survey on {WiFi}-based Human Identification: Scenarios, Challenges, and Current Solutions", journal = j-TOSN, volume = "21", number = "1", pages = "10:1--10:??", month = jan, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3708323", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Feb 4 06:43:07 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3708323", abstract = "With the evolution of wireless sensing technology, WiFi-based human identification has demonstrated tremendous potential in human-computer interaction and home \ldots{}.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2025:SLC, author = "Ju Wang and Liqiong Chang and Shourya Aggarwal and Omid Abari and Srinivasan Keshav", title = "Sustainable and Low-Cost Greenhouse Soil Moisture Monitoring Using Battery-Free {RFID} Sensors", journal = j-TOSN, volume = "21", number = "2", pages = "11:1--11:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3715128", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3715128", abstract = "Intelligent irrigation based on measurements of soil moisture levels in every pot in a greenhouse can not only improve plant productivity and quality but also save water. However, existing soil moisture sensors are too expensive to deploy in every pot. We \ldots{}", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Huang:2025:SCO, author = "Hui Huang and Qiang Ye and Yitong Zhou", title = "Safety-Critical Offloading with Constrained Reinforcement Learning for Multi-access Edge Computing", journal = j-TOSN, volume = "21", number = "2", pages = "12:1--12:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3715695", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3715695", abstract = "The proliferation of computation-intensive applications, such as autonomous driving, has urged mobile devices to alleviate their local computation pressure using external computing resources. As a promising solution, Multi-access Edge Computing tackles \ldots{}", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2025:MDD, author = "Shengheng Liu and Zihuan Mao and Xingkang Li and Mengguan Pan and Peng Liu and Yongming Huang and Xiaohu You", title = "Model-Driven Deep Neural Network for Enhancing Direction Finding with Commodity {5G} {gNodeB}", journal = j-TOSN, volume = "21", number = "2", pages = "13:1--13:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3712305", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3712305", abstract = "Pervasive and high-accuracy positioning has become increasingly important as a fundamental enabler for intelligent connected devices in mobile networks. Nevertheless, current wireless networks heavily rely on pure model-driven techniques to achieve \ldots{}", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Jewsakul:2025:REI, author = "Sukanya Jewsakul and Edith C. H. Ngai", title = "{RACEME}: Embedded Intelligence for Correlation-driven Predictive Energy-harvesting Management in {LoRa} Networks", journal = j-TOSN, volume = "21", number = "2", pages = "14:1--14:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3715129", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3715129", abstract = "The prolonged lifetime of energy-harvesting (EH) LoRa networks requires that all EH LoRa sensors utilize available harvested energy in an energy-neutral manner to avoid power failures. This requirement is challenging to fulfill due to the unpredictability \ldots{}", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Nakka:2025:HDS, author = "Kalyan Nakka and Habib M. Ammari", title = "Hierarchical Deployment and Square Tessellation for Connected $k$-Coverage in Heterogeneous Planar Wireless Sensor Networks", journal = j-TOSN, volume = "21", number = "2", pages = "15:1--15:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3713074", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3713074", abstract = "Coverage and connectivity are the major performance metrics that reflect the quality of service provided by heterogeneous planar wireless sensor networks (PWSNs) monitoring a planar field of interest (PFoI), where the deployed sensors may not necessarily \ldots{}", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Maioli:2025:DVF, author = "Andrea Maioli and Kevin Alessandro Quinones and Saad Ahmed and Muhammad Hamad Alizai and Luca Mottola", title = "Dynamic Voltage and Frequency Scaling for Intermittent Computing", journal = j-TOSN, volume = "21", number = "2", pages = "16:1--16:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3714470", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3714470", abstract = "We present hardware/software techniques to intelligently regulate supply voltage and clock frequency of intermittently computing devices. These devices rely on ambient energy harvesting to power their operation and small capacitors as energy buffers. \ldots{}", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Bagchi:2025:QSL, author = "Prithwi Bagchi and Basudeb Bera and Ashok Kumar Das and Biplab Sikdar", title = "Quantum Safe Lattice-Based Single Round Online Collaborative Multi-Signature Scheme for Blockchain-Enabled {IoT} Applications", journal = j-TOSN, volume = "21", number = "2", pages = "17:1--17:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3715696", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3715696", abstract = "Multi-signature protocols allow a group of signers to collectively generate a single signature for a shared message. In the context of a decentralized blockchain, multi-signature schemes play a pivotal role in reducing the signature size. Recently, \ldots{}", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2025:ELP, author = "Shengheng Liu and Ningning Fu", title = "Enabling Low-Power Massive {MIMO} with Ternary {ADCs} for {AIoT} Sensing", journal = j-TOSN, volume = "21", number = "2", pages = "18:1--18:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3722220", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3722220", abstract = "The proliferation of networked devices and the surging demand for ubiquitous intelligence have given rise to the artificial intelligence of things (AIoT). However, the utilization of high-resolution analog-to-digital converters (ADCs) and numerous radio \ldots{}", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhou:2025:RMB, author = "Siyuan Zhou and Duc Van Le and Linshan Jiang and Zhuoran Chen and Xiaohua Peng and Daren Ho and Jianmin Zheng and Rui Tan", title = "{RoboCam}: Model-Based Robotic Visual Sensing for Precise Inspection of Mesh Screens", journal = j-TOSN, volume = "21", number = "2", pages = "19:1--19:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3715913", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3715913", abstract = "The 3D-printed mesh screen with dense penetrating pores is a new structure for massive manufacturing of molded pulp package products. However, some of the pores may be clogged by the printing material powder during the printing process. Such defects \ldots{}", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Hussain:2025:SCB, author = "Akram Hussain and Yuan Luo", title = "Spatial Correlations Based Fault Tolerant Source Localization Using Wireless Sensor Networks", journal = j-TOSN, volume = "21", number = "2", pages = "20:1--20:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3711907", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3711907", abstract = "The source localization is a process to determine the location of a signal source based on measurements from sensor nodes or receivers that are spatially distributed in the area around the source. Localizing intruders and mobile users are some of the \ldots{}", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2025:ESS, author = "Ke Xu and Jiangtao Wang and Hongyuan Zhu and Dingchang Zheng", title = "Evaluating Self-Supervised Learning for {WiFi} {CSI}-Based Human Activity Recognition", journal = j-TOSN, volume = "21", number = "2", pages = "21:1--21:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3715130", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3715130", abstract = "With the advancement of the Internet of Things, WiFi Channel State Information (CSI)-based Human Activity Recognition (HAR) has garnered increasing attention from both academic and industrial communities. However, the scarcity of labeled data remains a \ldots{}", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yang:2025:FAM, author = "Kang Yang and Yuning Chen and Wan Du", title = "{FLog}: Automated Modeling of Link Quality for {LoRa} Networks in Orchards", journal = j-TOSN, volume = "21", number = "2", pages = "22:1--22:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3718741", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3718741", abstract = "LoRa networks have been deployed in many orchards for environmental monitoring and crop management. An accurate propagation model is essential for efficiently deploying a LoRa network in orchards, e.g., determining gateway coverage and sensor placement. \ldots{}", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Hada:2025:HAL, author = "Rupendra Pratap Singh Hada and Abhishek Srivastava", title = "A Hybrid Approach for Localisation of Sensor Nodes in Remote Locations", journal = j-TOSN, volume = "21", number = "2", pages = "23:1--23:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3715914", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3715914", abstract = "A Wireless Sensor Network (WSN) is a network of sensor nodes using low-power wireless technology to collect data in a region of interest (ROI). Due to their low energy, locating sensor nodes in large outdoor areas is challenging, which precludes GPS \ldots{}", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2025:TFG, author = "Ziang Wang and Chunhui Duan and Jiawei Xue and Fan Li and Qihua Feng and Yinan Zhu and Ziyang Zhou", title = "{TagRecon}: Fine-Grained {3D} Reconstruction of Multiple Tagged Packages via {RFID} Systems", journal = j-TOSN, volume = "21", number = "2", pages = "24:1--24:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3715131", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3715131", abstract = "To meet the new requirements of Industry 4.0, the logistics field has introduced 3D reconstruction technology. Computer vision-based solutions face challenges like bad lighting conditions and line-of-sight constraints. Meanwhile, the widespread adoption \ldots{}", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2025:RSB, author = "Yantao Li and Yichao Wang and Hongyu Huang", title = "{RPWAEAuth}: Sensor-Based Continuous Authentication Using Reconstruction Probability in {Wasserstein} Autoencoder", journal = j-TOSN, volume = "21", number = "2", pages = "25:1--25:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3717065", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Mar 26 07:01:04 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", URL = "https://dl.acm.org/doi/10.1145/3717065", abstract = "Nowadays, with the widespread adoption of mobile devices, information security has become particularly important. Existing sensor-based continuous authentication systems ensure the security of mobile devices to some extent, but most have drawbacks, such \ldots{}", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Huang:2025:MAE, author = "Ziyao Huang and Weiwei Wu and Vincent Chau and Kui Wu and Xiang Liu and Jianping Wang", title = "Minimizing Age of Event in {Artificial Intelligence of Things}", journal = j-TOSN, volume = "21", number = "3", pages = "26:1--26:??", month = may, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3717834", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu May 29 05:53:21 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Information freshness, measured by the Age-of-Information (AoI) metric, is a crucial aspect of conventional network systems. However, the emergence of the Artificial Intelligence of Things (AIoT) introduces unique requirements for assessing information \ldots{}", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Sun:2025:EDE, author = "Yimiao Sun and Yuan He and Jiacheng Zhang and Xin Na and Yande Chen and Weiguo Wang and Xiuzhen Guo", title = "Exploiting Dispersion Effect of Signals for Accurate Indoor {WiFi} Localization", journal = j-TOSN, volume = "21", number = "3", pages = "27:1--27:??", month = may, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3725850", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu May 29 05:53:21 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "WiFi- based device localization is a key technology for smart applications, while most of which rely on LoS signals to work. However, in real-world indoor environments, very few LoS signals are usable for accurate localization. This article presents \ldots{}", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhu:2025:IAC, author = "Rongxin Zhu and Azzedine Boukerche and Qiuling Yang", title = "An Interference-aware and Collision-free {MAC} Protocol for Underwater Wireless Sensor Networks", journal = j-TOSN, volume = "21", number = "3", pages = "28:1--28:??", month = may, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3724121", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu May 29 05:53:21 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In the realm of underwater wireless communication, vast oceanic expanses often demand large-scale deployment of Underwater Wireless Sensor Networks (UWSNs). UWSNs rely on acoustic communication channels, presenting distinct challenges like prolonged \ldots{}", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2025:ECD, author = "Yurui Zhang and Dongmei Li and Xiaomei Zhang and Wenjing Lv", title = "An Efficient Cross-Domain Fine Grain Proxy Re-encryption Scheme for Secure Transmission in {IIOT}", journal = j-TOSN, volume = "21", number = "3", pages = "29:1--29:??", month = may, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3728643", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu May 29 05:53:21 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "As Internet of Things (IoT) technology continues to advance swiftly, a growing array of IoT devices is being assimilated into the industrial IoT framework. However, ensuring secure and efficient transmission of data from IoT devices has become a key \ldots{}", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2025:EEC, author = "Jiuwei Li and Shixin Wang and Zhaoyuan Xu and Wei Xi and Shuai Wang and Wei Gong", title = "{EchScatter}: Enriching Codeword Translation for High-Throughput Ambient {ZigBee} Backscatter", journal = j-TOSN, volume = "21", number = "3", pages = "30:1--30:??", month = may, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3729535", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu May 29 05:53:21 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present EchScatter, a novel backscatter system that takes productive ZigBee signals as excitations and enables high-throughput ZigBee backscatter communication. Compared with the existing ZigBee backscatter, EchScatter does not need to control the \ldots{}", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2025:DFL, author = "Anqi Zhang and Ping Zhao and Wenke Lu and Guanglin Zhang", title = "Decentralized Federated Learning towards Communication Efficiency, Robustness, and Personalization", journal = j-TOSN, volume = "21", number = "3", pages = "31:1--31:??", month = may, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3730587", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu May 29 05:53:21 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Decentralized federated learning emerged to eliminate the reliance on the central server and address the single point of failure and the network bottleneck in centralized federated learning. However, existing works on decentralized federated learning \ldots{}", acknowledgement = ack-nhfb, articleno = "31", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Luo:2025:CSA, author = "Puhan Luo and Jiahui Hou and Haisheng Tan and Mu Yuan and Guangyu Wu and Kaiwen Guo and Zhiqiang Wang and XiangYang Li", title = "{ChannelZip}: {SLO}-Aware Channel Compression for Task-Adaptive Model Serving on {IoT} Devices", journal = j-TOSN, volume = "21", number = "3", pages = "32:1--32:??", month = may, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3729534", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Thu May 29 05:53:21 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Deploying deep neural networks (DNNs) on IoT devices for model serving is a promising solution for intelligent applications with high real-time requirements and bandwidth sensitivity. To cope with the prohibitive computation and storage overheads of \ldots{}", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Hachem:2025:FGS, author = "Fatima Hachem and Davide Vecchia and Maria Luisa Damiani and Gian Pietro Picco", title = "Fine-Grained Stop-Move Detection with {UWB}: Quality Metrics and Real-World Evaluation", journal = j-TOSN, volume = "21", number = "4", pages = "33:1--33:??", month = jul, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3735558", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jul 25 07:59:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The synergy between the accurate trajectories offered by ultra-wideband (UWB) systems and techniques to extract higher-level mobility patterns is largely unexplored. We study whether staple techniques designed for systems with coarser resolution apply to \ldots{}", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yin:2025:SHH, author = "Zhigang Yin and Marko Radeta and Mohan Liyanage and Mayowa Olapade and Abdul-Rasheed Ottun and Agustin Zuniga and Pan Hui and Petteri Nurmi and Huber Flores", title = "{SNAKE}: Harnessing Human Touch for Produce Quality Estimation to Foster Sustainable Retail Practices", journal = j-TOSN, volume = "21", number = "4", pages = "34:1--34:??", month = jul, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3733720", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jul 25 07:59:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We present SNAKE, an innovative method that harnesses heat transferred from human touch interactions to estimate product quality. SNAKE offers an accessible and cost-effective solution that seamlessly integrates with existing retail practices; for example,. \ldots{}", acknowledgement = ack-nhfb, articleno = "34", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Rajasekaran:2025:EES, author = "Arun Sekar Rajasekaran and Azees Maria and Basker Palaniswamy and Ashok Kumar Das and Mohammed J. F. Alenazi", title = "{ESALP2}: Efficient Signature Aggregation with Location Privacy Preservation in Wireless Body Area Networks", journal = j-TOSN, volume = "21", number = "4", pages = "35:1--35:??", month = jul, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3737460", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jul 25 07:59:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "For Wireless Body Area Networks (WBANs), the security of sensitive data of patients is of the utmost importance, particularly in healthcare environments. This study presents a novel methodology for improving the efficacy of signature aggregation in a \ldots{}", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Du:2025:REG, author = "Lingyu Du and Xucong Zhang and Guohao Lan", title = "Resource-efficient Gaze Estimation via Frequency-domain Multi-task Contrastive Learning", journal = j-TOSN, volume = "21", number = "4", pages = "36:1--36:??", month = jul, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3736767", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jul 25 07:59:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Gaze estimation is of great importance to many scientific fields and daily applications, ranging from fundamental research in cognitive psychology to attention-aware systems. While recent advancements in deep learning have led to highly accurate gaze \ldots{}", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhou:2025:DDA, author = "Fengyu Zhou and Hao Zhou and Weiming Guo and Zhan Wang and Wangqiu Zhou and Xiang Cui and Xiaoyan Wang and Xiangyang Li", title = "{DAEE}: Distributed Adaptive Exploration and Exploitation for Orientation Adjustment in Magnetic Wireless Power Transfer System", journal = j-TOSN, volume = "21", number = "4", pages = "37:1--37:??", month = jul, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3744564", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jul 25 07:59:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Magnetic resonant coupling (MRC) enabled wireless power transfer (WPT) systems have shown significant promise in efficiently charging multiple devices simultaneously through beamforming technology. The existing works propose various mechanisms for \ldots{}", acknowledgement = ack-nhfb, articleno = "37", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2025:DTB, author = "Chunlin Li and Kejun Long and Mengjie Yang and Liang Zhao and Xiaoheng Deng and Denghua Li and Shaohua Wan", title = "{D3QN-TD3}-Based User Association and Resource Allocation in {ISAC}-Aided Vehicular Edge Computing", journal = j-TOSN, volume = "21", number = "4", pages = "38:1--38:??", month = jul, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3744711", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jul 25 07:59:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In Vehicular Edge Computing (VEC), a reasonable and efficient user association and resource allocation approach is a worthwhile research issue. However, most studies in Internet of Vehicles (IoV) only consider vehicle mobility and IoV communication. \ldots{}", acknowledgement = ack-nhfb, articleno = "38", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Kashinath:2025:PBF, author = "Ashish Kashinath and Sibin Mohan and Akshay Nambi and Sumukh Marathe", title = "Physics-Based Fault Analysis for Commodity {PIR} Sensors*", journal = j-TOSN, volume = "21", number = "4", pages = "39:1--39:??", month = jul, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3737877", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jul 25 07:59:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Passive Infra-Red (PIR) sensors are ubiquitous and have applications ranging from automatic lighting and heating control in smart buildings, towel dispensers in washrooms, security alarms (for intrusion detection) to human detection robots (for search and \ldots{}).", acknowledgement = ack-nhfb, articleno = "39", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2025:DBP, author = "Sijia Zhang and Xiang Cui and Haohua Du and Shaoang Li and Yingqi Yu and Jiahui Hou and Xiangyang Li", title = "{DPShaping}: Balancing Privacy Guarantee and Communication Cost in {IoT} Traffic Shaping", journal = j-TOSN, volume = "21", number = "4", pages = "40:1--40:??", month = jul, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3745783", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jul 25 07:59:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In response to the escalating prevalence of inference attacks on network traffic, traffic shaping emerges as a highly effective strategy to curb the leakage of user privacy information. Although many traffic shaping mechanisms have been proposed, their \ldots{}", acknowledgement = ack-nhfb, articleno = "40", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2025:MIT, author = "Gecheng Chen and Chengwen Luo and Haiming Zeng and Gangren Wen and Zheng Luo and Jia Wang and Jin Zhang and Zhongru Yang and Jianqiang Li", title = "{Material-ID}: Towards {mmWave}-based Material Identification", journal = j-TOSN, volume = "21", number = "4", pages = "41:1--41:??", month = jul, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3742432", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jul 25 07:59:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Material sensing holds significant potential in areas such as environmental awareness and security monitoring. While technologies like RFID, WIFI, and UWB offer potential solutions for portable, non-contact material identification, the need to place \ldots{}", acknowledgement = ack-nhfb, articleno = "41", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Feng:2025:REC, author = "Yuanhao Feng and Jinyang Huang and Youwei Zhang and Xiang Zhang and Meng Li and Fusang Zhang and Tianyue Zheng and Anran Li and Mianxiong Dong and Zhi Liu", title = "{RF-Eye}: Commodity {RFID} Can Know What You Write and Who You Are Wherever You Are", journal = j-TOSN, volume = "21", number = "4", pages = "42:1--42:??", month = jul, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3737701", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jul 25 07:59:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Handwriting recognition systems have greatly enhanced AIoT applications, especially in human-computer interaction. Wireless-based methods, favored for their non-invasive nature and ease of deployment, are becoming more common. However, existing works, \ldots{}", acknowledgement = ack-nhfb, articleno = "42", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2025:LAI, author = "Ping Li and Xinrui He and Zhenfei Zhang and Feiyu Han and Panlong Yang and Zhao Lv", title = "Location-aware Inaudible Attack Defense Towards Smart Speakers", journal = j-TOSN, volume = "21", number = "4", pages = "43:1--43:??", month = jul, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3744342", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Fri Jul 25 07:59:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Recent studies show that inaudible attacks pose a non-negligible security risk to smart speakers. While several countermeasures have been proposed to detect the occurrence of the inaudible attack passively, accurately locating the attack source in 3D free \ldots{}", acknowledgement = ack-nhfb, articleno = "43", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2025:FEF, author = "Xiaobin Zhang and Hongzhe Xu and Wei Gao and Zhi Wang", title = "{FewSense}: Enabling Few-Shot Gesture Recognition via {COTS RFID}", journal = j-TOSN, volume = "21", number = "5", pages = "44:1--44:14", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3748725", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 30 08:59:43 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "RFID-based gesture recognition has gained considerable attention in recent years due to the cost-effectiveness of RFID tags and their advantages in preserving visual privacy, providing convenience to users. Existing RFID-based gesture recognition systems \ldots{}", acknowledgement = ack-nhfb, articleno = "44", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wu:2025:MSF, author = "Jiajing Wu and Xiaojun Zhu and Chao Dong and Zhengrui Qin and Fuhui Zhou", title = "Maximizing Sampling Frequency for {UAV} Clusters in Spectrum Reconnaissance Applications", journal = j-TOSN, volume = "21", number = "5", pages = "45:1--45:28", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3750731", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 30 08:59:43 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Unmanned Aerial Vehicle (UAV) clusters are widely used in spectrum reconnaissance, where spectrum samples are transmitted back to the sink through flying ad hoc network (FANET). High sampling frequencies are required, but result in a large amount of data \ldots{}", acknowledgement = ack-nhfb, articleno = "45", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2025:TSW, author = "Youquan Wang and Zhipeng Zhou and Shuai Wang and Xianjun Deng and Wei Xi and Wei Gong", title = "Towards Stable {WiFi}-based {HAR} from Imbalanced Data and Changing Circumstances", journal = j-TOSN, volume = "21", number = "5", pages = "46:1--46:23", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3757321", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 30 08:59:43 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "WiFi-based human activity recognition (WiFi-based HAR) has emerged as a technology in recent decades, offering convenient and privacy-friendly applications. However, existing frameworks designed for stable environments encounter challenges when faced with \ldots{}", acknowledgement = ack-nhfb, articleno = "46", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Bai:2025:GHB, author = "Xuewei Bai and Yongcai Wang and Peng Wang and Chunxu Li and Shuo Wang and Xudong Cai and Deying Li", title = "A Geometric and Hypothesis-Based Method for Low-Overlap, Sparse, and Featureless Point Set Matching", journal = j-TOSN, volume = "21", number = "5", pages = "47:1--47:25", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3746453", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 30 08:59:43 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "This article proposes a general solution for point set matching that effectively addresses the challenges of low-overlap, sparse, or featureless point set matching (LSFPM). Unlike previous methods that mainly rely on feature or neighborhood similarity \ldots{}", acknowledgement = ack-nhfb, articleno = "47", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2025:GTD, author = "Yufan Zhang and Hangliang Li and Yanjun Li and Zhi Ye and Yuzhe Chen and Zhe Yang and Kaikai Chi", title = "{GS-Tag}: Design of a Generic Sensor Tag Based on {RF} Switches and {COTS RFID} System", journal = j-TOSN, volume = "21", number = "5", pages = "48:1--48:18", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3744563", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 30 08:59:43 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "With the development of the Internet of Things (IoT), substantial research efforts have been devoted to extending the sensing capability of commercial off-the-shelf (COTS) radio-frequency identification (RFID) tags. State-of-the-art approaches either \ldots{}", acknowledgement = ack-nhfb, articleno = "48", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gur:2025:FCM, author = "Eyal Gur and Shoham Sabach", title = "Fast and Convergent Method for Large-Scale Sensor Network Localization With Anchor Uncertainty", journal = j-TOSN, volume = "21", number = "5", pages = "49:1--49:30", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3757744", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 30 08:59:43 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The localization of sensor networks involves determining the spatial coordinates of each sensor in a deployed network. This task is accomplished by utilizing noisy distance measurements between neighboring sensors and a limited number of anchor sensors, \ldots{}", acknowledgement = ack-nhfb, articleno = "49", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Zhang:2025:WHS, author = "Youwei Zhang and Zhi Liu and Celimuge Wu and Jie Li and Suhua Tang", title = "{WiCG}: Heartbeat Sensing Using {COTS WiFi} Devices with Common Antenna", journal = j-TOSN, volume = "21", number = "5", pages = "50:1--50:30", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3748330", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Sep 30 08:59:43 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Vital sign detection, based on Channel State Information (CSI) from commercial off-the-shelf (COTS) WiFi devices, has become a popular research area. Previous works in this field mainly focus on respiration, while heartbeat sensing has not been well \ldots{}", acknowledgement = ack-nhfb, articleno = "50", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Fu:2025:CMT, author = "Yue Fu and Qingqing Ye and Rong Du and Haibo Hu", title = "Collecting Multi-type and Correlation-Constrained Streaming Sensor Data with Local Differential Privacy", journal = j-TOSN, volume = "21", number = "6", pages = "51:1--51:27", month = nov, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3623637", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:23 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Local differential privacy (LDP) is a promising privacy model for distributed data collection. It has been widely deployed in real-world systems (e.g., Chrome, iOS, macOS). In LDP-based mechanisms, an aggregator collects private values perturbed by each \ldots{}", acknowledgement = ack-nhfb, articleno = "51", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2025:ITB, author = "Chunlin Li and Shuai Zhang and Yaojuan Wu and Kun Jiang and Wenhao Wu and Shaochong Yuan and Shaohua Wan", title = "Improved {TD3} Based Resource Allocation Optimization for Latency-sensitive Tasks in {ISAC}-aided {VEC}", journal = j-TOSN, volume = "21", number = "6", pages = "52:1--52:27", month = nov, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3767332", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:23 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Vehicular edge computing (VEC) has emerged to address the increasing demands on wireless networks posed by massive data and diverse applications in intelligent vehicular services. However, challenges such as low spectrum utilization due to massive sensor \ldots{}", acknowledgement = ack-nhfb, articleno = "52", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Xu:2025:SSF, author = "Qiling Xu and Danei Gong and Kai Sun and Shuai Wang and Pengpeng Chen and Binbin Xie and Zhimeng Yin", title = "{SLoRa+}: a Systematic Framework for Enhanced Interference Resilience in {LoRaWAN}", journal = j-TOSN, volume = "21", number = "6", pages = "53:1--53:28", month = nov, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3767338", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:23 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "LoRa technology has become critical in numerous IoT applications, offering long-range connections with low energy consumption. However, their low-power nature makes them vulnerable to cross-technology interference (CTI) from other wireless technologies \ldots{}", acknowledgement = ack-nhfb, articleno = "53", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yuan:2025:MRT, author = "Wu Yuan and Hengyu Yu and Lei Ding and Xinrong Hu and Jian Zhang and Yanjiao Chen and Qian Zhang", title = "{MI-Ra}: Towards Motion-robust Myocardial Infarction Detection Using Deep Wireless Sensing", journal = j-TOSN, volume = "21", number = "6", pages = "54:1--54:25", month = nov, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3768580", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:23 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Early detection of myocardial infarction (MI) is essential for alleviating symptoms and improving daily activity performance. Researchers typically employ continuous segments of heartbeat signals (20-30 seconds), such as ECG signals, for MI detection, as \ldots{}", acknowledgement = ack-nhfb, articleno = "54", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Fan:2025:BMM, author = "Xinnan Fan and Xinyang Chen and Pengfei Shi and Yuchen Zhang and Yuanxue Xin", title = "Boosting Multi-modal Fusion for {3D} Vehicle Object Detection", journal = j-TOSN, volume = "21", number = "6", pages = "55:1--55:20", month = nov, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3765739", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:23 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Significant advancements have been made in neural networks for 3D object detection in autonomous driving. However, these vehicles often encounter small and occluded objects, leading to fewer available features and requirement of high positioning accuracy. \ldots{}", acknowledgement = ack-nhfb, articleno = "55", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Wang:2025:LBD, author = "Ruihan Wang and Qi Wang and Siyao Cheng and Dongbo Li and Jie Liu", title = "A Lightweighted Blockchain Deploying Method in {IoT} Systems", journal = j-TOSN, volume = "21", number = "6", pages = "56:1--56:29", month = nov, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3770915", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:23 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The development of the Internet of Things promotes the increasing demand for edge computing, resulting in a large amount of temporal data. Protecting data from tampering has become key to industrial intelligent management. Blockchain technology has become \ldots{}", acknowledgement = ack-nhfb, articleno = "56", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Chen:2025:TOR, author = "Rui Chen and Xiaochen Fan and Huan Yan and Fudan Yu and Yong Li", title = "{TR-ODE}: Robust Vehicle Trajectory Recovery via {Seq2Seq} Learning with {GRU-ODE--Bayes}", journal = j-TOSN, volume = "21", number = "6", pages = "57:1--57:23", month = nov, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3771998", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:23 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Recovering fine-grained urban vehicle trajectory data hold great potential for understanding mobility patterns and improving the efficiency of transportation systems. Most existing solutions rely on regularly sampled GPS points, which capture data only \ldots{}", acknowledgement = ack-nhfb, articleno = "57", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2025:IMA, author = "Chunlin Li and Zihao Zhang and Jiaqi Wang and Shaochong Yuan and Zonghe Wang and Long Chai and Aoyong Li and Shaohua Wan", title = "Improved Multi-Agent Proximal Policy Optimization Algorithm for Resource Allocation with Radar-Perception in {UAV-Assisted} {VEC}", journal = j-TOSN, volume = "21", number = "6", pages = "58:1--58:28", month = nov, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3771094", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:23 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In congested road environments, the spectrum resources available for Roadside Units (RSUs) are often insufficient to meet the communication needs of a large number of users simultaneously. To address this, Unmanned Aerial Vehicles (UAVs) can be deployed \ldots{}", acknowledgement = ack-nhfb, articleno = "58", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Hydher:2025:AAP, author = "Mohamed Hassaan Mohamed Hydher and Markus Schuss and Olga Saukh and Kay R{\"o}mer and Carlo Alberto Boano", title = "{APEX}: Automated Parameter Exploration for Low-Power Wireless Protocols", journal = j-TOSN, volume = "21", number = "6", pages = "59:1--59:36", month = nov, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3770918", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:23 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Careful parametrization of networking protocols is crucial to maximize the performance of low-power wireless systems and ensure that stringent application requirements can be met. This is a non-trivial task involving thorough characterization on testbeds \ldots{}", acknowledgement = ack-nhfb, articleno = "59", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2025:RHB, author = "Ping Li and Bingqing Liu and Jian Li and Shuai Cao and Panlong Yang", title = "{RFID} Harmonics-Based Sub-Millimeter Vibration Sensing", journal = j-TOSN, volume = "21", number = "6", pages = "60:1--60:22", month = nov, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3771278", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:23 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "In industrial monitoring, the accurate detection of subtle mechanical vibrations is essential for implementing effective preventive maintenance strategies and improving equipment longevity. However, current RFID-based sensing technologies are hindered by \ldots{}", acknowledgement = ack-nhfb, articleno = "60", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Lin:2025:SMM, author = "Kequan Lin and Yanling Bu and Xuehao Wang and Chenyu Ling and Lei Xie and Chuyu Wang and Yafeng Yin and Sanglu Lu", title = "{SkyEye}: Multi-Modal Perception Based Video Stitching for Multi-{UAV} Surveillance System", journal = j-TOSN, volume = "21", number = "6", pages = "61:1--61:20", month = nov, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3772285", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:23 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Using multiple Unmanned Aerial Vehicles (UAVs) in video surveillance greatly enhances real-time monitoring of large areas. However, images captured by UAVs are separate and limited in view, making stitching crucial for a comprehensive perspective. Current \ldots{}", acknowledgement = ack-nhfb, articleno = "61", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yan:2025:FDE, author = "Dawei Yan and Feiyu Han and Shang Gao and Fei Shang and Panlong Yang and Yubo Yan", title = "{freeDoppler}: a {Doppler} Effect Learning Network for Accurate {RF}-based Velocity Estimation", journal = j-TOSN, volume = "21", number = "6", pages = "62:1--62:23", month = nov, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3772369", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:23 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Accurately estimating the velocity (including speed and direction) of moving targets has recently attracted widespread attention in augmented reality, security monitoring and sports health. In particular, the Doppler Frequency Shift (DFS)-based velocity \ldots{}", acknowledgement = ack-nhfb, articleno = "62", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gotsman:2026:PCR, author = "Craig Gotsman and Kai Hormann", title = "Practical Compact Routing on Random Unit Disk Graphs", journal = j-TOSN, volume = "22", number = "1", pages = "1:1--1:23", month = jan, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3778347", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:25 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "We describe a simple and practical algorithm for compact routing on connected random unit disk graphs. Using a recursive nested dissection of an n -vertex graph based on compact and balanced vertex separators, we construct routing tables with an average of \ldots{}", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Guo:2026:IAS, author = "Dongfang Guo and Yuting Wu and Pengfei Zhou and Xin Lou and Rui Tan", title = "Invisible Adversarial Stripes on Traffic Sign: Threat and Defense for Autonomous Vehicles", journal = j-TOSN, volume = "22", number = "1", pages = "2:1--2:32", month = jan, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3773031", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:25 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Camera-based computer vision is essential to autonomous vehicle's perception. This article presents an attack that uses light-emitting diodes and exploits the camera's rolling shutter effect to create adversarial stripes in the captured images to mislead \ldots{}", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2026:AFD, author = "Xuanyu Liu and Jiao Li and Haoxian Liu and Zongqi Yang and Yi Huang and Jin Zhang", title = "Atrial Fibrillation Detection System via Acoustic Sensing for Mobile Phones", journal = j-TOSN, volume = "22", number = "1", pages = "3:1--3:35", month = jan, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3771548", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:25 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Atrial fibrillation (AF) is characterized by irregular electrical impulses originating in the atria, which can lead to severe complications and even death. Due to the intermittent nature of the AF, early and timely monitoring of AF is critical for \ldots{}", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Vira:2026:PMU, author = "Gautam Vira and Tet Yeap and Iluju Kiringa", title = "Predictive Maintenance by the Unsupervised Clustering of Gradual Faults in a fleet of {IoT}-based Public Buses", journal = j-TOSN, volume = "22", number = "1", pages = "4:1--4:31", month = jan, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3773280", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:25 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Predictive maintenance involves collecting data from machines and using algorithms to analyze the machine's condition or determine if the machine requires maintenance or repairs. This work presents a clustering-based algorithm for predictive maintenance \ldots{}", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Ding:2026:MEC, author = "Yuxuan Ding and Yu Fan and Pengjin Xie and Liang Liu and Huadong Ma", title = "{MobiLoc}: Enhancing {COTS mmWave} Localization with Neural Network", journal = j-TOSN, volume = "22", number = "1", pages = "5:1--5:24", month = jan, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3774882", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:25 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Millimeter-wave (mmWave) communication technology with high throughput and high reliability attracts much attention in both academic and industrial fields. This technology plays a pivotal role in next-generation communication networks, offering promising \ldots{}", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2026:FCR, author = "Hui Liu and Penghao Wang and Pengyu Wang and Jingyang Hu and Hongbo Jiang and Chao Liu", title = "From Fragmentation to Correlation: Reliable {LoRa} Reception over Weak Marine Links", journal = j-TOSN, volume = "22", number = "1", pages = "6:1--6:23", month = jan, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3774326", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:25 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "LoRa holds significant promise for marine monitoring and communication due to its advantages of long range, low power consumption, and low cost. However, in marine environments, its communication performance is severely degraded by the strong absorption \ldots{}", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Dong:2026:EES, author = "Fang Dong and Runze Chen and Shucun Fu and Wangbing Cheng and Ruiting Zhou and Xu Zhang", title = "Enabling Efficient Synergistic Multi-view Inference Across Heterogeneous Edge Devices", journal = j-TOSN, volume = "22", number = "1", pages = "7:1--7:31", month = jan, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3785358", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Jan 31 08:09:25 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Multi-view inference (MVI), which accepts images from multiple viewpoints as input of deep neural networks, is proposed to improve the inference accuracy of conventional single-view models. However, existing mechanisms face challenges in feature fusion \ldots{}", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Cheng:2026:SPA, author = "Yuhan Cheng and Xuecheng Chen and Yixuan Yang and Haoyang Wang and Jingao Xu and Chaopeng Hong and Susu Xu and Xiao-Ping Zhang and Yunhao Liu and Xinlei Chen", title = "{SniffySquad}: Patchiness-Aware Gas Source Localization with Multi-Robot Collaboration", journal = j-TOSN, volume = "22", number = "2", pages = "8:1--8:27", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3786599", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 17 15:22:24 MDT 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Gas source localization is pivotal for the rapid mitigation of gas leakage disasters, where mobile robots emerge as a promising solution. However, existing methods predominantly schedule robots' movements based on reactive stimuli or simplified gas plume \ldots{}", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2026:CBN, author = "Junye Li and Deepak Mishra and Aruna Seneviratne", title = "{CSI}-Based {NTC} Using Ambient {WiFi}: Channel Selection, Topology Control and Traffic Interference", journal = j-TOSN, volume = "22", number = "2", pages = "9:1--9:28", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3787495", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 17 15:22:24 MDT 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "The ubiquity of WiFi-enabled devices raises the need for advanced network monitoring and management due to security and privacy issues associated with wireless networks. One method is Network Traffic Classification (NTC). However, robust and resilient NTC \ldots{}", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2026:OPP, author = "Xiyue Li and Qi Zhang and Jie Gong", title = "Optimal Preemption Policy for Age of Information Minimization with Random Arrival and Known Packet Length", journal = j-TOSN, volume = "22", number = "2", pages = "10:1--10:23", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3794849", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 17 15:22:24 MDT 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "An optimal preemption framework is proposed to minimize Age of Information (AoI) in single-link systems with stochastic packet arrivals and known packet lengths. The problem is formulated as a Markov Decision Process (MDP) solved through relative value \ldots{}", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yuan:2026:SMW, author = "Wenyang Yuan and Jian Zhang and Wu Yuan and Xiaoxuan Zou and Yijia Long", title = "{$3$D-Sitpose}: Millimeter Wave Radar-Based Human Sitting Posture Estimation", journal = j-TOSN, volume = "22", number = "2", pages = "11:1--11:26", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3793858", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 17 15:22:24 MDT 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Sitting posture is closely related to our health. Poor sitting posture can cause various diseases and jeopardize our health. Among the current methods for detecting sitting posture, computer vision solutions suffer from privacy leakage and wearable sensor \ldots{}", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Tan:2026:VTL, author = "Juntao Tan and Anran Li and Quanchao Liu and Peng Ran and Lan Zhang", title = "{VTarbel}: Targeted Label Attack with Minimal Knowledge on Detector-Enhanced Vertical Federated Learning", journal = j-TOSN, volume = "22", number = "2", pages = "12:1--12:33", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3790100", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 17 15:22:24 MDT 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Vertical federated learning (VFL) enables multiple parties with disjoint features to collaboratively train models without sharing raw data. While privacy vulnerabilities of VFL are extensively-studied, its security threats-particularly targeted label \ldots{}", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Gao:2026:SFG, author = "Shang Gao and Dawei Yan and Feiyu Han and Yanfei Zhang and Yubo Yan", title = "{SpeedFi}: Fine-grained Speed Estimation for Bodyweight Exercise with {WiFi}", journal = j-TOSN, volume = "22", number = "2", pages = "13:1--13:27", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3789207", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 17 15:22:24 MDT 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Exercise speed is a crucial indicator in bodyweight exercise assessment, directly reflecting muscular strength, energy expenditure, and exercise power. Benefiting from ubiquitous infrastructure and non-intrusive properties, WiFi-based sensing has emerged \ldots{}", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Liu:2026:RDN, author = "Xuxun Liu and Xinyuan Zeng and Junyu Ren and Song Yin and Huan Zhou", title = "Region-Different Network Reconfiguration in Disjoint Wireless Sensor Networks for Smart Agriculture Monitoring", journal = j-TOSN, volume = "22", number = "2", pages = "14:1--14:20", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3614430", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Tue Mar 17 15:22:24 MDT 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib", abstract = "Connectivity restoration is essential for ensuring continuous operation in wireless sensor networks (WSNs). However, existing works lack enough network robustness when suffering from the secondary external damages. In this article, we propose a novel \ldots{}", acknowledgement = ack-nhfb, articleno = "14", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", }