Sciweavers

75 search results - page 10 / 15
» Longest-queue-first scheduling under SINR interference model
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
WIOPT
2006
IEEE
14 years 3 months ago
Analytical modeling of ad hoc networks that utilize space-time coding
— This paper presents the first analytical model for ad hoc networks equipped with multiple-input multiple-output (MIMO) radios using space-time coding (STC) that considers the ...
Marcelo M. Carvalho, J. J. Garcia-Luna-Aceves
IWCMC
2006
ACM
14 years 3 months ago
Performance analysis of epidemic routing under contention
Epidemic routing has been proposed as a robust transmission scheme for sparse mobile ad hoc networks. Under the assumption of no contention, epidemic routing has the minimum end-t...
Apoorva Jindal, Konstantinos Psounis
ICC
2007
IEEE
122views Communications» more  ICC 2007»
14 years 4 months ago
Dynamic Programming for Scheduling a Single Route in Wireless Networks
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
Gyouhwan Kim, Rohit Negi
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
14 years 2 months ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff