Delay linear network coding (DLNC) is the problem of network coding, in which coding operation takes time. A coherent DLNC network, where coding operation at each node takes 1 unit time, can be modeled as a linear tim...
详细信息
ISBN:
(纸本)9781509015733
Delay linear network coding (DLNC) is the problem of network coding, in which coding operation takes time. A coherent DLNC network, where coding operation at each node takes 1 unit time, can be modeled as a linear time invariant (LTI) system. Based on the Gauss Jordan elimination, we develop an algorithm to reconstruct source processes and introduce new concepts, which are decoding delay and transmission rate. The network error control problem in such networks can be done by extending the classical network error-correcting code (NEC). We construct a DLNC based linear operation channel (LOC) and apply the distance measure proposed in the previous works to our LOC. It turns out that extension of classical NEC works well for the case of DLNC. We also develop a codebook design algorithm, which achieves maximum possible size.
How to extend network’s lifetime is one of the most important problem in the Wireless Sensor networks(WSNs). network’s Lifetime is directly dependent on node inside the area, especially the node nearl
ISBN:
(纸本)9781467389808
How to extend network’s lifetime is one of the most important problem in the Wireless Sensor networks(WSNs). network’s Lifetime is directly dependent on node inside the area, especially the node nearl
In bidirectional relaying using Physical Layer network coding (PLNC), it is generally assumed that users employ same modulation schemes in the Multiple Access phase. However, as observed by Zhang et al., it may not be...
详细信息
ISBN:
(纸本)9781538635315
In bidirectional relaying using Physical Layer network coding (PLNC), it is generally assumed that users employ same modulation schemes in the Multiple Access phase. However, as observed by Zhang et al., it may not be desirable for the nodes to always use the same modulation schemes, particularly when node-relay channels are not equally strong. Such a scheme is called Heterogeneous PLNC. However, the above approach uses the computationally intensive Closest Neighbour Clustering algorithm to find the network coding maps to be applied at the relay. Also, the treatment is specific to certain cases of heterogeneous modulations. In this paper, we show that, when users employ heterogeneous symmetric-PSK modulations, the network coding maps and the mapping regions in the fade state plane can be obtained analytically. Performance results are provided in terms of relay error rate and bit error rate.
The intra-chip communication latency and power consumption become the main bottleneck of the development of multi-core processors. network-on-Chip (NoC) paradigm is proposed to meet these stringent requirements. Since...
详细信息
ISBN:
(纸本)9781509039449
The intra-chip communication latency and power consumption become the main bottleneck of the development of multi-core processors. network-on-Chip (NoC) paradigm is proposed to meet these stringent requirements. Since the wireless network interconnection can achieve high speed data transmission with low power consumption, this paper proposes a cellular NoC architecture based on multiple butterfly network coding clusters with low latency. Data packets and control packets are transmitted on the wireless channel and the wired channel, separately. We also design a Z-X-Y path routing algorithm to achieve the shortest routing. Experiment results prove that, compared with Mesh, the proposed architecture can achieve at least 8% average latency reduction with slight resource increment.
Wireless Mesh network is an answer to the last mile problem. It offers easy deployment and provides coverage over large area with fewer wires. Nevertheless, its limited throughput is inadequate for next generation app...
详细信息
Wireless Mesh network is an answer to the last mile problem. It offers easy deployment and provides coverage over large area with fewer wires. Nevertheless, its limited throughput is inadequate for next generation applications. Motivated by its features and advantages, we propose a solution to mitigate this problem of limited throughput by leveraging the broadcast nature of the wireless medium. In particular, network coding, spatial diversity and opportunistic routing/forwarding capitalize on the broadcast nature of the wireless links to improve the network performance. These techniques target different network conditions and usually are considered in separation. In this thesis a cross-layer based integration of the mentioned three techniques is presented to accumulate their potential gains using the same network protocol stack in wireless mesh networks. The proposed integration approach is based on a new CDARM metric (coding opportunity and Data rate Aware Routing Metric) used for the route selection and a method for creating relay links at the MAC layer. In particular to leverage on the broadcast nature we developed a cooperative protocol, based on link creation at the MAC layer that introduces opportunism into the cooperative protocol. Based on this cooperative protocol and the routing metric, we integrate the network coding mechanism. Then we introduce cooperation between the network and MAC layers. The numerical study, based on the system level simulation results, shows significant improvement of the integrated protocol performance in terms of network throughput and reliability over the individual mechanisms. To the best of our knowledge this dissertation is the first attempt to integrate network coding, spatial diversity and opportunistic routing/forwarding mechanisms in the same protocol stack. The integrated protocol requires modifications into the network protocol stack that can be easily incorporated in future generation devices.
With the requirement of real-time and reliability on monitoring power transmission lines, this paper proposes a cooperative communication protocol with network coding in long- chain wireless sensor networks (WSN). The...
详细信息
ISBN:
(纸本)9781538620625
With the requirement of real-time and reliability on monitoring power transmission lines, this paper proposes a cooperative communication protocol with network coding in long- chain wireless sensor networks (WSN). The protocol makes full use of channel broadcast characteristics and cooperative communication. It applies the classical butterfly structure of network coding among the successive three hops in the chain network. The opportunistic routing and network coding in the protocol obtain the receiving diversity gain and the coding gain for the long-chain topology of transmission line. Performance analysis and simulation results show that the proposed protocol improves the reliability of data transmission and system throughput.
We study the problem of designing secure network coding signatures in the network with multiple sources. At present, there exists some multi-source homomorphic network coding signatures in the random oracle model. But...
详细信息
ISBN:
(数字)9783319571867
ISBN:
(纸本)9783319571867;9783319571850
We study the problem of designing secure network coding signatures in the network with multiple sources. At present, there exists some multi-source homomorphic network coding signatures in the random oracle model. But there are still no multi-source homomorphic network coding signatures in the standard model. How to construct it remains an open problem. In this paper, we propose the first multi-source homomorphic network coding signature in the standard model.
network coding is a fundamental tool that enables higher network capacity and lower complexity in routing algorithms, by encouraging the mixing of information flows in the middle of a network. Implementing network cod...
详细信息
ISBN:
(纸本)9781538617915
network coding is a fundamental tool that enables higher network capacity and lower complexity in routing algorithms, by encouraging the mixing of information flows in the middle of a network. Implementing network coding in the core Internet is subject to practical concerns, since Internet routers are often overwhelmed by packet forwarding tasks, leaving little processing capacity for coding operations. Inspired by the recent paradigm of network function virtualization, we propose implementing network coding as a new network function, and deploying such coding functions in geo-distributed cloud data centers, to practically enable network coding on the Internet. We target multicast sessions (including unicast flows as special cases), strategically deploy relay nodes (network coding functions) in selected data centers between senders and receivers, and embrace high bandwidth efficiency brought by network coding with dynamic coding function deployment. We design and implement the network coding function on typical virtual machines, featuring efficient packet processing. We propose an efficient algorithm for coding function deployment, scaling in and out, in the presence of system dynamics. Real-world implementation on Amazon EC2 and Linode demonstrates significant throughput improvement and higher robustness of multicast via coding functions as well as efficiency of the dynamic deployment and scaling algorithm.
Since the first applications of network coding, there has been an increasing interest in this technology due to the promising benefits regarding efficiency. Moreover, network coding already provides a certain level of...
详细信息
ISBN:
(纸本)9781467389990
Since the first applications of network coding, there has been an increasing interest in this technology due to the promising benefits regarding efficiency. Moreover, network coding already provides a certain level of inherent security called algebraic security. Since this inherent security is not sufficient against a stronger attacker, a number of confidential network coding schemes has been developed. However, due to different interpretations of security and different attacker models, it is hard to give quantitative statements about the security and, therewith, to compare two schemes. In this work, we motivate why algebraic security is not enough and discuss the influence of the underlying finite field on the achievable security. Based on these considerations, we describe the bit security of confidential network coding schemes and use this measure to compare the security of selected schemes. Furthermore, we discuss a known-plaintext-attack on confidential network coding schemes and investigate the security of (e) SPOC under this attack. Simulation results confirm our expectations regarding the influence of the knowledge of the attacker. The presented findings are helpful for choosing the right algorithm and parameters in real systems to protect against different attackers.
In this paper are presented the main idea and architecture of Universal Multimedia Access (UMA) and the fundamentals of network coding. A simulation study was conducted for advantages of network coding, compared to co...
详细信息
ISBN:
(纸本)9781538630730
In this paper are presented the main idea and architecture of Universal Multimedia Access (UMA) and the fundamentals of network coding. A simulation study was conducted for advantages of network coding, compared to conventional transmission.
暂无评论