Download now Free registration required
Connectivity is one of the most fundamental properties of wireless multi-hop networks. A network is said to be connected if there is a path between any pair of nodes. Extensive research has been done on connectivity problems using the well-known random geometric graph and the unit disk connection model, which is usually obtained by randomly and uniformly distributing n vertices in a given area and connecting any two vertices iff (if and only if) their Euclidean distance is smaller than or equal to a given threshold r(n).
- Format: PDF
- Size: 311.23 KB