Channel-aware hierarchical graph network for optimizing sliding window RLNC in challenging wireless environments.

Saved in:
Bibliographic Details
Title: Channel-aware hierarchical graph network for optimizing sliding window RLNC in challenging wireless environments.
Authors: Akilandeswary, G.1 (AUTHOR) akilandeswaryg@stjosephstechnology.ac.in, Manickam, J. Martin Leo2 (AUTHOR) josephmartin74@gmail.com
Source: EURASIP Journal on Wireless Communications & Networking. 1/20/2026, Vol. 2026 Issue 1, p1-21. 21p.
Subjects: Linear network coding, Graph neural networks, Wireless communications, Network performance, Channel capacity (Telecommunications)
Abstract: Sliding window random linear network coding has emerged as a powerful technique for enhancing the performance of communication networks, particularly in multicast and wireless networks. However, its performance is significantly affected by varying channel conditions such as multipath fading, interference, and noise. To overcome this challenge, novel adaptive channel coefficient engineering is required to dynamically optimize RLNC functionality across varying channel conditions. This paper presents a novel channel-aware hierarchical graph network (CAHGN) that captures the complex interdependencies between various channel features (such as signal-to-noise ratio, path loss, fading factor, interference level, channel magnitude, and phase) and generates an optimized channel coefficient metric to enhance coding performance. The effectiveness of the CAHGN model depends on two key elements: stochastic feature aggregation and dynamic redundancy factor. The stochastic feature aggregation process provides adaptive and weighted channel features by selecting the most relevant features, which are incorporated using the posterior distribution of feature weights. The dynamic redundancy factor controls redundancy levels according to changing feature weights. Simulation results demonstrate that the generated channel coefficient metric improves throughput (by 47.4%), reliability (by 18.2%), and spectral efficiency (by 50%) compared to the traditional RLNC technique under varying wireless channel conditions. Thus, the CAHGN model provides consistent near-optimal performance across different channel environments, reducing recovery time by approximately 60.9%. [ABSTRACT FROM AUTHOR]
Copyright of EURASIP Journal on Wireless Communications & Networking is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 193005285
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Channel-aware hierarchical graph network for optimizing sliding window RLNC in challenging wireless environments.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Akilandeswary%2C+G%2E%22">Akilandeswary, G.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> akilandeswaryg@stjosephstechnology.ac.in</i><br /><searchLink fieldCode="AR" term="%22Manickam%2C+J%2E+Martin+Leo%22">Manickam, J. Martin Leo</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> josephmartin74@gmail.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22EURASIP+Journal+on+Wireless+Communications+%26+Networking%22">EURASIP Journal on Wireless Communications & Networking</searchLink>. 1/20/2026, Vol. 2026 Issue 1, p1-21. 21p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Linear+network+coding%22">Linear network coding</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+neural+networks%22">Graph neural networks</searchLink><br /><searchLink fieldCode="DE" term="%22Wireless+communications%22">Wireless communications</searchLink><br /><searchLink fieldCode="DE" term="%22Network+performance%22">Network performance</searchLink><br /><searchLink fieldCode="DE" term="%22Channel+capacity+%28Telecommunications%29%22">Channel capacity (Telecommunications)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Sliding window random linear network coding has emerged as a powerful technique for enhancing the performance of communication networks, particularly in multicast and wireless networks. However, its performance is significantly affected by varying channel conditions such as multipath fading, interference, and noise. To overcome this challenge, novel adaptive channel coefficient engineering is required to dynamically optimize RLNC functionality across varying channel conditions. This paper presents a novel channel-aware hierarchical graph network (CAHGN) that captures the complex interdependencies between various channel features (such as signal-to-noise ratio, path loss, fading factor, interference level, channel magnitude, and phase) and generates an optimized channel coefficient metric to enhance coding performance. The effectiveness of the CAHGN model depends on two key elements: stochastic feature aggregation and dynamic redundancy factor. The stochastic feature aggregation process provides adaptive and weighted channel features by selecting the most relevant features, which are incorporated using the posterior distribution of feature weights. The dynamic redundancy factor controls redundancy levels according to changing feature weights. Simulation results demonstrate that the generated channel coefficient metric improves throughput (by 47.4%), reliability (by 18.2%), and spectral efficiency (by 50%) compared to the traditional RLNC technique under varying wireless channel conditions. Thus, the CAHGN model provides consistent near-optimal performance across different channel environments, reducing recovery time by approximately 60.9%. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of EURASIP Journal on Wireless Communications & Networking is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=193005285
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1186/s13638-025-02562-w
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 1
    Subjects:
      – SubjectFull: Linear network coding
        Type: general
      – SubjectFull: Graph neural networks
        Type: general
      – SubjectFull: Wireless communications
        Type: general
      – SubjectFull: Network performance
        Type: general
      – SubjectFull: Channel capacity (Telecommunications)
        Type: general
    Titles:
      – TitleFull: Channel-aware hierarchical graph network for optimizing sliding window RLNC in challenging wireless environments.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Akilandeswary, G.
      – PersonEntity:
          Name:
            NameFull: Manickam, J. Martin Leo
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 20
              M: 01
              Text: 1/20/2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 16871472
          Numbering:
            – Type: volume
              Value: 2026
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: EURASIP Journal on Wireless Communications & Networking
              Type: main
ResultId 1