150 search results - page 12 / 30 » Improved Throughput Bounds for Interference-Aware Routing in... |
EJWCN
2010
13 years 2 months ago
2010
This paper addresses mobility control routing in wireless networks. Given a data flow request between a sourcedestination pair, the problem is to move nodes towards the best placem...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—We present the first unified modeling framework for the computation of the throughput capacity of random wireless ad hoc networks in which information is disseminated by means...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In sensor networks, both energy and bandwidth are scarce resources. In the past, many energy efficient routing algorithms have been devised in order to maximize network lifetim...