Wireless network is affected by hidden terminal problem. Throughput will decrease when there is hidden terminal in the networks. Inspired by ZigZag,the paper propose a solution based on analogy network coding——CTEBANC (Collision time estimate based on analogy network coding). In CTEBANC,AP terminal decodes overlay data caused by collision,and receives message correctly. CTEBANC combine advantage of RTS/CTS and ZigZag,increase the throughput of networks and enhance the usage of wireless resource. And simulation results validate efficiency of CTEBANC in resolving hidden terminal problem.

Network coding is designed for wireless networks to improve reliability and throughput. In practical wireless network coding schemes,information is always divided into blocks,and the processing of network coding is carried out within blocks. Size is always the crucial issue during the transmission time of blocks. In the current network coding schemes,the size of a block has to be decided before transmission. If the pre-decided size is too big,block delay may become intolerable. In this paper,the object function of a block size estimation algorithm is firstly introduced,and then,an adaptive algorithm of block size choice for delay-sensitive applications is designed. And the tradeoff between block delay and throughput is discussed. By adjusting the sizes of blocks in wireless networks adaptively,this algorithm can satisfy the block delay requirements of the applications when the network coding scheme is running.

To make the wireless network coding scheme fit for large data transmission well, the processing of dividing data into blocks is added into the scheme. After the analyzing the transmission model of the blocks, it is found that channel uti-lization and the size of the block is closely related. In order to transmit the data with an appropriate block size to get higher channel utilization, a block size selection approach is given to maximize the channel utilization. The approach is simple and feasible, and by the simulations, after using this approach, the channel utilization will be very close to its upper limit.

The paper studies the probability of applications of network coding in cognitive radio. Network coding can de-crease the probability of collision between second users and primary users, and increase the real throughput of wireless net-works in cognitive radio environment. At last, simulation results validate efficiency of applications of network coding in cognitive radio systems.

Network coding has been designed for wireless networks to improve the capabilities of throughput, reliability, and routing by mixing information from different flows and conveying more information in each transmission. If packets are coded by blocks with large sizes, time-sensitive applications in wireless network will suffer from high latency between blocks caused by intrasession coding scheme. In this paper, a block latency model in coding scheme is derived, and then four latency estimation algorithms are introduced which are used for choosing a proper block size to satisfy the need of time-sensitive applications. Simulations results show that Kalman filter has a better performance than the others.

Through studying the spectrum assignment problem in cognitive radio,analyzing the effect of pulse and coupling in pulse coupled neural networks(PCNN),and studying the effect of the holding-time of primary users,a spectrum assignment algorithm based on improved PCNN is proposed in this paper,which shortens the spectrum span in avoiding frequency interference,and increases the throughput of second users without disturbing primary users by considering the effect of the holding-time in cognitive radio.

A coding scheme for unicast over lossy packet wireless networks is presented in this paper. In the scheme, intermediate nodes perform additional coding and send out coded packets by broadcasting in subnet which is called hyperpath, whenever they have a transmission opportunity. We show that the scheme gains reliability by spatial diversity, and network coding scheme.

Network coding has been designed for wireless networks to improve the capabilities of throughput, reliability, and routing by mixing information from different flows and conveying more information in each transmission. If packets are coded by blocks with large sizes, time-sensitive applications in wireless network will suffer from high delay between blocks caused by intra-session coding scheme. In this paper, a block delay model in coding scheme is derived, and then four delay estimation algorithms are introduced which are used for choosing a proper block size to satisfy the need of time-sensitive applications. The algorithm performs with low complexity and precision controllable.