5G cellular network will drive towards higher energy efficiency, lower latency and higher reliable wireless networks. The key contributions can summarize as follows: (1) this paper proposes a feasible method to comput...
详细信息
5G cellular network will drive towards higher energy efficiency, lower latency and higher reliable wireless networks. The key contributions can summarize as follows: (1) this paper proposes a feasible method to compute the expected rate and approach the optimal capacity region by upper and lower bounds in 5G cellular network, (2) develops linear network coding and dynamic rate adaptation to improve the throughput and reliability of LAA network, (3) proposes a new E-PDP-MNLC (Efficient Protocol Priority-based Distributed Paired Multicast networklinearcoding) scheme for LAA networkcoding. center dot networks -> network layer protocols -> Routing protocols center dot networks -> network algorithms -> Data path algorithms -> Packet scheduling -> Control path algorithms -> network control algorithms.
Convergecast is probably the most common communication style in wireless sensor networks (WSNs). And linear network coding (LNC) is a promising concept to improve throughput or reliability of convergecast. Most of the...
详细信息
Convergecast is probably the most common communication style in wireless sensor networks (WSNs). And linear network coding (LNC) is a promising concept to improve throughput or reliability of convergecast. Most of the existing works have mainly focused on exploiting these benefits without considering its potential adverse effect. In this paper, we argue that LNC may not always benefit convergecast. This viewpoint is discussed within four basic scenarios: LNC-aided and none-LNC convergecast schemes with and without automatic repeat request (ARQ) mechanisms. The most concerned performance metrics, including packet collection rate, energy consumption, energy consumption balance and end-to-end delay, are investigated. Theoretical analyses and simulation results show that the way LNC operates, i.e., conscious overhearing and the prerequisite of successfully decoding, could naturally diminish its advantages in convergecast. And LNC-aided convergecast schemes may even be inferior to none-LNC ones when the wireless link delivery ratio is high enough. The conclusion drawn in this paper casts a new light on how to effectively apply LNC to practical WSNs.
Parallel transmission is a known technique of transmitting flows over multiple paths from a source towards the same destination. In high-speed Ethernet standards, for instance, large bandwidth flows are inverse-multip...
详细信息
Parallel transmission is a known technique of transmitting flows over multiple paths from a source towards the same destination. In high-speed Ethernet standards, for instance, large bandwidth flows are inverse-multiplexed into multiple lower-speed flows and transmitted in parallel. However, when flows traverse different paths, attention needs to be paid to the resulting differential delay, which requires computationally expensive path optimizations and large buffering at the receiver. In this paper, we show analytically that linear network coding can significantly reduce the buffering in high-speed Ethernet systems at a price of en/decoding overhead, while relaxing the requirements on path optimality. We implement the proposed decoding buffer model according to the IEEE 802.3ba standard, and show that linear network coding reduces the buffer size up to 40% as compared to systems without coding. With linear network coding, input interfaces of the destination node can deploy relatively smaller buffers, which is critical for wider practical deployment of highspeed Ethernet systems at 100 Gbps and beyond.
Modern optical network systems are evolving toward more spectral flexibility and efficiency driven by the ever-increasing need for high-speed transmission. In spectrally efficient elastic optical networks, a more inte...
详细信息
Modern optical network systems are evolving toward more spectral flexibility and efficiency driven by the ever-increasing need for high-speed transmission. In spectrally efficient elastic optical networks, a more integrated, fault tolerant transmission system is becoming critical, due to the accompanying optical impairments and the resulting limitations in optical reach. Previous work has addressed the issue of optical reach and transmission tolerance to faults (errors) in the physical layer by deploying various forward error correction schemes. This paper proposes a different approach, complementary to the error correction mechanisms in the physical layer. In our approach, we apply randomized linear network coding (RLNC) at the source node to encode all data in the electronic layer before all-optical transmission. To achieve fault tolerance, a coded auxiliary optical channel is used in parallel with the main path. With the auxiliary path and RLNC, as shown analytically, the system is able to use more advanced modulation formats in the main path, while being highly tolerant to bit errors and packet loss caused by optical impairments. The results show that the system can alleviate the constraints on optical transmission quality and achieve better optical reach and spectral efficiency.
The multi-source networkcoding problem, in which multiple multicast sessions with independent data share a network, is an open challenge. This paper proposes an approach to implement multi-source multicast sessions w...
详细信息
ISBN:
(纸本)9780769535579
The multi-source networkcoding problem, in which multiple multicast sessions with independent data share a network, is an open challenge. This paper proposes an approach to implement multi-source multicast sessions with linear network coding. We divide the original network into several sub-graphs, and each sub-graph contains a source node and its corresponding sink nodes. Links belonging to different sub-graphs do not overlap each other. In order to make the whole network throughput as large as possible, we transform partitioning sub-graphs into a combinatorial optimization problem and use genetic algorithm to solve it. Moreover, we give a pretreatment to narrow the search space. Then, it can be easy to construct coding scheme for each subgraph. Furthermore, we prove that with the proposed approach, the throughput of the whole network is not less than the one with routing. Simulation results show that the proposed approach is feasible.
We consider the problem of linear network coding over communication networks, representable by directed acyclic graphs, with multiple groupcast sessions: the network comprises of multiple destination nodes, each desir...
详细信息
ISBN:
(纸本)9781479913213
We consider the problem of linear network coding over communication networks, representable by directed acyclic graphs, with multiple groupcast sessions: the network comprises of multiple destination nodes, each desiring messages from multiple sources. We adopt an interference alignment perspective, providing new insights into designing practical networkcoding schemes as well as the impact of network topology on the complexity of the alignment scheme. In particular, we show that under certain (polynomial-time checkable) constraints on networks with K sources, it is possible to achieve a rate of 1 / (L + d + 1) per source using linear network coding coupled with interference alignment, where each destination receives messages from L sources (L < K), and d is a parameter, solely dependent on the network topology, that satisfies 0 <= d < K - L.
In all of the works related to linear network coding (LNC), researchers use the Galois field (GF) operation property to generate the coding matrix elements. The elements of the coding matrix produced from the coeffici...
详细信息
In all of the works related to linear network coding (LNC), researchers use the Galois field (GF) operation property to generate the coding matrix elements. The elements of the coding matrix produced from the coefficients are randomly generated and selected from the GF(q). In this paper, we present an analytical analysis on the effect of using the binary field (OR operation) property to generate the coding matrix elements in LNC instead of using the customary GF. The LNC with binary OR operation (LNC_OR) is simulated under various multihop wireless network conditions of coefficients and coding router for three different network topologies. Each of the three network topologies has different coefficients since different networkcoding router is used. Performances of the LNC with the different probability of the coefficients of coding matrix base on packet delivery ratio (PDR) are analysed. Simulation results for three different network topologies confirm that LNC_OR reduces the number of lost packets received and improves PDR performance as compared to LNC with GF (LNC_GF) operation property.
We investigate the performance of two multi-hop network topologies in which two sources have independent information to be transmitted to a far off common destination. linear network coding technique is used by the in...
详细信息
We investigate the performance of two multi-hop network topologies in which two sources have independent information to be transmitted to a far off common destination. linear network coding technique is used by the intermediate relays to transmit the combined information of two sources. The first topology contains nodes that are placed in a regular pattern and the transmission process is modeled with a quasi-stationary Markov chain. The relay nodes use decode and forward mechanism at each hop. We find the transition probability matrix of the Markov chain assuming that all the nodes have same transmit power and the channel is Rayleigh fading. The second random network topology has fixed number of nodes that are randomly placed in a strip-shaped network. The outage probability of each node is found and the state distribution at each hop is used to analyze the network coverage for a given signal-to-noise ratio margin. Theoretical results have been included that match with the simulation results.
Increasing network capacity is undoubtedly a critical aspect of modern communication systems. In this paper, the concept of sub-rate coding and decoding in the framework of linear network coding (LNC) is introduced fo...
详细信息
Increasing network capacity is undoubtedly a critical aspect of modern communication systems. In this paper, the concept of sub-rate coding and decoding in the framework of linear network coding (LNC) is introduced for single-source multiple-sinks finite acyclic networks. This methodology offers a modification to existing LNC so that the source transmits its messages in a manner in which a given set of sinks (termed sub-rate sinks), whose max-flow is smaller than the source's message-rate, can still decode a portion of the transmitted messages, without degrading the maximum achievable rate of LNC sinks whose max-flow is equal (or greater) than the source rate. The paper sets the conditions which a set of sub-rate sinks has to satisfy in order for that methodology to be applicable.
In networkcoding, for the case that the network topology is unknown completely, random linear network coding has been proposed as an acceptable coding technique. In this paper, we define average failure probability o...
详细信息
In networkcoding, for the case that the network topology is unknown completely, random linear network coding has been proposed as an acceptable coding technique. In this paper, we define average failure probability of random linear network coding in order to characterize the performance of random networkcoding, and then analyze this failure probability for different known topological information of network. We obtain several upper bounds on the failure probabilities, and further show that, for some networks, these upper bounds are tight or asymptotically tight. Moreover, if the more topological information of the network is utilized, the better upper bounds are acquired.
暂无评论