+publisher:"University of Southern California" +contributor:("Krishnamachari, Bhaskar")

University of Southern California

1. Baghaie, Marjan. Algorithmic aspects of energy efficient transmission in multihop cooperative wireless networks.

Degree: PhD, Electrical Engineering, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/194704/rec/603

► We consider the problem of energy-efficient transmission in cooperative multihop wireless networks. Although the performance gains of cooperative approaches are well known, because of the… (more)

▼ We consider the problem of energy-efficient transmission in cooperative multihop wireless networks. Although the performance gains of cooperative approaches are well known, because of the combinatorial nature of these schemes, designing efficient polynomial-time algorithms to decide which nodes should take part in cooperation, and when and with what power they should transmit, has remained a challenge. We propose to tackle this problem in this dissertation. ❧ We provide a generalized algorithmic formulation of the problem that encompasses the two main cooperative approaches, namely: energy accumulation and mutual Information accumulation. We investigate the similarities and differences of these two approaches under our generalized formulation, focusing in particular on the scenario where a delay constraint is present. We prove that the broadcast and multicast problems are, in general, o(log(n)) inapproximable. We break this NP hard problem into three parts: ordering, scheduling and power control and propose a generalized novel algorithm that, given an ordering, can optimally solve the joint power allocation and scheduling problems simultaneously in polynomial time. We further show empirically that this algorithm used in conjunction with an ordering derived heuristically using the Dijkstra's shortest path algorithm yields near-optimal performance in typical settings. In the unicast case, we prove that although the problem remains hard with mutual information accumulation, it can be solved optimally and in polynomial time when energy accumulation is used. We use our algorithm to study, numerically, the trade-off between delay and power-efficiency in cooperative broadcast and compare the performance of energy accumulation vs mutual information accumulation as well as the performance of our cooperative algorithm with a smart non-cooperative algorithm in a broadcast setting. We also provide an O(Tlog²(n)) approximation algorithm for the broadcast case where energy accumulation is used. ❧ We further formulate the problem of minimum energy cooperative transmission in a delay constrained multiflow multihop wireless network, as a combinatorial optimization problem, for a general setting of k-flows and formally prove that the problem is not only NP-hard but it is o(n^1/7-ε) inapproxmiable. To our knowledge, the results in this dissertation provides the first such inapproxmiablity proof in the context of multiflow cooperative wireless networks. We show that for a special case of k=1, the solution is a simple path and develop an optimal polynomial time algorithm for joint routing, scheduling and power control. We then use this algorithm to establish analytical upper and lower bounds for the optimal performance for the general case of k flows. Furthermore, we propose a polynomial time heuristic for calculating the solution for the general case and evaluate the performance of this heuristic under different channel conditions and against the analytical upper and lower bounds. Advisors/Committee Members: Krishnamachari, Bhaskar (Committee Chair), Hochbaum, Dorit S. (Committee Member), Molisch, Andreas F. (Committee Member).

Subjects/Keywords: wireless networks; cooperative; energy efficient; optimization; complexity; algorithms; delay; power; multihop

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Baghaie, M. (2011). Algorithmic aspects of energy efficient transmission in multihop cooperative wireless networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/194704/rec/603

Chicago Manual of Style (16^th Edition):

Baghaie, Marjan. “Algorithmic aspects of energy efficient transmission in multihop cooperative wireless networks.” 2011. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/194704/rec/603.

MLA Handbook (7^th Edition):

Baghaie, Marjan. “Algorithmic aspects of energy efficient transmission in multihop cooperative wireless networks.” 2011. Web. 22 Jan 2021.

Vancouver:

Baghaie M. Algorithmic aspects of energy efficient transmission in multihop cooperative wireless networks. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/194704/rec/603.

Council of Science Editors:

Baghaie M. Algorithmic aspects of energy efficient transmission in multihop cooperative wireless networks. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/194704/rec/603

University of Southern California

2. Gupta, Megha. Intelligent robotic manipulation of cluttered environments.

Degree: PhD, Computer Science, 2014, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/521349/rec/3563

► Robotic household assistants of the future will need to understand their environment in real-time with high accuracy. There are two problems that make this challenging… (more)

▼ Robotic household assistants of the future will need to understand their environment in real-time with high accuracy. There are two problems that make this challenging for robots. First, human environments are typically cluttered, containing a lot of objects of all kinds, shapes and sizes, in close proximity. This introduces errors in the robot’s perception and manipulation. Second, human environments are highly varied. Improving a robot’s perceptual abilities can tackle these challenge only partially. A robot’s ability to manipulate its environment can help in enabling and overcoming the limits of perception. ❧ We test this idea of manipulation-aided perception in the context of sorting and searching in cluttered, bounded, and partially observable environments. The inherent uncertainty in the world state forces the robot to adopt an observe-plan-act strategy where perception, planning, and execution are interleaved. Since execution of an action may result in revealing information about the world that was unknown hitherto, a new plan needs to be generated as a consequence of the robots actions. Since manipulation is typically expensive on a robot, our goal is to reduce the number of object manipulations required to complete the desired task. ❧ This thesis presents planning algorithms for a robot’s intelligent physical interaction with its cluttered environment. The focus is on using simple manipulation primitives to declutter the world and making task completion easier and faster using the environment’s local structure or context. For object sorting, we present a robust pipeline that combines manipulation-aided perception and grasping to achieve more reliable and accurate sorting results. In the context of environment exploration, we present an adaptive look-ahead algorithm for exploration by prehensile and non-prehensile manipulation of the objects in the environment. This algorithm is then applied to manipulation-based object search in real world. Finally, we add contextual structure to the world in the form of object-object co-occurrence relations and present an algorithm that uses context to guide the object search. ❧ We evaluate the performance and applicability of our planners through extensive simulations and real-world experiments on the PR2 robot. Our results show that purposeful manipulation of clutter to aid perception becomes increasingly useful (and essential) as the clutter in the environment increases, and that intelligent manipulation of a cluttered environment improves the efficiency of robotic tasks. Advisors/Committee Members: Sukhatme, Gaurav S. (Committee Chair), Schaal, Stefan (Committee Member), Krishnamachari, Bhaskar (Committee Member).

Subjects/Keywords: robotic manipulation; planning algorithms; personal robots; sensor-based manipulation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gupta, M. (2014). Intelligent robotic manipulation of cluttered environments. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/521349/rec/3563

Chicago Manual of Style (16^th Edition):

Gupta, Megha. “Intelligent robotic manipulation of cluttered environments.” 2014. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/521349/rec/3563.

MLA Handbook (7^th Edition):

Gupta, Megha. “Intelligent robotic manipulation of cluttered environments.” 2014. Web. 22 Jan 2021.

Vancouver:

Gupta M. Intelligent robotic manipulation of cluttered environments. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/521349/rec/3563.

Council of Science Editors:

Gupta M. Intelligent robotic manipulation of cluttered environments. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/521349/rec/3563

University of Southern California

3. Wu, Yanting. Scheduling and resource allocation with incomplete information in wireless networks.

Degree: PhD, Electrical Engineering (Computer Networks), 2015, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/585285/rec/5700

► In a wireless network, it is quite common that a transmitter needs to make decisions on scheduling and resource allocation with incomplete information. In this… (more)

▼ In a wireless network, it is quite common that a transmitter needs to make decisions on scheduling and resource allocation with incomplete information. In this dissertation, we argue that efficient mechanisms can be designed even if some key information regarding to scheduling and resource allocation is unknown. We substantiate this thesis through three studies: ❧ • Transmission over a Markovian channel ❧ • Dynamic multi‐carrier selection ❧ • Transmission for random arrivals with energy‐delay tradeoff. ❧ First, we study the optimal transmission policy for a single transmitter in a 2‐state Markovian channel. The transmitter can either sending with high rate or low rate, with rewards depending on the action chosen and the underlying channel state. The aim is to compute the scheduling policy to determine which actions to choose at each time slot in order to maximize the expected total discounted reward. We first establish the threshold structure of the optimal policy when the underlying channel statistics are known. We then focus on the more challenging case when the statistics are unknown. For this problem, we map different threshold policies to arms of a suitably defined multi‐armed bandit problem. To tractably handle the complexity introduced by countably infinite arms and the infinite time horizon, we weaken our objective a little: finding a (1−(ε + δ))‐approximate policy instead. We present the UCB-P algorithm, which can achieve this objective with logarithmic‐time regret. ❧ Next, we study the transmission control problem where a transmitter is able to transmit data simultaneously over multiple i.i.d. channels owned by different carriers. The carriers send bids indicating their channel quality to the transmitter, and the transmitter allocates power and data rate accordingly. The transmitter pays the carriers to use the channel. To efficiently use its power and maximize the throughput, the transmitter requires the knowledge of the channel quality. However, such information is incomplete to the transmitter and its transmission control relies on the bids from the carriers. Carriers are self‐interested entities who compete with each other to get the payment from the transmitter. Hence, the transmitter also needs to have a strategic approach in order to deal with the self‐interested carriers' behavior. ❧ We first consider a simplified case in which there is one transmitter and two carriers, and the bid is binary. We analyze the Nash equilibrium of the carriers and use the price of anarchy (PoA) to analyze the efficiency of the game. We prove that there exists a bounded PoA if the penalties for unsuccessful transmissions are set carefully. The bound is 2, and we prove that this bound is the best considering all possible settings. We next extend the binary bids to be multi‐bit bids, and allow for an arbitrary number of carriers. The key aim of this latter study is to guarantee the truthfulness from the bidders. We propose a rewarding mechanism based on a convex piecewise linear function and prove that such a mechanism can… Advisors/Committee Members: Krishnamachari, Bhaskar (Committee Chair), Silvester, John A. (Committee Member), Teng, Shang-Hua (Committee Member).

Subjects/Keywords: wireless network optimization; scheduling and resource allocation; algorithm/mechanism design and analysis; online learning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wu, Y. (2015). Scheduling and resource allocation with incomplete information in wireless networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/585285/rec/5700

Chicago Manual of Style (16^th Edition):

Wu, Yanting. “Scheduling and resource allocation with incomplete information in wireless networks.” 2015. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/585285/rec/5700.

MLA Handbook (7^th Edition):

Wu, Yanting. “Scheduling and resource allocation with incomplete information in wireless networks.” 2015. Web. 22 Jan 2021.

Vancouver:

Wu Y. Scheduling and resource allocation with incomplete information in wireless networks. [Internet] [Doctoral dissertation]. University of Southern California; 2015. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/585285/rec/5700.

Council of Science Editors:

Wu Y. Scheduling and resource allocation with incomplete information in wireless networks. [Doctoral Dissertation]. University of Southern California; 2015. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/585285/rec/5700

University of Southern California

4. Park, Unkyu. Gathering, processing and sharing data in a sensor-internet.

Degree: PhD, Computer Science, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/648746/rec/2966

► Sensor networks have been proposed and deployed for study of scientific phenomena with levels of detail that was previously impossible. Recently urban sensing, participating sensing… (more)

