FlashLinQ: A synchronous distributed scheduler for peer-to-peer ad hoc networks

X Wu, S Tavildar, S Shakkottai… - IEEE/ACM …, 2013 - ieeexplore.ieee.org
This paper proposes FlashLinQ-a synchronous peer-to-peer wireless PHY/MAC network
architecture. FlashLinQ leverages the fine-grained parallel channel access offered by OFDM …

A distributed CSMA algorithm for throughput and utility maximization in wireless networks

L Jiang, J Walrand - IEEE/ACM Transactions on Networking, 2009 - ieeexplore.ieee.org
In multihop wireless networks, designing distributed scheduling algorithms to achieve the
maximal throughput is a challenging problem because of the complex interference …

On combining shortest-path and back-pressure routing over multihop wireless networks

L Ying, S Shakkottai, A Reddy… - IEEE/ACM Transactions …, 2010 - ieeexplore.ieee.org
Back-pressure-type algorithms based on the algorithm by Tassiulas and Ephremides have
recently received much attention for jointly routing and scheduling over multihop wireless …

Understanding the capacity region of the greedy maximal scheduling algorithm in multihop wireless networks

C Joo, X Lin, NB Shroff - IEEE/ACM transactions on networking, 2009 - ieeexplore.ieee.org
In this paper, we characterize the performance of an important class of scheduling schemes,
called greedy maximal scheduling (GMS), for multihop wireless networks. While a lower …

Network adiabatic theorem: An efficient randomized protocol for contention resolution

S Rajagopalan, D Shah, J Shin - Proceedings of the eleventh …, 2009 - dl.acm.org
The popularity of Aloha-like algorithms for resolution of contention between multiple entities
accessing common resources is due to their extreme simplicity and distributed nature …

Control of wireless networks with rechargeable batteries [transactions papers]

M Gatzianas, L Georgiadis… - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
We consider the problem of cross-layer resource allocation for wireless networks operating
with rechargeable batteries under general arrival, channel state and recharge processes …

Low-complexity distributed scheduling algorithms for wireless networks

A Gupta, X Lin, R Srikant - IEEE/ACM Transactions on …, 2009 - ieeexplore.ieee.org
We consider the problem of designing distributed scheduling algorithms for wireless
networks. We present two algorithms, both of which achieve throughput arbitrarily close to …

Adaptive network coding and scheduling for maximizing throughput in wireless networks

P Chaporkar, A Proutiere - Proceedings of the 13th annual ACM …, 2007 - dl.acm.org
Recently, network coding emerged as a promising technology that can provide significant
improvements in throughput and energy efficiency of wireless networks, even for unicast …

Performance of random access scheduling schemes in multi-hop wireless networks

C Joo, NB Shroff - IEEE/ACM Transactions on Networking, 2009 - ieeexplore.ieee.org
The scheduling problem in multi-hop wireless networks has been extensively investigated.
Although throughput optimal scheduling solutions have been developed in the literature …

Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks

X Lin, SB Rasool - IEEE Transactions on Automatic Control, 2009 - ieeexplore.ieee.org
We propose a new class of distributed scheduling policies for ad hoc wireless networks that
can achieve provable capacity regions. Previously known scheduling policies that …