Sciweavers

176 search results - page 31 / 36
» Prioritized Maximal Scheduling in Wireless Networks
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 7 months ago
Multistage Relaying Using Interference Networks
Wireless networks with multiple nodes that relay information from a source to a destination are expected to be deployed in many applications. In this work, we consider multihoppin...
Bama Muthuramalingam, Srikrishna Bhashyam, Andrew ...
MOBISYS
2011
ACM
12 years 10 months ago
Opportunistic alignment of advertisement delivery with cellular basestation overloads
This paper is motivated by two observations: (1) cellular network operators are actively exploring advertisement delivery as a new means of revenue generation, and (2) cellular ba...
Ravi Kokku, Rajesh Mahindra, Sampath Rangarajan, H...
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 7 months ago
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
Libin Jiang, Jean C. Walrand
INFOCOM
2011
IEEE
12 years 11 months ago
Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
Michael J. Neely, Leana Golubchik
PERCOM
2008
ACM
14 years 1 months ago
TIGRA: Timely Sensor Data Collection Using Distributed Graph Coloring
In this paper we present a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the probl...
Lilia Paradis, Qi Han