Spelling suggestions: "subject:"multihop wireless networks"" "subject:"multihops wireless networks""
1 |
Multihop Transmission Opportunistic Protocol on Software RadioHirve, Sachin C. 08 October 2009 (has links)
No description available.
|
2 |
Évaluation de la bande passante disponible et traitement du partage dans les réseaux sans fil multisauts basés sur le standard IEEE 802.11 DCF / Performance evaluation and improvement of IEEE 802.11 in multihop wireless networksNguyen, Van Nam 10 December 2012 (has links)
Les réseaux sans fil multisauts présentent un certain nombre d'intérêts car ils n'ont pas besoin d'infrastructure fixe, sont peu coûteux et sont simples d'utilisation. Le mode DCF de IEEE 802.11 est souvent utilisé comme le protocole d'accès au canal pour les nœuds dans ces réseaux. Un avantage de ce protocole est qu'il est facile à implémenter. Pourtant, ses performances dépendent de deux facteurs importants : le partage du canal sans fil et les collisions entre paquets provenant des nœuds cachés. L'évaluation de ces paramètres est donc importante afin d'améliorer la performance de ce protocole. La première partie de la thèse est consacrée à l'évaluation de la bande passante disponible. C'est un paramètre qui est souvent utilisé pour le contrôle d'admission ou pour le routage dans ces réseaux. Dans la littérature, il existe de nombreuses méthodes qui permettent d'estimer la bande passante disponible sur un lien sans fil. Pourtant, ces méthodes ne prennent pas en compte la notion de retransmission qui est définie dans IEEE 802.11 et qui a clairement des impacts sur la bande passante disponible. Nous proposons donc une nouvelle méthode passive, appelée RABE (Retransmission-based Available Bandwidth Estimation). Notre méthode se base principalement sur des informations locales qui peuvent être détectées par chaque nœud du lien. Nous évaluons également la probabilité de collisions non conditionnelle des paquets provenant des nœuds cachés via un modèle analytique. Cette probabilité nous permet d'estimer le nombre moyen de retransmissions qui est ensuite utilisé pour évaluer d'autres paramètres utilisé par RABE. Les simulations réalisées avec le simulateur ns2.33 montrent que notre méthode produit des résultats plus précis que d'autres méthodes existantes / The first part of the thesis is devoted to the evaluation of the available bandwidth. This is a parameter that is often used for admission control in these networks. In the literature, there are many methods for estimating the available bandwidth on a wireless link. However, these methods do not take into account the concept of retransmission which is defined in IEEE 802.11 and have clear impacts on the available bandwidth. We propose therefore a new passive method called RABE (Retransmission-based Available Bandwidth Estimation). Our method is based mainly on local information that can be detected by each node. We also evaluate the unconditional collision probability of packets from hidden nodes via an analytical model. This probability allows us to estimate the average number of retransmissions, which is then used to evaluate other parameters used by RABE. The simulations performed with the simulator ns2.33 show that our method produces more accurate results than other existing solutions. In the second part, we focus on the distribution of idle periods of a node that is often used to evaluate the performance of wireless networks based on IEEE 802.11. The problem is that there are different assumptions for this distribution in literature. We first characterize different types of idle periods in some fundamental scenarios such as the scenario as asymetric hidden stations and the scenario of flow in the middle. We then generalize these types of idle periods for relatively highly loaded networks. The obtained simulation results in ns2.33 are similar to our proposed model. This work also brings out that these distributions are multimodal, unlike what is often assumed in the literature
|
3 |
On Design and Analysis of Energy Efficient Wireless Networks with QoSVankayala, Satya Kumar January 2017 (has links) (PDF)
We consider optimal power allocation policies for a single server, multiuser wireless communication system. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity. We also provide closed-form optimal power policies when there is a hard deadline delay constraint.
Later on, we also extend single hop results to multihop networks. First we consider the case, when the transmission rate is a linear function of power. We provide low complexity algorithms for joint routing, scheduling and power control which ensure stability of the queues, certain minimum rates, end-to-end hard deadlines, and/or upper bounds on the end-to-end mean delays. Further we extend these results to the multihop networks where the power is a general monotonically increasing function of rate. For our algorithms, we also provide rates of convergence to the stationary distributions for the queue length process and also approximate end-to-end mean delays. Finally, we provide computationally efficient algorithms that minimize the total power when there is a end-to-end hard deadline delay constraint.
|
4 |
Network coding for multihop wireless networks : joint random linear network coding and forward error correction with interleaving for multihop wireless networksSusanto, Misfa January 2015 (has links)
Optimising the throughput performance for wireless networks is one of the challenging tasks in the objectives of communication engineering, since wireless channels are prone to errors due to path losses, random noise, and fading phenomena. The transmission errors will be worse in a multihop scenario due to its accumulative effects. Network Coding (NC) is an elegant technique to improve the throughput performance of a communication network. There is the fact that the bit error rates over one modulation symbol of 16- and higher order- Quadrature Amplitude Modulation (QAM) scheme follow a certain pattern. The Scattered Random Network Coding (SRNC) system was proposed in the literature to exploit the error pattern of 16-QAM by using bit-scattering to improve the throughput of multihop network to which is being applied the Random Linear Network Coding (RLNC). This thesis aims to improve further the SRNC system by using Forward Error Correction (FEC) code; the proposed system is called Joint RLNC and FEC with interleaving. The first proposed system (System-I) uses Convolutional Code (CC) FEC. The performances analysis of System-I with various CC rates of 1/2, 1/3, 1/4, 1/6, and 1/8 was carried out using the developed simulation tools in MATLAB and compared to two benchmark systems: SRNC system (System-II) and RLNC system (System- III). The second proposed system (System-IV) uses Reed-Solomon (RS) FEC code. Performance evaluation of System IV was carried out and compared to three systems; System-I with 1/2 CC rate, System-II, and System-III. All simulations were carried out over three possible channel environments: 1) AWGN channel, 2) a Rayleigh fading channel, and 3) a Rician fading channel, where both fading channels are in series with the AWGN channel. The simulation results show that the proposed system improves the SRNC system. How much improvement gain can be achieved depends on the FEC type used and the channel environment.
|
5 |
Network Coding for Multihop Wireless Networks: Joint Random Linear Network Coding and Forward Error Correction with Interleaving for Multihop Wireless NetworksSusanto, Misfa January 2015 (has links)
Optimising the throughput performance for wireless networks is one of the
challenging tasks in the objectives of communication engineering, since wireless
channels are prone to errors due to path losses, random noise, and fading
phenomena. The transmission errors will be worse in a multihop scenario due to its
accumulative effects. Network Coding (NC) is an elegant technique to improve the
throughput performance of a communication network. There is the fact that the bit
error rates over one modulation symbol of 16- and higher order- Quadrature
Amplitude Modulation (QAM) scheme follow a certain pattern. The Scattered
Random Network Coding (SRNC) system was proposed in the literature to exploit
the error pattern of 16-QAM by using bit-scattering to improve the throughput of
multihop network to which is being applied the Random Linear Network Coding
(RLNC). This thesis aims to improve further the SRNC system by using Forward
Error Correction (FEC) code; the proposed system is called Joint RLNC and FEC
with interleaving.
The first proposed system (System-I) uses Convolutional Code (CC) FEC. The
performances analysis of System-I with various CC rates of 1/2, 1/3, 1/4, 1/6, and
1/8 was carried out using the developed simulation tools in MATLAB and compared
to two benchmark systems: SRNC system (System-II) and RLNC system (System-
III). The second proposed system (System-IV) uses Reed-Solomon (RS) FEC
code. Performance evaluation of System IV was carried out and compared to three
systems; System-I with 1/2 CC rate, System-II, and System-III. All simulations were
carried out over three possible channel environments: 1) AWGN channel, 2) a
Rayleigh fading channel, and 3) a Rician fading channel, where both fading
channels are in series with the AWGN channel. The simulation results show that
the proposed system improves the SRNC system. How much improvement gain
can be achieved depends on the FEC type used and the channel environment. / Indonesian Government and the University of Bradford
|
Page generated in 0.0784 seconds