network coding is a hot research field currently, many scholars use network coding to improve the wireless network throughput, reduce network energy consumption and enhance network lifetime. The issue of energy consum...
详细信息
ISBN:
(纸本)9781612846842
network coding is a hot research field currently, many scholars use network coding to improve the wireless network throughput, reduce network energy consumption and enhance network lifetime. The issue of energy consumption of wireless multi-hop network is extremely vital because of the limited energy reserve of each node. Unlike the existing paper to solve energy consumption problems of the methods used, in this paper, for the first time used in wireless multi-hop networks to build butterfly structure and similar structures to reduce the multicast method to solve the energy problem. More importantly, this paper uses a random topology, the source node and destination node is randomly assigned, which makes the algorithm has a wide range of adaptability, proposed network coding based Multicast algorithm. In addition, the algorithm is relatively simple, can be any of the existing network coding based multicast algorithm transformation, thereby significantly reducing energy consumption.
We consider jointly optimal routing, scheduling, and network coding strategies to maximize throughput in wireless networks. While routing and scheduling techniques for wireless networks have been studied for decades, ...
详细信息
ISBN:
(纸本)9781467307734
We consider jointly optimal routing, scheduling, and network coding strategies to maximize throughput in wireless networks. While routing and scheduling techniques for wireless networks have been studied for decades, network coding is a relatively new technique that allows for an increase in throughput under certain topological and routing conditions. In this work we introduce k-tuple coding, a generalization of pairwise coding with next-hop decodability, and fully characterize the region of arrival rates for which the network queues can be stabilized under this coding strategy. We propose a dynamic control policy for routing, scheduling, and k-tuple coding, and prove that our policy is throughput optimal subject to the k-tuple coding constraint. We provide analytical bounds on the coding gain of our policy, and present numerical results to support our analytical findings. We show that most of the gains are achieved with pairwise coding, and that the coding gain is greater under 2-hop than 1-hop interference. Simulations show that under 2-hop interference our policy yields median throughput gains of 31% beyond optimal scheduling and routing on random topologies with 16 nodes.
Modern wireless communication networks demand higher throughput. As conventional methods that use more bandwidth or larger modulation levels are limited, new methods for better system performance are suggested. Multip...
详细信息
Modern wireless communication networks demand higher throughput. As conventional methods that use more bandwidth or larger modulation levels are limited, new methods for better system performance are suggested. Multiple antenna systems where Multi-Input Multi-Output (MIMO), used to enhance channel capacity, and network coding (NC) are examples of such methods. In this paper, NC is used in conjunction with MIMO technique in order to obtain advantages of both mentioned techniques. A simple packet based network coding for butterfly network topology with MIMO is modeled and simulated. The system is tested over different wireless fading channel models and with different MIMO arrangements. As a result the performance of 2×2 combined Multi-Inputs Multi-Output with network coding (MIMO-NC) have shown improved throughput over the original MIMO system by about 33% on the expense of slight loss in error performance at relatively high signal-to-noise power ratios.
In cooperative communication system, mobile users are constantly transmitting and relaying data. On the other hand, network coding has been widely investigated in communication system. In this paper, we aim to combine...
详细信息
In cooperative communication system, mobile users are constantly transmitting and relaying data. On the other hand, network coding has been widely investigated in communication system. In this paper, we aim to combine network coding with the conventional cooperative communication system, however, we face certain problems. The main property of cooperative system is diversity; however, when network coding operation is introduced, it violates the rules of diversity. The new signals transmitted by relays are no longer like those sent from the transmitters. In order to fix this problem, in this paper we introduce a method using a multiplier rather than the binary sum operation, which is normally used in network coding. Numerical analyses using maximum ratio combining (MRC), for performance analysis, show that the proposed method improves diversity, i.e. reliability, without deterioration of the average probability of error. Cooperative communication is widely used in consumer wireless communication.
In the literature, cooperative relaying and network coding have been used separately in improving performance of wireless MAC protocols. In this paper, we propose a novel scheme that combines both cooperative relaying...
详细信息
In the literature, cooperative relaying and network coding have been used separately in improving performance of wireless MAC protocols. In this paper, we propose a novel scheme that combines both cooperative relaying and network coding for further performance improvement. The proposed scheme considers two challenges of network-coded cooperative MAC operating in a realistic wireless network. First, links in realistic networks inherently operate with different data rates due to varying channel conditions and distances between the nodes. Existing works do not consider this issue and consequently the coding advantage is not fully harnessed. In our proposed scheme, we integrate both network coding and multi-rate issues as a single optimization problem. Second, network coding used in existing works require costly and reliable feedback in order to harness the gain. Since realistic links are unreliable in nature, our proposed scheme uses a cyclic coding method instead of the traditional XOR coding. Our results show that the proposed scheme can achieve a gain that is two times greater than a non-cooperative scheme.
network coding is one of the most promising techniques to increase the reliability and reduce the energy consumption for wireless sensor networks (WSNs). However, most of the previous works mainly focus on the network...
详细信息
network coding is one of the most promising techniques to increase the reliability and reduce the energy consumption for wireless sensor networks (WSNs). However, most of the previous works mainly focus on the network coding for multi-cast or uni- cast in WSNs, in spite of the fact that the converge-cast is the most common communication style in WSNs. In this paper, we investigate, for the first time as far as we know, the feasibility of acquiring network coding benefits in converge-cast, and we present that with the ubiquitous convergent structures self-organized during converge-casting in the network, the reliability benefits can be obtained by applying linear network coding. We theoretically derive the network coding benefits obtained in a general convergent structure, and simulations are conducted to validate our theoretical analysis. The results reveal that the network coding can improve the network reliability considerably.
Distributing data items such as pictures and videos about traffic conditions at a location a driver wants to go through Vehicular Ad hoc networks (VANETs) poses a great challenge due to network dynamics and high-speed...
详细信息
Distributing data items such as pictures and videos about traffic conditions at a location a driver wants to go through Vehicular Ad hoc networks (VANETs) poses a great challenge due to network dynamics and high-speed mobility. In the last decade, random network coding (RNC) has been shown to support content distribution efficiently in such dynamic environments. Our goal is designing a method for continuously providing location-dependent information generated by vehicles to other vehicles being driven near the birthplace of a data item with short delays and low data delivery traffic using VANETs. So far, we have proposed a scheme called R2D2V (RNC-based Regional Data Distribution on VANETs), a rapid and reliable data dissemination method using random network coding in such a situation. R2D2V can achieve a high data delivery ratio for vehicles driving near the birthplace of the information with low data delivery traffic and short delays when the vehicle density is high. However, this scheme cannot achieve a high delivery ratio for vehicles newly coming to the birthplace of the information after the information has been generated. In this paper, we propose new schemes to mitigate the drawback of R2D2V. Our new schemes distribute a data item encoded by RNC to all vehicles driving near the birthplace of the data item by controlling the probability of sending the data in accordance with the elapsed time from data generation, vehicle's moving direction and vehicle's current location. The simulation results show that our proposed schemes can achieve a high delivery ratio for vehicles newly coming near the birthplace of the information with shorter delays and less delivery traffic than R2D2V.
Decode-and-forward physical layer network coding (PLNC) is one of the promising high-performance techniques for wireless relay networks, but little has been reported on the case of asynchronous senarios. This paper pr...
详细信息
Decode-and-forward physical layer network coding (PLNC) is one of the promising high-performance techniques for wireless relay networks, but little has been reported on the case of asynchronous senarios. This paper presents a channel and delay estimation algorithm along with a detection scheme for Two-Way-Relay-network (TWRN) in Rayleigh block- flat-fading channels. Prefix and suffix training sequences are added for frame-based synchronization and channel estimation. The Cramer-Rao Bound (CRB) is given, and simulations show that the mean square error(MSE) of channel estimation of the proposed scheme could reach the CRB. The end-to-end BER performance is also shown in simulation.
This paper investigates the resource allocation problem to minimize the downlink transmission delay under power constraints for two-way relay transmission using network coding over OFDM channels, where two sources wit...
详细信息
ISBN:
(纸本)9781457720529
This paper investigates the resource allocation problem to minimize the downlink transmission delay under power constraints for two-way relay transmission using network coding over OFDM channels, where two sources with unbalanced traffic exchange their information via a relay node with network coding deployed. Since the explicit solution to this optimization problem is hard to obtain and with extremely high computation complexity even for numerical solution, we propose low-complexity suboptimal algorithms for the problem, where subcarrier assignment is carried out by assuming an equal power distribution at first and then optimal power allocation is executed to minimize the transmission delay. By simulations, the proposed resource allocation scheme is shown to achieve less than 1.01 times the optimal delay and outperform the strategies without network coding in overwhelming majority cases.
This paper tackles the problem of providing end to end reliable transmissions in a randomly deployed wireless sensor network. To this aim, we investigate the simultaneous use of gradient broadcast routing (for its inh...
详细信息
This paper tackles the problem of providing end to end reliable transmissions in a randomly deployed wireless sensor network. To this aim, we investigate the simultaneous use of gradient broadcast routing (for its inherent adaptability to any network topology and its changes), fountain codes (for their universal property) and intra-flow network coding (to introduce packet diversity in redundant copies). We present the impact of the proposed XLT-GRAB strategy on a realistic network. This work permits to highlight that, compared to basic gradient broadcast routing, the strategy not only improves the reliability and the delay in the network but also clearly increases its lifetime.
暂无评论