networkcoding(NC) has potential to improve the wireless network performance compared with a routing network in a two-relay network. Now most of researches focus on the performance analysis with the same length data p...
详细信息
ISBN:
(纸本)9781509064151;9781509064144
networkcoding(NC) has potential to improve the wireless network performance compared with a routing network in a two-relay network. Now most of researches focus on the performance analysis with the same length data packet in NC. However, our previous work has proved that the length of packets would affect the networkcoding performance and energy consumption. In this paper, we propose a new strategy of networkcoding based on packet length to improve the network coding gain. The strategy is that the smaller packets in the same waiting queue is bunding to a large one base on the asynchronous networkcoding, and the larger one would replace the old packets and then be coded with the other waiting queue. Our work showed that the new asynchronous networkcoding would improve the network coding gain of NC and reduce the effect of packet length in NC.
In this paper, we explore fundamental limitations of the benefit of networkcoding in multihop wireless networks. We study two well-accepted scenarios in the field: single multicast session and multiple unicast sessio...
详细信息
In this paper, we explore fundamental limitations of the benefit of networkcoding in multihop wireless networks. We study two well-accepted scenarios in the field: single multicast session and multiple unicast sessions. We assume arbitrary but fixed topology and traffic patterns for the wireless network. We prove that the gain of networkcoding in terms of throughput and energy saving of a single multicast session is at most a constant factor. Also, we present a lower bound on the average number of transmissions of multiple unicast sessions under any arbitrary networkcoding. We identify scenarios under which networkcoding provides no gain at all, in the sense that there exists a simple flow scheme that achieves the same performance. Moreover, we prove that the gain of networkcoding in terms of the maximum transport capacity is bounded by a constant factor of at most pi in any arbitrary wireless network under all traditional Gaussian channel models. As a corollary, we find that the gain of networkcoding on the throughput of large homogeneous wireless networks is asymptotically bounded by a constant. Furthermore, we establish theorems which relate a networkcoding scheme to a simple routing scheme for multiple unicast sessions. The theorems can be used as criteria for evaluating the potential gain of networkcoding in a given wired or wireless network. Based on these criteria, we find more scenarios where networkcoding has no gain on throughput or energy saving.
暂无评论