Η διπλωµατική αυτή εργασία έχει στόχο αρχικά μια σύντομη μελέτη των ad hoc ασύρματων δικτύων και έπειτα τη μελέτη της ηλεκτροµαγνητικής κάλυψης σε ένα τούνελ ώστε να μπορούν να λειτουργούν τα παραπάνω δίκτυα και την προσοµοίωση του. Γίνεται μια αναφορά στα φαινόµενα που εµφανίζονται κατά τη διάδοση των ηλεκτροµαγνητικών κυµάτων σε τούνελ και η συµπεριφορά του µεγέθους της εξασθένησης συναρτήσει της συχνότητας και της απόστασης από την πηγή εκποµπής. Επίσης περιγράφονται τα χαρακτηριστικά και οι βασικοί µηχανισµοί διάδοσης σε περιβάλλον τούνελ. Στην προσοµοίωση χρησιμοποιείται ως μοντέλο το τούνελ του µετρό της Αθήνας και παρουσιάζονται τα διαγράµµατα των αποτελεσµάτων. / This thesis aims originally a short study of ad hoc wireless networks and then study the electromagnetic coverage in a tunnel so they can operate these networks and simulation. It refers to the phenomena occurring during the propagation of electromagnetic waves in a tunnel and the behavior of the magnitude of the attenuation versus frequency and distance from the emitter. It also describes the characteristics and propagation mechanisms in a main tunnel environment. In the simulation model is used as the tunnel of the Athens metro and presented diagrams of the results.