Subjects/Keywords: sensor network; mobile phones; human mobility; data provenance

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Park, U. (2011). Gathering, processing and sharing data in a sensor-internet. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/648746/rec/2966

Chicago Manual of Style (16^th Edition):

Park, Unkyu. “Gathering, processing and sharing data in a sensor-internet.” 2011. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/648746/rec/2966.

MLA Handbook (7^th Edition):

Park, Unkyu. “Gathering, processing and sharing data in a sensor-internet.” 2011. Web. 22 Jan 2021.

Vancouver:

Park U. Gathering, processing and sharing data in a sensor-internet. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/648746/rec/2966.

Council of Science Editors:

Park U. Gathering, processing and sharing data in a sensor-internet. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/648746/rec/2966

University of Southern California

5. Kalathil, Dileep Manisseri. Empirical methods in control and optimization.

Degree: PhD, Electrical Engineering, 2014, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/489169/rec/2323

► This dissertation addresses some problems in the area of learning, optimization and decision making in stochastic systems using empirical methods. ❧ First part of the… (more)

▼ This dissertation addresses some problems in the area of learning, optimization and decision making in stochastic systems using empirical methods. ❧ First part of the dissertation addresses sequential learning and decision making with partial and noisy information which is an important problem in many areas like manufacturing systems, communication networks, clinical trials etc. Centralized sequential learning and decision making problems have been studied extensively in the literature where such problems are modeled as (single agent) Multi-Armed Bandits (MAB) problems (Lai and Robbins, 1985). Surprisingly, a similar framework for multi-agent systems, a decentralized MAB framework, hasn't received much attention. In our work, we developed a theory for decentralized learning in multi-player multi-armed bandits. We showed that a simple index based algorithm is sufficient to maximize the team objective and explicitly designed such an algorithm. We also showed that the convergence rate of this algorithm is O((log²T)/T). ❧ Second part of the thesis addresses learning and optimization in dynamical systems, with a focus on Markov Decision Processes (MDP). Design and analysis of large and complex systems often involve large scale and time consuming computer simulations. This is because they are often inherently stochastic where the dynamics may be driven by some stochastic process whose characteristics may be unknown to the designer. A large number of such problems, like autonomous navigation of robots, are modeled as Markov Decision Processes (MDP) problem. Since the underlying transition kernel which governs the stochastic transitions of the system state are often unknown, an optimal control policy for such systems are often found by simulations. In our work, we addressed this problem of simulation based learning and optimization in MDPs and we developed a theory of empirical dynamic programming (EDP) for MDPs. We proposed simple and natural empirical variants of the classical dynamic programming algorithms, empirical value iteration (EVI) and empirical policy iteration (EPI), and gave convergence and sample complexity bounds for both. We also showed that these techniques can be used in many other situations including the minimax equilibrium computation for zero-sum stochastic games. We also introduce another algorithm, Empirical Q Value Iteration (EQVI) which gives a stronger (almost sure) convergence guarantee. Simulation results show better convergence rate for these algorithms than stochastic approximation/reinforcement learning schemes such as Q-learning and actor-critic learning. ❧ We also address the problem of learning for multi-criterion optimization in MDPs. The problem of competing agents with multi-criterion performance objective was first considered by Blackwell (Blackwell, 1956) in the context of static games with vector-valued payoffs. Blackwell introduced the notion of approachability: a target set is approachable for a given agent if its average payoff vector approaches this set for any strategy of the… Advisors/Committee Members: Jain, Rahul (Committee Chair), Krishnamachari, Bhaskar (Committee Member), Liu, Yan (Committee Member).

Subjects/Keywords: online optimization; multi-armed bandits; MDP; approachability; spectrum sharing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kalathil, D. M. (2014). Empirical methods in control and optimization. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/489169/rec/2323

Chicago Manual of Style (16^th Edition):

Kalathil, Dileep Manisseri. “Empirical methods in control and optimization.” 2014. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/489169/rec/2323.

MLA Handbook (7^th Edition):

Kalathil, Dileep Manisseri. “Empirical methods in control and optimization.” 2014. Web. 22 Jan 2021.

Vancouver:

Kalathil DM. Empirical methods in control and optimization. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/489169/rec/2323.

Council of Science Editors:

Kalathil DM. Empirical methods in control and optimization. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/489169/rec/2323

University of Southern California

6. Zhang, Mi. Ubiquitous computing for human activity analysis with applications in personalized healthcare.

Degree: PhD, Computer Engineering, 2013, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/283085/rec/7651

► Ubiquitous computing envisions a world in which people can access computing resources anywhere and any time. Over the past decade, the emergence and availability of… (more)

▼ Ubiquitous computing envisions a world in which people can access computing resources anywhere and any time. Over the past decade, the emergence and availability of a variety of miniature devices embedded with powerful sensing, communication, and computational capabilities are turning this vision into reality. Powered by these sensing and computational devices, ubiquitous computing endeavors to provide new and better solutions to problems in many application domains with significant societal impact. These include security, healthcare, education, sustainability, energy, and social informatics. ❧ My thesis investigates how ubiquitous computing technologies bring new solutions to transform the existing healthcare system to enable personalized healthcare and improve health and well-being for both healthy and clinical populations. The first half of this thesis focuses on wearable sensor-based human activity recognition technology which acts as the fundamental technology to support a variety of personalized healthcare applications, including personal fitness monitoring, long-term preventive care, and intelligent assistance for elderly citizens. Chapter 2 presents the human activity dataset we have built based on wearable sensor. Chapter 3 to Chapter 6 presents four different algorithms to model and recognize human daily activities based on the human activity dataset introduced in Chapter 2. Specifically, Chapter 3 analyzes human activity signals based on feature selection algorithms and shows that the recognition performance can be improved by carefully selecting features for each activity separately. Chapter 4 and Chapter 5 discusses new computational models based on dictionary learning and nonlinear manifold learning respectively to solve the human activity recognition problem from a totally different perspective. Chapter 6 presents the new activity model based on the recently developed sparse representation and compressed sensing theories and demonstrates the task of looking for optimal feature to achieve the best activity recognition performance is less important within this framework. ❧ The second half of this thesis focuses on the design of a novel on-body networked sensing system called RehabSPOT for computerized rehabilitation for patients with stroke. Chapter 7 presents the system design of RehabSPOT and its value in personalized rehabilitation delivery via real-time system reconfiguration. Chapter 8 presents the computational model based on wearable sensing system to analyze patients' motor behavior to track precisely the progress patients have made during rehabilitation. Advisors/Committee Members: Sawchuk, Alexander A. (Sandy) (Committee Chair), Krishnamachari, Bhaskar (Committee Member), Liu, Yan (Committee Member).

Subjects/Keywords: human activity recognition; mobile computing; personalized healthcare; ubiquitous computing; virtual rehabilitation; wireless health

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhang, M. (2013). Ubiquitous computing for human activity analysis with applications in personalized healthcare. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/283085/rec/7651

Chicago Manual of Style (16^th Edition):

Zhang, Mi. “Ubiquitous computing for human activity analysis with applications in personalized healthcare.” 2013. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/283085/rec/7651.

MLA Handbook (7^th Edition):

Zhang, Mi. “Ubiquitous computing for human activity analysis with applications in personalized healthcare.” 2013. Web. 22 Jan 2021.

Vancouver:

Zhang M. Ubiquitous computing for human activity analysis with applications in personalized healthcare. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/283085/rec/7651.

Council of Science Editors:

Zhang M. Ubiquitous computing for human activity analysis with applications in personalized healthcare. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/283085/rec/7651

University of Southern California

7. Alresaini, Majed. Backpressure delay enhancement for encounter-based mobile networks while sustaining throughput optimality.

Degree: PhD, Computer Engineering, 2012, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/61078/rec/1019

► Backpressure scheduling and routing, in which packets are preferentially transmitted over links with high queue differentials, offers the promise of throughput-optimal operation for a wide… (more)

Subjects/Keywords: delay tolerant networks; DTN; intermittently connected; Lyapunov; stability; redundancy; duplicates; scheduling; routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Alresaini, M. (2012). Backpressure delay enhancement for encounter-based mobile networks while sustaining throughput optimality. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/61078/rec/1019

Chicago Manual of Style (16^th Edition):

Alresaini, Majed. “Backpressure delay enhancement for encounter-based mobile networks while sustaining throughput optimality.” 2012. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/61078/rec/1019.

MLA Handbook (7^th Edition):

Alresaini, Majed. “Backpressure delay enhancement for encounter-based mobile networks while sustaining throughput optimality.” 2012. Web. 22 Jan 2021.

Vancouver:

Alresaini M. Backpressure delay enhancement for encounter-based mobile networks while sustaining throughput optimality. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/61078/rec/1019.

Council of Science Editors:

Alresaini M. Backpressure delay enhancement for encounter-based mobile networks while sustaining throughput optimality. [Doctoral Dissertation]. University of Southern California; 2012. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/61078/rec/1019

University of Southern California

8. Sedghi, Hanie. Stochastic optimization in high dimension.

Degree: PhD, Electrical Engineering, 2015, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/610840/rec/6077

► In this thesis, we consider two main problems in learning with big data: data integrity and high dimension. We specifically consider the problem of data… (more)

Subjects/Keywords: stochastic ADMM; l1 regularization; multi-block ADMM; sparse+low rank decomposition; convergence rate; high dimensional regime

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sedghi, H. (2015). Stochastic optimization in high dimension. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/610840/rec/6077

Chicago Manual of Style (16^th Edition):

Sedghi, Hanie. “Stochastic optimization in high dimension.” 2015. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/610840/rec/6077.

MLA Handbook (7^th Edition):

Sedghi, Hanie. “Stochastic optimization in high dimension.” 2015. Web. 22 Jan 2021.

Vancouver:

Sedghi H. Stochastic optimization in high dimension. [Internet] [Doctoral dissertation]. University of Southern California; 2015. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/610840/rec/6077.

Council of Science Editors:

Sedghi H. Stochastic optimization in high dimension. [Doctoral Dissertation]. University of Southern California; 2015. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/610840/rec/6077

University of Southern California

9. Narang, Sunil Kumar. Critically sampled wavelet filterbanks on graphs.

Degree: PhD, Electrical Engineering, 2012, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/63114/rec/1712

► Emerging data mining applications will have to operate on datasets defined on graphs. Examples of such datasets include online document networks, social networks, and transportation… (more)

