Sciweavers

1193 search results - page 211 / 239
» A primer of simple theories
Sort
View
ICFP
2003
ACM
15 years 11 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
MOBIHOC
2008
ACM
15 years 11 months ago
Routing performance analysis of human-driven delay tolerant networks using the truncated levy walk model
The routing performance of delay tolerant networks (DTN) is highly correlated with the distribution of inter-contact times (ICT), the time period between two successive contacts o...
Seongik Hong, Injong Rhee, Seong Joon Kim, Kyungha...
MOBIHOC
2007
ACM
15 years 11 months ago
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...
Michele Garetto, Paolo Giaccone, Emilio Leonardi
MOBIHOC
2005
ACM
15 years 11 months ago
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
Rajagopal Iyengar, Koushik Kar, Suman Banerjee
MOBIHOC
2004
ACM
15 years 11 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...