Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1812.06731

Range Extension in IEEE 802.11ah Systems Through Relaying

Enis Kocan·Bojan Domazetovic·Milica Pejanovic-Djurisic
View original source ↗Read source document ↗Export metadata ↓

Abstract

A great number of Internet of Things (IoT) and machine-to-machine (M2M) based applications require energy efficient, long range and low data rate wireless communication links. In order to offer a competitive solution in these areas, IEEE 802.11 standardization group has defined the "ah" amendment, the first sub-1GHz WLAN standard, with flexible channel bandwidths, starting from 1MHz, up to 16MHz, and many other physical and link layer improvements, enabling long-range and energy efficient communications. However, for some regions, like Europe, the maximum transmitted power in dedicated frequency band is limited to only 10mW, thus disabling the achievement of ranges which would be close to targeted of up to 1km. In this paper we examine possibilities for range extension through implementation of half-duplex decode-and forward (DF) relay station (RS) in communication between an access point (AP) and an end-station (ST). Assuming a Rician fading channel between AP and RS, and a Rayleigh fading channel on the RS-ST link, we analytically derive results on achievable ranges for the most robust modulation and coding schemes (MCSs). Analyses are performed for two different standard adopted deployment scenarios on the RS-ST link. Moreover, we have analyzed whether the considered most robust MCSs, known for supporting the longest range, but the lowest data rates, can meet the defined requirement of at least 100kb/s for the greatest attainable AP-RS-ST distances. We examine data rate enhancements, brought by coding and using of short packets, for both downlink (DL) and uplink (UL). Finally, we present bit error rate (BER) results, obtained through simulations of a dual-hop DF IEEE 802.11ah relay system for the considered MCs. All presented results confirm that IEEE 802.11ah systems, through deployment of relay stations, become an interesting solution for M2M and IoT based applications.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Enis Kocan, Bojan Domazetovic, Milica Pejanovic-Djurisic. 2018-12-17. Range Extension in IEEE 802.11ah Systems Through Relaying. https://doi.org/10.1007/s11277-017-4334-9

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Semord: Learned Semantic-Preserving Placement and Low-Fanout Routing for Distributed Vector Search

Vector databases are increasingly deployed in distributed settings where different users, sites, or domains maintain vector data. Existing vector databases rely on a coordinator to record which shards store which parts of the vector space and to route each query to those shards. In a decentralized setting, peers may join, leave, or move data without a trusted node tracking every change, and outdated routing information can therefore send queries to the wrong peers or require contacting many peers, reducing vector retrieval recall and increasing network latency. We present Semord, a decentralized vector search overlay system that achieves high recall by routing each ANN query to a small set of relevant peers, without relying on a centralized coordinator. Semord addresses this problem by making semantic locality routable: 1) We propose VHash to place semantically related vectors near each other in the overlay key space while avoiding load imbalance, so that each query only needs to contact a small neighborhood of peers for distributed local ANN ranking. 2) We design VecDHT, a communication protocol that maintains decentralized routing, region metadata, churn resilience, and VHash updates under membership and workload changes. Our extensive experiments on a real testbed show that Semord improves recall by more than 15% and reduces contacted peers by over 60% compared with decentralized baselines. Semord also approaches the recall and latency of a centralized oracle baseline while reducing peak peer-local ANN index memory by more than 2X. Controlled large-scale simulations further show that Semord scales across real-world embedding workloads and remains robust under churn for scoped vector retrieval as a decentralized overlay.

cs.NI↗
arXiv2026

Lizard: Bandwidth-Adaptive Real-Time Video Analytics through Content-Aware Packet Discarding at Last-Mile Edge Routers

The timeliness and accuracy of edge-based video analytics can be hindered by drastic reductions in available bandwidth (ABW) at last-mile edge routers, causing prolonged queuing delays. This work proposes Lizard, a system that leverages video-content-aware packet discarding to mitigate the negative effects of drastic ABW degradation that may frequently occur at a last-mile edge router by judiciously discarding packets that contain frame blocks less important to the analytics at the destination. To achieve this, we first devise a frame-block-aware RTP header extension to effectively decouple packet dependencies to encode frame blocks. Second, Lizard uses a priority-based feedback mechanism that dynamically evaluates packet priorities based on relative accuracy impacts. Third, we develop an adaptive phase-transition-based packet discarding strategy at the router to discard packets that represent unimportant blocks. Our evaluation of Lizard shows improvements over existing methods are substantial: 53.2% reduction in latency and 27.1% increase in analysis accuracy.

cs.NI↗
arXiv2026

Flux: Optimal Scheduling of Optical Circuit Switches for LLM Training

Optical Circuit Switching (OCS) offers high bandwidth density and energy efficiency for LLM training, but incurs a non-negligible reconfiguration delay. Prior work typically schedules optical circuit switches independently of compute, using aggregate traffic demand to determine which circuits to provision and when. We argue that this separation creates a fundamental inefficiency: reconfigurations that ignore the compute timeline can stall communication, resulting in low circuit utilization and large buffer requirements. In this paper, we present Flux, a scheduler that optimally schedules optical circuit switches based on the structure of the entire workload. Flux remains effective across a wide range of switching speeds by reusing circuits and amortizing reconfiguration delay behind compute and communication. We show that Flux reduces training iteration time by up to $10\times$ and peak NIC buffer requirements by more than three orders of magnitude compared to traditional periodic schedulers.

cs.NI↗