Leveraging Physical Layer Capabilites: Distributed Scheduling in Interference Networks with Local Views
arXiv:1310.6443 · doi:10.1109/TNET.2014.2365440
Abstract
In most wireless networks, nodes have only limited local information about the state of the network, which includes connectivity and channel state information. With limited local information about the network, each node's knowledge is mismatched; therefore, they must make distributed decisions. In this paper, we pose the following question - if every node has network state information only about a small neighborhood, how and when should nodes choose to transmit? While link scheduling answers the above question for point-to-point physical layers which are designed for an interference-avoidance paradigm, we look for answers in cases when interference can be embraced by advanced PHY layer design, as suggested by results in network information theory. To make progress on this challenging problem, we propose a constructive distributed algorithm that achieves rates higher than link scheduling based on interference avoidance, especially if each node knows more than one hop of network state information. We compare our new aggressive algorithm to a conservative algorithm we have presented in [1]. Both algorithms schedule sub-networks such that each sub-network can employ advanced interference-embracing coding schemes to achieve higher rates. Our innovation is in the identification, selection and scheduling of sub-networks, especially when sub-networks are larger than a single link.
arXiv comment14 pages, Submitted to IEEE/ACM Transactions on Networking, October 2013
References in corpus (6)
- Statistical mechanics of complex networks
- Topological Interference Management through Index Coding
- Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks
- On Achieving Local View Capacity Via Maximal Independent Graph Scheduling
- Sum-capacity of Interference Channels with a Local View: Impact of Distributed Decisions
- Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time