We consider a cache-aided wireless device-to-device (D2D) network under the
constraint of \emph{one-shot delivery}, where the placement phase is
orchestrated by a central server. We assume that the devices' caches are filled
with uncoded data, and the whole file database at the server is made available
in the collection of caches. Following this phase, the files requested by the
users are serviced by inter-device multicast communication. For such a system
setting, we provide the exact characterization of load-memory trade-off, by
deriving both the minimum average and the minimum peak sum-loads of links
between devices, for a given individual memory size at disposal of each user.
Capitalizing on the one-shot delivery property, we also propose an extension of
the presented scheme that provides robustness against random user inactivity.