8,556 research outputs found
Cross-Layer Design for QoS Routing in Multi-Hop Wireless Networks
Mobile Ad Hoc Networks (MANETs) are gaining increasing popularity in recent years because of their ease of deployment. They are distributed, dynamic, and self-configurable without infrastructure support. Routing in ad hoc networks is a challenging task because of the MANET dynamic nature. Hence, researchers were focused in designing best-effort distributed and dynamic routing protocols to ensure optimum network operations in an unpredictable wireless environment. Nowadays, there is an increased demand on multimedia applications (stringent delay and reliability requirements), which makes a shift from best-effort services to Quality of Services.
Actually, the challenge in wireless ad hoc networks is that neighbor nodes share the same channel and they take part in forwarding packets. Therefore, the total effective channel capacity is not only limited by the raw channel capacity but is also limited by the interactions and interferences among neighboring nodes. Thus, such factors should be taken in consideration in order to offer QoS routing. While, some of the distributed QoS route selection algorithms assume the availability of such information, others propose mechanisms to estimate them.
The goals of this thesis are: (i) to analyze the performance of IEEE 802.11 MAC mechanism in non-saturation conditions, (ii) to use the analysis in the context of multi-hop ad hoc networks, (iii) to derive theoretical limits for nodes performance in multi-hop ad hoc networks, (iv) to use the multi-hop analysis in QoS route selection.
We start the thesis by proposing a discrete-time 3D Markov chain model to analyze the saturation performance of the RTS/CTS access mode. This model integrates the backoff countdown process, retransmission retry limits, and transmission errors into one model. The impact of system parameters (e.g., number of nodes, packet size, retry limits, and BERs) are analyzed. Next, we extend the 3D model to analyze the performance under non-saturation conditions and finite buffer capacity using two different approaches. First, we extend the 3D model into a 4D model to integrate the transmission buffer behavior. Second, we replace the 4D model by an M/G/1/K queueing system model with independent samples from the saturation analysis. The latter model gives similar results as the former but with a reduction in the analysis complexity. Next and by means of the non-saturation analysis, we proposed an approximate mathematical model for multi-hop ad hoc networks. Furthermore, we proposed an iterative mechanism to estimate the throughput in the presence of multiple flows. Finally, we used the multi-hop analysis to propose a QoS route selection algorithm. In this algorithm, we concentrate on the throughput as a QoS parameter. However, the proposed algorithm is valid to be used with other QoS parameters, such as packet delay, packet loss probability, and fairness. Analytical and simulation results show the deficiency of the current route selection algorithm in AODV and at the same time verifies the need for QoS route selection algorithms
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
An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection
This paper develops upper bounds on the end-to-end transmission capacity of
multi-hop wireless networks. Potential source-destination paths are dynamically
selected from a pool of randomly located relays, from which a closed-form lower
bound on the outage probability is derived in terms of the expected number of
potential paths. This is in turn used to provide an upper bound on the number
of successful transmissions that can occur per unit area, which is known as the
transmission capacity. The upper bound results from assuming independence among
the potential paths, and can be viewed as the maximum diversity case. A useful
aspect of the upper bound is its simple form for an arbitrary-sized network,
which allows insights into how the number of hops and other network parameters
affect spatial throughput in the non-asymptotic regime. The outage probability
analysis is then extended to account for retransmissions with a maximum number
of allowed attempts. In contrast to prevailing wisdom, we show that
predetermined routing (such as nearest-neighbor) is suboptimal, since more hops
are not useful once the network is interference-limited. Our results also make
clear that randomness in the location of relay sets and dynamically varying
channel states is helpful in obtaining higher aggregate throughput, and that
dynamic route selection should be used to exploit path diversity.Comment: 14 pages, 5 figures, accepted to IEEE Transactions on Information
Theory, 201
Multi-channel Wireless Networks with Infrastructure Support: Capacity and Delay
In this paper, we propose a novel multi-channel network with infrastructure
support, called an \textit{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
\textit{MC-IS} network. Our \textit{MC-IS} network is equipped with a number of
infrastructure nodes which can communicate with common nodes using a number of
channels where a communication between a common node and an infrastructure node
is called an infrastructure communication and a communication between two
common nodes is called an ad-hoc communication. Our proposed \textit{MC-IS}
network has a number of advantages over three existing conventional networks,
namely a single-channel wireless ad hoc network (called an \textit{SC-AH}
network), a multi-channel wireless ad hoc network (called an \textit{MC-AH}
network) and a single-channel network with infrastructure support (called an
\textit{SC-IS} network). In particular, the \textit{network capacity} of our
proposed \textit{MC-IS} network is times higher than that of
an \textit{SC-AH} network and an \textit{MC-AH} network and the same as that of
an \textit{SC-IS} network, where is the number of nodes in the network. The
\textit{average delay} of our \textit{MC-IS} network is times
lower than that of an \textit{SC-AH} network and an \textit{MC-AH} network, and
times lower than the average delay of an \textit{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.Comment: 12 pages, 6 figures, 3 table
Research on Wireless Multi-hop Networks: Current State and Challenges
Wireless multi-hop networks, in various forms and under various names, are
being increasingly used in military and civilian applications. Studying
connectivity and capacity of these networks is an important problem. The
scaling behavior of connectivity and capacity when the network becomes
sufficiently large is of particular interest. In this position paper, we
briefly overview recent development and discuss research challenges and
opportunities in the area, with a focus on the network connectivity.Comment: invited position paper to International Conference on Computing,
Networking and Communications, Hawaii, USA, 201
Adaptive Resource Control in 2-hop Ad-Hoc Networks
This paper presents a simple resource control\ud
mechanism with traffic scheduling for 2-hop ad-hoc networks, in\ud
which the Request-To-Send (RTS) packet is utilized to deliver\ud
feedback information. With this feedback information, the\ud
Transmission Opportunity (TXOP) limit of the sources can be\ud
controlled to balance the traffic. Furthermore, a bottleneck\ud
transmission scheduling scheme is introduced to provide fairness\ud
between local and forwarding flows. The proposed mechanism is\ud
modeled and evaluated using the well-known 20-sim dynamic\ud
system simulator. Experimental results show that a fairer and\ud
more efficient bandwidth utilization can be achieved than\ud
without the feedback mechanism. The use of the structured and\ud
formalized control-theoretical modeling framework has as\ud
advantage that results can be obtained in a fast and efficient way
PACE: Simple Multi-hop Scheduling for Single-radio 802.11-based Stub Wireless Mesh Networks
IEEE 802.11-based Stub Wireless Mesh Networks (WMNs) are a cost-effective and flexible solution to extend wired network infrastructures. Yet, they suffer from two major problems: inefficiency and unfairness. A number of approaches have been proposed to tackle these problems, but they are too restrictive, highly complex, or require time synchronization and modifications to the IEEE 802.11 MAC.
PACE is a simple multi-hop scheduling mechanism for Stub WMNs overlaid on the IEEE 802.11 MAC that jointly addresses the inefficiency and unfairness problems. It limits transmissions to a single mesh node at each time and ensures that each node has the opportunity to transmit a packet in each network-wide transmission round. Simulation results demonstrate that PACE can achieve optimal network capacity utilization and greatly outperforms state of the art CSMA/CA-based solutions as far as goodput, delay, and fairness are concerned
Continuum Equilibria and Global Optimization for Routing in Dense Static Ad Hoc Networks
We consider massively dense ad hoc networks and study their continuum limits
as the node density increases and as the graph providing the available routes
becomes a continuous area with location and congestion dependent costs. We
study both the global optimal solution as well as the non-cooperative routing
problem among a large population of users where each user seeks a path from its
origin to its destination so as to minimize its individual cost. Finally, we
seek for a (continuum version of the) Wardrop equilibrium. We first show how to
derive meaningful cost models as a function of the scaling properties of the
capacity of the network and of the density of nodes. We present various
solution methodologies for the problem: (1) the viscosity solution of the
Hamilton-Jacobi-Bellman equation, for the global optimization problem, (2) a
method based on Green's Theorem for the least cost problem of an individual,
and (3) a solution of the Wardrop equilibrium problem using a transformation
into an equivalent global optimization problem
- âŠ