Master of Public Health - MPH / Background: Globally, it is estimated that about 1.8 million adolescents (aged 10–19 years) were living with HIV in 2015. In Kenya an estimated 133,455 adolescents were living with HIV in 2015, of which 75% (105,679) were in need of antiretroviral therapy (ART). Among adolescents on ART in 2016, 63% reported viral suppression; which is far below the UNAIDS targets of 90%. Viral suppression (having less than 1000 copies of viral RNA/ml of blood) is a key indicator of HIV treatment success, and is associated with better quality of life and reductions in HIV incidence at a population level. Homabay County recorded the highest HIV prevalence (26%) and the highest number of adolescents living with HIV in Kenya (15,323) in 2015. By the end of June 2017 5,709 adolescents were initiated on ART in Homabay County. Despite the successes in initiating HIV positive adolescents on ART, little is known about the factors that are associated with viral suppression. The current study investigated the factors associated with viral suppression among adolescents initiated on ART before November 30, 2017 in Homabay County, Kenya. Methods: A descriptive cross-sectional study was conducted among 925 adolescents registered on ART for at least 6 months and with at least one documented viral load in the last 12 months, in six health facilities in Homabay County. Data was extracted from the electronic medical records and exported into an excel spreadsheet. Bivariate and multivariate logistic regression analyses were conducted to identify factors associated to viral suppression using Stata 12.0.

The imperfections of the propagation channel due to channel fading and the self-generated noise from the RF front-end of the receiver cause errors in the received signal in electronic communication systems. When network coding is applied, more errors occur because of error propagation due to the inexact decoding process. In this dissertation we present a system called Partial Network Coding with Cooperation (PNC-COOP) for wireless ad hoc networks. It is a system which combines opportunistic network coding with decode-and-forward cooperative diversity, in order to reduce this error propagation by trading off some transmission degrees of freedom. PNC-COOP is a decentralized, energy efficient strategy which provides a substantial benefit over opportunistic network coding when transmission power is a concern. The proposed scheme is compared with both opportunistic network coding and conventional multi-hop transmission analytically and through simulation. Using a 3-hop communication scenario, in a 16-node wireless ad hoc network, it is shown that PNC-COOP improves the BER performance by 5 dB compared to opportunistic network coding. On average, it reduces the energy used by each sender node around 10% and reduces the overall transmitted energy of the network by 3.5%. When retransmission is applied, it is shown analytically that PNC-COOP performs well at relatively low to medium SNR while the throughput is comparable to that of opportunistic network coding. The effectiveness of both opportunistic network coding and PNC-COOP depends not only on the amount of network coding but also on other factors that are analyzed and discussed in this dissertation. / Graduation date: 2011 / Access restricted to the OSU Community at author's request from May 12, 2011 - May 12, 2012

Wireless sensor networks (WSN) are an attractive solution for a plethora of communication applications, such as unattended event monitoring and tracking. One of the looming challenges that threaten the successful deployment of these sensor networks is source-location privacy, especially when they are used to monitor sensitive objects. In order to enhance source location privacy in sensor networks, we propose the use of an opportunistic routing scheme and we examine four different approaches. In opportunistic routing, each sensor transmits the packet over a dynamic path to the destination. Every packet from the source can therefore follow a different path toward the destination, making it difficult for an adversary to backtrack hop-by-hop to the origin of the sensor communication. Through theoretical analysis, we attempt to justify the use of opportunistic routing for the source-location problem. Moreover, simulations have been conducted in order to evaluate the performance of all the proposed schemes, in terms of source-location privacy.

Wireless sensor networks (WSN) are an attractive solution for a plethora of communication applications, such as unattended event monitoring and tracking. One of the looming challenges that threaten the successful deployment of these sensor networks is source-location privacy, especially when they are used to monitor sensitive objects. In order to enhance source location privacy in sensor networks, we propose the use of an opportunistic routing scheme and we examine four different approaches. In opportunistic routing, each sensor transmits the packet over a dynamic path to the destination. Every packet from the source can therefore follow a different path toward the destination, making it difficult for an adversary to backtrack hop-by-hop to the origin of the sensor communication. Through theoretical analysis, we attempt to justify the use of opportunistic routing for the source-location problem. Moreover, simulations have been conducted in order to evaluate the performance of all the proposed schemes, in terms of source-location privacy.

