Consider the cluster-based wireless sensor networks (WSNs) within a set of sensor nodes which need a reliable data broadcast, most recent works ignore the broadcast cost and the cache of sensor nodes when using instantly decodable network codes (IDNC). In this paper, we firstly propose a 2C-IDNC graph by taking advantage of Cache-IDNC graph and Cost-IDNC graph. To find a maximum weight clique in 2C-IDNC graph with smaller broadcast cost, we utilize the dynamic selection to achieve a proper broadcast cost, which can ensure the decode opportunities of encoded packets in WSNs. To this end, a heuristic algorithm is proposed to reduce the complexity of computation which operates on the novel 2C-IDNC graph. The simulation results show that the broadcast cost can be indeed reduced by the 2C- IDNC scheme.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Broadcast Cost Reduction in Wireless Sensor Networks with Instantly Decodable Network Codes


    Contributors:
    Zhao, Yimin (author) / Xiao, Song (author) / Gan, Hongping (author)


    Publication date :

    2018-06-01


    Size :

    234152 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Lightweight Instantly Decodable Network Coding in Wireless Broadcast

    Wang, Le / Su, Rina / Sun, Qifu Tyler et al. | IEEE | 2024


    Rate-Aware Instantly Decodable Network Codes for Heterogeneous Cellular Networks

    Rabih, Abdurrahman / Ghandour, Abdulrhman / Shnaiwer, Yousef N. et al. | IEEE | 2019


    Instantly Decodable RaptorQ Intersessions in Vehicular Adhoc Networks

    Vineeth Nandhini / Guruprasad H. S. | DOAJ | 2020

    Free access