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

Cui Wang (), Jiguo Yu (), Dongxiao Yu (), Baogui Huang () and Shanshan Yu ()
Additional contact information
Cui Wang: Qufu Normal University
Jiguo Yu: Qufu Normal University
Dongxiao Yu: The University of Hong Kong
Baogui Huang: Qufu Normal University
Shanshan Yu: Shandong University

Journal of Combinatorial Optimization, 2016, vol. 32, issue 4, No 6, 1052-1067

Abstract: Abstract Link scheduling is a fundamental problem in wireless ad hoc and sensor networks. In this paper, we focus on the shortest link scheduling (SLS) under Signal-to-Interference-plus-Noise-Ratio and hypergraph models, and propose an approximation algorithm $$SLS_{pc}$$ S L S p c (A link scheduling algorithm with oblivious power assignment for the shortest link scheduling) with oblivious power assignment for better performance than GOW* proposed by Blough et al. [IEEE/ACM Trans Netw 18(6):1701–1712, 2010]. For the average scheduling length of $$SLS_{pc}$$ S L S p c is 1 / m of GOW*, where $$m=\lfloor \varDelta _{max}\cdot p \rfloor $$ m = ⌊ Δ m a x · p ⌋ is the expected number of the links in the set V returned by the algorithm HyperMaxLS (Maximal links schedule under hypergraph model) and $$0

Keywords: Wireless network; Shortest link scheduling; Approximation algorithm; Hypergraph model; SINR (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9908-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:4:d:10.1007_s10878-015-9908-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9908-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().