There is an increasing interest for business organizations to engage into the global inter-firm alliance nowadays. The companies are striving for accessing the opportunities created by emerging markets, diversification of the products’ offer or the access to lower cost inputs (Barnes, et al., 2010). However, along with the benefits, there are also risks that the inter-firm alliances are challenged with. Those risks are represented by various forms of opportunistic behavior, which might be further caused by business partners (Williamson, 1975). The companies that decide to engage into inter-firm alliance need to invest in the implementation of control mechanisms that will protect them against opportunistic behavior. The preventing exante mechanisms can be implemented prior to the official start of cooperation while the cause ex-post mechanisms are applied during further stage of the collaboration. However, due to the cost of these implementations, companies cannot afford employing every available control mechanism. They need to select only the ones that their benefits exceed their costs. One of the main factors that influence the selection process of control mechanisms is the level of knowledge sensitivity of a product. The main objective of this master thesis is to determine how the level of knowledge sensitivity of a product influences the selection of ex-ante control mechanisms.

Recently, with the fast development of wireless communications, the radio spectrum becomes a precious natural resource. Many researches and reports reveal the problems of inefficient spectrum utilization. Cognitive Radio (CR) technology is now developing for solving this critical problem. This technology will enable various kinds of wireless systems to look for and connect radio frequency spectrum that the locality leave unused by oneself, to offer the best service to user. The CR will pass in and out the idle frequency band according to the demand while receiving and dispatching the signal, avoid the frequency band that has been already used. In CR network, the objective is to maximize the throughput of secondary users while limiting the probability of colliding with primary users below a prescribed level. In this paper, we consider a distributed secondary networks model where users seek spectrum opportunities independently that overlaying the primary networks to analyze the system performance and the effect to the primary users with the existence of both primary users and secondary users under the cognitive radio networks. In the cognitive system, due to the existence of noise and fading effect, error detection cannot be avoided. Therefore, we made a comparison to the difference of the efficiency among environments of different probability of miss detection. We also propose a random hopping method for all secondary users in system will re-sensing after a random period of time. Hereby, efficiently decreases the ratio of time that influences the primary users by the secondary users, and further research the factor that influences its efficiency.

The purpose of this paper is to understand why a host country (HC) shows ex post opportunistic behaviors in E&P projects and frequently forces international oil companies (IOCs) to renegotiate previously signed contracts. This research employs the concept of asset specificity and hold-up problem in transaction cost economics (TCE). It then examines the unique characteristics of E&P projects, HC’s opportunistic behaviors, and IOCs’ safeguards. For a case study analyzing the implications between the economic theory and HC’s ex post opportunism in oil E&P project, I have selected Kazakhstan. The result is that HC’s ex post opportunism can be explained by a hold-up problem resulting from IOCs’ sunk investments and the unique characteristics of the oil E&P industry. When IOCs’ important capital assets become sunk investments and the price of oil increases rapidly, HC has a strong incentive to appropriate IOCs’ profits through ex post opportunism. Yet at the same time, HC must consider the damage to its reputation when deciding the extent and ways of its ex post opportunistic behaviors in oil E&P projects. / text

Opportunistic communication leverages communication opportunities arising by chance to provide significant performance benefit and even enable communication where it would be impossible otherwise. The goal of this dissertation is to optimize opportunistic communication to achieve good performance in wireless networks. A key challenge in optimizing opportunistic communication arises from dynamic and incidental nature of communication. Complicated wireless interference patterns, high mobility, and frequent fluctuations in wireless medium make the optimization even harder. This dissertation proposes a series of optimization frameworks that systematically optimizes opportunistic communication to achieve good performance in wireless mesh networks and vehicular networks. We make the following three major contributions: First, we develop novel algorithms, techniques, and protocols that optimize opportunistic communication of wireless mesh network to achieve good, predictable user performance. Our framework systematically optimizes end-to-end performance (e.g., total throughput). It yields significant improvement over existing routing schemes. We also show that it is robust against inaccuracy introduced by dynamic network conditions. Second, we propose a novel overlay framework to exploit inter-flow network coding in opportunistic routing. In this framework, an overlay network performs inter-flow coding to effectively reduce traffic imposed on the underlay network, and an underlay network uses optimized opportunistic routing to provide efficient and reliable overlay links. We show that inter-flow coding together with opportunistic routing and rate-limiting brings significant performance benefit. Finally, we develop a novel optimization framework in vehicular networks to effectively leverage opportunistic contacts between vehicles and access points (APs). We develop a new mobility prediction algorithm and an optimization algorithm to determine an efficient replication scheme that exploit the synergy among Internet connectivity, local wireless connectivity, mesh network connectivity, and vehicular relay connectivity. Based on our framework, we develop a practical system that enables high-bandwidth content distribution and demonstrate the effectiveness of our approach using simulation, emulation, and testbed experiments. / text

