Sciweavers

Share
MOBIHOC
2010
ACM
8 years 9 months ago
Longest-queue-first scheduling under SINR interference model
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. ...
TMC
2010
196views more  TMC 2010»
8 years 9 months ago
Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
Mahmoud Al-Ayyoub, Himanshu Gupta
INFOCOM
2010
IEEE
8 years 10 months ago
First-Fit Scheduling for Beaconing in Multihop Wireless Networks
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
Peng-Jun Wan, Zhu Wang, Hongwei Du, Scott C.-H. Hu...
TPDS
2008
188views more  TPDS 2008»
8 years 11 months ago
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks
We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduc...
Yu Wang 0003, Weizhao Wang, Xiang-Yang Li, Wen-Zha...
CORR
2006
Springer
145views Education» more  CORR 2006»
8 years 11 months ago
Product Multicommodity Flow in Wireless Networks
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
Ritesh Madan, Devavrat Shah, Olivier Lév&ec...
IPPS
2005
IEEE
9 years 5 months ago
A Robust Interference Model for Wireless Ad-Hoc Networks
Among the foremost goals of topology control in wireless ad-hoc networks is interference reduction. This paper presents a receiver-centric interference model featuring two main ad...
Pascal von Rickenbach, Stefan Schmid, Roger Watten...
MOBICOM
2006
ACM
9 years 5 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
SECON
2007
IEEE
9 years 5 months ago
Log-normal shadowing meets SINR: A numerical study of Capacity in Wireless Networks
— The capacity of wireless multi-hop networks has been studied extensively in recent years. Most existing work tackles the problem from an asymptotic perspective and assumes a si...
Patrick Stuedi, Gustavo Alonso
INFOCOM
2007
IEEE
9 years 5 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
ICC
2008
IEEE
159views Communications» more  ICC 2008»
9 years 5 months ago
Link Scheduling and Power Control in Wireless Mesh Networks with Directional Antennas
— Directional antennas are very attractive in Wireless Mesh Networks (WMN). We study the problem of link scheduling and power control in a Time-Division Multiple Access (TDMA) WM...
Vishwanath Ramamurthi, Abu Ahmed Reaz, Sudhir S. D...
books