TSLS and TSLSU: Two Novel Approximation \text-Based Shortest Link Scheduling Algorithms in Wireless Networks
In this paper, we address the fundamental problem of shortest link scheduling (SLS) in wireless networks under the Signal-to-Interference-plus-Noise-Ratio (<inline-formula><tex-math notation="LaTeX">\text{SINR}</tex-math></inline-formula>) constraints and propose tw...
Uložené v:
| Vydané v: | IEEE transactions on vehicular technology s. 1 - 13 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
2025
|
| Predmet: | |
| ISSN: | 0018-9545, 1939-9359 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In this paper, we address the fundamental problem of shortest link scheduling (SLS) in wireless networks under the Signal-to-Interference-plus-Noise-Ratio (<inline-formula><tex-math notation="LaTeX">\text{SINR}</tex-math></inline-formula>) constraints and propose two efficient Triangle-based Shortest Link Scheduling (TSLS and TSLSU) algorithms by assuming both oblivious power control and uniform power assignment scenarios. Many existing algorithms, to solve SLS under the <inline-formula><tex-math notation="LaTeX">\text{SINR}</tex-math></inline-formula> constraints, partition the set of links into classes and for each class, schedule the links by partitioning the link deployment plane into small regions. In this paper, we present a new triangle-based method for plane partitioning, showing that it significantly improves efficiency by increasing the number of simultaneously schedulable same-color regions. Consequently, more links can be activated within a time slot compared to other partitioning methods. Theoretical analysis indicates the correctness and effectiveness of our algorithms. Theoretical analysis demonstrates that our plane partition and approximation ratios are respectively much more efficient and tighter than those of state-of-the-art algorithms' results. In summary, both theoretical analysis and simulation results confirm that our algorithms offer superior performance in terms of efficiency and solution quality compared to the state-of-the-art algorithms. |
|---|---|
| AbstractList | In this paper, we address the fundamental problem of shortest link scheduling (SLS) in wireless networks under the Signal-to-Interference-plus-Noise-Ratio (<inline-formula><tex-math notation="LaTeX">\text{SINR}</tex-math></inline-formula>) constraints and propose two efficient Triangle-based Shortest Link Scheduling (TSLS and TSLSU) algorithms by assuming both oblivious power control and uniform power assignment scenarios. Many existing algorithms, to solve SLS under the <inline-formula><tex-math notation="LaTeX">\text{SINR}</tex-math></inline-formula> constraints, partition the set of links into classes and for each class, schedule the links by partitioning the link deployment plane into small regions. In this paper, we present a new triangle-based method for plane partitioning, showing that it significantly improves efficiency by increasing the number of simultaneously schedulable same-color regions. Consequently, more links can be activated within a time slot compared to other partitioning methods. Theoretical analysis indicates the correctness and effectiveness of our algorithms. Theoretical analysis demonstrates that our plane partition and approximation ratios are respectively much more efficient and tighter than those of state-of-the-art algorithms' results. In summary, both theoretical analysis and simulation results confirm that our algorithms offer superior performance in terms of efficiency and solution quality compared to the state-of-the-art algorithms. |
| Author | Kadivar, Mehdi Bigham, Bahram Sadeghi Mohammadi, Neda |
| Author_xml | – sequence: 1 givenname: Neda surname: Mohammadi fullname: Mohammadi, Neda email: neda.m@stu.sku.ac.ir organization: Department of Computer Science, Faculty of Mathematical Sciences, Alzahra University, Tehran, Iran – sequence: 2 givenname: Bahram Sadeghi surname: Bigham fullname: Bigham, Bahram Sadeghi email: b_sadeghi_b@alzahra.ac.ir organization: Department of Computer Science, Faculty of Mathematical Sciences, Alzahra University, Tehran, Iran – sequence: 3 givenname: Mehdi surname: Kadivar fullname: Kadivar, Mehdi email: m_kadivar@aut.ac.ir organization: Department of Computer Science, University of Shahrekord, Shahrekord, Iran |
| BookMark | eNpFkM1OwzAQhC1UJErhzoGDXyDFG8dpzK1U_ElROSSFC1LkJOs2NI0r29Dy9qRqJU47K82MNN8lGXSmQ0JugI0BmLzL3_NxyEIx5iIREuIzMgTJZSC5kAMyZAySQIpIXJBL5776N4okDEmbZ2lGVVfTg1jc03xn6Nz8YEun2601-2ajfGM6-ulx74MH5bCm2cpYj87TtOnWNKtWWH-3Tbek03ZpbONXG0ebjn40Flt0js7R74xduytyrlXr8Pp0R2Tx9JjPXoL07fl1Nk2DCnjkA4gTULrEJBJhpCUrY1aGrOI8iVQdlhOIQuQCauC1ZhxjwVWvtNQKOKtCzUeEHXsra5yzqIut7XfY3wJYcaBV9LSKA63iRKuP3B4jDSL-24FNQLKQ_wEJmmjC |
| CODEN | ITVTAB |
| ContentType | Journal Article |
| DBID | 97E RIA RIE AAYXX CITATION |
| DOI | 10.1109/TVT.2025.3585916 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Xplore CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1939-9359 |
| EndPage | 13 |
| ExternalDocumentID | 10_1109_TVT_2025_3585916 11071902 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 4.4 5GY 6IK 97E AAIKC AAJGR AAMNW AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AGQYO AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS HZ~ IFIPE IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS RXW TAE TN5 3EH 5VS AAYXX AETIX AGSQL AI. AIBXA ALLEH CITATION EJD H~9 IAAWW IBMZZ ICLAB IFJZH VH1 |
| ID | FETCH-LOGICAL-c134t-1681afbe84524f90b60b20c3384ad2b7142e351d13df03e653a3dff9fa130c2f3 |
| IEDL.DBID | RIE |
| ISSN | 0018-9545 |
| IngestDate | Sat Nov 29 07:45:21 EST 2025 Wed Aug 27 02:14:28 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c134t-1681afbe84524f90b60b20c3384ad2b7142e351d13df03e653a3dff9fa130c2f3 |
| PageCount | 13 |
| ParticipantIDs | crossref_primary_10_1109_TVT_2025_3585916 ieee_primary_11071902 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-00-00 |
| PublicationDateYYYYMMDD | 2025-01-01 |
| PublicationDate_xml | – year: 2025 text: 2025-00-00 |
| PublicationDecade | 2020 |
| PublicationTitle | IEEE transactions on vehicular technology |
| PublicationTitleAbbrev | TVT |
| PublicationYear | 2025 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0014491 |
| Score | 2.4512012 |
| Snippet | In this paper, we address the fundamental problem of shortest link scheduling (SLS) in wireless networks under the Signal-to-Interference-plus-Noise-Ratio... |
| SourceID | crossref ieee |
| SourceType | Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | <inline-formula xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <tex-math notation="LaTeX"> text{SINR}</tex-math> </inline-formula> Approximation algorithms Interference Partitioning algorithms Power control Schedules Scheduling Scheduling algorithms Shortest link scheduling Signal to noise ratio Throughput Wireless networks |
| Title | TSLS and TSLSU: Two Novel Approximation \text-Based Shortest Link Scheduling Algorithms in Wireless Networks |
| URI | https://ieeexplore.ieee.org/document/11071902 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Xplore customDbUrl: eissn: 1939-9359 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014491 issn: 0018-9545 databaseCode: RIE dateStart: 19670101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELYAMcDAG1Fe8sDCEIgfeZitICqGqkJqqDogRbF9ppFKgtoU-PnYSXgNDGynKJaiO8d35_vuO4TOlKFgw1TpESHB48CMJ6jSHkRCUxNRrmvGm1E_Ggzi8Vjct83qdS8MANTgM7hwYl3L16VauKuyS5erWAdmT9zlKAqbZq2vkgHn7Xg8Yv9gGxd81iR9cZmMEpsJ0uCCBY6uLfzlg34MVal9Sm_zn1-zhTba4BF3G2tvoyUodtD6D0rBXTRNhv0hzgqNnfBwhZO3Eg_KV7DLHH34e970KuJHB_nwrq0T03g4cZDbeYVdZoqH1o7aAdSfcHf6VM7yavI8x3mBHVJ2ak9GPGiw4_M99NC7TW7uvHaigqcI45VHwphkRkLMA8qN8GXoS-orm6byTFMZEU6BBUQTpo3PIAxYZiUjTGZdnaKG7aOVoizgAGEbGAGEESGSSi5jFmslQFstEymViKGDzj91nL40xBlpnXD4IrX2SJ090tYeHbTn1Pv9XqvZwz-eH6E1t7y5CTlGK9VsASdoVb1W-Xx2Wm-LD2lhtn8 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEA6ignrwLb7NwYuHavPoI95WURTXImwVD0JpkokurK3s1tWfb9LW18GDt6G0pcyXZmYy38wgtK8MBeumSo8ICR4HZjxBlfYgEpqaiHJdd7y560ZJEt_fi5u2WL2uhQGAmnwGh06sc_m6VK_uqOzIxSrWgNkddyrgnPpNudZX0oDzdkAesf-w9Qw-s5K-OErvUhsL0uCQBa5hW_jLCv0Yq1JblfOFf37PIppv3UfcafBeQhNQLKO5H00FV9Ag7XV7OC80dsLtMU7fSpyUY7CPuQbi7_2mWhE_ONKHd2LNmMa9J0e6HVXYxaa4Z5HUjqL-iDuDx3LYr56eR7hfYMeVHdi9EScNe3y0im7Pz9LTC6-dqeApwnjlkTAmuZEQ84ByI3wZ-pL6ygaqPNdURoRTYAHRhGnjMwgDllvJCJNbY6eoYWtosigLWEfYukYAYUSIpJLLmMVaCdBWy0RKJWLYQAefOs5emtYZWR1y-CKzeGQOj6zFYwOtOvV-39dqdvOP63to5iK97mbdy-RqC826VzXnIttoshq-wg6aVuOqPxru1kvkAxXOucY |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=TSLS+and+TSLSU%3A+Two+Novel+Approximation+%5Ctext-Based+Shortest+Link+Scheduling+Algorithms+in+Wireless+Networks&rft.jtitle=IEEE+transactions+on+vehicular+technology&rft.au=Mohammadi%2C+Neda&rft.au=Bigham%2C+Bahram+Sadeghi&rft.au=Kadivar%2C+Mehdi&rft.date=2025&rft.pub=IEEE&rft.issn=0018-9545&rft.spage=1&rft.epage=13&rft_id=info:doi/10.1109%2FTVT.2025.3585916&rft.externalDocID=11071902 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9545&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9545&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9545&client=summon |