L'utilisation répandue des smartphones dans notre vie quotidienne et l'essor technologique que connait le monde aujourd'hui -offrant l'accès mobile à très haut débit- ont exponentiellement augmenté la demande sur les services de vidéo streaming mobile, ce qui justifie la tendance à explorer de nouvelles approches pour la distribution des contenus média. Afin d'assurer une qualité de streaming constante et acceptable, la majorité des approches proposent aujourd'hui d'adapter la distribution des flux média au contexte de l'utilisateur. Dans le but de garder l'utilisateur le plus longtemps connecté à sa session de streaming, ces approches s'intéressent plus particulièrement à l'amélioration de sa perception de la vidéo. Ce qui justifie l'intérêt croissant accordé à l'étude la qualité d'expérience (QoE). Pour assurer une bonne QoE, les solutions de vidéo streaming mobile exigent la connaissance au préalable du contexte de l'utilisateur, comme par exemple la capacité de son lien physique ou la disponibilité de sa bande passante. L'acquisition de telles informations contextuelles est devenue possible aujourd'hui grâce à l'utilisation des capteurs sans fils dans les appareils mobiles et à l'existence de plusieurs applications intelligentes dédiées, le principe étant majoritairement d'exploiter la forte corrélation entre le contexte de l'utilisateur et sa position géographique. Pour faciliter l'étude du contexte de l'utilisateur, plusieurs cartes radio ont été conçues, permettant le traçage spatio-temporel des caractéristiques radio comme par exemple le débit moyen ou la force moyenne du signal. En outre, plusieurs études menées sur les modèles de mobilité des usagers ont exhibé une quasi-régularité spatio-temporelle dans leurs trajets quotidiens, soit en prenant les transports publics ou en allant vers des endroits fréquemment visités. Couplés avec les cartes radio, ces études permettent une haute précision dans la prédiction du contexte de l'utilisateur le long de son trajet. Dans cette thèse, nous nous intéressons à analyser l'impact de l'adaptation du service vidéo streaming au contexte de l'utilisateur sur sa QoE finale. Nous commençons par proposer CAMS (Context Aware Mode Switching), un mécanisme d'allocation de ressources qui dépend du contexte et qui s'applique à la distribution du vidéo streaming réel (non-adaptatif), pour assurer le minimum d'interruptions de vidéo. CAMS est conçu pour être déployé dans une topologie de réseau spécifique avec un modèle de mobilité particulier. Par la suite, nous explorons l'impact de la connaissance à l'avance du débit futur de l'utilisateur sur l'adaptation de la qualité de sa vidéo et sur le coût de sa transmission dans un contexte de streaming adaptatif. Nous proposons NEWCAST (aNticipating qoE With threshold sCheme And aScending biTrate levels), un algorithme proactif pour l'ajustement du coût et l'adaptation de la qualité sous réserve d'une prédiction parfaite du débit. Nous étendons cette étude, dans un deuxième temps, pour le cas où la prédiction du débit est imparfaite. Nous proposons, donc, d'autres algorithmes adaptatifs en nous inspirant de l'approche de NEWCAST. Pour étudier la faisabilité de ces algorithmes sur le plan pratique, nous menons quelques expérimentations dans un environnement émulé à l'aide du lecteur média DASH-IF-Reference. Finalement, nous explorons l'idée de coupler la connaissance parfaite du débit futur de l'utilisateur avec l'usage d'un mécanisme d'apprentissage automatique, pour améliorer la QoE dans un contexte de streaming adaptatif. Nous proposons, donc, un système à boucle fermée, basé sur le retour des utilisateurs, pour apprendre progressivement leurs préférences et pour optimiser adéquatement la transmission des futures vidéos. Ce système est particulièrement conçu pour être utilisé dans des populations hétérogènes avec des profils de QoE différents et inconnus à l'avance. / The strong emergence of smartphones on human daily life as well as the highbroadband access supplied by operators have triggered pervasive demand on videostreaming mobile services, requiring the exploration of novel approaches on videocontent delivery. To afford video streaming services at sustainable quality, the idea of adjusting the streaming to the time-varying users’ contexts has been actively investigatedduring the recent years. Since the users’ perceptions on the video qualitydirectly impact their engagement in video streaming sessions, many interests havebeen accorded to the user’s Quality of Experience (QoE).Today streaming solutions mostly rely on the user’s contextual information suchas his link capacity or his available bandwidth to provide an acceptable final QoE.Such contextual information can be easily acquired thanks to the existence of wirelesssensors and dedicated smart applications on today mobile devices. At the core, liesthe idea of exploiting the strong correlation between users’ locations and contexts. Tothat end, radio maps with historical average signal strength have been geographicallymapped. Various studies on users’ mobility patterns also showed that people dailyroutes exhibit a high degree of spatial and temporal regularity, especially on publictransportation or on road ways to/from frequently visited places. Coupled with radiomaps, these mobility patterns can give high accuracy on context predictability alongusers’ trips.In this thesis, we analyse the impact of adapting video streaming to the user’scontext on the final QoE.We start by proposing CAMS (Context Aware Mode Switching),a context-aware resource allocation mechanism, for real (i.e, non adaptive) videostreaming delivery to reduce the number of video stalling. CAMS is designed to beapplied in a particular network topology under a particular mobility of users. Then,we explore the impact of knowing the future throughput variations on video quality adaptation and delivery cost in adaptive video streaming. We propose NEWCAST(aNticipating qoE With threshold sCheme And aScending biTrate levels) as a proactivealgorithm for cost adjustment and quality adaptation under the assumption of aperfect throughput estimation. We then extend the study to the case where throughputprediction errors may exist and propose a bench of adaptive algorithms inspiredfrom NEWCAST. To explore the feasibility of implementing these algorithms in realworld streaming, we conduct some experiments with the DASH-If Reference playerin an emulated environment. Finally, we explore the impact of knowing the futurethroughput variations when exploited with machine learning on the global QoE enhancementin adaptive video streaming. We propose a closed-loop framework basedon users’ feedbacks to progressively learn their QoE profiles and to fittingly optimizevideo deliveries. This framework is in particular suited for heterogenous populationswhere the QoE profiles of users are quite different and unknown in advance.

Ad-hoc on-demand networks have received a significant interest in the literature. Many routing schemes for such networks focus on finding the optimal path. In this work, however, we consider the routing problem from the viewpoint of sustaining QoS (quality of service) requirement. Some algorithms such as MP-DSR already have considered this problem in terms of the end-to-end reliability requirement. While the MP-DSR algorithm is capable of resolving the issue to a certain extent, it only considers disjoint paths between a pair of source and destination nodes. In reality due to mobility of nodes there may not exist such disjoint paths. In this work the proposed approach is independent of the nature of the paths, and yet it achieves the required reliability to satisfy QoS requirement.

