Journal of Computer and System Sciences
Communications of the ACM
Topological Characteristics of Random Multihop Wireless Networks
Cluster Computing
Models and algorithms for wireless sensor networks (smart dust)
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Introduction to amorphous computing
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Random geometric graph diameter in the unit disk with lp metric
GD'04 Proceedings of the 12th international conference on Graph Drawing
Computability in Amorphous Structures
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A universal flying amorphous computer
UC'11 Proceedings of the 10th international conference on Unconventional computation
Amorphous computing: a research agenda for the near future
Natural Computing: an international journal
Computability and non-computability issues in amorphous computing
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
We design a formal model of an amorphous computer suitable for theoretical investigation of its computational properties. The model consists of a finite set of nodes created by RAMs with restricted memory, which are dispersed uniformly in a given area. Within a limited radius the nodes can communicate with their neighbors via a single-channel radio. The assumptions on low-level communication abilities are among the weakest possible: the nodes work asynchronously, there is no broadcasting collision detection mechanism and no network addresses. For the underlying network we design a randomized communication protocol and analyze its efficiency. The subsequent experiments and combinatorial analysis of random networks show that the expectations under which our protocol was designed are met by the vast majority of the instances of our amorphous computer model.