Wu et al., 2005 - Google Patents
Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharingWu et al., 2005
View PDF- Document ID
- 9205586187310717359
- Author
- Wu X
- Srikant R
- Publication year
- Publication venue
- Proceedings of the 44th IEEE Conference on Decision and Control
External Links
Snippet
We consider wireless networks with a special type of spectral allocation, where the only constraint is that a node cannot transmit to more than one receiver at a time and cannot receive more than one transmission at a time. We introduce a scheduling algorithm called …
- 230000001105 regulatory 0 title abstract description 15
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5695—Admission control; Resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5693—Queue scheduling in packet switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
- H04L47/24—Flow control or congestion control depending on the type of traffic, e.g. priority or quality of service [QoS]
- H04L47/2441—Flow classification
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
- H04W72/12—Dynamic Wireless traffic scheduling; Dynamically scheduled allocation on shared channel
- H04W72/1205—Schedule definition, set-up or creation
- H04W72/1221—Schedule definition, set-up or creation based on age of data to be sent
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Minimizing delay
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organizing networks, e.g. ad-hoc networks or sensor networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/30—Special provisions for routing multiclass traffic
- H04L45/302—Route determination based on requested QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/50—Queue scheduling
- H04L47/62—General aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/70—Admission control or resource allocation
- H04L47/82—Miscellaneous aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W28/00—Network traffic or resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
- H04L41/50—Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
- H04L41/5019—Ensuring SLA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing packet switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Wu et al. | Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing | |
Wu et al. | Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks | |
Bui et al. | Joint Asynchronous Congestion Control and Distributed Scheduling for Multi-Hop Wireless Networks. | |
Jaramillo et al. | Optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic | |
Jiang et al. | Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling | |
Jiang et al. | A distributed CSMA algorithm for throughput and utility maximization in wireless networks | |
Yi et al. | Stochastic network utility maximisation—a tribute to Kelly's paper published in this journal a decade ago | |
Modiano et al. | Maximizing throughput in wireless networks via gossiping | |
Eryilmaz et al. | Polynomial complexity algorithms for full utilization of multi-hop wireless networks | |
Liu et al. | Heavy-ball: A new approach to tame delay and convergence in wireless network optimization | |
Xue et al. | Delay-guaranteed cross-layer scheduling in multihop wireless networks | |
Wu et al. | Queue-length stability of maximal greedy schedules in wireless networks | |
Cheng et al. | A systematic study of maximal scheduling algorithms in multiradio multichannel wireless networks | |
Xue et al. | Cross-layer scheduling for cooperative multi-hop cognitive radio networks | |
Ghaderi et al. | Effect of access probabilities on the delay performance of Q-CSMA algorithms | |
Yang et al. | Achieving Delay Guarantees in Ad Hoc Networks through Dynamic Contention Window Adaptation. | |
Xue et al. | Distributed utility-optimal scheduling with finite buffers | |
Ghaderi et al. | Connection-level scheduling in wireless networks using only MAC-layer information | |
Bui et al. | Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling | |
Hsieh et al. | A decentralized medium access protocol for real-time wireless ad hoc networks with unreliable transmissions | |
Bui et al. | Optimal resource allocation for multicast flows in multihop wireless networks | |
Xue et al. | On reducing delay and temporal starvation of queue-length-based CSMA algorithms | |
Banirazi et al. | Minimum delay in class of throughput-optimal control policies on wireless networks | |
Li et al. | Exploring the throughput boundaries of randomized schedulers in wireless networks | |
Jiang et al. | A distributed algorithm for optimal throughput and fairness in wireless networks with a general interference model |