1687 search results - page 229 / 338 » On the complexity of scheduling in wireless networks |
150
click to vote
ICNS
2007
IEEE
16 years 22 days ago
2007
IEEE
— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...
187
click to vote
INFOCOM
2007
IEEE
16 years 21 days ago
2007
IEEE
— The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switc...
196
click to vote
MOBILIGHT
2010
15 years 1 months ago
2010
Node capture is considered as one of the most critical issues in the security of wireless sensor networks. A popular approach to thwart the problem relies on the detection of event...
172
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
177
click to vote
IMC
2007
ACM
15 years 8 months ago
2007
ACM
The interference map of an 802.11 network is a collection of data structures that can help heuristics for routing, channel assignment and call admission in dense wireless networks...