Non-persistent Carrier Sense Multiple Access Research Articles

Intelligent multichannel cross-layer framework for enhanced energy-efficiency in 6G-IoT wireless networks

The sixth-generation (6G) communication technology is expected to enable a fully-connected world with enhanced wireless connectivity, accessibility, reliability, and performance. 6G systems will be critical in addressing the massive-connectivity requirements for Internet-of-Things (IoT) networks. Cognitive radio (CR) technology is considered a promising solution in 6G networks that can provide tremendous spectrum opportunities to support large-scale IoT deployments. Due to the IoT’s energy-constrained and massively connected nature, existing CR-based communication protocols cannot be directly implemented in 6G-IoT networks. This is because they are usually designed to enhance spectrum-utilization in networks with finite users. Therefore, energy-efficient protocols are required to support the massive-connectivity requirement for energy-constrained IoT nodes. Non-persistent Carrier-Sense-Multiple-Access (CSMA)-based protocols are recognized as energy-effective spectrum-access paradigms for networks with massive users. This paper proposes a novel energy-efficient multi-channel cross-layer MAC framework that utilizes a non-persistent CSMA protocol in CR-enabled 6G-IoT networks. Based on a joint adaptation of the physical and MAC layer parameters, our framework aims to improve IoT networks’ energy efficiency (EE). Specifically, we formulate and solve the per-bit EE maximization problem subject to several design constraints. Numerical results show that our multi-channel cross-layer framework enhances network EE by up to 50% compared to a reference single-channel cross-layer design.

Hardware Circuit Implementation and Performance Analysis of Three-Slot NP-CSMA

The development of wireless communication technology has become increasingly important in the communications industry. How to allocate limited channel resources reasonably and reliably to each competing user is a problem that the access protocol of the MAC (Multiple Access Control) layer needs to solve. As an important way of random access, NP-CSMA (Non Persistent Carrier Sense Multiple Access) has a higher network throughput rate when the arrival rate is higher. This paper analyzes and improves the implemented NP-CSMA model, and obtains a three-slot NP-CSMA model. The mathematical tool MATLAB is used to analyze the network throughput, delay and energy efficiency of the model, and compare several random multiple access protocols adheres to the network throughput, they are NP-CSMA, Three-slot NP-CSMA, 1-persistent CSMA, P-persistent CSMA, and concludes that the three-slot NP-CSMA is significantly letter than several other multiple access protocols. Finally, using Quartus to design the three-slot NP-CSMA circuit, the statistical value of the circuit system is compared with the theoretical value of the model, and the error is less than 0.01, which proves that the system is reasonable in design and can be applied to wireless communication networks.

A Sensor Redeployment Algorithm Based on Virtual Forces for Underwater Sensor Networks

Practical underwater sensor networks redeployment algorithm needs to fully consider limited node resources, node move time and other characteristics in real environment. A Redeployment based on virtual forces (RBVF) algorithm is proposed. The non-persistent carrier sense multiple access protocol is introduced to solve communication conflicts between nodes during redeployment process. Based on existing study on three-dimensional space node deployment, the threshold value is determined to divide the attractive and repulsion forces. The speed of the node is considered. Simulation results indicate that the RBVF algorithm can achieve better coverage and less total move distance when moving nodes are not considered in virtual forces calculation. Water flow force is introduced, and a Virtual forces redeployment based on energy consuming (VFRBEC) algorithm is proposed, where different energy consumptions in different directions are used to modify node displacement. Simulation results indicate that the VFRBEC algorithmcan achieve the same coverage performance with the RBVF algorithm with less energy and is better than the redeployment based on combined virtual forces algorithm in terms of both coverage and energy consumption performances.

An Efficient Proposed MAC Protocol for M2M Networks

Machine to machine (M2M) communications refer to the technology that enables huge number of devices to be wired or wireless communication with each other’s. Neither the contention based medium access control (MAC) protocols nor the reservation based MAC protocols can provide a flexible, scalable solution for M2M networks. That is because of the huge number of communicating devices. In this paper, an efficient proposed MAC protocol for M2M networks is suggested. It is divided into three periods, namely the notification, the contention and the transmission periods. During the contention period, the contention is occurred with equal probabilities between the devices which have traffic to be sent. The non-persistent carrier sense multiple access protocol is selected for the contention strategy. In the notification period, the devices get information about the contention state. Furthermore, the transmission time slots location for the succeeded ones are announced. Finally, in the transmission period, the packets from each successful contended device are sent. This is done using time division multiple access (TDMA) strategy in the reserved time slot. Moreover, more than one device can transmit in one TDMA slot as long as the signal to interference plus noise ratio condition is not violated. In addition, the analytical analysis of the proposed MAC protocol is produced. Furthermore, extensive simulation programs are executed using MATLAB to measure the system performance. The system throughput, average delay time, and packet collision ratio are our performance metrics. Further, our MAC protocol outperforms other traditional ones.

Analysis of carrier sense multiple access protocols for channels supporting multi‐packet reception

