3,615 research outputs found
An Efficient Interference Aware Partially Overlapping Channel Assignment and Routing in Wireless Mesh Networks
In recent years, multi-channel multi-radio wireless mesh networks are considered a reliable and cost effective way for internet access in wide area. A major research challenge in this network is, selecting a least interference channel from the available channels, efficiently assigning a radio to the selected channel, and routing packets through the least interference path. Many algorithms and methods have been developed for channel assignment to maximize the network throughput using orthogonal channels. Recent research and test-bed experiments have proved that POC (Partially Overlapped Channels) based channel assignment allows significantly more flexibility in wireless spectrum sharing. In this paper, first we represent the channel assignment as a graph edge coloring problem using POC. The signal-to-noise plus interference ratio is measured to avoid interference from neighbouring transmissions, when a channel is assigned to the link. Second we propose a new routing metric called signal-to-noise plus interference ratio (SINR) value which measures interference in each link and routing algorithm works based on the interference information. The simulation results show that the channel assignment and interference aware routing algorithm, proposed in this paper, improves the network throughput and performance
Identifying Design Requirements for Wireless Routing Link Metrics
In this paper, we identify and analyze the requirements to design a new
routing link metric for wireless multihop networks. Considering these
requirements, when a link metric is proposed, then both the design and
implementation of the link metric with a routing protocol become easy.
Secondly, the underlying network issues can easily be tackled. Thirdly, an
appreciable performance of the network is guaranteed. Along with the existing
implementation of three link metrics Expected Transmission Count (ETX), Minimum
Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with
Optimized Link State Routing (OLSR) using NS-2.34. The simulation results show
that how the computational burden of a metric degrades the performance of the
respective protocol and how a metric has to trade-off between different
performance parameters
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
Joint Channel Assignment and Opportunistic Routing for Maximizing Throughput in Cognitive Radio Networks
In this paper, we consider the joint opportunistic routing and channel
assignment problem in multi-channel multi-radio (MCMR) cognitive radio networks
(CRNs) for improving aggregate throughput of the secondary users. We first
present the nonlinear programming optimization model for this joint problem,
taking into account the feature of CRNs-channel uncertainty. Then considering
the queue state of a node, we propose a new scheme to select proper forwarding
candidates for opportunistic routing. Furthermore, a new algorithm for
calculating the forwarding probability of any packet at a node is proposed,
which is used to calculate how many packets a forwarder should send, so that
the duplicate transmission can be reduced compared with MAC-independent
opportunistic routing & encoding (MORE) [11]. Our numerical results show that
the proposed scheme performs significantly better that traditional routing and
opportunistic routing in which channel assignment strategy is employed.Comment: 5 pages, 4 figures, to appear in Proc. of IEEE GlobeCom 201
- …