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

DOI10.1007/s10878-015-9908-4zbMath1356.90150OpenAlexW651831536MaRDI QIDQ346485

Cui Wang, Shanshan Yu, Dongxiao Yu, Baogui Huang, Jiguo 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

zbMATH Keywords

approximation algorithmwireless networkhypergraph modelshortest link schedulingSINR

Mathematics Subject Classification ID

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

Related Items (1)

A maximum clique based approximation algorithm for wireless link scheduling under SINR model

Cites Work

• Unnamed Item
• Nearly optimal bounds for distributed wireless scheduling in the SINR model
• Practical unicast and convergecast scheduling schemes for cognitive radio networks
• On energy conservation for finite element approximation of flow-induced airfoil vibrations
• Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks
• An improved distributed data aggregation scheduling in wireless sensor networks
• Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks
• A Biological Solution to a Fundamental Distributed Computing Problem
• Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
• Link scheduling in polynomial time
• The capacity of wireless networks
• Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits

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