Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks

• Published in: Physical communication Vol. 4; no. 3; pp. 218 - 226
• Main Author: Escrig, Benoît
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.09.2011; Elsevier
• Subjects: Computer Science; Cooperative communications; Data Structures and Algorithms; Diversity-multiplexing trade-off; MAC protocols; Diversity-multiplexing trade-off; Cooperative communications; MAC protocols; Cooperative Communications; MAC Protocols; Splitting Algorithms
• ISSN: 1874-4907; 1876-3219
• DOI: 10.1016/j.phycom.2011.03.003

A cooperative protocol for wireless mesh networks is proposed in this paper. The protocol implements both on-demand relaying and a selection of the best relay terminal so only one terminal is relaying the source message when cooperation is needed. Two additional features are also proposed. The best relay is selected with a splitting algorithm. This approach allows fast relay selection within less than three time-slots, on average. Moreover, a pre-selection of relay candidates is performed prior to the splitting algorithm. Only terminals that are able to improve the direct path are pre-selected. So efficient cooperation is now guaranteed. We prove that this approach is optimal in terms of diversity-multiplexing trade-off. The protocol has been designed in the context of Nakagami- m fading channels. Simulation results show that the performance of the splitting algorithm does not depend on channel statistics.