We question about multihop gets better performance than single hop in wireless networks. In this paper we design a new and simple multihop transmission model called PESR, performance enhancement of IEEE 802.11 by spatial reuse. We elect an intermediate node which between a source-destination pair for forwarding packets to become multihop instead of directly transmission from the source to the destination. By this way, we will have more links at the one time, the channel utilization should be grown and we will get better system performance. However, there is much overhead we have not considered. We will discuss the detail about overhead in coming sections. In fact, the results of simulation show that the performance is not present very well. And we wonder if the multihop in wireless networks is a pretty good idea.

In this thesis we investigate the performance of spatial reuse in wireless networks. More specifically, we investigate the performance of location-based spatial reuse built upon the identification of links in the network that form Collision-Free Sets (CFSs). We develop algorithms that efficiently find such CFSs. The main focus of this thesis is the application of our CFS-based algorithms to emerging WiMAX (Worldwide Interoperability for Microwave Access) networks. However, we will also apply our CFS-based algorithms to smaller scale networks, as well as to the issue of QoS routing. This thesis makes several contributions. We first show how CFSs can be found within polynomial time in small scale wireless networks. We then probe how CFSs can be used to enhance network efficiency when location is available. We also explore how CFS determination is affected by location error, determining what level of location error renders the use of CFSs ineffective. In this context, we discuss the density of access points required to ensure CFS-based spatial reuse remains effective. We then focus on the use of CFSs in emerging multihop WiMAX networks, showing in detail how enhanced spatial reuse is delivered. The spatial reuse gains are probed both in the presence of realistic channel conditions and realistic location errors. Within the context of the IEEE 802.16 standard we show how CFSs can enhance, by factors of two, the VoIP capacity of multihop WiMAX networks. We also discuss how our CFS algorithms can be applied to other ongoing efforts aimed at improving VoIP capacity in WiMAX networks. Finally, an application of our CFS algorithms in the context of QoS routing is studied. Specifically, we develop a two-hop QoS routing protocol that guarantees QoS specifications by securing higher bandwidth for the chosen routes.

In this thesis we investigate the performance of spatial reuse in wireless networks. More specifically, we investigate the performance of location-based spatial reuse built upon the identification of links in the network that form Collision-Free Sets (CFSs). We develop algorithms that efficiently find such CFSs. The main focus of this thesis is the application of our CFS-based algorithms to emerging WiMAX (Worldwide Interoperability for Microwave Access) networks. However, we will also apply our CFS-based algorithms to smaller scale networks, as well as to the issue of QoS routing. This thesis makes several contributions. We first show how CFSs can be found within polynomial time in small scale wireless networks. We then probe how CFSs can be used to enhance network efficiency when location is available. We also explore how CFS determination is affected by location error, determining what level of location error renders the use of CFSs ineffective. In this context, we discuss the density of access points required to ensure CFS-based spatial reuse remains effective. We then focus on the use of CFSs in emerging multihop WiMAX networks, showing in detail how enhanced spatial reuse is delivered. The spatial reuse gains are probed both in the presence of realistic channel conditions and realistic location errors. Within the context of the IEEE 802.16 standard we show how CFSs can enhance, by factors of two, the VoIP capacity of multihop WiMAX networks. We also discuss how our CFS algorithms can be applied to other ongoing efforts aimed at improving VoIP capacity in WiMAX networks. Finally, an application of our CFS algorithms in the context of QoS routing is studied. Specifically, we develop a two-hop QoS routing protocol that guarantees QoS specifications by securing higher bandwidth for the chosen routes.

This thesis focuses on the design of linear precoding schemes for downlink multiple-input multiple-output (MIMO) networks. These schemes are designed to be amenable to implementation in wireless networks that allow rate-limited feedback of channel state information (CSI). In the first half of this thesis, memoryless quantization codebooks are designed and incremental vector quantization techniques are developed for the representation of CSI in MIMO point-to-point links and isolated (single-cell) downlink networks. The second half of the thesis seeks to design linear precoding schemes for the multi-cell downlink networks that can achieve improved performance without requiring significantly more communication resources for CSI feedback than those required in the case of an isolated single-cell. For the quantization problem, smooth optimization algorithms are developed for the design of codebooks that possess attractive features that facilitate their implementation in practice in the addition to having good quantization properties. As one example, the proposed approach is used to design rank-2 codebooks that have a nested structure and elements from a phase-shift keying (PSK) alphabet. The designed codebooks have larger minimum distances than some existing codebooks, and provide tangible performance gains. To take advantage of temporal correlation that may exist in the wireless channel, an incremental approach to the Grassmannian quantization problem is proposed. This approach leverages existing codebooks for memoryless quantization schemes and employs a quantized form of geodesic interpolation. Two schemes that implement the principles of the proposed approach are presented. A distinguishing feature of the proposed approach is that the direction of the geodesic interpolation is specified implicitly using a point in a conventional codebook. As a result, the approach has an inherent ability to recover autonomously from errors in the feedback path. In addition to the development of the Grassmannian quantization techniques and codebooks, this thesis studies linear precoder design for the downlink MIMO networks in the cases of small networks of arbitrary topology and unbounded networks that have typical architectures. In particular, a linear precoding scheme for the isolated 2-cell network that achieves the optimal spatial degrees of freedom of the network is proposed. The implementation of a limited feedback model for the proposed linear precoding scheme is developed as well. Based on insight from that model, other linear precoding schemes that can be implemented in larger networks, but with finite size, are developed. For unbounded networks of typical architecture, such as the hexagonal arrangement of cells, linear precoding schemes that exploit the partial connectivity of the network are presented under a class of precoding schemes that is referred to as spatial reuse precoding. These precoding schemes provide substantial gains in the achievable rates of users in the network, and require only local feedback. / Thesis / Doctor of Philosophy (PhD)

