The number of smartphones in use is overwhelmingly increasing every year. These devices rely on connectivity to the Internet for the majority of their applications. The ever-increasing number of deployed 802.11 wireless access points and the relatively high cost of other data services make the case for opportunistic communication using free WiFi hot-spots. However, this requires effective management of the WLAN interface, because by design the energy cost of WLAN scanning and interface idle operation is high and energy is a primary resource on mobile devices. This thesis studies the WLAN interface management problem on mobile devices. First, I consider the hypothetical scenario where future knowledge of wireless connectivity opportunities is available, and present a dynamic programming algorithm that finds the optimal schedule for the interface. In the absence of future knowledge, I propose several heuristic strategies for interface management, and use real-world user traces to evaluate and compare their performance against the optimal algorithm. Trace-based simulations show that simple static scanning with a suitable interval value is very effective for delay-tolerant, background applications. I attribute the good performance of static scanning to the power-law distribution of the length of the WiFi opportunities of mobile users, and provide guidelines for choosing the scanning interval based on the statistical properties of the traces. I improve the performance of static scanning, by 46% on average, using a local cache of previous scan results that takes advantage of the location hints provided by the set of visible GSM cell towers.

Scheduling in wireless networks plays an important role. The undeterministic nature of the wireless channel is usually considered as an undesirable property. Recently, the idea of opportunistic scheduling is introduced and it takes advantage of the time-varying channel for performance improvement such as throughput and delay. Since the introduction of opportunistic scheduling, there are two main bodies of works. The first body of works assume that each user is greedy and has infinite backlog for transfer. With this assumption, fairness objective becomes an important factor in designing a scheduling algorithm to avoid severe starvation of certain users. Typical fairness involve processor sharing time fairness, proportional fairness, and minimum performance guarantee. On the other hand, delay performance is not a appropriate factor to evaluate the effectiveness of a scheduling algorithm because of the infinite backlog assumption. In reality, this assumption is not true as data arrives and leaves the network randomly in practice. The second body of works deal with the relaxation of the infinite backlog assumption. Thus, the notion of stability region arises. The definition of stability is that the queue at each source node remains finite. Stability region can be defined as the set of traffic intensities which can all be stabilized by the network. The well known throughput optimal algorithm is proven capable of achieving the largest stability region. In this thesis, two innovative opportunistic scheduling algorithms which aim to minimize the amount of resources used to stabilize the current traffics are proposed. The key feature of our algorithm is that the incoming traffic rates are available to the scheduler, whereas the throughput optimal algorithm has no such prior traffic knowledge. Performance comparisons are made by means of simulation to demonstrate that the proposed algorithms can achieve the same stability region as the throughput optimal algorithm. Moreover, the delay performance is better than that of the throughput optimal algorithm, especially under heavy traffic conditions.

The number of smartphones in use is overwhelmingly increasing every year. These devices rely on connectivity to the Internet for the majority of their applications. The ever-increasing number of deployed 802.11 wireless access points and the relatively high cost of other data services make the case for opportunistic communication using free WiFi hot-spots. However, this requires effective management of the WLAN interface, because by design the energy cost of WLAN scanning and interface idle operation is high and energy is a primary resource on mobile devices. This thesis studies the WLAN interface management problem on mobile devices. First, I consider the hypothetical scenario where future knowledge of wireless connectivity opportunities is available, and present a dynamic programming algorithm that finds the optimal schedule for the interface. In the absence of future knowledge, I propose several heuristic strategies for interface management, and use real-world user traces to evaluate and compare their performance against the optimal algorithm. Trace-based simulations show that simple static scanning with a suitable interval value is very effective for delay-tolerant, background applications. I attribute the good performance of static scanning to the power-law distribution of the length of the WiFi opportunities of mobile users, and provide guidelines for choosing the scanning interval based on the statistical properties of the traces. I improve the performance of static scanning, by 46% on average, using a local cache of previous scan results that takes advantage of the location hints provided by the set of visible GSM cell towers.

