You searched for +publisher:"Georgia Tech" +contributor:("Ji, Chuanyi"). Showing records 1 – 30 of 39 total matches.
1. Lin, Jian. Design and analysis of MAC protocols for wireless multi-hop sensor and terahertz networks.
▼ The contributions of this thesis include designing and analyzing novel medium access control (MAC) protocols for two types of wireless networks: (1) duty-cycling cooperative multi-hop wireless sensor networks (MHWSNs), and (2) single-hop Terahertz networks (TeraNets). For MHWSNs, the specific contributions are two new scalable MAC protocols for alleviating the "energy-hole" problem with cooperative transmission (CT). The energy-hole is known to limit the life of battery-powered MHWSNs. The hole occurs when nodes near the Sink exhaust their energy first because their load is heavier: they must transmit packets they originate and relay packets from and to other nodes farther from the Sink. Effective techniques for extending lifetime in MHWSNs include duty cycling (DC) and, more recently introduced, cooperative transmission (CT) range extension. However, a scalable MAC protocol has not been presented that combines both. From the MAC perspective, conducting CT in an asynchronous duty-cycling network is extremely challenging. On the one hand, the source, the cooperators and the destination need to reach consensus about a wake-up period, during which CT can be performed. This dissertation develops novel MAC protocols that solve the challenge and enable CT in an asynchronous duty-cycling network. On the other hand, the question arises, "Does the energy cost of the MAC cancel out the lifetime benefits of CT range extension?" We show that CT still gives as much as 200% increase in lifetime, in spite of the MAC overhead. The second contribution of this dissertation is a comprehensive analytical framework for MHWSNs. The network performance of a MHWSN is a complex function of the traffic volume, routing protocol, MAC technique, and sensors' harvested energy if sensors are energy-harvesting (EH) enabled. The optimum performance provides a benchmark for heuristic routing and MAC protocols. However, there does not exist such an optimization framework that is able to capture all of these protocol aspects. The problems and performance metrics of non-EH networks and EH networks are different. Because the non-EH nodes depend on a battery, a suitable performance metric is the lifetime, defined as the number of packets delivered upon the first or a portion of nodes' death. Thus, the lifetime is governed by the absorbing states in a controlled dynamic system with finite decision horizon. On the other hand, the lifetime of an EH network is theoretically infinite unless the sensors are broken or destroyed. Therefore, an infinite horizon problem is formulated towards the performance of EH networks. The proposed model departs significantly from past analyses for single-hop networks that do not capture routing and past analyses for multi-hop networks that miss MAC aspects. To our knowledge, this is the first work to model the optimal performance of MHWSNs, by jointly considering MAC layer link admission, routing queuing, energy evolution, and cooperative transmission. The third contribution of this dissertation is a novel MAC protocol for… Advisors/Committee Members: Weitnauer, Mary Ann (advisor), Ji, Chuanyi (committee member), Akyildiz, Ian (committee member), Durgin, Gregory (committee member), Zegura, Ellen (committee member).
Lin, Jian. "Design and analysis of MAC protocols for wireless multi-hop sensor and terahertz networks." 2015. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/54866.
Lin, Jian. "Design and analysis of MAC protocols for wireless multi-hop sensor and terahertz networks." 2015. Web. 24 Apr 2019.
Lin J. Design and analysis of MAC protocols for wireless multi-hop sensor and terahertz networks. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/54866.
2. Fairbanks, Kevin D. Forensic framework for honeypot analysis.
▼ The objective of this research is to evaluate and develop new forensic techniques for use in honeynet environments, in an effort to address areas where anti-forensic techniques defeat current forensic methods. The fields of Computer and Network Security have expanded with time to become inclusive of many complex ideas and algorithms. With ease, a student of these fields can fall into the thought pattern of preventive measures as the only major thrust of the topics. It is equally important to be able to determine the cause of a security breach. Thus, the field of Computer Forensics has grown. In this field, there exist toolkits and methods that are used to forensically analyze production and honeypot systems. To counter the toolkits, anti-forensic techniques have been developed. Honeypots and production systems have several intrinsic differences. These differences can be exploited to produce honeypot data sources that are not currently available from production systems. This research seeks to examine possible honeypot data sources and cultivate novel methods to combat anti-forensic techniques. In this document, three parts of a forensic framework are presented which were developed specifically for honeypot and honeynet environments. The first, TimeKeeper, is an inode preservation methodology which utilizes the Ext3 journal. This is followed with an examination of dentry logging which is primarily used to map inode numbers to filenames in Ext3. The final component presented is the initial research behind a toolkit for the examination of the recently deployed Ext4 file system. Each respective chapter includes the necessary background information and an examination of related work as well as the architecture, design, conceptual prototyping, and results from testing each major framework component. Advisors/Committee Members: Owen, Henry (Committee Chair), Beyah, Raheem (Committee Member), Copeland, John (Committee Member), Giffin, Jonathon (Committee Member), Ji, Chuanyi (Committee Member).
Fairbanks, Kevin D. "Forensic framework for honeypot analysis." 2010. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/33977.
Fairbanks, Kevin D. "Forensic framework for honeypot analysis." 2010. Web. 24 Apr 2019.
Fairbanks KD. Forensic framework for honeypot analysis. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/33977.
3. Zhuang, Zhenyun. Application acceleration for wireless and mobile data networks.
▼ This work studies application acceleration for wireless and mobile data networks. The problem of accelerating application can be addressed along multiple dimensions. The first dimension is advanced network protocol design, i.e., optimizing underlying network protocols, particulary transport layer protocol and link layer protocol. Despite advanced network protocol design, in this work we observe that certain application behaviors can fundamentally limit the performance achievable when operating over wireless and mobile data networks. The performance difference is caused by the complex application behaviors of these non-FTP applications. Explicitly dealing with application behaviors can improve application performance for new environments. Along this overcoming application behavior dimension, we accelerate applications by studying specific types of applications including Client-server, Peer-to-peer and Location-based applications. In exploring along this dimension, we identify a set of application behaviors that significantly affect application performance. To accommodate these application behaviors, we firstly extract general design principles that can apply to any applications whenever possible. These design principles can also be integrated into new application designs. We also consider specific applications by applying these design principles and build prototypes to demonstrate the effectiveness of the solutions. In the context of application acceleration, even though all the challenges belong to the two aforementioned dimensions of advanced network protocol design and overcoming application behavior are addressed, application performance can still be limited by the underlying network capability, particularly physical bandwidth. In this work, we study the possibility of speeding up data delivery by eliminating traffic redundancy present in application traffics. Specifically, we first study the traffic redundancy along multiple dimensions using traces obtained from multiple real wireless network deployments. Based on the insights obtained from the analysis, we propose Wireless Memory (WM), a two-ended AP-client solution to effectively exploit traffic redundancy in wireless and mobile environments. Application acceleration can be achieved along two other dimensions: network provision ing and quality of service (QoS). Network provisioning allocates network resources such as physical bandwidth or wireless spectrum, while QoS provides different priority to different applications, users, or data flows. These two dimensions have their respective limitations in the context of application acceleration. In this work, we focus on the two dimensions of overcoming application behavior and Eliminating traffic redundancy to improve application performance. The contribution of this work is as follows. First, we study the problem of application acceleration for wireless and mobile data networks, and we characterize the dimensions along which to address the problem. Second, we identify that application behaviors can significantly… Advisors/Committee Members: Sivakumar, Raghupathy (Committee Chair), Ammar, Mostafa (Committee Member), Fekri, Faramarz (Committee Member), Ji, Chuanyi (Committee Member), Ramachandran, Umakishore (Committee Member).
Zhuang, Zhenyun. "Application acceleration for wireless and mobile data networks." 2010. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/37164.
Zhuang, Zhenyun. "Application acceleration for wireless and mobile data networks." 2010. Web. 24 Apr 2019.
Zhuang Z. Application acceleration for wireless and mobile data networks. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/37164.
4. Erjongmanee, Supaporn. Study of network-service disruptions using heterogeneous data and statistical learning.
▼ The study of network-service disruptions caused by large-scale disturbances has mainly focused on assessing network damage; however, network-disruption responses, i.e., how the disruptions occur depending on social organizations, weather, and power resources, have been studied little. The goal of this research is to study the responses of network-service disruptions caused by large-scale disturbances with respect to (1) temporal and logical network, and (2) external factors such as weather and power resources, using real and publicly available heterogeneous data that are composed of network measurements, user inputs, organizations, geographic locations, weather, and power outage reports. Network-service disruptions at the subnet level caused by Hurricanes Katrina in 2005 and Ike in 2008 are used as the case studies. The analysis of network-disruption responses with respect to temporal and logical network shows that subnets became unreachable dependently within organization, cross organization, and cross autonomous system. Thus, temporal dependence also illustrates the characteristics of logical dependence. In addition, subnet unreachability is analyzed with respect to the external factors. It is found that subnet unreachability and the storm are weakly correlated. The weak correlation motivates us to search for root causes and discover that the majority of subnet unreachability reportedly occurred because of power outages or lack of power generators. Using the power outage data, it is found that subnet unreachability and power outages are strongly correlated. Advisors/Committee Members: Ji, Chuanyi (Committee Chair), Clark, Russell (Committee Member), Copeland, John (Committee Member), Juang, Biing Hwang (Fred) (Committee Member), Riley, George (Committee Member).
Erjongmanee, Supaporn. "Study of network-service disruptions using heterogeneous data and statistical learning." 2011. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/43601.
Erjongmanee, Supaporn. "Study of network-service disruptions using heterogeneous data and statistical learning." 2011. Web. 24 Apr 2019.
Erjongmanee S. Study of network-service disruptions using heterogeneous data and statistical learning. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/43601.
5. Wei, Yun. Large-scale data analytics, modeling and resilience of energy infrastructure and service.
▼ Large scale power failures induced by severe weather have become frequent and damaging in recent years, causing millions of people to be without electricity service for days. Although the power industry has been battling weather-induced failures for years, it is unknown how resilient the energy infrastructure and services really are to severe weather disruptions. This thesis addresses the research issues up to date and challenges on resilience. The focus is on studying fundamental challenges and advanced approaches for quantifying resilience. In particular, a first aspect of this problem is how to model large-scale failures, recoveries and impacts, involving the infrastructure, service providers, customers, and weather. The thesis has developed spatiotemporal models failures and recoveries based on non-stationary random processes, where the models are derived from by including dynamic network topology. A second aspect is to identify and characterize generic vulnerability (i.e., non-resilience) in the infrastructure and services through large-scale data analytics. Using data obtained from power distribution grids across multiple service regions, the thesis has found that local power failures have a disproportionally large non-local impact on customers, where top 20% failures affected 80% customers during severe weather events and daily operations. In contrast, an aggregation of small disruptions and commonplace devices result in major cost in customer downtime, where bottom 89% failures that affected 34 customers amount to 56% of the total cost. Extreme weather does not cause but exacerbates the vulnerabilities in daily operations. Advisors/Committee Members: Ji, Chuanyi (advisor), Meliopoulos, Sakis (committee member), Juang, Biing Hwang (committee member), Divan, Deepakraj (committee member), Keskinocak, Pinar (committee member).
Wei, Yun. "Large-scale data analytics, modeling and resilience of energy infrastructure and service." 2017. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/59758.
Wei, Yun. "Large-scale data analytics, modeling and resilience of energy infrastructure and service." 2017. Web. 24 Apr 2019.
Wei Y. Large-scale data analytics, modeling and resilience of energy infrastructure and service. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/59758.
6. Estevez, Claudio Ignacio. Carrier ethernet network solutions: transport protocol and optical backplane design.
▼ The Metro Ethernet network (MEN) expands the advantages of Ethernet to cover areas wider than LAN. MENs running Ethernet Services as specified by the Metro Ethernet Forum (MEF) are known as Carrier Ethernet Networks (CENs). CENs can cover not only metro areas, but it can expand to cover global areas by connecting multiple MENs. Next-generation CENs are expected to support 100 GbE. With arising technologies for Ultra Long-haul (ULH) networks the bandwidth bottleneck of CENs is shifting to other areas like the transport layer protocol (such as the Transport Control Protocol or TCP) and the chip-to-chip channel capacity found at the network edge, which in general has an electrical backplane. Traditional TCP is well known to have difficulties reaching the full available bandwidth, due to its inefficient AIMD mechanisms under a high-delay-bandwidth-product environment. At the network edge, network equipment with electrical backplanes poses many problems including inductive-capacitive effects that limit its bandwidth. These are the two main issues addressed in this work. To resolve the transport layer issue, this work proposes a transport protocol that fully utilizes the available bandwidth while preserving TCP-friendliness and providing QoS support that is compatible with Ethernet Services. It can guarantee throughputs above the Committed Information Rate (CIR), which is specified in the Service Level Agreement (SLA). To resolve the physical layer limitations, a novel optical coupling technique is examined to encourage the use of optical backplanes for network-edge and core technology. The proposed technique consists of aligning the normal of the laser emission plane, waveguide plane and the normal of the photodetector active region plane with the purpose of reducing optical power loss caused by common methods of light manipulation. By addressing the shortcomings of both Traditional TCP and electrical backplane technology the overall throughput can be significantly increased. Advisors/Committee Members: Chang, Gee-Kung (Committee Chair), Ellinas, Georgios (Committee Co-Chair), Buck, John A. (Committee Member), Ji, Chuanyi (Committee Member), Owen, Henry (Committee Member), Pu, Calton (Committee Member).
Estevez, Claudio Ignacio. "Carrier ethernet network solutions: transport protocol and optical backplane design." 2010. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/33999.
Estevez, Claudio Ignacio. "Carrier ethernet network solutions: transport protocol and optical backplane design." 2010. Web. 24 Apr 2019.
Estevez CI. Carrier ethernet network solutions: transport protocol and optical backplane design. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/33999.
7. Dai, Rui. Correlation-based communication in wireless multimedia sensor networks.
▼ Wireless multimedia sensor networks (WMSNs) are networks of interconnected devices that allow retrieving video and audio streams, still images, and scalar data from the environment. In a densely deployed WMSN, there exists correlation among the observations of camera sensors with overlapped coverage areas, which introduces substantial data redundancy in the network. In this dissertation, efficient communication schemes are designed for WMSNs by leveraging the correlation of visual information observed by camera sensors. First, a spatial correlation model is developed to estimate the correlation of visual information and the joint entropy of multiple correlated camera sensors. The compression performance of correlated visual information is then studied. An entropy-based divergence measure is proposed to predict the compression efficiency of performing joint coding on the images from correlated cameras. Based on the predicted compression efficiency, a clustered coding technique is proposed that maximizes the overall compression gain of the visual information gathered in WMSNs. The correlation of visual information is then utilized to design a network scheduling scheme to maximize the lifetime of WMSNs. Furthermore, as many WMSN applications require QoS support, a correlation-aware QoS routing algorithm is introduced that can efficiently deliver visual information under QoS constraints. Evaluation results show that, by utilizing the correlation of visual information in the communication process, the energy efficiency and networking performance of WMSNs could be improved significantly. Advisors/Committee Members: Akyildiz, Ian (Committee Chair), Ammar, Mostafa (Committee Member), Ji, Chuanyi (Committee Member), Li, Ye (Committee Member), Romberg, Justin (Committee Member).
Dai, Rui. "Correlation-based communication in wireless multimedia sensor networks." 2011. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/42736.
Dai, Rui. "Correlation-based communication in wireless multimedia sensor networks." 2011. Web. 24 Apr 2019.
Dai R. Correlation-based communication in wireless multimedia sensor networks. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/42736.
8. Wang, Pu. Modeling, analysis, and optimization for wireless networks in the presence of heavy tails.
▼ The heavy-tailed traffic from wireless users, caused by the emerging Internet and multimedia applications, induces extremely dynamic and variable network environment, which can fundamentally change the way in which wireless networks are conceived, designed, and operated. This thesis is concerned with modeling, analysis, and optimization of wireless networks in the presence of heavy tails. First, a novel traffic model is proposed, which captures the inherent relationship between the traffic dynamics and the joint effects of the mobility variability of network users and the spatial correlation in their observed physical phenomenon. Next, the asymptotic delay distribution of wireless users is analyzed under different traffic patterns and spectrum conditions, which reveals the critical conditions under which wireless users can experience heavy-tailed delay with significantly degraded QoS performance. Based on the delay analysis, the fundamental impact of heavy-tailed environment on network stability is studied. Specifically, a new network stability criterion, namely moment stability, is introduced to better characterize the QoS performance in the heavy-tailed environment. Accordingly, a throughput-optimal scheduling algorithm is proposed to maximize network throughput while guaranteeing moment stability. Furthermore, the impact of heavy-tailed spectrum on network connectivity is investigated. Towards this, the necessary conditions on the existence of delay-bounded connectivity are derived. To enhance network connectivity, the mobility-assisted data forwarding scheme is exploited, whose important design parameters, such as critical mobility radius, are derived. Moreover, the latency in wireless mobile networks is analyzed, which exhibits asymptotic linearity in the initial distance between mobile users. Advisors/Committee Members: Akyildiz, Ian F. (advisor), Ji, Chuanyi (committee member), Li, Ye (committee member), Sivakumar, Raghupathy (committee member), Dovrolis, Constantine (committee member).
Wang, Pu. "Modeling, analysis, and optimization for wireless networks in the presence of heavy tails." 2013. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/50232.
Wang, Pu. "Modeling, analysis, and optimization for wireless networks in the presence of heavy tails." 2013. Web. 24 Apr 2019.
Wang P. Modeling, analysis, and optimization for wireless networks in the presence of heavy tails. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/50232.
9. Gu, Guofei. Correlation-based Botnet Detection in Enterprise Networks.
▼ Most of the attacks and fraudulent activities on the Internet are carried out by malware. In particular, botnets, as state-of-the-art malware, are now considered as the largest threat to Internet security. In this thesis, we focus on addressing the botnet detection problem in an enterprise-like network environment. We present a comprehensive correlation-based framework for multi-perspective botnet detection consisting of detection technologies demonstrated in four complementary systems: BotHunter, BotSniffer, BotMiner, and BotProbe. The common thread of these systems is correlation analysis, i.e., vertical correlation (dialog correlation), horizontal correlation, and cause-effect correlation. All these Bot* systems have been evaluated in live networks and/or real-world network traces. The evaluation results show that they can accurately detect real-world botnets for their desired detection purposes with a very low false positive rate. We find that correlation analysis techniques are of particular value for detecting advanced malware such as botnets. Dialog correlation can be effective as long as malware infections need multiple stages. Horizontal correlation can be effective as long as malware tends to be distributed and coordinated. In addition, active techniques can greatly complement passive approaches, if carefully used. We believe our experience and lessons are of great benefit to future malware detection. Advisors/Committee Members: Lee,Wenke (Committee Chair), Ahamad,Mustaque (Committee Member), Feamster,Nick (Committee Member), Giffin,Jonathon (Committee Member), Ji,Chuanyi (Committee Member).
Gu, Guofei. "Correlation-based Botnet Detection in Enterprise Networks." 2008. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/24634.
Gu, Guofei. "Correlation-based Botnet Detection in Enterprise Networks." 2008. Web. 24 Apr 2019.
Gu G. Correlation-based Botnet Detection in Enterprise Networks. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/24634.
10. Xu, Hongteng. Point process-based modeling and analysis of asynchronous event sequences.
▼ Real-world interactions among multiple entities, such as user behaviors in social networks, job hunting and hopping, and diseases and their complications, often exhibit self-triggering and mutually-triggering patterns. For example, a tweet of a twitter user may trigger further responses from her friends. A disease of a patient may trigger other complications. Temporal point processes, especially Hawkes processes and correcting processes, have a capability to capture the triggering patterns quantitatively. This dissertation introduces basic concepts of point processes and proposes a series of cutting-edge modeling and learning techniques for practical applications. In particular, the Granger causality analysis of Hawkes processes, the clustering problem of event sequences, the combination of deep learning and point processes, the robust predictive learning of point processes from imperfect observations, and some interesting applications of data mining and computer vision are discussed. Advisors/Committee Members: Zha, Hongyuan (advisor), Davenport, Mark A. (advisor), Song, Le (committee member), Romberg, Justin K. (committee member), Ji, Chuanyi (committee member), Dilkina, Bistra (committee member).
Xu, Hongteng. "Point process-based modeling and analysis of asynchronous event sequences." 2017. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/58690.
Xu, Hongteng. "Point process-based modeling and analysis of asynchronous event sequences." 2017. Web. 24 Apr 2019.
Xu H. Point process-based modeling and analysis of asynchronous event sequences. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/58690.
11. Lin, Shih-Chun. Softair: Software-defined networking and network function virtualization solutions for 5g cellular systems.
▼ One of the main building blocks and major challenges for 5G cellular systems is the design of flexible network architectures, which can be realized by the paradigm of software-defined networking (SDN) and network function virtualization (NFV). Existing commercial cellular systems rely on closed and inflexible hardware-based architectures both at the radio frontend and in the core network. These problems significantly delay the adoption and deployment of new standards, impose great challenges in implementing new techniques to maximize the network capacity and coverage, and prevent provisioning of truly-differentiated services for highly variable traffic patterns. The objective of this thesis is to introduce an innovative software-defined architecture for 5G cellular systems, called SoftAir. First, a detailed overview is provided for priori wireless SDN architecture solutions. Second, the SoftAir architecture is introduced with key design elements. Third, four essential management tools for SoftAir are developed. Last, novel software-defined traffic engineering, enabled by SoftAir, are proposed. Through the synergy of SDN and NFV, SoftAir enables the next-generation cellular networks with the needed flexibility for evolving and adapting to the ever-changing network context, and lays out the foundation for 5G wireless software-defined cellular systems. Advisors/Committee Members: Akyildiz, Ian F. (advisor), Ji, Chuanyi (committee member), Li, Geoffrey Ye (committee member), Sivakumar, Raghupathy (committee member), Wang, Pu (committee member).
Lin, Shih-Chun. "Softair: Software-defined networking and network function virtualization solutions for 5g cellular systems." 2017. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/58347.
Lin, Shih-Chun. "Softair: Software-defined networking and network function virtualization solutions for 5g cellular systems." 2017. Web. 24 Apr 2019.
Lin S. Softair: Software-defined networking and network function virtualization solutions for 5g cellular systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/58347.
12. Balakrishnan, Ravikumar. Handover management in heterogeneous networks for 4G and beyond cellular systems.
▼ New technologies are expected to play a major role for wireless cellular systems beyond the existing 4G paradigm. The need for several orders of magnitude increase in system capacity has led to the proliferation of low-powered cellular layers overlaid on the existing macrocell layer. This type of network consisting of different cellular layers, each with their unique characteristics including transmission power and frequency of operation among others is termed as a heterogeneous network (HetNet). The emergence of HetNets leads to several research challenges and calls for a profound rethinking of several existing approaches for mobility management and interference management among other issues. Advisors/Committee Members: Akyildiz, Ian F. (advisor), Li, Geoffrey Y. (committee member), Ji, Chuanyi (committee member), Bloch, Matthieu (committee member), Clark, Russell (committee member).
Balakrishnan, Ravikumar. "Handover management in heterogeneous networks for 4G and beyond cellular systems." 2015. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/53634.
Balakrishnan, Ravikumar. "Handover management in heterogeneous networks for 4G and beyond cellular systems." 2015. Web. 24 Apr 2019.
Balakrishnan R. Handover management in heterogeneous networks for 4G and beyond cellular systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/53634.
13. Edwards, Derek L. Designing optimal demand-responsive transportation feeder systems and comparing performance in heterogeneous environments.
▼ The goal of this research is to develop a method of objectively comparing and optimizing the performance of demand-responsive transportation systems in heterogeneous environments. Demand-responsive transportation refers to modes of transportation that do not follow fixed routes or schedules, including taxis, paratransit, deviated-route services, ride sharing as well as other modes. Heterogeneous environments are transportation environments in which streets do not follow regular patterns, passenger behavior is difficult to model, and transit schedules and layouts are non-uniform. An example of a typical heterogeneous environment is a modern suburb with non-linear streets, low pedestrian activity, and infrequent or sparse transit service. The motivation for this research is to determine if demand-responsive transportation can be used to improve customer satisfaction and reduce operating costs in suburban and low-density urban areas where fixed-route transportation may be inefficient. This research extends existing comparison and optimization techniques that are designed to work in homogeneous environments. Homogeneous environments refer to transportation systems where the streets follow regular and repeating patterns, passengers are evenly distributed throughout the system, and the transit system is easily modeled. The performance of systems with these characteristics can be approximated with closed-form analytical expressions representing passenger travel times, vehicle distances traveled, and other performance indicators. However, in the low-density urban areas studied in this research, the street patterns and transit schedules are irregular and passenger behavior is difficult to model. In these areas, analytical solutions cannot be found. Instead, this research develops a simulation-based approach to compare and optimize performance in these heterogeneous environments. Using widely-available route-planning tools, open-source transit schedules, and detailed passenger data, it is possible to simulate the behavior of transit vehicles and passengers to such an exacting degree that analytical solutions are not needed. A major technical contribution of this research is the development of a demand-responsive transportation simulator to analyze performance of demand-responsive systems in heterogeneous environments. The simulator combines several open-source tools for route planning with a custom-built demand-responsive vehicle and passenger-itinerary optimizer to simulate individual vehicles and passengers within a large system. With knowledge of the street network, the transit schedule, passenger locations, and trip request times, the simulator will output exact passenger transit times, passenger travel distances, vehicle travel distance, and other performance indicators for a particular transportation setup in a given area. The simulator is used to develop a method of comparing various demand-responsive and fixed-route systems. By predefining a set of performance indicators, such as passenger travel time… Advisors/Committee Members: Dickerson, Steve (advisor), Vachtsevanos, George (advisor), Watkins, Kari (committee member), Michaels, Jennifer (committee member), Taylor, David (committee member), Ji, Chuanyi (committee member).
Edwards, Derek L. "Designing optimal demand-responsive transportation feeder systems and comparing performance in heterogeneous environments." 2014. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/52230.
Edwards, Derek L. "Designing optimal demand-responsive transportation feeder systems and comparing performance in heterogeneous environments." 2014. Web. 24 Apr 2019.
Edwards DL. Designing optimal demand-responsive transportation feeder systems and comparing performance in heterogeneous environments. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/52230.
14. Kim, Jonghoek. Simultaneous cooperative exploration and networking.
▼ This thesis provides strategies for multiple vehicles to explore unknown environments in a cooperative and systematic manner. These strategies are called Simultaneous Cooperative Exploration and Networking (SCENT) strategies. As the basis for development of SCENT strategies, we first tackle the motion control and planning for one vehicle with range sensors. In particular, we develop the curve-tracking controllers for autonomous vehicles with rigidly mounted range sensors, and a provably complete exploration strategy is proposed so that one vehicle with range sensors builds a topological map of an environment. The SCENT algorithms introduced in this thesis extend the exploration strategy for one vehicle to multiple vehicles. The enabling idea of the SCENT algorithms is to construct a topological map of the environment, which is considered completely explored if the map corresponds to a complete Voronoi diagram of the environment. To achieve this, each vehicle explores its local area by incrementally expanding the already visited areas of the environment. At the same time, every vehicle deploys communication devices at selected locations and, as a result, a communication network is created concurrently with a topological map. This additional network allows the vehicles to share information in a distributed manner resulting in an efficient exploration of the workspace. The efficiency of the proposed SCENT algorithms is verified through theoretical investigations as well as experiments using mobile robots. Moreover, the resulting networks and the topological maps are used to solve coordinated multi-robot tasks, such as capturing intruders. Advisors/Committee Members: Zhang, Fumin (Committee Chair), Egerstedt, Magnus (Committee Co-Chair), Ji, Chuanyi (Committee Member), Reveliotis, Spyros (Committee Member), Vela, Patricio (Committee Member), Wardi, Yorai (Committee Member).
Kim, Jonghoek. "Simultaneous cooperative exploration and networking." 2011. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/39536.
Kim, Jonghoek. "Simultaneous cooperative exploration and networking." 2011. Web. 24 Apr 2019.
Kim J. Simultaneous cooperative exploration and networking. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/39536.
15. Mohan, Apurva. Design and implementation of an attribute-based authorization management system.
▼ The proposed research is in the area of attribute-based authorization systems. We address two specific research problems in this area. First, evaluating authorization policies in multi-authority systems where there are multiple stakeholders in the disclosure of sensitive data. The research proposes to consider all the relevant policies related to authorization in real time upon the receipt of an access request and to resolve any differences that these individual policies may have in authorization. Second, to enable a lot of entities to participate in the authorization process by asserting attributes on behalf of the principal accessing resources. Since it is required that these asserted attributes be trusted by the authorization system, it is necessary that these entities are themselves trusted by the authorization system. Two frameworks are proposed to address these issues. In the first contribution a dynamic authorization system is proposed which provides conflict detection and resolution among applicable policies in a multi-authority system. The authorization system is dynamic in nature and considers the context of an access request to adapt its policy selection, execution and conflict handling based on the access environment. Efficient indexing techniques are used to increase the speed of authorization policy loading and evaluation. In the second contribution, we propose a framework for service providers to evaluate trust in entities asserting on behalf of service users in real time upon receipt of an access request. This trust evaluation is done based on a reputation system model, which is designed to protect itself against known attacks on reputation systems. Advisors/Committee Members: Blough, Douglas (Committee Chair), Ahamad, Mustaque (Committee Member), Ji, Chuanyi (Committee Member), Liu, Ling (Committee Member), Riley, George (Committee Member), Russler, Daniel (Committee Member).
Mohan, Apurva. "Design and implementation of an attribute-based authorization management system." 2011. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/39585.
Mohan, Apurva. "Design and implementation of an attribute-based authorization management system." 2011. Web. 24 Apr 2019.
Mohan A. Design and implementation of an attribute-based authorization management system. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/39585.
16. Wang, Yan. Asymptotic theory for decentralized sequential hypothesis testing problems and sequential minimum energy design algorithm.
▼ The dissertation investigates asymptotic theory of decentralized sequential hypothesis testing problems as well as asymptotic behaviors of the Sequential Minimum Energy Design (SMED). The main results are summarized as follows. 1.We develop the first-order asymptotic optimality theory for decentralized sequential multi-hypothesis testing under a Bayes framework. Asymptotically optimal tests are obtained from the class of "two-stage" procedures and the optimal local quantizers are shown to be the "maximin" quantizers that are characterized as a randomization of at most M-1 Unambiguous Likelihood Quantizers (ULQ) when testing M >= 2 hypotheses. 2. We generalize the classical Kullback-Leibler inequality to investigate the quantization effects on the second-order and other general-order moments of log-likelihood ratios. It is shown that a quantization may increase these quantities, but such an increase is bounded by a universal constant that depends on the order of the moment. This result provides a simpler sufficient condition for asymptotic theory of decentralized sequential detection. 3. We propose a class of multi-stage tests for decentralized sequential multi-hypothesis testing problems, and show that with suitably chosen thresholds at different stages, it can hold the second-order asymptotic optimality properties when the hypotheses testing problem is "asymmetric." 4. We characterize the asymptotic behaviors of SMED algorithm, particularly the denseness and distributions of the design points. In addition, we propose a simplified version of SMED that is computationally more efficient. Advisors/Committee Members: Mei, Yajun (Committee Chair), Ji, Chuanyi (Committee Member), Shapiro, Alexander (Committee Member), Vengazhiyil, Roshan (Committee Member), Wu, C. F. Jeff (Committee Member).
Wang, Yan. "Asymptotic theory for decentralized sequential hypothesis testing problems and sequential minimum energy design algorithm." 2011. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/41082.
Wang, Yan. "Asymptotic theory for decentralized sequential hypothesis testing problems and sequential minimum energy design algorithm." 2011. Web. 24 Apr 2019.
Wang Y. Asymptotic theory for decentralized sequential hypothesis testing problems and sequential minimum energy design algorithm. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/41082.
17. Howard, Dustin F. Short-circuit currents in wind-turbine generator networks.
▼ Protection of both the wind plant and the interconnecting transmission system during short-circuit faults is imperative for maintaining system structural integrity and reliability. The circuit breakers and protective relays used to protect the power system during such events are designed based upon calculations of the current that will flow in the circuit during the fault. Sequence-network models of various power-system components, such as synchronous generators, transformers, transmission lines, etc., are often used to perform these calculations. However, there are no such models widely accepted for certain types of wind-turbine generators used in modern wind plants. The problem with developing sequence-network models of wind plants is that several different wind-turbine generator designs exist; yet, each exhibit very different short-circuit behavior. Therefore, a "one size fits all" approach is not appropriate for modeling wind plants, as has been the case for conventional power plants based on synchronous-generator technology. Further, many of the newer wind-turbine designs contain proprietary controls that affect the short-circuit behavior, and wind-turbine manufacturers are often not willing to disclose these controls. Thus, protection engineers do not have a standard or other well-established model for calculating short-circuit currents in power systems with wind plants. Therefore, the research described in this dissertation involves the development of such models for calculating short-circuit currents from wind-turbine generators. The focus of this dissertation is on the four existing wind-turbine generator designs (identified as Types 1 – 4). Only AC-transmission-interconnected wind-turbine generators are considered in this dissertation. The primary objective of this research is the development of sequence-network models, which are frequency-domain analysis tools, for each wind-turbine generator design. The time-domain behavior of each wind-turbine generator is thoroughly analyzed through transient simulations, experimental tests on scaled wind-turbine generator test beds, and solutions to the system dynamic equations. These time-domain analyses are used to support the development of the sequence-network models. Advisors/Committee Members: Harley, Ronald G. (advisor), Habetler, Thomas G. (committee member), Begovic, Miroslav (committee member), Ji, Chuanyi (committee member), Chow, Shui-Nee (committee member).
Howard, Dustin F. "Short-circuit currents in wind-turbine generator networks." 2013. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/50361.
Howard, Dustin F. "Short-circuit currents in wind-turbine generator networks." 2013. Web. 24 Apr 2019.
Howard DF. Short-circuit currents in wind-turbine generator networks. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/50361.
18. Velayutham, Aravind Murugesan. Transport Protocols for Next Generation Wireless Data Networks.
▼ Emerging wireless networks are characterized by increased heterogeneity in wireless access technologies as well as increased peer-to-peer communication among wireless hosts. The heterogeneity among wireless access interfaces mainly exists because of the fact that different wireless technologies deliver different performance trade-offs. Further, more and more infrastructure-less wireless networks such as ad-hoc networks are emerging to address several application scenarios including military and disaster recovery. These infrastructure-less wireless networks are characterized by the peer-to-peer communication model. In this thesis, we propose transport protocols that tackle the challenges that arise due to the above-mentioned properties of state-of-the-art wireless data networks. The main contributions of this work are as follows: 1. We determine the ideal nature and granularity of transport adaptation for efficient operation in heterogeneous wireless data networks by performing comprehensive experimental analysis. We then design and implement a runtime adaptive transport framework, *TP, which accommodates the capabilities of the ideal transport adaptation solution. 2. We prove that conversational transport protocols are not efficient under peer-to-peer wireless data networks. We then design and implement NCTP which is a non-conversational transport protocol. Advisors/Committee Members: Sivakumar, Raghupathy (Committee Chair), Ji, Chuanyi (Committee Member), Owen, Henry (Committee Member).
Velayutham, Aravind Murugesan. "Transport Protocols for Next Generation Wireless Data Networks." 2005. Masters Thesis, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/6957.
Velayutham, Aravind Murugesan. "Transport Protocols for Next Generation Wireless Data Networks." 2005. Web. 24 Apr 2019.
Velayutham AM. Transport Protocols for Next Generation Wireless Data Networks. [Internet] [Masters thesis]. Georgia Tech; 2005. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/6957.
19. Zhu, Yong. Routing, Resource Allocation and Network Design for Overlay Networks.
▼ Overlay networks have been the subject of significant research and practical interest recently in addressing the inefficiency and ossification of the current Internet. In this thesis, we cover various aspects of overlay network design, including overlay routing algorithms, overlay network assignment and multihomed overlay networks. We also examine the behavior of overlay networks under a wide range of network settings and identify several key factors that affect the performance of overlay networks. Based on these findings, practical design guidelines are also given. Specifically, this thesis addresses the following problems: 1) Dynamic overlay routing: We perform an extensive simulation study to investigate the performance of available bandwidth-based dynamic overlay routing from three important aspects: efficiency, stability, and safety margin. Based on the findings, we propose a hybrid routing scheme that achieves good performance in all three aspects. We also examine the effects of several factors on overlay routing performance, including network load, traffic variability, link-state staleness, number of overlay hops, measurement errors, and native sharing effects. 2) Virtual network assignment: We investigate the virtual network (VN) assignment problem in the scenario of network virtualization. Specifically, we develop a basic VN assignment scheme without reconfiguration and use it as the building block for all other advanced algorithms. Subdividing heuristics and adaptive optimization strategies are presented to further improve the performance. We also develop a selective VN reconfiguration scheme that prioritizes the reconfiguration for the most critical VNs. 3) Overlay network configuration tool for PlanetLab: We develop NetFinder, an automatic overlay network configuration tool to efficiently allocate PlanetLab resources to individual overlays. NetFinder continuously monitors the resource utilization of PlanetLab and accepts a user-defined overlay topology as input and selects the set of PlanetLab nodes and their interconnection for the user overlay. 4) Multihomed overlay network: We examine the effectiveness of combining multihoming and overlay routing from the perspective of an overlay service provider (OSP). We focus on the corresponding design problem and examine, with realistic network performance and pricing data, whether the OSP can provide a network service that is profitable, better (in terms of round-trip time), and less expensive than the competing native ISPs. Advisors/Committee Members: Ammar, Mostafa (Committee Chair), Dovrolis, Constantine (Committee Member), Ji, Chuanyi (Committee Member), Xu, Jun (Committee Member), Zegura, Ellen (Committee Member).
Zhu, Yong. "Routing, Resource Allocation and Network Design for Overlay Networks." 2006. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/14017.
Zhu, Yong. "Routing, Resource Allocation and Network Design for Overlay Networks." 2006. Web. 24 Apr 2019.
Zhu Y. Routing, Resource Allocation and Network Design for Overlay Networks. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/14017.
20. Huang, Yi-an. Intrusion Detection and Response Systems for Mobile Ad Hoc Networks.
▼ A mobile ad hoc network (MANET) consists of a group of autonomous mobile nodes with no infrastructure support. In this research, we develop a distributed intrusion detection and response system for MANET, and we believe it presents a second line of defense that cannot be replaced by prevention schemes. We based our detection framework on the study of attack taxonomy. We then propose a set of detection methods suitable of detecting different attack categories. Our approaches are based on protocol specification analysis with categorical and statistical measures. Node-based approaches may be too restrictive in scenarios where attack patterns cannot be observed by any isolated node. Therefore, we have developed cooperative detection approaches for a more effective detection model. One approach is to form IDS clusters by grouping nearby nodes, and information can be exchanged within clusters. The cluster-based scheme is more efficient in terms of power consumption and resource utilization, it is also proved resilient against common security compromises without changing the decentralized assumption. We further address two response techniques, traceback and filtering. Existing traceback systems are not suitable for MANET because they rely on incompatible assumptions such as trustworthy routers and static route topology. Our solution, instead, adapts to dynamic topology with no infrastructure requirement. Our solution is also resilient in the face of arbitrary number of collaborative adversaries. We also develop smart filtering schemes to maximize the dropping rate of attack packets while minimizing the dropping rate of normal packets with real-time guarantee. To validate our research, we present case study using both ns-2 simulation and MobiEmu emulation platform with three ad hoc routing protocols: AODV, DSR and OLSR. We implemented various representative attacks based on the attack taxonomy. Our experiments show very promising results using node-based and cluster-based approaches. Advisors/Committee Members: Lee, Wenke (Committee Chair), Ahamad, Mustaque (Committee Member), Giffin, Jonathon (Committee Member), Ji, Chuanyi (Committee Member), Ramachandran, Umakishore (Committee Member).
Huang, Yi-an. "Intrusion Detection and Response Systems for Mobile Ad Hoc Networks." 2006. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/14053.
Huang, Yi-an. "Intrusion Detection and Response Systems for Mobile Ad Hoc Networks." 2006. Web. 24 Apr 2019.
Huang Y. Intrusion Detection and Response Systems for Mobile Ad Hoc Networks. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/14053.
21. Jeon, Sung-eok. Near-Optimality of Distributed Network Management with a Machine Learning Approach.
▼ An analytical framework is developed for distributed management of large networks where each node makes locally its decisions. Two issues remain open. One is whether a distributed algorithm would result in a near-optimal management. The other is the complexity, i.e., whether a distributed algorithm would scale gracefully with a network size. We study these issues through modeling, approximation, and randomized distributed algorithms. For near-optimality issue, we first derive a global probabilistic model of network management variables which characterizes the complex spatial dependence of the variables. The spatial dependence results from externally imposed management constraints and internal properties of communication environments. We then apply probabilistic graphical models in machine learning to show when and whether the global model can be approximated by a local model. This study results in a sufficient condition for distributed management to be nearly optimal. We then show how to obtain a near-optimal configuration through decentralized adaptation of local configurations. We next derive a near-optimal distributed inference algorithm based on the derived local model. We characterize the trade-off between near-optimality and complexity of distributed and statistical management. We validate our formulation and theory through simulations. Advisors/Committee Members: Ji, Chuanyi (Committee Chair), Ammar, Mostafa (Committee Member), Barry, John (Committee Member), McLaughlin, Steven (Committee Member), Sivakumar, Raghupathy (Committee Member).
Jeon, Sung-eok. "Near-Optimality of Distributed Network Management with a Machine Learning Approach." 2007. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/16136.
Jeon, Sung-eok. "Near-Optimality of Distributed Network Management with a Machine Learning Approach." 2007. Web. 24 Apr 2019.
Jeon S. Near-Optimality of Distributed Network Management with a Machine Learning Approach. [Internet] [Doctoral dissertation]. Georgia Tech; 2007. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/16136.
22. Ji, Meng. Graph-Based Control of Networked Systems.
▼ Networked systems have attracted great interests from the control society during the last decade. Several issues rising from the recent research are addressed in this dissertation. Connectedness is one of the important conditions that enable distributed coordination in a networked system. Nonetheless, it has been assumed in most implementations, especially in continuous-time applications, until recently. A nonlinear weighting strategy is proposed in this dissertation to solve the connectedness preserving problem. Both rendezvous and formation problem are addressed in the context of homogeneous network. Controllability of heterogeneous networks is another issue which has been long omitted. This dissertation contributes a graph theoretical interpretation of controllability. Distributed sensor networks make up another important class of networked systems. A novel estimation strategy is proposed in this dissertation. The observability problem is raised in the context of our proposed distributed estimation strategy, and a graph theoretical interpretation is derived as well. The contributions of this dissertation are as follows: It solves the connectedness preserving problem for networked systems. Based on that, a formation process is proposed. For heterogeneous networks, the leader-follower structure is studied and sufficient and necessary conditions are presented for the system to be controllable. A novel estimation strategy is proposed for distributed sensor networks, which could improve the performance. The observability problem is studied for this estimation strategy and a necessary condition is obtained. This work is among the first ones that provide graph theoretical interpretations of the controllability and observability issues. Advisors/Committee Members: Egerstedt, Magnus (Committee Chair), Ji, Chuanyi (Committee Member), Taylor, David (Committee Member), Tsiotras, Panagiotis (Committee Member), Vela, Patricio (Committee Member).
Ji, Meng. "Graph-Based Control of Networked Systems." 2007. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/16313.
Ji, Meng. "Graph-Based Control of Networked Systems." 2007. Web. 24 Apr 2019.
Ji M. Graph-Based Control of Networked Systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2007. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/16313.
23. Corbett, Cherita L. Securing Access to Wireless Local Area Networks using a Passive Approach to Device Identification.
▼ IEEE 802.11 wireless networks are plagued with problems of unauthorized access. Left undetected, unauthorized access is the precursor to additional mischief. Current approaches to detecting intruders are invasive or can be evaded by stealthy attackers. We propose the use of spectral analysis to identify the type of wireless network interface card (NIC). This mechanism can be applied to support the detection of unauthorized systems that use NICs which are different from that of a legitimate system. We focus on two functions, active scanning and dynamic rate switching, required by the 802.11 standard that are implemented in the hardware and software of the wireless NIC. We show that the implementation of these functions influence the transmission patterns of a wireless stream that are observable through traffic analysis. Furthermore, differences in the behavior of a wireless stream caused by differences in the implementation of these functions are exploited to establish the identity of a NIC. Our mechanism for NIC identification uses signal processing to analyze the periodicity embedded in the wireless traffic caused by active scanning and rate switching. A spectral profile is created from the periodic components of the traffic and used for the identity of the wireless NIC. We show that we can discern between NICs manufactured by different vendors and NICs within the same manufacturer using the spectral profile. Advisors/Committee Members: Copeland, John (Committee Chair), Ahamad, Mustaque (Committee Member), Ji, Chuanyi (Committee Member), Owen, Henry (Committee Member), Riley, George (Committee Member).
Corbett, Cherita L. "Securing Access to Wireless Local Area Networks using a Passive Approach to Device Identification." 2006. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/10500.
Corbett, Cherita L. "Securing Access to Wireless Local Area Networks using a Passive Approach to Device Identification." 2006. Web. 24 Apr 2019.
Corbett CL. Securing Access to Wireless Local Area Networks using a Passive Approach to Device Identification. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/10500.
24. Abdullah, Kulsoom B. Scaling and Visualizing Network Data to Facilitate in Intrusion Detection Tasks.
▼ As the trend of successful network attacks continue to rise, better forms of intrusion, detection and prevention are needed. This thesis addresses network traffic visualization techniques that aid administrators in recognizing attacks. A view of port statistics and Intrusion Detection System (IDS) alerts has been developed. Each help to address issues with analyzing large datasets involving networks. Due to the amount of traffic as well as the range of possible port numbers and IP addresses, scaling techniques are necessary. A port-based overview of network activity produces an improved representation for detecting and responding to malicious activity. We have found that presenting an overview using stacked histograms of aggregate port activity, combined with the ability to drill-down for finer details allows small, yet important details to be noticed and investigated without being obscured by large, usual traffic. Another problem administrators face is the cumbersome amount of alarm data generated from IDS sensors. As a result, important details are often overlooked, and it is difficult to get an overall picture of what is occurring in the network by manually traversing textual alarm logs. We have designed a novel visualization to address this problem by showing alarm activity within a network. Alarm data is presented in an overview from which system administrators can get a general sense of network activity and easily detect anomalies. They additionally have the option of then zooming and drilling down for details. Based on our system administrator requirements study, this graphical layout addresses what system administrators need to see, is faster and easier than analyzing text logs, and uses visualization techniques to effectively scale and display the data. With this design, we have built a tool that effectively uses operational alarm log data generated on the Georgia Tech campus network. For both of these systems, we describe the input data, the system design, and examples. Finally, we summarize potential future work. Advisors/Committee Members: Copeland, John (Committee Chair), Hamblen, James (Committee Member), Ji, Chuanyi (Committee Member), Owen, Henry (Committee Member), Stasko, John (Committee Member).
Abdullah, Kulsoom B. "Scaling and Visualizing Network Data to Facilitate in Intrusion Detection Tasks." 2006. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/10509.
Abdullah, Kulsoom B. "Scaling and Visualizing Network Data to Facilitate in Intrusion Detection Tasks." 2006. Web. 24 Apr 2019.
Abdullah KB. Scaling and Visualizing Network Data to Facilitate in Intrusion Detection Tasks. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/10509.
25. Krasser, Sven. Adaptive Measurement-Based Traffic Engineering in Packet-Switched Radio Access Networks.
▼ In this research, we propose a framework for measurement-based traffic engineering and connection admission control in radio access networks based on the Internet Protocol (IP). This framework is evaluated by simulation using the popular network simulator ns-2. The framework is adaptive to changes in the network load and can distinguish between different types of service. All traffic engineering decisions are made by edge routers (ERs) at the rim of the network domain. Multiple disjoint paths are configured between those ERs. Network state information is gathered in two different fashions. We evaluate a scheme based on the states of the queues on each alternative path and a scheme based on end-to-end probe packet transmission characteristics on each alternative path. Both schemes are compared to a shortest path first (SPF) routing approach. Advisors/Committee Members: Owen, Henry (Committee Chair), Abler, Randal (Committee Member), Ji, Chuanyi (Committee Member), Riley, George (Committee Member), Xu, Jun (Committee Member).
Krasser, Sven. "Adaptive Measurement-Based Traffic Engineering in Packet-Switched Radio Access Networks." 2004. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/5004.
Krasser, Sven. "Adaptive Measurement-Based Traffic Engineering in Packet-Switched Radio Access Networks." 2004. Web. 24 Apr 2019.
Krasser S. Adaptive Measurement-Based Traffic Engineering in Packet-Switched Radio Access Networks. [Internet] [Doctoral dissertation]. Georgia Tech; 2004. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/5004.
26. Anjali, Tricha. DiffServ/MPLS Network Design and Management.
▼ The MultiProtocol Label Switching (MPLS) framework is used in many networks to provide efficient load balancing which distributes the traffic for efficient Quality of Service (QoS) provisioning in the network. If the MPLS framework is combined with Differentiated Services (DiffServ) architecture, together they can provide aggregate-based service differentiation and QoS. The combined use of DiffServ and MPLS in a network is called DiffServ-aware Traffic Engineering (DS-TE). Such DiffServ-based MPLS networks demand development of efficient methods for QoS provisioning. In this thesis, an automated manager for management of these DiffServ-based MPLS networks is proposed. This manager, called Traffic Engineering Automated Manager (TEAM), is a centralized authority for adaptively managing a DiffServ/MPLS domain and it is responsible for dynamic bandwidth and route management. TEAM is designed to provide a novel and unique architecture capable of managing large scale MPLS/DiffServ domains without any human interference. TEAM constantly monitors the network state and reconfigures the network for efficient handling of network events. Under the umbrella of TEAM, new schemes for Label Switched Path (LSP) setup/teardown, traffic routing, and network measurement are proposed and evaluated through simulations. Also, extensions to include Generalized MPLS (GMPLS) networks and inter-domain management are proposed. Advisors/Committee Members: Akyildiz, Ian (Committee Chair), Ammar, Mostafa (Committee Member), Ji, Chuanyi (Committee Member), Riley, George (Committee Member), Sivakumar, Raghupathy (Committee Member).
Anjali, Tricha. "DiffServ/MPLS Network Design and Management." 2004. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/5191.
Anjali, Tricha. "DiffServ/MPLS Network Design and Management." 2004. Web. 24 Apr 2019.
Anjali T. DiffServ/MPLS Network Design and Management. [Internet] [Doctoral dissertation]. Georgia Tech; 2004. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/5191.
27. Chen, Zesheng. Modeling and Defending Against Internet Worm Attacks.
▼ As computer and communication networks become prevalent, the Internet has been a battlefield for attackers and defenders. One of the most powerful weapons for attackers is the Internet worm. Specifically, a worm attacks vulnerable computer systems and employs self-propagating methods to flood the Internet rapidly. The objective of this research is to characterize worm attack behaviors, analyze Internet vulnerabilities, and develop effective countermeasures. More specifically, some fundamental factors that enable a worm to be designed with advanced scanning methods are presented and investigated through mathematical modeling, simulations, and real measurements. First, one factor is an uneven vulnerable-host distribution that leads to an optimal scanning method called importance scanning. Such a new method is developed from and named after importance sampling in statistics and enables a worm to spread much faster than both random and routable scanning. The information of vulnerable-host distributions, however, may not be known before a worm is released. To overcome this, worms using two sub-optimal methods are then investigated. One is a self-learning worm that can accurately estimate the underlying vulnerable-host distribution while propagating. The other is a localized-scanning worm that has been exploited by Code Red II and Nimda worms. The optimal localized scanning and three variants of localized scanning are also studied. To fight against importance-scanning, self-learning, and localized-scanning worms, defenders should scatter applications uniformly in the entire IP-address space from the viewpoint of game theory. Next, a new metric, referred to as the non-uniformity factor, is presented to quantify both the unevenness of a vulnerable-host distribution and the spreading ability of network-aware worms. This metric is essentially the Renyi information entropy and better characterizes the non-uniformity of a distribution than the Shannon entropy. Finally, another fundamental factor is topology information that enables topological-scanning worms. The spreading dynamics of topological-scanning worms are modeled through a spatial-temporal random process and simulated with both real and synthesized topologies. Advisors/Committee Members: Ji, Chuanyi (Committee Chair), Ammar, Mostafa (Committee Member), Copeland, John (Committee Member), Lee, Wenke (Committee Member), Riley, George (Committee Member).
Chen, Zesheng. "Modeling and Defending Against Internet Worm Attacks." 2007. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/14582.
Chen, Zesheng. "Modeling and Defending Against Internet Worm Attacks." 2007. Web. 24 Apr 2019.
Chen Z. Modeling and Defending Against Internet Worm Attacks. [Internet] [Doctoral dissertation]. Georgia Tech; 2007. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/14582.
28. Tang, Jin. Mobile IPv4 Secure Access to Home Networks.
▼ With the fast development of wireless networks and devices, Mobile IP is expected to be used widely so that mobile users can access the Internet anywhere, anytime without interruption. However, some problems, such as firewall traversal and use of private IP addresses, restrict use of Mobile IP. The objective of this thesis is to design original schemes that can enable a mobile node at abroad to access its home network as well as the Internet securely and that can help Mobile IP to be used widely and commercially. Our solutions are secure, efficient, and scalable. They can be implemented and maintained easily. In this thesis, we mainly consider Mobile IPv4, instead of Mobile IPv6. Three research topics are discussed. In each topic, the challenges are investigated and the new solutions are presented. The first research topic solves the firewall traversal problems in Mobile IP. A mobile node cannot access its firewall-protected home network if it fails the authentication by the firewall. We propose that an IPsec tunnel be established between the firewall and the foreign agent for firewall traversal and that an IPsec transport security association be shared by the mobile node and a correspondent node for end-to-end security. The second topic researches further on firewall traversal problems and investigates the way of establishing security associations among network entities. A new security model and a new key distribution method are developed. With the help of the security model and keys, the firewall and the relevant network entities set up IPsec security associations to achieve firewall traversal. A mobile node from a private home network cannot communicate with other hosts with its private home address when it is visiting a public foreign network. A novel and useful solution is presented in the third research topic. We suggest that the mobile node use its Network Access Identifier (NAI) as its identification and obtain a public home address from its home agent. In addition, a new tunnel between the mobile node and its home agent is proposed. Advisors/Committee Members: Copeland, John (Committee Chair), Ahamad, Mustaque (Committee Member), Beyah, Raheem (Committee Member), Ji, Chuanyi (Committee Member), Owen, Henry (Committee Member).
Tang, Jin. "Mobile IPv4 Secure Access to Home Networks." 2006. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/11536.
Tang, Jin. "Mobile IPv4 Secure Access to Home Networks." 2006. Web. 24 Apr 2019.
Tang J. Mobile IPv4 Secure Access to Home Networks. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/11536.
29. Vedantham, Ramanuja. Energy-Efficient Network Protocols for Wireless Sensor and Actor Networks.
▼ Wireless sensor networks (WSNs) have a wide variety of applications in civilian, medical and military applications. However, the nodes in such a network are limited to one type of action: sensing the environment. With increasing requirements for intelligent interaction with the environment, there is a need to not only perceive but also control the monitored environment. This has led to the emergence of a new class of networks, referred to as wireless sensor and actor networks (WSANs), capable of performing both sensing and acting tasks on the environment. The evolution from WSNs, which can be thought of as performing only read operations, to WSANs, which can perform both read and write operations, introduces unique and new challenges that need to be addressed. In this research, the fundamental challenges required for effective operation of WSANs are analyzed from the following three different perspectives: (i) operation correctness, (ii) resource optimality, and (iii) operation performance. The solutions proposed to address the challenges are evaluated with the optimal solution and other competing approaches through analytical and simulation results. The feasibility of the proposed solutions is demonstrated through a testbed implementation. Advisors/Committee Members: Sivakumar, Raghupathy (Committee Chair), Beyah, Raheem (Committee Member), Copeland, John (Committee Member), Ji, Chuanyi (Committee Member), Riley, George (Committee Member).
Vedantham, Ramanuja. "Energy-Efficient Network Protocols for Wireless Sensor and Actor Networks." 2006. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/13959.
Vedantham, Ramanuja. "Energy-Efficient Network Protocols for Wireless Sensor and Actor Networks." 2006. Web. 24 Apr 2019.
Vedantham R. Energy-Efficient Network Protocols for Wireless Sensor and Actor Networks. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/13959.
30. Akan, Ozgur Baris. Advanced Transport Protocols for Next Generation Heterogeneous Wireless Network Architectures.
▼ The revolutionary advances in the wireless communication technologies are inspiring the researchers to envision the next generation wireless networking architectures, i.e., Next Generation Wireless Internet (NGWI), InterPlaNetary (IPN) Internet, and Wireless Sensor Networks (WSN). There exist significant technological challenges for the realization of these envisioned next generation network architectures. NGWI will be the convergence of the Internet and heterogeneous wireless architectures, which have diverse characteristics and hence pose different sets of research challenges, to achieve anywhere, anytime seamless service to the mobile users. Similarly, the unique characteristics and challenges posed by deep space communications call for novel networking protocols to realize the IPN Internet objective. Furthermore, in order to realize the potential gains of WSN, it is imperative that communication challenges imposed by resource constraints of sensor nodes must be efficiently addressed with novel solutions tailored to the WSN paradigm. The objective of this research is to develop new advanced transport protocols for reliable data transport and real-time multimedia delivery in the next generation heterogeneous wireless network architectures. More specifically, the analytical rate control (ARC) protocol for real-time multimedia delivery is first proposed for wired/wireless hybrid networks. Next, a new rate control scheme (RCS) is proposed to achieve high throughput performance and fairness for real-time multimedia traffic over the satellite links. The unified adaptive transport layer (ATL) suite and its protocols for both reliable data transport (TCP-ATL) and real-time multimedia delivery (RCP-ATL) are introduced for the NGWI. A new reliable transport protocol for data transport in the IPN Internet (TP-Planet) is then proposed to address the unique challenges of the IPN Internet backbone links. A new integrated tranmission protocol (ITP) is then proposed for reliable data transport over multihop IPN Internet paths. Finally, the event-to-sink reliable transport (ESRT) protocol is proposed to achieve reliable event transport with minimum energy expenditure in WSN. Advisors/Committee Members: Akyildiz, Ian (Committee Chair), Braun, Robert (Committee Member), Ji, Chuanyi (Committee Member), Sivakumar, Raghupathy (Committee Member), Steffes, Paul (Committee Member).
Akan, Ozgur Baris. "Advanced Transport Protocols for Next Generation Heterogeneous Wireless Network Architectures." 2004. Doctoral Dissertation, Georgia Tech. Accessed April 24, 2019. http://hdl.handle.net/1853/5231.
Akan, Ozgur Baris. "Advanced Transport Protocols for Next Generation Heterogeneous Wireless Network Architectures." 2004. Web. 24 Apr 2019.
Akan OB. Advanced Transport Protocols for Next Generation Heterogeneous Wireless Network Architectures. [Internet] [Doctoral dissertation]. Georgia Tech; 2004. [cited 2019 Apr 24]. Available from: http://hdl.handle.net/1853/5231.


