Abstract
The last couple of years have seen the advent of wireless networks, doped by their ease of deployment and their use in multiple fields: personal WiFi networks, mobile telephony, ad hoc networks, sensors networks, ...The subject of this thesis relates to the study of algorithmic problems directly inspired by operating constraints which can be found in such networks. This manuscrit is divided into three parts.<br />The first part of our work is devoted to the study of the problem of broadcasting a single source node message to all the other nodes of a network. This problem is tackled in various communication models. All the considered model suppose range-fixed omnidirectional transmissions subject to interference phenomena. It results from that, that any given node is unable to retrieve simultaneously two incoming transmissions. We study the complexity of this problem and propose some strategies in order to solve it.<br />In a second part, We study another algorithmic problem in the same communication model, whose object is to satisfy a given set of communication requests. Our work consists in etablishing the complexity of this problem, and studying the impact of various factors on this complexity.<br />The last part considers the problem of designing survivable radio networks . The objective is to ensure a distribution of bandwidth from source nodes to customers nodes, by minimizing the cost of the deployed infrastructure. Communications are made via directional antennas, and are not subjects to interferences. The difficulty of the problem lies in the satisfaction of deployment constraints (limited number of antennas per node, robustness against failures of nodes, ...). We study the complexity of this problem, and propose exact and approximated resolution methods to solve reasonable size instances.