In many applications the networks under consideration are geometric networks, i.e., every node has a location in some geometric (say, Euclidean) space, and the edges are represented by connections (say, straight-lines) between the nodes. In many real-world networks the geometry is an important feature that is hard to treat mathematically. Typically, connections between nearby nodes are more abundant than connections between distant nodes, yet long-range connections play a crucial role in the small-world behavior that these networks exhibit. In addition, a high variability in the degrees of the nodes is observed.
The projects related to this theme are:
Algorithms for Range- and Frequency-Assignment Problems in Wireless Networks