Delay Tolerant Networks (DTNs) are characterized by the lack of continuous end-to-end connections because of node mobility, constrained power sources, and limited data storage space of some or all of its nodes. Applications of DTNs include vehicular networks and sensor networks in suburban and rural areas. The intermittent connection in DTNs creates a new and challenging environment that has not been tackled before in wireless and wired networks. Traditional routing protocols fail to deliver data packets because they assume the existence of continuous end-to-end connections. To overcome the frequent disconnections, a DTN node is required to store data packets for long periods of time until it becomes in the communication range of other nodes. In addition, to increase the delivery probability, a DTN node spreads multiple copies of the same packet on the network so that one of the copies reaches the destination. Given the limited storage and energy resources of DTN nodes, there is a trade off between maximizing delivery and minimizing storage and energy consumption. DTN routing protocols can be classified as either blind routing, in which no information is provided to select the next node in the path, or guided routing, in which some network information is used to guide data packets to their destinations. In addition they differ in the amount of overhead they impose on the network and its nodes. The objective of DTN routing protocols is to deliver as many packets as possible. Acquiring network information helps in maximizing packet delivery probability and minimizing the network overhead resulting from replicating many packet copies. Network information could be node contact times and durations, node buffer capacities, packet lifetimes, and many others. The more information acquired, the higher performance could be achieved. However, the cost of acquiring the network information in terms of delay and storage could be high to the degree that render the protocol impractical. In designing a DTN routing protocol, the trade-off between the benefits of acquiring information and its costs should be considered. In this thesis, we study the routing problem in DTN with limited resources. Our objective is to design and implement routing protocols that effectively handles the intermittent connection in DTNs to achieve high packet delivery ratios with lower delivery cost. Delivery cost is represented in terms of number of transmissions per delivered packet. Decreasing the delivery cost means less network overhead and less energy consumption per node. In order to achieve that objective, we first target the optimal results that could be achieved in an ideal scenario. We formulate a mathematical model for optimal routing, assuming the presence of a global observer that can collect information about all the nodes in the network. The optimal results provide us with bounds on the performance metrics, and show the room for improvement that should be worked on. However, optimal routing with a global observer is just a theoretical model, and cannot be implemented practically. In DTNs, there is a need for a distributed routing protocol which utilizes local and easily-collectable data. Therefore, We investigate the different types of heuristic (non-optimal) distributed routing protocols, showing their strengths and weaknesses. Out of the large collection of protocols, we select four protocols that represent different routing classes and are well-known and highly referred by others working in the same area. We implement the protocols using a DTN simulator, and compare their performance under different network and node conditions. We study the impact of changing the node buffer capacities, packet lifetimes, number of nodes, and traffic load on their performance metrics, which are the delivery ratio, delivery cost, and packet average delay. Based on these comparisons, we draw conclusions and guidelines to design an efficient DTN routing protocol. Given the protocol design guidelines, we develop our first DTN routing protocol, Eco-Friendly Routing for DTN (EFR-DTN), which combines the strengths of two of the previously proposed protocols to provide better delivery ratio with low network overhead (less power consumption). The protocol utilizes node encounters to estimate the route to destination, while minimizing the number of packet copies throughout the network. All current DTN routing protocols strive to estimate the route from source to destination, which requires collecting information about node encounters. In addition to the overhead it imposes on the network to collect this information, the time to collect this information could render the data worthless to propagate through the network. Our next proposal is a routing protocol, Social Groups Based Routing (SGBR), which uses social relations among network nodes to exclude the nodes that are not expected to significantly increase the probability of delivering the packet to its destination. Using social relations among nodes, detected from node encounters, every group of nodes can form a social group. Nodes belonging to the same social group are expected to meet each other frequently, and meet nodes from other groups less frequently. Spreading packet copies inside the same social group is found to be of low-added value to the carrying node in delivering a packet to its destination. Therefore, our proposed routing protocol spreads the packet copies to other social groups, which decreases the number of copies throughout the network. We compare the new protocol with the optimal results and the existing well-known routing protocols using real-life simulations. Results show that the proposed protocol achieves higher delivery ratio and less average delay compared to other protocols with significant reduction in network overhead. Finally, we discuss the willingness of DTN nodes to cooperate in routing services. From a network perspective, all nodes are required to participate in delivering packets of each other. From a node perspective, minimizing resource consumption is a critical requirement. We investigate the degree of fair cooperation where all nodes are satisfied with their participation in the network routing services. A new credit-based system is implemented to keep track of and reward node participation in packet routing. Results show that the proposed system improves the fairness among nodes and increases their satisfaction.