No description available.

For opportunistic spectrum access and spectrum sharing in cognitive radio networks, one key problem is how to develop wireless access schemes for secondary users so that harmful interference to primary users can be avoided and quality-of-service (QoS) of secondary users can be guaranteed. In this research, dynamic wireless access protocols for secondary users are designed and optimized for both infrastructure-based and ad-hoc wireless networks. Under the infrastructure-based model, the secondary users are connected through a controller (i.e., an access point). In particular, the problem of wireless access for eHealth applications is considered. In a single service cell, an innovative wireless access scheme, called electromagnetic interference (EMI)-aware prioritized wireless access, is proposed to address the issues of EMI to the medical devices and QoS differentiation for different eHealth applications. Afterwards, the resource management problem for multiple service cells, specifically, in multiple spatial reuse time-division multiple access (STDMA) networks is addressed. The problem is formulated as a dual objective optimization problem that maximizes the spectrum utilization of secondary users and minimizes their power consumption subject to the EMI constraints for active and passive medical devices and minimum throughput guarantee for secondary users. Joint scheduling and power control algorithms based on greedy approaches are proposed to solve the problem with much less computational complexity. In an ad-hoc wireless network, the robust transmission scheduling and power control problem for collision-free spectrum sharing between secondary and primary users in STDMA wireless networks is investigated. Traditionally, the problem only considers the average link gains; therefore, QoS violation can occur due to improper power allocation with respect to instantaneous channel gain realization. To overcome this problem, a robust power control problem is formulated. A column generation based algorithm is proposed to solve the problem by considering only the potential subset of variables when solving the problem. To increase the scalability, a novel distributed two-stage algorithm based on the distributed column generation method is then proposed to obtain the near-optimal solution of the robust transmission schedules for vertical spectrum sharing in an ad-hoc wireless network.

For opportunistic spectrum access and spectrum sharing in cognitive radio networks, one key problem is how to develop wireless access schemes for secondary users so that harmful interference to primary users can be avoided and quality-of-service (QoS) of secondary users can be guaranteed. In this research, dynamic wireless access protocols for secondary users are designed and optimized for both infrastructure-based and ad-hoc wireless networks. Under the infrastructure-based model, the secondary users are connected through a controller (i.e., an access point). In particular, the problem of wireless access for eHealth applications is considered. In a single service cell, an innovative wireless access scheme, called electromagnetic interference (EMI)-aware prioritized wireless access, is proposed to address the issues of EMI to the medical devices and QoS differentiation for different eHealth applications. Afterwards, the resource management problem for multiple service cells, specifically, in multiple spatial reuse time-division multiple access (STDMA) networks is addressed. The problem is formulated as a dual objective optimization problem that maximizes the spectrum utilization of secondary users and minimizes their power consumption subject to the EMI constraints for active and passive medical devices and minimum throughput guarantee for secondary users. Joint scheduling and power control algorithms based on greedy approaches are proposed to solve the problem with much less computational complexity. In an ad-hoc wireless network, the robust transmission scheduling and power control problem for collision-free spectrum sharing between secondary and primary users in STDMA wireless networks is investigated. Traditionally, the problem only considers the average link gains; therefore, QoS violation can occur due to improper power allocation with respect to instantaneous channel gain realization. To overcome this problem, a robust power control problem is formulated. A column generation based algorithm is proposed to solve the problem by considering only the potential subset of variables when solving the problem. To increase the scalability, a novel distributed two-stage algorithm based on the distributed column generation method is then proposed to obtain the near-optimal solution of the robust transmission schedules for vertical spectrum sharing in an ad-hoc wireless network.

