[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Joo, 2012 - Google Patents

On random access scheduling for multimedia traffic in multihop wireless networks with fading channels

Joo, 2012

View PDF
Document ID
15472764896252207333
Author
Joo C
Publication year
Publication venue
IEEE transactions on mobile computing

External Links

Snippet

In this paper, we develop distributed random access scheduling schemes that exploit the time-varying nature of fading channels for multimedia traffic in multihop wireless networks. It should be noted that while centralized scheduling solutions can achieve optimal throughput …
Continue reading at scholar.archive.org (PDF) (other versions)

Classifications

    • 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
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/26—Monitoring arrangements; Testing arrangements
    • H04L12/2602—Monitoring arrangements
    • 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
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • H04W72/04—Wireless resource allocation
    • 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
    • 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
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • 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
    • 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
    • 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
    • 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
    • H04L43/00—Arrangements for monitoring or testing packet switching networks
    • H04L43/08—Monitoring based on specific metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W28/00—Network traffic or resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • 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
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W4/00—Mobile application services or facilities specially adapted for wireless communication networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications

Similar Documents

Publication Publication Date Title
Ni et al. Q-CSMA: Queue-length-based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks
Jiang et al. Distributed random access algorithm: scheduling and congestion control
Joo et al. Local greedy approximation for scheduling in multihop wireless networks
Shi et al. Analytical models for understanding space, backoff, and flow correlation in CSMA wireless networks
Joo et al. Distributed greedy approximation to maximum weighted independent set for scheduling with fading channels
Kasana et al. Fuzzy-based channel selection for location oriented services in multichannel VCPS environments
Manfredi et al. Understanding stateful vs stateless communication strategies for ad hoc networks
Joo et al. Greedy maximal matching: Performance limits for arbitrary network graphs under the node-exclusive interference model
Ali et al. Modeling of coupled collision and congestion in finite source wireless access systems
Cheng et al. A systematic study of maximal scheduling algorithms in multiradio multichannel wireless networks
Joo On random access scheduling for multimedia traffic in multihop wireless networks with fading channels
Deng et al. Online routing and scheduling with capacity redundancy for timely delivery guarantees in multihop networks
Joo et al. Performance limits of greedy maximal matching in multi-hop wireless networks
Gupta et al. Towards throughput and delay optimal routing for wireless ad-hoc networks
Zhao et al. Delay-aware backpressure routing using graph neural networks
Zhou et al. A scalable delay based analytical framework for CSMA/CA wireless mesh networks
Rezgui et al. Distributed admission control in wireless mesh networks: Models, algorithms, and evaluation
Park et al. A learning-based distributed algorithm for scheduling in multi-hop wireless networks
Roy et al. Fairness in message delivery in delay tolerant networks
Chuan et al. Optimizing content placement and delivery in wireless distributed cache systems through belief propagation
Liang et al. Packet prioritization in multihop latency aware scheduling for delay constrained communication
Tang et al. An analytical performance model considering access strategy of an opportunistic spectrum sharing system
Liu et al. Distributed queue length based algorithms for optimal end-to-end throughput allocation and stability in multi-hop random access networks
Hamid et al. Fair data collection in wireless sensor networks: analysis and protocol
Islam et al. EFT: a high throughput routing metric for IEEE 802.11 s wireless mesh networks