Wireless Networks have been the topic of fundamental research in recent years with the aim of achieving reliable and efficient communications. However, due to their complexity, there are still many aspects of such configurations that remain as open problems. The focus of this thesis is to investigate some throughput limits of wireless networks. The network under consideration consists of $n$ source-destination pairs (links) operating in a single-hop fashion. In Chapters 2 and 3, it is assumed that each link can be active and transmit with a constant power P or remain silent. Also, fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. The objective is to choose a set of active links such that the throughput is maximized, where the rate of active links are either unconstrained or constrained. For the unconstrained throughput maximization, by deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading: (i) the maximum throughput scales like $\log n$, (ii) the maximum throughput is achievable in a distributed fashion. The upper bound is obtained using probabilistic methods, where the key point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a threshold-based link activation strategy (TBLAS) is proposed and analyzed. The achieved throughput of TBLAS is by a factor of four larger than what was obtained in previous works with centralized methods and with multihop communications. When the active links are constrained to transmit with a constant rate $\lambda$, an upper bound is derived that shows the number of active links scales at most like $\frac{1}{\lambda} \log n$. It is proved that TBLAS \emph{asymptotically almost surely(a.a.s.)} yields a feasible solution for the constrained throughput maximization problem. This solution, which is suboptimal in general, performs close to the upper bound for small values of $\lambda$. To improve the suboptimal solution, a double-threshold-based link activation strategy (DTBLAS) is proposed and analyzed based on some results from random graph theory. It is demonstrated that DTBLAS performs very close to the optimum. Specifically, DTBLAS is a.a.s. optimum when $\lambda$ approaches $\infty$ or $0$. The optimality results are obtained in an interference-limited regime. However, it is shown that, by proper selection of the algorithm parameters, DTBLAS also allows the network to operate in a noise-limited regime in which the transmission rates can be adjusted by the transmission powers. The price for this flexibility is a decrease in the throughput scaling law by a factor of $\log \log n$. In Chapter 4, the problem of throughput maximization by means of power allocation is considered. It is demonstrated that under individual power constraints, in the optimum solution, the power of at least one link should take its maximum value. Then, for the special case of $n=2$ links, it is shown that the optimum power allocation strategy for throughput maximization is such that either both links use their maximum power or one of them uses its maximum power and the other keeps silent.

Wireless Networks have been the topic of fundamental research in recent years with the aim of achieving reliable and efficient communications. However, due to their complexity, there are still many aspects of such configurations that remain as open problems. The focus of this thesis is to investigate some throughput limits of wireless networks. The network under consideration consists of $n$ source-destination pairs (links) operating in a single-hop fashion. In Chapters 2 and 3, it is assumed that each link can be active and transmit with a constant power P or remain silent. Also, fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. The objective is to choose a set of active links such that the throughput is maximized, where the rate of active links are either unconstrained or constrained. For the unconstrained throughput maximization, by deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading: (i) the maximum throughput scales like $\log n$, (ii) the maximum throughput is achievable in a distributed fashion. The upper bound is obtained using probabilistic methods, where the key point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a threshold-based link activation strategy (TBLAS) is proposed and analyzed. The achieved throughput of TBLAS is by a factor of four larger than what was obtained in previous works with centralized methods and with multihop communications. When the active links are constrained to transmit with a constant rate $\lambda$, an upper bound is derived that shows the number of active links scales at most like $\frac{1}{\lambda} \log n$. It is proved that TBLAS \emph{asymptotically almost surely(a.a.s.)} yields a feasible solution for the constrained throughput maximization problem. This solution, which is suboptimal in general, performs close to the upper bound for small values of $\lambda$. To improve the suboptimal solution, a double-threshold-based link activation strategy (DTBLAS) is proposed and analyzed based on some results from random graph theory. It is demonstrated that DTBLAS performs very close to the optimum. Specifically, DTBLAS is a.a.s. optimum when $\lambda$ approaches $\infty$ or $0$. The optimality results are obtained in an interference-limited regime. However, it is shown that, by proper selection of the algorithm parameters, DTBLAS also allows the network to operate in a noise-limited regime in which the transmission rates can be adjusted by the transmission powers. The price for this flexibility is a decrease in the throughput scaling law by a factor of $\log \log n$. In Chapter 4, the problem of throughput maximization by means of power allocation is considered. It is demonstrated that under individual power constraints, in the optimum solution, the power of at least one link should take its maximum value. Then, for the special case of $n=2$ links, it is shown that the optimum power allocation strategy for throughput maximization is such that either both links use their maximum power or one of them uses its maximum power and the other keeps silent.

