Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Efficient Retransmission Based on Network Coding with Unicast Flows (1009.0921v2)

Published 5 Sep 2010 in cs.IT, cs.NI, and math.IT

Abstract: Recently, network coding technique has emerged as a promising approach that supports reliable transmission over wireless loss channels. In existing protocols where users have no interest in considering the encoded packets they had in coding or decoding operations, this rule is expensive and inef-ficient. This paper studies the impact of encoded packets in the reliable unicast network coding via some theoretical analysis. Using our approach, receivers do not only store the encoded packets they overheard, but also report these information to their neighbors, such that users enable to take account of encoded packets in their coding decisions as well as decoding operations. Moreover, we propose a redistribution algorithm to maximize the coding opportunities, which achieves better retransmission efficiency. Finally, theoretical analysis and simulation results for a wheel network illustrate the improve-ment in retransmissions efficiency due to the encoded packets.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Zhiheng Zhou (11 papers)
  2. Liang Zhou (44 papers)
  3. Yuanquan Tan (2 papers)
  4. Xing Wang (191 papers)

Summary

We haven't generated a summary for this paper yet.