Au cours des dernières années, les communications inter-véhicule (IVC) sont devenues un domaine de recherche intensif, en particulier dans le cadre des systèmes de transport intelligents. Il suppose que la totalité ou une partie des véhicules est équipé de dispositifs radio permettant la communication entre eux. La norme IEEE 802.11p (normalisé pour la communication des véhicules) devrait être la technologie de facto pour ces communications. En utilisant son mode ad hoc, cette technologie radio permet aux véhicules d'étendre la portée de leur communication en formant un réseau multi-saut sans fil Ad - hoc, également appelé Vehicle ad hoc NETwork (VANET). Cette thèse aborde un problème fondamental des VANET : la capacité du réseau. Deux modèles théoriques simples ont été proposés dans cette thèse pour calculer cette capacité: un « packing problem » (la traduction française nous est inconnue) et un modèle Markovien. Ils offrent des formules simples et fermées sur le nombre maximum d'émetteurs simultanés, et sur la distribution de la distance entre eux. Une borne supérieure sur cette capacité a été proposée. De plus, le modèle Markovien a permis de proposer une formule analytique sur la distribution spatiale des émetteurs. Ces quantités nous permettent, entre autres, de paramétrer le mécanisme d’accès au medium du 802.11p, comme par exemple le seuil du CCA (Clear Channel Assessment), amenant à une optimisation de la capacité du réseau. Afin de valider les différentes contributions théoriques de cette thèse, les résultats des modèles analytiques ont été comparés à des simulations effectuées avec le simulateur de réseau NS-3. Les paramètres de simulations ont été estimés à partir d’expérimentations réelles. De plus, différentes distributions de trafic (trafic de véhicules) ont été considéré afin d’évaluer leur impact sur la capacité du réseau. L’une des applications de cette thèse est le dimensionnement des applications de sécurité routière vis-à-vis de la consommation des ressources réseau. Dans ce cadre, nous nous sommes intéressés aux reconstructions de cartes. Il faut comprendre ICI LA reconstitution de l’environnement d’un véhicule (perception map). Ces applications utilisent des informations provenant de capteurs locaux et distants afin d’offrir un système d’aide à la conduite (conduite autonome, alerte sur des collisions, annonce de situations accidentogènes, etc.). Ces applications nécessitent une bande passante élevée. Notre étude théorique a montré que cette bande passante ne sera sans doute pas disponible en pratique dans les réseaux IEEE 802.11p. Par conséquent, UN algorithme adaptatif de contrôle de puissance a été proposé et optimisé pour cette application particulière. Nous avons montré que notre algorithme, par le biais d'un modèle analytique et d'un grand nombre de simulations que la capacité du réseau est augmentée de manière significative. / In recent years, Inter Vehicle Communication (IVC) has become an intensive research area, as part of Intelligent Transportation Systems. It supposes that all, or a subset of the vehicles is equipped with radio devices, enabling communication between them. IEEE 802.11p (standardized for vehicular communication) shows a great deal of promise. By using ad hoc mode, this radio technology allows vehicles to extend their scopes of communication and thus forming a Multi-hop wireless Ad-hoc NETwork, also called Vehicular Ad-hoc NETwork (VANET). This thesis addresses a fundamental problem of VANET: the network capacity. Two simple theoretical models to estimate this capacity have been proposed: a packing model and a Markovian point process model. They offer simple and closed formulae on the maximum number of simultaneous transmitters, and on the distribution of the distance between them. An accurate upper bound on the maximum capacity had been derived. An analytical formula on distribution of the transmitters had been presented. This distribution allows us to optimize Clear Channel Assessment (CCA) parameters that leads to an optimization of the network capacity.In order to validate the approach of this thesis, results from the analytical models are compared to simulations performed with the network simulator NS-3. Simulation parameters was estimated from real experimentation. Impact of different traffic distributions (traffic of vehicles) on the network capacity is also studied. This thesis also focuses on extended perception map applications, which use information from local and distant sensors to offer driving assistance (autonomous driving, collision warning, etc.). Extended perception requires a high bandwidth that might not be available in practice in classical IEEE 802.11p ad hoc networks. Therefore, this thesis proposes an adaptive power control algorithm optimized for this particular application. It shows through an analytical model and a large set of simulations that the network capacity is then significantly increased.

In recent years, Inter Vehicle Communication (IVC) has become an intensive research area, as part of Intelligent Transportation Systems. It supposes that all, or a subset of the vehicles is equipped with radio devices, enabling communication between them. IEEE 802.11p (standardized for vehicular communication) shows a great deal of promise. By using ad hoc mode, this radio technology allows vehicles to extend their scopes of communication and thus forming a Multi-hop wireless Ad-hoc NETwork, also called Vehicular Ad-hoc NETwork (VANET). This thesis addresses a fundamental problem of VANET: the network capacity. Two simple theoretical models to estimate this capacity have been proposed: a packing model and a Markovian point process model. They offer simple and closed formulae on the maximum number of simultaneous transmitters, and on the distribution of the distance between them. An accurate upper bound on the maximum capacity had been derived. An analytical formula on distribution of the transmitters had been presented. This distribution allows us to optimize Clear Channel Assessment (CCA) parameters that leads to an optimization of the network capacity.In order to validate the approach of this thesis, results from the analytical models are compared to simulations performed with the network simulator NS-3. Simulation parameters was estimated from real experimentation. Impact of different traffic distributions (traffic of vehicles) on the network capacity is also studied. This thesis also focuses on extended perception map applications, which use information from local and distant sensors to offer driving assistance (autonomous driving, collision warning, etc.). Extended perception requires a high bandwidth that might not be available in practice in classical IEEE 802.11p ad hoc networks. Therefore, this thesis proposes an adaptive power control algorithm optimized for this particular application. It shows through an analytical model and a large set of simulations that the network capacity is then significantly increased.