Carrier Sense Multiple Access Wireless Research Articles

A New Stochastic Geometry Model of Coexistence of Wireless Body Sensor Networks

Stochastic geometry, in particular Poission point process theory, has been widely used in the last decade to provide models and methods to analyze wireless networks. It is a branch of mathematics which deals with the study of random point processes. There are various models for point processes, typically based on but going beyond the classic homogeneous Poisson point process. Poisson point process cannot be used to model the spatial distribution of the simultaneously active transmitters. A novel framework has been presented for modeling the intensity of simultaneous active transmitters of a random carrier sense multiple access wireless sensor network. This thinning rule uses a second-neighbors distance-dependent method, which controls too many nodes deleted of points close together.

A Modified Hard Core Point Process for Analysis of Random CSMA Wireless Networks in General Fading Environments

For spectrum sharing and avoidance of mutual interference, carrier-sense multiple access (CSMA) protocols are very popular in distributed wireless networks. CSMA protocols aim to maximize the spatial frequency reuse while limiting the mutual interference and outage. The hard core point process (HCPP) is a very popular tool for modeling and analysis of random CSMA networks. However, the traditional HCPP suffers from the node intensity (and hence the interference) underestimation flaw. Therefore, we propose a modified hard core point process to mitigate this flaw. The proposed modified HCPP is generalized for any fading environment. To this end, we derive a closed-form expression for the intensity of simultaneously active transmitters in a random wireless CSMA network. Then, we derive a closed-form expression for approximating the outage probability experienced by a generic receiver in the network, and subsequently, use it to obtain the transmission capacity of the network. Finally, we show the existence of an optimal carrier-sensing threshold for the CSMA protocol that maximizes the transmission capacity of the network. Simulation results validate the analysis and also provide interesting insights into the design of practical CSMA networks.

Improving power efficiency of CSMA wireless networks using multi-user diversity - [transaction letters

This paper proposes a method that reduces transmit-power consumption of carrier-sense multiple-access (CSMA) networks by utilizing multiuser diversity and power control. Using this method, a terminal sends a packet at a slot if the terminal's signal-to-noise ratio (SNR) is above the threshold associated with the slot. Since the threshold value decreases as time advances, this method will make the user with the largest SNR access the shared channel; thus, a packet can be transmitted with less transmit power. The analysis under the infinite-user model shows that, as traffic load grows, the expected sum-power of the conventional CSMA network increases whereas that of the proposed method decreases.

Collision-free operation in ad hoc carrier sense multiple access wireless networks

The CSMA/CA algorithm proposed in the IEEE 802.11 standard does not exclude collisions between transmitted packets. Regardless of whether RTS/CTS packets are used or not, these collisions do always have a more or less negative effect on system performance, especially at high loads. In this letter a method of avoiding collisions by using busy energy bursts is proposed. The algorithm used is based on the 802.11 standard and depends only on the assumption that each node can hear the transmissions of all other nodes. Collisions are avoided by transmitting short sequences of energy bursts without the need of any further communication between nodes contending for the use of the channel. The proposed method provides better average packet delays also as higher maximum system loads than conventional CSMA/CA. In addition to this, it renders the use of acknowledgment packets unnecessary.

Capacity of a wireless LAN with voice and data services

The capacity of a carrier sense multiple-access wireless LAN with voice and data services using the TCP/IP protocol is analyzed to obtain a lower bound for the capacity of the wireless networks with voice and data services. The voice traffic is given a higher priority over the data traffic to accommodate the delay requirement for an acceptable quality of service. This is implemented by assigning the TCP protocol for data and the UDP protocol for voice. The relationship between the data throughput and the number of the voice users supported in this environment is analyzed by using a nonpreemptive queuing model. While the analysis in this paper can be applied to any voice encoding system, the improved multiband excitation voice encoding technique is adopted to provide a low transmission rate with an acceptable quality.

Quality-of-service in ad hoc carrier sense multiple access wireless networks

Carrier sense multiple access (CSMA) is one of the most pervasive medium access control (MAC) schemes in ad hoc, wireless networks. However, CSMA and its current variants do not provide quality-of-service (QoS) guarantees for real-time traffic support. This paper presents and studies black-burst (BB) contention, which is a distributed MAC scheme that provides QoS real-time access to ad hoc CSMA wireless networks. With this scheme, real-time nodes contend for access to the channel with pulses of energy-so called BBs-the durations of which are a function of the delay incurred by the nodes until the channel became idle. It is shown that real-time packets are not subject to collisions and that they have access priority over data packets. When operated in an ad hoc wireless LAN, BB contention further guarantees bounded and typically very small real-time delays. The performance of the network can approach that attained under ideal time division multiplexing (TDM) via a distributed algorithm that groups real-time packet transmissions into chains. A general analysis of BB contention is given, contemplating several modes of operation. The analysis provides conditions for the scheme to be stable. Its results are complemented with simulations that evaluate the performance of an ad hoc wireless LAN with a mixed population of data and real-time nodes.