An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models

DOI10.1007/S10878-015-9908-4zbMATH Open1356.90150OpenAlexW651831536MaRDI QIDQ346485FDOQ346485

Authors: Cui Wang, Jiguo Yu, Dongxiao Yu, Baogui Huang, Shan Shan Yu 

Publication date: 29 November 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9908-4

Recommendations

• A maximum clique based approximation algorithm for wireless link scheduling under SINR model
• Distributed wireless link scheduling in the SINR model
• Wireless scheduling with power control
• Wireless Scheduling with Power Control

zbMATH Keywords

approximation algorithmwireless networkhypergraph modelshortest link schedulingSINR

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• An improved distributed data aggregation scheduling in wireless sensor networks
• The capacity of wireless networks
• A constant-factor approximation for wireless capacity maximization with power control in the SINR model
• Link scheduling in polynomial time
• Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks
• Approximate aggregation for tracking quantiles in wireless sensor networks
• A biological solution to a fundamental distributed computing problem
• Practical unicast and convergecast scheduling schemes for cognitive radio networks
• Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
• Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits
• On energy conservation for finite element approximation of flow-induced airfoil vibrations

Cited In (5)

• Distributed wireless link scheduling in the SINR model
• Hypergraph modeling and approximation algorithms for the minimum length link scheduling in multiuser MIMO networks
• SINR based maximum link scheduling in wireless mesh networks
• Graph theory and opportunistic link scheduling in wireless ad hoc networks
• A maximum clique based approximation algorithm for wireless link scheduling under SINR model

This page was built for publication: An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346485)