On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks

Abstract

The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can significantly increase the overall throughput of wireless networks by taking advantage of their broadcast nature. In wireless networks, each transmitted packet is broadcasted within a certain area and can be overheard by the neighboring nodes. When a node needs to transmit packets, it employs the opportunistic coding approach that uses the knowledge of what the node's neighbors have heard in order to reduce the number of transmissions. With this approach, each transmitted packet is a linear combination of the original packets over a certain finite field. In this paper, we focus on the fundamental problem of finding the optimal encoding for the broadcasted packets that minimizes the overall number of transmissions. We show that this problem is NP-complete over GF(2) and establish several fundamental properties of the optimal solution. We also propose a simple heuristic solution for the problem based on graph coloring and present some empirical results for random settings.

6 pages

Cited by in corpus (21)

• On the Relation Between the Index Coding and the Network Coding Problems
• An Equivalence between Network Coding and Index Coding
• Generation of Innovative and Sparse Encoding Vectors for Broadcast Systems with Feedback
• Data Dissemination in Wireless Networks with Network Coding
• Instantly Decodable Network Coding for Real-Time Scalable Video Broadcast over Wireless Networks
• On Throughput and Decoding Delay Performance of Instantly Decodable Network Coding
• Centralized and Cooperative Transmission of Secure Multiple Unicasts using Network Coding
• On the Index Coding Problem and its Relation to Network Coding and Matroid Theory
• Coded Cooperative Data Exchange in Multihop Networks
• On The Number of Optimal Linear Index Codes For Unicast Index Coding Problems
• Network Codes for Real-Time Applications
• Linear Network Code for Erasure Broadcast Channel with Feedback: Complexity and Algorithms
• On Deterministic Linear Network Coded Broadcast and Its Relation to Matroid Theory
• On the Packet Decoding Delay of Linear Network Coded Wireless Broadcast
• Index Coding and Error Correction
• Delay Minimization for Instantly Decodable Network Coding in Persistent Channels with Feedback Intermittence
• Index Coding and Network Coding via Rank Minimization
• Joint Network Coding for Interfering Wireless Multicast Networks
• On the Security of Index Coding with Side Information
• Delay Reduction in Multi-Hop Device-to-Device Communication using Network Coding
• Error Correction for Index Coding with Side Information