Betweenness Based Self-adaptive Relay Station Selection Algorithm in Cooperative Communication
Analysis of real communication network’s information transmission performance especially in WSN (Wireless Sensor Network) has always been the research hotpots of wireless network communication efficiency. In this article, four different node fault generation policies are adopted on network datasets including real communication networks and simulated networks to test network’s resilience. Experiments focus on the relationship between fault nodes and network structure indications .It is found that betweenness based strategy is more harmful to network structure related to network’s information transmission performance. After modifying traditional WSN relay station select algorithm, the self-adaptive relay station selection algorithm in cooperative communication based on node’s betweenness is proposed in this arcitle to promote information transmit efficiency in WSN in the time of information transmit and decrease transmit time.
KeywordsWSN Self-Adaptive Betweenness Routing Selecting Algorithm Cooperative Communication
Unable to display preview. Download preview PDF.
- 1.Subramanian, M.: Network Management principles and practices, pp. 562–563. High Education Press (2002)Google Scholar
- 11.Zhao, Y., Adve, R., Lim, T.J.: Improving amplify-and-forward relay networks: optimal power allocation versus selection. IEEE Trans. Wireless Commun. 6(8), 3114–3123 (2007)Google Scholar
- 12.Ikki, S.S., Ahmed, M.H.: Performance analysis of generalized selection combining for amplify-and-forward cooperative-diversity networks. In: IEEE International Conference on Communications, ICC, Dresden, Germany (June 2009)Google Scholar
- 13.Jing, Y., Jafarkhani, H.: Single and Multiple Relay Selection Schemes and their Diversity Orders. IEEE Trans. Wireless Commun., 1414–1423 (March 2009)Google Scholar