Busy tone‐based channel access control for cooperative communication. Issue 10 (11th August 2014)

• Record Type: Journal Article
• Authors: Xie, Kun; Xie, Kexin; He, Shiming; Zhang, Daqiang; Wen, Jigang; Lloret, Jaime
• Is Part Of: Transactions on emerging telecommunications technologies. Volume 26:Issue 10(2015)
• Page Start: 1173
• Page End: 1188
• Publication Date: 2014-08-11
• Subjects: Telecommunication -- Periodicals; 384.05
• DOI: 10.1002/ett.2856
• Languages: English
• ISSNs: 2161-5748

Abstract

<abstract abstract-type="main" id="ett2856-abs-0001"> <title>Abstract</title> <p id="ett2856-para-0001">Cooperative communication has attracted many research interests in recent years because it can take advantage of the broadcast nature of wireless communications and spatial diversity to improve the network performance. Although relay nodes in cooperative communications can help improve the performance, relay nodes may cause the serious competition on wireless channel accessing, which makes the channel access problem in cooperative communications challenging. To solve this problem, based on cooperative triple busy tone multiple access, this paper proposes a media access control scheme that concurrently combines the request to send/clear to send and busy tone with a proper tone duration timer. In the scheme, three busy tones are proposed to coordinate the nodes in the network to transmit packets, which is further utilised to solve the hidden terminal and exposed terminal problems in cooperative communications. Among the three busy tones, the cooperative busy tone is set according to the relay's signal‐to‐noise ratio. Based on the busy tone, this paper also proposes a bandwidth efficient relay selection algorithm, in which the source node can select the best relay in a distributed way by monitoring the busy tone. The simulation results demonstrate that the proposed scheme can largely reduce the blocking time and improve the channel utilisation in wireless cooperative networks. Copyright © 2014 John Wiley & Sons, Ltd.</p> </abstract>