\input zb-basic \input zb-ioport \iteman{io-port 05700335} \itemau{M\"uller, T.; Sereni, J.-S.} \itemti{Identifying and locating-dominating codes in (random) geometric networks.} \itemso{Comb. Probab. Comput. 18, No. 6, 925-952 (2009).} \itemab Summary: We model a problem about networks built from wireless devices using identifying and locating-dominating codes in unit disk graphs. It is known that minimizing the size of an identifying code is $\cal{NP}$-complete even for bipartite graphs. First, we improve this result by showing that the problem remains $\cal{NP}$-complete for bipartite planar unit disk graphs. Then, we address the question of the existence of an identifying code for random unit disk graphs. We derive the probability that there exists an identifying code as a function of the radius of the disks, and we find that for all interesting ranges of $r$ this probability is bounded away from one. The results obtained are in sharp contrast to those concerning random graphs in the Erd\H os-R\'enyi model. Another well-studied class of codes is that of locating-dominating codes, which are less demanding than identifying codes. A locating-dominating code always exists, but minimizing its size is still $\cal {NP}$-complete in general. We extend this result to our setting by showing that this question remains $\cal{NP}$-complete for arbitrary planar unit disk graphs. Finally, we study the minimum size of such a code in random unit disk graphs, and we prove that with probability tending to one, it is of size $(n/r)^{2/3+o(1)}$ if $r \leqslant \sqrt 2/2-\varepsilon$ is chosen such that $nr^2 \to \infty$, and of size $n^{1+o(1)}$ if $nr^2 \ll \ln n$. \itemrv{~} \itemcc{} \itemut{} \itemli{doi:10.1017/S0963548309990344} \end