Sciweavers

1687 search results - page 30 / 338
» On the complexity of scheduling in wireless networks
Sort
View
76
Voted
INFOCOM
2000
IEEE
15 years 1 months ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste
WSNA
2003
ACM
15 years 2 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
FSTTCS
2004
Springer
15 years 2 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
MOBIHOC
2008
ACM
15 years 9 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
ICC
2007
IEEE
123views Communications» more  ICC 2007»
15 years 3 months ago
Quality of Service in Wireless Network Diversity Multiple Access Protocols Based on a Virtual Time-Slot Allocation
— In this paper, we propose a new resource allocation mechanism which is designed to improve the multiuser detection of wireless network diversity multiple access (NDMA) protocol...
Ramiro Samano-Robles, Mounir Ghogho, Desmond C. Mc...