Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
The scheduling and energy complexity of strong connectivity in ultra-wideband networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Backbone construction in selfish wireless networks
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Results on coverage for finite wireless networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
FireFly: a cross-layer platform for real-time embedded wireless networks
Real-Time Systems
On the complexity of bandwidth allocation in radio networks
Theoretical Computer Science
A measurement study of interference modeling and scheduling in low-power wireless networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
A refined performance characterization of longest-queue-first policy in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Improved Algorithms for Latency Minimization in Wireless Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
On Distance-3 Matchings and Induced Matchings
Graph Theory, Computational Intelligence and Thought
Data Collection with Multiple Sinks in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
IEEE/ACM Transactions on Networking (TON)
Energy-optimal distributed algorithms for minimum spanning trees
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Online capacity maximization in wireless networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Delay analysis for wireless networks with single hop traffic and general interference constraints
IEEE/ACM Transactions on Networking (TON)
Results on finite wireless networks on a line
IEEE Transactions on Communications
Utility based channel assignment mechanism for multi radio mesh networks
Proceedings of the 8th ACM international workshop on Mobility management and wireless access
Joint congestion control and distributed scheduling for throughput guarantees in wireless networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Induced matchings in subcubic planar graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Randomized algorithms for cross-layer network control
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
On distance-3 matchings and induced matchings
Discrete Applied Mathematics
On the complexity of scheduling in wireless networks
EURASIP Journal on Wireless Communications and Networking - Special issue on adaptive cross-layer strategies for fourth generation wireless communications
Delay analysis and optimality of scheduling policies for multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Improved algorithms for latency minimization in wireless networks
Theoretical Computer Science
Approximation algorithms for secondary spectrum auctions
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Radio network distributed algorithms in the unknown neighborhood model
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
On complexity of wireless gathering problems on unit-disk graphs
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
A refined performance characterization of longest-queue-first policy in wireless networks
IEEE/ACM Transactions on Networking (TON)
Scheduling links for heavy traffic on interfering routes in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximate distance queries in disk graphs
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Low-complexity scheduling for wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
IEEE/ACM Transactions on Networking (TON)
Local heuristic for the refinement of multi-path routing in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Online capacity maximization in wireless networks
Journal of Scheduling
Results on finite wireless sensor networks: Connectivity and coverage
ACM Transactions on Sensor Networks (TOSN)
Deflating link buffers in a wireless mesh network
Ad Hoc Networks
| Hi-index | 0.07 |
We consider the problem of determining the maximum capacity of the media access (MAC) layer in wireless ad hoc networks. Due to spatial contention for the shared wireless medium, not all nodes can concurrently transmit packets to each other in these networks. The maximum number of possible concurrent transmissions is, therefore, an estimate of the maximum network capacity, and depends on the MAC protocol being used. We show that for a large class of MAC protocols based on virtual carrier sensing using RTS/CTS messages, which includes the popular IEEE 802.11 standard, this problem may be modeled as a maximum Distance-2 matching ( D2EMIS) in the underlying wireless network: Given a graph G(V,E), find a set of edges E'⊆E such that no two edges in E' are connected by another edge in E. D2EMIS is NP-complete. Our primary goal is to show that it can be approximated efficiently in networks that arise in practice. We do this by focusing on an admittedly simplistic, yet natural, graph-theoretic model for ad hoc wireless networks based on disk graphs, where a node can reach all other nodes within some distance (nodes may have unequal reach distances). We show that our approximation yields good capacity bounds. Our work is the first attempt at characterizing an important "maximum" measure of wireless network capacity, and can be used to shed light on previous topology formation protocols like Span and GAF that attempt to produce "good" or "capacity-preserving" topologies, while allowing nodes to alternate between sleep and awake states. Our work shows an efficient way to compute an upper bound on maximum wireless network capacity, thereby allowing topology formation algorithms to determine how close they are to optimal. We also outline a distributed algorithm for the problem for unit disk graphs, and briefly discuss extensions of our results to: 1) different node interference models; 2) directional antennas; and 3) other transceiver connectivity structures besides disk graphs.