Sciweavers

1687 search results - page 166 / 338
» On the complexity of scheduling in wireless networks
Sort
View
INFOCOM
2011
IEEE
14 years 9 months ago
Connectivity maintenance in mobile wireless networks via constrained mobility
—We explore distributed mechanisms for maintaining the physical layer connectivity of a mobile wireless network while still permitting significant area coverage. Moreover, we re...
Joshua Reich, Vishal Misra, Dan Rubenstein, Gil Zu...
OL
2011
277views Neural Networks» more  OL 2011»
15 years 1 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
AAAI
2004
15 years 7 months ago
Towards Autonomic Computing: Adaptive Job Routing and Scheduling
Computer systems are rapidly becoming so complex that maintaining them with human support staffs will be prohibitively expensive and inefficient. In response, visionaries have beg...
Shimon Whiteson, Peter Stone
DC
2008
15 years 6 months ago
Contention-free MAC protocols for asynchronous wireless sensor networks
A MAC protocol specifies how nodes in a sensor network access a shared communication channel. Desired properties of a MAC protocol are: it should be contention-free (avoid collisio...
Costas Busch, Malik Magdon-Ismail, Fikret Sivrikay...
TCOM
2010
115views more  TCOM 2010»
15 years 4 months ago
QoS Analysis of a Scheduling Policy for Heterogeneous Users Employing AMC Jointly with ARQ
—This paper analyzes the quality of service (QoS) of scheduling algorithms for heterogeneous users in multiuser (MU) wireless systems that take advantage from a crosslayer design...
Mario Poggioni, Luca Rugini, Paolo Banelli