Sciweavers

1687 search results - page 95 / 338
» On the complexity of scheduling in wireless networks
Sort
View
CDC
2009
IEEE
15 years 10 months ago
On the queue-overflow probabilities of distributed scheduling algorithms
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...
Can Zhao, Xiaojun Lin
INFOCOM
2008
IEEE
16 years 21 days ago
Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks
— In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flo...
Umut Akyol, Matthew Andrews, Piyush Gupta, John D....
WCNC
2008
IEEE
16 years 20 days ago
Proportional Fair Scheduling: Analytical Insight under Rayleigh Fading Environment
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
Erwu Liu, Kin K. Leung
COMCOM
2006
148views more  COMCOM 2006»
15 years 6 months ago
An adaptive bluetooth packet selection and scheduling scheme in interference environments
Bluetooth is a new technology for Wireless Personal Area Networks (WPANs). It intends to eliminate the need of wires and connectors between a variety of devices, like PCs and thei...
Chen-Han Shih, Kuochen Wang, Hung-Cheng Shih
PERCOM
2004
ACM
16 years 5 months ago
Peer-to-peer File-sharing over Mobile Ad hoc Networks
Current peer-to-peer file-sharing systems mostly work on wired networks. Mobile ad hoc network is characterized as multi-hop wireless communications between mobile devices. In thi...
Gang Ding, Bharat K. Bhargava