[1] Faccin S M, Wijting C, Kenckt J, et al. Mesh wlan networks: concept and system design[J]. IEEE Journal of Wireless Communications, 2006, 13(2): 10-17.
[2] Pakdehi A, Ashtiani F. A new cross layer design of adaptive modulation and coding in finite buffer wireless links[J]. Future Generation Communication and Networking, 2007(6): 499-504.
[3] Bai X, Shami A. A new perspective of cross-layer optimization for wireless communication over fading channel[J]. Computer Communications and Networks, 2007(12): 1-6.
[4] Pakdehi A, Ashtiani F. Cross-layer optimization of adaptive modulation and coding preserving packet average delay time//IEEE GLOBECOM 2008. New Orleans: IEEE, 2008: 1-5.
[5] Zheng K, Wang Y, Lei L, et al. Cross-layer queuing analysis on multihop relaying networks with adaptive modulation and coding[J]. IET Commun, 2010, 4(3): 295–302.
[6] Cheng P, Yu G D, Zhang Z Y, et al. Cross-layer performance analysis of two-hop wireless links with adaptive modulation//IEEE PIMRC’2006. Helsink, Finland: IEEE, 2006: 1-5.
[7] Liu Q, Zhou S, Giannakis G B. Queuing with adaptive modulation and coding over wireless links: cross-layer analysis and design[J]. IEEE Transactions on Wireless Communications, 2005, 4(3): 1142-1153.
[8] Hong W, Nader M. Finite-state Markov channel-a useful model for radio communication channels[J]. IEEE Transactions on Vehicle Technology, 1995, 44(1): 163-171. (上接第50页)
[5] Elgamal T. A public key cryptosystem and a signature scheme based on discrete logarithms[J]. IEEE Trans Inform Theory, 1985, 31(4): 469-472.
[6] 李子臣, 杨义先. Elgamal多重数字签名方案[J]. 北京邮电大学学报, 1999, 22(2): 30-34. Li Zichen, Yang Yixian. ElGamals multisignature digital signature scheme[J]. Journal of Beijing University of Posts and Telecommunications, 1999, 22(2): 30-34.
[7] Wang D H, Hu Z G, Tong Z J, et al. An identity authentication system based on chebyshev polynomials//1st International Conference on Information Science and Engineering. Nanjing: IEEE Press, 2010: 1648-1650.
[8] Wang X Y , Zhao J F. An improved key agreement protocol based on chaos[J]. Communications in Nonlinear Science and Numerical Simulation, 2010, 15(12): 4052-4057.
[9] Peter L. Montgomery modular multiplication without trial division[J]. Mathematics of Computation, 1985, 44(170): 519-521.
[10] Menezes A J, Van Oorschot P C, Vanstone S A, et al. Handbook of applied cryptography[M]. New York: CRC Press, 1997: 600-603.
[11] Kaya K C, Acar T, Kaliski B S Jr. Analyzing and comparing montgomery multiplication algorithms[J]. IEEE Micro, 1996, 16(3): 26-33.
[12] 陈燕. 一种改进的快RSA密钥生成算法[J]. 重庆邮电大学学报, 2011, 23(4): 500-504. Liu Yan. An improved algorithm for fast RSA key generation[J]. Journal of Chongqing University of Posts and Telecommunications, 2011, 23(4): 500-504. |