Nanoporous (np) metals and alloys are the subject of increasing research attention due to their high surface-area-to-volume ratio. Numerous methods exist to create np metals, with dealloying being a common approach. By dissolving one or more elements from certain alloy systems, porous structure can be generated. Utilizing this method, multiple np metals, including np-Ni, np-Ir, and np-Au were created. By carefully adjusting precursor type and dealloying conditions for each system, nanoporous Ni/Ir/Au with different morphologies and even controllable ligament/pore size were achieved. The mechanical behavior of porous materials is related to their fully dense counterparts by scaling equations. Established scaling laws exist and are widely applied for low relative density, micro- and macro-scale open-cell porous materials. However, these laws are not directly applicable to nanoporous metals, due to higher relative density and nanoscale cells. In this study, scaling laws were reviewed in light of the thermomechanical behavior of multilayer np-Ir thin films subjected to thermal cycling. Thermal cycling allows measurement of biaxial modulus from thermoelastic segments, and also causes film thickness to contract, with increases in relative density. A modified scaling equation was generated for biaxial modulus of np-Ir, and differed significantly from the classic equation.

Submitted by Joelson Dayvison Veloso Hermes (joelson.hermes@ifsuldeminas.edu.br) on 2018-04-23T01:02:53Z No. of bitstreams: 1 Joelson_VFinal.pdf: 1544708 bytes, checksum: 9c429a972747727fd4f21efd9b4bdf5a (MD5) / Rejected by Ana Paula Santulo Custódio de Medeiros null (asantulo@rc.unesp.br), reason: - Falta a capa; - Falta a ficha catalográfica, que deve ser solicitada pelo site da biblioteca e colocada após a página de rosto (na versão online) e no verso da página de rosto (na versão impressa); - Folha de aprovação está sem as assinaturas e o resultado (verificar com a seção de pós-graduação) on 2018-04-24T12:48:21Z (GMT) / Submitted by Joelson Dayvison Veloso Hermes (joelson.hermes@ifsuldeminas.edu.br) on 2018-05-07T17:02:26Z No. of bitstreams: 1 Joelson_Vonline.pdf: 2019330 bytes, checksum: 0b929a27a61310386659770f124bcd52 (MD5) / Approved for entry into archive by Ana Paula Santulo Custódio de Medeiros null (asantulo@rc.unesp.br) on 2018-05-07T17:53:12Z (GMT) No. of bitstreams: 1 hermes_jdv_me_rcla.pdf: 2014132 bytes, checksum: 9b8ffcfc6b30d128e5b4dd50f756a88c (MD5) / Made available in DSpace on 2018-05-07T17:53:12Z (GMT). No. of bitstreams: 1 hermes_jdv_me_rcla.pdf: 2014132 bytes, checksum: 9b8ffcfc6b30d128e5b4dd50f756a88c (MD5) Previous issue date: 2018-02-20 / Neste projeto aplicamos o formalismo de escala com o objetivo de explorar a evolução em direção ao equilíbrio perto de uma bifurcação tangente no mapa logístico. No ponto de bifurcação a órbita segue o caminho descrito por uma função homogênea com expoentes críticos bem definidos. Perto da bifurcação, a convergência para o equilíbrio é exponencial, cujo tempo de relaxação é marcado por uma lei de potência. Para obtermos os expoentes utilizamos dois procedimentos distintos: (1) o primeiro, fenomenológico, envolvendo hipóteses de escala, com o qual determinamos uma lei de escala entre os 3 expoentes críticos; (2) o segundo transforma uma equação de diferenças em uma equação diferencial, sendo resolvida com condições iniciais convenientes. Os resultados analíticos confirmam bem os resultados encontrados numericamente. / In this project we apply the scaling formalism to understand and describe the evolution towards the equilibrium at and near at a tangent bifurcation into logistic map. At the bifurcation the convergence to the steady state is described by a homogeneous function with well de ned critical exponents. Near the bifurcation, the evolution to the equilibrium is described by an exponential function whose relaxation time is described by a power law. We use two di erent approaches to obtain the critical exponents: (1) a phenomenological investigation based on three scaling hypotheses leading to a scaling law relating three critical exponents and; (2) a procedure transforming the di erence equation into a di erential equation which is solved under appropriate conditions. The numerical results give support for the theoretical approach.

