Cooperative Node Selection In Mesh Network

In this thesis, we argue for node selection in cooperative decode-and-forward networks. In a single-hop network with multiple relays, we show that selecting a single node to aid in the transmission between a source and a destination outperforms both traditional orthogonal transmissions and distributed space-time codes, the essence of the project is to illustrate that nodes can be selected in a mesh network.Emerging as a new communication paradigm, cooperative communication is attracting attention. Node selection is the key technology for cooperative communication, and determines whether the performance gain of cooperation can be achieved. Wireless Mesh Networks (WMNs) are dynamically self-organized and self-configured, where the nodes in the network automatically establish an ad hoc network and maintain mesh connectivity. These properties make WMNs a key technology for next-generation wireless networking.In this work, we first give the performance evaluation metrics for node selection algorithms, and then discuss the corresponding categories. Finally, some classical relay selection algorithms are analyzed. Results show that the relay node should be seriously selected and configured according to system requirements in order to optimize the performance of cooperative communication.In the cooperative system, it is vital to select an appropriate cooperative node. It even determines whether the cooperative system can bring gains, the efficiency of the proposed MIMO-based communication system is related to the system and channel propagation parameters. We give a model for cooperative communication in a parallel relay network that includes the stochastic arrival of packets and queuing. MIMO systems use multiple inputs and multiple outputs from a single channel.We conclude that mesh network interworking is a promising direction to address the artifacts due to uncoordinated deployment of wireless mesh networks if it is supplemented with appropriate mechanisms.