Sciweavers

177 search results - page 34 / 36
» Stackelberg Routing in Arbitrary Networks
Sort
View
IPSN
2009
Springer
15 years 7 months ago
Distributed resource management and matching in sensor networks
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
83
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
TC
2010
14 years 11 months ago
Multicasting in Quantum Switching Networks
—In this paper, we present a quantum multicasting network, called a generalized quantum connector (n-GQC), which can be used to multicast quantum information from n inputs to n o...
Manish Kumar Shukla, A. Yavuz Oruç
SPAA
2004
ACM
15 years 5 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
SPAA
2005
ACM
15 years 6 months ago
Constant density spanners for wireless ad-hoc networks
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
Kishore Kothapalli, Christian Scheideler, Melih On...