On the arrival theorem for communication networks
β Scribed by Nico M van Dijk
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 563 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0169-7552
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Among the large number of contributions concerning the localization techniques for wireless sensor networks (WSNs), there is still no simple, energy and cost efficient solution suitable in outdoor scenarios. In this paper, a technique based on antenna arrays and angle-ofarrival (AoA) measurements is
We do not mean to denigrate the efforts to produce a general-purpose parallel machine. Machines that can realize any communication pattern are of course desirable, and necessary for those cases when the communication needs of a program cannot be predicted in advance. A wide variety of such general-p
In a communication network it is desirable that all pairs of nodes can exchange messages at the same time. But under the capacity constraints on nodes or links this desired property may not be satisfied; only some node pairs can communicate with each other while the rest have to be blocked. A natura