254 search results - page 21 / 51 » A wireless fair scheduling algorithm for error-prone wireles... |
MOBIHOC
2003
ACM
14 years 1 months ago
2003
ACM
In scenarios where wireless ad hoc networks are deployed, sometimes it would be desirable that ad hoc nodes can communicate with servers in wired networks to upload or download da...
MOBIHOC
2002
ACM
14 years 8 months ago
2002
ACM
Due to hidden terminals and a dynamic topology, contention among stations in an ad-hoc network is not homogeneous. Some stations are at a disadvantage in opportunity of access to ...
WASA
2009
Springer
14 years 3 months 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...
INFOCOM
2011
IEEE
13 years 1 days ago
2011
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM-based) wireless downlink systems. We show that the Server-Side Greedy (SSG) rul...
ICCCN
2008
IEEE
14 years 3 months ago
2008
IEEE
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...