51 search results - page 2 / 11 » On the density of a graph and its blowup |
PERCOM
2005
ACM
14 years 5 months ago
2005
ACM
When analyzing dissemination protocols in mobile adhoc networks the underlying mobility model is an important factor because it strongly influences the performance of these protoc...
TCOM
2011
13 years 11 days ago
2011
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...
GLOBECOM
2008
IEEE
13 years 12 months ago
2008
IEEE
— The multihop spatial reuse Aloha (MSR-Aloha) protocol was recently introduced by Baccelli et al., where each transmitter selects the receiver among its feasible next hops that ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...