The intersection graphs of random sets
Discrete Mathematics
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Irrigating ad hoc networks in constant time
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On optimality of key pre-distribution schemes for distributed sensor networks
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
On the connectivity of bluetooth-based ad hoc networks
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
We show that some topologies arising naturally in the context of wireless networking are low-degree, expander graphs.