Cooperative spectrum sensing taking into account the error effect on the sensing information reporting is studied. Employing the relay, a novel cooperative spectrum sensing algorithm based on network coding is propose...
详细信息
Cooperative spectrum sensing taking into account the error effect on the sensing information reporting is studied. Employing the relay, a novel cooperative spectrum sensing algorithm based on network coding is proposed by correcting the received sensing information. The efficiency of the algorithm and the method of relay selection are given. The simulation results show that the performance of the novel algorithm is better than cooperative spectrum sensing based on space-time code, and the novel algorithm can meet the situations when destroyed reporting paths exist.
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 this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receive...
详细信息
In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. We combine and extend two ideas that have been developed independently. On one hand, network coding introduces topology-dependent correlation, which can then be exploited at the receivers to infer the topology. On the other hand, it has been shown that a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem can be decomposed into multiple two source, two receiver subproblems. Our first contribution is to show that, when intermediate nodes perform network coding, topological information contained in network coded packets allows to accurately distinguish among all different 2-by-2 subnetwork components, which was not possible with traditional tomographic techniques. Our second contribution is to use this knowledge to merge the subnetworks and accurately reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.
Broadcast nature of wireless networks can be exploited to provide a flexible transmission, especially in multicast service. The potential relay then is capable to participate in message forwarding. This paper presents...
详细信息
Broadcast nature of wireless networks can be exploited to provide a flexible transmission, especially in multicast service. The potential relay then is capable to participate in message forwarding. This paper presents a network coding based cooperative (NCBC) multicast scheme exploiting limited feedback. In the developed NCBC multicast scheme, the source transmits two separate signals to multiple destinations in two successive half slots. The relay may combine the signals if it received two signals correctly and forward it to destinations in the next half slot. The destinations, therefore, can recover signals either from direct transmission or the relay forwarding. In this paper, performance analysis is presented in terms of outage probability and diversity order. It is demonstrated that the NCBC multicast scheme can work better than direct source multicast in terms of outage probability. Meanwhile, the NCBC multicast scheme can achieve full diversity gain (diversity two for one relay case). Comparisons with amplify-and-forward (AF) and selection decode-and-forward cooperation schemes shows that the NCBC multicast scheme achieves almost the same outage performance as AF and selection decode and forward while consuming less bandwidth and energy resources.
We introduce algorithms to design robust network codes in the presence of link failures for multicast in a directed acyclic network. Robustness is achieved through diversity provided by the network links and flows, wh...
详细信息
We introduce algorithms to design robust network codes in the presence of link failures for multicast in a directed acyclic network. Robustness is achieved through diversity provided by the network links and flows, while the maximum multicast rate due to max-flow min-cut bound is maintained. The proposed scheme is a receiver-based robust network coding, which exploits the diversity due to the possible gap of the specific receivers min-cut with respect to the network multicast capacity. An improved version of this scheme guarantees multicast capacity for a certain level of failures. In a multicast session, failure of a flow may not necessarily reduce the capacity of the network as other useful branches within the network could still facilitate back up routes (flows) from the source to the sinks. We introduce a scheme to employ backup flows in addition to the main flows to multicast data at maximum rate h , when possible. In a limiting case, the scheme guarantees the rate h , for all link failure patterns, which do not decrease the maximum rate below h . Here, the number of link failures may in general exceed the refined singleton bound.
The analysis of modulation schemes for the physical layer network-coded two way relaying scenario is presented which employs two phases: Multiple access (MA) phase and Broadcast (BC) phase. Depending on the signal set...
详细信息
The analysis of modulation schemes for the physical layer network-coded two way relaying scenario is presented which employs two phases: Multiple access (MA) phase and Broadcast (BC) phase. Depending on the signal set used at the end nodes, the minimum distance of the effective constellation seen at the relay becomes zero for a finite number of channel fade states referred as the singular fade states. The singular fade states fall into the following two classes: (i) the ones which are caused due to channel outage and whose harmful effect cannot be mitigated by adaptive network coding called the non-removable singular fade states and (ii) the ones which occur due to the choice of the signal set and whose harmful effects can be removed called the removable singular fade states. In this paper, we derive an upper bound on the average end-to-end Symbol Error Rate (SER), with and without adaptive network coding at the relay, for a Rician fading scenario. It is shown that without adaptive network coding, at high Signal to Noise Ratio (SNR), the contribution to the end-to-end SER comes from the following error events which fall as SNR -1 : the error events associated with the removable and nonremovable singular fade states and the error event during the BC phase. In contrast, for the adaptive network coding scheme, the error events associated with the removable singular fade states fall as SNR -2 , thereby providing a coding gain over the case when adaptive network coding is not used. Also, it is shown that for a Rician fading channel, the error during the MA phase dominates over the error during the BC phase. Hence, adaptive network coding, which improves the performance during the MA phase provides more gain in a Rician fading scenario than in a Rayleigh fading scenario. Furthermore, it is shown that for large Rician factors, among those removable singular fade states which have the same magnitude, those which have the least absolute value of the phase angle alone contrib
In this paper, we consider the problem of secure communication over wiretap multicast networks. Noticing that network coding renders the intermediate nodes to mix information from different data flows, we propose a se...
详细信息
In this paper, we consider the problem of secure communication over wiretap multicast networks. Noticing that network coding renders the intermediate nodes to mix information from different data flows, we propose a secure communication scheme based on cryptographic means and network coding. Specifically, we employ a confidential cryptosystem to encrypt the source message packets, then treat the secret key as a message packet and mix the key with the obtained cryptograms. Furthermore, we can prove that, under suitable conditions, the wiretapper is unable to gain the secret key. Meanwhile, the confidential cryptosystem prohibits the wiretapper from extracting meaningful information from the obtained cryptograms. Our scheme doesn't need a private channel to transmit the secret key and enables the utilization of network capacity to reach n-1/n .
Now,wireless mesh network becomes a research *** communicate through more nodes because of the multi-hop ***,the security problems become *** paper proposes an anonymous communication method with multi-paths network c...
详细信息
Now,wireless mesh network becomes a research *** communicate through more nodes because of the multi-hop ***,the security problems become *** paper proposes an anonymous communication method with multi-paths network coding to ensure the anonymity of *** of the information confusion and disguise of network coding,this method combines network coding and multi-path transmission in order to get the anonymous communication between the ***,the dependence on the single data can be brought down and the influence caused by the link failure can be ***,the reliability and anonymity of the system can be *** new model can achieve the confidentiality and anonymity of the communications as well as implement the function of the anonymous communications *** analysis and simulation results show that this method is effective.
Link and node failures are two common fundamental problems that affect operational networks. Hence, protection of communication networks against such failures is essential for maintaining network reliability and perfo...
详细信息
ISBN:
(纸本)9781424463725
Link and node failures are two common fundamental problems that affect operational networks. Hence, protection of communication networks against such failures is essential for maintaining network reliability and performance. network protection codes (NPC) are proposed to protect operational networks against link and node failures. Furthermore, encoding and decoding operations of such codes are well developed over binary and finite fields. Finding network topologies, practical scenarios, and limits on graphs applicable for NPC are of interest. In this paper, we establish limits on network protection design. We investigate several network graphs where NPC can be deployed using network coding. Furthermore, we construct graphs with minimum number of edges suitable for network protection codes deployment.
Two-way relaying is a way of improving the bandwidth efficiency of a half-duplex relay system. In such scenarios, network coding can also be applied to improve the system if there exist sufficient degrees of freedom t...
详细信息
Two-way relaying is a way of improving the bandwidth efficiency of a half-duplex relay system. In such scenarios, network coding can also be applied to improve the system if there exist sufficient degrees of freedom to decode the received messages at the relay node. In this paper, we look at two specific transmission schemes employed at the multi-antenna relay node and analyze their performance by deriving both the upper bounds of their symbol error probability and their diversity order.
暂无评论