Exact throughput analysis of unslotted carrier sense multiple access (CSMA) protocols for channels supporting multi-packet reception (MPR) is carried out. The protocols considered include (i) non-persistent and (ii) 1-persistent CSMA. An adaptive non-persistent CSMA protocol for channels supporting MPR has been proposed and evaluated. A Markov chain model with states representing the transmission period of the 1-persistent CSMA is used in the analysis. Analytical results are validated using simulation. The authors show that for CSMA protocols supporting MPR the throughput is crucially dependent on the carrier sensing delay.

Game Theory Based NanoMAC Protocol for Inter Cluster Wireless Sensor Network

Wireless sensor networks (WSNs) are ad hoc topologies with highly dynamic traffic rates offered. In this network, sensor nodes are often battery operated and the power consumption become more important issue. The medium access control (MAC) protocol designed for the network must be stable and consume less energy. The available non-persistent carrier sense multiple access (np-CSMA) based MAC protocol is not suitable for WSN because of higher possibility of frame collisions and consume more energy at variable traffic rates. To overcome this limitation, the carrier sense multiple access protocol with collision avoidance (CSMA/CA) called nanoMAC is used. The nanoMAC is more suitable for WSN to achieve high data and energy efficiency. In this paper Game theory based nanoMAC (G-nanoMAC) protocol and the performance is evaluated for the energy consumption and delay to maximize the lifetime of the multihop network. Simulation results shows that using game based nanoMAC protocol in WSN for multihop forwarding is more energy efficient. Index Terms—WSN, nanoMAC, energy consumption, life time.

Throughput analysis of non-persistent carrier sense multiple access combined with time division multiple access and its implication for cognitive radio

This study analyses a cognitive radio scenario based on non-persistent carrier sense multiple access (CSMA) and time division multiple access (TDMA) systems sharing a single-channel wireless network. TDMA users are considered as primary users who can access the channel at any time, and non-persistent CSMA users are considered as secondary users who can share the channel when it is free. New expressions for the individual and aggregate throughput performance of this combined system have been developed, and the system performance is evaluated for a variety of proportions of non-persistent CSMA and TDMA traffic levels. Simulation and analytical results are presented and the ways in which both schemes suffer negative effects as a result of the interaction are shown, primarily caused by increased number of collisions arising from the other scheme.

A Renewal Theory Based Analytical Model for the Contention Access Period of IEEE 802.15.4 MAC

In this paper, we propose a simple yet accurate analytical model for the slotted non-persistent carrier sense multiple access protocol with binary exponential backoff, as specified in the medium access control (MAC) protocol of the IEEE 802.15.4 standard for the contention access period. The model is based on a three-level renewal process, which leads to a general analytical framework applicable to the protocol variants of either single or double sensing, in a saturated or unsaturated case, under a general traffic arrival distribution and with various backoff policies. The analytical model can be used to obtain some important performance metrics, such as MAC throughput and average frame service time. The accuracy of the analytical model is demonstrated by extensive simulation results. The applicability of this model to the performance analysis of other slotted MAC protocols is also briefly discussed.

Collision-Minimizing CSMA and Its Applications to Wireless Sensor Networks

Recent research in sensor networks, wireless location systems, and power-saving in ad hoc networks suggests that some applications' wireless traffic be modeled as an event-driven workload: a workload where many nodes send traffic at the time of an event, not all reports of the event are needed by higher level protocols and applications, and events occur infrequently relative to the time needed to deliver all required event reports. We identify several applications that motivate the event-driven workload and propose a protocol that is optimal for this workload. Our proposed protocol, named CSMA/p/sup */, is nonpersistent carrier sense multiple access (CSMA) with a carefully chosen nonuniform probability distribution p/sup */ that nodes use to randomly select contention slots. We show that CSMA/p/sup */ is optimal in the sense that p/sup */ is the unique probability distribution that minimizes collisions between contending stations. CSMA/p/sup */ has knowledge of N. We conclude with an exploration of how p/sup */ could be used to build a more practical medium access control protocol via a probability distribution with no knowledge of N that approximates p/sup */.

Contention-based MAC protocols with erasure coding for wireless data networks

Contention-based medium access control (MAC) protocol is a key component for the success of wireless data networks. Conventional random access protocols like ALOHA and Carrier Sense Multiple Access (CSMA) suffer from packet collision which leads to low throughput. Aimed at improving the throughput performance, we propose to integrate erasure coding with contention-based MAC protocols for recovering collided packets. To demonstrate the effectiveness of this approach, we focus on combining erasure coding with slotted ALOHA and slotted non-persistent CSMA in this paper. The performances of the resulting protocols are evaluated by both analytical model and simulation. Simulation results match very well with analytical results and show that the system throughput is increased for low to medium traffic loading. Packet loss ratio is also improved considerably with our scheme when the maximum number of packet retransmission times is limited. However, the delay for our scheme is higher due to the longer waiting time in our scheme for recovering collided packets. It is also shown that delay can be significantly reduced if we choose appropriate coding parameters though throughput will be sacrificed.

Delay distributions of slotted ALOHA and CSMA