▼ Emerging data mining applications will have to operate on datasets defined on graphs. Examples of such datasets include online document networks, social networks, and transportation networks etc. The data on these graphs can be visualized as a finite collection of samples, a graph-signal which can be defined as the information attached to each node (scalar or vector values mapped to the set of vertices/edges) of the graph. Major challenges are posed by the size of these datasets, making it difficult to visualize, process, analyze and act on the information available. Wavelets have been popular for traditional signal processing problems (e.g., compression, segmentation, denoising) because they allow signal representations where a variety of trade-offs between spatial (or temporal) resolution and frequency resolution can be achieved. In this research, we seek to leverage novel basic wavelet techniques for graph data, and apply them to realistic information analytics problems. The primary contribution of this thesis is to design critically sampled wavelet filterbanks on graphs, which provide a local analysis in the graph (localized within a few hops of a target node), while capturing spectral/frequency information of the graph-signals. The graphs in our study are simple undirected graphs. We first design ""one-dimensional"" two-channel filterbanks on bipartite graphs, and then extend them to any arbitrary graph. The filterbanks come in two flavors, depending upon the chosen downsampling method: i) lifting wavelet filterbanks and ii) spectral wavelet filterbanks. For bipartite graphs we define a spectral folding phenomenon, analogous to aliasing in regular signals, that helps us define filterbank constraints in simple terms. For arbitrary graphs we propose two choices: a) to approximate the graph as a single bipartite graph and apply one-dimensional"" filterbanks, or b) to decompose the graph into multiple bipartite subgraphs and apply multi-dimensional"" filterbanks. All our proposed filterbanks designs are critically sampled and perfect reconstruction. To the best of our knowledge, no such filterbanks have been proposed before. The tools proposed in this thesis make it possible to develop i) multiresolution representations of graphs, ii) edge-aware processing of regular signals, iii) anomaly detection in datasets, and iv) sampling of large networks. Advisors/Committee Members: Ortega, Antonio K. (Committee Chair), Krishnamachari, Bhaskar (Committee Member), Liu, Yan (Committee Member).

Subjects/Keywords: digital signal processing; network theory (graphs); sampling in graphs; wavelet transforms

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Narang, S. K. (2012). Critically sampled wavelet filterbanks on graphs. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/63114/rec/1712

Chicago Manual of Style (16^th Edition):

Narang, Sunil Kumar. “Critically sampled wavelet filterbanks on graphs.” 2012. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/63114/rec/1712.

MLA Handbook (7^th Edition):

Narang, Sunil Kumar. “Critically sampled wavelet filterbanks on graphs.” 2012. Web. 22 Jan 2021.

Vancouver:

Narang SK. Critically sampled wavelet filterbanks on graphs. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/63114/rec/1712.

Council of Science Editors:

Narang SK. Critically sampled wavelet filterbanks on graphs. [Doctoral Dissertation]. University of Southern California; 2012. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/63114/rec/1712

University of Southern California

10. Li, Nan. A radio frequency based indoor localization framework for supporting building emergency response operations.

Degree: PhD, Civil Engineering (Construction Engineering), 2014, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/372593/rec/329

► Building emergencies especially structure fires are big threats to the safety of building occupants and first responders. When emergencies occur, unfamiliar environments are difficult and… (more)

▼ Building emergencies especially structure fires are big threats to the safety of building occupants and first responders. When emergencies occur, unfamiliar environments are difficult and dangerous for first responders to search and rescue, sometimes leading to secondary casualties. One way to reduce such hazards is to provide first responders with timely access to accurate location information. Despite its importance, access to the location information at emergency scenes is far from being automated and efficient. This thesis assesses the value of location information through a card game, and identifies a set of requirements for indoor localization through a survey. The most important five requirements are: accuracy, ease of on‐scene deployment, resistance to damages, computational speed, and device size and weight. The thesis introduces a radio frequency (RF) based indoor localization framework to satisfy these requirements. When no existing sensing infrastructure is accessible in a building and an ad‐hoc sensor network needs to be established, an environment aware beacon deployment (EASBL) algorithm is developed for supporting a sequence based localization schema. The algorithm is designed to achieve dual objectives of improving room‐level localization accuracy and reducing the effort required to deploy the ad‐hoc sensor network. When there is existing sensing infrastructure in the building, an iterative maximum likelihood estimation (IMLE) localization algorithm is developed for the framework. The algorithm integrates a maximum likelihood estimation technique for location computation. The algorithm also introduces an iterative process that mitigates impacts of radio signal’s multipath and fading effects on localization accuracy. Moreover, building information models are integrated to both algorithms. Building information plays an important role in mitigating multipath and fading effects in iterative location computation, enabling the metaheuristic based search for building‐specific satisfactory beacon deployment plans, and providing a graphical interface for user interaction and result visualization. The framework was validated in both simulation and field tests. The simulation involved two fire emergency scenarios in an office building, and reported room‐level accuracies of above 87.0% and coordinate-level accuracies of above 1.78 m for the EASBL, and room‐level accuracies of above 95.0% and coordinate-level accuracies of above 0.84 m for the IMLE. The field tests involved the same test bed and scenarios, and used a smartphone based prototype that implemented the framework. The field tests reported room‐level accuracies of above 82.8% and coordinate-level accuracies of above 2.29 m for the EASBL, and room‐level accuracies of above 84.6% and coordinate‐level accuracies of above 2.07 m for the IMLE. The framework also reduced the deployment effort of ad‐hoc sensor networks by 32.1%, was proven to be robust against partial loss of devices, and could promisingly satisfy other aforementioned requirements for indoor… Advisors/Committee Members: Becerik-Gerber, Burcin (Committee Chair), Soibelman, Lucio (Committee Member), Krishnamachari, Bhaskar (Committee Member).

Subjects/Keywords: building emergency; emergency response operation; indoor localization; localization algorithm; radio frequency

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Li, N. (2014). A radio frequency based indoor localization framework for supporting building emergency response operations. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/372593/rec/329

Chicago Manual of Style (16^th Edition):

Li, Nan. “A radio frequency based indoor localization framework for supporting building emergency response operations.” 2014. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/372593/rec/329.

MLA Handbook (7^th Edition):

Li, Nan. “A radio frequency based indoor localization framework for supporting building emergency response operations.” 2014. Web. 22 Jan 2021.

Vancouver:

Li N. A radio frequency based indoor localization framework for supporting building emergency response operations. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/372593/rec/329.

Council of Science Editors:

Li N. A radio frequency based indoor localization framework for supporting building emergency response operations. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/372593/rec/329

University of Southern California

11. Chen, Ying. Multichannel data collection for throughput maximization in wireless sensor networks.

Degree: PhD, Electrical Engineering, 2012, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/102974/rec/4262

► Recent studies have shown that wireless sensor networks are fundamentally throughput-limited because of their high densities, scale, and convergecast nature of data collection traffic. Thus,… (more)

▼ Recent studies have shown that wireless sensor networks are fundamentally throughput-limited because of their high densities, scale, and convergecast nature of data collection traffic. Thus, it is of interest to develop high-rate data collection techniques for sensor networks. In this thesis, we make four contributions to address this challenge. ❧ First, through systematic experiments with real WSN hardware (Tmote Sky), we identify the maximum possible throughput for many-to-one (convergecast) data collection in sensor networks as a function of key communication parameters such as packet size, use of acknowledgements, and network topology. ❧ Second, we demonstrate that the maximum achievable network throughput can in fact be attained in practice using a carefully designed mix of routing, frequency allocation and time scheduling. We implement this in the form of Multi-Channel Collection (MCC), the first near-optimal multi-channel time-scheduled protocol for fair, real-time data collection in Wireless Sensor Networks. Compared to state of the art single-channel random-access-based collection protocols for WSN, we show through testbed experiments that this approach offers 48-155% improvement in throughput. We also show how to exploit the time-scheduled nature of this approach for other benefits: dramatically reducing the number of required frequency channels as well as decreasing the energy utilization. ❧ Third, we measure and analyze the link qualities across all channels in an indoor testbed. We observe that, besides the time-varying and location-dependent features, links exhibit a large variety of qualities in different channels. And asymmetry is common (on average, about 30%) for links in all channels. Based on these observations, we argue that channel quality awareness is important for multichannel protocols. ❧ Finally, we design new routing and channel allocation approaches, CQAR (Channel-Quality-Aware Routing) and CQAA (Channel-Quality-Aware Allocation), which take the channel quality into consideration. Both CQAR and CQAA can be incorporated into the MCC framework. According to how MCC uses the channel quality information, we propose three different variants: ICRA (Ideal Channel-based Routing and Allocation), CQAA, CQARA. We evaluate these approaches by simulations based on real testbed measurement. The results show that CQAA and CQARA are able to achieve high overall delivery ratio and normalized throughput. Though ICRA has similar performance when network size is small, it does not scale very well as the other two. CQARA exhibits high efficiency of both channel utilization and energy consumption. This shows the benefits of considering channel quality in multichannel protocols. Advisors/Committee Members: Krishnamachari, Bhaskar (Committee Chair), Govindan, Ramesh (Committee Member), Annavaram, Murali (Committee Member).

Subjects/Keywords: wireless sensor networks; multichannel; TDMA; convergecast; channel quality measurement; scheduling; channel allocation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chen, Y. (2012). Multichannel data collection for throughput maximization in wireless sensor networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/102974/rec/4262

Chicago Manual of Style (16^th Edition):

Chen, Ying. “Multichannel data collection for throughput maximization in wireless sensor networks.” 2012. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/102974/rec/4262.

MLA Handbook (7^th Edition):

Chen, Ying. “Multichannel data collection for throughput maximization in wireless sensor networks.” 2012. Web. 22 Jan 2021.

Vancouver:

Chen Y. Multichannel data collection for throughput maximization in wireless sensor networks. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/102974/rec/4262.

Council of Science Editors:

Chen Y. Multichannel data collection for throughput maximization in wireless sensor networks. [Doctoral Dissertation]. University of Southern California; 2012. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/102974/rec/4262

University of Southern California

12. Honnappa, Harsha. Strategic and transitory models of queueing systems.

Degree: PhD, Electrical Engineering, 2014, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081

► Stochastic network theory, and queueing theory in particular, is the bedrock for the analysis and control of resource constrained systems. Such systems are manifest in… (more)

Subjects/Keywords: queueing theory; applied probability; game theory; stochastic process limits; empirical process theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Honnappa, H. (2014). Strategic and transitory models of queueing systems. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081

Chicago Manual of Style (16^th Edition):

Honnappa, Harsha. “Strategic and transitory models of queueing systems.” 2014. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081.

MLA Handbook (7^th Edition):

Honnappa, Harsha. “Strategic and transitory models of queueing systems.” 2014. Web. 22 Jan 2021.

Vancouver:

Honnappa H. Strategic and transitory models of queueing systems. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081.

Council of Science Editors:

Honnappa H. Strategic and transitory models of queueing systems. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081

University of Southern California

13. Lee, Sungwon. Application-driven compressed sensing.

Degree: PhD, Electrical Engineering, 2013, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/313894/rec/859

► Traditional compressed sensing (CS) approaches have been focused on the goal of reducing the number of measurements while achieving satisfactory reconstruction. Reducing the number of… (more)

