Sciweavers

1687 search results - page 149 / 338
» On the complexity of scheduling in wireless networks
Sort
View
GLOBECOM
2009
IEEE
15 years 4 months ago
Efficient Data Collection for Wireless Networks: Delay and Energy Tradeoffs
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
Chao Ren, XuFei Mao, Xiang-Yang Li, Ping Xu, Guoju...
INFOCOM
2006
IEEE
16 years 13 days ago
A Packing Approach to Compare Slotted and Non-Slotted Medium Access Control
— In multi-hop ad hoc networks, the efficiency of a medium access control protocol under heavy traffic load depends mainly on its ability to schedule a large number of simultan...
Mathilde Durvy, Patrick Thiran
COMSNETS
2012
205views more  COMSNETS 2012»
14 years 2 months ago
RODEO: Robust and rapidly deployable TDM mesh with QoS differentiation
Abstract—We present RODEO, a RObust and rapidly DEplOyable wireless mesh network designed for applications such as disaster management. Natural disasters often destroy existing c...
Aniesh Chawla, Vinay Yadav, Vasu Dev Sharma, Jitin...
CISS
2008
IEEE
16 years 26 days ago
Revisiting the optimal scheduling problem
— In this paper, we revisit the problem of determining the minimum-length schedule that satisfies certain traffic demands in a wireless network. Traditional approaches for the ...
Sastry Kompella, Jeffrey E. Wieselthier, Anthony E...
GLOBECOM
2008
IEEE
16 years 26 days ago
Failure Rate Minimization with Multiple Function Unit Scheduling for Heterogeneous WSNs
— Failure-Rate Minimization is becoming one of the major design issues in wireless sensor network (WSN) architecture due to multiple available Functional-units (FUs). There is a ...
Meikang Qiu, Jing Deng, Edwin Hsing-Mean Sha