The diffusion of sales force automation (SFA) systems has enabled a far more systematic approach to sales force management. This opens new avenues for the academic study of the industrial selling process as well: new arenas for investigation, new windows into salesperson behavior, and new methodological pitfalls. The purpose of this dissertation is to develop a better understanding of SFA from an academic perspective, and then apply these insights to resolve gaps in our understanding of how sales forces behave and how they might be better managed. To do this, three areas of analysis are explored: methodological, behavioral, and theoretical.

Delay Tolerant Networks (DTNs) are characterized by the lack of continuous end-to-end connections because of node mobility, constrained power sources, and limited data storage space of some or all of its nodes. Applications of DTNs include vehicular networks and sensor networks in suburban and rural areas. The intermittent connection in DTNs creates a new and challenging environment that has not been tackled before in wireless and wired networks. Traditional routing protocols fail to deliver data packets because they assume the existence of continuous end-to-end connections. To overcome the frequent disconnections, a DTN node is required to store data packets for long periods of time until it becomes in the communication range of other nodes. In addition, to increase the delivery probability, a DTN node spreads multiple copies of the same packet on the network so that one of the copies reaches the destination. Given the limited storage and energy resources of DTN nodes, there is a trade off between maximizing delivery and minimizing storage and energy consumption. DTN routing protocols can be classified as either blind routing, in which no information is provided to select the next node in the path, or guided routing, in which some network information is used to guide data packets to their destinations. In addition they differ in the amount of overhead they impose on the network and its nodes. The objective of DTN routing protocols is to deliver as many packets as possible. Acquiring network information helps in maximizing packet delivery probability and minimizing the network overhead resulting from replicating many packet copies. Network information could be node contact times and durations, node buffer capacities, packet lifetimes, and many others. The more information acquired, the higher performance could be achieved. However, the cost of acquiring the network information in terms of delay and storage could be high to the degree that render the protocol impractical. In designing a DTN routing protocol, the trade-off between the benefits of acquiring information and its costs should be considered. In this thesis, we study the routing problem in DTN with limited resources. Our objective is to design and implement routing protocols that effectively handles the intermittent connection in DTNs to achieve high packet delivery ratios with lower delivery cost. Delivery cost is represented in terms of number of transmissions per delivered packet. Decreasing the delivery cost means less network overhead and less energy consumption per node. In order to achieve that objective, we first target the optimal results that could be achieved in an ideal scenario. We formulate a mathematical model for optimal routing, assuming the presence of a global observer that can collect information about all the nodes in the network. The optimal results provide us with bounds on the performance metrics, and show the room for improvement that should be worked on. However, optimal routing with a global observer is just a theoretical model, and cannot be implemented practically. In DTNs, there is a need for a distributed routing protocol which utilizes local and easily-collectable data. Therefore, We investigate the different types of heuristic (non-optimal) distributed routing protocols, showing their strengths and weaknesses. Out of the large collection of protocols, we select four protocols that represent different routing classes and are well-known and highly referred by others working in the same area. We implement the protocols using a DTN simulator, and compare their performance under different network and node conditions. We study the impact of changing the node buffer capacities, packet lifetimes, number of nodes, and traffic load on their performance metrics, which are the delivery ratio, delivery cost, and packet average delay. Based on these comparisons, we draw conclusions and guidelines to design an efficient DTN routing protocol. Given the protocol design guidelines, we develop our first DTN routing protocol, Eco-Friendly Routing for DTN (EFR-DTN), which combines the strengths of two of the previously proposed protocols to provide better delivery ratio with low network overhead (less power consumption). The protocol utilizes node encounters to estimate the route to destination, while minimizing the number of packet copies throughout the network. All current DTN routing protocols strive to estimate the route from source to destination, which requires collecting information about node encounters. In addition to the overhead it imposes on the network to collect this information, the time to collect this information could render the data worthless to propagate through the network. Our next proposal is a routing protocol, Social Groups Based Routing (SGBR), which uses social relations among network nodes to exclude the nodes that are not expected to significantly increase the probability of delivering the packet to its destination. Using social relations among nodes, detected from node encounters, every group of nodes can form a social group. Nodes belonging to the same social group are expected to meet each other frequently, and meet nodes from other groups less frequently. Spreading packet copies inside the same social group is found to be of low-added value to the carrying node in delivering a packet to its destination. Therefore, our proposed routing protocol spreads the packet copies to other social groups, which decreases the number of copies throughout the network. We compare the new protocol with the optimal results and the existing well-known routing protocols using real-life simulations. Results show that the proposed protocol achieves higher delivery ratio and less average delay compared to other protocols with significant reduction in network overhead. Finally, we discuss the willingness of DTN nodes to cooperate in routing services. From a network perspective, all nodes are required to participate in delivering packets of each other. From a node perspective, minimizing resource consumption is a critical requirement. We investigate the degree of fair cooperation where all nodes are satisfied with their participation in the network routing services. A new credit-based system is implemented to keep track of and reward node participation in packet routing. Results show that the proposed system improves the fairness among nodes and increases their satisfaction.

