15,251 research outputs found
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
Broadcast Strategies with Probabilistic Delivery Guarantee in Multi-Channel Multi-Interface Wireless Mesh Networks
Multi-channel multi-interface Wireless Mesh Networks permit to spread the
load across orthogonal channels to improve network capacity. Although broadcast
is vital for many layer-3 protocols, proposals for taking advantage of multiple
channels mostly focus on unicast transmissions. In this paper, we propose
broadcast algorithms that fit any channel and interface assignment strategy.
They guarantee that a broadcast packet is delivered with a minimum probability
to all neighbors. Our simulations show that the proposed algorithms efficiently
limit the overhead
Minimizing Flow Time in the Wireless Gathering Problem
We address the problem of efficient data gathering in a wireless network
through multi-hop communication. We focus on the objective of minimizing the
maximum flow time of a data packet. We prove that no polynomial time algorithm
for this problem can have approximation ratio less than \Omega(m^{1/3) when
packets have to be transmitted, unless . We then use resource
augmentation to assess the performance of a FIFO-like strategy. We prove that
this strategy is 5-speed optimal, i.e., its cost remains within the optimal
cost if we allow the algorithm to transmit data at a speed 5 times higher than
that of the optimal solution we compare to
Sub-Stream Fairness and Numerical Correctness in MIMO Interference Channels
Signal-to-interference plus noise ratio (SINR) and rate fairness in a system
are substantial quality-of-service (QoS) metrics. The acclaimed SINR
maximization (max-SINR) algorithm does not achieve fairness between user's
streams, i.e., sub-stream fairness is not achieved. To this end, we propose a
distributed power control algorithm to render sub-stream fairness in the
system. Sub-stream fairness is a less restrictive design metric than stream
fairness (i.e., fairness between all streams) thus sum-rate degradation is
milder. Algorithmic parameters can significantly differentiate the results of
numerical algorithms. A complete picture for comparison of algorithms can only
be depicted by varying these parameters. For example, a predetermined iteration
number or a negligible increment in the sum-rate can be the stopping criteria
of an algorithm. While the distributed interference alignment (DIA) can
reasonably achieve sub-stream fairness for the later, the imbalance between
sub-streams increases as the preset iteration number decreases. Thus comparison
of max-SINR and DIA with a low preset iteration number can only depict a part
of the picture. We analyze such important parameters and their effects on SINR
and rate metrics to exhibit numerical correctness in executing the benchmarks.
Finally, we propose group filtering schemes that jointly design the streams of
a user in contrast to max-SINR scheme that designs each stream of a user
separately.Comment: To be presented at IEEE ISWTA'1
Topology Control for Maintaining Network Connectivity and Maximizing Network Capacity Under the Physical Model
In this paper we study the issue of topology control under the physical Signal-to-Interference-Noise-Ratio (SINR) model, with the objective of maximizing network capacity. We show that existing graph-model-based topology control captures interference inadequately under the physical SINR model, and as a result, the interference in the topology thus induced is high and the network capacity attained is low. Towards bridging this gap, we propose a centralized approach, called Spatial Reuse Maximizer (MaxSR), that combines a power control algorithm T4P with a topology control algorithm P4T. T4P optimizes the assignment of transmit power given a fixed topology, where by optimality we mean that the transmit power is so assigned that it minimizes the average interference degree (defined as the number of interferencing nodes that may interfere with the on-going transmission on a link) in the topology. P4T, on the other hand, constructs, based on the power assignment made in T4P, a new topology by deriving a spanning tree that gives the minimal interference degree. By alternately invoking the two algorithms, the power assignment quickly converges to an operational point that maximizes the network capacity. We formally prove the convergence of MaxSR. We also show via simulation that the topology induced by MaxSR outperforms that derived from existing topology control algorithms by 50%-110% in terms of maximizing the network capacity
- …