abstract: Nowadays, wireless communications and networks have been widely used in our daily lives. One of the most important topics related to networking research is using optimization tools to improve the utilization of network resources. In this dissertation, we concentrate on optimization for resource-constrained wireless networks, and study two fundamental resource-allocation problems: 1) distributed routing optimization and 2) anypath routing optimization. The study on the distributed routing optimization problem is composed of two main thrusts, targeted at understanding distributed routing and resource optimization for multihop wireless networks. The first thrust is dedicated to understanding the impact of full-duplex transmission on wireless network resource optimization. We propose two provably good distributed algorithms to optimize the resources in a full-duplex wireless network. We prove their optimality and also provide network status analysis using dual space information. The second thrust is dedicated to understanding the influence of network entity load constraints on network resource allocation and routing computation. We propose a provably good distributed algorithm to allocate wireless resources. In addition, we propose a new subgradient optimization framework, which can provide findgrained convergence, optimality, and dual space information at each iteration. This framework can provide a useful theoretical foundation for many networking optimization problems. The study on the anypath routing optimization problem is composed of two main thrusts. The first thrust is dedicated to understanding the computational complexity of multi-constrained anypath routing and designing approximate solutions. We prove that this problem is NP-hard when the number of constraints is larger than one. We present two polynomial time K-approximation algorithms. One is a centralized algorithm while the other one is a distributed algorithm. For the second thrust, we study directional anypath routing and present a cross-layer design of MAC and routing. For the MAC layer, we present a directional anycast MAC. For the routing layer, we propose two polynomial time routing algorithms to compute directional anypaths based on two antenna models, and prove their ptimality based on the packet delivery ratio metric. / Dissertation/Thesis / Ph.D. Computer Science 2013

abstract: Recently, the location of the nodes in wireless networks has been modeled as point processes. In this dissertation, various scenarios of wireless communications in large-scale networks modeled as point processes are considered. The first part of the dissertation considers signal reception and detection problems with symmetric alpha stable noise which is from an interfering network modeled as a Poisson point process. For the signal reception problem, the performance of space-time coding (STC) over fading channels with alpha stable noise is studied. We derive pairwise error probability (PEP) of orthogonal STCs. For general STCs, we propose a maximum-likelihood (ML) receiver, and its approximation. The resulting asymptotically optimal receiver (AOR) does not depend on noise parameters and is computationally simple, and close to the ML performance. Then, signal detection in coexisting wireless sensor networks (WSNs) is considered. We define a binary hypothesis testing problem for the signal detection in coexisting WSNs. For the problem, we introduce the ML detector and simpler alternatives. The proposed mixed-fractional lower order moment (FLOM) detector is computationally simple and close to the ML performance. Stochastic orders are binary relations defined on probability. The second part of the dissertation introduces stochastic ordering of interferences in large-scale networks modeled as point processes. Since closed-form results for the interference distributions for such networks are only available in limited cases, it is of interest to compare network interferences using stochastic. In this dissertation, conditions on the fading distribution and path-loss model are given to establish stochastic ordering between interferences. Moreover, Laplace functional (LF) ordering is defined between point processes and applied for comparing interference. Then, the LF orderings of general classes of point processes are introduced. It is also shown that the LF ordering is preserved when independent operations such as marking, thinning, random translation, and superposition are applied. The LF ordering of point processes is a useful tool for comparing spatial deployments of wireless networks and can be used to establish comparisons of several performance metrics such as coverage probability, achievable rate, and resource allocation even when closed form expressions for such metrics are unavailable. / Dissertation/Thesis / Ph.D. Electrical Engineering 2014

A transmissão de dados sem fio se faz presente no cotidiano de nossas vidas. Uma das tecnologias que mais se desenvolveu no início do século XXI é a rede sem fio e essa evolução levou a tecnologia a se difundir na indústria de processos. Em virtude disso, este trabalho tem como objetivo estudar a transmissão de sinais das redes de instrumentos sem fio na indústria de processos, suas topologias e suas características. Para categorizar esta tecnologia no tempo, foi realizado um histórico das transmissões de sinais de campo, desde a transmissão pneumática até as atuais transmissões digitais fiadas. Também foi estudada a evolução dos sensores, que pode ser considerada um dos fatores que possibilitaram a transmissão sem fio. Foi apresentado os conceitos da nova tecnologia como espalhamento espectral, antenas, arquiteturas da rede e as atuais tecnologias WirelessHART e ISA100.11a, para que fosse possível entender os requisitos necessários para o projeto de uma rede de instrumentos sem fio. Baseadas no conceito ISO-OSI das redes convencionais, as redes de instrumentos sem fio possui cinco pilares (confiabilidade, tempo de latência, taxa de transferência, segurança e energia) que devem ser projetados em uma relação de compromisso, garantindo assim uma configuração de ótimo desempenho. Por fim, foi exemplificada a utilização dessa tecnologia através de implantações em algumas unidades de uma usina sucroalcooeira. / The wireless data transmissions are part of our daily lives. The wireless network is the technology that has been most developed in the beginning of the 21st century and this evolution allowed the industry to start considering the wireless technology as a viable option to its reality. Due to that, the aim of this paperwork is to study the wireless instrument network transmission in the process industries, its topologies and its characteristics. In order to categorize this technology over time, a history of signal field transmission was made, since the pneumatic transmission to the digital wired transmission. The sensors evolution was also studied and this can be considered one of the wireless transmission main vectors. It was introduced the concepts of this new technology as spread spectrum, antennas, network architectures and the WirelessHART and ISA100.11a technologies, as a preparation to understand the requirements for the design of a wireless instruments network. Based on the regular network ISO-OSI structure, the wireless instrument network has five columns (trustability, latency time, throughput, security and energy) that have to be designed in a commitment relation, ensuring an optimal performance configuration. In the end, it was exemplified the use of the technology through the implementation of some units in the sugarcane industry.

