Clique-based Network Coding Technique

Abstract

ABSTRACTThe connected dominating set (CDS) approach is used to create a backbone within wireless networks which ultimately result in an increased number of transmissions while also reducing the number of collisions within wireless networks. Network Coding (NC) on the other hand combines the packets which finally end up further reducing the number of transmissions while increasing security within the wireless scenario. The blend of these two approaches has achieved much in terms of coding opportunity, coding gain, robustness towards packet-loss, and increased throughput. But on closer scrutiny, it has been observed that the application of the CDS-based approach along with NC has various problems as well. This approach keeps on combining and sending the packets until all the receivers attain all the packets. Moreover, the CDS--NC-based approach constrains the network, whereas all the NC nodes (dominating nodes) are connected together creating larger numbers of NC nodes, ultimately resulting in a complex network. Our Clique-Based Algorithm, along with the NC approach, not only efficiently deals with the problem concerned with a CDS--NC-based approach but it also deals with the local problem smoothly (local problem are problems confined to problems within the range of a NC node). The comparative results have shown a clear indication that the application of our Clique-Based Algorithm along with the NC approach clearly outperforms the CDS–NC- and the Tree–NC-based approaches in terms of the number of transmissions and the number of coding operations. This technique brings about better throughput, coding opportunity, coding gain, and robustness towards packet loss as compared to CDS–NC- and Tree–NC-based approaches.