Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

M Alicherry, R Bhatia, L Li - Proceedings of the 11th annual international …, 2005 - dl.acm.org
Multi-hop infrastructure wireless mesh networks offer increased reliability, coverage and
reduced equipment costs over their single-hop counterpart, wireless LANs. Equipping …

Minimum interference channel assignment in multiradio wireless mesh networks

AP Subramanian, H Gupta, SR Das… - IEEE transactions on …, 2008 - ieeexplore.ieee.org
In this paper, we consider multihop wireless mesh networks, where each router node is
equipped with multiple radio interfaces, and multiple channels are available for …

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 …

Partially overlapped channels not considered harmful

A Mishra, V Shrivastava, S Banerjee… - Proceedings of the joint …, 2006 - dl.acm.org
Many wireless channels in different technologies are known to have partial overlap.
However, due to the interference effects among such partially overlapped channels, their …

Efficient interference-aware TDMA link scheduling for static wireless networks

W Wang, Y Wang, XY Li, WZ Song… - Proceedings of the 12th …, 2006 - dl.acm.org
We study efficient link scheduling for a multihop wireless network to maximize its throughput.
Efficient link scheduling can greatly reduce the interference effect of close-by transmissions …

A general framework for wireless spectrum auctions

S Gandhi, C Buragohain, L Cao… - 2007 2nd IEEE …, 2007 - ieeexplore.ieee.org
We propose a real-time spectrum auction framework to distribute spectrum among a large
number wireless users under interference constraints. Our approach achieves conflict-free …

The complexity of connectivity in wireless networks

T Moscibroda, R Wattenhofer - … 2006: 25th Annual Joint Conference of …, 2006 - microsoft.com
We define and study the scheduling complexity in wireless networks, which expresses the
theoretically achievable efficiency of MAC layer protocols. Given a set of communication …

Energy-efficient wake-up scheduling for data collection and aggregation

Y Wu, XY Li, YH Liu, W Lou - IEEE Transactions on parallel and …, 2009 - ieeexplore.ieee.org
A sensor in wireless sensor networks (WSNs) periodically produces data as it monitors its
vicinity. The basic operation in such a network is the systematic gathering (with or without in …

Capacity of arbitrary wireless networks

O Goussevskaia, R Wattenhofer… - IEEE INFOCOM …, 2009 - ieeexplore.ieee.org
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 …

Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network

HC Jang - arXiv preprint arXiv:1003.3569, 2010 - arxiv.org
In wireless mesh networks such as WLAN (IEEE 802.11 s) or WMAN (IEEE 802.11), each
node should help to relay packets of neighboring nodes toward gateway using multi-hop …