11371 search results - page 267 / 2275 » The network inhibition problem |
156
click to vote
WOWMOM
2006
ACM
16 years 20 days ago
2006
ACM
RTS-CTS handshake based protocols achieve “reliable unicast” by eliminating the hidden node problem effectively, however, these solutions are not directly or efficiently gene...
170
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
178
click to vote
DISOPT
2008
15 years 6 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
210
click to vote
EOR
2007
15 years 6 months ago
2007
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
143
click to vote
WINET
2008
15 years 6 months ago
2008
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...