Submitted by Célia Mayumi Kuwana (celiamkuwana@hotmail.com) on 2018-05-16T16:10:10Z No. of bitstreams: 1 kuwana_cm_me_rcla.pdf: 1196862 bytes, checksum: 37b452d62ccbc0a6e02de1a013df0849 (MD5) / Rejected by Adriana Aparecida Puerta null (dripuerta@rc.unesp.br), reason: Prezada Célia, O documento enviado para a coleção Instituto de Biociências Rio Claro foi recusado pelo(s) seguinte(s) motivo(s): - Falta a capa, elemento obrigatório, que deve ser inserida antes da folha de rosto no arquivo pdf. - Falta a informação de Aprovada na folha de aprovação, sendo que a folha, deve ser solicitada à Seção de Pós-Graduação e inserida após a ficha catalográfica. O documento enviado não foi excluído. Para revisá-lo e realizar uma nova tentativa de envio, acesse: https://repositorio.unesp.br/mydspace Em caso de dúvidas entre em contato pelo email repositoriounesp@reitoria.unesp.br. Agradecemos a compreensão e aguardamos o envio do novo arquivo. Atenciosamente, Biblioteca Campus Rio Claro Repositório Institucional UNESP https://repositorio.unesp.br on 2018-05-16T17:44:23Z (GMT) / Submitted by Célia Mayumi Kuwana (celiamkuwana@hotmail.com) on 2018-05-17T18:36:34Z No. of bitstreams: 2 kuwana_cm_me_rcla.pdf: 1196862 bytes, checksum: 37b452d62ccbc0a6e02de1a013df0849 (MD5) kuwana_cm_me_rcla.pdf: 1484457 bytes, checksum: 49f6c72467f2a1cd318e79d6f53b0ec8 (MD5) / Approved for entry into archive by Adriana Aparecida Puerta null (dripuerta@rc.unesp.br) on 2018-05-18T16:28:17Z (GMT) No. of bitstreams: 1 kuwana_cm_me_rcla.pdf: 1334658 bytes, checksum: f623f773fd644ffaefb15c97d13db854 (MD5) / Made available in DSpace on 2018-05-18T16:28:17Z (GMT). No. of bitstreams: 1 kuwana_cm_me_rcla.pdf: 1334658 bytes, checksum: f623f773fd644ffaefb15c97d13db854 (MD5) Previous issue date: 2018-02-20 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Neste trabalho apresentaremos e discutiremos algumas propriedades dinâmicas para uma família de mapeamentos discretos que preservam a área no espaço de fases nas variáveis momentum, I, e coordenada generalizada, θ. O mapeamento é descrito por dois parâmetros de controle, sendo eles ε, ajustando a intensidade da não linearidade, e γ, um parâmetro que fornece a forma da divergência da variável “θ”no limite em que I → 0. O parâmetro ε controla a transição de integrabilidade, quando ε = 0, para não integrabilidade, no limite em que ε ≠ 0. O objetivo principal deste trabalho é descrever o comportamento das curvas do momentum médio, I_RMS(ε,n), em função de n, a partir de uma função de probabilidade, P(I(n)), de observar um determinado momentum I em um instante n. Para tanto, resolveremos a Equação da Difusão analiticamente, considerando os casos: (i) o momentum inicial nulo, I_0 = 0, e (ii) o momentum inicial não nulo, I_0 ≠ 0. Nossos resultados descrevem bem os resultados fenomenológicos conhecidos na literatura (Physics Letters A, 379: 1808 (2015)). / In this work we will present and discuss some dynamical properties of a family of mappings that preserves area in the phase space for two variables momentum, I, and generalized coordinate, θ. The mapping is controled by two parameters: ε, tunning the intensity of nonlinearity, and γ, that describes the form of divergence of θ when I → 0. The parameter ε defines a transition from integrability, when ε = 0, to nonintegrability, when ε ≠ 0. The main goal of this work is to describe the curves of average momentum, I_RMS(ε,n), in terms of n, from a probability function, P(I(n)), to observe a determined momentum I at an instant n. Therefore, we will solve the Diffusion equation analitically considering the cases: (i) the initial momentum is null, I_0 = 0, and (ii) the initial momentum is nonzero, I_0 ≠ 0. Our results describe well the known phenomenological results in literature (Physics Letters A, 379: 1808 (2015)). / CAPES-DS: 3300413-7.