Thesis (Ph. D.)--University of Washington, 1999. / Vita. Includes bibliographical references (leaves 80-96).

The equine cecal microbiome is an incredibly diverse ecosystem that is critical to the overall health of the horse. It is of particular interest to equine researchers because of the link between colic and the bacterial profile residing within the cecum. We investigated ten probiotics for their ability to reduce numbers of previously identified pathogenic microorganisms: Streptococcus bovis/equinus complex (SBEC), Escherichia coli K-12, Escherichia coli general, Clostridium difficile, and Clostridium perfringens. A preliminary in vitro study was used to measure the reduction in opportunistic bacteria that are commonly found in the equine gastrointestinal tract. The second in vitro was designed as a titration study using the three most effective probiotics from the first project. In this second stage of testing, different dosage levels were utilized to determine if dosage had an effect on bacterial reduction potential. Dosage levels included manufacturer’s recommended dosage (1x), twice the recommended dosage (2x), and three times the recommended dosage (3x). Lastly, an in vivo study was conducted using three cecally-cannulated horses in a Latin square design in order to measure opportunistic bacteria reduction potential in the live horse model. Cecal fluid characteristics, pH, volatile fatty acids, and ammonia concentrations were measured, along with bacterial concentrations. In the initial in vitro experiment, we observed that all probiotic treatments numerically decreased the bacterial concentrations in comparison to the control. There were three products that decreased bacterial concentrations most consistently: Command FT, CRS, and SmartDigest Ultra. These probiotics were chosen for a titration in vitro study. Selected probiotics were dosed at the recommended dose (1x), as well as at two times the recommended dose (2x) and three times the recommended dose. In the titration in vitro experiment, SmartDigest Ultra increased (P < 0.01) bacterial concentrations of E. coli K12 and C. perfringens at 2x and 3x. Due to a lack of statistical significance for Command FT and CRS (P ≥ 0.10), cost efficiency was used as a selection criteria. Command FT was approximately $0.27 per dose and CRS was approximately $0.18 per dose. Therefore, CRS was chosen for further testing in the following in vivo experiment. In the in vivo experiment, CRS was dosed at one times (1x) and two times (2x) the recommended dose. We observed that blood parameters, cecal fluid characteristics, and bacterial concentrations were not statistically (P ≥ 0.10) altered by treatment. Numerical increases for bacterial concentrations were observed for SBEC at 1x and 2x, C. difficile at 2x, and C. perfringens at 2x. Numerical decreases were observed for E. coli K12 at 1x and 2x and E. coli general at 1x and 2x. Overall, this study suggests that the selected probiotics can be safely used at the recommended dose.

