作者: B. K. Szymanski , G. G. Chen
关键词: Theoretical computer science 、 Artificial neuron 、 Routing protocol 、 Routing (electronic design automation) 、 Natural computing 、 Distributed algorithm 、 Broadcast communication network 、 Computer science 、 Brooks–Iyengar algorithm 、 Wireless sensor network
摘要: This article advocates a new computing paradigm, called with time, that is capable of efficiently performing certain class computation, namely, searching in parallel for the closest value to given parameter. It shares some features idea action potentials proposed by Hopfield, which originated field artificial neuron networks. The basic time captured novel distributed algorithm based on broadcast communication lecture hall algorithm, can compute minimum among n positive numbers, each residing separate processor, using only O(1) broadcasts. When applied sensor networks, leads an interesting routing protocol having several desirable properties.