京都大学 / 0048 / 新制・論文博士 / 博士(理学) / 乙第13375号 / 論理博第1574号 / 新制||理||1666(附属図書館) / 京都大学大学院理学研究科 / (主査)教授 飯尾 能久, 教授 岩田 知孝, 教授 久家 慶子 / 学位規則第4条第2項該当 / Doctor of Science / Kyoto University / DGAM

In this work we develop a Blast-Propellant-Facility integrated analysis study, which evaluates, by using two different approaches, the blast-related impact of an explosive accident of the Space Shuttle during the first ten seconds after launch at Kennedy Space Center. The blast-related risk associated with an explosion at this stage is high because of the quantity of energy involved in both multiple and complex processes. To do this, one of our approaches employed BlastFX®, a software system that facilitates the estimation of the level of damage to people and buildings, starting from an explosive device and rendering results through a complete report that illustrates and facilitates the evaluation of consequences. Our other approaches employed the Hopkinson-Cranz Scaled Law for estimating similar features at a more distant distance and by evaluating bigger amounts of TNT equivalent. Specifically, we considered more than 500 m and 45,400 kg, respectively, which are the range and TNT content limits that our version of BlastFX® can cover. Much research has been done to study the explosion phenomena with respect to both solid and liquid propellants and the laws that underlie the blast waves of an explosion. Therefore our methodology is based on the foundation provided by a large set of literature review and the actual capacities of an application like BlastFX®. By using and integrating the lessons from the literature and the capabilities of the software, we have obtained very useful information for evaluating different scenarios that rely on the assumption, which is largely studied, that the blast waves' behavior is affected by the distance. All of this has been focused on the Space Shuttle system, in which propellant mass represents the source of our analysis and the core of this work. Estimating the risks involved in it and providing results based on different scenarios augments the collective knowledge of risks associated with space exploration.