The market for wireless networks has increased over the years, more and more organizations implement this technology. The need to work flexible, convenient and cost-effective are three reasons for the technology’s raised popularity. The use of wireless networks has exposed new aspects of network security. The information is no longer dependent on wires because it can be transmitted trough radio waves instead. The exposure of information increases, therefore also the vulnerabilities. This leads to more security problems related to the exposure of the transmitted information. It is difficult to understand the importance of network security and why to invest resources for it. Investing in security can lead to lower costs in the long run, because incidents can be perceived before it is too late. This thesis will describe why it is important to perform a risk assessment before developing a security policy. One of the reasons for having a security policy is to clarify the responsibilities for the network security to raise understanding for security within the organization. Other motive is to define how the information should be protected when transmitted in the wireless network. For example, by using the IEEE standard protocol (WEP), which may not be the best encryption solution. For organization that handles sensitive information it is important to be aware of the security problems that exist and to prevent the security risks. A case study was performed at several county councils in Sweden. The reason for this was that county councils handle sensitive information. The case study’s main purpose was to evaluate the level of knowledge about wireless security at county councils.

Global connectivity, for anyone, at anyplace, at anytime, to provide high-speed, high-quality, and reliable communication channels for mobile devices, is now becoming a reality. The credit mainly goes to the recent technological advances in wireless communications comprised of a wide range of technologies, services, and applications to fulfill the particular needs of end-users in different deployment scenarios (Wi-Fi, WiMAX, and 3G/4G cellular systems). In such a heterogeneous wireless environment, one of the key ingredients to provide efficient ubiquitous computing with guaranteed quality and continuity of service is the design of intelligent handoff algorithms. Traditional single-metric handoff decision algorithms, such as Received Signal Strength (RSS) based, are not efficient and intelligent enough to minimize the number of unnecessary handoffs, decision delays, and call-dropping and/or blocking probabilities. This research presented a novel approach for the design and implementation of a multi-criteria vertical handoff algorithm for heterogeneous wireless networks. Several parallel Fuzzy Logic Controllers were utilized in combination with different types of ranking algorithms and metric weighting schemes to implement two major modules: the first module estimated the necessity of handoff, and the other module was developed to select the best network as the target of handoff. Simulations based on different traffic classes, utilizing various types of wireless networks were carried out by implementing a wireless test-bed inspired by the concept of Rudimentary Network Emulator (RUNE). Simulation results indicated that the proposed scheme provided better performance in terms of minimizing the unnecessary handoffs, call dropping, and call blocking and handoff blocking probabilities. When subjected to Conversational traffic and compared against the RSS-based reference algorithm, the proposed scheme, utilizing the FTOPSIS ranking algorithm, was able to reduce the average outage probability of MSs moving with high speeds by 17%, new call blocking probability by 22%, the handoff blocking probability by 16%, and the average handoff rate by 40%. The significant reduction in the resulted handoff rate provides MS with efficient power consumption, and more available battery life. These percentages indicated a higher probability of guaranteed session continuity and quality of the currently utilized service, resulting in higher user satisfaction levels.

No description available.

