无线多跳网络中分簇算法的研究进展和未来前瞻
The Research Progress and Future Perspective of Clustering Algorithm for Wireless Multi-Hop Network

作者: 高 莹 , 倪梁方 , 陈建建 :安徽工业大学电气与信息工程学院,马鞍山;

关键词: 移动Ad-hoc网络多跳协同分集分簇Mobile Ad-hoc Network Multi-Hop Cooperative Diversity Clustering

摘要:
受干扰、衰落、多径、路径损耗和阴影等因素制约,当移动Ad-hoc网络中两个节点间的距离较远时,两者间通过单跳方式无法保证高质量的可靠通信。若在该网络中通过节点分簇建立多跳虚拟天线阵列,实现协同分集,就可以有效应对上述不利影响。本文从静态和动态两个方面,在研究了基于信噪比和基于维特比算法分簇方案的基础上,进一步探讨了动态分簇对利用编码存储互信息的需求,详细分析了分簇方案的特性,并依据现阶段分簇技术在理论和实践两方面取得的主要成果及二者之间的本质联系,对未来的研究和探索提出了建议。

Abstract: The extremely poor performance owns to interference, attenuation, multi-path, path loss and shadowing. It makes it impossible to guarantee the quality and the reliability of the single hop communication between two nodes with long distance in mobile Ad-hoc network. The cooperative diversity could be achieved to counterbalance the above affects, once the multi-hop virtual mul-ti-antenna system was implemented with the aid of clustering the nodes. In terms of the static and dynamic clustering, this paper analyzed the characteristics of clustering schemes, according to the exploration of the mutual information accumulation with the aid of distributed space-time coding for dynamic clustering, in the light of the investigation of clustering schemes based on signal to noise ratio and Viterbi algorithm. On the basis of current achievement on theory and practice of clustering techniques and their essential relation, the proposals for future research and develop-ment were presented.

文章引用: 高 莹 , 倪梁方 , 陈建建 (2014) 无线多跳网络中分簇算法的研究进展和未来前瞻。 自然科学, 2, 50-57. doi: 10.12677/OJNS.2014.24008

参考文献

[1] Liu, L.Y. (2012) Cluster-Based Cooperative Communications and Relay Selection in Wireless Networks. 1st IEEE In-ternational Conference on Communication in China, Beijing, 15-17 August 2012, 654-659.

[2] Bastami, A.H. (2010) Optimal SNR-Based Selection Relaying Scheme in Multi-Relay Cooperative Networks with Distributed Space-Time Coding. IET Communications, 4, 619-630.

[3] Bash, B.A. (2011) Clustering in Cooperative Networks. Mini-Conference at IEEE INFOCOM, Shanghai, 10-15 April 2011, 486-490.

[4] You, Q.M., Chen, Z. and Li, Y.H. (2013) A Multi-Hop Bidirectional Relay Selection Scheme Based on Viterbi Algorithm, Communications Theory Workshop (AusCTW), Adelaide, 29 January-1 February 2013, 170-174.

[5] You, Q.M. and Li, Y.H. (2012) A near Optimal Routing Scheme for Multi-Hop Relay Networks Based on Viterbi Algorithm. Wireless Communications Symposium. IEEE ICC, 2012, Ottawa, 10-15 June 2012, 4531-4536.

[6] Zeb, A., Islam, A.K.M.M., Komaki, S. and Baharun, S. (2014) Multi-Nodes Joining for Dynamic Cluster-Based Wireless Sensor Network. International Confe-rence on Informatics, Electronics & Vision (ICIEV), Dhaka, 23-24 May 2014, 1-6.

[7] Liu, R.H., Spasojevic, P. and Soljanin, E. (2008) Incremental Redundancy Cooperative Coding for Wireless Networks: Cooperative Diversity, Coding, and Transmission Energy Gains. IEEE Transactions on Information Theory, 54, 1207- 1224.

[8] Zhao, B. and Valenti, M.C. (2005) Practical Relay Networks: A Generalization of Hybrid-ARQ. IEEE Journal on Selected Areas in Communications, 23, 7-18.

[9] Wicker, S.B. (1995) Error Control Systems for Digital Communication and Storage. Prentice Hall, Upper Saddle River.

[10] Luby, M. (2002) Lt Codes. The 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, 16-19 November 2002, 271-282.

[11] Luby, M., Shokrollahi, A., Watson, M. and Stockhammer, T. (2007) Raptor forward error correction scheme for object delivery. IETF RFC 5053.

[12] Draper, S.C., Liu, L., Molisch, A.F. and Yedidia, J.S. (2008) Routing in cooperative wireless networks with mutual-information accumulation. Proceedings of the IEEE International Conference on Communications (ICC), Beijing, 19-23 May 2008, 4272-4277.

[13] Molisch, A.F., Mehta, N.B., Yedidia, J.S. and Zhang, J. (2007) Performance of fountain codes in collaborative relay networks. IEEE Transactions on Wireless Communications, 6, 4108-4119.

[14] Draper, S.C., Liu, L.J., Molisch, A.F. and Yedidia, J.S. (2010) Cooperative transmission for wireless networks using mutual-information accumulation. IEEE Transactions on Information Theory, 57, 5151-5162.

[15] Laneman, J.N., Tse, D.N.C. and Wornel, G. (2004) Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50, 3062-3080.

[16] Laneman, J.N. and Wornell, G. (2003) Distributed space-time coded protocols for exploiting cooperative diversity in wireless networks. IEEE Transactions on Information Theory, 49, 2415-2425.

[17] Janani, M., Hedayat, A., Hunter, T. and Nosratinia, A. (2004) Coded cooperation in wireless communications: Space- time transmission and iterative decoding. IEEE Transactions on Signal Processing, 52, 362-371.

[18] Sarkiss, M., Othman, G.R.B., Damen, M.O. and Belfiore, J.-C. (2011) Construction of new delay-tolerant space-time codes. IEEE Transactions on Information Theory, 57, 3567-3581.

[19] Liu, Y., Xia, X.-G. and Zhang, H.L. (2013) Distributed linear convolutional space-time coding for two-relay full-dup- lex asynchronous cooperative networks. IEEE Transactions on Wireless Communications, 12, 6406-6417.

[20] Liu, Y., Xia, X.-G. and Zhang, H.L. (2012) Distributed space-time coding for full-duplex asynchronous cooperative communications. IEEE Transactions on Wireless Communications, 11, 2680-2688.

[21] Guo, X.Y. and Xia, X.-G. (2008) Distributed Linear Convolutive Space-Time Codes for Asynchronous Cooperative Communication Networks. IEEE Transactions on Wireless Communications, 7, 1857-1861.

分享
Top