Turbulent boundary layer and metamaterial properties were explored to initiate the viability of controlling acoustic waves driven by pressure fluctuations from flow. A turbulent boundary layer scaling analysis was performed on zero-pressure-gradient turbulent boundary layers over rough surfaces, for 30,000≤〖Re〗_θ≤100,000. Relationships between fluctuating pressures and velocities were explored through the pressure Poisson equation. Certain scaling laws were implemented in attempts to collapse velocity spectra and turbulence profiles. Such analyses were performed to justify a proper scaling of the low-frequency region of the wall-pressure spectrum. Such frequencies are commonly associated with eddies containing the largest length scales. This study compared three scaling methods proposed in literature: The low-frequency classical scaling (velocity scale U_τ, length scale δ), the convection velocity scaling (U_e-U ̅_c, δ), and the Zagarola-Smits scaling (U_e-U ̅, δ). A default scaling (U_e, δ) was also selected as a baseline case for comparison. At some level, the classical scaling best collapsed rough and smooth wall Reynolds stress profiles. Low-pass filtering of the scaled turbulence profiles improved the rough-wall scaling of the Zagarola-Smits and convection velocity laws. However, inconsistent scaled results between the pressure and velocity requires a more rigorous pressure Poisson analysis. The selection of a proper scaling law gives insight into turbulent boundary layers as possible sources for acoustic metamaterials. A quiescent (no flow) experiment was conducted to measure the capabilities of a metamaterial in retaining acoustic surface waves. A point source speaker provided an acoustic input while the resulting sound waves were measured with a probe microphone. Acoustic surface waves were found via Fourier analysis in time and space. Standing acoustic surface waves were identified. Membrane response properties were measured to obtain source condition characteristics for turbulent boundary layers once the metamaterial is exposed to flow. / Master of Science / Aerodynamicists are often concerned with interactions between fluids and solids, such as an aircraft wing gliding through air. Due to frictional effects, the relative velocity of the air on the solid-surface is negligible. This results in a layer of slower moving fluid near the surface referred to as a boundary layer. Boundary layers regularly occur in the fluid-solid interface, and account for a sufficient amount of noise and drag on aircraft. To compensate for increases in drag, engines are required to produce increased amounts of power. This leads to higher fuel consumption and increased costs. Additionally, most boundary layers in nature are turbulent, or chaotic. Therefore, it is difficult to predict the exact paths of air molecules as they travel within a boundary layer. Because of its intriguing physics and impacts on economic costs, turbulent boundary layers have been a popular research topic. This study analyzed air pressure and velocity measurements of turbulent boundary layers. Relationships between the two were drawn, which fostered a discussion of future works in the field. Mainly, the simultaneous measurements of pressure on the surface and boundary layer velocity can be performed with understanding of the Pressure Poisson equation. This equation is a mathematical representation of the boundary layer pressure on the surface. This study also explored the possibility of turbulent-boundary-layer-driven-acoustic-metamaterials. Acoustic metamaterials contain hundreds of cavities which can collectively manipulate passing sound waves. A facility was developed at Virginia Tech to measure this effect, with aid from a similar laboratory at Exeter University. Microphone measurements showed the reduction of sound wave speed across the metamaterial, showing promise in acoustic manipulation. Applications in metamaterials in the altering of sound caused by turbulent boundary layers were also explored and discussed.