Curry Kits - Let's Cook At Home.
Bhaji Man's Curry Kits take all the hard work out of cooking authentic ethnic cuisine at home, allowing even the busiest of people or most inexperienced of cooks to present mouthwatering, aromatic and flavoursome dishes from our curry kit range.
We have done all the hard work on your behalf, perfecting a range of kits for easy-to-make curries.
Each Curry Kit contains a wonderful combination of exotic spices and herbs, all weighed out, chopped, ground and blended to our own special secret recipes, and designed to produce the wonderful flavours and aromas of traditional Eastern cuisine at its very best.
Designed to produce a complete dinner for four people and in addition to all the spices and herbs you will need. Each curry contain full step-by-step preparation and cooking instructions and an essential shopping list of additional ingredients.
Choose from our wide range of curry kits and prepare your taste buds for a sensational experience.


text:
Can You Buy Bose Stock? Here's What You Need To...
Can You Buy Bose Stock? Here's What You Need To Know
When you hear the word Bose, it's quite likely that you think about premium quality audio equipment.
1 Bose Stock Intro: A Brief History of Bose
2 Can You Buy Bose Stock: Bose, A Controversial Contender
3 Can You Buy Bose Stock: Consistent Customer Satisfaction
4 Can You Buy Bose Stock?
5 Bose Stock: Who Owns Bose?
6 Bose Stock Price?
7 Bose Stock: How Much is Bose Worth?
8 Can You Buy Bose Stock: Bose Competitors You Can Invest In
8.1 Sonos (NASDAQ: SONO)
8.2 Voxx International (NASDAQ: VOXX)
8.3 Beats Electronics (NASDAQ: AAPL)
8.4 Sony Corporation (NYSE: SONY)
8.5 Samsung Electronics Co Ltd (KRX: 005930)
9 Bose Stock: Final Thoughts
The Bose Corporation has a rich history of innovation and remarkable success in the audio equipment industry, and investing in Bose just seems like a natural desire due to their reputation.
So can you buy Bose Stock? Here's what you need to know about buying Bose Stock, the Bose Corporation, and the impact they've had on the American audio engineering market.
Bose Stock Intro: A Brief History of Bose
Founded in 1964 by Amar Bose, the Bose Corporation was established in Framingham, Massachusetts, after Bose's purchase of a stereo system that had him particularly disappointed.
Looking to remedy the situation and improve upon the speaker design, Bose took to the drawing board, working tirelessly to come up with a design based on sound reflection and the sound of a concert hall.
Bose's work resulted in the company's first manufactured product, the Bose 2201.
Contrary to the success of the company in more modern times, the 2201 was actually a failure, believe it or not, and was discontinued within four years of the initial release.
Surprised by the market and its reaction to the product, Bose determined that the average user was not after audiophile quality equipment.
The market demanded a product that, rather than be dictated by purely scientific measurements, was purely derived by the listener's enjoyment.
In 1968, Bose released the 901, another unconventional design by all market standards in the audio industry, but one that proved successful.
The systems were based on 8 speakers that faced away from the listener, with a 9th speaker facing towards the user. The speakers were an immediate hit.
The Bose 901 was the flagship design of the company from that point forward, enjoying a manufacturing run that spanned nearly 50 years.
The company's success saw partnerships in the automotive industry, as well as in professional audio system designs intended for commercial businesses.
Bose audio systems can be found in vehicles from a multitude of makers, including Cadillac, Chevrolet, Honda, Nissan, and Porsche.
In addition to making speaker systems for automotive, commercial, and home audio, they have made home theater kits, portable media players, aviation headsets, and consumer grade headphones.
Among some of their more ambitious prototypes, Bose has prototype suspension systems and vibration dampening seats using their knowledge of magnets and electromagnetism.
Can You Buy Bose Stock: Bose, A Controversial Contender
Bose has been criticized for a number of things since it's inception, but there are a handful of things that stand out among these criticisms.
While Bose has been called a premium audio company, audiophiles consistently display their disdain for the company.
They've been slammed for producing high-end audio equipment at a premium price while not meeting audiophile standards.
Often, Bose systems are compared to other brands that meet these specifications that cost less, and are dragged for maintaining a high price tag while other "affordable" options are on the market.
The company still has not received the THX certification that is so highly sought after by audio equipment manufacturers.
The company's position on these criticisms can be boiled down to Amar Bose's views on the matter as a whole.
Bose stated that the standards that audiophiles and stereophiles subscribed to were meaningless, the data useless, and instead focused on creating systems that subjectively sounded good.
The thoughts of the average consumer and the sound quality spoke for itself, rocketing Bose to becoming a household name.
From a technology standpoint, the lack of documentation and specifications regarding the speaker systems is astounding.
If you were to search for specifications or standards that a large portion of the market still subscribe to, chances are you wouldn't find any documentation regarding similar data being published by Bose itself.
The company is notorious for being protective of all of their intellectual properties.
In line with their protective nature, Bose has been known to take action to protect what they believe is an infringement on their products as well as their brand.
They have sued companies unrelated to audio electronics in order to protect their slogans and trademarks.
Additionally they've not been afraid to go after competitors who use similar naming systems as well as technology similar to their own, such as Beats noise cancelling headphones.
Bose claimed that Beats had stolen the designs that allowed the headphones to cancel noise. The lawsuit was dropped, and the two companies settled outside of court.
Can You Buy Bose Stock: Consistent Customer Satisfaction
As long as Bose continues to deliver on the customer satisfaction that they are so well known for, the prices of their speakers will stay high, and the company will stay a top contender in the audio electronics industry.
Due to their sound quality approach, Bose corners the market on high-end speakers by appealing to the average listener and what they believe sounds best.
With such consistent customer satisfaction comes trust. In 2005, Bose was mentioned in a published market study stating that the company was among the most trusted electronics brands in the US.
As the brand releases new products, it's evident that the research and development that each product undergoes is rigorous.
When competing with other brands also boasting the use of new technology, Bose historically outperforms and leads the pack.
Can You Buy Bose Stock?
Bose stock is not available for purchase at the time of writing this article, as the company remains privately traded.
There is no date for an IPO currently, but if one were to be released, you can guarantee that the share price would be high and the market value of the company would only appreciate as they are the go-to name in home audio systems, and have been for decades.
With the majority owner being MIT, and the agreement barring them from day to day involvement in the functions of the company, it is unclear if Bose will ever be publicly traded.
Bose Stock: Who Owns Bose?
Up until 2011, Amar Bose had remained the majority owner of the company.
At that time in 2011, Bose made the decision to donate the majority of his shares to his alma mater and former employer, the Massachusetts Institute of Technology.
MIT benefits from this donation by being paid out an annual cash dividend.
Per an agreement, the dividend is to be used for continued education and research purposes.
Another condition of the donation was the agreement that MIT is not allowed to sell any of the shares, and they aren't allowed to manage or govern the company itself.
Bose Stock Price?
Because Bose is a privately held company and is not publicly traded, a stock price is not available for the company.
Without any dates scheduled for an IPO, a stock price will not be available for the foreseeable future.
Bose Stock: How Much is Bose Worth?
At the end of the 2019 fiscal year, it was reported that Bose was worth roughly $4 billion.
At the same time, it was announced that the company employed over 9,000 people.
With their reputation and their consistent customer satisfaction, it can be expected that Bose will continue to grow and will be worth more as the company ages.
Can You Buy Bose Stock: Bose Competitors You Can Invest In
Although Bose stock is not currently able to be bought and traded, there are a list of competitors that are publicly traded that stock can be bought.
Sonos (NASDAQ: SONO)
In recent years, Sonos has become the biggest competitor on the market for Bose, with results on Google generating suggestions like, "Is Sonos better than Bose?"
A relatively newcomer on the market, Sonos was founded in 2002.
The company wasted no time working to obtain partnerships with music streaming companies like Pandora, Spotify, and Amazon.
The company moved from being privately owned to publicly traded in 2018.
Since that time, the stock has consistently trended up, even through an onslaught of technical issues and critical reception.
Business remains good though, as the speakers continue to contend with Bose.
Voxx International (NASDAQ: VOXX)
Voxx International is a large parent company that owns several Bose competitors on the market.
Voxx has come to own such companies as Acoustic Research, Audiovox, Jensen Electronics, and Klipsch.
As these companies began to lose traction independently, Voxx would some into the fold and purchase them, absorbing them into the Voxx International company.
Voxx, in the last year, seems to be splitting the brands that it has absorbed into two separate brands, one designed to appeal to high quality audio equipment enthusiasts, and the other for consumer electronics at a lower pricepoint.
Beats Electronics (NASDAQ: AAPL)
While you cannot invest in Beats Electronics alone, you can invest in their parent company, Apple (and let's be honest, investing in Apple these days feels like a sure bet).
Beats Electronics, formerly known as Beats by Dre, is one of the largest competitors on the market when it comes to consumer headphones.
Priced in such a way that studio-quality headphones could be purchased by anyone, Beats took off and left many of the companies they competed with in their wake.
With such popularity comes a lot of attention, and rap mogul Dr. Dre was approached by Apple.
In 2014, Apple made a deal to purchase Beats by Dre, changing the name to Beats Electronics, for a whopping $3.2 billion.
The deal was unprecedented, and made Dr. Dre the "first billionaire in hip hop."
Sony Corporation (NYSE: SONY)
In the world of electronics, people know the name Sony. The brand competes with Bose, yes, but really has a stake in nearly every aspect in the electronics industry.
Their first venture into audio electronics was with the iconic Walkman cassette player, which down the line developed into CD players, digital media players, and even a line of phones. With these devices came headphones, as well as speakers.
Sony has continued to produce studio quality headphones, speakers, and home audio kits, and for good reason.
With all of the entries that Sony has in the electronics market in terms of home entertainment, it only makes sense for the giant to produce their own audio related devices to fit into their other products.
Samsung Electronics Co Ltd (KRX: 005930)
Not only a rival to Bose, but a rival to Apple as well, Samsung Electronics is a stock to look into if interested in trading internationally, specifically on the Korean Exchange.
Samsung has become a megalith in the electronics industry, and it is continuing to grow without any signs of slowing down.
Naturally, like all other large electronics brands, Samsung does have a sector entirely dedicated to audio equipment.
In 2017, Samsung made a big move to enter the speakers portion of the electronic industry by acquiring Harman International.
In doing so, Samsung gained control over numerous speaker brands, from entry level to high-end names.
A few of these include Harman Kardon, Infinity, and JBL, all brand known quite well for their speakers and audio equipment.
Bose Stock: Final Thoughts
Bose is one of the more impressive audio equipment manufacturers in the United States with decades of positive feedback from consumers, even though reviewers may not agree.
That's okay with Bose, however, as they look to deliver sound quality that isn't measured by instruments or data, but rather is measured by the listener.
This approach has proven to be a successful strategy for the company, as they are a trusted household name when it comes to audio equipment.
While the company may not be publicly traded at this time, there are suitable stocks from Bose competitors to invest in.
Some of these are Apple, Voxx, Sonos, and Sony, all major labels on the market.
If an IPO is announced for Bose, it can be expected that stock prices would be relatively high, judging by the competition, as well as the worth of the company while it remains private.
The possibility of an IPO, however, is still undetermined, based on the major owner of the company being MIT and their inability to manage or govern the company in any capacity.
This entry was posted in Business, Private Companies. Bookmark the permalink.
YouTube Competitors and Alternatives – Can Anyone Really Compete?
Credit Fix Guy Review 2022: Can They Really Fix Your Credit?

redpajama_set_name: RedPajamaCommonCrawl


Is gruesomely garish your thing?, If so you're in for a right treat with Spike's stomach churning TV series adaptation of Stephen King's The Mist. Don't believe us? We dare you to watch the new trailer below, but be warned this is for the faint of heart.
Spike's 10-episode psychological thriller series centers on a small-town family that is torn apart by a violent crime before things take an altogether stranger turn. As they deal with the fallout of the crime an eerie mist rolls in, suddenly cutting the town off from the rest of the world. Friends and adversaries alike become bizarre bedfellows as they battle the mysterious mist and its threats, fighting to maintain morality and sanity as the rules of society break down.
The dangerously dark trailer is filled with half decomposed faces, gaping flesh wounds, insects flying out of mouths and even a couple getting very steamy in the throes of passion. Also full of nerve wrecking jump scares, The Mist looks to give a big screen experience to the television watching audiences who love to be freaked out and scared witless, all from the comfort from your own home.
The Mist will star Morgan Spector, who is also set to appear as Sylvester Stallone opposite Liev Schreiber and Naomi Watts in "The Bleeder," based on the true story that inspired "Rocky", will play the title role of "Kevin Copeland", devoted father whose rigid moral compass is tested, Alyssa Sutherland (Vikings) as "Eve Copeland", a mother who must both protect her teen daughter while facing down her past, and Frances Conroy (Six Feet Under) as "Nathalie", ecological martyr.
The man behind series such as Fargo, 30 Rock, and Scrubs amongst other acclaimed TV shows Adam Bernstein, takes the helm on The Mist as well as joining Christian Thorpe as executive producer on the show.


Now the artiste has equally involved Kim's little sister Kylie Jenner in the chaos as over the weekend DJ Akademiks posted another clip filmed during The Game's studio session. An unreleased track is heard playing in the background, with some suggestive lyrics about the 21-year-old beauty entrepreneur.
"Her sister made a billion in makeup. I used to make her Frosted Flakes when she wake up," The Game raps.
Neither Kim nor Kylie have responded to the slander. However, he defended his lyrics about Mrs West on social media Friday.


Monmouth Assembly Member Nick Ramsay has described how he has been inundated with e-mails from constituents worried about the proposed M4 Black Route, which they fear would cause irreparable damage to the unique and protected landscape of the Gwent levels.
"I've been inundated with more objections to this scheme than to anything else I can remember during my time as an Assembly Member.
"Whilst we clearly need a solution to peak-time congestion along this stretch of motorway, the concerns of Gwent Wildlife Trust and the Future Generations Commissioner must be taken into account.
"I've also been concerned about plans to 'de-motorway' the existing M4 as part of the scheme, since the old M4 will continue to be the main route westwards for my constituents and I wouldn't want to see a loss of capacity in this part of the network.


text:
Q: structure versus classes // By using structure :
struct complex {
  float real;
  float imag;
};

complex operator+(complex, complex);

main() {
  complex t1, t2, t3;
  t3 = t1 + t2;
}

complex operator+(complex w, complex z) {
  statement 1;
  statement 2;
}

// By using class :
class complex {
  int real;
  int imag;

public:
  complex operator+(complex c) {
    statement 1;
    statement 2;
  }

  main() {
    complex t1, t2, t3;
    t3 = t1 + t2;
  }

While using structure, the overloaded function can accept two arguments whereas while    using class the overloaded function accepts only one argument, when the overloaded    operator function is a member function in both cases i.e in struct as well as in class. Why does this happen?

A:
...when the overloaded operator function is a member function in both
  cases i.e structure as well as class...

What makes you say that? That's not true.
In case of struct in your example, overloaded operator function is not a member. This is why it requires 2 parameters.
So, the difference has absolutely nothing to do with struct vs. class matter. The reason you have different number of parameters in these operators is that the first one is implemented as a non-member (and therefore has two explicit parameters), while the second one is implemented as member (and therefore has only one explicit parameter).

A: That has nothing to do with classes vs. structs. It's about member vs. nonmember.
Classes and structs in C++ differ solely bu their default accessibility level for members and bases (public for structs, and private for classes). Other than this, there is no difference at all.
When overloading operators, you almost always have the choice of defining an operator as a member or as a freestanding function. There are only 4 operators that have to be members. These are: (), [], ->, and = (as to why, see this question of mine). For the rest, the choice is yours.
This excellent FAQ entry explains (among other things) how to choose between member vs. nonmember.
To answer your core question: In case of member function, the first agument is *this

A: This happens because you using different methods to define operator. When you use struct you define it outside of struct, but when use class you define operator inside class.

A: When you want to pass two args to your overloaded operator+ you should create a friend function of the class and then pass const complex& lhs, const complex& rhs as your args.  Now you can have two arguments to your operator+.
When the operator+ is a member of the class, one arg is implicitly passed as the this pointer.

A: In your second example the overloaded operator is a member function of the class, therefore when this operator is called, it's called as a member function of the first operand and the first operand is therefore implicitly given as the object on which the member function has been called (the this pointer if you like).

A: //
complex operator +(cont complex& lhs, const complex& rhs)
{
  ...
}

main()
{
  complex t1,t2,t3;
  t3=t1+t2; // i.e. t3 = operator+(t1, t2);
}

//
class complex
{
  int real,imag;
public:
  complex operator +(const complex& rhs){}
};

main()
{
  complex t1,t2,t3;
  t3=t1+t2; // i.e. t3 = t1.operator+(t2);
}

redpajama_set_name: RedPajamaStackExchange