Performance analysis of wireless ad‐hoc network based on bidirectional full‐duplex and saturated state. Issue 12 (27th June 2018)

• Record Type: Journal Article
• Authors: Li, Suoping; Sun, Hongchun; Dou, Zufang; Zhou, Yongqiang
• Is Part Of: IET communications. Volume 12:Issue 12(2018)
• Page Start: 1422
• Page End: 1430
• Publication Date: 2018-06-27
• Subjects: probability -- ad hoc networks -- mobile radio -- Markov processes -- telecommunication network reliability -- wireless channels; wireless ad‐hoc network -- saturated state -- TC -- node mobile model -- account node mobility -- mobile state -- mobile rule -- steady‐state probability -- state transition probability matrix -- network delay -- bidirectional ad‐hoc network -- network interference -- saturated Markov state transition model -- saturated Markov state transition model -- contention window size -- average countdown length -- packet attempting retransmission -- back‐off time -- data transmission -- SIR threshold -- theoretical analysis -- numerical simulation -- space resources -- BFD system; Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/iet-com.2017.0448
• Languages: English
• ISSNs: 1751-8628

Abstract

Abstract : The transmission capacity (TC) of the wireless ad‐hoc network is one of the key properties to ensure the quality of network service. The main goal of this study is to explore the mobility of the network to establish a node mobile model with a saturated state and determine the TC and delay for the network based on the bidirectional full‐duplex (BFD) system. Considering the outage probability, packet arrival rate, and failure probability of packet attempting transmission, the node mobility models are established based on the node mobility and network self‐organization. In analysis, this study determines the mobile state, static state, communication state, and outage stat by defining the mobile rule and range of nodes, then the steady‐state probability of each state is obtained by calculating the state transition matrix. After optimising the existing saturated Markov model, the authors determine the network delay and TC based on the mobile nodes, contention window size, maximum number of given packet attempting retransmission, back‐off time and signal‐interference ratio (SIR) etc. The theoretical analysis and numerical simulation show that the TC of the bidirectional ad‐hoc network can be significantly improved by using space resources in two directions, and the introduction of the BFD system is indeed to reduce the network delay.