Evaluation and Optimization in Dense Wireless Networks

The main objective of this thesis is to analyze the performance of wireless networks under various scenarios: stationary, mobile, single-hop and multi-hop networks. Our main focus in the first two parts of this thesis is on the geometric placement of simultaneous transmitters in the network. In the first part, we study the impact of the placement of transmitters, by the medium access control scheme, on the performance of single-hop wireless network. We establish a general framework and study the optimal placement of transmitters in the network. Later we compare this optimal placement with placements obtained by random point processes such as Poisson point process, ALOHA, node coloring and CSMA. Our analysis allows us to evaluate the per- formance gains of a highly managed medium access control that would be required to implement the optimal placement of transmitters. For instance, we show that the capacity of this highly managed medium access control cannot be more than twice the capacity of a low managed medium access control such as ALOHA. Later, we use analytical methods to evaluate the heuristics for optimizing the capacity and coverage in an existing cellular network by optimally locating additional base stations. In the second part, we extend our analysis to multi-hop wireless network where we evaluate the optimum transmission range and network throughput capacity with various medium access control schemes. Our analyses in the first two parts of this thesis allow us to gain perspectives into the theoretical limits on the performance of an optimized medium access control in single-hop and multi-hop wireless network. In the last part, we shift our focus to capacity-delay tradeoff in mobile wireless network. We propose a georouting scheme and study its scaling properties. Using a realistic mobility model and the information available at mobile nodes, our scheme achieves a delay which is bounded by a constant with network capacity that increases quasi-linearly when the number of nodes in the network increases and approaches infinity.

Data and Resources

Additional Info

Field Value
Source https://theses.hal.science/tel-00719083
Author Malik, Salman
Maintainer CCSD
Last Updated May 30, 2026, 00:58 (UTC)
Created May 30, 2026, 00:58 (UTC)
Identifier tel-00719083
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor High performance communication (HIPERCOM) ; Inria Paris-Rocquencourt ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris-Sud - Paris 11 (UP11)-Centre Inria de Saclay ; Institut National de Recherche en Informatique et en Automatique (Inria)-École polytechnique (X) ; Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)
creator Malik, Salman
date 2012-11-16T00:00:00
harvest_object_id e10745f3-8c49-4788-9bce-5c60422d6d36
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-08-20T00:00:00
set_spec type:THESE