Queueing and Stability Analysis of Buffered CSMA/CD Local Networks.

This dissertation develops a joint probability generating function for the message quene lengths in a slotted p-persistent CSMA/CD (Carrier-Sense Multiple-Access with Collision Detection) system with a finite population of buffered users. Each user is assumed to have an independent and identical process of packet generation and an infinite buffer for storing outstanding packets. A closed form formula is obtained for the generating function in case of a two user system. Analytic formulas for the stability condition of a p-persistent CSMA/CD system are derived using the generating function. The range of the transmission probability p that leads to stability is examined through numerical analysis over a wide variety of the user\u27s communication demand, the packet length distribution, the number of users on the network, and the time to detect and abort collided packets

Scalability of broadcast performance in wireless network-on-chip

Networks-on-Chip (NoCs) are currently the paradigm of choice to interconnect the cores of a chip multiprocessor. However, conventional NoCs may not suffice to fulfill the on-chip communication requirements of processors with hundreds or thousands of cores. The main reason is that the performance of such networks drops as the number of cores grows, especially in the presence of multicast and broadcast traffic. This not only limits the scalability of current multiprocessor architectures, but also sets a performance wall that prevents the development of architectures that generate moderate-to-high levels of multicast. In this paper, a Wireless Network-on-Chip (WNoC) where all cores share a single broadband channel is presented. Such design is conceived to provide low latency and ordered delivery for multicast/broadcast traffic, in an attempt to complement a wireline NoC that will transport the rest of communication flows. To assess the feasibility of this approach, the network performance of WNoC is analyzed as a function of the system size and the channel capacity, and then compared to that of wireline NoCs with embedded multicast support. Based on this evaluation, preliminary results on the potential performance of the proposed hybrid scheme are provided, together with guidelines for the design of MAC protocols for WNoC.Peer ReviewedPostprint (published version

Dual Busy Tone Multiple Access (DBTMA)— A Multiple Access Control Scheme for Ad Hoc Networks

In ad hoc networks, the hidden- and the exposed-terminal problems can severely reduce the network capacity on the MAC layer. To address these problems, the ready-to-send and clear-to-send (RTS/CTS) dialogue has been proposed in the literature. However, MAC schemes using only the RTS/CTS dialogue cannot completely solve the hidden and the exposed terminal problems, as pure “packet sensing” MAC schemes are not safe even in fully connected networks.We propose a new MAC protocol, termed the dual busy tone multiple access (DBTMA) scheme. The operation of the DBTMA protocol is based on the RTS packet and two narrow-bandwidth, out-of-band busy tones. With the use of the RTS packet and the receive busy tone, which is set up by the receiver, our scheme completely solves the hidden- and the exposed-terminal problems. The busy tone, which is set up by the transmitter, provides protection for the RTS packets, increasing the probability of successful RTS reception and, consequently, increasing the throughput. This paper outlines the operation rules of the DBTMA scheme and analyzes its performance. Simulation results are also provided to support the analytical results. It is concluded that the DBTMA protocol is superior to other schemes that rely on the RTS/CTS dialogue on a single channel or to those that rely on a single busy tone. As a point of reference, the DBTMA scheme out-performs FAMA-NCS by 20–40% in our simulations using the network topologies borrowed from the FAMA-NCS paper. In an ad hoc network with a large coverage area, DBTMA achieves performance gain of 140% over FAMA-NCS and performance gain of 20% over RI-BTMA

Implementing Institute of Electrical and Electronics Engineers (IEEE) 802.11 Standard Medium Access Control Protocol for Wireless Local Area Networks (LANS) on a Laboratory Hardware Prototype

Wireless Local Area Networks (LANs) are extremely convenient, flexible, and easy to deploy. All LANs in which multiple hosts must access the same medium use a Medium Access Control (MAC) protocol to coordinate channel access. The MAC is part of the Data Link Layer of the Open Systems Interconnection (OSI) Reference Model. One MAC protocol in extensive use today is the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard. Since IEEE 802.11 devices are so prevalent in today s world, many researcher are exploring modifications and enhancements to the protocol. There are several well developed analytical and simulation models for IEEE 802.11 available to researchers, yet one significant obstacle remains: the lack of a means to obtain experimental data based on proposed protocol changes. Without real world experimental data, researchers lack the ability to test out their proposals in a real world environment. To fill this need, this thesis created a hardware prototype from which researchers can obtain experimental data about IEEE 802.11. This hardware prototype can now be used by researchers to gain real world data on their proposed modifications to IEEE 802.11

A Simulation Study of Medium Access Control Protocols of Wireless Networks

A thesis presented to the faculty of the College of Science and Technology at Morehead State University in partial fulfillment of the requirements for the Degree of Master of Science by Rohan Uddhav Patel on May 8, 2008

Maximizing the stable throughput of heterogeneous nodes under airtime fairness in a CSMA environment

The stability region of non-persistent CSMA is analyzed in a general heterogeneous network, where stations have different mean packet arrival rates, packet transmission times probability distributions and transmission probabilities. The considered model of CSMA captures the behavior of the well known CSMA/CA, at least as far as stability and throughput evaluation are concerned. The analysis is done both with and without collision detection. Given the characterization of the stability region, throughput-optimal transmission probabilities are identified under airtime fairness, establishing asymptotic upper and lower bounds of the maximum achievable stable throughput. The bounds turn out to be insensitive to the probability distribution of packet transmission times. Numerical results highlight that the obtained bounds are tight not only asymptotically, but also for essentially all values of the number of stations. The insight gained leads to the definition of a distributed adaptive algorithm to adjust the transmission probabilities of stations so as to attain the maximum stable throughput

Efficient collision resolution protocol for highly populated wireless networks

An efficient Medium access control (MAC) protocol is an important part of every wireless system. It prevents multiple devices from accessing the channel at the same time by defining rules for orderly access. Due to the fact that wireless networks have received enormous popularity in the last 10 - 15 years, number of users in these networks increased dramatically. Thus, support of large user population for modern MAC protocol is not an option anymore but a necessity, especially for dense Wireless Sensor Networks (WSNs). This work proposes a novel random MAC protocol for wireless networks named BCSMA/CA that can provide high channel throughput for very large number of users. The main idea of the protocol is based on the absence of backoff intervals where the channel is idle and using this time for active collision resolving. By presented analytical model and means of simulation, performance of the proposed protocol itself as well as in the framework of 802.11 Distributed Coordination Function (DCF) is explored. Corresponding comparison shows that 802.11 under BCSMA/CA is more suitable for applications where number of users is large compared to the traditional DCF approach

Medium Access Control in Distributed Networks with Large Propagation Delay

Most of the Earth is covered by water, so underwater acoustic networks (UWANs) are becoming increasingly popular in a variety of undersea applications. The needs to understand the underwater environment and exploit rich undersea resources have motivated a further development of UWANs. Underwater acoustic signals suffer from more difficult physical channel phenomena than terrestrial radio signals due to the harsh underwater environment, such as sound absorption, time-varying multipath spread, man-made and ambient noise, temperature and pressure dependent refraction, scattering and Doppler shift. Among all the challenges, the large ratio of propagation delay to packet duration (relative propagation delay (a)) is arguably the most difficult one to address in the Medium Access Control (MAC) layer. In this dissertation we focus on the examination and improvement of the MAC layer function in UWANs, based on a critical examination of existing techniques. Many MAC techniques have been proposed in recent years, however most of them assume the ratio of the propagation delay to the packet duration is negligibly small (a>1), these protocols perform poorly. This is because the large a leads to both a large negotiation delay in handshaking based protocols and the space-time uncertainty problem as the packets do not arrive at each node contemporarily. Some underwater-oriented protocols have been proposed which attempt to address these issues but the more successful rely on master nodes or a common understanding of geometry or time. We show by analysis and simulation that it is possible to eliminate collisions in ad-hoc networks with large relative propagation delay (a>>1) as well as improving the channel utilisation, without a common understanding of geometry or time. This technique is generally applicable, even for truly ad-hoc homogeneous peer-to-peer networks with no reliance on master nodes or other heterogeneous features. The mechanism is based on future scheduling with the inclusion of overhearing of RTS messages and allowing third-party objections to proposed transmissions. This MAC mechanism is immediately applicable in underwater acoustic networks (UWANs), and may find other uses, such as in space or very high rate terrestrial wireless networks. In summary, the key contributions of this study are: investigating the causes of the poor performance of existing MAC protocols in ad-hoc UWANs with large relative propagation delay, fully detailing the problem in order to propose analytic solutions, demonstrating how the MAC layer of an ad-hoc UWAN can eliminate packet collisions as well as improve channel utilisation without time synchronization or a network’s self-configuring phase to gain knowledge of the geometry, and verifying the utility of the proposals via both theoretical analysis and simulations

Interference caused by the insertion of an h-BEB station in standard shared-Ethernet networks: simulation analysis

In this paper, it is presented the simulation analysis of an enhanced algorithm for the collision resolution in shared Ethernet networks. Such algorithm, referred as high priority Binary Exponential Backoff (h-BEB), provides high priority traffic separation, enabling the Support of real-time communications. One of the main features of the h-BEB algorithm is to enable the coexistence in the same network segment of Ethernet standard stations with h-BEB modified stations, by imposing higher priority for the transfer of h-BEB messages (privileged traffic). The simulation analysis shows that the proposed traffic separation guarantees a predictable and significantly smaller access delay for the h-BEB station, when compared with the access delay for standard Ethernet stations. The simulation analysis also shows that the h-BEB traffic must be tightly controlled, as it has a high interference level over the non-real-time traffic. Otherwise, if the load generated by the h-BEB station is not closely controlled, the standard Ethernet stations may experience extended access delays