While original network coding is proposed over the data link layer, recent work suggests that it can also be implemented on the physical layer. In fact it is more natural for wireless networks because of its omnidirec...
详细信息
While original network coding is proposed over the data link layer, recent work suggests that it can also be implemented on the physical layer. In fact it is more natural for wireless networks because of its omnidirectional transmission. In this paper, we investigate the symbol-error-rate (SER) for binary phase-shift keying (BPSK) and quadrature phase-shift keying (QPSK), but the approaches can be generalized to other constellation schemes. The closed-form SER results are derived for physical layer network coding over AWGN channels. The theoretical analysis is also validated by numerical simulation.
Code updates, such as those for debugging purposes, are frequent and expensive in the early development stages of wireless sensor network applications. We propose AdapCode, a reliable data dissemination protocol that ...
详细信息
Code updates, such as those for debugging purposes, are frequent and expensive in the early development stages of wireless sensor network applications. We propose AdapCode, a reliable data dissemination protocol that uses adaptive network coding to reduce broadcast traffic in the process of code updates. Packets on every node are coded by linear combination and decoded by Gaussian elimination. The core idea in AdapCode is to adaptively change the coding scheme according to the link quality. Our evaluation shows that AdapCode uses up to 40% less packets than Deluge in large networks. In addition, AdapCode performs much better in terms of load balancing, which prolongs the system lifetime, and has a slightly shorter propagation delay. Finally, we show that network coding is doable on sensor networks in that (i) it imposes only a 3 byte header overhead, (ii) it is easy to find linearly independent packets, and (3) Gaussian elimination needs only 1 KB of memory.
This paper proposes a new ring structure of network coding (RSNC) based on existing network coding topology, enlarging the field of application and reducing the complexity of coding. On the basis of real-time monitori...
详细信息
This paper proposes a new ring structure of network coding (RSNC) based on existing network coding topology, enlarging the field of application and reducing the complexity of coding. On the basis of real-time monitoring and dynamic allocation for network bandwidth, RSNC is applied to the CERNET backbone network. The route of the packet is decided by the source node when it sends data packet and it is written into the packet header. The intermediate node retransmits following this route. When the network topology changes, the whole network topology will be updated, and the sparse routing tree of the whole network will be sent. Hence, each node knows the connection relationship of the whole network. NS simulation result indicates that utilization of the ring topology structure we proposed can realize the network coding and improve the network throughput rate and utilization rate of bandwidth.
We propose an efficient solution to minimize the network coding resources which refers to the coded links with throughput *** this proved NP-hard problem,genetic algorithm has showed great superiority for better solvi...
详细信息
We propose an efficient solution to minimize the network coding resources which refers to the coded links with throughput *** this proved NP-hard problem,genetic algorithm has showed great superiority for better solving ***,due to its own high constraints of throughput,there exist too many infeasible solutions over the entire search space while using the binary encoding for genetic algorithm,which provides more difficulties to search the optimal *** tackle this problem more efficiently,we construct a completely different solution space which is based on the end-to-end routings from the source to all the *** newly constructed search space just contains those solutions subjected to the required rate constraints and generally has a smaller size compared with binary encoding *** order to speed up the search process,an excellent local search procedure has also been designed for each feasible *** results over four topologies show significant improvements in terms of the ability to get the optimal solution and the algorithmic convergence speed.
This paper proposes a novel network-coded cooperation scheme in mobile satellite communication *** scenario under consideration is one which two "partner"-Terminal A and Terminal B- cooperate in transmitting...
详细信息
ISBN:
(纸本)9781612848334
This paper proposes a novel network-coded cooperation scheme in mobile satellite communication *** scenario under consideration is one which two "partner"-Terminal A and Terminal B- cooperate in transmitting information to a single destination;Each partner transmits both locally generated information and adaptive information that is formed based on the observed information from the other partner.A key observation is that when one partner knows the other partner’s local information,it can exploit that knowledge in the next transmission to improve the BER of the *** leads to an encoding scheme in which each partner transmits the algebraic superposition of its local and the other information,and the superimposed codeword is interpreted differently at the two partners based on their different a priori *** at the destination is then carried on by iterating between the codewords from the two *** is shown via simulation that the proposed scheme provides substantial coding gain over other techniques,including those based on time multiplexing and signal superposition.
network coding (NC) is a new paradigm in data transport and promises to change many aspects of networking. Starting with an introduction to basic NC concepts and results, this paper reviews the state of the art on a n...
详细信息
network coding (NC) is a new paradigm in data transport and promises to change many aspects of networking. Starting with an introduction to basic NC concepts and results, this paper reviews the state of the art on a number of topics and points out promising research directions.
In this paper, we consider a dynamic network coding scheme with opportunistic relay (DNC-OR) for multiple sources multiple relays networks. In DNC-OR, all of the source transmit one's own data one by one. The sele...
详细信息
In this paper, we consider a dynamic network coding scheme with opportunistic relay (DNC-OR) for multiple sources multiple relays networks. In DNC-OR, all of the source transmit one's own data one by one. The selected relay dynamically applies network coding according to whether the source-destination channel from suffers an outage and sends the network-coded data to the destinations. Assume that (denoted as F) the data received from other resources by each destination are reliable, under assumption F and in case the assumption F does not exist, theoretical and numerical results show that DNC-OR can provide superior system outage performance to the network-coded cooperation scheme with dynamic coding mechanism (DC-NCC) proposed by Cong Peng and yields a full diversity order of N + 1 , where N is the number of relay nodes. When the assumption F does not exist, we propose a dynamic network coding (DNC) scheme. The relay takes different actions according to different feedback message. For a network consist of a relay and two source-destination pairs, it is shown that DNC achieves superior diversity-multiplexing tradeoff to conventional cooperation(CC) by theoretical analysis and numerical results. Moreover, DNC-OR can significantly decrease system outage probability.
Data broadcast is widely deployed to realize bandwidth efficiency in a mobile computing environment. However, traditional data broadcasting assumes that mobile users can only retrieve one data item in each time slot. ...
详细信息
Data broadcast is widely deployed to realize bandwidth efficiency in a mobile computing environment. However, traditional data broadcasting assumes that mobile users can only retrieve one data item in each time slot. Therefore, the above constraint leads to access conflicts and requires the mobile users to wait until the next broadcast cycle to retrieve the requested information. In this paper, we propose a novel data broadcasting framework that adopts network coding with the stored data items in users. In our approach, a server encodes multiple data items in each time slot, while each mobile user is able to retrieve the data item by decoding the encoded data items with the locally stored data items. We propose an algorithm to generate the broadcast program to minimize the average access time. In addition, our algorithm can avoid coding redundant data in each time slot to reduce access delay. Our simulation results show that our algorithm can reduce the access time by 56% as compared to no coding scheme.
network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffers as the decoding procedure requires buff...
详细信息
ISBN:
(纸本)9781424435128
network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffers as the decoding procedure requires buffering and is performed in batches of coded packets, and unfairness prevails in terms of delay increases between receivers with worse channel conditions and those with better channel conditions. In this paper, we focus on optimizing the delay performance in reliably multicasting a data stream to a set of one-hop receivers from the receiver perspective. We analyze the system based on queueing theory using semi-Markov chains from both the system-wide and receiver perspectives. We find that the average delay per received packet at the receivers' end can be minimized by appropriate scheduling of data packets and appropriate size of the coding buffer, which depends on the rate of incoming data stream and capacities of the receivers. To circumvent unduly computational complexities, we design a heuristic scheme which can achieve significant performance gain when compared to an existing method. Our scheme readily adapts the coding size to the dynamics of the system, and schedules data packets to be coded via some strict priority measure for optimized delay performance. We show through extensive simulations that our scheme gives low average delay at high streaming rates and narrows the performance gap between receivers with bad and good channel conditions.
Broadcasting with network coding mixes different packets to minimize the number of transmissions, which improves the energy efficiency of wireless networks. On the other hand, delaying the transmissions increases codi...
详细信息
ISBN:
(纸本)9781467309202
Broadcasting with network coding mixes different packets to minimize the number of transmissions, which improves the energy efficiency of wireless networks. On the other hand, delaying the transmissions increases coding opportunities at the intermediate nodes, but increases the delay of the packets. In this paper, we consider these two contradicting factors and study the problem of minimizing the number of transmissions in wireless networks while meeting the deadlines of different packets. We show that this problem is NP-complete;therefore, we provide a heuristic to solve the problem. First, we construct broadcasting trees, each of them rooted at one source. We then specify overlapping conditions based on the constructed trees to determine the number of transmissions each node has to perform without the deadline constraints. Then, we partition the set of packets such that coding is performed among the packets of the same partition, which does not result in deadline misses. Our simulation results show that our technique not only reduces the number of transmissions, but also allows the majority of the nodes to receive their packets on time.
暂无评论