Proceedings ArticleDOI
Physical Interference Modeling for Transmission Scheduling on Commodity WiFi Hardware
Ritesh Maheshwari,J. Cao,Samir R. Das +2 more
- pp 2661-2665
Reads0
Chats0
TLDR
This work uses commodity WiFi hardware for a comprehensive study of interference modeling for transmission scheduling on a mesh network setup, and proposes use of the "graded" version of the model where feasibility of a link is probabilistic, as opposed to using the more traditional "thresholded" version, where feasibility is binary.Abstract:
The demand for capacity in WiFi networks is driving a new look at transmission scheduling-based link layers. One basic issue here is the use of accurate interference models to drive transmission scheduling algorithms. However, experimental work in this space has been limited. In this work, we use commodity WiFi hardware (specifically, 802.11a) for a comprehensive study of interference modeling for transmission scheduling on a mesh network setup. We focus on the well-known physical interference model for its realism. We propose use of the "graded" version of the model where feasibility of a link is probabilistic, as opposed to using the more traditional "thresholded" version, where feasibility is binary. We show experimentally that the graded model is significantly more accurate (80 percentile error 0.2 vs. 0.55 for thresholded model). We develop transmission scheduling experiments using greedy scheduling algorithms for the evacuation model for both interference models. We also develop similar experiments for optimal scheduling performance for the simplified one-shot scheduling. The scheduling experiments demonstrate clearly superior performance for the graded model, often by a factor of 2. We conclude by promoting use of this model for scheduling studies.read more
Citations
More filters
Proceedings ArticleDOI
Wireless link scheduling under a graded SINR interference model
TL;DR: This paper formally defines the wireless link scheduling problem under the graded SINR model, where an additional constraint on the minimum quality of the usable links is imposed, and presents an approximation algorithm for this problem, which is shown to be within a constant factor from optimal.
Journal ArticleDOI
Dynamic Conflict-Free Transmission Scheduling for Sensor Network Queries
TL;DR: An analytical capacity bound is provided that enables DCQS to handle overload through rate control that significantly outperforms a representative TDMA protocol and 802.11b in terms of query latency and throughput.
Journal ArticleDOI
Adaptive instantiation of the protocol interference model in wireless networked sensing and control
TL;DR: This work proposes the physical-ratio-K (PRK) interference model as a reliability-oriented instantiation of the protocol model, and shows that PRK-based scheduling achieves a network throughput very close to what is enabled by physical-model- based scheduling while ensuring the required packet delivery reliability.
Proceedings ArticleDOI
Adaptive Instantiation of the Protocol Interference Model in Mission-Critical Wireless Networks
TL;DR: This work proposes the physical-ratio-K (PRK) interference model as a reliability-oriented instantiation of the protocol model and shows that PRK-based scheduling achieves a network throughput very close to what is enabled by physical-model- based scheduling while ensuring the required packet delivery reliability.
Proceedings ArticleDOI
SIR based interference modeling for wireless mesh networks: A detailed measurement study
Vishal Sevani,Bhaskaran Raman +1 more
TL;DR: In this work, in depth Signal to Interference Ratio (SIR) based interference modeling is explored, taking a measurement centric approach, characterizing the SIR versus PDR (Packet Delivery Ratio) relationship in outdoor mesh network settings.
References
More filters
Journal ArticleDOI
The capacity of wireless networks
Piyush Gupta,P. R. Kumar +1 more
TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
Proceedings ArticleDOI
Link-level measurements from an 802.11b mesh network
TL;DR: The causes of packet loss in a 38-node urban multi-hop 802.11b network are analyzed to gain an understanding of their relative importance, of how they interact, and of the implications for MAC and routing protocol design.
Proceedings ArticleDOI
Analyzing the transitional region in low power wireless links
TL;DR: A key finding is that for radios using narrow-band modulation, the transitional region is not an artifact of the radio non-ideality, as it would exist even with perfect-threshold receivers because of multi-path fading.
Proceedings ArticleDOI
Complexity in geometric SINR
TL;DR: The first NP-completeness proofs in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane, are presented, which proves two problems to be NP-complete: Scheduling and One-Shot Scheduling.
Proceedings ArticleDOI
On the complexity of scheduling in wireless networks
TL;DR: It is shown that under a setting with single-hop traffic and no rate control, the maximal scheduling policy can achieve a constant fraction of the capacity region for networks whose connectivity graph can be represented using one of the above classes of graphs.