3,058 research outputs found
Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11),
each node should help to relay packets of neighboring nodes toward gateway
using multi-hop routing mechanisms. Wireless mesh networks usually intensively
deploy mesh nodes to deal with the problem of dead spot communication. However,
the higher density of nodes deployed, the higher radio interference occurred.
This causes significant degradation of system performance. In this paper, we
first convert network problems into geometry problems in graph theory, and then
solve the interference problem by geometric algorithms. We first define line
intersection in a graph to reflect radio interference problem in a wireless
mesh network. We then use plan sweep algorithm to find intersection lines, if
any; employ Voronoi diagram algorithm to delimit the regions among nodes; use
Delaunay Triangulation algorithm to reconstruct the graph in order to minimize
the interference among nodes. Finally, we use standard deviation to prune off
those longer links (higher interference links) to have a further enhancement.
The proposed hybrid solution is proved to be able to significantly reduce
interference in a wireless mesh network in O(n log n) time complexity.Comment: 24 Pages, JGraph-Hoc Journal 201
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
Rate Optimal design of a Wireless Backhaul Network using TV White Space
The penetration of wireless broadband services in remote areas has primarily
been limited due to the lack of economic incentives that service providers
encounter in sparsely populated areas. Besides, wireless backhaul links like
satellite and microwave are either expensive or require strict line of sight
communication making them unattractive. TV white space channels with their
desirable radio propagation characteristics can provide an excellent
alternative for engineering backhaul networks in areas that lack abundant
infrastructure. Specifically, TV white space channels can provide "free
wireless backhaul pipes" to transport aggregated traffic from broadband sources
to fiber access points. In this paper, we investigate the feasibility of
multi-hop wireless backhaul in the available white space channels by using
noncontiguous Orthogonal Frequency Division Multiple Access (NC-OFDMA)
transmissions between fixed backhaul towers. Specifically, we consider joint
power control, scheduling and routing strategies to maximize the minimum rate
across broadband towers in the network. Depending on the population density and
traffic demands of the location under consideration, we discuss the suitable
choice of cell size for the backhaul network. Using the example of available TV
white space channels in Wichita, Kansas (a small city located in central USA),
we provide illustrative numerical examples for designing such wireless backhaul
network
On Capacity and Delay of Multi-channel Wireless Networks with Infrastructure Support
In this paper, we propose a novel multi-channel network with infrastructure
support, called an MC-IS network, which has not been studied in the literature.
To the best of our knowledge, we are the first to study such an MC-IS network.
Our proposed MC-IS network has a number of advantages over three existing
conventional networks, namely a single-channel wireless ad hoc network (called
an SC-AH network), a multi-channel wireless ad hoc network (called an MC-AH
network) and a single-channel network with infrastructure support (called an
SC-IS network). In particular, the network capacity of our proposed MC-IS
network is times higher than that of an SC-AH network and an
MC-AH network and the same as that of an SC-IS network, where is the number
of nodes in the network. The average delay of our MC-IS network is times lower than that of an SC-AH network and an MC-AH network, and
times lower than the average delay of an SC-IS network, where
and denote the number of channels dedicated for infrastructure
communications and the number of interfaces mounted at each infrastructure
node, respectively. Our analysis on an MC-IS network equipped with
omni-directional antennas only has been extended to an MC-IS network equipped
with directional antennas only, which are named as an MC-IS-DA network. We show
that an MC-IS-DA network has an even lower delay of compared with an SC-IS network and our
MC-IS network. For example, when and , an
MC-IS-DA network can further reduce the delay by 24 times lower that of an
MC-IS network and reduce the delay by 288 times lower than that of an SC-IS
network.Comment: accepted, IEEE Transactions on Vehicular Technology, 201
Detection of Link Failures and Autonomous Reconfiguration in WMNs
During their lifetime, multihop wireless mesh networks (WMNs) experience frequent link failures caused by channel interference, dynamic obstacles, and/or applications’ bandwidth demands. By reconfiguring these link failures ARS generates an effective reconfiguration plan that requires only local network configuration changes by exploiting channel, radio, and path diversity. ARS effectively identifies reconfiguration plans that satisfy QoS constraints. And ARS's online reconfigurability allows for real-time time failure detection and network reconfiguration. ARS is mainly evaluated in IEEE 802.11a networks. It's design goal is to reconfigure from network link failures accurately. Even then WMNs face some frequent link failures. By overcome these problems we present Localized sElf-reconfiGuration algOrithms (LEGO) to autonomously and effectively recnfigure from wireless link failures. First, LEGO locally detects link failures. Second, it dynamically forms/deforms a local group for cooperative network reconfiguration among local mesh routers in a fully distributed manner. Next, LEGO intelligently generates a local network reconfiguration plan. Finally, by figuring local channel utilization and reconfiguration cost in its planning, LEGO maximizes the network’s ability to meet diverse links’ QoS demands. LEGO has been implemented on a Linux-based system and experimented on a real life test bed, demonstrating its effectiveness in recovering from link failures and its improvement of channel efficiency by up to 92%. Keywords - Self-Reconfigurable Networks, Multi-Radio Wireless Networks, IEEE 802.11, WLAN access points (AP)
Multihop Diversity in Wideband OFDM Systems: The Impact of Spatial Reuse and Frequency Selectivity
The goal of this paper is to establish which practical routing schemes for
wireless networks are most suitable for wideband systems in the power-limited
regime, which is, for example, a practically relevant mode of operation for the
analysis of ultrawideband (UWB) mesh networks. For this purpose, we study the
tradeoff between energy efficiency and spectral efficiency (known as the
power-bandwidth tradeoff) in a wideband linear multihop network in which
transmissions employ orthogonal frequency-division multiplexing (OFDM)
modulation and are affected by quasi-static, frequency-selective fading.
Considering open-loop (fixed-rate) and closed-loop (rate-adaptive) multihop
relaying techniques, we characterize the impact of routing with spatial reuse
on the statistical properties of the end-to-end conditional mutual information
(conditioned on the specific values of the channel fading parameters and
therefore treated as a random variable) and on the energy and spectral
efficiency measures of the wideband regime. Our analysis particularly deals
with the convergence of these end-to-end performance measures in the case of
large number of hops, i.e., the phenomenon first observed in \cite{Oyman06b}
and named as ``multihop diversity''. Our results demonstrate the realizability
of the multihop diversity advantages in the case of routing with spatial reuse
for wideband OFDM systems under wireless channel effects such as path-loss and
quasi-static frequency-selective multipath fading.Comment: 6 pages, to be published in Proc. 2008 IEEE International Symposium
on Spread Spectrum Techniques and Applications (IEEE ISSSTA'08), Bologna,
Ital
- …