Twelve working horses were utilized in a completely randomized design to examine the efficacy of curcumin as an anti-parasitic, anti-inflammatory, and anti-microbial. Horses were randomly assigned to either the control (CON) containing no curcumin or to the curcumin (CUR) treatment which was dosed at 15 g of 500 mg/g of 95% curcumin per day (n = 6/treatment). Fecal samples were collected on day 0 before initiation of treatments and then daily for 30 days. Feces from working horses were evaluated for shedding of Streptococcus bovis/ equinus complex, Clostridium difficile, and Clostridium perfringens. Inflammation was observed through erythrocyte sedimentation rate (ESR) via jugular venipuncture every 3-4 days. Horses were fed treatments at 1100 daily and samples were collected prior to administration of treatments. Dosing curcumin at the recommended rate of 15 g per horse had no effect (P ≥ 0.58) on total fecal egg count, strongyles, or ascarids. There was a day effect (P ≤ 0.05) with parasite shedding mimicking the parasites life cycle. Treatment had no effect on ESR (P ≤ 0.42); however, a day effect (P ≤ 0.001) was observed with the CUR horses with ESR decreasing (P = 0.0006) on d 14 and d 21 compared to d 0. There was no treatment (P = 0.34) or day effect (P = 0.53) on concentration of Clostridium perfringens. Similarly, there was no treatment effect for Clostridium difficile (P = 0.51) or SBEC (P = 0.69). Day had an effect (P = 0.0001) on Clostridium difficile, for both CON and CUR horses with all horses having higher concentrations on d 0 and d 1 compared to all other days. Concentrations of SBEC were affected by day (P = 0.05) with concentrations increasing on different days for both CON and CUR horses. Data would suggest that curcumin has a potential benefit as an anti-inflammatory for working horses starting at d 14 when being dosed at 15 g of 500 mg/g of 95% curcumin. This dosage for 30 days however had no additional benefits as an anti-parasitic and anti-microbial. Curcumin has a potentially negative effect on the GIT by increasing opportunistic bacteria and more research is needed to further evaluate the anti-microbial and anti-parasitic effects of curcumin in horses.

Users face location-privacy risks when accessing Location-Based Services (LBSs) in an Opportunistic Mobile Social Networks (OMSNs). In order to protect the original requester's identity and location, we propose two location privacy obfuscation protocols utilizing social ties between users. The first one is called Multi-Hop Location-Privacy Protection (MHLPP) protocol. To increase chances of completing obfuscation operations, users detect and make contacts with one-hop or multi-hop neighbor friends in social networks. Encrypted obfuscation queries avoid users learning important information especially the original requester's identity and location except for trusted users. Simulation results show that our protocol can give a higher query success ratio compared to its existing counterpart. The second protocol is called Appointment Card Protocol (ACP). To facilitate the obfuscation operations of queries, we introduce the concept called Appointment Card (AC). The original requesters can send their queries to the LBS directly using the information in the AC, ensuring that the original requester is not detected by the LBS. Also, a path for reply message is kept when the query is sent, to help reduce time for replying queries. Simulation results show that our protocol preserves location privacy and has a higher query success ratio than its counterparts. We have also developed a new OMSN simulator, called OMSN Routing Simulator (ORS), for simulating OMSN protocols more efficiently and effectively for reliable performance.