In this paper, delay-constrained data transmission is considered over error-prone networks. Network coding is deployed for efficient information exchange, and an approximate decoding approach is deployed to overcome potential all-or-nothing problems. Our focus is on determining the cluster size and its impact on approximate decoding performance. Decoding performance is quantified, and we show that performance is determined only by the number of packets. Moreover, the fundamental tradeoff between approximate decoding performance and data transfer rate improvement is analyzed; as the cluster size increases, the data transfer rate improves and decoding performance is degraded. This tradeoff can lead to an optimal cluster size of network coding-based networks that achieves the target decoding performance of applications. A set of experiment results confirms the analysis.
|Number of pages
|KSII Transactions on Internet and Information Systems
|Published - 31 Mar 2016
Bibliographical noteFunding Information:
This research was supported in part by the Ministry of Science, ICT and Future Planning (MSIP), Korea, under the Information Technology Research Center (ITRC) support program (IITP-2015-H8501-15-1007) supervised by the Institute for Information & Communications Technology Promotion (IITP) and in part by a National Research Foundation of Korea (NRF) grant funded by the Korean government (MSIP; No. NRF-2014R1A2A1A11051257).
© 2016 KSII.
- Approximate decoding
- Cluster size
- Internet of Things (IoT)
- Network coding
- Network optimization
- Wireless sensor networks (WSN)