1687 search results - page 179 / 338 » On the complexity of scheduling in wireless networks |
173
click to vote
SOFSEM
2007
Springer
16 years 17 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
172
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
191
click to vote
WIOPT
2005
IEEE
16 years 1 days ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
205
click to vote
CNSR
2005
IEEE
15 years 8 months ago
2005
IEEE
The dramatic increase in the number of mobile subscribers has put a significant resource and service provisioning strain on current cellular networks in particular in terms of mu...
174
click to vote
WISEC
2010
ACM
16 years 1 months ago
2010
ACM
Determining whether a client station should trust an access point is a known problem in wireless security. Traditional approaches to solving this problem resort to cryptography. B...