4233 search results - page 543 / 847 » Three Paths to Effectiveness |
192
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
215
click to vote
KIVS
2011
Springer
14 years 9 months ago
2011
Springer
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
219
click to vote
MOBICOM
2012
ACM
13 years 9 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
221
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
214
click to vote
MOBICOM
2004
ACM
16 years 4 days ago
2004
ACM
Significant progress has been made towards making ad hoc networks secure and DoS resilient. However, little attention has been focused on quantifying DoS resilience: Do ad hoc ne...