Search

Based on the partially observable Markov decision process, this paper investigates spectrum access in cognitive networks and proposes an optimal spectrum access algorithm to maximize the throughput. The suboptimal solution to the optimal spectrum access strategy is given by use of the greedy algorithm. In order to achieve the optimal channel access, the channel access state of authorized users is estimated according to the historical information of spectrum sensing. Simulation results show that the optimal spectrum access algorithm would make the secondary users achieve a higher throughput and the networks have the higher spectrum utilization. Compared with the random access and the optimal cognitive MAC protocol, the optimal spectrum access algorithm would improve the throughput by 25–40% and 8–12%, respectively.

We develop a secure random linear network coding scheme on wiretap networks where a wiretapper can only eavesdrop on a limited number of channels. On one hand, by refining Lima's "locked coefficien ...

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 1 n n .