We derive the closed-form delay distributions of slotted ALOHA and nonpersistent carrier sense multiple access (CSMA) protocols under steady state. Three retransmission policies are analyzed. We find that under a binary exponential backoff retransmission policy, finite average delay and finite delay variance can be guaranteed for G<2S and G<4S/3, respectively, where G is the channel traffic and S is the channel throughput. As an example, in slotted ALOHA, S<(ln2)/2 and S<3(ln4-ln3)/4 are the operating ranges for finite first and second delay moments. In addition, the blocking probability and delay performance as a function of r/sub max/ (maximum number of retransmissions allowed) is also derived.

Adaptive modulation packet radio communication system using nonpersistent CSMA

In radio packet communication systems, the throughput and the average delay performance are greatly degraded when the traffic is high, since a single channel can be shared by multiple users. Another problem is that the transmission performance can vary, since the channel situation greatly depends on the communication distance. It is intended in this study to solve those problems. The concept of adaptive modulation is introduced into the radio packet communication system, and an adaptive modulation radio packet communication system is proposed in which the packet length as well as the modulation parameters are made variable. For the case where the nonpersistent carrier sense multiple access (CSMA) is used, the throughput and the average delay performance are examined by computer simulation. © 1999 Scripta Technica, Electron Comm Jpn Pt 1, 83(4): 44–52, 2000

Performance of frequency-hopped NPCSMA for broad-band personal communication services (B-PCS) at millimeter waves in an urban mobile radio environment

A millimeter-wave (MMW) propagation model, based on multiray optical theory and the geometrical theory of diffraction (GTD), is used to statistically study the delay spread and coherence bandwidth (B/sub c/) for broad-band personal communication services (B-PCSs) in urban mobile radio environments. The results of the statistical model are compared with outdoor measurements near the street level with B/sub c/ varying over a range of frequencies (14-100 MHz). It is shown that the distribution of B/sub c/ depends on antenna heights, street layout, and frequency. The signal level statistics are evaluated and found to agree with the measurements. In general, these statistics are non-Rayleigh distributed. The additive thermal Gaussian noise (AGN) is calculated for such channels to evaluate the signal-to noise ratio (SNR). The performance of the medium-access control (MAC) sublayer is studied by first evaluating the probability of packet retransmission and then the performance of the FH-NPCSPMA protocol. The FH-NPCSMA protocol is the combination of frequency hopping spread spectrum (FH-SS) and nonpersistent carrier-sense multiple access (NPCSMA) that is proposed to improve the system throughput and average packet delay for both high traffic and multipath channels at MMW. The main advantage of the PH-NPCSMA protocol is to improve the performance over fading channels.

Throughput evaluation of unidirectional broad-band CSMA

An analysis of the throughput achieved by broadband nonpersistent carrier sense multiple access (CSMA) on the bus topology is discussed. The transmission is unidirectional, with the head-end being either active or passive. A homogeneous infinite number of users is assumed to be uniformly distributed on the bus. It is shown that although unidirectional broadband transmission allows for higher transmission rates, and longer distances, the normalized throughput achieved is less than that achieved by bidirectional broadband or baseband transmission.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

An efficient solution to finite buffer non-persistent carrier sense multiple access protocol

In this paper we analyze non-persistent Carrier Sense Multiple Access (CSMA) protocol with collision detection (CD) considering realistic network configurations consisting of a finite number of stations, each with a finite buffer capacity. We present an analysis unique in being based for the first time on a solution involving linear equations whose number is only equal to the number of buffers in the system. It is demonstrated that this approach provides a solution with excellent accuracy and is shown to be a natural extension of CSMA models with single buffer capacity.

Performance Optimization of a CSMA Protocol for Local Computer Networks

Notable among local computer network protocols is the carrier sense multiple access (CSMA) network protocol. Many versions of CSMA have been proposed. The purpose of this paper is to derive an optimized performance of one version of CSMA, slotted nonpersistent CSMA with truncation (CSMA-SNP/TR), which is known to have better throughput performance than all other versions of CSMA. In this paper, the optimum average retransmission delay which provides the maximum throughput is presented in terms of message propagation delay, average retransmission delay, and number of terminals. Since the optimum average retransmission delay varies depending upon the number of terminals, an optimal average retransmission delay which nearly maximizes the throughput for a range of terminals is derived. A queueing model for representing the CSMA-SNP/TR protocol to analyze the performance of a computer network is also established. This work can be useful for design and performance analysis of distributed computer systems, including the computer systems and the communication channel connecting the computer systems.

Finite Population CSMA/CD Networks

A continuous time Markov chain model of a nonpersistent carrier sense multiple access with collision detection (CSMA/CD) protocol is developed to determine the performance of finite population systems. The model allows a wide range of distributions for the length of packets and the lengths of the transmission detection and collision detection times. A stability measure for finite population asynchronous systems-the instantaneous expected drift-is developed. Performance calculations for many sample systems show that the following behavior is characteristic of these systems: a wide range of retransmission rates provides almost optimal performance; the instantaneous drift is a sensitive indicator of the stability characteristics of CSMA/CD networks; if high fixed retransmission rates are used, performance decays very rapidly when other network parameters cross critical thresholds. In addition, adaptive retransmission policies and the maximum length of a CSMA/CD cable network are found to be very sensitive to the distribution of the transmission detection time.