1687 search results - page 56 / 338 » On the complexity of scheduling in wireless networks |
190
click to vote
COMSUR
2011
14 years 6 months ago
2011
Abstract—We provide an overview of link scheduling algorithms in Spatial Time Division Access (STDMA) wireless mesh networks. These algorithms can be classified into three categ...
166
click to vote
CN
2010
15 years 6 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
179
click to vote
VTC
2007
IEEE
16 years 12 days ago
2007
IEEE
Abstract— A crucial issue in deploying wireless sensor networks is to perform a sensing task in an area of interest in an energy-efficient manner since sensor nodes have limited...
174
click to vote
INFOCOM
2009
IEEE
16 years 23 days ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
187
click to vote
WASA
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. This paper is motivated by exploring the impact of the number of channels on the achievable communication latency for a specific communication task. We focus on how to u...