A Power Dissipation Comparison of the R-TDMA and the Slotted-Aloha Wireless MAC protocols

In this paper two wireless multiple-access protocols are compared by their power dissipation for the uplink traffic of a wireless networks. After briefly discussing the behaviour of the Slotted Aloha protocol (Abramson, 1985) and the R-TDMA protocol (Linnenbank, 1995), we estimate the energy that is dissipated by the protocols to trasmit a packet. We will show that for general loads, the power dissipation of the R-TDMA protocol is far less than that of the Slotted Aloha protocol

Network Coding Tree Algorithm for Multiple Access System

Network coding is famous for significantly improving the throughput of networks. The successful decoding of the network coded data relies on some side information of the original data. In that framework, independent data flows are usually first decoded and then network coded by relay nodes. If appropriate signal design is adopted, physical layer network coding is a natural way in wireless networks. In this work, a network coding tree algorithm which enhances the efficiency of the multiple access system (MAS) is presented. For MAS, existing works tried to avoid the collisions while collisions happen frequently under heavy load. By introducing network coding to MAS, our proposed algorithm achieves a better performance of throughput and delay. When multiple users transmit signal in a time slot, the mexed signals are saved and used to jointly decode the collided frames after some component frames of the network coded frame are received. Splitting tree structure is extended to the new algorithm for collision solving. The throughput of the system and average delay of frames are presented in a recursive way. Besides, extensive simulations show that network coding tree algorithm enhances the system throughput and decreases the average frame delay compared with other algorithms. Hence, it improves the system performance

A Flexible and Fast Event-Driven Simulator for wireless MAC protocols

Many multiple-access (MAC) protocols have been or are being proposed for wireless networks. As most of these multiple-access protocols are designed for specific applications (such as telephony) and analyzed accordingly, the analysis results can not always be adapted to situations where each user has a different behavior. Wireless MAC protocols for data communication are not straightforward to analyse. To quickly make a reliable judgement of the usability of a MAC protocol for specific situations, we designed a simulator that makes it simple to implement the protocol and test it in different configurations and with differently behaving users. Our simulator generates a large amount of quantitative performance information that can be processed with standard graph drawing tools and an integrated trace analyze

Stability and instability of a random multiple access model with adaptive energy harvesting

We introduce a model for the classical synchronised multiple access system with a single transmission channel and a randomised transmission protocol (ALOHA). We assume in addition that there is an energy harvesting mechanism, and any message transmission requires a unit of energy. Units of energy arrive randomly and independently of anything else. We analyse stability and instability conditions for this model

Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks

To ensure a long-lived network of wireless communicating sensors, we are in need of a medium access control protocol that is able to prevent energy-wasting effects like idle listening, hidden terminal problem or collision of packets. Schedule-based medium access protocols are in general robust against these effects, but require a mechanism to establish a non-conflicting schedule. In this paper, we present such a mechanism which allows wireless sensors to choose a time interval for transmission, which is not interfering or causing collisions with other transmissions. In our solution, we do not assume any hierarchical organization in the network and all operation is localized. We empirically show that our localized algorithm is successful within a factor 2 of the minimum necessary time slots in random networks; well in range of the expected (worst case) factor 3-approximation of known first-fit algorithms. Our algorithm assures similar minimum distance between simultaneous transmissions as CSMA(/CD)-based approaches

MAC IEEE802.11 CSMA/CA: A Simulative Performance Analysis

In this paper we introduce an algorithm based analytical model to calculate the performance of the wireless LAN MAC protocol – known as Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) – taking into consideration the random exponential back off algorithm. The effects of changing the load on medium utilization and average waiting time are demonstrated and result concluded for high medium and low load conditions

E2MaC: an energy efficient MAC protocol for multimedia traffic

Energy efficiency is an important issue for mobile computers since they must rely on their batteries. We present a novel MAC protocol that achieves a good energy efficiency of wireless interface of the mobile and provides support for diverse traffic types and QoS. The scheduler of the base station is responsible to provide the required QoS to connections on the wireless link and to minimise the amount of energy spend by the mobile. The main principles of the E2MaC protocol are to avoid unsuccessful actions, minimise the number of transitions, and synchronise the mobile and the base-station. We will show that considerable amounts of energy can be saved using these principles. In the protocol the actions of the mobile are minimised. The base-station with plenty of energy performs actions in courtesy of the mobile. We have paid much attention in reducing the cost of a mobile for just being connected. The protocol is able to provide near-optimal energy efficiency (i.e. energy is only spent for the actual transfer) for a mobile within the constraints of the QoS of all connections in a cell, and only requires a small overhead

Self-stabilizing TDMA Algorithms for Wireless Ad-hoc Networks without External Reference

Time division multiple access (TDMA) is a method for sharing communication media. In wireless communications, TDMA algorithms often divide the radio time into timeslots of uniform size, $\xi$, and then combine them into frames of uniform size, $\tau$. We consider TDMA algorithms that allocate at least one timeslot in every frame to every node. Given a maximal node degree, $\delta$, and no access to external references for collision detection, time or position, we consider the problem of collision-free self-stabilizing TDMA algorithms that use constant frame size. We demonstrate that this problem has no solution when the frame size is $\tau < \max\{2\delta,\chi_2\}$, where $\chi_2$ is the chromatic number for distance-$2$ vertex coloring. As a complement to this lower bound, we focus on proving the existence of collision-free self-stabilizing TDMA algorithms that use constant frame size of $\tau$. We consider basic settings (no hardware support for collision detection and no prior clock synchronization), and the collision of concurrent transmissions from transmitters that are at most two hops apart. In the context of self-stabilizing systems that have no external reference, we are the first to study this problem (to the best of our knowledge), and use simulations to show convergence even with computation time uncertainties