Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite...
详细信息
Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and minimum distance is and how to construct the optimal constant-dimension code (or codes) that achieves the maximal cardinality both remain open research problems. In this paper, we introduce a new approach to solving these two problems. We first establish a connection between constant-rank codes and constant-dimension codes. Via this connection, we show that optimal constant-dimension codes correspond to optimal constant-rank codes over matrices with sufficiently many rows. As such, the two aforementioned problems are equivalent to determining the maximum cardinality of constant-rank codes and to constructing optimal constant-rank codes, respectively. To this end, we then derive bounds on the maximum cardinality of a constant-rank code with a given minimum rank distance, propose explicit constructions of optimal or asymptotically optimal constant-rank codes, and establish asymptotic bounds on the maximum rate of a constant-rank code.
The network communication scenario where one or more receivers request all the information transmitted by different sources is considered. We introduce the first polynomial-time (in network size) network codes that ac...
详细信息
ISBN:
(纸本)9781424482641
The network communication scenario where one or more receivers request all the information transmitted by different sources is considered. We introduce the first polynomial-time (in network size) network codes that achieve any point inside the rate-region for the problem of multiple-source multicast in the presence of malicious errors, for any fixed number of sources. Our codes are fully distributed and different sources require no knowledge of the data transmitted by their peers. Our codes are "end-to-end", that is, all nodes apart from the sources and the receivers are oblivious to the adversaries present in the network and simply implement random linear network coding.
In this paper, we investigate the impact of networkcoding at the relay node on the stable throughput rate in multicasting cooperative wireless networks. The proposed protocol adopts network-level cooperation, as in c...
详细信息
ISBN:
(纸本)9781424482641
In this paper, we investigate the impact of networkcoding at the relay node on the stable throughput rate in multicasting cooperative wireless networks. The proposed protocol adopts network-level cooperation, as in contrast to the traditional physical layer cooperative protocols;and in addition, it uses random linear network coding at the relay node. The traffic is assumed to be bursty and the relay node forwards its packets during the idle periods of the source which allows better utilization of channel resources. Our results show that cooperation leads to higher stable throughput rates than conventional retransmission policies. Moreover, the use of random linear network coding at the relay can further enhance the stable throughput with increasing networkcoding field size or increasing the number of packets over which encoding is performed.
Due to fading and interference, data transmission via wireless links may sometimes be prone to error. For some applications in wireless sensor networks, it is of interest to monitor the link status and infer the packe...
详细信息
ISBN:
(纸本)9781424456383
Due to fading and interference, data transmission via wireless links may sometimes be prone to error. For some applications in wireless sensor networks, it is of interest to monitor the link status and infer the packet loss rate. It has been shown that randomized networkcoding can improve the reliability of wireless sensor networks with lossy links. With networkcoding, the loss rate of a chosen path in a wireless sensor network is the maximum link loss rate among all the links in that path. This behavior changes the link identification problem and imposes challenges on the link loss inference. In this paper, we study the passive loss tomography problem in coded packet wireless sensor networks. We show that by inspecting the content of the coded packets at the sink (i.e., destination), one can estimate the path loss rates not only from the source nodes but also from various intermediate nodes to the sink. By utilizing such information at the sink, we determine the set of links whose loss rates can be identified. We propose a passive loss inference with random linear network coding (PLI-RLC) algorithm to estimate the link loss rates. Results show that in coded packet wireless sensor networks, our proposed algorithm can identify the status of a higher number of links compared to a Bayesian inference algorithm.
By studying the intrinsic mechanism of linearnetworkcoding, this paper proposes a concept of generation and extension between two coding schemes at different multicast rates. We find out that a coding scheme at lowe...
详细信息
ISBN:
(纸本)9780769535579
By studying the intrinsic mechanism of linearnetworkcoding, this paper proposes a concept of generation and extension between two coding schemes at different multicast rates. We find out that a coding scheme at lower multicast rate is a generation of one at higher multicast rate, and a coding scheme at higher multicast rate is an extension of one at lower multicast rate. Moreover, we rind out a determinate relationship between channels' global encoding vectors under two generation-extension coding schemes. Furthermore, by combining with random linear network coding, several important properties are derived, which are helpful to implement linearnetworkcoding for single-source multicast network. Some related applications are enumerated.
In this paper a cluster head election problem is studied for a cooperative wireless network. The nodes in the cluster use random linear network coding to enhance the throughput performance in spreading the data for a ...
详细信息
ISBN:
(纸本)9781424459353
In this paper a cluster head election problem is studied for a cooperative wireless network. The nodes in the cluster use random linear network coding to enhance the throughput performance in spreading the data for a file download service. Some of the nodes in the cluster will access through their cellular link parts of a file to be exchanged among all the cooperative nodes. In such a wireless environment, networkcoding enhances significantly the throughput performance. A good choice of the nodes acting as information sources for the cluster depends on their position and cellular link throughput and turns to be of utmost importance for the achievement of high performance levels. Therefore, a cluster head election algorithm is needed, which shall be fast in converging to either the optimal or, alternatively, a satisfactory sub-optimal solution. We propose to use the evolutionary theory. Results of our investigations are introduced with reference to a high performing implementation of a genetic algorithm under different network conditions both in static and in mobile environments.
In resource constrained wireless sensor networks (WSN), it is highly desirable to make efficient use of available buffer. Hence for the WSN designed for the monitoring applications, buffer management is a key requirem...
详细信息
ISBN:
(纸本)9781424438228
In resource constrained wireless sensor networks (WSN), it is highly desirable to make efficient use of available buffer. Hence for the WSN designed for the monitoring applications, buffer management is a key requirement at sensor nodes. We have proposed an efficient buffer management scheme based on random linear network coding as the in-network processing on data packets. With buffer allocation from source to sink path, our scheme distributes the buffer requirement among the nodes on the path. Further in the case of a packet loss, the proposed scheme recovers packet from available information distributed on the path from source to sink. We have compared our scheme with conventional buffer management scheme. Results show that networkcoding based buffer management scheme has better buffer availability with less redundancy and reduced loss recovery cost.
暂无评论