2092 search results - page 163 / 419 » A Theory of Non-Deterministic Networks |
104
click to vote
MOBIHOC
2006
ACM
15 years 12 months ago
2006
ACM
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
MOBIHOC
2003
ACM
15 years 12 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
91
Voted
IPSN
2009
Springer
15 years 7 months ago
2009
Springer
As the diversity of sensornet use cases increases, the combinations of environments and applications that will coexist will make custom engineering increasingly impractical. We in...
87
Voted
IMC
2009
ACM
15 years 6 months ago
2009
ACM
Packet sampling techniques introduce measurement errors that should be carefully handled in order to correctly characterize the network behavior. In the literature several works h...
ICNP
1998
IEEE
15 years 4 months ago
1998
IEEE
We develop a theory for deciding, for any routing metric and any network, whether the messages in this network can be routed along paths whose metric values are maximum. In order ...