Parallel symmetry-breaking in sparse graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Fast distributed graph coloring with O(&Dgr;) colors
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
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
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Some simple distributed algorithms for sparse networks
Distributed Computing
Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the 11th annual international conference on Mobile computing and networking
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Graphs and Hypergraphs
The capacity of wireless networks
IEEE Transactions on Information Theory
Multicast capacity for large scale wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Allocating dynamic time-spectrum blocks in cognitive radio networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Modeling and computing throughput capacity of wireless multihop networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed and cooperative link scheduling for large-scale multihop wireless networks
EURASIP Journal on Wireless Communications and Networking
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
An adaptive, high performance mac for long-distance multihop wireless networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
Gateway placement for throughput optimization in wireless mesh networks
Mobile Networks and Applications
Interface assignment and bandwidth allocation for multi-channel wireless mesh networks
Computer Communications
A measurement study of interference modeling and scheduling in low-power wireless networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
Distributed Latency-Energy Minimization and interference avoidance in TDMA Wireless Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
How to correctly use the protocol interference model for multi-hop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Multicast capacity of wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Scheduling partition for order optimal capacity in large-scale wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
3-approximation algorithm for joint routing and link scheduling in wireless relay networks
IEEE Transactions on Wireless Communications
Low complexity stable link scheduling for maximizing throughput in wireless networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
SI-CCMAC: sender initiating concurrent cooperative MAC for wireless LANs
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Rematch: a highly reliable scheduling algorithm on heterogeneous wireless mesh network
The Journal of Supercomputing
Efficient data aggregation in multi-hop WSNs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Localized scheduling for practical and optimal capacity utilization in large wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A simple greedy algorithm for link scheduling with the physical interference model
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Level the buffer wall: Fair channel assignment in wireless sensor networks
Computer Communications
Distributed coordination with deaf neighbors: efficient medium access for 60 GHz mesh networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
On the complexity of system throughput derivation for static 802.11 networks
IEEE Communications Letters
Fast algorithms for joint power control and scheduling in wireless networks
IEEE Transactions on Wireless Communications
Self-stabilizing algorithm of two-hop conflict resolution
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Approximation algorithms for wireless link scheduling with SINR-based interference
IEEE/ACM Transactions on Networking (TON)
Scheduling prioritized services in multihop OFDMA networks
IEEE/ACM Transactions on Networking (TON)
Flow admission control for multi-channel multi-radio wireless networks
Wireless Networks
Fast-converging scheduling and routing algorithms for WiMAX mesh networks
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Link scheduling in wireless networks with successive interference cancellation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Power control methods for improving spatial reuse in TDMA-based wireless mesh networks
ISRN Communications and Networking
Scheduling links for heavy traffic on interfering routes in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient scheduling for periodic aggregation queries in multihop sensor networks
IEEE/ACM Transactions on Networking (TON)
Online reconfiguration of channel assignment in Multi-Channel Multi-Radio wireless mesh networks
Computer Communications
Many-to-one communication protocol for wireless sensor networks
International Journal of Sensor Networks
A backoff differentiation scheme for contention resolution in wireless converge-cast networks
Concurrency and Computation: Practice & Experience
Local heuristic for the refinement of multi-path routing in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Adaptive instantiation of the protocol interference model in wireless networked sensing and control
ACM Transactions on Sensor Networks (TOSN)
Degree-based link scheduling for collision avoidance in distributed wireless sensor networks
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
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. Unlike the previous studies that often assume a unit disk graph model, we assume that different terminals could have different transmission ranges and different interference ranges. In our model, it is also possible that a communication link may not exist due to barriers or is not used by a predetermined routing protocol, while the transmission of a node always result interference to all non-intended receivers within its interference range. Using a mathematical formulation, we develop synchronized TDMA link schedulings that optimize the networking throughput. Specifically, by assuming known link capacities and link traffic loads, we study link scheduling under the RTS/CTS interference model and the protocol interference model with fixed transmission power. For both models, we present both efficient centralized and distributed algorithms that use time slots within a constant factor of the optimum. We also present efficient distributed algorithms whose performances are still comparable with optimum, but with much less communications. Our theoretical results are corroborated by extensive simulation studies.