▼ Traditional compressed sensing (CS) approaches have been focused on the goal of reducing the number of measurements while achieving satisfactory reconstruction. Reducing the number of measurements can directly lead to reductions in costs in some applications, e.g., the scanning time in fast magnetic resonance imaging (MRI) or the sampling rate in analog-to-information conversion. However, in some other applications, minimizing the number of measurements by itself does not provide a better solution in terms of system complexity due to additional application-driven constraints. ❧ In general, those constraints affect the choice of either measurement basis or sparsifying basis. For example, if the total cost of collecting measurements is a crucial factor as compared to the reconstruction accuracy, reducing the number of measurements does not guarantee better performance because the increase of measurement cost can exceed the gain achieved by the increase of the number of measurements. Thus, the design of an efficient measurement basis should consider the total cost for measurements as well as the reconstruction accuracy. Also, in coding applications where signals are first captured and then compressed, better performance can be achieved by adaptively selecting a transform or sparsifying basis and then signaling the chosen transform to the decoder. For instance, for piecewise smooth signals, where sharp edges exist between smooth regions, edge-adaptive transforms can provide sparser representation at the cost of some overhead. Thus, the design of sparsifying basis should be optimized with respect to a given measurement basis, while the signaling overhead is minimized. These observations motivated us to investigate efficient design schemes for CS that can provide better reconstruction while minimizing the application-driven costs. ❧ In this thesis, we study the optimization of compressed sensing in three different applications, each of which imposes a different set of constraints: i) efficient data-gathering in wireless sensor networks (WSN), ii) depth map compression using a graph-based transform, and iii) fast target localization using a single-chip ultra-wideband (UWB) radar. Under these application-driven constraints, we study how to minimize application specific costs while minimizing the mutual coherence in order to achieve satisfactory reconstruction using CS. ❧ In sensor networks, we take explicitly into consideration the cost of each measurement (rather than minimizing the number of measurements), and optimize the measurement matrix that leads to energy efficient data-gathering in WSN. For depth map compression, the constraint to consider is the total bitrate, including both the number of bits for measurements and the bit overhead to code the edge map required for the construction of graph-based transform (GBT). To improve overall performance, we propose a greedy algorithm that selects for each block the GBT that minimizes a metric accounting for both the edge structure of the block and the characteristics of the… Advisors/Committee Members: Ortega, Antonio K. (Committee Chair), Krishnamachari, Bhaskar (Committee Member), Neumann, Ulrich (Committee Member).

Subjects/Keywords: compressed sensing; compressive sampling; wireless sensor network; data-gathering; depthmap compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lee, S. (2013). Application-driven compressed sensing. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/313894/rec/859

Chicago Manual of Style (16^th Edition):

Lee, Sungwon. “Application-driven compressed sensing.” 2013. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/313894/rec/859.

MLA Handbook (7^th Edition):

Lee, Sungwon. “Application-driven compressed sensing.” 2013. Web. 22 Jan 2021.

Vancouver:

Lee S. Application-driven compressed sensing. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/313894/rec/859.

Council of Science Editors:

Lee S. Application-driven compressed sensing. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/313894/rec/859

University of Southern California

14. Ahn, Joon. Optimizing information querying and dissemination in wireless networks.

Degree: PhD, Electrical Engineering, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/636656/rec/4618

► The recent advancement in semiconductor technologies brings more and more smart devices everywhere around us. Many emerging networks of such devices are envisioned to bring… (more)

▼ The recent advancement in semiconductor technologies brings more and more smart devices everywhere around us. Many emerging networks of such devices are envisioned to bring forward the era when we can gather information from everywhere, process them in real-time to make better decision on our activities, and tap into the necessary information from anywhere, whether at a standstill or moving around. In this dissertation, we consider two such promising networks — Wireless Sensor Networks (WSN) and Vehicular Networks — to see how they can effectively share the information they produce and consume. ❧ First, we investigate how to search efﬁciently for the interesting information generated by monitoring the physical world through WSNs and look into the implication of our ﬁndings. We derive mathematical models for communication costs in information sharing (through search and replication) and optimize the energy-wise communication costs when the WSN operates as a distributed database system. The optimization results are then used to reveal the scaling laws of the network in terms of energy requirements. ❧ As a second study we investigate how to effectively disseminate over a vehicular network the information (e.g. multimedia ﬁles) that a group of people want to consume while they are moving around in the vehicles. We consider a hybrid network of vehicles in which vehicles are equipped with two kinds of radios: a high-cost low-bandwidth, long-range cellular radio, and a free high-bandwidth short-range radio. We formulate an optimization problem to maximize content dissemination from central servers to vehicles within a predetermined deadline while minimizing the cost associated with communicating over the cellular connection. We mathematically analyze the dissemination process and derive a closed-form optimal solution. We also develop a polynomial-time algorithm to obtain the optimal discrete solution better suited for practice and verify our results using real GPS traces of taxis. Advisors/Committee Members: Krishnamachari, Bhaskar (Committee Chair), Silvester, John (Committee Member), Govindan, Ramesh (Committee Member).

Subjects/Keywords: querying; dissemination; optimization; performance analysis; wireless sensor networks; vehicular networks; trace-based simulation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ahn, J. (2011). Optimizing information querying and dissemination in wireless networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/636656/rec/4618

Chicago Manual of Style (16^th Edition):

Ahn, Joon. “Optimizing information querying and dissemination in wireless networks.” 2011. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/636656/rec/4618.

MLA Handbook (7^th Edition):

Ahn, Joon. “Optimizing information querying and dissemination in wireless networks.” 2011. Web. 22 Jan 2021.

Vancouver:

Ahn J. Optimizing information querying and dissemination in wireless networks. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/636656/rec/4618.

Council of Science Editors:

Ahn J. Optimizing information querying and dissemination in wireless networks. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/636656/rec/4618

University of Southern California

15. Goodney, Andrew P. Sensing with sound: acoustic tomography and underwater sensor networks.

Degree: PhD, Computer Science, 2015, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/538121/rec/5798

► Water temperature sensing in the marine environment is an important task motivated by use of the oceans for industrial purposes, national defense and ecological research.… (more)

▼ Water temperature sensing in the marine environment is an important task motivated by use of the oceans for industrial purposes, national defense and ecological research. Scientists and engineers desire real-time, high resolution temperature maps so that the dynamic nature of underwater processes can be tracked and understood with high fidelity. Point sensors, which only sense in one location, require dense deployments of sensor nodes to provide high resolution water temperature maps and thus spatial resolution is constrained by the cost of deploying additional nodes. Robotic boats and autonomous underwater vehicles (AUVs) can sample at high spatial resolutions, however they can only sample at one location at a given time. Therefore such water craft can miss dynamic water temperature events that might occur in the area of interest, but not directly at the current location of the robot or AUV. These water craft are also known for being fabulously expensive, with a per unit costs on the order of $100k. ❧ Point sensors can be deployed as underwater wireless sensor network where the communication links are formed through the water using acoustic modems. Our initial work for this dissertation made the observation that since speed-of-sound in water is dependent on the water temperature, the acoustic communications links could be used for sensing between the nodes by measuring the time-of-flight for a signal between two nodes. Known as acoustic tomography, this technique had previously been applied in the ocean with internode distances measuring 100's to 1000's of kilometers. In order to implement acoustic tomography with a sensor network we developed two novel and highly precise time-of-flight measurement techniques on top of a novel coding scheme that allows underwater sensor networks to combine data and sensing transmissions. ❧ Acoustic tomography increases the resolution of water temperature maps over those drawn from just point sensors by reconstructing the sound-speed field located between the sensor nodes by using the time-of-flight data for signals sent between the nodes. However, current travel-time tomography techniques make the assumption that for each node pair only one data point can be observed: the average speed-of-sound along the path between the nodes. The resolution of a reconstruction is thus limited by the number of paths that cross through an area of interest, and therefore to increase the resolution of an acoustic tomography system more nodes must be added in strategic locations, which may not always be possible due to cost and/or other limitations. ❧ Our third contribution is a travel-time acoustic tomography technique that breaks the ""average assumption."" With our technique we are able to derive a spatial distribution of water temperature along each acoustic path, and the spatial resolution of the distribution is not limited by node density, but by the time-of-flight measurement precision. This dissertation introduces the technique, which we call multipulse acoustic tomography, and shows that if a… Advisors/Committee Members: Cho, Young H. (Committee Chair), Teng, Shang-Hua (Committee Member), Krishnamachari, Bhaskar (Committee Member).

Subjects/Keywords: acoustic sensor networks; remote sensing; acoustical oceanography; acoustic tomography; underwater sensor networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Goodney, A. P. (2015). Sensing with sound: acoustic tomography and underwater sensor networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/538121/rec/5798

Chicago Manual of Style (16^th Edition):

Goodney, Andrew P. “Sensing with sound: acoustic tomography and underwater sensor networks.” 2015. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/538121/rec/5798.

MLA Handbook (7^th Edition):

Goodney, Andrew P. “Sensing with sound: acoustic tomography and underwater sensor networks.” 2015. Web. 22 Jan 2021.

Vancouver:

Goodney AP. Sensing with sound: acoustic tomography and underwater sensor networks. [Internet] [Doctoral dissertation]. University of Southern California; 2015. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/538121/rec/5798.

Council of Science Editors:

Goodney AP. Sensing with sound: acoustic tomography and underwater sensor networks. [Doctoral Dissertation]. University of Southern California; 2015. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/538121/rec/5798

University of Southern California

16. Ramachandran, Gokul. A biologically inspired role-based team strategy for pursuit-evasion in robots.

Degree: MS, Computer Science (Robotics and Automation), 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/653087/rec/53

► This thesis presents a robust, scalable and general Java applet-based simulator for pursuit-evasion problems. With this tool, experiments can be conducted by simulating multi-player pursuit-evasion… (more)

Subjects/Keywords: chasing; rvasion; pursuit; robotics; simulator; team; pursuit evasion; pursuit-evasion; team strategy; agents; agent based; agent-based; Java; iRobot Create; JavaCV; Bluetooth; firewire camera

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ramachandran, G. (2011). A biologically inspired role-based team strategy for pursuit-evasion in robots. (Masters Thesis). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/653087/rec/53

Chicago Manual of Style (16^th Edition):

Ramachandran, Gokul. “A biologically inspired role-based team strategy for pursuit-evasion in robots.” 2011. Masters Thesis, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/653087/rec/53.

MLA Handbook (7^th Edition):

Ramachandran, Gokul. “A biologically inspired role-based team strategy for pursuit-evasion in robots.” 2011. Web. 22 Jan 2021.

Vancouver:

Ramachandran G. A biologically inspired role-based team strategy for pursuit-evasion in robots. [Internet] [Masters thesis]. University of Southern California; 2011. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/653087/rec/53.

Council of Science Editors:

Ramachandran G. A biologically inspired role-based team strategy for pursuit-evasion in robots. [Masters Thesis]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/653087/rec/53

University of Southern California

17. Zhang, Chengjie. Design of cost-efficient multi-sensor collaboration in wireless sensor networks.

Degree: PhD, Computer Science, 2013, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/330649/rec/1868

► Recent years have witnessed an increasing demand for monitoring tasks in industrial applications. Although effective in some applications, sensornet uptake has been slow in this… (more)