Propomos o estudo do meio desordenado onde a caminhada determinista parcialmente autorrepulsiva (CDPA) é desenvolvida e o estudo da caminhada aleatória autorrepulsiva (SAW) em rede regular. O meio desordenado na CDPA, gerado por um processo Poissônico espacial, é caracterizado pela estatística de vizinhança e de distâncias. A estatística de vizinhança mede a probabilidade de um ponto ser $m$-ésimo vizinho mais próximo de seu $n$-ésimo vizinho mais próximo. A estatística de distâncias mede a distribuição de distância de um ponto ao seu $k$-ésimo vizinho mais próximo. No problema da estatística de distâncias, calculamos a função densidade de probabilidade (pdf) e estudamos os casos limites de alta ordem de vizinhança e alta dimensionalidade. Um caso particular dessa pdf pode verificar se um conjunto de pontos foi gerado por um processo Poissônico. Na SAW em rede regular, um caminhante escolhe aleatoriamente um sítio adjacente para ser visitado no próximo passo, mas é proibido visitar um sítio duas ou mais vezes. Desenvolvemos uma nova abordagem para estudar grandezas conformacionais por meio do produto escalar entre o vetor posição e vetor deslocamento no $j$-ésimo passo: $\\langle\\vec{R}_{j}\\cdot\\vec{u}_{j}angle_{N}$. Mostramos que para $j=N$ o produto escalar é igual ao comprimento de persistência (projeção do vetor posição na direção do primeiro passo) e que converge para uma constante. Calculamos a distância quadrática média ponta-a-ponta, $\\langle \\vec{R}_{N}^{2}angle_{N}\\sim N^{2 u_{0}}$, como o somatório de $1\\leq j \\leq N$ do produto escalar. Os dados gerados pelo algoritmo de simulação Monte Carlo, codificado em linguagem C e paralelizado em MPI, fornecem o expoente $ u_{0}$ da regra de escala $\\langle \\vec{R}_{j}\\cdot\\vec{u}_{j}angle_{N}\\sim j^{2 u_{0}-1}$, para $1\\leq j \\leq \\Theta(N)$, próximo ao valor esperado. A partir de $\\Theta(N)\\approx N/2$ para rede quadrada e $\\Theta(N)\\approx N/3$ para rede cúbica, a caminhada torna-se mais flexível devido ao maior número de graus de liberdade disponível nos últimos passos. / We propose the study of disordered media where the deterministic partially self-avoiding walk (DPSW) is developed and the study of self-avoiding random walk (SAW) in regular lattices. The disordered media in the DPSW, generated by a spatial Poissonian process, is characterized by neighborhood and distance statistics. Neighborhood statistics quantifies the probability of a point to be the $m$th nearest neighbor of its $n$th nearest neighbor. Distance statistics quantifies the distance distribution of a given point to its $k$th nearest neighbor. For the distance statistics problem, we obtain the probability density function (pdf) and study the high dimensionality and high neighborhood order limits. A particular case of this pdf can verify if a points set is generated by a Poissonian process. In a SAW in regular lattice, the walker randomly chooses an adjacent site to be visited in the next step, but is forbidden to visit a site two or more times. We developed a new approach to study conformational quantities of SAW by means of the scalar product between the position vector and the displacement vector in the $j$th step: $\\langle\\vec{R}_{j}\\cdot\\vec{u}_{j}angle_{N}$. We show that for $j=N$ the scalar product is equal to the persistence length (projection of position vector in the direction of the first step) and that converges to a constant. We compute the square end-to-end distance, $\\langle \\vec{R}_{N}^{2}angle_{N}\\sim N^{2 u_{0}}$, as the summation $1\\leq j \\leq N$ of scalar product. The data generated by Monte Carlo simulation algorithm, coded in C language and parallelized in MPI, provides the exponent $ u_{0}$ of the scaling law $\\langle \\vec{R}_{j}\\cdot\\vec{u}_{j}angle_{N}\\sim j^{2 u_{0}-1}$, for $1\\leq j \\leq \\Theta(N)$, close to the expected value. Starting from $\\Theta(N)\\approx N/2$ for square lattice and $\\Theta(N)\\approx N/3$ for cubic lattice, the walk becomes more flexible due to the large number of degrees of freedom available in the last steps.

This thesis is concerned with distributed estimation in a wireless sensor network (WSN) with analog transmission. For a scenario in which a large number of sensors are deployed under a limited bandwidth constraint, a semi-orthogonal multiple-access channelization (MAC) approach is proposed to provide transmission of observations from K sensors to a fusion center (FC) via N orthogonal channels, where K≥N. The proposed semi-orthogonal MAC can be implemented with either fixed sensor grouping or adaptive sensor grouping. The mean squared error (MSE) is adopted as the performance criterion and it is first studied under equal power allocation. The MSE can be expressed in terms of two indicators: the channel noise suppression capability and the observation noise suppression capability. The fixed version of the semi-orthogonal MAC is shown to have the same channel noise suppression capability and two times the observation noise suppression capability when compared to the orthogonal MAC under the same bandwidth resource. For the adaptive version, the performance improvement of the semi-orthogonal MAC over the orthogonal MAC is even more significant. In fact, the semi-orthogonal MAC with adaptive sensor grouping is shown to perform very close to that of the hybrid MAC, while requiring a much smaller amount of feedback. Another contribution of this thesis is an analysis of the behavior of the average MSE in terms of the number of sensors, namely the scaling law, under equal power allocation. It is shown that the proposed semi-orthogonal MAC with adaptive sensor grouping can achieve the optimal scaling law of the analog WSN studied in this thesis. Finally, improved power allocations for the proposed semi-orthogonal MAC are investigated. First, the improved power allocations in each sensor group for different scenarios are provided. Then an optimal solution of power allocation among sensor groups is obtained by the convex optimization theory, and shown to outperform equal power allocation. The issue of balancing between the performance improvement and extra feedback required by the improved power allocation is also thoroughly discussed.