In this thesis we study several resource management problems in two classes of wireless networks. The thesis is in two parts, the first being concerned with game theoretic approaches for cellular networks, and the second with control theoretic approaches for mobile opportunistic networks. In Part I of the thesis, we first investigate optimal association and power control for the uplink of multichannel multicell cellular networks, in which each channel is used by exactly one base station (BS) (i.e., cell). Users have minimum signal to interference ratio(SINR) requirements and associate with BSs where least transmission powers are required. We formulate the problem as a non-cooperative game among users. We propose a distributed association and power update algorithm, and show its convergence to a Nash equilibrium of the game. We consider network models with discrete mobiles(yielding an atomic congestion game),as well as a continuum of mobiles(yielding a population game). We find that the equilibria need not be Pareto efficient, nor need they be system optimal. To address the lack of system optimality, we propose pricing mechanisms. We show that these prices weakly enforce system optimality in general, and strongly enforce it in special settings. We also show that these mechanisms can be implemented in distributed fashions. Next, we consider the hierarchical problems of user association and BS placement, where BSs may belong to the same(or, cooperating) or to competing service providers. Users transmit with constant power, and associate with base stations that yield better SINRs. We formulate the association problem as a game among users; it determines the cell corresponding to each BS. Some intriguing observations we report are:(i)displacing a BS a little in one direction may result in a displacement of the boundary of the corresponding cell to the opposite direction;(ii)A cell corresponding to a BS may be the union of disconnected sub-cells. We then study the problem of the placement of BSs so as to maximize service providers’ revenues. The service providers need to take into account the mobiles’ behavior that will be induced by the placement decisions. We consider the cases of single frequency band and disjoint frequency bands of operation. We also consider the networks in which BSs employ successive interference cancellation(SIC) decoding. We observe that the BS locations are closer to each other in the competitive case than in the cooperative case, in all scenarios considered. Finally, we study cooperation among cellular service providers. We consider networks in which communications involving different BSs do not interfere. If service providers jointly deploy and pool their resources, such as spectrum and BSs, and agree to serve each others’ customers, their aggregate payoff substantially increases. The potential of such cooperation can, however ,be realized only if the service providers intelligently determine who they would cooperate with, how they would deploy and share their resources, and how they would share the aggregate payoff. We first assume that the service providers can arbitrarily share the aggregate payoff. A rational basis for payoff sharing is imperative for the stability of the coalitions. We study cooperation using the theory of transferable payoff coalitional games. We show that the optimum cooperation strategy, which involves the acquisition of channels, and deployment and allocation of BSs to customers, is the solution of a concave or an integer optimization problem. We then show that the grand coalition is stable, i.e., if all the service providers cooperate, there is an operating point offering each service provider a share that eliminates the possibility of a subset of service providers splitting from the grand coalition; this operating point also maximizes the service providers’ aggregate payoff. These stabilizing payoff shares are computed by solving the dual of the above optimization problem. Moreover, the optimal cooperation strategy and the stabilizing payoff shares can be obtained in polynomial time using distributed computations and limited exchange of confidential information among the service providers. We then extend the analysis to the scenario where service providers may not be able to share their payoffs. We now model cooperation as a nontransferable payoff coalitional game. We again show that there exists a cooperation strategy that leaves no incentive for any subset of service providers to split from the grand coalition. To compute this cooperation strategy and the corresponding payoffs, we relate this game and its core to an exchange market and its equilibrium. Finally, we extend the formulations and the results to the case when customers are also decision makers in coalition formation. In Part II of this thesis, we consider the problem of optimal message forwarding in mobile opportunistic wireless networks. A message originates at a node(source), and has to be delivered to another node (destination). In the network, there are several other nodes that can assist in relaying the message at the expense of additional transmission energies. We study the trade-off between delivery delay and energy consumption. First, we consider mobile opportunistic networks employing two-hop relaying. Because of the intermittent connectivity, the source may not have perfect knowledge of the delivery status at every instant. We formulate the problem as a stochastic control problem with partial information, and study structural properties of the optimal policy. We also propose a simple suboptimal policy. We then compare the performance of the suboptimal policy against that of the optimal control with perfect information. These are bounds on the performance of the proposed policy with partial information. We also discuss a few other related open loop policies. Finally, we investigate the case where a message has to be delivered to several destinations, but we are concerned with delay until a certain fraction of them receive the message. The network employs epidemic relaying. We first assume that, at every instant, all the nodes know the number of relays carrying the packet and the number of destinations that have received the packet. We formulate the problem as a controlled continuous time Markov chain, and derive the optimal forwarding policy. As observed earlier, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this issue, we then obtain an ODE(i.e., a deterministic fluid) approximation for the optimally controlled Markov chain. This fluid approximation also yields an asymptotically optimal deterministic policy. We evaluate the performance of this policy over finite networks, and demonstrate that this policy performs close to the optimal closed loop policy. We also briefly discuss the case where message forwarding is accomplished via two-hop relaying.