6,239 research outputs found
Reliable Prediction of Channel Assignment Performance in Wireless Mesh Networks
The advancements in wireless mesh networks (WMN), and the surge in
multi-radio multi-channel (MRMC) WMN deployments have spawned a multitude of
network performance issues. These issues are intricately linked to the adverse
impact of endemic interference. Thus, interference mitigation is a primary
design objective in WMNs. Interference alleviation is often effected through
efficient channel allocation (CA) schemes which fully utilize the potential of
MRMC environment and also restrain the detrimental impact of interference.
However, numerous CA schemes have been proposed in research literature and
there is a lack of CA performance prediction techniques which could assist in
choosing a suitable CA for a given WMN. In this work, we propose a reliable
interference estimation and CA performance prediction approach. We demonstrate
its efficacy by substantiating the CA performance predictions for a given WMN
with experimental data obtained through rigorous simulations on an ns-3 802.11g
environment.Comment: Accepted in ICACCI-201
Predicting Performance of Channel Assignments in Wireless Mesh Networks through Statistical Interference Estimation
Wireless Mesh Network (WMN) deployments are poised to reduce the reliance on
wired infrastructure especially with the advent of the multi-radio
multi-channel (MRMC) WMN architecture. But the benefits that MRMC WMNs offer
viz., augmented network capacity, uninterrupted connectivity and reduced
latency, are depreciated by the detrimental effect of prevalent interference.
Interference mitigation is thus a prime objective in WMN deployments. It is
often accomplished through prudent channel allocation (CA) schemes which
minimize the adverse impact of interference and enhance the network
performance. However, a multitude of CA schemes have been proposed in research
literature and absence of a CA performance prediction metric, which could aid
in the selection of an efficient CA scheme for a given WMN, is often felt. In
this work, we offer a fresh characterization of the interference endemic in
wireless networks. We then propose a reliable CA performance prediction metric,
which employs a statistical interference estimation approach. We carry out a
rigorous quantitative assessment of the proposed metric by validating its CA
performance predictions with experimental results, recorded from extensive
simulations run on an ns-3 802.11g environment
On using Multiple Quality Link Metrics with Destination Sequenced Distance Vector Protocol for Wireless Multi-Hop Networks
In this paper, we compare and analyze performance of five quality link
metrics forWireless Multi-hop Networks (WMhNs). The metrics are based on loss
probability measurements; ETX, ETT, InvETX, ML and MD, in a distance vector
routing protocol; DSDV. Among these selected metrics, we have implemented ML,
MD, InvETX and ETT in DSDV which are previously implemented with different
protocols; ML, MD, InvETX are implemented with OLSR, while ETT is implemented
in MR-LQSR. For our comparison, we have selected Throughput, Normalized Routing
Load (NRL) and End-to-End Delay (E2ED) as performance parameters. Finally, we
deduce that InvETX due to low computational burden and link asymmetry
measurement outperforms among all metrics
The Triangle Metric: Fast Link Quality Estimation for Mobile Wireless Sensor Networks (Invited Paper)
ReSensesuppleCONE
Insights into the Design of Congestion Control Protocols for Multi-Hop Wireless Mesh Networks
The widespread deployment of multi-hop wireless mesh networks will depend on the performance seen by the user. Unfortunately, the most predominant transport protocol, TCP, performs poorly over such networks, even leading to starvation in some topologies. In this work, we characterize the root causes of starvation in 802.11 scheduled multi-hop wireless networks via simulations. We analyze the performance of three categories of transport protocols. (1) end-to-end protocols that require implicit feedback (TCP SACK), (2) Explicit feedback based protocols (XCP and VCP) and (3) Open-loop protocol (UDP). We ask and answer the following questions in relation to these protocols: (a) Why does starvation occur in different topologies? Is it intrinsic to TCP or, in general, to feedback-based protocols? or does it also occur in the case of open-loop transfers such as CBR over UDP? (a) What is the role of application behavior on transport layer performance in multi-hop wireless mesh networks? (b) Is sharing congestion in the wireless neighborhood essential for avoiding starvation? (c) For explicit feedback based transport protocols, such as XCP and VCP, what performance can be expected when their capacity estimate is inaccurate? Based on the insights derived from the above analysis, we design a rate-based protocol called VRate that uses the two ECN bits for conveying load feedback information. VRate achieves near optimal rates when configured with the correct capacity estimate
Throughput Optimal Flow Allocation on Multiple Paths for Random Access Wireless Multi-hop Networks
In this paper we consider random access wireless multi-hop mesh networks with
multi-packet reception capabilities where multiple flows are forwarded to the
gateways through node disjoint paths. We address the issue of aggregate
throughput-optimal flow rate allocation with bounded delay guarantees. We
propose a distributed flow rate allocation scheme that formulates flow rate
allocation as an optimization problem and derive the conditions for
non-convexity for an illustrative topology. We also employ a simple model for
the average aggregate throughput achieved by all flows that captures both
intra- and inter-path interference. The proposed scheme is evaluated through
NS-2 simulations. Our preliminary results are derived from a grid topology and
show that the proposed flow allocation scheme slightly underestimates the
average aggregate throughput observed in two simulated scenarios with two and
three flows respectively. Moreover it achieves significantly higher average
aggregate throughput than single path utilization in two different traffic
scenarios examined.Comment: Accepted for publication at the 9th IEEE BROADBAND WIRELESS ACCESS
WORKSHOP (BWA2013), IEEE Globecom 2013 Workshop
- …