No30 Institute Of Cetc
No30 Institute Of Cetc
He X.,PLA Air Force Aviation University |
Liu Y.-J.,PLA Air Force Aviation University |
Bai X.,No30 Institute Of Cetc |
Dai B.,PLA Air Force Aviation University
Nanjing Youdian Daxue Xuebao (Ziran Kexue Ban)/Journal of Nanjing University of Posts and Telecommunications (Natural Science) | Year: 2014
The appropriate channel access technique is the key to improve the network performance. The high frequency (HF) ground-to-air IP network has a large communication coverage and is hard to achieve synchronization. Besides that, the data in air node may get lost. According to these features, a new HF token protocol with reservation (HFTP-R) is designed. A reservation algorithm is put forward to differentiate the prior and common data. And it is implemented in OPNET simulation platform with different parameters. Experimental results show that, the protocol can achieve better reservation success ratio and real-time quality. In addition, the protocol with the prior reservation is faster than that with general reservation technique to access channel. HFTP-R can overcome the possible communication interruption when the HF token protocol (HFTP) is used in HF ground-to-air IP network directly, thus it can satisfy the network requirements. ©, 2014, Journal of Nanjing Institute of Posts and Telecommunications. All right reserved.
Wang L.,Science and Technology on Communication Security Laboratory |
Shen B.,Science and Technology on Communication Security Laboratory |
Qiao T.,No30 Institute Of Cetc
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012
Finding a recurrence of a shift register gives its equivalent shift register in Fibonacci configuration and hence helps to decide whether different nonlinear shift registers are equivalent, i.e., whether they generate the same set of output sequences. We define a dependence graph of a shift register and it is a directed acyclic graph related to the shift register. We show that existence of a dependence graph with a special property of a nonlinear shift register ensures existence of a short recurrence of the sequence generated by the nonlinear shift register. We also present an algorithm to search dependence graphs of a nonlinear shift register. © 2012 Springer-Verlag Berlin Heidelberg.
Li C.,No30 Institute Of Cetc |
Huang Y.,No30 Institute Of Cetc |
Wang H.,No30 Institute Of Cetc |
Niu C.,No30 Institute Of Cetc
International Journal of Multimedia and Ubiquitous Engineering | Year: 2014
When an amount of users are accessing the wireless network with multiple Access Points (APs), a challenge is how to allocate the wireless network resources effectively. A utility function is proposed to evaluate the effectiveness, and a Resource Allocation Algorithm (RAA) is introduced to solve this problem. The algorithm firstly calculates the utility values from a user's request to different available APs. Then it stores the results with request ID and AP ID in a pair. In each allocation time slot, request-AP-utility pairs are arranged in utility value from high to low. Then the available service resources are allocated to the requests properly by a Fast Resource Allocation. Compared with Fair-Method in the same simulation scene, RAA gains 200% performance in delay with only 15% losing of load balance. © 2014 SERSC.