Sciweavers

163 search results - page 15 / 33
» How Optimal are Wireless Scheduling Protocols
Sort
View
EWSN
2009
Springer
14 years 9 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
INFOCOM
2008
IEEE
14 years 2 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
INFOCOM
2003
IEEE
14 years 1 months ago
Exploiting Multiuser Diversity for Medium Access Control in Wireless Networks
— Multiuser diversity refers to a type of diversity present across different users in a fading environment. This diversity can be exploited by scheduling transmissions so that us...
Xiangping Qin, Randall A. Berry
TMC
2012
11 years 10 months ago
E-MiLi: Energy-Minimizing Idle Listening in Wireless Networks
WiFi interface is known to be a primary energy consumer in mobile devices, and idle listening (IL) is the dominant source of energy consumption in WiFi. Most existing protocols, s...
Xinyu Zhang, Kang G. Shin
MOBICOM
2009
ACM
14 years 2 months ago
Order matters: transmission reordering in wireless networks
Modern wireless interfaces support a physical layer capability called Message in Message (MIM). Briefly, MIM allows a receiver to disengage from an ongoing reception, and engage ...
Justin Manweiler, Naveen Santhapuri, Souvik Sen, R...