Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Effects of ad hoc layer medium access mechanisms under TCP
Mobile Networks and Applications
Characterizing the interaction between routing and MAC protocols in ad-hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Energy, congestion and dilation in radio networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Using directional antennas for medium access control in ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
On the maximum stable throughput problem in random networks with directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
On the capacity improvement of ad hoc wireless networks using directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Proceedings of the 9th annual international conference on Mobile computing and networking
Throughput capacity of random ad hoc networks with infrastructure support
Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Rate Performance Objectives of Multihop Wireless Networks
IEEE Transactions on Mobile Computing
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Proceedings of the 11th annual international conference on Mobile computing and networking
Partially overlapped channels not considered harmful
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
The worst-case capacity of wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
A general model of wireless interference
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A measurement-based approach to modeling link capacity in 802.11-based wireless networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Benefits and limitations of spatial reuse in wireless mesh networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Towards real-time dynamic spectrum auctions
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM SIGMOBILE Mobile Computing and Communications Review
An efficient centralized scheduling algorithm for IEEE 802.16 multi-radio mesh networks
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Hidden information and actions in multi-hop wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Understanding congestion control in multi-hop wireless mesh networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
Optimal routing for wireless mesh networks with dynamic traffic demand
Mobile Networks and Applications
Capacity bounds of deployment concepts for Wireless Mesh Networks
Performance Evaluation
Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
A novel approach to fair routing in wireless mesh networks
EURASIP Journal on Wireless Communications and Networking - Special issue on fairness in radio resource management for wireless networks
Wireless Communication Is in APX
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Data Collection with Multiple Sinks in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
The achievable rate region of 802.11-scheduled multihop networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Optimized multipath network coding in lossy wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Augmenting predictive with oblivious routing for wireless mesh networks under traffic uncertainty
Computer Networks: The International Journal of Computer and Telecommunications Networking
Power-efficient radio configuration in fixed broadband wireless networks
Computer Communications
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
A simple greedy algorithm for link scheduling with the physical interference model
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Capacity region of a wireless mesh backhaul network over the CSMA/CA MAC
INFOCOM'10 Proceedings of the 29th conference on Information communications
Simple yet efficient, transparent airtime allocation for TCP in wireless mesh networks
Proceedings of the 6th International COnference
Self-stabilizing algorithm of two-hop conflict resolution
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
Providing survivability against jamming attack for multi-radio multi-channel wireless mesh networks
Journal of Network and Computer Applications
Flow admission control for multi-channel multi-radio wireless networks
Wireless Networks
Minimizing flow time in the wireless gathering problem
ACM Transactions on Algorithms (TALG)
Channel, capacity, and flow assignment in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Framework for optimizing the capacity of wireless mesh networks
Computer Communications
Capacity of wireless networks under SINR interference constraints
Wireless Networks
Power control methods for improving spatial reuse in TDMA-based wireless mesh networks
ISRN Communications and Networking
Upperbounding end-to-end throughput of multihop wireless networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Real-Time video streaming in multi-hop wireless static ad hoc networks
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Randomized algorithms and probabilistic analysis in wireless networking
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Improved throughput bounds for interference-aware routing inwireless networks
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Cell-based snapshot and continuous data collection in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 8th International Conference on Network and Service Management
A novel scheduling algorithm for densely-deployed wireless stations in urban areas
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Computers and Electrical Engineering
Hi-index | 0.01 |
This paper considers two inter-related questions: (i) Given a wireless ad-hoc network and a collection of source-destination pairs {(si,ti)}, what is the maximum throughput capacity of the network, i.e. the rate at which data from the sources to their corresponding destinations can be transferred in the network? (ii) Can network protocols be designed that jointly route the packets and schedule transmissions at rates close to the maximum throughput capacity? Much of the earlier work focused on random instances and proved analytical lower and upper bounds on the maximum throughput capacity. Here, in contrast, we consider arbitrary wireless networks. Further, we study the algorithmic aspects of the above questions: the goal is to design provably good algorithms for arbitrary instances. We develop analytical performance evaluation models and distributed algorithms for routing and scheduling which incorporate fairness, energy and dilation (path-length) requirements and provide a unified framework for utilizing the network close to its maximum throughput capacity.Motivated by certain popular wireless protocols used in practice, we also explore "shortest-path like" path selection strategies which maximize the network throughput. The theoretical results naturally suggest an interesting class of congestion aware link metrics which can be directly plugged into several existing routing protocols such as AODV, DSR, etc. We complement the theoretical analysis with extensive simulations. The results indicate that routes obtained using our congestion aware link metrics consistently yield higher throughput than hop-count based shortest path metrics.