TY - GEN
T1 - FMAC for coexisting ad hoc cognitive radio networks
AU - Zhao, Yanxiao
AU - Song, Min
AU - Xin, Chunsheng
PY - 2013
Y1 - 2013
N2 - Media access control plays a critical role in cognitive radio networks (CRNs). In our previous work, we have proposed a fairness-oriented media access control (FMAC) protocol to achieve fair and efficient coexistence of infrastructure-based CRNs. In this paper, we enhance FMAC to be used for coexisting ad hoc CRNs, where no centralized base stations exist, and secondary users (SUs) access channel independently. In FMAC, the contention window size is essential to network performance such as throughput. We first derive the optimal contention window size, which can then be used by SUs to achieve optimal throughput. However, the optimal contention window size is closely related to the total number of users of all CRNs, which is typically unknown to each individual SU of coexisting ad hoc CRNs. We attack this problem by building a bridge between the average number of consecutive idle time slots and optimal contention window size, since the average number of consecutive idle time slots can be easily observed by each individual SU. Hence, SUs can independently adjust their contention window size by observing their current average number of consecutive idle time slots and eventually approach the optimal contention window without the information of the total number of SUs. Extensive simulations are conducted and the results verify that the enhanced FMAC is able to significantly improve the fairness among coexisting ad hoc CRNs while maintaining good throughput.
AB - Media access control plays a critical role in cognitive radio networks (CRNs). In our previous work, we have proposed a fairness-oriented media access control (FMAC) protocol to achieve fair and efficient coexistence of infrastructure-based CRNs. In this paper, we enhance FMAC to be used for coexisting ad hoc CRNs, where no centralized base stations exist, and secondary users (SUs) access channel independently. In FMAC, the contention window size is essential to network performance such as throughput. We first derive the optimal contention window size, which can then be used by SUs to achieve optimal throughput. However, the optimal contention window size is closely related to the total number of users of all CRNs, which is typically unknown to each individual SU of coexisting ad hoc CRNs. We attack this problem by building a bridge between the average number of consecutive idle time slots and optimal contention window size, since the average number of consecutive idle time slots can be easily observed by each individual SU. Hence, SUs can independently adjust their contention window size by observing their current average number of consecutive idle time slots and eventually approach the optimal contention window without the information of the total number of SUs. Extensive simulations are conducted and the results verify that the enhanced FMAC is able to significantly improve the fairness among coexisting ad hoc CRNs while maintaining good throughput.
KW - coexisting
KW - cognitive radio networks
KW - fairness
KW - throughput
UR - http://www.scopus.com/inward/record.url?scp=84880887430&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84880887430&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-39701-1_32
DO - 10.1007/978-3-642-39701-1_32
M3 - Conference contribution
AN - SCOPUS:84880887430
SN - 9783642397004
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 391
EP - 401
BT - Wireless Algorithms, Systems, and Applications - 8th International Conference, WASA 2013, Proceedings
T2 - 8th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2013
Y2 - 7 August 2013 through 10 August 2013
ER -