▼ Recent years have witnessed an increasing demand for monitoring tasks in industrial applications. Although effective in some applications, sensornet uptake has been slow in this emerging area, as shown by slow sensornet deployment in industry. Industries prefer well-tested but often expensive or complex sensing solutions because they provide known levels of accuracy, but this choice makes many problems uneconomic. The sensornet research community has made significant progress towards real-world applications with some pilot deployments. While sensornet research is promising, current prototypes are often not cost-effective or still in the early stages. Industry remains slow to adopt these approaches, because they are not seen to address concerns about accuracy for industry-relevant problems. ❧ In this thesis, we propose Multi-Sensor Collaboration to achieve low-cost yet accurate event detection and enable sensornet usage in cost-sensitive industrial applications. We find that four advantages of collaboration improve cost-effectiveness. First, collaborative sensing can improve accuracy by suppressing false alarms with redundant or heterogeneous sensors. Second, collaborative sensing reduces capital cost by enabling low-cost sensors to be accurate enough to reach actionable results. Third, collaboration can reduce deployment cost, because it enables non-invasive sensing to provide sufficient accuracy with much less expensive installation. Finally, auto-tuning is important to reduce deployment costs, and collaborative sensing can assist auto-tuning by allowing sensors in different modalities to tune each other with their unique information. ❧ The thesis of this proposed dissertation is that Multi-sensor collaboration enables sensor networks to accomplish real-world event detection tasks that are impractical for single-sensor systems. To frame the application domain, we categorize sensing applications by their two orthogonal properties – collaboration scheme and sensing modality. Collaboration scheme, namely the relationship between sensors, is usually in two distinctive forms – competitive and complementary. Competitive collaboration means redundantly suppressing less accurate sensors' results; complementary collaboration combines all relevant sensors' partial results to form the final result. Modality means the type of the raw input of a sensor. To explore the application domain, we study both collaborations with either modality choice in three example applications. First, we evaluate signature matching in a vehicle classification context to study single-modal competitive collaboration. Second, we present a design of steam-choke blockage-detection system to study single-modal complementary collaboration. Finally, we implement and evaluate a detection system for oil-retrieval-line blockage to extend our complementary type study to multi-modality. We prove sensor collaboration can achieve cost-efficiency in the forgoing three specific applications. These applications are useful and allow deployment of sensing where not… Advisors/Committee Members: Heidemann, John (Committee Chair), Krishnamachari, Bhaskar (Committee Member), Govindan, Ramesh (Committee Member).

Subjects/Keywords: blockage detection; multi-modal sensing; sensornets; vehicle classification; wireless sensor networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhang, C. (2013). Design of cost-efficient multi-sensor collaboration in wireless sensor networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/330649/rec/1868

Chicago Manual of Style (16^th Edition):

Zhang, Chengjie. “Design of cost-efficient multi-sensor collaboration in wireless sensor networks.” 2013. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/330649/rec/1868.

MLA Handbook (7^th Edition):

Zhang, Chengjie. “Design of cost-efficient multi-sensor collaboration in wireless sensor networks.” 2013. Web. 22 Jan 2021.

Vancouver:

Zhang C. Design of cost-efficient multi-sensor collaboration in wireless sensor networks. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/330649/rec/1868.

Council of Science Editors:

Zhang C. Design of cost-efficient multi-sensor collaboration in wireless sensor networks. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/330649/rec/1868

University of Southern California

18. Wang, Yi. Towards energy efficient mobile sensing.

Degree: PhD, Electrical Engineering, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/445526/rec/7537

► Mobile device based urban sensing, participatory sensing, and user activity recognition can provide rich contextual information for mobile applications such as social networking and location… (more)

▼ Mobile device based urban sensing, participatory sensing, and user activity recognition can provide rich contextual information for mobile applications such as social networking and location based services. However, as the sensors on mobile devices consume significant amount of energy, the major bottleneck that restricts the continuous functioning of these mobile applications is the limited battery capacity on mobile devices.; In this thesis, we first present a novel design framework for an Energy Efficient Mobile Sensing System (EEMSS). EEMSS uses hierarchical sensor management strategy to recognize user states as well as to detect state transitions. By powering only a minimum set of sensors and managing sensors hierarchically, EEMSS significantly improves device battery life. We present the design, implementation, and evaluation of EEMSS that automatically recognizes a set of users' daily activities in real time using sensors on an off-the-shelf high-end smart phone. Evaluation of EEMSS with 10 users over one week shows that our approach increases the device battery life by more than 75% while maintaining both high accuracy and low latency in identifying transitions between end-user activities.; We then propose a computationally efficient algorithm to obtain the optimal sensor sampling policy under the assumption that the user state transition is Markovian. This Markov-optimal policy minimizes user state estimation error while satisfying a given energy consumption budget. The Markov-optimal policy is compared to uniform periodic sensing and performance improvement is obtained on both simulated and real user state traces, with approximately 20% average gain on empirically collected user data that pertains to user motion, inter-user contact status, and network connectivity.; Finally, we formulate the user state sensing problem as the intermittent sampling of a semi-Markov process, a model that provides more general and flexible capturing of realistic data. We propose (a) a semi-Markovian state estimation mechanism that selects the most likely user state while observations are missing, and (b) a semi-Markov optimal sensing policy which minimizes the expected state estimation error while maintaining a given energy budget. Their performance is shown to significantly outperform Markovian algorithms on simulated two-state processes and real user state traces. In addition, we propose a novel client-server based energy efficient mobile sensing system architecture that automatically learns user dynamics and computes user-specific optimal sensing policy for mobile devices. A system prototype aiming to recognize basic human activity is implemented on Nokia N95 smartphones and desktop computers. We demonstrate the performance benchmark of the semi-Markov optimal policy through a set of experiments, and show that it improves the estimation accuracy by 27.8% and 48.6% over Markov-optimal policy and uniform sampling, respectively. Advisors/Committee Members: Krishnamachari, Bhaskar (Committee Chair), Annavaram, Murali (Committee Member), Sukhatme, Gaurav S. (Committee Member).

Subjects/Keywords: constrained stochastic optimization; energy efficiency; mobile sensing; state estimation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wang, Y. (2011). Towards energy efficient mobile sensing. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/445526/rec/7537

Chicago Manual of Style (16^th Edition):

Wang, Yi. “Towards energy efficient mobile sensing.” 2011. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/445526/rec/7537.

MLA Handbook (7^th Edition):

Wang, Yi. “Towards energy efficient mobile sensing.” 2011. Web. 22 Jan 2021.

Vancouver:

Wang Y. Towards energy efficient mobile sensing. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/445526/rec/7537.

Council of Science Editors:

Wang Y. Towards energy efficient mobile sensing. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/445526/rec/7537

University of Southern California

19. Jang, Ki Young. Explicit airtime allocation in 802.11-based wireless networks.

Degree: PhD, Computer Science, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/659491/rec/2643

► Wireless technology has become an essential part of everyday life. The growth in the availability of wireless networks, the number of wireless devices, and the… (more)

Subjects/Keywords: 802.11; network; wireless

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jang, K. Y. (2011). Explicit airtime allocation in 802.11-based wireless networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/659491/rec/2643

Chicago Manual of Style (16^th Edition):

Jang, Ki Young. “Explicit airtime allocation in 802.11-based wireless networks.” 2011. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/659491/rec/2643.

MLA Handbook (7^th Edition):

Jang, Ki Young. “Explicit airtime allocation in 802.11-based wireless networks.” 2011. Web. 22 Jan 2021.

Vancouver:

Jang KY. Explicit airtime allocation in 802.11-based wireless networks. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/659491/rec/2643.

Council of Science Editors:

Jang KY. Explicit airtime allocation in 802.11-based wireless networks. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/659491/rec/2643

University of Southern California

20. Rossi, Lorenzo. Efficient data collection in wireless sensor networks: modeling and algorithms.

Degree: PhD, Electrical Engineering, 2012, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/195260/rec/2245

► This dissertation focuses on data gathering for wireless sensor networks. Data gathering deals with the problem of transmitting measurements of physical phenomena from the sensor… (more)

Subjects/Keywords: digital signal processing; information theory; pattern recognition; wireless sensor networks; partial differential equations; spatially non-stationary correlations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Rossi, L. (2012). Efficient data collection in wireless sensor networks: modeling and algorithms. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/195260/rec/2245

Chicago Manual of Style (16^th Edition):

Rossi, Lorenzo. “Efficient data collection in wireless sensor networks: modeling and algorithms.” 2012. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/195260/rec/2245.

MLA Handbook (7^th Edition):

Rossi, Lorenzo. “Efficient data collection in wireless sensor networks: modeling and algorithms.” 2012. Web. 22 Jan 2021.

Vancouver:

Rossi L. Efficient data collection in wireless sensor networks: modeling and algorithms. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/195260/rec/2245.

Council of Science Editors:

Rossi L. Efficient data collection in wireless sensor networks: modeling and algorithms. [Doctoral Dissertation]. University of Southern California; 2012. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/195260/rec/2245

University of Southern California

21. Gai, Yi. Online learning algorithms for network optimization with unknown variables.

Degree: PhD, Electrical Engineering, 2012, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/120026/rec/4577

► The formulations and theories of multi-armed bandit (MAB) problems provide fundamental tools for optimal sequential decision making and learning in uncertain environments. They have been… (more)

▼ The formulations and theories of multi-armed bandit (MAB) problems provide fundamental tools for optimal sequential decision making and learning in uncertain environments. They have been widely applied to resource allocation, scheduling, and routing in communication networks, particularly in recent years, as the field is seeing an increasing focus on adaptive online learning algorithms to enhance system performance in stochastic, dynamic, and distributed environments. This dissertation addresses several key problems in this domain. ❧ Our first focus is about MAB with linear rewards. As they are fundamentally about combinatorial optimization in unknown environments, one would indeed expect to find even broader use of multi-armed bandits. However, a barrier to their wider application in practice has been the limitation of the basic formulation and corresponding policies, which generally treat each arm as an independent entity. They are inadequate to deal with many combinatorial problems of practical interest in which there are large numbers of arms. In such settings, it is important to consider and exploit any structure in terms of dependencies between the arms. In this dissertation, we show that when the dependencies take a linear form, they can be handled tractably with algorithms that have provably good performance in terms of regret as well as storage and computation. We develop a new class of learning algorithms for different problem settings including i.i.d. rewards, rested Markovian rewards, and restless Markovian rewards, to improve the cost of learning, compared to prior work, for large-scale stochastic network optimization problems. ❧ We then consider the problem of optimal power allocation over parallel channels with stochastically time-varying gain-to-noise ratios for maximizing information rate (stochastic water-filling) with both linear and non-linear multi-armed bandit formulations and propose new efficient online learning algorithms for these. ❧ Finally, we focus on learning in decentralized settings. The desired objective is to develop decentralized online learning algorithms running at each user to make a selection among multiple choices, where there is no information exchange, such that the sum-throughput of all distributed users is maximized. We make two contributions in this problem. First, we consider the setting where the users have a prioritized ranking, such that it is desired for the K-th ranked user to learn to access the arm offering the K-th highest mean reward. For this problem, we present the first distributed algorithm that yields regret that is uniformly logarithmic over time without requiring any prior assumption about the mean rewards. Second, we consider the case when a fair access policy is required, i.e., it is desired for all users to experience the same mean reward. For this problem, we present a distributed algorithm that yields order-optimal regret scaling with respect to the number of users and arms, better than previously proposed algorithms in the literature. Advisors/Committee Members: Krishnamachari, Bhaskar (Committee Chair), Jain, Rahul (Committee Member), Dughmi, Shaddin (Committee Member).

