Résumé Nous présentons des solutions algorithmiques pour deux problèmes liés à l’interférence de réseau sans fil. D’abord on propose de ordonnancer les liens d’un ensemble de routes données en vertu de l’hypothèse d’un modèle à fort trafic. Nous considérons un protocole TDMA qu’offre une source d’intervalles de temps synchronisés et cherchent à ordonnancer les itinéraires des liens afin de maxi...

This report addresses the problem of deriving fundamental trade-off bounds for wireless ad hoc networks when multiple performance criteria are of interest. It proposes a MultiObjective (MO) performance evaluation framework composed of a broadcast and interference-limited network model, a steady state performance metric derivation inspired by a discrete Markov chain formalism and formulates the ...

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...

For Wireless Personal Area Network (WPAN) systems, resource allocation between several users within a piconet and the coexistence of several piconets are very important points to take into consideration for the optimization of high data rate Ultra Wide Band (UWB) systems. To improve the performance of the Multi Band OFDM (Orthogonal Frequency Division Multiplex) solution proposed by the Multi B...

i Acknowledgements As a Sino-French Joint PhD student, I wish to express my sincere appreciation to my thesis advisors, Prof. Hong Sun and Prof. Kun-Mean Hou for their encouragement, guidance and support during this effort. It has been a great pleasure to learn from them during the process of my research. I want to express my deep gratitude to Prof. Xin Xu, for his support and inspiring guidanc...

This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, “neighboring links” cannot be simultaneously activated, otherwise transmissions will fail. Here, we consider any binary model of interference. We follow the model described by Bui, Sanghavi, and Srikant in [5, 21]. We suppose that time is slotted and during each slot we have two pha...

Contents Introduction 9 1 General definitions of the cyclostationarity property 16 1. References 111 6 List of figures 120 7 8 Introduction Les astres ont toujours été une source de crainte, de passion, d'inspiration et de quête pour l'Homme à travers les âges. Cette quête de connaissance de l'inconnu avait, à l'antiquité, pris forme de science de prédictions écliptiques, telle que la prédictio...

Remerciements Je tenais tout d'abord à remercier Dr Rodolphe Weber pour m'avoir permise d'effectuer ce travail sous sa direction, pour ses conseils, pour sa patience et pour son temps, et Dr Albert Enfin, je remercie ma famille qui a cru en moi, et qui m'a apporté toute l'aide dont j'avais besoin pour en arriver là, je ne serai jamais arrivée à ce diplôme sans vos encouragement, votre confiance...

Graph coloring is used in wireless networks to optimize network resources: bandwidth and energy. Nodes access the medium according to their color. It is the responsibility of the coloring algorithm to ensure that interfering nodes do not have the same color. In this research report, we focus on wireless sensor networks with grid topologies. How does a coloring algorithm take advantage of the re...

In this paper we define and study a call scheduling problem that is motivated by radio networks. In such networks the physical space is a common resource that nodes have to share, since concurrent transmissions cannot be interfering. We study how one can satisfy steady bandwidth demands according to this constraint. This leads to the definition of a call scheduling problem. We show that it can ...