Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Journal of Mathematical Cryptology

Managing Editor: Magliveras, Spyros S. / Steinwandt, Rainer / Trung, Tran

Editorial Board: Blackburn, Simon R. / Blundo, Carlo / Burmester, Mike / Cramer, Ronald / Dawson, Ed / Gilman, Robert / Gonzalez Vasco, Maria Isabel / Grosek, Otokar / Helleseth, Tor / Kim, Kwangjo / Koblitz, Neal / Kurosawa, Kaoru / Lauter, Kristin / Lange, Tanja / Menezes, Alfred / Nguyen, Phong Q. / Pieprzyk, Josef / Rötteler, Martin / Safavi-Naini, Rei / Shparlinski, Igor E. / Stinson, Doug / Takagi, Tsuyoshi / Williams, Hugh C. / Yung, Moti

4 Issues per year


CiteScore 2017: 1.43

SCImago Journal Rank (SJR) 2017: 0.293
Source Normalized Impact per Paper (SNIP) 2017: 1.117

Mathematical Citation Quotient (MCQ) 2017: 0.51

Online
ISSN
1862-2984
See all formats and pricing
More options …
Volume 9, Issue 4

Issues

Linear approaches to resilient aggregation in sensor networks

Kevin J. Henry / Douglas R. Stinson
Published Online: 2015-11-18 | DOI: https://doi.org/10.1515/jmc-2015-0042

Abstract

A sensor network is a network comprised of many small, wireless, resource-limited nodes that sense data about their environment and report readings to a base station. One technique to conserve power in a sensor network is to aggregate sensor readings hop-by-hop as they travel towards a base station, thereby reducing the total number of messages required to collect each sensor reading. In an adversarial setting, the ability of a malicious node to alter this aggregate total must be limited. We present three aggregation protocols inspired by three natural key pre-distribution schemes for linear networks. Assuming no more than k consecutive nodes are malicious, each of these protocols limits the capability of a malicious node to altering the aggregate total by at most a single valid sensor reading. Additionally, our protocols are able to detect malicious behavior as it occurs, allowing the protocol to be aborted early, thereby conserving energy in the remaining nodes. A rigorous proof of security is given for each protocol. We then demonstrate how to extend our linear protocols to tree-based topologies, thereby allowing linear-based approaches to be applied in a much wider range of network topologies.

Keywords: Resilient aggregation; sensor network; linear network; key pre-distribution

MSC: 94A60

About the article

Received: 2015-08-26

Revised: 2015-11-03

Accepted: 2015-11-04

Published Online: 2015-11-18

Published in Print: 2015-12-01


Funding Source: NSERC

Award identifier / Grant number: 203114-11


Citation Information: Journal of Mathematical Cryptology, Volume 9, Issue 4, Pages 245–272, ISSN (Online) 1862-2984, ISSN (Print) 1862-2976, DOI: https://doi.org/10.1515/jmc-2015-0042.

Export Citation

© 2015 by De Gruyter.Get Permission

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

[1]
Yong Lu and Na Sun
EURASIP Journal on Wireless Communications and Networking, 2018, Volume 2018, Number 1
[2]
Kaushal A. Shah and Devesh C. Jinwala
Wireless Personal Communications, 2017, Volume 95, Number 4, Page 3905

Comments (0)

Please log in or register to comment.
Log in