Opportunistic spectrum access (OSA) promises to significantly improve the utilization of the RF spectrum. Under OSA, an unlicensed secondary user (SU) is allowed to detect and access under-utilized portions of the licensed spectrum, provided that such operation does not interfere with the communication of licensed primary users (PUs). Cognitive radio (CR) is a key enabling technology of OSA. In this dissertation, we propose several radio resource management and routing mechanisms that optimize the discovery and utilization of spectrum opportunities in a cognitive radio network (CRN). First, we propose a sequential channel sensing and probing mechanism that enables a resource-constrained SU to efficiently identify the optimal transmission opportunity from a pool of potentially usable channels. This mechanism maximizes the SUs expected throughput by accounting for the tradeoff between the reward and overhead of scanning additional channels. The optimal channel sensing and probing process is modeled as a maximum-rate-of-return problem in optimal stopping theory. Operational parameters, such as sensing and probing times, are optimized by exploiting the problem's special structure. Second, we study the problem of coordinated spectrum access in CRNs to maximize the CRNs throughput. By exploiting the geographic relationship between an SU and its surrounding PUs, we propose the novel concept of microscopic spectrum opportunity, in which active SUs and PUs are allowed to operate in the same region, subject to power constraints. Under this framework, we formulate the coordinated channel access problem as a joint power/rate control and channel assignment optimization problem. Centralized and distributed approximate algorithms are proposed to solve this problem efficiently. Compared with its macroscopic counterpart, we show that the microscopic-spectrum-opportunity framework offers significant throughput gains. Finally, at the network layer, we study the problem of truthful least-priced-path (LPP) routing for profit-driven CRNs. We design a route selection and pricing mechanism that guarantees truthful spectrum cost reporting from profit-driven SUs and that finds the cheapest route for end users. The problem is investigated with and without capacity constraints at individual nodes. In both cases, polynomial-time algorithms are developed to solve the LPP problem. Extensive simulations are conducted to verify the validity of the proposed mechanisms.

In this dissertation, we explore the issues related to opportunistic and cooperative communications in a multiuser environment. In the first part of the dissertation, we consider opportunistic scheduling for delay limited systems. Multiuser communication over fading channels is a challenging problem due to fast varying channel conditions. On the other hand, it provides opportunities to exploit the varying nature of the channel and maximize the throughput by scheduling the user (or users) with good channel. This gain is termed as multiuser diversity. The larger the number of users, the greater is the multiuser diversity gain. However, there is an inherent scheduling delay in exploiting multiuser diversity. The objective of this work is to design the scheduling schemes which use multiuser diversity to minimize the system transmit energy. We analyze the schemes in large system limit and characterize the energy--delay tradeoff. We show that delay tolerance in data transmission helps us to exploit multiuser diversity and results in an energy efficient use of the system resources. We assume a general multiuser environment but the proposed scheduling schemes are specifically suitable for the wireless sensor network applications where saving of transmit energyat the cost of delay in transmission is extremely useful to increase the life of battery for the sensor node. In the first part of the thesis, we propose scheduling schemes withthe objective of minimizing transmit energy for a given fixed tolerable transmission delay. The fixed delay is termed as hard deadline. A group of users with channels better than a transmission threshold are scheduled for transmission simultaneously using superposition coding. The transmission thresholds depend onthe fading statistics of the underlying channel and hard deadline of the data to be scheduled. As deadline is approached, the thresholds decrease monotonically to reflect the scheduling priority for theuser. We analyze the proposed schedulers in the large system limit. We compute the optimized transmission thresholds for the proposed scheduling schemes. We analyze the proposed schemes for practically relevant scenarios when the randomly arriving packets have individual, non--identical deadlines. We analyze the case when loss tolerance of the application is exploited to further decrease the system energy. The transmitted energy is not a convex function oftransmission thresholds. Therefore, we propose heuristic optimization procedures to compute the transmission thresholds and evaluate the performance of the schemes. Finally, we study the effect of outer cell interference on the proposed scheduling schemes. The second part of the thesis investigates the problem of cooperative communication between the nodes which relay the data of other sources multiplex with their own data towards a common destination, i.e. a relay node performs as a relay and data source at the same time. This problem setting is very useful in case of some wireless sensor network (WSN) applications where all the nodes relay sensed data towards a common destination sink node. The capacity region of a relay region is still an open problem. We use deterministic network model to study the problem. We characterizethe capacity region for a cooperative deterministic network with single source, multiple relays and single destination. We also characterize the capacity region when communicating nodes have correlated information to be sent to the destination. / Cross Layer Optimization of Wireless Sensor Networks