Performance analysis of in-band collision detection for dense wireless networks

Vermeulen, Tom; Reynders, Brecht; Rosas, Fernando; Verhelst, Marian; Pollin, Sofie

doi:10.1186/s13638-021-01940-4

Cited by 2 publications

(3 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each of the vertices is assigned a certain weight, using the mass coefficient, V j , and thus, the total mass of the cluster, C, is M C , and is calculated as in Eq. (1).…”

Section: Network Model and Problem Statementmentioning

confidence: 99%

“…The dramatic increase of the number of wireless devices that exceeds the number of inhabitants of the earth puts high constraints on the design and development of modern communication networks [1]. Such communication networks that include fifth-generation (5G) cellular systems, Internet of Things (IoT), and sixth-generation (6G) cellular systems are required to achieve high-to-ultra-high network scalability [2][3][4].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Novel Path Counting-Based Method for Fractal Dimension Estimation of the Ultra-Dense Networks

Nahli¹,

Paramonov²,

Soliman³

et al. 2023

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

Next-generation networks, including the Internet of Things (IoT), fifthgeneration cellular systems (5G), and sixth-generation cellular systems (6G), suffer from the dramatic increase of the number of deployed devices. This puts high constraints and challenges on the design of such networks. Structural changing of the network is one of such challenges that affect the network performance, including the required quality of service (QoS). The fractal dimension (FD) is considered one of the main indicators used to represent the structure of the communication network. To this end, this work analyzes the FD of the network and its use for telecommunication networks investigation and planning. The cluster growing method for assessing the FD is introduced and analyzed. The article proposes a novel method for estimating the FD of a communication network, based on assessing the network's connectivity, by searching for the shortest routes. Unlike the cluster growing method, the proposed method does not require multiple iterations, which reduces the number of calculations, and increases the stability of the results obtained. Thus, the proposed method requires less computational cost than the cluster growing method and achieves higher stability. The method is quite simple to implement and can be used in the tasks of research and planning of modern and promising communication networks. The developed method is evaluated for two different network structures and compared with the cluster growing method. Results validate the developed method.

show abstract

“…Each of the vertices is assigned a certain weight, using the mass coefficient, V j , and thus, the total mass of the cluster, C, is M C , and is calculated as in Eq. (1).…”

Section: Network Model and Problem Statementmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Novel Path Counting-Based Method for Fractal Dimension Estimation of the Ultra-Dense Networks

Nahli¹,

Paramonov²,

Soliman³

et al. 2023

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

show abstract

“…Collisions coming from WLAN's nodes using the same MAC protocol, and interference coming from devices outside the network, waste valuable transmission time and radiated power, having a negative impact on the energy efficiency, throughput, and delay of the system [12]. Network nodes cannot distinguish one type of loss from another because the symptoms are the same -not receiving the acknowledgment from the access point.…”

Section: Problem Statementmentioning

confidence: 99%

Performance Analysis of Wireless Computer Networks in Conditions of High Interference Intensity

Khandetskyi,

Gerasimov,

Karpenko

2023

RIC

View full text Add to dashboard Cite

Context. The decrease in the probability of successful frame transmission in the infrastructure domain of IEEE 802.11 DCF wireless network is caused both by the influence of the collision intensity and by the impact of external interference in the radio path. Using the Markov chain approach as a baseline, we explicitly expressed the dependence of the network throughput on the number of operating stations, bit error rate (BER), and the frame fragmentation factor. Objective. The purpose of this article is to study the influence of interference intensity on the throughput of a wireless network domain in a wide range of the number of operating stations when transmitting frames of various lengths in the absence and with the use of the fragmentation mechanism. Method. The performed mathematical modelling showed, that in the range of increased and high noise intensity (BER = 10–5 – 10–4), a decrease in the length of the frame data field from the standard length of 12000 bits to 3000 bits is accompanied by a decrease in the throughput for all values of the number of competing stations. At the same time, it must be noted that as the amount of the frame data decreases, the throughput becomes less susceptible to an increase in the noise intensity. Qualitatively different results are obtained in the region of very high interference intensity (BER = 2·10–4). A significant increase in the probability of frame transmission in this region observed with a decrease in the standard length of the frame data field by 2–3 times, made it possible to increase the throughput compared to the original one. This effect is especially pronounced when the length is halved. Results. The study of the standard frame transmitting process, but with a fragmented data field, showed that if for BER = 5·10–5 and less with an increase in fragmentation factor, the throughput values decrease, in the entire range of the number of stations due to the predominant increase in overhead costs, then in the region of high (BER = 10–4) and very high noise intensity (BER = 2·10–4) we have the opposite effect. To the greatest extent, the throughput increases when the frame data is transmitted in two equal fragments. We have made a comparison of the network throughput determined by simply reducing the length of the frame data field and using fragmentation of a standard frame. The comparison showed that the use of the fragmentation mechanism is more beneficial both when throughput is stabilized under conditions of increased noise intensity and when the throughput is increased under conditions of high and very high noise intensity. Conclusions. In this article, a mathematical model has been modified for direct calculation of the wireless network throughput. Using this model, we studied the changes in throughput over a wide range of BER and a number of operation stations for various values of the transmitted frame fragmentation factor. The conditions for increasing the throughput are determined.

show abstract

Performance analysis of in-band collision detection for dense wireless networks

Cited by 2 publications

References 26 publications

Novel Path Counting-Based Method for Fractal Dimension Estimation of the Ultra-Dense Networks

Novel Path Counting-Based Method for Fractal Dimension Estimation of the Ultra-Dense Networks

Performance Analysis of Wireless Computer Networks in Conditions of High Interference Intensity

Contact Info

Product

Resources

About