Skip Navigation



The Computer Journal Advance Access published online on January 8, 2008
The Computer Journal, doi:10.1093/comjnl/bxm109
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
51/4/511    most recent
bxm109v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Szymanski, B. K.
Right arrow Articles by Chen, G. G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2007. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Computing with Time: From Neural Networks to Sensor Networks

Boleslaw K. Szymanski* and Gilbert G. Chen

Department of Computer Science, Rensselaer Polytechnic Institute, 110 Eighth Street, Troy, NY 12180, USA

* Corresponding author: szymab{at}rpi.edu

Received 14 November 2007; revised 14 November 2007

This article advocates a new computing paradigm, called computing with time, that is capable of efficiently performing a certain class of computation, namely, searching in parallel for the closest value to the given parameter. It shares some features with the idea of computing with action potentials proposed by Hopfield, which originated in the field of artificial neuron networks. The basic idea of computing with time is captured in a novel distributed algorithm based on broadcast communication called the lecture hall algorithm, which can compute the minimum among n positive numbers, each residing on a separate processor, using only O(1) broadcasts. When applied to sensor networks, the lecture hall algorithm leads to an interesting routing protocol having several desirable properties.

Key Words: computing paradigm • neural network • sensor network • routing


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.