the theory of random graphs is a useful mathematical tool to describe many real world systems. recently, the mathematical and engineering communities have shown a renewed interest in the geometric version of these models. the nodes are geometrically distributed at random, and pairs of nodes are connected by edges, whose presence depends on the random positions of the nodes in the plane. one emerging application is in the field of wireless communications, where radio transmitting stations communicate by radiating electromagnetic waves. in this talk, first i review several models of random networks for communication that are directly related to continuum percolation. then, i show some recent results on connectivity of dependent percolation models of interference limited networks. finally, i introduce the gupta-kumar concept of throughput scaling, and argue how this can be obtained as a natural consequence of the rsw theorem in percolation theory.