Sciweavers

182 search results - page 35 / 37
» Turing's Analysis of Computation and Theories of Cognitive A...
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
MOBIHOC
2008
ACM
14 years 7 months ago
Toward stochastic anatomy of inter-meeting time distribution under general mobility models
Recent discovery of the mixture (power-law and exponential) behavior of inter-meeting time distribution of mobile nodes presents new challenge to the problem of mobility modeling ...
Han Cai, Do Young Eun
MOBIHOC
2005
ACM
14 years 7 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
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 21 days ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
MOBICOM
2003
ACM
14 years 17 days ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano