MAC layer random network coding (MRNC) was proposed as an alternative to HARQ for reliable data transmission in WiMAX unicast. It has been shown that MRNC achieves a higher transmission efficiency than HARQ as it avoi...
详细信息
ISBN:
(纸本)9781424435128
MAC layer random network coding (MRNC) was proposed as an alternative to HARQ for reliable data transmission in WiMAX unicast. It has been shown that MRNC achieves a higher transmission efficiency than HARQ as it avoids the problem of ACK/NAK packet overhead and the additional redundancy resulting from their loss. However, it did not address the problem of restricting the number of transmissions to an upper bound which is important for delay sensitive applications. In this paper, we investigate a more structured MAC layer coding scheme that achieves the optimum performance in the delay sensitive traffic context while achieving the same overhead level as MRNC. We first formulate the delay sensitive traffic satisfaction, in such an environment, as a minimax optimization problem over all possible coding schemes. We then show that the MAC layer systematic network coding (MSNC), which transmits the packets once uncoded and employs random network coding for retransmissions, achieves the optimum performance for delay sensitive applications while achieving the same overhead level as MRNC.
Wireless mesh networks have emerged as a favorable infrastructure that promises to unify the existing 802.11 wireless LANs. With multiple orthogonal channels and possibly multiple interfaces on the mesh nodes, such ne...
详细信息
Wireless mesh networks have emerged as a favorable infrastructure that promises to unify the existing 802.11 wireless LANs. With multiple orthogonal channels and possibly multiple interfaces on the mesh nodes, such networks can provide broadband access for a large number of wireless clients. However, efficient assignment of channels to the available network interfaces has long been a daunting task for network designers. Existing heuristic and theoretical work unanimously focuses on joint design of channel assignment with the conventional transport/IP/MAC architecture. In this paper, we show that a new paradigm, network coding, is able to further increase the capacity of multi-channel mesh networks. We propose a joint optimization problem that accounts for routing, channel assignment, and network coding, and analyze its potential performance gains over the non-coding schemes. This problem inspires a practical algorithm that naturally combines network coding and routing. We also explore the benefits of network coding for emerging multi-channel wireless networks, including 802.16 and 802.11n, and derive the upper bound for its performance gains over existing channel assignment protocols.
The existing PNC scheme is with coherent detection at the receivers, where the perfect global CSI is needed. To ensure that PNC can be implemented in practical two-way relaying systems, two detection schemes are prese...
详细信息
The existing PNC scheme is with coherent detection at the receivers, where the perfect global CSI is needed. To ensure that PNC can be implemented in practical two-way relaying systems, two detection schemes are presented in this paper, which are named as non-coherent detection and partial-coherent detection for PNC respectively. Specifically non-coherent detection requires for no CSI at the receivers. To further improve the detection performance, partial-coherent detection for PNC is introduced, where imperfect partial CSI can be obtained at the receivers by channel estimation. The decision rules for both two detection schemes are given in the paper, and the simulation results show that our proposed detection schemes are practical and efficient for PNC in Rayleigh fading channels.
This paper presents a novel Selective Recoding Random Linear network coding (SR-RLNC), enhancing traditional RLN C by introducing selective recoding at intermediate nodes, triggered only upon packet loss detection. In...
详细信息
ISBN:
(数字)9798350379051
ISBN:
(纸本)9798350379068
This paper presents a novel Selective Recoding Random Linear network coding (SR-RLNC), enhancing traditional RLN C by introducing selective recoding at intermediate nodes, triggered only upon packet loss detection. Informed by packet sequence tracking, this strategy intelligently determines when to bypass recoding, thus minimizing unnecessary computational work and delays. Performance metrics-encoding and decoding delays, and overall latency-are meticulously tracked, revealing SR-RLNC's superior efficiency. The comparative analysis demon-strates that SR-RLNC outperforms traditional RLNC, with a significant reduction in encoding delay (16.9 ms vs. 20.8 ms) and overall latency (18.6 ms vs. 22.5 ms), suggesting its potential as a more effective solution for high-speed, dynamic network environments.
We consider the problem of distributing k blocks from a source to N nodes in a peer-to-peer (P2P) network with both node upload and download capacity constraints. As k scales up, we prove for homogeneous networks that...
详细信息
ISBN:
(纸本)9781424499199
We consider the problem of distributing k blocks from a source to N nodes in a peer-to-peer (P2P) network with both node upload and download capacity constraints. As k scales up, we prove for homogeneous networks that if network coding is allowed, randomly matching senders and receivers in each time slot asymptotically achieves the maximum downloading rate at each node. For heterogeneous networks with network coding allowed, we show that a fair and optimal downloading rate at each node can be asymptotically approached, if in each time slot, each node randomly allocates its upload bandwidth to its receivers that have available download bandwidth. We also give a performance lower bound of the above randomized coded dissemination when both k and N scale under certain conditions. These results demonstrate that with network coding, simple randomized receiver selection and rate allocation suffice to achieve P2P broadcast capacity, forming a theoretical foundation for mesh-based P2P networks with network coding.
In single-source network coding, we are interested in characterizing the maximum rate at which information can be multicast from the source node to all the sink nodes, this is accomplished by the mean of Max-Flow-Min-...
详细信息
ISBN:
(纸本)9781424427994
In single-source network coding, we are interested in characterizing the maximum rate at which information can be multicast from the source node to all the sink nodes, this is accomplished by the mean of Max-Flow-Min-Cut theorem. In multi-source network coding the problem is different and more complicated;we are interested in characterizing the information rate region and the capacity region. In this work, which is an extension to our previous work [12], we found the inner and outer bounds of information rate region for two sources two sinks network coding;we achieved these bounds by using the Max-Flow constraints. Our multicasting algorithm is based on decomposing the current problem to three sub-problems: a multicast network coding sub-problem and two multi-commodity flow sub-problems.
We address the problem of transmitting packets to multiple receiver nodes over single-hop channels with probabilistic reception. The objective is to evaluate the stability properties of different transmission policies...
详细信息
We address the problem of transmitting packets to multiple receiver nodes over single-hop channels with probabilistic reception. The objective is to evaluate the stability properties of different transmission policies with and without network coding. We consider a dynamic network coding scheme based on the instantaneous queue content and we show that network coding increases the stable throughput and reduces the transmission energy costs (at the expense of additional processing energy costs). The comparison of (deterministic and random) linear network coding schemes with plain retransmission policies opens up several new questions regarding the tradeoffs of stable throughput, energy efficiency, packet overhead and complexity.
Concurrent Multipath Transfer (CMT), enabled by Stream Control Transmission Protocol (SCTP), is considered as one preferred data-transport mode due to increased available bandwidth. However, CMT performance degrades s...
详细信息
ISBN:
(纸本)9781479930845
Concurrent Multipath Transfer (CMT), enabled by Stream Control Transmission Protocol (SCTP), is considered as one preferred data-transport mode due to increased available bandwidth. However, CMT performance degrades seriously in terms of data reordering due to path dissimilarity and frequent packet loss from wireless unreliability. Most relevant solutions follow the packet sequence numbers and thereby focus on strict in-order reception and packet-specific retransmission. Passively adapting to the network conditions, those approaches are not general and well enough responding to the dynamicity of wireless environment. By applying network coding (NC) to CMT, this paper proposes a progressive end-to-end solution (CMT-NC) to those problems in heterogeneous wireless networks. CMT-NC is capable of avoiding reordering and compensating lost packets. Further, an innovative group-based transmission management mechanism enhances the robustness and reliability of data transfer. Simulation results show how by using CMT-NC significant improvements in comparison to another state-of-the-art solution are obtained.
By theoretical analysis, we discuss the performance of random access protocol by network coding in wireless relay networks. We present a novel method to increase the opportunity of network coding in relay node. By usi...
详细信息
By theoretical analysis, we discuss the performance of random access protocol by network coding in wireless relay networks. We present a novel method to increase the opportunity of network coding in relay node. By using this method, the performance of random access protocol in wireless networks can be improved especially in low traffic load. We compare the performance of this method with network coding method in the system using slotted ALOHA in several metrics including the system throughput, the retransmission number and delay.
In recent years, a significant amount of research has been conducted to explore the benefits of network coding in different scenarios, from both theoretical and simulation perspectives. In this paper, we utilize queue...
详细信息
暂无评论