Subjects/Keywords: online learning; network optimization; algorithm design and analysis; machine learning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gai, Y. (2012). Online learning algorithms for network optimization with unknown variables. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/120026/rec/4577

Chicago Manual of Style (16^th Edition):

Gai, Yi. “Online learning algorithms for network optimization with unknown variables.” 2012. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/120026/rec/4577.

MLA Handbook (7^th Edition):

Gai, Yi. “Online learning algorithms for network optimization with unknown variables.” 2012. Web. 22 Jan 2021.

Vancouver:

Gai Y. Online learning algorithms for network optimization with unknown variables. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/120026/rec/4577.

Council of Science Editors:

Gai Y. Online learning algorithms for network optimization with unknown variables. [Doctoral Dissertation]. University of Southern California; 2012. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/120026/rec/4577

University of Southern California

22. Urgaonkar, Rahul. Optimal resource allocation and cross-layer control in cognitive and cooperative wireless networks.

Degree: PhD, Electrical Engineering, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/449856/rec/4609

► We investigate four problems on optimal resource allocation and cross-layer control in cognitive and cooperative wireless networks with time-varying channels. The first three problems consider… (more)

▼ We investigate four problems on optimal resource allocation and cross-layer control in cognitive and cooperative wireless networks with time-varying channels. The first three problems consider different models and capabilities associated with cognition and cooperation in such networks. Specifically, the first problem focuses on the dynamic spectrum access model for cognitive radio networks and assumes no cooperation between the licensed (or "primary") and unlicensed (or "secondary") users. Here, the secondary users try to avoid interfering with the primary users while seeking transmission opportunities on vacant primary channels in frequency, time, or space. The second problem considers a relay-based fully cooperative wireless network. Here, cooperative communication techniques at the physical layer are used to improve the reliability and energy cost of data transmissions. The third problem considers a cooperative cognitive radio network where the secondary users can cooperatively transmit with the primary users to improve the latter's effective transmission rate. In return, the secondary users get more opportunities for transmitting their own data when the primary users are idle.; In all of these scenarios, our goal is to design optimal control algorithms that maximize time-average network utilities (such as throughput) subject to time-average constraints (such as power, reliability, etc.). To this end, we make use of the technique of Lyapunov optimization to design online control algorithms that can operate without requiring any knowledge of the statistical description of network dynamics (such as fading channels, node mobility, and random packet arrivals) and are provably optimal. The algorithms for the first two problems use greedy decisions over one slot and two-slot frames, whereas the algorithm for the third problem involves a stochastic shortest path decision over a variable length frame, and this is explicitly solved, remarkably without requiring knowledge of the network arrival rates.; Finally, in the fourth problem, we investigate optimal routing and scheduling in static wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual information with every packet transmission. This enables a significant performance gain over conventional shortest path routing. Further, it also outperforms cooperative communication techniques that are based on energy accumulation. However, it requires complex and combinatorial networking decisions concerning which nodes participate in transmission, and which decode ordering to use. We formulate the general problems as combinatorial optimization problems and identify several structural properties of the optimal solutions. This enables us to derive optimal greedy algorithms to solve these problems. This work uses a different set of tools and can be read independently of the other chapters. Advisors/Committee Members: Neely, Michael J. (Committee Chair), Krishnamachari, Bhaskar (Committee Member), Caire, Giuseppe (Committee Member), Golubchik, Leana (Committee Member).

Subjects/Keywords: cognitive radio; cooperative communication; optimal control; resource allocation; stochastic optimization; wireless networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Urgaonkar, R. (2011). Optimal resource allocation and cross-layer control in cognitive and cooperative wireless networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/449856/rec/4609

Chicago Manual of Style (16^th Edition):

Urgaonkar, Rahul. “Optimal resource allocation and cross-layer control in cognitive and cooperative wireless networks.” 2011. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/449856/rec/4609.

MLA Handbook (7^th Edition):

Urgaonkar, Rahul. “Optimal resource allocation and cross-layer control in cognitive and cooperative wireless networks.” 2011. Web. 22 Jan 2021.

Vancouver:

Urgaonkar R. Optimal resource allocation and cross-layer control in cognitive and cooperative wireless networks. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/449856/rec/4609.

Council of Science Editors:

Urgaonkar R. Optimal resource allocation and cross-layer control in cognitive and cooperative wireless networks. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/449856/rec/4609

University of Southern California

23. Sathiamoorthy, Maheswaran. Optimizing distributed storage in cloud environments.

Degree: PhD, Electrical Engineering, 2013, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/351890/rec/4617

► Cloud storage, in the context of this research, is defined to be the abstraction of storage spanning multiple machines into a single storage pool that… (more)

▼ Cloud storage, in the context of this research, is defined to be the abstraction of storage spanning multiple machines into a single storage pool that end-users can access without knowing the internal details of where or how the storage is maintained. Traditionally, cloud storage is used to refer to the storage pool in data centers. In our work, in addition to data center based cloud storage, we also consider a vehicular network based cloud storage – storage obtained by pooling together the storage on vehicles, typically connected by a vehicular network. ❧ In this thesis, we optimize the distributed storage in these two cloud environments. Specifically, we identify two challenges each in the two cloud environments and propose solutions to these challenges. ❧ In Chapter 3, we consider the first important challenge in the vehicular cloud, namely the high latencies of on-demand content access. We investigate the benefits of using erasure codes in reducing the content access latencies through both analysis and realistic trace-based simulations. We show that a key parameter affecting the file download latency is the ratio of file size to download bandwidth. When this ratio is small so that a file can be communicated in a single encounter, we find that coding techniques offer very little benefit over simple file replication. However, we analytically show that for large ratios, for a memoryless contact model, distributed erasure coding yields a latency benefit of N/α over uncoded replication, where N is the number of vehicles and α the redundancy factor. Effectively, in this regime, coding yields the same performance as replicating all the files at all other vehicles, but using much less storage. We also evaluate the benefits of coded storage using large real vehicle traces of taxis in Beijing and buses in Chicago. These simulations, which include a realistic radio link quality model for a IEEE 802.11p dedicated short range communication (DSRC) radio, validate the observations from the analysis, demonstrating that coded storage dramatically speeds up the download of large files in vehicular networks. ❧ In Chapter 4, we consider the second challenge, namely the problem of helper node allocation. In order to relay a file from a node that has the file to another that wants the file, it may be necessary to enlist the help of other relaying nodes. When there are multiple types of files, an existing pool of helper nodes cannot help the dissemination of all the files due to storage and bandwidth constraints. In the chapter, we formulate and address mathematically this fundamental problem of resource allocation in the form of helper nodes in disseminating multiple contents. We consider a stochastic homogeneous contact process for the nodes in the vehicular network, or more generally an intermittently connected mobile network. We consider and solve two variations of the problem – one in which the goal is to maximize the expected number of demands satisfied and another in which the goal is to minimize the time taken to disseminate… Advisors/Committee Members: Krishnamachari, Bhaskar (Committee Chair), Neely, Michael J. (Committee Member), Yu, Minlan (Committee Member), Dimakis, Alexandros G. (Committee Member), Bai, Fan (Committee Member).

Subjects/Keywords: cloud environment; data centers; distributed storage; erasure codes; optimization; vehicular networking

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sathiamoorthy, M. (2013). Optimizing distributed storage in cloud environments. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/351890/rec/4617

Chicago Manual of Style (16^th Edition):

Sathiamoorthy, Maheswaran. “Optimizing distributed storage in cloud environments.” 2013. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/351890/rec/4617.

MLA Handbook (7^th Edition):

Sathiamoorthy, Maheswaran. “Optimizing distributed storage in cloud environments.” 2013. Web. 22 Jan 2021.

Vancouver:

Sathiamoorthy M. Optimizing distributed storage in cloud environments. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/351890/rec/4617.

Council of Science Editors:

Sathiamoorthy M. Optimizing distributed storage in cloud environments. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/351890/rec/4617

University of Southern California

24. Barahmand, Sumita. Benchmarking interactive social networking actions.

Degree: PhD, Computer Science, 2014, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/406714/rec/1072

► Social networking sites such as Google+, Facebook, Twitter and LinkedIn, are cloud service providers for person to person communications. There are different approaches to building… (more)

