On the Impact of HARQ on the Throughput and Energy Efficiency Using Cross-Layer Analysis

This paper studies the potential improvements in terms of energy efficiency and system throughput of a hybrid automatic retransmission request (HARQ) mechanism. The analysis includes both the physical (PHY) and medium access (MAC) layers. We investigate the trade-off provided by HARQ, which demands reduced transmit power for a given target outage probability at the cost of more accesses to the channel. Since the competition for channel access at the MAC layer is very expensive in terms of energy and delay, our results show that HARQ leads to great performance improvements due to the decrease in the number of contending nodes – a consequence of the reduced required transmit power. Counter-intuitively, our analysis leads to the conclusion that retransmissions may decrease the delay, improving the system performance. Finally, we investigate the optimum values for the number of allowed retransmissions in order to maximize either the throughput or the energy efficiency

Enhancing IEEE 802.11MAC in congested environments

IEEE 802.11 is currently the most deployed wireless local area networking standard. It uses carrier sense multiple access with collision avoidance (CSMA/CA) to resolve contention between nodes. Contention windows (CW) change dynamically to adapt to the contention level: Upon each collision, a node doubles its CW to reduce further collision risks. Upon a successful transmission, the CW is reset, assuming that the contention level has dropped. However, the contention level is more likely to change slowly, and resetting the CW causes new collisions and retransmissions before the CW reaches the optimal value again. This wastes bandwidth and increases delays. In this paper we analyze simple slow CW decrease functions and compare their performances to the legacy standard. We use simulations and mathematical modeling to show their considerable improvements at all contention levels and transient phases, especially in highly congested environments

Capacity Analysis of IEEE 802.11ah WLANs for M2M Communications

Focusing on the increasing market of the sensors and actuators networks, the IEEE 802.11ah Task Group is currently working on the standardization of a new amendment. This new amendment will operate at the sub-1GHz band, ensure transmission ranges up to 1 Km, data rates above 100 kbps and very low power operation. With IEEE 802.11ah, the WLANs will offer a solution for applications such as smart metering, plan automation, eHealth or surveillance. Moreover, thanks to a hierarchical signalling, the IEEE 802.11ah will be able to manage a higher number of stations (STAs) and improve the 802.11 Power Saving Mechanisms. In order to support a high number of STAs, two different signalling modes are proposed, TIM and Non-TIM Offset. In this paper we present a theoretical model to predict the maximum number of STAs supported by both modes depending on the traffic load and the data rate used. Moreover, the IEEE 802.11ah performance and energy consumption for both signalling modes and for different traffic patterns and data rates is evaluated. Results show that both modes achieve similar Packet Delivery Ratio values but the energy consumed with the TIM Offset is, in average, a 11.7% lower.Comment: Multiple Access Communications 201

LPDQ: a self-scheduled TDMA MAC protocol for one-hop dynamic lowpower wireless networks

Current Medium Access Control (MAC) protocols for data collection scenarios with a large number of nodes that generate bursty traffic are based on Low-Power Listening (LPL) for network synchronization and Frame Slotted ALOHA (FSA) as the channel access mechanism. However, FSA has an efficiency bounded to 36.8% due to contention effects, which reduces packet throughput and increases energy consumption. In this paper, we target such scenarios by presenting Low-Power Distributed Queuing (LPDQ), a highly efficient and low-power MAC protocol. LPDQ is able to self-schedule data transmissions, acting as a FSA MAC under light traffic and seamlessly converging to a Time Division Multiple Access (TDMA) MAC under congestion. The paper presents the design principles and the implementation details of LPDQ using low-power commercial radio transceivers. Experiments demonstrate an efficiency close to 99% that is independent of the number of nodes and is fair in terms of resource allocation.Peer ReviewedPostprint (author’s final draft

An efficient scalable scheduling mac protocol for underwater sensor networks

Underwater Sensor Networks (UWSNs) utilise acoustic waves with comparatively lower loss and longer range than those of electromagnetic waves. However, energy remains a challenging issue in addition to long latency, high bit error rate, and limited bandwidth. Thus, collision and retransmission should be efficiently handled at Medium Access Control (MAC) layer in order to reduce the energy cost and also to improve the throughput and fairness across the network. In this paper, we propose a new reservation-based distributed MAC protocol called ED-MAC, which employs a duty cycle mechanism to address the spatial-temporal uncertainty and the hidden node problem to effectively avoid collisions and retransmissions. ED-MAC is a conflict-free protocol, where each sensor schedules itself independently using local information. Hence, ED-MAC can guarantee conflict-free transmissions and receptions of data packets. Compared with other conflict-free MAC protocols, ED-MAC is distributed and more reliable, i.e., it schedules according to the priority of sensor nodes which based on their depth in the network. We then evaluate design choices and protocol performance through extensive simulation to study the load effects and network scalability in each protocol. The results show that ED-MAC outperforms the contention-based MAC protocols and achieves a significant improvement in terms of successful delivery ratio, throughput, energy consumption, and fairness under varying offered traffic and number of nodes

Is Our Model for Contention Resolution Wrong?

Randomized binary exponential backoff (BEB) is a popular algorithm for coordinating access to a shared channel. With an operational history exceeding four decades, BEB is currently an important component of several wireless standards. Despite this track record, prior theoretical results indicate that under bursty traffic (1) BEB yields poor makespan and (2) superior algorithms are possible. To date, the degree to which these findings manifest in practice has not been resolved. To address this issue, we examine one of the strongest cases against BEB: $n$ packets that simultaneously begin contending for the wireless channel. Using Network Simulator 3, we compare against more recent algorithms that are inspired by BEB, but whose makespan guarantees are superior. Surprisingly, we discover that these newer algorithms significantly underperform. Through further investigation, we identify as the culprit a flawed but common abstraction regarding the cost of collisions. Our experimental results are complemented by analytical arguments that the number of collisions -- and not solely makespan -- is an important metric to optimize. We believe that these findings have implications for the design of contention-resolution algorithms.Comment: Accepted to the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2017