Current Search: Turgut, Damla (x)
View All Items
Pages
- Title
- Quantitative Framework For Social Cultural Interactions.
- Creator
-
Bhatia, Taranjeet, Boloni, Ladislau, Turgut, Damla, Sukthankar, Gita, Fiore, Stephen, University of Central Florida
- Abstract / Description
-
For an autonomous robot or software agent to participate in the social life of humans, it must have a way to perform a calculus of social behavior. Such a calculus must have explanatory power (it must provide a coherent theory for why the humans act the way they do), and predictive power (it must provide some plausible events from the predicted future actions of the humans).This dissertation describes a series of contributions that would allow agents observing or interacting with humans to...
Show moreFor an autonomous robot or software agent to participate in the social life of humans, it must have a way to perform a calculus of social behavior. Such a calculus must have explanatory power (it must provide a coherent theory for why the humans act the way they do), and predictive power (it must provide some plausible events from the predicted future actions of the humans).This dissertation describes a series of contributions that would allow agents observing or interacting with humans to perform a calculus of social behavior taking into account cultural conventions and socially acceptable behavior models. We discuss the formal components of the model: culture-sanctioned social metrics (CSSMs), concrete beliefs (CBs) and action impact functions. Through a detailed case study of a crooked seller who relies on the manipulation of public perception, we show that the model explains how the exploitation of social conventions allows the seller to finalize transactions, despite the fact that the clients know that they are being cheated. In a separate study, we show that how the crooked seller can find an optimal strategy with the use of reinforcement learning.We extend the CSSM model for modeling the propagation of public perception across multiple social interactions. We model the evolution of the public perception both over a single interaction and during a series of interactions over an extended period of time. An important aspect for modeling the public perception is its propagation - how the propagation is affected by the spatio-temporal context of the interaction and how does the short-term and long-term memory of humans affect the overall public perception.We validated the CSSM model through a user study in which participants cognizant with the modeled culture had to evaluate the impact on the social values. The scenarios used in the experiments modeled emotionally charged social situations in a cross-cultural setting and with the presence of a robot. The scenarios model conflicts of cross-cultural communication as well as ethical, social and financial choices. This study allowed us to study whether people sharing the same culture evaluate CSSMs at the same way (the inter-cultural uniformity conjecture). By presenting a wide range of possible metrics, the study also allowed us to determine whether any given metric can be considered a CSSM in a given culture or not.
Show less - Date Issued
- 2016
- Identifier
- CFE0006262, ucf:51047
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0006262
- Title
- Opportunistic Networks in Campus Environments.
- Creator
-
Bacanli, Salih Safa, Turgut, Damla, Guha, Ratan, Bassiouni, Mostafa, University of Central Florida
- Abstract / Description
-
Opportunistic communication is an active research area in wireless sensor networks. Exploiting the opportunities to communicate between devices in an unstable network is one of the main challenges of the opportunistic communication. In this thesis, we propose an infrastructure-independent opportunistic mobile social networking strategy for efficient message broadcasting in campus environments. Specifically, we focus on the application scenario of university campuses. In our model, the...
Show moreOpportunistic communication is an active research area in wireless sensor networks. Exploiting the opportunities to communicate between devices in an unstable network is one of the main challenges of the opportunistic communication. In this thesis, we propose an infrastructure-independent opportunistic mobile social networking strategy for efficient message broadcasting in campus environments. Specifically, we focus on the application scenario of university campuses. In our model, the students' smartphones forward messages to each other. The messages are created spontaneously as independent events in various places of the campus. The events can be either urgent security alerts or private announcements to the students who are currently on the campus. Our proposed state-based campus routing (SCR) protocol is based on the idle and active states of the students in indoor and outdoor environments. The proposed model is analyzed through extensive network simulations using mobility datasets collected from students on University of Milano, University of Cambridge and University of St Andrews campuses. The opportunistic network model and the SCR protocol is compared with epidemic, epidemic with TTS (Times-To-Send), PROPHET(Probabilistic Routing on History of Encounters), NDAO (Nodes Density Aware Opportunistic) and random routing protocols. We observe that the message delivery performance of SCR is close to Epidemic, PROPHET and NDAO while SCR reduces the amount of message transmissions.
Show less - Date Issued
- 2015
- Identifier
- CFE0006258, ucf:51038
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0006258
- Title
- Implementation of Refining Statements in OpenJML and Verification of Higher Order Methods with Model Program Specifications.
- Creator
-
Gurramkonda, Sai Chandesh, Leavens, Gary, Turgut, Damla, Jha, Sumit Kumar, University of Central Florida
- Abstract / Description
-
The Java Modeling Language (JML) describes the functional behavior of Java classes and methods using pre- and postconditions. However, standard pre- and postcondition specifications cannot verify calls to higher order methods (HOMs). JML uses model program specifications to reason about HOMs. This thesis describes the implementation of model programs in the OpenJML tool. The implementation includes parsing, type checking, and matching of model program specifications against the code.
- Date Issued
- 2017
- Identifier
- CFE0006743, ucf:51831
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0006743
- Title
- Energy efficient routing towards a mobile sink using virtual coordinates in a wireless sensor network.
- Creator
-
Rahmatizadeh, Rouhollah, Boloni, Ladislau, Turgut, Damla, Jha, Sumit, University of Central Florida
- Abstract / Description
-
The existence of a coordinate system can often improve the routing in a wireless sensor network. While most coordinate systems correspond to the geometrical or geographical coordinates, in recent years researchers had proposed the use of virtual coordinates. Virtual coordinates depend only on the topology of the network as defined by the connectivity of the nodes, without requiring geographical information. The work in this thesis extends the use of virtual coordinates to scenarios where the...
Show moreThe existence of a coordinate system can often improve the routing in a wireless sensor network. While most coordinate systems correspond to the geometrical or geographical coordinates, in recent years researchers had proposed the use of virtual coordinates. Virtual coordinates depend only on the topology of the network as defined by the connectivity of the nodes, without requiring geographical information. The work in this thesis extends the use of virtual coordinates to scenarios where the wireless sensor network has a mobile sink. One reason to use a mobile sink is to distribute the energy consumption more evenly among the sensor nodes and thus extend the life-time of the network. We developed two algorithms, MS-DVCR and CU-DVCR which perform routing towards a mobile sink using virtual coordinates. In contrast to the baseline virtual coordinate routing MS-DVCR limits routing updates triggered by the sink movement to a local area around the sink. In contrast, CU-DVCR limits the route updates to a circular area on the boundary of the local area. We describe the design justification and the implementation of these algorithms. Using a set of experimental studies, we show that MS-DVCR and CU-DVCR achieve a lower energy consumption compared to the baseline virtual coordinate routing without any noticeable impact on routing performance. In addition, CU-DVCR provides a lower energy consumption than MS-DVCR for the case of a fast moving sink.
Show less - Date Issued
- 2014
- Identifier
- CFE0005402, ucf:50422
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0005402
- Title
- Improving fairness, throughput and blocking performance for long haul and short reach optical networks.
- Creator
-
Tariq, Sana, Bassiouni, Mostafa, Zou, Changchun, Turgut, Damla, Li, Guifang, University of Central Florida
- Abstract / Description
-
Innovations in optical communication are expected to transform the landscape of global communications, internet and datacenter networks. This dissertation investigates several important issues in optical communication such as fairness, throughput, blocking probability and differentiated quality of service (QoS). Novel algorithms and new approaches have been presented to improve the performance of optical circuit switching (OCS) and optical burst switching (OBS) for long haul, and datacenter...
Show moreInnovations in optical communication are expected to transform the landscape of global communications, internet and datacenter networks. This dissertation investigates several important issues in optical communication such as fairness, throughput, blocking probability and differentiated quality of service (QoS). Novel algorithms and new approaches have been presented to improve the performance of optical circuit switching (OCS) and optical burst switching (OBS) for long haul, and datacenter networks. Extensive simulations tests have been conducted to evaluate the effectiveness of the proposed algorithms. These simulation tests were performed over a number of network topologies such as ring, mesh and U.S. Long-Haul, some high processing computing (HPC) topologies such as 2D and 6D mesh torus topologies and modern datacenter topologies such as FatTree and BCube.Two new schemes are proposed for long haul networks to improve throughput and hop count fairness in OBS networks. The idea is motivated by the observation that providing a slightly more priority to longer bursts over short bursts can significantly improve the throughput of the OBS networks without adversely affecting hop-count fairness. The results of extensive performance tests have shown that proposed schemes improve the throughput of optical OBS networks and enhance the hop-count fairness. Another contribution of this dissertation is the research work on developing routing and wavelength assignment schemes in multimode fiber networks. Two additional schemes for long haul networks are presented and evaluated over multimode fiber networks. First for alleviating the fairness problem in OBS networks using wavelength-division multiplexing as well as mode-division multiplexing while the second scheme for achieving higher throughput without sacrificing hop count fairness.We have also shown the significant benefits of using both mode division multiplexing and wavelength division multiplexing in real-life short-distance optical networks such as the optical circuit switching networks used in the hybrid electronic-optical switching architectures for datacenters. We evaluated four mode and wavelength assignment heuristics and compared their throughput performance. We also included preliminary results of impact of the cascaded mode conversion constraint on network throughput. Datacenter and high performance computing networks share a number of common performance goals. Another highly efficient adaptive mode wavelength- routing algorithm is presented over OBS networks to improve throughput of these networks. The effectiveness of the proposed model has been validated by extensive simulation results.In order to optimize bandwidth and maximize throughput of datacenters, an extension of TCP called multipath-TCP (MPTCP) has been evaluated over an OBS network using dense interconnect datacenter topologies. We have proposed a service differentiation scheme using MPTCP over OBS for datacenter traffic. The scheme is evaluated over mixed workload traffic model of datacenters and is shown to provide tangible service differentiation between flows of different priority levels. An adaptive QoS differentiation architecture is proposed for software defined optical datacenter networks using MPTCP over OBS. This scheme prioritizes flows based on current network state.
Show less - Date Issued
- 2015
- Identifier
- CFE0005721, ucf:50146
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0005721
- Title
- Reasoning Tradeoffs in Implicit Invocation and Aspect Oriented Languages.
- Creator
-
Sanchez Salazar, Jose, Leavens, Gary, Turgut, Damla, Jha, Sumit, Martin, Heath, University of Central Florida
- Abstract / Description
-
To reason about a program means to state or conclude, by logical means, some properties the program exhibits; like its correctness according to certain expected behavior. The continuous need for more ambitious, more complex, and more dependable software systems demands for better mechanisms to modularize them and reason about their correctness. The reasoning process is affected by the design decisions made by the developer of the program and by the features supported by the programming...
Show moreTo reason about a program means to state or conclude, by logical means, some properties the program exhibits; like its correctness according to certain expected behavior. The continuous need for more ambitious, more complex, and more dependable software systems demands for better mechanisms to modularize them and reason about their correctness. The reasoning process is affected by the design decisions made by the developer of the program and by the features supported by the programming language used. Beyond Object Orientation, Implicit Invocation and Aspect Oriented languages pose very hard reasoning challenges. Important tradeoffs must be considered while reasoning about a program: modular vs. non-modular reasoning, case-by-case analysis vs. abstraction, explicitness vs. implicitness; are some of them. By deciding a series of tradeoffs one can configure a reasoning scenario. For example if one decides for modular reasoning and explicit invocation a well-known object oriented reasoning scenario can be used.This dissertation identifies various important tradeoffs faced when reasoning about implicit invocation and aspect oriented programs, characterize scenarios derived from making choices regarding these tradeoffs, and provides sound proof rules for verification of programs covered by all these scenarios. Guidance for program developers and language designers is also given, so that reasoning about these types of programs becomes more tractable.
Show less - Date Issued
- 2015
- Identifier
- CFE0005706, ucf:50133
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0005706
- Title
- Value-of-Information based Data Collection in Underwater Sensor Networks.
- Creator
-
Khan, Fahad, Turgut, Damla, Yuksel, Murat, Behal, Aman, Bassiouni, Mostafa, Garibay, Ivan, University of Central Florida
- Abstract / Description
-
Underwater sensor networks are deployed in marine environments, presenting specific challenges compared to sensor networks deployed in terrestrial settings. Among the major issues that underwater sensor networks face is communication medium limitations that result in low bandwidth and long latency. This creates problems when these networks need to transmit large amounts of data over long distances. A possible solution to address this issue is to use mobile sinks such as autonomous underwater...
Show moreUnderwater sensor networks are deployed in marine environments, presenting specific challenges compared to sensor networks deployed in terrestrial settings. Among the major issues that underwater sensor networks face is communication medium limitations that result in low bandwidth and long latency. This creates problems when these networks need to transmit large amounts of data over long distances. A possible solution to address this issue is to use mobile sinks such as autonomous underwater vehicles (AUVs) to offload these large quantities of data. Such mobile sinks are called data mules. Often it is the case that a sensor network is deployed to report events that require immediate attention. Delays in reporting such events can have catastrophic consequences. In this dissertation, we present path planning algorithms that help in prioritizing data retrieval from sensor nodes in such a manner that nodes that require more immediate attention would be dealt with at the earliest. In other words, the goal is to improve the Quality of Information (QoI) retrieved. The path planning algorithms proposed in this dissertation are based on heuristics meant to improve the Value of Information (VoI) retrieved from a system. Value of information is a construct that helps in encoding the valuation of an information segment i.e. it is the price an optimal player would pay to obtain a segment of information in a game theoretic setting. Quality of information and value of information are complementary concepts. In this thesis, we formulate a value of information model for sensor networks and then consider the constraints that arise in underwater settings. On the basis of this, we develop a VoI-based path planning problem statement and propose heuristics that solve the path planning problem. We show through simulation studies that the proposed strategies improve the value, and hence, quality of the information retrieved. It is important to note that these path planning strategies can be applied equally well in terrestrial settings that deploy mobile sinks for data collection.
Show less - Date Issued
- 2019
- Identifier
- CFE0007476, ucf:52683
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0007476
- Title
- Autonomous Discovery and Maintenance of Mobile Frees-Space-Optical Links.
- Creator
-
Khan, Mahmudur, Yuksel, Murat, Pourmohammadi Fallah, Yaser, Ewetz, Rickard, Turgut, Damla, Nam, Boo Hyun, University of Central Florida
- Abstract / Description
-
Free-Space-Optical (FSO) communication has the potential to play a significant role in future generation wireless networks. It is advantageous in terms of improved spectrum utilization, higher data transfer rate, and lower probability of interception from unwanted sources. FSO communication can provide optical-level wireless communication speeds and can also help solve the wireless capacity problem experienced by the traditional RF-based technologies. Despite these advantages, communications...
Show moreFree-Space-Optical (FSO) communication has the potential to play a significant role in future generation wireless networks. It is advantageous in terms of improved spectrum utilization, higher data transfer rate, and lower probability of interception from unwanted sources. FSO communication can provide optical-level wireless communication speeds and can also help solve the wireless capacity problem experienced by the traditional RF-based technologies. Despite these advantages, communications using FSO transceivers require establishment and maintenance of line-of-sight (LOS). We consider autonomous mobile nodes (Unmanned Ground Vehicles or Unmanned Aerial Vehicles), each with one FSO transceiver mounted on a movable head capable of scanning in the horizontal and vertical planes. We propose novel schemes that deal with the problems of automatic discovery, establishment, and maintenance of LOS alignment between these nodes with mechanical steering of the directional FSO transceivers in 2-D and 3-D scenarios. We perform extensive simulations to show the effectiveness of the proposed methods for both neighbor discovery and LOS maintenance. We also present a prototype implementation of such mobile nodes with FSO transceivers. The potency of the neighbor discovery and LOS alignment protocols is evaluated by analyzing the results obtained from both simulations and experiments conducted using the prototype. The results show that, by using such mechanically steerable directional transceivers and the proposed methods, it is possible to establish optical wireless links within practical discovery times and maintain the links in a mobile setting with minimal disruption.
Show less - Date Issued
- 2018
- Identifier
- CFE0007575, ucf:52573
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0007575
- Title
- Masquerading Techniques in IEEE 802.11 Wireless Local Area Networks.
- Creator
-
Nakhila, Omar, Zou, Changchun, Turgut, Damla, Bassiouni, Mostafa, Chatterjee, Mainak, Wang, Chung-Ching, University of Central Florida
- Abstract / Description
-
The airborne nature of wireless transmission offers a potential target for attackers to compromise IEEE 802.11 Wireless Local Area Network (WLAN). In this dissertation, we explore the current WLAN security threats and their corresponding defense solutions. In our study, we divide WLAN vulnerabilities into two aspects, client, and administrator. The client-side vulnerability investigation is based on examining the Evil Twin Attack (ETA) while our administrator side research targets Wi-Fi...
Show moreThe airborne nature of wireless transmission offers a potential target for attackers to compromise IEEE 802.11 Wireless Local Area Network (WLAN). In this dissertation, we explore the current WLAN security threats and their corresponding defense solutions. In our study, we divide WLAN vulnerabilities into two aspects, client, and administrator. The client-side vulnerability investigation is based on examining the Evil Twin Attack (ETA) while our administrator side research targets Wi-Fi Protected Access II (WPA2). Three novel techniques have been presented to detect ETA. The detection methods are based on (1) creating a secure connection to a remote server to detect the change of gateway's public IP address by switching from one Access Point (AP) to another. (2) Monitoring multiple Wi-Fi channels in a random order looking for specific data packets sent by the remote server. (3) Merging the previous solutions into one universal ETA detection method using Virtual Wireless Clients (VWCs). On the other hand, we present a new vulnerability that allows an attacker to force the victim's smartphone to consume data through the cellular network by starting the data download on the victim's cell phone without the victim's permission. A new scheme has been developed to speed up the active dictionary attack intensity on WPA2 based on two novel ideas. First, the scheme connects multiple VWCs to the AP at the same time-each VWC has its own spoofed MAC address. Second, each of the VWCs could try many passphrases using single wireless session. Furthermore, we present a new technique to avoid bandwidth limitation imposed by Wi-Fi hotspots. The proposed method creates multiple VWCs to access the WLAN. The combination of the individual bandwidth of each VWC results in an increase of the total bandwidth gained by the attacker. All proposal techniques have been implemented and evaluated in real-life scenarios.
Show less - Date Issued
- 2018
- Identifier
- CFE0007063, ucf:51979
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0007063
- Title
- Bootstrapping Cognitive Radio Networks.
- Creator
-
Horine, Brent, Turgut, Damla, Wei, Lei, Boloni, Ladislau, Sukthankar, Gita, Garibay, Ivan, University of Central Florida
- Abstract / Description
-
Cognitive radio networks promise more efficient spectrum utilization by leveraging degrees of freedom and distributing data collection. The actual realization of these promises is challenged by distributed control, and incomplete, uncertain and possibly conflicting knowledge bases. We consider two problems in bootstrapping, evolving, and managing cognitive radio networks. The first is Link Rendezvous, or how separate radio nodes initially find each other in a spectrum band with many degrees...
Show moreCognitive radio networks promise more efficient spectrum utilization by leveraging degrees of freedom and distributing data collection. The actual realization of these promises is challenged by distributed control, and incomplete, uncertain and possibly conflicting knowledge bases. We consider two problems in bootstrapping, evolving, and managing cognitive radio networks. The first is Link Rendezvous, or how separate radio nodes initially find each other in a spectrum band with many degrees of freedom, and little shared knowledge. The second is how radio nodes can negotiate for spectrum access with incomplete information.To address the first problem, we present our Frequency Parallel Blind Link Rendezvous algorithm. This approach, designed for recent generations of digital front-ends, implicitly shares vague information about spectrum occupancy early in the process, speeding the progress towards a solution. Furthermore, it operates in the frequency domain, facilitating a parallel channel rendezvous. Finally, it operates without a control channel and can rendezvous anywhere in the operating band. We present simulations and analysis on the false alarm rate for both a feature detector and a cross-correlation detector. We compare our results to the conventional frequency hopping sequence rendezvous techniques.To address the second problem, we model the network as a multi-agent system and negotiate by exchanging proposals, augmented with arguments. These arguments include information about priority status and the existence of other nodes. We show in a variety of network topologies that this process leads to solutions not otherwise apparent to individual nodes, and achieves superior network throughput, request satisfaction, and total number of connections, compared to our baselines. The agents independently formulate proposals based upon communication desires, evaluate these proposals based upon capacity constraints, create arguments in response to proposal rejections, and re-evaluate proposals based upon received arguments. We present our negotiation rules, messages, and protocol and demonstrate how they interoperate in a simulation environment.
Show less - Date Issued
- 2012
- Identifier
- CFE0004546, ucf:49240
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0004546
- Title
- Networking and security solutions for VANET initial deployment stage.
- Creator
-
Aslam, Baber, Zou, Changchun, Turgut, Damla, Bassiouni, Mostafa, Wang, Chung-Ching, University of Central Florida
- Abstract / Description
-
Vehicular ad hoc network (VANET) is a special case of mobile networks, where vehicles equipped with computing/communicating devices (called (")smart vehicles(")) are the mobile wireless nodes. However, the movement pattern of these mobile wireless nodes is no more random, as in case of mobile networks, rather it is restricted to roads and streets. Vehicular networks have hybrid architecture; it is a combination of both infrastructure and infrastructure-less architectures. The direct vehicle...
Show moreVehicular ad hoc network (VANET) is a special case of mobile networks, where vehicles equipped with computing/communicating devices (called (")smart vehicles(")) are the mobile wireless nodes. However, the movement pattern of these mobile wireless nodes is no more random, as in case of mobile networks, rather it is restricted to roads and streets. Vehicular networks have hybrid architecture; it is a combination of both infrastructure and infrastructure-less architectures. The direct vehicle to vehicle (V2V) communication is infrastructure-less or ad hoc in nature. Here the vehicles traveling within communication range of each other form an ad hoc network. On the other hand, the vehicle to infrastructure (V2I) communication has infrastructure architecture where vehicles connect to access points deployed along roads. These access points are known as road side units (RSUs) and vehicles communicate with other vehicles/wired nodes through these RSUs. To provide various services to vehicles, RSUs are generally connected to each other and to the Internet. The direct RSU to RSU communication is also referred as I2I communication. The success of VANET depends on the existence of pervasive roadside infrastructure and sufficient number of smart vehicles. Most VANET applications and services are based on either one or both of these requirements. A fully matured VANET will have pervasive roadside network and enough vehicle density to enable VANET applications. However, the initial deployment stage of VANET will be characterized by the lack of pervasive roadside infrastructure and low market penetration of smart vehicles. It will be economically infeasible to initially install a pervasive and fully networked roadside infrastructure, which could result in the failure of applications and services that depend on V2I or I2I communications. Further, low market penetration means there are insufficient number of smart vehicles to enable V2V communication, which could result in failure of services and applications that depend on V2V communications. Non-availability of pervasive connectivity to certification authorities and dynamic locations of each vehicle will make it difficult and expensive to implement security solutions that are based on some central certificate management authority. Non-availability of pervasive connectivity will also affect the backend connectivity of vehicles to the Internet or the rest of the world. Due to economic considerations, the installation of roadside infrastructure will take a long time and will be incremental thus resulting in a heterogeneous infrastructure with non-consistent capabilities. Similarly, smart vehicles will also have varying degree of capabilities. This will result in failure of applications and services that have very strict requirements on V2I or V2V communications. We have proposed several solutions to overcome the challenges described above that will be faced during the initial deployment stage of VANET. Specifically, we have proposed: 1) a VANET architecture that can provide services with limited number of heterogeneous roadside units and smart vehicles with varying capabilities, 2) a backend connectivity solution that provides connectivity between the Internet and smart vehicles without requiring pervasive roadside infrastructure or large number of smart vehicles, 3) a security architecture that does not depend on pervasive roadside infrastructure or a fully connected V2V network and fulfills all the security requirements, and 4) optimization solutions for placement of a limited number of RSUs within a given area to provide best possible service to smart vehicles. The optimal placement solutions cover both urban areas and highways environments.
Show less - Date Issued
- 2012
- Identifier
- CFE0004186, ucf:48993
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0004186
- Title
- Data-driven Predictive Analytics For Distributed Smart Grid Control: Optimization of Energy Storage, Voltage and Demand Response.
- Creator
-
Valizadehhaghi, Hamed, Qu, Zhihua, Behal, Aman, Atia, George, Turgut, Damla, Pensky, Marianna, University of Central Florida
- Abstract / Description
-
The smart grid is expected to support an interconnected network of self-contained microgrids. Nonetheless, the distributed integration of renewable generation and demand response adds complexity to the control and optimization of smart grid. Forecasts are essential due to the existence of stochastic variations and uncertainty. Forecasting data are spatio-temporal which means that the data correspond to regular intervals, say every hour, and the analysis has to take account of spatial...
Show moreThe smart grid is expected to support an interconnected network of self-contained microgrids. Nonetheless, the distributed integration of renewable generation and demand response adds complexity to the control and optimization of smart grid. Forecasts are essential due to the existence of stochastic variations and uncertainty. Forecasting data are spatio-temporal which means that the data correspond to regular intervals, say every hour, and the analysis has to take account of spatial dependence among the distributed generators or locations. Hence, smart grid operations must take account of, and in fact benefit from the temporal dependence as well as the spatial dependence. This is particularly important considering the buffering effect of energy storage devices such as batteries, heating/cooling systems and electric vehicles. The data infrastructure of smart grid is the key to address these challenges, however, how to utilize stochastic modeling and forecasting tools for optimal and reliable planning, operation and control of smart grid remains an open issue.Utilities are seeking to become more proactive in decision-making, adjusting their strategies based on realistic predictive views into the future, thus allowing them to side-step problems and capitalize on the smart grid technologies, such as energy storage, that are now being deployed atscale. Predictive analytics, capable of managing intermittent loads, renewables, rapidly changing weather patterns and other grid conditions, represent the ultimate goal for smart grid capabilities.Within this framework, this dissertation develops high-performance analytics, such as predictive analytics, and ways of employing analytics to improve distributed and cooperative optimization software which proves to be the most significant value-add in the smart grid age, as new network management technologies prove reliable and fundamental. Proposed optimization and control approaches for active and reactive power control are robust to variations and offer a certain level of optimality by combining real-time control with hours-ahead network operation schemes. The main objective is managing spatial and temporal availability of the energy resources in different look-ahead time horizons. Stochastic distributed optimization is realized by integrating a distributed sub-gradient method with conditional ensemble predictions of the energy storage capacity and distributed generation. Hence, the obtained solutions can reflect on the system requirements for the upcoming times along with the instantaneous cooperation between distributed resources. As an important issue for smart grid, the conditional ensembles are studied for capturing wind, photovoltaic, and vehicle-to-grid availability variations. The following objectives are pursued:- Spatio-temporal adaptive modeling of data including electricity demand, electric vehicles and renewable energy (wind and solar power)- Predictive data analytics and forecasting- Distributed control- Integration of energy storage systemsFull distributional characterization and spatio-temporal modeling of data ensembles are utilized in order to retain the conditional and temporal interdependence between projection data and available capacity. Then, by imposing measures of the most likely ensembles, the distributed control method is carried out for cooperative optimization of the renewable generation and energy storage within the smart grid.
Show less - Date Issued
- 2016
- Identifier
- CFE0006408, ucf:51481
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0006408
- Title
- Applied Advanced Error Control Coding for General Purpose Representation and Association Machine Systems.
- Creator
-
Dai, Bowen, Wei, Lei, Lin, Mingjie, Rahnavard, Nazanin, Turgut, Damla, Sun, Qiyu, University of Central Florida
- Abstract / Description
-
General-Purpose Representation and Association Machine (GPRAM) is proposed to be focusing on computations in terms of variation and flexibility, rather than precision and speed. GPRAM system has a vague representation and has no predefined tasks. With several important lessons learned from error control coding, neuroscience and human visual system, we investigate several types of error control codes, including Hamming code and Low-Density Parity Check (LDPC) codes, and extend them to...
Show moreGeneral-Purpose Representation and Association Machine (GPRAM) is proposed to be focusing on computations in terms of variation and flexibility, rather than precision and speed. GPRAM system has a vague representation and has no predefined tasks. With several important lessons learned from error control coding, neuroscience and human visual system, we investigate several types of error control codes, including Hamming code and Low-Density Parity Check (LDPC) codes, and extend them to different directions.While in error control codes, solely XOR logic gate is used to connect different nodes. Inspired by bio-systems and Turbo codes, we suggest and study non-linear codes with expanded operations, such as codes including AND and OR gates which raises the problem of prior-probabilities mismatching. Prior discussions about critical challenges in designing codes and iterative decoding for non-equiprobable symbols may pave the way for a more comprehensive understanding of bio-signal processing. The limitation of XOR operation in iterative decoding with non-equiprobable symbols is described and can be potentially resolved by applying quasi-XOR operation and intermediate transformation layer. Constructing codes for non-equiprobable symbols with the former approach cannot satisfyingly perform with regarding to error correction capability. Probabilistic messages for sum-product algorithm using XOR, AND, and OR operations with non-equiprobable symbols are further computed. The primary motivation for the constructing codes is to establish the GPRAM system rather than to conduct error control coding per se. The GPRAM system is fundamentally developed by applying various operations with substantial over-complete basis. This system is capable of continuously achieving better and simpler approximations for complex tasks.The approaches of decoding LDPC codes with non-equiprobable binary symbols are discussed due to the aforementioned prior-probabilities mismatching problem. The traditional Tanner graph should be modified because of the distinction of message passing to information bits and to parity check bits from check nodes. In other words, the message passing along two directions are identical in conventional Tanner graph, while the message along the forward direction and backward direction are different in our case. A method of optimizing signal constellation is described, which is able to maximize the channel mutual information.A simple Image Processing Unit (IPU) structure is proposed for GPRAM system, to which images are inputted. The IPU consists of a randomly constructed LDPC code, an iterative decoder, a switch, and scaling and decision device. The quality of input images has been severely deteriorated for the purpose of mimicking visual information variability (VIV) experienced in human visual systems. The IPU is capable of (a) reliably recognizing digits from images of which quality is extremely inadequate; (b) achieving similar hyper-acuity performance comparing to human visual system; and (c) significantly improving the recognition rate with applying randomly constructed LDPC code, which is not specifically optimized for the tasks.
Show less - Date Issued
- 2016
- Identifier
- CFE0006449, ucf:51413
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0006449
- Title
- Techniques for automated parameter estimation in computational models of probabilistic systems.
- Creator
-
Hussain, Faraz, Jha, Sumit, Leavens, Gary, Turgut, Damla, Uddin, Nizam, University of Central Florida
- Abstract / Description
-
The main contribution of this dissertation is the design of two new algorithms for automatically synthesizing values of numerical parameters of computational models of complexstochastic systems such that the resultant model meets user-specified behavioral specifications.These algorithms are designed to operate on probabilistic systems (-) systems that, in general,behave differently under identical conditions. The algorithms work using an approach thatcombines formal verification and...
Show moreThe main contribution of this dissertation is the design of two new algorithms for automatically synthesizing values of numerical parameters of computational models of complexstochastic systems such that the resultant model meets user-specified behavioral specifications.These algorithms are designed to operate on probabilistic systems (-) systems that, in general,behave differently under identical conditions. The algorithms work using an approach thatcombines formal verification and mathematical optimization to explore a model's parameterspace.The problem of determining whether a model instantiated with a given set of parametervalues satisfies the desired specification is first defined using formal verification terminology,and then reformulated in terms of statistical hypothesis testing. Parameter space explorationinvolves determining the outcome of the hypothesis testing query for each parameter pointand is guided using simulated annealing. The first algorithm uses the sequential probabilityratio test (SPRT) to solve the hypothesis testing problems, whereas the second algorithmuses an approach based on Bayesian statistical model checking (BSMC).The SPRT-based parameter synthesis algorithm was used to validate that a given model ofglucose-insulin metabolism has the capability of representing diabetic behavior by synthesizingvalues of three parameters that ensure that the glucose-insulin subsystem spends at least 20minutes in a diabetic scenario. The BSMC-based algorithm was used to discover the valuesof parameters in a physiological model of the acute inflammatory response that guarantee aset of desired clinical outcomes.These two applications demonstrate how our algorithms use formal verification, statisticalhypothesis testing and mathematical optimization to automatically synthesize parameters ofcomplex probabilistic models in order to meet user-specified behavioral properties
Show less - Date Issued
- 2016
- Identifier
- CFE0006117, ucf:51200
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0006117
- Title
- Opportunistic Spectrum Utilization by Cognitive Radio Networks: Challenges and Solutions.
- Creator
-
Amjad, Muhammad Faisal, Zou, Changchun, Bassiouni, Mostafa, Turgut, Damla, Wang, Chung-Ching, University of Central Florida
- Abstract / Description
-
Cognitive Radio Network (CRN) is an emerging paradigm that makes use of Dynamic Spectrum Access (DSA) to communicate opportunistically, in the un-licensed Industrial, Scientific and Medical bands or frequency bands otherwise licensed to incumbent users such as TV broadcast. Interest in the development of CRNs is because of severe under-utilization of spectrum bands by the incumbent Primary Users (PUs) that have the license to use them coupled with an ever-increasing demand for unlicensed...
Show moreCognitive Radio Network (CRN) is an emerging paradigm that makes use of Dynamic Spectrum Access (DSA) to communicate opportunistically, in the un-licensed Industrial, Scientific and Medical bands or frequency bands otherwise licensed to incumbent users such as TV broadcast. Interest in the development of CRNs is because of severe under-utilization of spectrum bands by the incumbent Primary Users (PUs) that have the license to use them coupled with an ever-increasing demand for unlicensed spectrum for a variety of new mobile and wireless applications. The essence of Cognitive Radio (CR) operation is the cooperative and opportunistic utilization of licensed spectrum bands by the Secondary Users (SUs) that collectively form the CRN without causing any interference to PUs' communications.CRN operation is characterized by factors such as network-wide quiet periods for cooperative spectrum sensing, opportunistic/dynamic spectrum access and non-deterministic operation of PUs. These factors can have a devastating impact on the overall throughput and can significantly increase the control overheads. Therefore, to support the same level of QoS as traditional wireless access technologies, very closer interaction is required between layers of the protocol stack.Opportunistic spectrum utilization without causing interference to the PUs is only possible if the SUs periodically sense the spectrum for the presence of PUs' signal. To minimize the effects of hardware capabilities, terrain features and PUs' transmission ranges, DSA is undertaken in a collaborative manner where SUs periodically carry out spectrum sensing in their respective geographical locations. Collaborative spectrum sensing has numerous security loopholes and canbe favorable to malicious nodes in the network that may exploit vulnerabilities associated with DSA such as launching a spectrum sensing data falsification (SSDF) attack. Some CRN standards such as the IEEE 802.22 wireless regional area network employ a two-stage quiet period mechanism based on a mandatory Fast Sensing and an optional Fine Sensing stage for DSA. This arrangement is meant to strike a balance between the conflicting goals of proper protection of incumbent PUs' signals and optimum QoS for SUs so that only as much time is spent for spectrum sensing as needed. Malicious nodes in the CRN however, can take advantage of the two-stage spectrum sensing mechanism to launch smart denial of service (DoS) jamming attacks on CRNs during the fast sensing stage.Coexistence protocols enable collocated CRNs to contend for and share the available spectrum. However, most coexistence protocols do not take into consideration the fact that channels of the available spectrum can be heterogeneous in the sense that they can vary in their characteristics and quality such as SNR or bandwidth. Without any mechanism to enforce fairness in accessing varying quality channels, ensuring coexistence with minimal contention and efficient spectrum utilization for CRNs is likely to become a very difficult task.The cooperative and opportunistic nature of communication has many challenges associated with CRNs' operation. In view of the challenges described above, this dissertation presents solutions including cross-layer approaches, reputation system, optimization and game theoretic approaches to handle (1) degradation in TCP's throughput resulting from packet losses and disruptions in spectrum availability due non-deterministic use of spectrum by the PUs (2) presence of malicious SUs in the CRN that may launch various attacks on CRNs' includingSSDF and jamming and (3) sharing of heterogeneous spectrum resources among collocated CRNs without a centralized mechanism to enforce cooperation among otherwise non-cooperative CRNs
Show less - Date Issued
- 2015
- Identifier
- CFE0005571, ucf:50249
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0005571
- Title
- Information Propagation Algorithms for Consensus Formation in Decentralized Multi-Agent Systems.
- Creator
-
Hollander, Christopher, Wu, Annie, Shumaker, Randall, Wiegand, Rudolf, Turgut, Damla, Song, Zixia, University of Central Florida
- Abstract / Description
-
Consensus occurs within a multi-agent system when every agent is in agreement about the value of some particular state. For example, the color of an LED, the position or magnitude of a vector, a rendezvous location, the most recent state of data within a database, or the identity of a leader are all states that agents might need to agree on in order to execute their tasking.The task of the decentralized consensus problem for multi-agent systems is to design an algorithm that enables agents to...
Show moreConsensus occurs within a multi-agent system when every agent is in agreement about the value of some particular state. For example, the color of an LED, the position or magnitude of a vector, a rendezvous location, the most recent state of data within a database, or the identity of a leader are all states that agents might need to agree on in order to execute their tasking.The task of the decentralized consensus problem for multi-agent systems is to design an algorithm that enables agents to communicate and exchange information such that, in finite time, agents are able to form a consensus without the use of a centralized control mechanism. The primary goal of this research is to introduce and provide supporting evidence for Stochastic Local Observation/Gossip (SLOG) algorithms as a new class of solutions to the decentralized consensus problem for multi-agent systems that lack a centralized controller, with the additional constraints that agents act asynchronously, information is discrete, and all consensus options are equally preferable to all agents. Examples of where these constraints might apply include the spread of social norms and conventions in artificial populations, rendezvous among a set of specific locations, and task assignment.This goal is achieved through a combination of theory and experimentation. Information propagation process and an information propagation algorithm are derived by unifying the general structure of multiple existing solutions to the decentralized consensus problem. They are then used to define two classes of algorithms that spread information across a network and solve the decentralized consensus problem: buffered gossip algorithms and local observation algorithms. Buffered gossip algorithms generalize the behavior of many push-based solutions to the decentralized consensus problem. Local observation algorithms generalize the behavior of many pull-based solutions to the decentralized consensus problem. In the language of object oriented design, buffered gossip algorithms and local observation algorithms are abstract classes; information propagation processes are interfaces. SLOG algorithms combine the transmission mechanisms of buffered gossip algorithms and local observation algorithms into a single "hybrid" algorithm that is able to push and pull information within the local neighborhood. A common mathematical framework is constructed and used to determine the conditions under which each of these algorithms are guaranteed to produce a consensus, and thus solve the decentralized consensus problem. Finally, a series of simulation experiments are conducted to study the performance of SLOG algorithms. These experiments compare the average speed of consensus formation between buffered gossip algorithms, local observation algorithms, and SLOG algorithms over four distinct network topologies.Beyond the introduction of the SLOG algorithm, this research also contributes to the existing literature on the decentralized consensus problem by: specifying a theoretical framework that can be used to explore the consensus behavior of push-based and pull-based information propagation algorithms; using this framework to define buffered gossip algorithms and local observation algorithms as generalizations for existing solutions to the decentralized consensus problem; highlighting the similarities between consensus algorithms within control theory and opinion dynamics within computational sociology, and showing how these research areas can be successfully combined to create new and powerful algorithms; and providing an empirical comparison between multiple information propagation algorithms.
Show less - Date Issued
- 2015
- Identifier
- CFE0005629, ucf:50229
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0005629
- Title
- Mathematical and Computational Methods for Freeform Optical Shape Description.
- Creator
-
Kaya, Ilhan, Foroosh, Hassan, Rolland, Jannick, Turgut, Damla, Thompson, Kevin, Ilegbusi, Olusegun, University of Central Florida
- Abstract / Description
-
Slow-servo single-point diamond turning as well as advances in computer controlled small lap polishing enable the fabrication of freeform optics, specifically, optical surfaces for imaging applications that are not rotationally symmetric. Freeform optical elements will have a profound importance in the future of optical technology. Orthogonal polynomials added onto conic sections have been extensively used to describe optical surface shapes. The optical testing industry has chosen to...
Show moreSlow-servo single-point diamond turning as well as advances in computer controlled small lap polishing enable the fabrication of freeform optics, specifically, optical surfaces for imaging applications that are not rotationally symmetric. Freeform optical elements will have a profound importance in the future of optical technology. Orthogonal polynomials added onto conic sections have been extensively used to describe optical surface shapes. The optical testing industry has chosen to represent the departure of a wavefront under test from a reference sphere in terms of orthogonal ?-polynomials, specifically Zernike polynomials. Various forms of polynomials for describing freeform optical surfaces may be considered, however, both in optical design and in support of fabrication. More recently, radial basis functions were also investigated for optical shape description. In the application of orthogonal ?-polynomials to optical freeform shape description, there are important limitations, such as the number of terms required as well as edge-ringing and ill-conditioning in representing the surface with the accuracy demanded by most stringent optics applications. The first part of this dissertation focuses upon describing freeform optical surfaces with ? polynomials and shows their limitations when including higher orders together with possible remedies. We show that a possible remedy is to use edge clustered-fitting grids. Provided different grid types, we furthermore compared the efficacy of using different types of ? polynomials, namely Zernike and gradient orthogonal Q polynomials. In the second part of this thesis, a local, efficient and accurate hybrid method is developed in order to greatly reduce the order of polynomial terms required to achieve higher level of accuracy in freeform shape description that were shown to require thousands of terms including many higher order terms under prior art. This comes at the expense of multiple sub-apertures, and as such computational methods may leverage parallel processing. This new method combines the assets of both radial basis functions and orthogonal phi-polynomials for freeform shape description and is uniquely applicable across any aperture shape due to its locality and stitching principles. Finally in this thesis, in order to comprehend the possible advantages of parallel computing for optical surface descriptions, the benefits of making an effective use of impressive computational power offered by multi-core platforms for the computation of ?-polynomials are investigated. The ?-polynomials, specifically Zernike and gradient orthogonal Q-polynomials, are implemented with a set of recurrence based parallel algorithms on Graphics Processing Units (GPUs). The results show that more than an order of magnitude speedup is possible in the computation of ?-polynomials over a sequential implementation if the recurrence based parallel algorithms are adopted.
Show less - Date Issued
- 2013
- Identifier
- CFE0005012, ucf:49993
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0005012
- Title
- Routing, Localization and Positioning Protocols for Wireless Sensor and Actor Networks.
- Creator
-
Akbas, Mustafa, Turgut, Damla, Boloni, Ladislau, Georgiopoulos, Michael, Brust, Matthias, Bassiouni, Mostafa, Zhao, Yue, University of Central Florida
- Abstract / Description
-
Wireless sensor and actor networks (WSANs) are distributed systems of sensor nodes and actors that are interconnected over the wireless medium. Sensor nodes collect information about the physical world and transmit the data to actors by using one-hop or multi-hop communications. Actors collect information from the sensor nodes, process the information, take decisions and react to the events.This dissertation presents contributions to the methods of routing, localization and positioning in...
Show moreWireless sensor and actor networks (WSANs) are distributed systems of sensor nodes and actors that are interconnected over the wireless medium. Sensor nodes collect information about the physical world and transmit the data to actors by using one-hop or multi-hop communications. Actors collect information from the sensor nodes, process the information, take decisions and react to the events.This dissertation presents contributions to the methods of routing, localization and positioning in WSANs for practical applications. We first propose a routing protocol with service differentiation for WSANs with stationary nodes. In this setting, we also adapt a sports ranking algorithm to dynamically prioritize the events in the environment depending on the collected data. We extend this routing protocol for an application, in which sensor nodes float in a river to gather observations and actors are deployed at accessible points on the coastline. We develop a method with locally acting adaptive overlay network formation to organize the network with actor areas and to collect data by using locality-preserving communication.We also present a multi-hop localization approach for enriching the information collected from the river with the estimated locations of mobile sensor nodes without using positioning adapters. As an extension to this application, we model the movements of sensor nodes by a subsurface meandering current mobility model with random surface motion. Then we adapt the introduced routing and network organization methods to model a complete primate monitoring system. A novel spatial cut-off preferential attachment model and center of mass concept are developed according to the characteristics of the primate groups. We also present a role determination algorithm for primates, which uses the collection of spatial-temporal relationships. We apply a similar approach to human social networks to tackle the problem of automatic generation and organization of social networks by analyzing and assessing interaction data. The introduced routing and localization protocols in this dissertation are also extended with a novel three dimensional actor positioning strategy inspired by the molecular geometry. Extensive simulations are conducted in OPNET simulation tool for the performance evaluation of the proposed protocols.
Show less - Date Issued
- 2013
- Identifier
- CFE0005292, ucf:50564
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0005292
- Title
- Exploring Techniques for Providing Privacy in Location-Based Services Nearest Neighbor Query.
- Creator
-
Asanya, John-Charles, Guha, Ratan, Turgut, Damla, Bassiouni, Mostafa, Zou, Changchun, Mohapatra, Ram, University of Central Florida
- Abstract / Description
-
Increasing numbers of people are subscribing to location-based services, but as the popularity grows so are the privacy concerns. Varieties of research exist to address these privacy concerns. Each technique tries to address different models with which location-based services respond to subscribers. In this work, we present ideas to address privacy concerns for the two main models namely: the snapshot nearest neighbor query model and the continuous nearest neighbor query model. First, we...
Show moreIncreasing numbers of people are subscribing to location-based services, but as the popularity grows so are the privacy concerns. Varieties of research exist to address these privacy concerns. Each technique tries to address different models with which location-based services respond to subscribers. In this work, we present ideas to address privacy concerns for the two main models namely: the snapshot nearest neighbor query model and the continuous nearest neighbor query model. First, we address snapshot nearest neighbor query model where location-based services response represents a snapshot of point in time. In this model, we introduce a novel idea based on the concept of an open set in a topological space where points belongs to a subset called neighborhood of a point. We extend this concept to provide anonymity to real objects where each object belongs to a disjointed neighborhood such that each neighborhood contains a single object. To help identify the objects, we implement a database which dynamically scales in direct proportion with the size of the neighborhood. To retrieve information secretly and allow the database to expose only requested information, private information retrieval protocols are executed twice on the data. Our study of the implementation shows that the concept of a single object neighborhood is able to efficiently scale the database with the objects in the area.The size of the database grows with the size of the grid and the objects covered by the location-based services. Typically, creating neighborhoods, computing distances between objects in the area, and running private information retrieval protocols causes the CPU to respond slowly with this increase in database size. In order to handle a large number of objects, we explore the concept of kernel and parallel computing in GPU. We develop GPU parallel implementation of the snapshot query to handle large number of objects. In our experiment, we exploit parameter tuning. The results show that with parameter tuning and parallel computing power of GPU we are able to significantly reduce the response time as the number of objects increases. To determine response time of an application without knowledge of the intricacies of GPU architecture, we extend our analysis to predict GPU execution time. We develop the run time equation for an operation and extrapolate the run time for a problem set based on the equation, and then we provide a model to predict GPU response time.As an alternative, the snapshot nearest neighbor query privacy problem can be addressed using secure hardware computing which can eliminate the need for protecting the rest of the sub-system, minimize resource usage and network transmission time. In this approach, a secure coprocessor is used to provide privacy. We process all information inside the coprocessor to deny adversaries access to any private information. To obfuscate access pattern to external memory location, we use oblivious random access memory methodology to access the server. Experimental evaluation shows that using a secure coprocessor reduces resource usage and query response time as the size of the coverage area and objects increases.Second, we address privacy concerns in the continuous nearest neighbor query model where location-based services automatically respond to a change in object's location. In this model, we present solutions for two different types known as moving query static object and moving query moving object. For the solutions, we propose plane partition using a Voronoi diagram, and a continuous fractal space filling curve using a Hilbert curve order to create a continuous nearest neighbor relationship between the points of interest in a path. Specifically, space filling curve results in multi-dimensional to 1-dimensional object mapping where values are assigned to the objects based on proximity. To prevent subscribers from issuing a query each time there is a change in location and to reduce the response time, we introduce the concept of transition and update time to indicate where and when the nearest neighbor changes. We also introduce a database that dynamically scales with the size of the objects in a path to help obscure and relate objects. By executing the private information retrieval protocol twice on the data, the user secretly retrieves requested information from the database. The results of our experiment show that using plane partitioning and a fractal space filling curve to create nearest neighbor relationships with transition time between objects reduces the total response time.
Show less - Date Issued
- 2015
- Identifier
- CFE0005757, ucf:50098
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0005757
- Title
- Quantifying Trust and Reputation for Defense against Adversaries in Multi-Channel Dynamic Spectrum Access Networks.
- Creator
-
Bhattacharjee, Shameek, Chatterjee, Mainak, Guha, Ratan, Zou, Changchun, Turgut, Damla, Catbas, Necati, University of Central Florida
- Abstract / Description
-
Dynamic spectrum access enabled by cognitive radio networks are envisioned to drivethe next generation wireless networks that can increase spectrum utility by opportunisticallyaccessing unused spectrum. Due to the policy constraint that there could be no interferenceto the primary (licensed) users, secondary cognitive radios have to continuously sense forprimary transmissions. Typically, sensing reports from multiple cognitive radios are fusedas stand-alone observations are prone to errors...
Show moreDynamic spectrum access enabled by cognitive radio networks are envisioned to drivethe next generation wireless networks that can increase spectrum utility by opportunisticallyaccessing unused spectrum. Due to the policy constraint that there could be no interferenceto the primary (licensed) users, secondary cognitive radios have to continuously sense forprimary transmissions. Typically, sensing reports from multiple cognitive radios are fusedas stand-alone observations are prone to errors due to wireless channel characteristics. Suchdependence on cooperative spectrum sensing is vulnerable to attacks such as SecondarySpectrum Data Falsification (SSDF) attacks when multiple malicious or selfish radios falsifythe spectrum reports. Hence, there is a need to quantify the trustworthiness of radios thatshare spectrum sensing reports and devise malicious node identification and robust fusionschemes that would lead to correct inference about spectrum usage.In this work, we propose an anomaly monitoring technique that can effectively cap-ture anomalies in the spectrum sensing reports shared by individual cognitive radios duringcooperative spectrum sensing in a multi-channel distributed network. Such anomalies areused as evidence to compute the trustworthiness of a radio by its neighbours. The proposedanomaly monitoring technique works for any density of malicious nodes and for any physicalenvironment. We propose an optimistic trust heuristic for a system with a normal risk attitude and show that it can be approximated as a beta distribution. For a more conservativesystem, we propose a multinomial Dirichlet distribution based conservative trust framework,where Josang's Belief model is used to resolve any uncertainty in information that mightarise during anomaly monitoring. Using a machine learning approach, we identify maliciousnodes with a high degree of certainty regardless of their aggressiveness and variations intro-duced by the pathloss environment. We also propose extensions to the anomaly monitoringtechnique that facilitate learning about strategies employed by malicious nodes and alsoutilize the misleading information they provide. We also devise strategies to defend against a collaborative SSDF attack that islaunched by a coalition of selfish nodes. Since, defense against such collaborative attacks isdifficult with popularly used voting based inference models or node centric isolation techniques, we propose a channel centric Bayesian inference approach that indicates how much the collective decision on a channels occupancy inference can be trusted. Based on the measured observations over time, we estimate the parameters of the hypothesis of anomalous andnon-anomalous events using a multinomial Bayesian based inference. We quantitatively define the trustworthiness of a channel inference as the difference between the posterior beliefsassociated with anomalous and non-anomalous events. The posterior beliefs are updated based on a weighted average of the prior information on the belief itself and the recently observed data.Subsequently, we propose robust fusion models which utilize the trusts of the nodes to improve the accuracy of the cooperative spectrum sensing decisions. In particular, we propose three fusion models: (i) optimistic trust based fusion, (ii) conservative trust based fusion, and (iii) inversion based fusion. The former two approaches exclude untrustworthy sensing reports for fusion, while the last approach utilizes misleading information. Allschemes are analyzed under various attack strategies. We propose an asymmetric weightedmoving average based trust management scheme that quickly identifies on-off SSDF attacks and prevents quick trust redemption when such nodes revert back to temporal honest behavior. We also provide insights on what attack strategies are more effective from the adversaries' perspective.Through extensive simulation experiments we show that the trust models are effective in identifying malicious nodes with a high degree of certainty under variety of network and radio conditions. We show high true negative detection rates even when multiple malicious nodes launch collaborative attacks which is an improvement over existing voting based exclusion and entropy divergence techniques. We also show that we are able to improve the accuracy of fusion decisions compared to other popular fusion techniques. Trust based fusion schemes show worst case decision error rates of 5% while inversion based fusion show 4% as opposed majority voting schemes that have 18% error rate. We also show that the proposed channel centric Bayesian inference based trust model is able to distinguish between attacked and non-attacked channels for both static and dynamic collaborative attacks. We are also able to show that attacked channels have significantly lower trust values than channels that are not(-) a metric that can be used by nodes to rank the quality of inference on channels.
Show less - Date Issued
- 2015
- Identifier
- CFE0005764, ucf:50081
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0005764