Dissertations / Theses on the topic 'Informatique distribuée sans fil'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Informatique distribuée sans fil.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Percher, Jean-Marc. "Un modèle de détection d'intrusions distribuée pour les réseaux sans fil ad hoc." Versailles-St Quentin en Yvelines, 2004. http://www.theses.fr/2004VERS0020.
Full textThis thesis proposes a security model for MANET. Our model is composed of preventive security mechanisms and of an intrusion detection system (IDS). The main focus of this work is on the definition of the architecture of an IDS suitable for MANET. This architecture must take into account the main characteristics of MANETS: the absence of a predefined and permanent infrastructure, the heterogeneity of network nodes, the instability of the network's topology resulting from node mobility, the difficulty to identify nodes in a MANET. We propose a distributed architecture relying on a mobile agent based cooperation system and show, through simulations, that mobile agents can help in increasing the reliability of inter IDS communication and thus cooperation. We present a proof of concept prototype in order to validate the proposed architecture and to evaluate its performances
Saad, Clément. "Quelques contributions dans les réseaux de capteurs sans fil : Localisation et Routage." Phd thesis, Université d'Avignon, 2008. http://tel.archives-ouvertes.fr/tel-00364914.
Full textDe, Kerret Paul. "Transmission coopérative dans les réseaux sans-fil avec feedback distribué." Electronic Thesis or Diss., Paris, ENST, 2013. http://www.theses.fr/2013ENST0089.
Full textMultiple-antenna based transmitter cooperation has been established as a promising tool towards avoiding, aligning, or shaping the interference resulting from aggressive spectral reuse. Although the impact of imperfect knowledge of the channel state information (CSI) is often investigated, it is usually assumed that the channel estimates are perfectly shared between all the transmitters. This assumption is however not adapted to many practical cases of transmitter cooperation between distant transmitters. Therefore, we focus in this thesis on the network scenario where the transmitters would like to cooperate in their transmission but can only imperfectly exchange on CSI which is acquired locally. This imperfect CSI sharing step gives rise to a CSI configuration, denoted as “distributed CSI”, where each transmitter has its own imperfect estimate of the global multi-user channel based on which it determines its transmit parameters. We study first the impact of having distributed CSI over the precoder design. Specifically, we show that conventional precoding schemes are not adapted to the distributed CSI configuration and lead to poor performance. We then turn to another aspect of this CSI configuration which is to determine “Who needs to know what", when it comes to CSI at cooperating transmitters. In contrast to the resource-hungry solution consisting in providing the same CSI to all transmitters, it is shown how a non-uniform spatial allocation of the CSI to the transmitters can provide strong gains depending on the networks topology
De, Kerret Paul. "Transmission coopérative dans les réseaux sans-fil avec feedback distribué." Phd thesis, Telecom ParisTech, 2013. http://tel.archives-ouvertes.fr/tel-00952820.
Full textBelmega, Elena Veronica. "Problèmes d'allocation de ressources dans les réseaux MIMO sans fil distribués." Phd thesis, Université Paris Sud - Paris XI, 2010. http://tel.archives-ouvertes.fr/tel-00556223.
Full textBelfkih, Abderrahmen. "Contraintes temporelles dans les bases de données de capteurs sans fil." Thesis, Le Havre, 2016. http://www.theses.fr/2016LEHA0014/document.
Full textIn this thesis, we are interested in adding real-time constraints in the Wireless Sensor Networks Database (WSNDB). Temporal consistency in WSNDB must be ensured by respecting the transaction deadlines and data temporal validity, so that sensor data reflect the current state of the environment. However, delays of transmission and/or reception in a data collection process can lead to not respect the data temporal validity. A database solution is most appropriate, which should coincide with the traditional database aspects with sensors and their environment. For this purpose, the sensor in WSN is considered as a table in a distributed database, which applied transactions (queries, updates, etc.). Transactions in a WSNDB require modifications to take into account of the continuous datastream and real-time aspects. Our contribution in this thesis focus on three parts: (i) a comparative study of temporal properties between a periodic data collection based on a remote database and query processing approach with WSNDB, (ii) the proposition of a real-time query processing model, (iii) the implementation of a real time WSNDB, based on the techniques described in the second contribution
Le, Mouël Frédéric. "Environnement adaptatif d'exécution distribuée d'applications dans un contexte mobile." Phd thesis, Université Rennes 1, 2003. http://tel.archives-ouvertes.fr/tel-00004161.
Full textKaaouachi, Mohamed Hamza. "Une approche distribuée pour les problèmes de couverture dans les systèmes hautement dynamiques." Electronic Thesis or Diss., Paris 6, 2016. http://www.theses.fr/2016PA066058.
Full textA distributed system is a system of autonomous computing components endowed with communication abilities. This is a common model for the study of networks. The quick evolution of wireless and mobile network both in everyday life and in research gradually leads to take in account the dynamics (i.e. the evolution over time) in distributed systems. Concretely, this means to add the assumption that the communication abilities of the components of the system may vary over time. Many models consider the dynamics as an integral component of the system (and not as a fault). Recently, a new approach, called time-varying graph, attempts to unify all these models in a common formalism which allows the classification systems based on their temporal connectivity properties. In this thesis, we are interested in highly dynamic distributed systems with minimal connectivity assumptions. Specifically, we focus on connected over time systems where the only guarantee is that any element of the system can infinitely often send a message to any other (no guarantee are provided on the sustainability of the used path nor on the time communication). We are particularly interested in covering problems (e.g., minimal dominanting set, maximal matching, maximal independent set, ...) in these highly dynamic distributed systems. The contributions of this thesis in this context are as follows. We first propose a new definition for the covering problems which is more suited to highly dynamic distributed systems that the existing definitions. Secondly, we provide a generic tool to simplify proof of impossibility results in dynamic distributed systems. We use this tool to prove some impossibility results of covering problems. Then, we propose a new time complexity measure to fairly compare the algorithms performance in dynamic distributed systems. Finally, we give an algorithm that compute a minimal dominating set in highly dynamic distributed systems
Yu, Shuai. "Multi-user computation offloading in mobile edge computing." Electronic Thesis or Diss., Sorbonne université, 2018. http://www.theses.fr/2018SORUS462.
Full textMobile Edge Computing (MEC) is an emerging computing model that extends the cloud and its services to the edge of the network. Consider the execution of emerging resource-intensive applications in MEC network, computation offloading is a proven successful paradigm for enabling resource-intensive applications on mobile devices. Moreover, in view of emerging mobile collaborative application (MCA), the offloaded tasks can be duplicated when multiple users are in the same proximity. This motivates us to design a collaborative computation offloading scheme for multi-user MEC network. In this context, we separately study the collaborative computation offloading schemes for the scenarios of MEC offloading, device-to-device (D2D) offloading and hybrid offloading, respectively. In the MEC offloading scenario, we assume that multiple mobile users offload duplicated computation tasks to the network edge servers, and share the computation results among them. Our goal is to develop the optimal fine-grained collaborative offloading strategies with caching enhancements to minimize the overall execution delay at the mobile terminal side. To this end, we propose an optimal offloading with caching-enhancement scheme (OOCS) for femto-cloud scenario and mobile edge computing scenario, respectively. Simulation results show that compared to six alternative solutions in literature, our single-user OOCS can reduce execution delay up to 42.83% and 33.28% for single-user femto-cloud and single-user mobile edge computing, respectively. On the other hand, our multi-user OOCS can further reduce 11.71% delay compared to single-user OOCS through users' cooperation. In the D2D offloading scenario, we assume that where duplicated computation tasks are processed on specific mobile users and computation results are shared through Device-to-Device (D2D) multicast channel. Our goal here is to find an optimal network partition for D2D multicast offloading, in order to minimize the overall energy consumption at the mobile terminal side. To this end, we first propose a D2D multicast-based computation offloading framework where the problem is modelled as a combinatorial optimization problem, and then solved using the concepts of from maximum weighted bipartite matching and coalitional game. Note that our proposal considers the delay constraint for each mobile user as well as the battery level to guarantee fairness. To gauge the effectiveness of our proposal, we simulate three typical interactive components. Simulation results show that our algorithm can significantly reduce the energy consumption, and guarantee the battery fairness among multiple users at the same time. We then extend the D2D offloading to hybrid offloading with social relationship consideration. In this context, we propose a hybrid multicast-based task execution framework for mobile edge computing, where a crowd of mobile devices at the network edge leverage network-assisted D2D collaboration for wireless distributed computing and outcome sharing. The framework is social-aware in order to build effective D2D links [...]
Kaaouachi, Mohamed Hamza. "Une approche distribuée pour les problèmes de couverture dans les systèmes hautement dynamiques." Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066058/document.
Full textA distributed system is a system of autonomous computing components endowed with communication abilities. This is a common model for the study of networks. The quick evolution of wireless and mobile network both in everyday life and in research gradually leads to take in account the dynamics (i.e. the evolution over time) in distributed systems. Concretely, this means to add the assumption that the communication abilities of the components of the system may vary over time. Many models consider the dynamics as an integral component of the system (and not as a fault). Recently, a new approach, called time-varying graph, attempts to unify all these models in a common formalism which allows the classification systems based on their temporal connectivity properties. In this thesis, we are interested in highly dynamic distributed systems with minimal connectivity assumptions. Specifically, we focus on connected over time systems where the only guarantee is that any element of the system can infinitely often send a message to any other (no guarantee are provided on the sustainability of the used path nor on the time communication). We are particularly interested in covering problems (e.g., minimal dominanting set, maximal matching, maximal independent set, ...) in these highly dynamic distributed systems. The contributions of this thesis in this context are as follows. We first propose a new definition for the covering problems which is more suited to highly dynamic distributed systems that the existing definitions. Secondly, we provide a generic tool to simplify proof of impossibility results in dynamic distributed systems. We use this tool to prove some impossibility results of covering problems. Then, we propose a new time complexity measure to fairly compare the algorithms performance in dynamic distributed systems. Finally, we give an algorithm that compute a minimal dominating set in highly dynamic distributed systems
Morais, Anderson. "Distributed and cooperative intrusion detection in wireless mesh networks." Phd thesis, Institut National des Télécommunications, 2012. http://tel.archives-ouvertes.fr/tel-00789724.
Full textCarvin, Denis. "Mécanismes de supervision distribuée pour les réseaux de communication dynamiques." Thesis, Toulouse, INSA, 2015. http://www.theses.fr/2015ISAT0025/document.
Full textWith the massive rise of wireless technologies, the number of mobile stations is constantly growing. Both their uses and their communication resources are diversified. By integrating our daily life objects, our communication networks become dynamic in terms of physical topology but also in term of resources. Furthermore, they give access to a richer information. As a result, the management task has become complex and requires shorter response time that a human administrator can not respect. It becomes necessary to develop an autonomic management behavior in next generation networks. In any manner, managing a system requires essential steps which are : its measurement and its supervision. Whatever the nature of a system, this stage of information gathering, allows its characterization and its control. The field of networks is not the exception to the rule and objects that compose them will need to acquire information on their environment for a better adaptation. In this thesis, we focus on the efficient sharing of this information, for self-analysis and distributed performance evaluation purposes. After having formalized the problem of the distributed measurement, we address in a first part the fusion and the diffusion of measures in dynamic graphs. We develop a new heuristic for the average consensus problem offering a better contraction rate than the ones of the state of the art. In a second part, we consider more stable topologies where TCP is used to convey measures. We offer a scheduling mechanism for TCP flows that guaranty the same impact on the network congestion, while reducing the average latency. Finally, we show how nodes can supervise various metrics such as the system performance based on their utilities and suggest a method to allow them to analyze the evolution of this performance
Patel, Pankesh. "Environnement de développement d'applications pour l'Internet des objets." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2013. http://tel.archives-ouvertes.fr/tel-00927150.
Full textHan, Bing. "Allocation Distribuée de Requête dans les Réseaux de Capteur Sans Fil." Phd thesis, Télécom ParisTech, 2009. http://pastel.archives-ouvertes.fr/pastel-00006032.
Full textHan, Bing. "Allocation distribuée des requêtes dans le réseau de capteur sans fil." Paris,Télécom ParisTech, 2009. http://pastel.archives-ouvertes.fr/pastel-00006032.
Full textWireless sensor network architecture can be greatly simplified by enabling the mobile users to access directly the sensor nodes. Under this case, both efficiency and fairness should be considered in order to keep the network in an optimal operational state and the fairness is especially important as long as the users are actually the clients that pay for the services provided by the network. We studied this fairness problem from a user's point view. We have identified and studied the following problems: 1. The problem to allocate the continuous query with max-min fairness in a WSN. We obtained explicit expression for the case where only two uses are in the network and we proposed a distributed heuristic algorithm to solve a more user case. 2. The problem to allocate the discrete queries with fairness. Under this case, we used lexicographic max-min fairness and we proposed new formulation and solution for the problem. 3. The feasibility to reformulate the fairness problem and implement the solution in a 802. 15. 4/ZigBee based WSN. 4. The MMKP used in the formulation of the fairness problem. We have studied this problem by simulation experiments. We proposed a systematic method to generate the MMKP instances and we tested several groups of instances with the BBLP algorithm and two optimization utilities, namely the GLPK and CPLEX
Hauspie, Michaël. "Contributions à l'étude des gestionnaires de services distribués dans les réseaux ad hoc." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2005. http://tel.archives-ouvertes.fr/tel-00656359.
Full textDessart, Nathalie. "Décision distribuée pour la détection d'anomalies dans les réseaux de capteurs sans fil." Antilles-Guyane, 2010. http://www.theses.fr/2010AGUY0345.
Full textLn this thesis, we focused on a particular issue, that is how to use wireless sensors to achieve distributed detection of sorne anomalies. Whereas there exist sorne works dedicated to the detection of events in distributed manner, many works rely on centralized approaches, in particular for patient monitoring. The main idea was to use the sensors capabilities to handle light diagnosis. We replied to this issue and we proposed three solutions for the distributed detection over wireless sensors. The first technique uses a population protocol to handle data exchanged between motes and provides an efficient algorithrn to suggest that an anomaly is detected. The second technique uses a token algorithm where, sorne motes, denoted as masters, are in charge of deciding if a specific anomaly occurs. The last technique is based on dissemination over the network. Each sensor shares is information by disseminating it and then is able to detect an anomaly. We proposed a theoretical model to set up mechanisms for distributed decision. The work we performed has been validated by the tests over the TOSSIM simulator and the experimentations over real motes, that we have performed
Arabi, Agha Ihab. "Distributed and adaptive approaches for ubiquitous and pervasive computing." Thesis, Bourgogne Franche-Comté, 2018. http://www.theses.fr/2018UBFCA025.
Full textService Emergence Paradigm (SEP), based on a pervasive computing approach, consists of providing services to users within intended applications, transparently from their intentions, relatively to their needs, and regardless of the time and devices used. This considered paradigm has been proved sufficiently in applications that have context awareness schemes and various working threads. This research focuses on two aspects for providing SEP services. This first aspect is to implement a Physiological Pedestrian Dead Reckoning Approach (PPDR) that corrects position errors in pedestrian dead reckoning systems based on the heart rate parameter. This approach uses specific stochastic models that rely on probability distributions of previously collected heart rate values with respect to their velocities of a user during a treadmill walk. The reason behind this collection is to form a pattern that contributes in adjusting currently read velocities in any future PDR system. The second aspect of this research is the Social Relationship Detection framework (SRD). This approach proposes a mean for exploring the level of relationship between people by observing the network connection pattern of each person over several conditions. These connections, with respect to each condition, are consolidated to form a set that holds different probability distributions. These distributions are formed based on the users’ Wireless Access Point (WAP) connection establishment routine. Afterwards, the distributions of the probabilities are fed into a trained back propagation neural network to detect the level of relationship between candidate users for forthcoming friendship recommendations. This approach is elaborated in a technique that achieves intelligent decision-making whenever the connection pattern to the WAP and the user behavior are changing with time. It is also distinguished from other classical approaches that rely solely on prior knowledge of the convergence of the users’ attributes
Essoloh, Mehdi. "Méthodes d'apprentissage à noyau pour l'estimation distribuée dans les réseaux de capteurs sans fil." Troyes, 2008. http://www.theses.fr/2009TROY0022.
Full textThis thesis proposes a new frame for estimation problems in wireless sensor networks thanks to learning methods built on reproducing kernels. In a first part, our work deals with the sensor network localization problem thanks to reproducing kernel Hilbert space formalism. While respecting energy constraints and limitations in computation capabilities, coordinate estimation is executed thanks to range measurements between sensors and a priori known locations of some small fraction of deployed sensors. By considering these dissimilarities as elements of a Gram matrix, we investigate two distributed approaches: one is related to the pre-image problem, widely used in denoising applications, the other one is based on a kernel matrix regression approach, recently introduced in bio-engineering. In a second part, we propose a distributed learning strategy for temperature field estimation in wireless sensor networks. We note that sparse approximation, enabling an efficient control of the order model, holds with algorithmic constraints of wireless sensor networks. Our work is based on non-linear adaptive filtering techniques with kernels and we demonstrate its relevant use for distributed regression problem in wireless sensor networks
Ghazanfar, Kiani Saad. "Allocation distribuée de ressource dans les réseaux cellulaires limités en interférences." Paris, ENST, 2008. http://www.theses.fr/2008ENST0006.
Full textIn this dissertation, we study distributed resource allocation techniques in full reuse multicell networks. Throughout this work, we consider a system model in which simultaneous transmissions mutually interfere, and thus it is applicable to a number of wireless access schemes. On the basis of this model, we define the problem of joint power allocation and user scheduling in view of maximizing network capacity, defined as the sum of individual link rates. We initially investigate the behavior of interference in large random wireless networks, allowing us to propose the interference-ideal network model, which approximates the instantaneous interference by its average value. We then proceed to study user scheduling in the multicell context where we derive the network capacity optimal scheduling policy, based on which a distributed algorithm is proposed. Next, we characterize the optimal power allocation for two interfering links by considering a weighted sum-rate objective function. Interestingly, when the weights are equal, the optimal power allocation turns the links either on or off. Finally we propose algorithms for joint power allocation and scheduling to maximize the sum network capacity. In the first approach, the key idea is to switch off cells which do not contribute enough capacity to outweigh the interference caused to the network. We also propose a framework for distributed optimization of transmit powers based upon partitioning network parameters into local and non-local information. We also propose an algorithm which uses minimal information message passing (in this case one bit) to further improve the performance gain
Issoufou, Tiado Mahamadou Beylot André-Luc. "Modèles et mécanismes multiniveaux pour les réseaux sans fil." Toulouse : INP Toulouse, 2006. http://ethesis.inp-toulouse.fr/archive/00000277.
Full textRoméo, Fabien. "Administration de composants logiciels pour systèmes sans fil." Pau, 2007. http://www.theses.fr/2007PAUU3012.
Full textA major trend in wireless systems is the design of their software as an assembly of components. Components are interconnected through their interfaces, while hiding their implementations in order to increase their reuse and to allow to be deployed by third parties. Deployment occurs on various and sundry devices such as mobile phones, PDAs, set-top boxes, and so on. Owing to the fact that deployment environments are different from development environments, abnormal behaviors and/or misuses occur and, consequently, call for remote administration. In this perspective, we designed an architecture for monitoring and controlling the behavior of wireless software components. This behavior is described by UML 2 state machines, which are directly executed on the wireless system and replicated on the administration system. Management policies based on the components' states can thus be defined and enforced. Our proposal has been evaluated and implemented in the WMX (Wireless Management eXtensions) technology, which provides the necessary facilities to build both the manageable software components in a wireless system and their behavioral managers in an administration system
Al, Hanbali Ahmad. "Évaluation des performances des réseaux sans-fil mobiles." Nice, 2006. http://www.theses.fr/2006NICE4058.
Full textThis thesis deals with the mobility impact on the performance of mobile ad hoc network (MANET). It contains two parts. The first part surveys the TCP protocol over MANET. The main conclusion is that mobility degrades the TCP performance. Since it induces frequent route failures and extended network partitions. These implications were the motivation in the second part to introduce and evaluate new transmission schemes that rely on the mobility to improve the capacity of MANET. More precisely, in the absence of a direct route between two nodes the rest of the nodes in the network can serve as the relay nodes. In the beginning, the focus was on the performance of the relay nodes (throughput and relay buffer size) using a detailed queueing analysis. One of the main results was that random mobility models that have uniform stationary distribution of nodes location achieve the lowest throughput of relaying. Next, in order to optimize the performance of the two-hop relay protocol, especially the delivery delay of packets, we evaluated the multicopy extension under the assumption that the lifetime of the packets is limited. The performance results (delivery delay, round trip time, consumed energy) were derived using the theory of absorbing Markov chains and the fluid approximations. These results were exploited to optimize the total energy consumed subject to a constraint on the delivery delay
Al, Hanbali Ahmad Altman Eitan Nain Philippe. "Évaluation des performances des réseaux sans-fil mobiles." [S.l.] : [s.n.], 2006. http://www-sop.inria.fr/dias/Theses/phd-218.pdf.
Full textGallard, Pascal. "Conception d'un service de communication pour systèmes d'exploitation distribués pour grappes de calculateurs : mise en oeuvre dans le système à image unique Kerrighed." Phd thesis, Université Rennes 1, 2004. http://tel.archives-ouvertes.fr/tel-00011152.
Full textréutilisation sans modification de modèles de programmation et d'applications existants. Dans notre contexte, les applications visées sont de type MPI ou OpenMP. Comme pour tout système distribué, le système d'interconnexion des noeuds de la grappe se trouve au coeur des performances globales de la grappe et des SSIs.
Les travaux présentés dans cette thèse portent sur la conception d'un système de communication dédié aux systèmes d'exploitation distribués pour grappes. Ces travaux s'inscrivent dans le cadre de la conception et la réalisation d'un SSI pour l'exécution d'applications haute performance sur grappe de calculateurs.
Notre première contribution se situe dans la conception d'un modèle de communication adapté aux communications internes aux services systèmes distribués qui constituent le SSI. En effet, de la performance des communications dépendent les performances globales de la grappe. Les transactions de communication permettent (i) de décrire un message lors de sa création, (ii) d'acheminer efficacement le message en
fontion des ressources disponibles, et (iii) de délivrer et traiter le
message au plus tôt sur le noeud destinataire.
Notre seconde contribution correspond à la conception d'un support au déplacement de processus communiquant par flux de données (socket, pipe, etc.). En effet, au sein d'un SSI, les processus peuvent être déplacés en cours d'exécution par un ordonnanceur global. Les flux dynamiques permettent le déplacement d'une extrémité de communication sans dégradation des performances.
Nos propositions ont été mises en oeuvre dans le prototype de SSI Kerrighed, conçu au sein du projet INRIA PARIS de l'IRISA. Ce prototype nous a permis d'évaluer le système de communication proposé. Nous avons montré une réactivité accrue des services systémes distribués ainsi qu'une absence de dégradation des performances des applications communiquant par messages (en particulier MPI) aprés déplacement d'un processus. L'ensemble de ce travail est distribué sous licence GPL en tant que partie de Kerrighed et est disponible à l'adresse: http://www.kerrighed.org.
Sureau, Frédéric. "Un système de composants distribué pour les réseaux de capteurs sans-fils." Mémoire, Université de Sherbrooke, 2011. http://savoirs.usherbrooke.ca/handle/11143/1597.
Full textNachabe, Ismail Lina. "Automatic sensor discovery and management to implement effective mechanism for data fusion and data aggregation." Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2015. http://www.theses.fr/2015TELE0021.
Full textThe constant evolution of technology in terms of inexpensive and embedded wireless interfaces and powerful chipsets has leads to the massive usage and development of wireless sensor networks (WSNs). This potentially affects all aspects of our lives ranging from home automation (e.g. Smart Buildings), passing through e-Health applications, environmental observations and broadcasting, food sustainability, energy management and Smart Grids, military services to many other applications. WSNs are formed of an increasing number of sensor/actuator/relay/sink devices, generally self-organized in clusters and domain dedicated, that are provided by an increasing number of manufacturers, which leads to interoperability problems (e.g., heterogeneous interfaces and/or grounding, heterogeneous descriptions, profiles, models …). Moreover, these networks are generally implemented as vertical solutions not able to interoperate with each other. The data provided by these WSNs are also very heterogeneous because they are coming from sensing nodes with various abilities (e.g., different sensing ranges, formats, coding schemes …). To tackle this heterogeneity and interoperability problems, these WSNs’ nodes, as well as the data sensed and/or transmitted, need to be consistently and formally represented and managed through suitable abstraction techniques and generic information models. Therefore, an explicit semantic to every terminology should be assigned and an open data model dedicated for WSNs should be introduced. SensorML, proposed by OGC in 2010, has been considered an essential step toward data modeling specification in WSNs. Nevertheless, it is based on XML schema only permitting basic hierarchical description of the data, hence neglecting any semantic representation. Furthermore, most of the researches that have used semantic techniques for developing their data models are only focused on modeling merely sensors and actuators (this is e.g. the case of SSN-XG). Other researches dealt with data provided by WSNs, but without modelling the data type, quality and states (like e.g. OntoSensor). That is why the main aim of this thesis is to specify and formalize an open data model for WSNs in order to mask the aforementioned heterogeneity and interoperability between different systems and applications. This model will also facilitate the data fusion and aggregation through an open management architecture like environment as, for example, a service oriented one. This thesis can thus be split into two main objectives: 1)To formalize a semantic open data model for generically describing a WSN, sensors/actuators and their corresponding data. This model should be light enough to respect the low power and thus low energy limitation of such network, generic for enabling the description of the wide variety of WSNs, and extensible in a way that it can be modified and adapted based on the application. 2)To propose an upper service model and standardized enablers for enhancing sensor/actuator discovery, data fusion, data aggregation and WSN control and management. These service layer enablers will be used for improving the data collection in a large scale network and will facilitate the implementation of more efficient routing protocols, as well as decision making mechanisms in WSNs
Hanif, Ahmed Farhan. "Resource utilization techniques in distributed networks with limited information." Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2014. http://www.theses.fr/2014TELE0011.
Full textAs systems are becoming larger, it is becoming difficult to optimize them in a centralized manner due to insufficient backhaul connectivity and dynamical systems behavior. In this thesis, we tackle the above problem by developing a distributed strategic learning framework for seeking Nash equilibria under state dependent payoff functions. We develop a discrete time stochastic learning using sinus perturbation with the realistic assumption, that each node only has a numerical realization of the payoff at each time. We examine the convergence of our discrete time algorithm to a limiting trajectory defined by an ordinary differential equation (ODE). Finally, we conduct a stability analysis and apply the proposed scheme in a generic wireless networks. We also provide the application of these algorithms to real world resource utilization problems in wireless. Our proposed algorithm is applied to the following distributed optimization problems in wireless domain. Power control, beamforming and Bayesian density tracking in the interference channel. We also consider resource sharing problems in large scale networks (e.g. cloud networks) with a generalized fair payoff function. We formulate the problem as a strategic decision-making problem (i.e. a game). We examine the resource sharing game with finite and infinite number of players. Exploiting the aggregate structure of the payoff functions, we show that, the Nash equilibrium is not an evolutionarily stable strategy in the finite regime. Then, we introduce a myopic mean-field response where each player implements a mean-field-taking strategy. We show that such a mean-field-taking strategy is evolutionarily stable in both finite and infinite regime. We provide closed form expression of the optimal pricing that gives an efficient resource sharing policy. As the number of active players grows without bound, we show that the equilibrium strategy converges to a mean-field equilibrium and the optimal prices for resources converge to the optimal price of the mean-field game. Then, we address the demand satisfaction problem for which a necessary and sufficiency condition for satisfactory solutions is provided
Kumar, Dinesh. "Optimisation et contrôle dans les réseaux sans-fil et informatiques." Nice, 2008. http://www.theses.fr/2008NICE4039.
Full textThis thesis deals with various optimization and control problems related to wireless access and ad hoc networks and performance modeling in computer networks. In wireless access networks, we study two different technologies: 802. 11 WLAN and 3G UMTS, both stand alone and together. With both of them together, optimal user-network association in a WLAN and UMTS `hybrid cell' is investigated. In a stand alone single WLAN cell we study non-cooperative PHY rate control and in another problem, performance analysis of a simple Fountain Codes based transport protocol. For a single UMTS cell we propose an improved channel switching policy for the downlink. In wireless ad hoc networks, we study capacity optimizing hop distance in a dense Mobile ad hoc network (MANET) and optimal next hop selection in a Vehicular ad hoc network (VANET) on a highway. Tools such as SMDP (semi-Markov Decision Process), game theory, Markov chains, renewal reward theorem, cross-layer techniques, Wald's lemma and Kalman filtering are employed to derive optimal control policies in some cases, and choice or estimation of optimal system parameters in others. In particular, globally optimal user-network association is formulated as a connection routing control problem using SMDP. Here, we obtain a stationary optimal policy possessing both `mobile-greedy' and `load-balancing' properties with a neither convex nor concave type switching curve structure. From another perspective, individually optimal user-network association is formulated within a non-cooperative game framework where the Nash equilibrium achieving association policy is observed to possess a descending staircase curve structure. Again using game theory, we demonstrate that the IEEE 802. 11 MAC protocol is inefficient under non-cooperative PHY rate control. A Markovian stochastic model is proposed for a simple Fountain Codes based transport protocol in an 802. 11 WLAN cell where analysis and simulations provide insights into choice of optimal system parameters. Cross-layer techniques are used to design a channel switching policy for 3G UMTS downlink that improves performance of TCP. For the optimal hop distance and next hop selection problems in ad hoc networks, various non-trivial structural properties and explicit expressions for optimal choice of next hop node's speed and inter-node distance are obtained. Finally, we present an innovative approach of using Kalman filtering with queueing theory based performance models in order to be able to pursue `real time' performance modeling of online computer network systems having fast changing non-stationary characteristics. In such systems, neither stationary nor transient analysis from traditional queueing theory can be practically applied to obtain real time estimates of model parameters such as service times and network delays
Roy, Matthieu. "Synchronisation distribuée sans attente : application à la résolution des problèmes d'accord par contrainte des données." Rennes 1, 2003. http://www.theses.fr/2003REN10124.
Full textLa, Chi Anh. "Réplication de contenu dans les réseaux sans fil mobiles." Paris, Télécom ParisTech, 2010. http://pastel.archives-ouvertes.fr/pastel-00545009.
Full textThe growth of mobile devices and network-based services nowadays has raised a timely question on how to efficiently distribute the data items to mobile users. Network applications need data as an input to process and provide information to users. Consequently, data traffic exerted by mobile devices fetching content is a drainage of mobile operators’ network resources. Mobile users are now coping with the congestion at network gateways and due to the unpredictability of human mobility, mobile service providers cannot sufficiently provision infrastructures for their customers. Content replication in this context has been proved as a good solution to enhance network performance and scalability. In this thesis, we tackle the issues of content replication in heterogeneous mobile networks. Such scheme requires us to solve two basic questions: where and how many replicas should be placed in the system. We study the solution through the lenses of facility location theory and design a distributed mechanism that reduces content access latency and avoids congestion at mobile gateways. Additionally, we consider the resource constraints of mobile devices and introduce a P2P cache-and-forward mechanism for load balancing purpose. We evaluate our mechanisms against realistic human mobility models. Finally, to address rational users who may behave selfishly in replicating content, we derive a cost model and study content replication scheme using tools akin to game theory. Based on the theoretical findings, our future work is to develop the strategies to be implemented in a practical network setting
Movahedi, Zeinab. "Une architecture autonomique pour les réseaux sans-fil : proposition et méthodologie d'évaluation." Paris 6, 2011. http://www.theses.fr/2011PA066537.
Full textPeres, Martin. "A holistic approach to green networking in wireless networks : collaboration among autonomic systems as a mean towards efficient resource-sharing." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0433/document.
Full textThe last twenty years saw the emergence of wireless systems in everyday’s life. They made possible technologies such as mobile phones, WiFi or mobile Internet which are now taken for granted in today’s society. The environmental impact of Information and Communications Technology (ICT) has been raising exponentially to equate the impact of the airline industry. The green computing initiative has been created in response to this observation in order to meet the 15%-30% reduction in green-house gases by 2020 compared to estimations made in 2002 to keep the global temperature increasebelow 2°C. In this thesis, we studied power-saving techniques in wireless networks and how they interact with each others to provide a holistic view of green networking. We also take into account the radio frequency resource which is the most commonly usedcommunication medium for wireless systems and is becoming a scarce resource due to our society’s ever-increasing need for mobile bandwidth. This thesis goes down the network stacks before going up the hardware and software stack. Contributions have been madeat most layers in order to propose an autonomic wireless network where nodes can work collaboratively to improve the network’s performance, globally reduce the radio frequency spectrum usage while also increasing their battery life
Nassiri, Mohammad. "Amélioration des performances MAC dans les réseaux sans-fil." Grenoble INPG, 2008. http://www.theses.fr/2008INPG0131.
Full textLn this thesis, we study the important performance problems that arise at the MAC layer in 802. 11 wireless networks when they are used in the context of ad hoc or multi-hop. We proposed severa 1 mechanisms to overcome these performance issues. First, we enhance performance of a single wireless cell byaccommodating severa 1 classes of services. Our mechanism is a prioritized access method that supports both proportional throughput allocation and absolute priority. Second, we propose an efficient localized way to solve the problem of blocked stations in large-scale wireless networks. Finally, we propose a more global approach that combines topology constrajnts and a MAC layer mechanism to improve the performance of wireless ad hoc or mesh networks in terms of throughput and fairness. We use simulation to evaluate our proposais and also compare them with sorne state-of-the-art solutions
Fawaz, Nadia. "Communications coopératives pour les réseaux ad hoc sans fil." Phd thesis, Télécom ParisTech, 2008. http://pastel.archives-ouvertes.fr/pastel-00004836.
Full textFawaz, Nadia. "Communications coopératives pour les réseaux ad hoc sans fil." Phd thesis, Paris, ENST, 2008. https://pastel.hal.science/pastel-00004836.
Full textWireless ad hoc networks received significant attention because of their defense and commercial applications. Most research on ad hoc networks focused on routing protocols. However, the theoretical and practical limits of the performance of dense ad hoc networks recently unveiled, revealed the need for alternative techniques to improve the interference-limited performance of dense ad hoc networks. In this thesis, we address the following issue: how can the link-capacity performance in wireless ad hoc networks be improved through the use of more advanced physical layer techniques? We first introduce the physical layer factors that impact the performance of dense ad hoc networks. In particular, we show how the throughput can be improved by using directive antennas, or by managing the number and position of relays. Then, we turn our attention to ad hoc networks in which nodes are empowered with cooperative capabilities. We first consider networks with a small number of nodes and propose techniques to improve spectral efficiency. The proposed cooperative strategies make more efficient use of the wireless resource by combining orthogonality-relaxation and dirty paper coding. Finally, networks with a high density of nodes are examined and cooperation is introduced through a cooperative-clustering approach. Using tools from random matrix and free probability theory, we analyze the asymptotic capacity of the system when the node density increases. This thesis shows that the link-capacity performance of dense wireless ad hoc networks can be improved as long as nodes are empowered with cooperative capabilities at the physical layer, and cooperative strategies are properly designed
Nachabe, Ismail Lina. "Automatic sensor discovery and management to implement effective mechanism for data fusion and data aggregation." Thesis, Evry, Institut national des télécommunications, 2015. http://www.theses.fr/2015TELE0021/document.
Full textThe constant evolution of technology in terms of inexpensive and embedded wireless interfaces and powerful chipsets has leads to the massive usage and development of wireless sensor networks (WSNs). This potentially affects all aspects of our lives ranging from home automation (e.g. Smart Buildings), passing through e-Health applications, environmental observations and broadcasting, food sustainability, energy management and Smart Grids, military services to many other applications. WSNs are formed of an increasing number of sensor/actuator/relay/sink devices, generally self-organized in clusters and domain dedicated, that are provided by an increasing number of manufacturers, which leads to interoperability problems (e.g., heterogeneous interfaces and/or grounding, heterogeneous descriptions, profiles, models …). Moreover, these networks are generally implemented as vertical solutions not able to interoperate with each other. The data provided by these WSNs are also very heterogeneous because they are coming from sensing nodes with various abilities (e.g., different sensing ranges, formats, coding schemes …). To tackle this heterogeneity and interoperability problems, these WSNs’ nodes, as well as the data sensed and/or transmitted, need to be consistently and formally represented and managed through suitable abstraction techniques and generic information models. Therefore, an explicit semantic to every terminology should be assigned and an open data model dedicated for WSNs should be introduced. SensorML, proposed by OGC in 2010, has been considered an essential step toward data modeling specification in WSNs. Nevertheless, it is based on XML schema only permitting basic hierarchical description of the data, hence neglecting any semantic representation. Furthermore, most of the researches that have used semantic techniques for developing their data models are only focused on modeling merely sensors and actuators (this is e.g. the case of SSN-XG). Other researches dealt with data provided by WSNs, but without modelling the data type, quality and states (like e.g. OntoSensor). That is why the main aim of this thesis is to specify and formalize an open data model for WSNs in order to mask the aforementioned heterogeneity and interoperability between different systems and applications. This model will also facilitate the data fusion and aggregation through an open management architecture like environment as, for example, a service oriented one. This thesis can thus be split into two main objectives: 1)To formalize a semantic open data model for generically describing a WSN, sensors/actuators and their corresponding data. This model should be light enough to respect the low power and thus low energy limitation of such network, generic for enabling the description of the wide variety of WSNs, and extensible in a way that it can be modified and adapted based on the application. 2)To propose an upper service model and standardized enablers for enhancing sensor/actuator discovery, data fusion, data aggregation and WSN control and management. These service layer enablers will be used for improving the data collection in a large scale network and will facilitate the implementation of more efficient routing protocols, as well as decision making mechanisms in WSNs
Chelius, Guillaume. "Architectures et communications dans les réseaux spontanés sans-fil." Lyon, INSA, 2004. http://theses.insa-lyon.fr/publication/2004ISAL0024/these.pdf.
Full textThis PhD addresses several issues bound to ad hoc and sensor networks. We first define the notion of ad hoc architecture before describing our two proposals, Ana4 and Ana6. These architectures are notably used to evaluate and optimize unicast routing in wireless hybrid networks, i. E. , the rnerging of a wireless infrastructure network and ad hoc connectivity. Then we study ad hoc multicast routing. After having presented NP-completeness results for both ad hoc multicast and broadcast problems, we describe our ad hoc multicast routing protocol DMZ (Dense Multicast Zone). DMZ uses tree and mesh structures to create robust diffusion structures and rely on the notion of dense zones. Fin ally, we address the issue of energy consumption in sensor networks. Using a new analytical model, we derive upper and lower bounds for the minimum energy broadcast and covering problems
Chelius, Guillaume Fleury Éric Ubéda Stéphane. "Architectures et communications dans les réseaux spontanés sans-fil." Villeurbanne : Doc'INSA, 2005. http://docinsa.insa-lyon.fr/these/pont.php?id=chelius.
Full textIutzeler, Franck. "Estimation et optimisation distribuée dans les réseaux asynchrones." Thesis, Paris, ENST, 2013. http://www.theses.fr/2013ENST0078/document.
Full textThis thesis addresses the distributed estimation and optimization of a global value of interest over a network using only local and asynchronous (sometimes wireless) communications. Motivated by many different applications ranging from cloud computing to wireless sensor networks via machine learning, we design new algorithms and theoretically study three problems of very different nature : the propagation of the maximal initial value, the estimation of their average and finally distributed optimization
Sabeur, Mehdi. "Gestion de la mobilité dans les réseaux IP sans fil." Evry, Institut national des télécommunications, 2008. http://www.theses.fr/2008TELE0006.
Full textThe mobility management feature within the new IP-based wireless access Networks is of a great interest. Different from classical cellular systems, new solutions have to be conceived in order to guarantee seamless mobile communications. Even if the Mobile IP/NEMO protocols have succeeded to fulfil the lack of mobility with IP protocol, they suffer from many drawbacks in special situations such as nesting, multihoming and mesh architectures. In this thesis, we propose three solutions to solve the mobility management issues for each of the three environments cited above. The first, Light-NEMO solution, optimize the route established in a nested mobile network context by eliminating the pinball problem and provides a seamless handoff solution. The second proposal enhances the NEMO operation in order to support multihoming in mobile networks. Finally, Mobile Party protocol is a new routing and mobility management scheme for wireless mesh network. The reliability and the efficiency of each of the three solution has been demonstrated by both analytical and simulation studies
Darties, Benoit. "Problèmes algorithmiques et de complexité dans les réseaux sans fil." Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2007. http://tel.archives-ouvertes.fr/tel-00270118.
Full textLa première partie de nos travaux s'intéresse à l'étude du problème de la diffusion d'un message émis depuis un noeud source unique vers l'ensemble des noeuds participant au réseau. Ce problème est abordé dans plusieurs modèles de communication, qui supposent tous des émissions omnidirectionnelles à portée fixée et l'existence de phénomènes d'interférences. Il en résulte l'incapacité pour un noeud donné de garantir la réception correcte de deux transmissions voisines simultanées. Nous étudions la complexité de ce problème et proposons des stratégies de résolution exactes ou avec garantie de performance.
Dans une seconde partie, l'un des modèles de communication précédemment introduits sert de support à l'étude d'un autre problème algorithmique, dont l'objet est la satisfaction de requêtes de communications. Les travaux menés sur ce problème visent à établir sa complexité ainsi que les facteurs dont elle dépend.
La dernière partie nous amène au problème de conception de réseaux sans fil. L'objectif est d'assurer une distribution de flux depuis des noeuds sources vers des noeuds clients, en minimisant le coût de l'infrastructure déployée. Les communications établies ici à l'aide d'antennes directionnelles ne sont pas sujettes aux phénomènes d'interférences. La difficulté du problème réside dans la satisfaction de contraintes de déploiement (nombre d'antennes limitées par noeud, résistance aux pannes, ...). Nous étudions la complexité de ce problème, et proposons plusieurs méthodes de résolution exactes et approchées pour des instances de taille raisonnable.
Issoufou, Tiado Mahamadou. "Modèles et mécanismes multiniveaux pour les réseaux sans fil." Phd thesis, Toulouse, INPT, 2006. http://oatao.univ-toulouse.fr/7445/1/issoufoutiado.pdf.
Full textDarche, Davy. "Architecture de coopération de réseaux sans fil." Phd thesis, Université Henri Poincaré - Nancy I, 2006. http://tel.archives-ouvertes.fr/tel-00126535.
Full textNous avons réalisé un état de l'art, mettant en exergue les insuffisances des solutions actuelles, et nous permettant de définir les modes de coopération de
réseaux. Nous proposons ici une nouvelle architecture protocolaire reposant sur les protocoles IPv6 et SCTP, et intégrant une entité de gestion des différents réseaux afin d'obtenir une coopération de réseaux optimisée pour un service donné. A travers une expérimentation et diverses simulations, nous avons pu évaluer, par partie, les performances du modèle proposé.
Hakem, Nadir. "Etude d'une méthode d'accès au médium radio pour réseaux sans fil de l'habitat." Clermont-Ferrand 2, 2004. http://www.theses.fr/2004CLF21513.
Full textPenhoat, Joël. "Méthode hiérarchisée et distribuée de sélection d'un réseau radio et d'un mode de transmission." Rennes 1, 2012. http://www.theses.fr/2012REN1S113.
Full textThe widespread deployment of heterogeneous wireless networks, the success of smartphones, and the implementation of social networks, create new behaviours among Internet users. Each user becomes a source of information to the community to which he belongs. The sources of information being linked to the users, they become mobile and numerous. The IP Multicast architectures are not suited to these new behaviours. In the first part of our thesis, we analyze the existing works aiming to adapt these new multicast architectures to these new behaviours. But the deployment of architectures capable of taking into account these new behaviours can degrade the quality of services received or emitted by a user. Besides, as the users are mobile, the quality of the services they receive or transmit also depends on the radio networks to which they connect. In the second part of our thesis, we show, in the first place, that the process implemented to manage the mobility between heterogeneous radio networks in the architectures defined by the Third Generation Partnership Project is not completely defined and does not allow the users and the service providers to participate in the process of selection of the target radio network. Secondly, we show that, in the Multimedia Broadcast Multicast Service architecture and in the architecture defined by the european project called Context Casting, the users and the service providers do not participate in the process of selection of the transmission mode, multicast versus unicast. After having shown that the users and the service providers do not participate in the process of selection of a radio network and a transmission mode, we propose a process in which the Internet users, the network operators and the service providers participate in the choice of a radio network and a transmission mode
Loussayef, Marouane. "Développement d'un simulateur sans-fil multi-antennes." Thesis, Université Laval, 2010. http://www.theses.ulaval.ca/2010/27516/27516.pdf.
Full textWeis, Frédéric. "Exploitation d'approches système dans les réseaux sans fil." Habilitation à diriger des recherches, Université Rennes 1, 2012. http://tel.archives-ouvertes.fr/tel-00790484.
Full textConchon, Emmanuel Diaz Michel. "Définition et mise en oeuvre d'une solution d'émulation de réseaux sans fil." Toulouse : INP Toulouse, 2006. http://ethesis.inp-toulouse.fr/archive/00000386.
Full textHarivelo, Fanilo. "Contrôle de trafic pour service privilégié sur réseaux sans fil." La Réunion, 2006. http://www.theses.fr/2006LARE0020.
Full textDesigned as an extention to wired local area networks, wireless local area networks lead to new potentials such as ubiquity. Wireless channels characteristics as well as mobility of terminais complexify thé support of Quaîity of Service in thèse networks. This disser¬tation concentrâtes on thé support of service differentiation in IEEE 802. 11-based ad hoc networks. It begins wifch thé study of thé support of service differentiation in a single hop network. The idea consists in controlling thé traffic at thé IP level according to thé net¬work state. Two types of implementation are studied: computation of thé network state by means of message exchange and estimation of thé network state by local measurements. Then, a solution to channel acccss unfairness issues is proposed. Indeed, under certain con¬figurations, channel access does not dépend solely on thé traffic load but also on thé relative position of thé nodes. The proposed solution consists in thé propagation of thé receiving state of nodes and in thé synchronization of thé beginning of 802. 11 access opération. Fi-nally, in ordcr to simphfy resources management and to reduce co-channel interférences, a hierarchical organization of thé network is proposed. It is based on a topology control or clustcring sclieme and a, channel assignaient mechanism