The limited bandwidth resources and high packet loss probability are the main challenges when supporting video streaming over wireless multi-hop networks. Therefore, to maximize the video quality at the client, it is ...
详细信息
ISBN:
(纸本)9781467348737
The limited bandwidth resources and high packet loss probability are the main challenges when supporting video streaming over wireless multi-hop networks. Therefore, to maximize the video quality at the client, it is indispensable to concurrently take the following two aspects into account: allocating multi-stream's rate efficiently and coping properly with the high packet loss rate. Application of network coding for multimedia streaming is getting more and more attention recently. With the capability of improving the network throughput and resilience to transmission errors, combination of inter-session and intra-session network coding can better solve these challenging problems. In this paper, we investigate the problem of allocating the rate for multiple simultaneous video sessions with inter-session network coding, and identify the redundancy which should be added in intra-session network coding, so as to improve the performance of video streaming in the multi-hop wireless networks. We formulate the problem as maximizing network utilization. With extensive experiments, we can see that the proposed scheme optimizes the rate allocation and can better resilient to bursty packet losses. The video quality improvements are also notable.
A Mobile Ad Hoc network (MANET) is a dynamic wireless network that can be formed without the need for any pre-existing infrastructure in which each node can act as a router. Due to bandwidth constraint and dynamic top...
详细信息
A Mobile Ad Hoc network (MANET) is a dynamic wireless network that can be formed without the need for any pre-existing infrastructure in which each node can act as a router. Due to bandwidth constraint and dynamic topology of mobile ad hoc networks, multipath supported routing is a very important research issue. This paper proposes a network coding-based AOMDV routing algorithm in MANET (NC-AOMDV). It is typically proposed in order to increase the reliability of data transmission or to provide load balancing. In our simulation, we compare NC-AOMDV routing protocol with AODVM routing protocol, in terms of the packet delivery ratio, packet overhead, and average end-to-end delay when a packet is transmitted. The simulation results show that the NC-AOMDV routing protocol provide an accurate and efficient method of estimating and evaluating the route stability in dynamic MANETs.
In this paper, we investigate a network coding-aware channel allocation and routing scheme for multi-hop cognitive radio networks. We consider network coding and channel availability in cognitive radio networks and ma...
详细信息
ISBN:
(纸本)9781467309202
In this paper, we investigate a network coding-aware channel allocation and routing scheme for multi-hop cognitive radio networks. We consider network coding and channel availability in cognitive radio networks and maximize the throughput by allocating the channel and link rate appropriately. First, we model the activities of the primary users and the interference among the secondary users in a cognitive radio network and show how to implement network coding in the multi-hop cognitive radio network. Second, we formulate an optimization problem to maximize the throughput of the network. It takes advantage of the network coding opportunities and considers the channel availability constraint. By solving this optimization problem, we can determine how to allocate channels and rates of links in different channel availability scenarios. Furthermore, we compare the performance of our scheme with the coding oblivious routing for different scenarios of channel availability and maximum number of channels in a random wireless network. Our work brings insights on the benefits of network coding-aware routing in multi-hop cognitive radio networks.
This paper presents an efficient data gathering framework of network coding (NC) coupled compressed sensing (CS) in wireless sensor networks (WSNs), called network compressed coding (NCC). We employ network coding to ...
详细信息
This paper presents an efficient data gathering framework of network coding (NC) coupled compressed sensing (CS) in wireless sensor networks (WSNs), called network compressed coding (NCC). We employ network coding to adapt to the dynamic nature of WSNs, such as moving obstacles and link failure. Measurements from sensor networks are often correlated because sensors nodes nearby observe the contiguous phenomenon, and the operation of the random linear network coding (RLNC) scheme is similar to that of the random projection in compressed sensing. Therefore, we introduce compressed sensing into the network coding (NC), to prevent all-or-nothing impact on NC. NCC simultaneously transmits and encodes specific packets of sensor measurements to form random projections for CS recovery. CS technology guarantees that the data gathered at all nodes are accurately recovered with a high probability from a small number of projections, which is less than the total number of source nodes in the network. Our simulation results show that, only less than half number of packets are required to reconstruct measurements with reasonable quality compared with the traditional network coding schemes. Also, NCC increases the data gathering efficiency by over 20% compared to the conventional NC scheme.
A novel network coding model for linear finite-field deterministic network is considered. In our model, each channel between 2 connected nodes is represented by a channel gain matrix, while each mapping from input sig...
详细信息
ISBN:
(纸本)9781467344999
A novel network coding model for linear finite-field deterministic network is considered. In our model, each channel between 2 connected nodes is represented by a channel gain matrix, while each mapping from input signals to output signals in a node is represented by an encoder mapping matrix. We apply our model to algebraic network coding framework introduced by Ralf Koetter and Muriel Médard. Those matrices are regarded as elements to generate the adjacency matrix F, from which the system matrix M can be derived. Based on our model, we propose an algorithm to trace all the feasible routes in a network for given source and destination. We also give the capacity of the network based on the routes enumerated by the algorithm.
Multipath TCP (MPTCP) suffers from the degradation of goodput in the presence of diverse network conditions on the available subflows. The goodput can even be worse than that of one regular TCP, undermining the advant...
详细信息
Multipath TCP (MPTCP) suffers from the degradation of goodput in the presence of diverse network conditions on the available subflows. The goodput can even be worse than that of one regular TCP, undermining the advantage gained by using multipath transfer. In this work, we propose a new multipath TCP protocol, namely NC-MPTCP, which introduces network coding (NC) to some but not all subflows traveling from source to destination. At the core of our scheme is the mixed use of regular and NC subflows. Thus, the regular subflows deliver original data while the NC subflows deliver linear combinations of the original data. The idea is to take advantage of the redundant NC data to compensate for the lost or delayed data in order to avoid receive buffer becoming full. We design a packet scheduling algorithm and a redundancy estimation algorithm to allocate data among different subflows in order to optimize the overall goodput. We also give a guideline on how to choose the NC subflows among the available subflows. We evaluate the performance of NC-MPTCP through a NS-3 network simulator. The experiments show that NC-MPTCP achieves higher goodput compared to MPTCP in the presence of different subflow qualities. And in the worst case, the performance of NC-MPTCP is close to that of one regular TCP.
Recently, network coding has been applied to reliable multicast in wireless networks to improve the transmission efficiency. The expected value of network coding gain, i.e., the ratio of the average number of transmis...
详细信息
ISBN:
(纸本)9781457714146
Recently, network coding has been applied to reliable multicast in wireless networks to improve the transmission efficiency. The expected value of network coding gain, i.e., the ratio of the average number of transmissions per packet when using the conventional non-coding transmission to that when using the coding-based transmission, is an important metric to understand the benefit from using network coding. It is notable, however, that the direct calculation of expected coding gain is computationally infeasible. This paper introduces an efficient estimation for the expected coding gain with much lower computation cost. A formula is also derived to bound the error from our estimation.
A broadcast system with ACK/NAK feedback is considered where each link is modeled as a Rayleigh fading channel. The performance improvement is investigated if the erroneously received packets are not discarded and the...
详细信息
ISBN:
(纸本)9781467325790
A broadcast system with ACK/NAK feedback is considered where each link is modeled as a Rayleigh fading channel. The performance improvement is investigated if the erroneously received packets are not discarded and the soft information within them is exploited to reduce the number of transmission attempts. An outer bound on the packet reception rate region on the physical layer is provided by extending that region on the packet layer. A new transmission algorithm is proposed that combines log-likelihood ratios on the physical layer with network coding. This transmission algorithm does not require the transmitter to know any prior or instantaneous information about the channel and considers network coding on both the packet layer and the physical layer. Simulations show that the transmission algorithm with soft decoding achieves rates close to an outer bound for the packet reception rate region.
In 6LoWPAN protocol, in order to deliver an IPv6 packet in the IEEE 802.15.4 based wireless personal area network (WPAN), an IPv6 packet is divided into multiple fragments, with each being incorporated in an IEEE 802....
详细信息
ISBN:
(纸本)9781467358088
In 6LoWPAN protocol, in order to deliver an IPv6 packet in the IEEE 802.15.4 based wireless personal area network (WPAN), an IPv6 packet is divided into multiple fragments, with each being incorporated in an IEEE 802.15.4 MAC frame, such that the size of each frame is no more than the Maximum Transmission Unit (MTU) of the frame. Usually, retransmission is used to reliably deliver an IPv6 packet to the destination node in the WPAN with lossy links. To improve the end-to-end packet delivery rate (PDR) of the mesh-under routing (MUR) presented in the 6LoWPAN protocol, we present a network coding based mesh-under routing (NC-MUR) scheme. The main idea underlying NC-MUR is that, the source node generates an encoded frame in addition to the M non-coded frames derived from the IPv6 packet, and then the M+1 fragments are delivered to the destination so that the destination can recover the IPv6 packet so long as any M fragments among them are received. Theoretical analyses show that NC-MUR outperforms MUR in terms of PDR and energy consumption in the cases where fragment error rate is moderate or high.
In this paper, we study the design of network codes for multi-source, multi-relay networks over frequency non-selective slow fading channels. Specifically, we consider a system with M sources each having independent i...
详细信息
ISBN:
(纸本)9781467348232
In this paper, we study the design of network codes for multi-source, multi-relay networks over frequency non-selective slow fading channels. Specifically, we consider a system with M sources each having independent information to be transmitted to a common destination with the help of N relays (called an M - N - 1 system). A finite field (nonbinary) based method is suggested to design binary network codes. For construction of the codes, we investigate full system diversity achieving criteria and constraints imposed by it in terms of linear independence of columns (or sets of columns) of generator matrix for codes over finite fields (including binary). First, we design such full diversity achieving codes over polynomial fields of the form GF(2 K ) and then using a novel uplifting technique (matrix representation of finite fields), convert these back into frame based binary codes to reduce encoding complexity at relays (as only binary operations are used). Simulation results confirm the diversity claims of the proposed codes under perfect as well as realistic source-to-relay (S-R) channel links. We also apply belief propagation (BP) decoding on these codes. The codes are compared with that from existing algorithm and similar performance is observed with smaller frame size for the case considered.
暂无评论