▼ Social networking sites such as Google+, Facebook, Twitter and LinkedIn, are cloud service providers for person to person communications. There are different approaches to building these sites ranging from SQL to NoSQL and NewSQL, Cache Augmented SQL, graph databases and others. Some provide a tabular representation of data while others offer alternative models that scale out. Some may sacrifice strict ACID (Atomicity, Consistency, Isolation, Durability) properties and opt for BASE (Basically Available, Soft‐state, Eventual consistency) to enhance performance. Independent of a qualitative discussion of these approaches and their merits, a key question is how do these systems compare with one another quantitatively? This dissertation investigates the viability of a benchmark to address this question. ❧ Our primary contribution is the design and implementation of a novel benchmark for interactive social networking actions named BG (http://bgbenchmark.org). BG’s design decisions are as follows: First, it rates the performance of a system for processing interactive social networking actions by computing two values: Socialites and Social Action Rating (SoAR) using a pre‐specified Service Level Agreement, SLA. An example SLA may require 95% of issued requests to observe a response time faster than 100 milliseconds. Second, BG elevates the amount of unpredictable data produced by a solution to a first class metric, including it as a key component of the SLA (similar to the average response time) and quantifying it as a part of the benchmarking process. It also computes the freshness confidence to characterize the behavior of a weak consistency technique. Third, BG’s generated workload is characterized by reads and writes of a very small amount of data from big data. Fourth, BG is a modular, extensible framework that is agnostic to its underlying data store. Fifth, BG employs a logical partitioning of data to scale both vertically and horizontally to thousands of nodes. This is essential for evaluating scalable installations consisting of thousands of nodes. Finally, BG includes a visualization tool to empower an evaluator to monitor an in‐progress benchmark and identify bottlenecks. ❧ BG’s possible use cases are diverse. One may use BG to compare and contrast various data stores with one another, characterize tradeoffs associated with alternative physical representations of data, or quantify the behavior of a data store in the presence of various failures (either CP or AP of the CAP theorem) among the others. This dissertation demonstrates use of BG in two contexts. First, to rate an industrial strength relational database management system and a document store, quantifying their performance tradeoffs. This analysis includes the use of a middle tier cache (memcached) and its impact on the performance of each system. Second, to gain insight into alternative design decisions for implementing a social action by characterizing their behavior with different social graphs and system loads. BG’s proposed framework is quite novel… Advisors/Committee Members: Ghandeharizadeh, Shahram (Committee Chair), Govindan, Ramesh (Committee Member), Medvidović, Nenad (Committee Member), Medvidovic, Nenad (Committee Member), Krishnamachari, Bhaskar (Committee Member).

Subjects/Keywords: benchmarks; social networks; data store; data consistency; data freshness; SoAR; socialite; unpredictable data; scalability; performance evaluation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Barahmand, S. (2014). Benchmarking interactive social networking actions. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/406714/rec/1072

Chicago Manual of Style (16^th Edition):

Barahmand, Sumita. “Benchmarking interactive social networking actions.” 2014. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/406714/rec/1072.

MLA Handbook (7^th Edition):

Barahmand, Sumita. “Benchmarking interactive social networking actions.” 2014. Web. 22 Jan 2021.

Vancouver:

Barahmand S. Benchmarking interactive social networking actions. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/406714/rec/1072.

Council of Science Editors:

Barahmand S. Benchmarking interactive social networking actions. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/406714/rec/1072

University of Southern California

25. Williams, Ryan K. Interaction and topology in distributed multi-agent coordination.

Degree: PhD, Electrical Engineering, 2014, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/432814/rec/3570

► Interconnected systems have become the recent focus of intense investigation, particularly in the context of autonomous coordination, yielding fundamental advantages in adaptability, scalability, and efficiency… (more)

▼ Interconnected systems have become the recent focus of intense investigation, particularly in the context of autonomous coordination, yielding fundamental advantages in adaptability, scalability, and efficiency compared to single‐agent solutions. In this thesis, we investigate the topological assumptions that underly distributed multi‐agent coordination, i.e., those properties defining interaction between agents in a network. We focus specifically on the properties of network connectivity and graph rigidity, which exhibit strong influence on fundamental multi‐agent behaviors, e.g., joint decision‐making, cooperative estimation, formation control, and relative localization. These bases of coordination contribute to the construction of increasingly complex multi‐agent systems, and in harnessing the underlying threads of topology, there is hope in solving the future challenges of coordination in a world of robotic ubiquity. Thus, this thesis aims to strike distributed autonomy at its core, by treating assumptions which render theoretical treatments feasible, but which leave implementation relegated to the laboratory. ❧ Motivated by a case study that illustrates the topological assumptions necessary to solve the probabilistic mapping and tracking problem, we extend the state of the art in mobility control by regulating topology through preemptive mobility, discriminating link addition and deletion to shape spatial interaction under topological constraints. Adopting realistic models of proximity‐limited coordination, local controllers are constructed with discrete switching for link discrimination, and attract‐repel potential fields which yield constraint satisfying motion. Our mobility scheme acts as a full generalization of classical swarm‐like controllers, yielding decision‐based, topology‐driven coordination. When topological constraints are non‐local, as is the case for both connectivity and rigidity, we illustrate how consensus‐based decision‐making can preserve preemption while maintaining the feasibility of topological constraints. To evaluate the specific constraint of network connectedness, we propose an inverse iteration algorithm that estimates the eigenpair associated with algebraic connectivity. Our solution is fully distributed, scalable, and it improves on the convergence rate issues of the state of the art. Finally, as a case study of heterogeneity, we introduce a hybrid architecture in which a robotic network is dynamically reconfigured to ensure high quality information flow between static nodes while preserving connectivity. In solving this problem, we propose components that couple connectivity‐preserving robot‐to‐flow allocations, with distributed communication optimizing mobility; a heuristic we call Route Swarm. ❧ The second half of the thesis focuses on the rigidity property of a multi‐agent network. We provide a decentralized algorithm that determines a spanning edge set defining the minimally rigid subcomponent of a graph. Leader election manages sequential execution, and an asynchronous… Advisors/Committee Members: Sukhatme, Gaurav S. (Committee Chair), Krishnamachari, Bhaskar (Committee Member), Jain, Rahul (Committee Member), Ioannou, Petros (Committee Member), Sha, Fei (Committee Member).

Subjects/Keywords: distributed robot systems; dynamic networks; graph connectivity; graph rigidity; multi‐robot coordination; sensor networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Williams, R. K. (2014). Interaction and topology in distributed multi-agent coordination. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/432814/rec/3570

Chicago Manual of Style (16^th Edition):

Williams, Ryan K. “Interaction and topology in distributed multi-agent coordination.” 2014. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/432814/rec/3570.

MLA Handbook (7^th Edition):

Williams, Ryan K. “Interaction and topology in distributed multi-agent coordination.” 2014. Web. 22 Jan 2021.

Vancouver:

Williams RK. Interaction and topology in distributed multi-agent coordination. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/432814/rec/3570.

Council of Science Editors:

Williams RK. Interaction and topology in distributed multi-agent coordination. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/432814/rec/3570

University of Southern California

26. Shen, Junyang. Localization of multiple targets in multi-path environnents.

Degree: PhD, Electrical Engineering, 2013, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/355576/rec/3856

► Passive localization of objects is fast becoming a major aspect of wireless technologies, with applications in logistics, surveillance, and emergency response, etc. The localization can… (more)

▼ Passive localization of objects is fast becoming a major aspect of wireless technologies, with applications in logistics, surveillance, and emergency response, etc. The localization can be performed with a variety of localization techniques based on different system parameters such as the angle of arrival (AOA), and the signal time of arrival (TOA) measurements. However, these measured parameters are corrupted by background noise. Further complications in realistic settings arise from the following factors: (i) the direct paths (DPs) between transmitters/receivers and targets might be blocked, (ii) indirect paths (IPs) arising from multi path propagation might be present, (iii) signals reflected by multiple targets cannnot be distinguished by their ""signatures"" or other unique characteristics. This thesis offers novel solutions to combat theses challenges: Individual Target Localization with Noisy TOA measurements: Consider a single target localization problem, if there are no IPs or if IPs can be perfectly identified, the error of target location estimate is due to the noisy TOA measurements. We propose a Two Step Estimation (TSE) method which employs the TOA measurements and the variances of them to perform approximate maximum likelihood through a two step mechanism. Its complexity is lower than iterative methods, and is able to achieve the Cramer Rao Lower Bound (CRLB), which is the lower bound of mean square error for any un-biased estimator if TOA measurements suffer Gaussian errors. As far as we know, it is the first passive localization method to achieve the CRLB. Another benefit of TSE is that the distribution of the estimated target location is known. Furthermore, simulations and practical experiments are performed to verify the superiority of TSE. ❧ Indirect Path Detection with TOA and Angle Measurements: Because of non-target reflectors, the signals propagate from transmitter to receivers through DP or IPs. In some situations, the DP is blocked and then, the TOA measurements based on IPs would usually contain large errors (compared with errors induced by noise). Thus, IP detection algorithm needs to effectively detect the IPs, to avoid the detrimental effect of indirect paths on localization. We propose a scheme based on channel sounding parameters: TOA, DOD (direction of departure) and DOA (direction of arrival). The principle of the proposed TOA DOD and DOA joint (TDAJ) scheme is as follows: if there were no measurement errors, any DP would have self-consistent parameters of measurements. By this we mean that the three intersections obtained from the pairs of measured parameters are at the same location. In the presence of measurement errors, the decision variables of the Neyman-Pearson (NP) test are the differences between two of the three intersections in x or y coordinates: only if this difference lies below a certain threshold, the algorithm judges the path to be a DP. The benefit of the TDAJ depends on the measurements of TOA, DOD and DOA instead of multipath channel statistics. Simulation results… Advisors/Committee Members: Molisch, Andreas F. (Committee Chair), Hashemi, Hossein (Committee Member), Krishnamachari, Bhaskar (Committee Member), Huang, Qiang (Committee Member).

Subjects/Keywords: indoor localization; multi-target localization; MIMO radar; TOA; DOD; DOA; Ultra-wideband signals; Cramer-Rao Lower Bound; Maximum-likelihood Estimation; Mean Square Error; Indirect Path Detection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shen, J. (2013). Localization of multiple targets in multi-path environnents. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/355576/rec/3856

Chicago Manual of Style (16^th Edition):

Shen, Junyang. “Localization of multiple targets in multi-path environnents.” 2013. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/355576/rec/3856.

MLA Handbook (7^th Edition):

Shen, Junyang. “Localization of multiple targets in multi-path environnents.” 2013. Web. 22 Jan 2021.

Vancouver:

Shen J. Localization of multiple targets in multi-path environnents. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/355576/rec/3856.

Council of Science Editors:

Shen J. Localization of multiple targets in multi-path environnents. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/355576/rec/3856

University of Southern California

27. Li, Chih-ping. Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay.

Degree: PhD, Electrical Engineering, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078

► This dissertation addresses several optimal stochastic scheduling problems that arise in partially observable wireless networks and multi-class queueing systems. They are single-hop network control problems… (more)

▼ This dissertation addresses several optimal stochastic scheduling problems that arise in partially observable wireless networks and multi-class queueing systems. They are single-hop network control problems under different channel connectivity assumptions and different scheduling constraints. Our goals are two-fold: To identify stochastic scheduling problems of practical interest, and to develop analytical tools that lead to efficient control algorithms with provably optimal performance. ❧ In wireless networks, we study three sets of problems. First, we explore how the energy and timing overhead due to channel probing affects network performance. We develop a dynamic channel probing algorithm that is both throughput and energy optimal. The second problem is how to exploit time correlations of wireless channels to improve network throughput when instantaneous channel states are unavailable. Specifically, we study the network capacity region over a set of Markov ON/OFF channels with unknown current states. Recognizing that this is a difficult restless multi-armed bandit problem, we construct a non-trivial inner bound on the network capacity region by randomizing well-designed round robin policies. This inner bound is considered as an operational network capacity region because it is large and easily achievable. A queue-dependent round robin policy is constructed to support any throughput vector within the inner bound. In the third problem, we study throughput utility maximization over partially observable Markov ON/OFF channels (specifically, over the inner bound provided in the previous problem). It has applications in wireless networks with limited channel probing capability, cognitive radio networks, target tracking of unmanned aerial vehicles, and restless multi-armed bandit systems. An admission control and channel scheduling policy is developed to achieve near-optimal throughput utility within the inner bound. Here we use a novel ratio MaxWeight policy that generalizes the existing MaxWeight-type policies from time-slotted networks to frame-based systems that have policy-dependent random frame sizes. ❧ In multi-class queueing systems, we study how to optimize average service cost and per-class average queueing delay in a nonpreemptive multi-class M/G/1 queue that has adjustable service rates. Several convex delay penalty and service cost minimization problems with time-average constraints are investigated. We use the idea of virtual queues to transform these problems into a new set of queue stability problems, and the queue-stable policies are the desired solutions. The solutions are variants of dynamic c-mu rules, and implement weighted priority policies in every busy period, where the weights are functions of past queueing delays in each job class. ❧ Throughout these problems, our analysis and algorithm design uses and generalizes an achievable region approach driven by Lyapunov drift theory. We study the performance region (in throughput, power, or delay) of interest and identify, or design, a policy space so… Advisors/Committee Members: Neely, Michael J. (Committee Chair), Caire, Giuseppe (Committee Member), Jain, Rahul (Committee Member), Krishnamachari, Bhaskar (Committee Member), Ward, Amy R. (Committee Member).

Subjects/Keywords: stochastic network optimization; queueing theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Li, C. (2011). Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078

Chicago Manual of Style (16^th Edition):

Li, Chih-ping. “Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay.” 2011. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078.

MLA Handbook (7^th Edition):

Li, Chih-ping. “Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay.” 2011. Web. 22 Jan 2021.

Vancouver:

Li C. Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078.

Council of Science Editors:

Li C. Stochastic optimization over parallel queues: channel-blind scheduling, restless bandit, and optimal delay. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078

University of Southern California

28. Yin, Zhengyu. Addressing uncertainty in Stackelberg games for security: models and algorithms.

Degree: PhD, Computer Science, 2013, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/238610/rec/527

► Recently, there has been significant research interest in using game-theoretic approaches to allocate limited security resources to protect physical infrastructure including ports, airports, transit systems,… (more)

▼ Recently, there has been significant research interest in using game-theoretic approaches to allocate limited security resources to protect physical infrastructure including ports, airports, transit systems, and other critical national infrastructure as well as natural resources such as forests, tigers, fish, and so on. Indeed, the leader-follower Stackelberg game model is at the heart of many deployed applications. In these applications, the game model provides a randomized strategy for the leader (security forces), under the assumption that the adversary will conduct surveillance before launching an attack. Inevitably, the security forces are faced with the problem of uncertainty. For example, a security officer may execute a patrol strategy differently from the planned one due to unexpected events. Also the adversaries may have different types in terms of their preferences, objectives, and capabilities. While Bayesian Stackelberg games for modeling discrete uncertainty have been successfully used in deployed applications, they are NP-hard problems and existing methods perform poorly in scaling up the number of types: inadequate for complex real world problems. Furthermore, Bayesian Stackelberg games have not been applied to model execution and observation uncertainty and finally, they require the availability of full distributional information of the uncertainty. ❧ To overcome these difficulties, my thesis presents four major contributions. First, I provide a novel algorithm HUNTER for Bayesian Stackelberg games to scale up the number of types. Exploiting the efficiency of HUNTER, I show preference, execution and observation uncertainty can be addressed in a unified framework. Second, addressing execution and observation uncertainty whose distribution is difficult to estimate, I provide a robust optimization formulation to compute the optimal risk-averse leader strategy for security problems motivated by the ARMOR application. Third, addressing the uncertainty of the adversary's capability of conducting surveillance, I show that for a class of Stackelberg games motivated by real security applications, the leader is always best-responding with a Stackelberg equilibrium strategy regardless of whether the adversary conducts surveillance or not. As the final contribution, I provide TRUSTS, a novel game-theoretic formulation for scheduling randomized patrols in public transit domains where timing is a crucial component. TRUSTS addresses dynamic execution uncertainty in such spatiotemporal domains by integrating Markov Decision Processes into the game-theoretic model. Simulation results as well as real-world trials of TRUSTS in the Los Angeles Metro Rail system provide validations of the approach. Advisors/Committee Members: Tambe, Milind (Committee Chair), Ordóñez, Fernando (Committee Member), Ordonez, Fernando (Committee Member), Sandholm, Tuomas W. (Committee Member), Krishnamachari, Bhaskar (Committee Member), Maheswaran, Rajiv (Committee Member), McCubbins, Mathew D. (Committee Member).

Subjects/Keywords: algorithms; Game theory; optimization; robustness; security

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yin, Z. (2013). Addressing uncertainty in Stackelberg games for security: models and algorithms. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/238610/rec/527

Chicago Manual of Style (16^th Edition):

Yin, Zhengyu. “Addressing uncertainty in Stackelberg games for security: models and algorithms.” 2013. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/238610/rec/527.

MLA Handbook (7^th Edition):

Yin, Zhengyu. “Addressing uncertainty in Stackelberg games for security: models and algorithms.” 2013. Web. 22 Jan 2021.

Vancouver:

Yin Z. Addressing uncertainty in Stackelberg games for security: models and algorithms. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/238610/rec/527.

Council of Science Editors:

Yin Z. Addressing uncertainty in Stackelberg games for security: models and algorithms. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/238610/rec/527

University of Southern California

29. Tsai, Jason. Protecting networks against diffusive attacks: game-theoretic resource allocation for contagion mitigation.

Degree: PhD, Computer Science, 2013, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/283292/rec/5297

► Many real-world situations involve attempts to spread influence through a social network. For example, viral marketing is when a marketer selects a few people to… (more)

▼ Many real-world situations involve attempts to spread influence through a social network. For example, viral marketing is when a marketer selects a few people to receive some initial advertisement in the hopes that these `seeds' will spread the news. Even peacekeeping operations in one area have been shown to have a contagious effect on the neighboring vicinity. Each of these domains also features multiple parties seeking to maximize or mitigate a contagious effect by spreading its own influence among a select few seeds, naturally yielding an adversarial resource allocation problem. My work models the interconnected network of people as a graph and develops algorithms to optimize resource allocation in these networked competitive contagion scenarios. ❧ Game-theoretic resource allocation in the past has not considered domains with both a networked structure and contagion effects, rendering them unusable in critical domains such as rumor control, counterinsurgency, and crowd management. Networked domains without contagion effects already present computational challenges due to the large scale of the action space. To address this issue, my first contribution proposed efficient game-theoretic allocation algorithms for the graph-based urban road network domain. This work still provides the only polynomial-time algorithm for allocating vehicle checkpoints through a city, giving law enforcement officers an efficient tool to combat terrorists making their way to potential points of attack. Second, I have provided the first game-theoretic treatment for contagion mitigation in social networks and given practitioners the first principled techniques for such vital concerns as rumor control and counterinsurgency. Finally, I extended my work on game-theoretic contagion mitigation to address uncertainty about the network structure to find that, contrary to what evidence and intuition suggest, heuristic sampling approaches provide near-optimal solutions across a wide range of generative graph models and uncertainty models. Thus, despite extreme practical challenges in attaining accurate social network information, my techniques remain near-optimal across numerous forms of uncertainty in multiple synthetic and real-world graph structures. ❧ Beyond optimization of resource allocation, I have further studied contagion effects to understand the effectiveness of such resources. First, I created an evacuation simulation, ESCAPES, to explore the interaction of pedestrian fear contagion and authority fear mitigation during an evacuation. Second, using this simulator, I have advanced the frontier in contagion modeling by developing empirical evaluation methods for comparing and calibrating computational contagion models that are critical in crowd simulations and evacuation modeling. Finally, I have also conducted an examination of agent-human emotional contagion to inform the rising use of simulations for personnel training in emotionally-charged situations. Advisors/Committee Members: Tambe, Milind (Committee Chair), Marsella, Stacy C. (Committee Member), Yang, Sha (Committee Member), McCubbins, Mathew D. (Committee Member), Krishnamachari, Bhaskar (Committee Member), Bowring, Emma (Committee Member).

Subjects/Keywords: game theory; security; contagion; networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tsai, J. (2013). Protecting networks against diffusive attacks: game-theoretic resource allocation for contagion mitigation. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/283292/rec/5297

Chicago Manual of Style (16^th Edition):

Tsai, Jason. “Protecting networks against diffusive attacks: game-theoretic resource allocation for contagion mitigation.” 2013. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/283292/rec/5297.

MLA Handbook (7^th Edition):

Tsai, Jason. “Protecting networks against diffusive attacks: game-theoretic resource allocation for contagion mitigation.” 2013. Web. 22 Jan 2021.

Vancouver:

Tsai J. Protecting networks against diffusive attacks: game-theoretic resource allocation for contagion mitigation. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/283292/rec/5297.

Council of Science Editors:

Tsai J. Protecting networks against diffusive attacks: game-theoretic resource allocation for contagion mitigation. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/283292/rec/5297

University of Southern California

30. Huang, Longbo. Deterministic mathematical optimization in stochastic network control.

Degree: PhD, Electrical Engineering, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900

► In this thesis, we extend the recently developed Lyapunov optimization technique (also known as Max-Weight or Backpressure) for stochastic queueing networks in two important directions:… (more)

▼ In this thesis, we extend the recently developed Lyapunov optimization technique (also known as Max-Weight or Backpressure) for stochastic queueing networks in two important directions: (1) guaranteeing small network delay; and (2) resolving underflows. ❧ To achieve our objective, we first establish an explicit connection between the Lyapunov technique and a randomized dual subgradient method. Based on this connection, we develop a novel exponential attraction result, which states that the network queue backlog under a Lyapunov algorithm deviates from a certain fixed point with a probability that decreases exponentially in the deviation distance. Inspired by the exponential attraction result, we develop three delay-efficient algorithms and show that they achieve near-optimal utility-delay tradeoffs for a general class of multi-hop communication networks. One of the algorithms has also been implemented on a sensor network testbed and was shown to be able to guarantee very small network delay in practical systems. ❧ We later consider the problem of resolving underflows in general complex network scheduling problems. In this case, we propose the weight perturbation technique and develop the Perturbed Max-Weight algorithm (PMW). We show that PMW effectively resolves underflow constraints without sacrificing utility performance. We then apply the perturbation technique to construct utility optimal scheduling algorithms for two important classes of networks – stochastic processing networks and energy harvesting networks. ❧ The results developed in this thesis highlight the importance of Lagrange multiplier engineering in queueing networks. Specifically, our results show that the queues under the Lyapunov technique indeed correspond to the Lagrange multiplier values under the randomized dual subgradient method. This not only helps us better understand the Lyapunov technique, but also gives us general guidelines on how should one design its algorithm to achieve the desire properties of the queues. Advisors/Committee Members: Neely, Michael J. (Committee Chair), Caire, Giuseppe (Committee Member), Jain, Rahul (Committee Member), Kempe, David (Committee Member), Krishnamachari, Bhaskar (Committee Member), Wierman, Adam (Committee Member).

Subjects/Keywords: stochastic network control; network delay; queueing; Lyapunov analysis; processing networks; energy harvesting networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Huang, L. (2011). Deterministic mathematical optimization in stochastic network control. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900

Chicago Manual of Style (16^th Edition):

Huang, Longbo. “Deterministic mathematical optimization in stochastic network control.” 2011. Doctoral Dissertation, University of Southern California. Accessed January 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900.

MLA Handbook (7^th Edition):

Huang, Longbo. “Deterministic mathematical optimization in stochastic network control.” 2011. Web. 22 Jan 2021.

Vancouver:

Huang L. Deterministic mathematical optimization in stochastic network control. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Jan 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900.

Council of Science Editors:

Huang L. Deterministic mathematical optimization in stochastic network control. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900

Open Access Theses and Dissertations