@Preamble{"\input bibnames.sty"}
@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/|"}
@String{j-TOSN = "ACM Transactions on Sensor Networks"}
@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 p
