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

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.