National Library of Energy BETA

Sample records for ad hoc query

  1. SQL is Dead; Long Live SQL: Lightweight Query Services for Ad Hoc Research Data

    E-Print Network [OSTI]

    Matrajt, Graciela

    SQL is Dead; Long Live SQL: Lightweight Query Services for Ad Hoc Research Data Bill Howe billhowe with ad hoc scientific Q&A. Further: · We reject the conventional wisdom that "scientists won't write SQL a production-quality database server. · We observe that simply sharing examples of SQL queries allows

  2. Ad Hoc Curriculum Implementation Working Group Ad Hoc Working Group

    E-Print Network [OSTI]

    Brown, Sally

    Ad Hoc Curriculum Implementation Working Group MINUTES Ad Hoc Working Group 4 December 2002 Friedman on her visit next week. ONE CURRICULUM OR TWO? Information presented by Trudeau shows that PSE and other programs cannot be merged into a single curriculum. The Faculty Senate website states

  3. An Energy Efficient Location Service for Mobile Ad Hoc etworks

    E-Print Network [OSTI]

    Varela, Carlos

    the distance traveled by the location update and query packets and, thus, at reducing the overall energy cost by the location update and query packets and, thus, to reduce the overall energy cost. 2 Energy Efficient LocationAn Energy Efficient Location Service for Mobile Ad Hoc etworks Zijian Wang1 , Eyuphan Bulut1

  4. Reverse Nearest Neighbors Search in Ad-hoc Subspaces Man Lung Yiu

    E-Print Network [OSTI]

    Mamoulis, Nikos

    Reverse Nearest Neighbors Search in Ad-hoc Subspaces Man Lung Yiu Department of Computer Science, H.2.4.h Query processing, H.2.4.k Spatial databases Contact Author: Man Lung Yiu Department

  5. Adaptive Scheduling in Ad Hoc and Cellular Wireless Networks

    E-Print Network [OSTI]

    Tan, Choo Chin

    2013-01-01

    multicasting in energy-constrained wireless networks,” IEEEminimum-energy multicasting in wireless ad hoc networks,”minimum-energy multicasting in wireless ad hoc networks,” in

  6. Xerox Palo Alto Research Center Technical Report P2001-10113, May 2001. Revised July 25, 2001. Scalable Information-Driven Sensor Querying and Routing for ad hoc

    E-Print Network [OSTI]

    Zhao, Feng

    battery power, frequent node attrition, and variable data and communication quality. To scale up, California 94304, U.S.A. Abstract This paper describes two novel techniques, information-driven sensor that the information-driven querying and routing techniques are more energy efficient, have lower detection latency

  7. Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Liang, Weifa

    Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks Weifa Liang, Senior Member, IEEE Abstract--A wireless ad hoc network consists of mobile nodes that are equipped with energy on energy conservation in wireless ad hoc networks have been conducted. For example, energy efficient

  8. Low-Interference Topology Control for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Li, Xiang-Yang

    wireless ad hoc networks. Many aspects of the networking will affect the energy consumption of the wireless may cause larger energy consumption. In wireless ad hoc networks, each wireless device can selectively1 Low-Interference Topology Control for Wireless Ad Hoc Networks Kousha Moaveni-Nejad, Xiang

  9. LEARNING-BASED ROUTE MANAGEMENT IN WIRELESS AD HOC NETWORKS

    E-Print Network [OSTI]

    Littman, Michael L.

    and Wade Trappe The nodes in a wireless ad hoc network must act as routers in a self-configuring network to shortest-path routing protocols for managing router congestion and noise in wireless ad hoc networks. iiLEARNING-BASED ROUTE MANAGEMENT IN WIRELESS AD HOC NETWORKS BY BRIAN RUSSELL A dissertation

  10. Enhancing Cellular Multicast Performance Using Ad Hoc Networks

    E-Print Network [OSTI]

    Kasera, Sneha Kumar

    Enhancing Cellular Multicast Performance Using Ad Hoc Networks Jun Cheol Park and Sneha Kumar heterogeneity problem in cellular multicast with the help of an additional IEEE 802.11 ad hoc network. The basic idea is to allow the cellular receivers experiencing poor channel conditions to use the ad hoc network

  11. Maximizing Battery Life Routing in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Liang, Weifa

    Maximizing Battery Life Routing in Wireless Ad Hoc Networks Weifa Liang Department of Computer Abstract--Most wireless ad hoc networks consist of mobile devices which operate on batteries. Power con, for an ad hoc network consisting of the same type of battery mobile nodes, two approximation algorithms

  12. Adaptive Scheduling in Ad Hoc and Cellular Wireless Networks

    E-Print Network [OSTI]

    Tan, Choo Chin

    2013-01-01

    organization wireless networks and wireless mobile ad-hocfor heterogeneous wireless network”, in Proc. of IEEER. Khalaf, “Ad hoc wireless networks with mobile backbones,”

  13. Distributed services for mobile ad hoc networks 

    E-Print Network [OSTI]

    Cao, Guangtong

    2005-11-01

    by equipping each node with a device like a GPS receiver, a GPS receiver?s functionality is limited due to its geographical constraints, high energy consumption and cost. Therefore, studying clock synchronization algorithms for mobile ad hoc networks has 7... Network Lifetime vs. Number of Nodes : : : : : : : : : : : : : : : : : 61 24 Standard Deviation of Remaining Energy vs. Number of Nodes : : : 63 25 The k-Mutual Exclusion System Architecture : : : : : : : : : : : : : 71 26 Operation of KRL Algorithm on a...

  14. DataCentric Routing for Mobile Ad Hoc Networks Edward Woodrow

    E-Print Network [OSTI]

    Heinzelman, Wendi

    networks that support efficient data and route discovery based on metadata queries. Most ad hoc routing SPIN­IT (Sensor Protocols for Information via Negotiation ­ Information Transfer) and SPIN­DL (­ Directory Listing) use descriptive metadata to search the network for data of interest, and to establish

  15. Maximizing the throughput of large ad hoc wireless networks

    E-Print Network [OSTI]

    Hua, Yingbo; Huang, Yi; J, Garcia-Luna-Aceves J

    2006-01-01

    The transport capacity of wireless networks over fadingimprovement of ad hoc wireless networks using directionalThe capacity of wireless networks,” IEEE Trans. Inform.

  16. Master Thesis Group Key Agreement for Ad Hoc Networks

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Master Thesis Group Key Agreement for Ad Hoc Networks Lijun Liao Date: 06 July 2005 Supervisor: M their financial support. #12;Abstract Over the last 30 years the study of group key agreement has stimulated much present a Tree-based group key agreement Framework for Ad-hoc Networks (TFAN). TFAN is especially suitable

  17. Curriculum Revision REPORT OF AD HOC WORKING GROUP ON

    E-Print Network [OSTI]

    Brown, Sally

    Curriculum Revision REPORT OF AD HOC WORKING GROUP ON CURRICULUM REVISION (November 2002- March (2) Charge to Ad Hoc Working Group on Curriculum.............................. 12 (3) Materials;Curriculum Revision SUMMARY Curriculum transformation at the College of Forest Resources (CFR) is a response

  18. Transmission capacity of CDMA ad hoc networks Steven Weber

    E-Print Network [OSTI]

    de Veciana, Gustavo

    Transmission capacity of CDMA ad hoc networks Steven Weber Dept. of ECE Drexel University and tolerate co-located simultaneous transmissions. We develop analytic results on the transmission capacity of a CDMA ad hoc network. Transmission capacity is defined as the maximum permissible density

  19. Optimum Transmission Range for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Deng, Jing

    Optimum Transmission Range for Wireless Ad Hoc Networks Jing Deng Dept. of EECS Syracuse Univ-- The transmission range that achieves the most economical use of energy in wireless ad hoc networks is studied under homogeneous node distribution. By as- suming the knowledge of node location, we first proposed a transmission

  20. Brief Contributions________________________________________________________________________________ Topology Control of Ad Hoc Wireless

    E-Print Network [OSTI]

    Poon, Chung Keung

    ________________________________________________________________________________ Topology Control of Ad Hoc Wireless Networks for Energy Efficiency Maggie X. Cheng, Member, IEEE, Mihaela of each wireless node such that the resulting network is connected and the total energy consumption the theoretical analysis. Index Terms--Multihop, ad hoc, wireless networks, energy efficiency, transmission power

  1. Improving the Battery Performance of Ad-Hoc Routing Protocols

    E-Print Network [OSTI]

    Kambhampati, Subbarao

    Improving the Battery Performance of Ad-Hoc Routing Protocols Q. Qi and C. Chakrabarti Department-- In ad-hoc networks formed by battery powered nodes, the network lifetime can be significantly enhanced by incorporateing the battery properties in the routing protocol. In this paper, we propose such a routing mechanism

  2. Topology Control Protocols to Conserve Energy in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Xu, Ya; Bien, Solomon; Mori, Yutaka; Heidemann, John; Estrin, D

    2003-01-01

    Protocols to Conserve Energy in Wireless Ad Hoc Networks YaL. Tassiulas. Energy conserving routing in wireless ad-hocAdaptive Energy Conservation Protocols for Wireless Ad Hoc

  3. The Capacityand Energy Efficiency of Wireless Ad Hoc Networks with MultipacketReception

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2008-01-01

    per-joule capacity of energy-limited wireless networks. IEEECapacity and Energy Efficiency of Wireless Ad Hoc Networksplexity, and energy efficiency in random wireless ad hoc

  4. Context-Aware Protocol Engines for  Ad Hoc Networks

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2009-01-01

    Context-Aware Protocol Engines for Ad Hoc Networks J. J.we call a context-aware protocol engine. With a CAPE, nodesthe context-aware protocol engine (CAPE) as an instantiation

  5. Truthful resource management in wireless ad hoc networks 

    E-Print Network [OSTI]

    Cai, Jianfeng

    2005-11-01

    In wireless mobile ad hoc networks (MANETs), cooperation cannot be an im- plicit assumption anymore. Each profit-oriented network node has the intention to be selfish due to limited resource possession. In this dissertation, we investigate...

  6. Mobilized ad-hoc networks: A reinforcement learning approach

    E-Print Network [OSTI]

    Chang, Yu-Han

    2003-12-04

    Research in mobile ad-hoc networks has focused on situations in which nodes have no control over their movements. We investigate an important but overlooked domain in which nodes do have control over their movements. ...

  7. Energy-Efficient Location Service Protocols for Mobile Ad Hoc Networks Zijian Wang, Eyuphan Bulut, and Boleslaw K. Szymanski

    E-Print Network [OSTI]

    Bystroff, Chris

    Energy-Efficient Location Service Protocols for Mobile Ad Hoc Networks Zijian Wang, Eyuphan Bulut the location of the destination node. Seldom they consider energy efficiency in their designs energy efficiency and improve the query success rate in comparison to the previously proposed algorithms

  8. DISS. ETH NO. 16800 Understanding Ad hoc Networks

    E-Print Network [OSTI]

    of this dissertation investigates the newly-found freedom enabled by battery-powered devices: mobility. OneDISS. ETH NO. 16800 Understanding Ad hoc Networks From Geometry to Mobility A dissertation submitted to the SWISS FEDERAL INSTITUTE OF TECHNOLOGY ZURICH for the degree of Doctor of Sciences presented

  9. Limited Flooding Protocol for Mobile Ad hoc Networks Mieso Denko

    E-Print Network [OSTI]

    Goddard, Wayne

    Limited Flooding Protocol for Mobile Ad hoc Networks Mieso Denko Department of Computing propose a multipath routing protocol called Limited Flooding. The protocol is fully reactive and does not entail the compu- tation of routing tables. It uses the basic features of flooding but restricts packet

  10. Energy-Efficient Topology Control in Cooperative Ad Hoc Networks

    E-Print Network [OSTI]

    Wang, Yu

    Energy-Efficient Topology Control in Cooperative Ad Hoc Networks Ying Zhu, Minsu Huang, Siyuan Chen cooperative energy spanners in which the energy efficiency of individual paths are guaranteed. Both proposed of cooperative communication in various wireless network applications: energy efficient routing [23], [24], [25

  11. Smart Services for Ad Hoc Databases University of Washington

    E-Print Network [OSTI]

    Matrajt, Graciela

    data-base from lists of addresses of nearby schools, locations of resources (e.g., ambulances), and contact information for emergency workers. · A consulting business analyst assembles an ad hoc data- base of commercial database management systems are prohibitive, especially without access to dedicated IT staff

  12. Elective Participation in Ad Hoc Networks Based on Energy Consumption

    E-Print Network [OSTI]

    Deng, Jing

    Elective Participation in Ad Hoc Networks Based on Energy Consumption Marc R. Pearlman , Jing Deng of determining the op- timal transmission radius for minimal interference and energy consumption is considered be significant. There- fore, in order to more aggressively conserve energy, one must Currently with the GE Global

  13. Cooperative Cache-Based Data Access in Ad Hoc Networks

    E-Print Network [OSTI]

    Yener, Aylin

    1 Cooperative Cache-Based Data Access in Ad Hoc Networks Guohong Cao, Liangzhong Yin and Chita R: Cooperative cache-based data access framework #12;6 Data Access Framework The cooperative cache-based data data authentication based on sensitivity. #12;16 Conclusion A cooperative cache-based data access

  14. Reducing the Energy Drain in Multihop Ad Hoc Geraud Allard

    E-Print Network [OSTI]

    Mans, Bernard

    that save energy of nodes with low battery but also allow the network to handle more flows. I. INTRODUCTION-efficient routing for Multihop Ad Hoc Networks (MANET) look at extend- ing battery life by minimizing the cost's shortest path algorithm in which we integrate the notion of remaining energy in order to satisfy flow

  15. Service Discovery in Mobile Ad Hoc Networks: A Field Theoretic Approach Vincent Lenders

    E-Print Network [OSTI]

    Lenders, Vincent

    Service Discovery in Mobile Ad Hoc Networks: A Field Theoretic Approach Vincent Lenders , Martin: {lenders, may, plattner}@tik.ee.ethz.ch Abstract Service discovery in mobile ad hoc networks is challeng

  16. TDROP: A routing protocol for physically hierarchical ad hoc mobile networks 

    E-Print Network [OSTI]

    Ahmed, Zaheer

    2000-01-01

    Many protocols for routing in mobile ad hoc networks have been proposed. None of these protocols differentiates mobile nodes based on their physical characteristics and also there is only one proposal for connecting ad hoc ...

  17. Continuous Query Processing in Data Streams Using Duality of Data and Queries

    E-Print Network [OSTI]

    Song, Il-Yeol

    Continuous Query Processing in Data Streams Using Duality of Data and Queries Hyo-Sang Lim, Jae and query-initiative methods only for ad-hoc queries. We contend that continuous query processing can. In this paper, we first present a new viewpoint of transforming the continuous query processing problem

  18. Ad hoc networks beyond unit disk graphs Fabian Kuhn Roger Wattenhofer Aaron Zollinger

    E-Print Network [OSTI]

    miniaturization of electronics in general and wireless communication technology in particular is mobile ad hoc networks. Ad hoc networks are formed by mobile devices consisting of, among other components, a processor a weak battery or a small solar cell. Typically, wireless ad hoc networks are intended to be employed

  19. A Mean Field Based Methodology for Modeling Mobility in Ad Hoc Networks

    E-Print Network [OSTI]

    Horváth, András

    the behavior of the system. Index Terms--ad hoc networks, mean field analysis, Petri nets; I. INTRODUCTIONA Mean Field Based Methodology for Modeling Mobility in Ad Hoc Networks Marco Beccuti1--In this paper we propose a methodology for the modeling and analysis of ad hoc networks composed by a large

  20. Wireless ad hoc networks Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale

    E-Print Network [OSTI]

    Gao, Jie

    are not flexible. ­ Vulnerable to attacks. · Ad hoc networks· Ad hoc networks ­ Flexible, easy to deploy, cheaper · Optimal power assignment /transmission range · Optimal scheduling & multi-hop routing · Node are staticWireless ad hoc networks Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale #12

  1. Capacity Region, Minimum Energy and Delay for a Mobile Ad-Hoc Network

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

    Capacity Region, Minimum Energy and Delay for a Mobile Ad-Hoc Network Rahul Urgaonkar, Michael J in a mobile ad-hoc network: the capacity region and the minimum energy function of the network. The capacity limits of a mobile ad-hoc network are the capacity region and the minimum energy function of the network

  2. Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

    Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding J energy broadcasting in ad-hoc wireless networks is NP-complete [3] and a large number of approximation of minimizing the energy per bit when multicasting in an ad-hoc wireless network. An alternative formulation

  3. Reliable and Energy-Efficient Routing for Static Wireless Ad Hoc Networks with Unreliable Links

    E-Print Network [OSTI]

    Wang, Yu

    Reliable and Energy-Efficient Routing for Static Wireless Ad Hoc Networks with Unreliable Links. In this paper, we address the problem of energy efficient reliable routing for wireless ad hoc networks communication, energy efficiency. Ç 1 INTRODUCTION WIRELESS ad hoc networks draw lots of attentions in recent

  4. Asplund et al. Wireless Ad Hoc Dissemination for Search and Rescue Proceedings of the 7th

    E-Print Network [OSTI]

    Asplund et al. Wireless Ad Hoc Dissemination for Search and Rescue Proceedings of the 7th International ISCRAM Conference ­ Seattle, USA, May 2010 1 Wireless Ad Hoc Dissemination for Search and Rescue communication and Internet connectivity. Even if we consider wireless ad hoc communication as a means

  5. A Platform for Implementing Secure Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Farkas, Gyula; Haller, Piroska

    2010-01-01

    We propose a new platform for implementing secure wireless ad hoc networks. Our proposal is based on a modular architecture, with the software stack constructed directly on the Ethernet layer. Within our platform we use a new security protocol that we designed to ensure mutual authentication between nodes and a secure key exchange. The correctness of the proposed security protocol is ensured by Guttman's authentication tests.

  6. Name Service in IPv6 Mobile Ad-hoc Network connected to the Internet

    E-Print Network [OSTI]

    Jeong, Jaehoon "Paul"

    Name Service in IPv6 Mobile Ad-hoc Network connected to the Internet Jaehoon Jeong, Jungsoo Park-hoc network connected to the Internet. The DNS resolution of DNS names of mobile nodes within mobile ad-hoc network is performed by multicast DNS and that of DNS names of nodes in the Internet is performed through

  7. Bluetooth Scatternet Formation for Single-hop Ad Hoc Networks Based on Virtual Positions 43 Bluetooth Scatternet Formation for Single-hop Ad Hoc

    E-Print Network [OSTI]

    Wang, Yu

    Bluetooth Scatternet Formation for Single-hop Ad Hoc Networks Based on Virtual Positions 43 Bluetooth Scatternet Formation for Single-hop Ad Hoc Networks Based on Virtual Positions Yu Wang , Ivan, Ontario, Canada Department of Computer Science Illinois Institute of Technology Chicago, Illinois, USA

  8. FaultTolerant Distributed Algorithms in Sparse Ad Hoc Wireless Networks

    E-Print Network [OSTI]

    Fault­Tolerant Distributed Algorithms in Sparse Ad Hoc Wireless Networks (SPAWN) BETTINA WEISS communication technologies, wireless ad hoc networks are increasingly commonplace nowadays. Spontaneous (``ad wireless sensor networks and disaster area communication systems. It is also a major enabling technology

  9. A Multiobjective Performance Evaluation Framework for Routing in Wireless Ad Hoc

    E-Print Network [OSTI]

    Jaffrès-Runser, Katia

    network when delay, robustness and energy are considered. I. INTRODUCTION Wireless ad hoc and sensor to transmission delay [8], energy consumption [9] or fairness [10] are added on top of its main design goalA Multiobjective Performance Evaluation Framework for Routing in Wireless Ad Hoc Networks Katia

  10. Rethinking Information Theory for Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Andrews, Jeff; Haenggi, Martin; Berry, Randy; Jafar, Syed; Guo, Dongning; Shakkottai, Sanjay; Heath, Robert; Neely, Michael; Weber, Steven; Yener, Aylin

    2007-01-01

    The subject of this paper is the long-standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundamental performance limits of mobile ad hoc networks (MANETs). A MANET is a peer-to-peer network with no pre-existing infrastructure. MANETs are the most general wireless networks, with single-hop, relay, interference, mesh, and star networks comprising special cases. The lack of a MANET capacity theory has stunted the development and commercialization of many types of wireless networks, including emergency, military, sensor, and community mesh networks. Information theory, which has been vital for links and centralized networks, has not been successfully applied to decentralized wireless networks. Even if this was accomplished, for such a theory to truly characterize the limits of deployed MANETs it must overcome three key roadblocks. First, most current capacity results rely on the allowance of unbounded delay and reliability. Second, ...

  11. On the Connectivity in One-Dimensional Ad Hoc Wireless Networks with a Forbidden Zone

    E-Print Network [OSTI]

    On the Connectivity in One-Dimensional Ad Hoc Wireless Networks with a Forbidden Zone Xiaodong Hu1 This paper investigates the connectivity in one-dimensional ad hoc wireless networks with a forbidden zone. We derive the probability of the wireless networks which are composed of exactly m clusters by means

  12. SANS: A Simple Ad Hoc Network Simulator Nicolas Burri, Roger Wattenhofer, Yves Weber, Aaron Zollinger

    E-Print Network [OSTI]

    SANS: A Simple Ad Hoc Network Simulator Nicolas Burri, Roger Wattenhofer, Yves Weber, Aaron present a Simple Ad Hoc Network Simulator SANS particularly intended for the simulation of distributed the concepts and correct usage of SANS as a development, debugging, testing and presentation tool. Together

  13. American Institute of Aeronautics and Astronautics Ad Hoc UAV Ground Network (AUGNet)

    E-Print Network [OSTI]

    Brown, Timothy X.

    American Institute of Aeronautics and Astronautics 1 Ad Hoc UAV Ground Network (AUGNet) Timothy X network with radio nodes mounted at fixed sites, on ground vehicles, and in small (10kg) UAVs. The ad hoc which act as relays. We envision two scenarios for this type of network. In the first, the UAV acts

  14. A SERVICE DISCOVERY THREAT MODEL FOR AD HOC Adrian Leung and Chris Mitchell

    E-Print Network [OSTI]

    Mitchell, Chris

    A SERVICE DISCOVERY THREAT MODEL FOR AD HOC NETWORKS Adrian Leung and Chris Mitchell Information.Leung,C.Mitchell}@rhul.ac.uk Keywords: Security, Secure Service Discovery, Threat Model, Mobile Ad Hoc Networks, MANETs. Abstract. Securing the process of service discovery is one of them. Novel solutions are therefore required. However

  15. DELAR: Device/Energy/Load Aware Relaying in Heterogenous Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Zhang, Yanchao

    - newable energy sources. In DELAR the heterogeneity of nodal energy capabilities or device types, nodalDELAR: Device/Energy/Load Aware Relaying in Heterogenous Wireless Ad Hoc Networks Wei Liu Energy conservation is of great importance for mobile ad hoc networks in which most nodes are equipped

  16. ADHOC MAC: a new, flexible and reliable MAC architecture for ad-hoc networks

    E-Print Network [OSTI]

    Borgonovo, Flaminio

    ADHOC MAC: a new, flexible and reliable MAC architecture for ad-hoc networks F. Borgonovo, A, make the design of a prompt, efficient, flexible, and reliable MAC very difficult. An ad hoc network.e., transmissions that reach all terminals within the range allowed by the transmitting power. Due to radio range

  17. Energy-Efficiency of Cooperative Sensing Schemes in Ad hoc WLAN Cognitive Radios

    E-Print Network [OSTI]

    Namboodiri, Vinod

    Energy-Efficiency of Cooperative Sensing Schemes in Ad hoc WLAN Cognitive Radios Reshma Syeda, we study and analyse the energy efficiency of two generic cooperative sensing schemes in an ad hoc a comparative numerical analysis to demonstrate the amount of energy savings of the proposed cooperative schemes

  18. Minimizing Energy and Maximizing Network Lifetime Multicasting in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Liang, Weifa

    Minimizing Energy and Maximizing Network Lifetime Multicasting in Wireless Ad Hoc Networks Weifa Abstract-- Most mobile nodes in a wireless ad hoc network are powered by energy limited batteries, the limited battery lifetime imposes a constraint on the network performance. Therefore, energy efficiency

  19. EAGR: Energy Aware Greedy Routing Scheme for Wireless Ad hoc Networks Sachin Sharma

    E-Print Network [OSTI]

    Dharmaraja, S.

    EAGR: Energy Aware Greedy Routing Scheme for Wireless Ad hoc Networks Sachin Sharma Tejas Networks, throughput and energy consumption. Keywords: Rate of Energy Consumption, Greedy Routing, Wireless Ad hoc distributed nodes that communicate over a wireless link. In this paper we present a scalable, Energy Aware

  20. On the Energy Efficiency of Cognitive Radios -A Study of the Ad Hoc Wireless LAN Scenario

    E-Print Network [OSTI]

    Namboodiri, Vinod

    On the Energy Efficiency of Cognitive Radios - A Study of the Ad Hoc Wireless LAN Scenario Anm can save energy over a conventional radio in the Ad Hoc Wireless LAN scenario. The interplay between wireless spectrum, has however, resulted in researchers overlooking the importance of energy consumption

  1. Energy Conserving Routing in Wireless Ad-hoc Networks Jae-Hwan Chang and Leandros Tassiulas

    E-Print Network [OSTI]

    Wang, Bing

    Energy Conserving Routing in Wireless Ad-hoc Networks Jae-Hwan Chang and Leandros Tassiulas-- energy-sensitive routing, wireless ad-hoc networks, sensor networks I. INTRODUCTION CONSIDER a group of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system

  2. Does Cognition Come at a Net Energy Cost in Ad Hoc Wireless LANs?

    E-Print Network [OSTI]

    Namboodiri, Vinod

    1 Does Cognition Come at a Net Energy Cost in Ad Hoc Wireless LANs? Anm Badruddoza, Vinod that are energy constrained. This work takes a first step in this direction for the ad hoc Wireless LAN scenario the importance of energy consumption in the devices that employ such techniques. Scanning for wireless spectrum

  3. Clique-Based Randomized Multiple Access for Energy-Efficient Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Clique-Based Randomized Multiple Access for Energy-Efficient Wireless Ad Hoc Networks Paul G. Flikkema and Brent West Department of Electrical Engineering Northern Arizona University Flagstaff, AZ protocol design for wireless ad hoc networks is between proactive and reactive coor- dination, where

  4. Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    of a wireless network that is operating on battery power is limited by the capacity of its energy sourceDistributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks of wireless multihop ad hoc net- works can be controlled by varying the transmission power of each node. We

  5. Low-Cost Truthful Multicast in Selfish and Rational Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Li, Xiang-Yang

    en- joy a more flexible composition. A wireless ad hoc network is a collection of radio devices limited transmission power. One of the dis- tinctive features of wireless networks is that the signal sent1 Low-Cost Truthful Multicast in Selfish and Rational Wireless Ad Hoc Networks Weizhao Wang Xiang

  6. Comparative Study of Price-based Resource Allocation Algorithms for Ad Hoc Networks

    E-Print Network [OSTI]

    be an ample alterna- tive. 1. Introduction Mobile ad hoc networks are formed by wireless nodes that move freely and have no fixed infrastructure. Each node in the network may act as a router for other nodes a serious threat to critical infrastructures of the future. Due to the nature of ad hoc wireless networks

  7. A bidding algorithm for optimized utility-based resource allocation in ad hoc networks

    E-Print Network [OSTI]

    for bandwidth allo- cation in wireless ad hoc networks. The quality of service (QoS) levels for each end ad hoc networks are formed by wireless nodes that move freely and have no fixed infrastructure. Each node in the network may act as a router for other nodes, and flows follow a multi-hop path from source

  8. Comparison of two wireless ad hoc routing protocols on a hardware test-bed

    E-Print Network [OSTI]

    Brown, Timothy X.

    Comparison of two wireless ad hoc routing protocols on a hardware test-bed Shweta Bhandare of the rout- ing protocols is carried out using the Click modular router infrastructure on laptops with wireless ethernet cards running Linux. We demonstrate the working of both ad hoc routing protocols through

  9. Coverage Problems in Wireless Ad-hoc Sensor Networks Seapahn Meguerdichian1

    E-Print Network [OSTI]

    technology interfacing with emerging micro-sensor based on MEMs technology [2], is allowing sophisticatedCoverage Problems in Wireless Ad-hoc Sensor Networks Seapahn Meguerdichian1 , Farinaz Koushanfar2}@cs.ucla.edu {farinaz, mbs}@ee.ucla.edu Abstract - Wireless ad-hoc sensor networks have recently emerged as a premier

  10. Interes'ng-Phrase Mining for Ad-Hoc Text Analy'cs

    E-Print Network [OSTI]

    Interes'ng-Phrase Mining for Ad-Hoc Text Analy'cs Klaus Berberich (kberberi Weikum (originally presented at VLDB 2010) #12;Interes'ng-Phrase Mining for Ad-Hoc Text.g., iden'fy characteris'c quota'ons by barack obama) 2 / 27 #12;Interes'ng-Phrase Mining

  11. Report of the Ad Hoc Committee on Washington Natural Resource Agency Reform

    E-Print Network [OSTI]

    Brown, Sally

    Report of the Ad Hoc Committee on Washington Natural Resource Agency Reform February 16, 2010 of the Environment (CoEnv) to make useful contributions to the Governor's natural resource agency reform initiative. As a result, the Washington Natural Resource Agency Reform ad hoc Committee was established and given

  12. Simulation and Evaluation of Unsynchronized Power Saving Mechanisms in Wireless Ad hoc

    E-Print Network [OSTI]

    Braun, Torsten

    Simulation and Evaluation of Unsynchronized Power Saving Mechanisms in Wireless Ad hoc Networks@sics.se Abstract. Power saving mechanisms in wireless ad hoc network nodes mainly switch off the transmission proposed power saving approach based on asynchronous wake-up patterns and wake-up announcements integrated

  13. Using Traffic Flow for Cluster Formation in Vehicular Ad-hoc Networks

    E-Print Network [OSTI]

    Weigle, Michele

    Using Traffic Flow for Cluster Formation in Vehicular Ad-hoc Networks Mohammad S. Almalag of the traffic will flow. I. INTRODUCTION Vehicular Ad Hoc Networks (VANETs) are considered to be a class MANETs. Nodes in VANETs have more processing power and storage space and typically have no battery

  14. Cognitive radio ad hoc networks (CRAHNs): Cognitive radio ad hoc networks (CRAHNs): Resource allocation techniques based on Bio-inspired computing

    E-Print Network [OSTI]

    Singh, Santosh Kumar

    2010-01-01

    Spectrum is a scarce commodity, and considering the spectrum scarcity faced by the wireless-based service providers led to high congestion levels. Technical inefficiencies from pooled spectrum (this is nothing but the "common carrier principle" adopted in oil/gas/electricity pipelines/networks.), since all ad hoc networks share a common pool of channels, exhausting the available channels will force ad hoc networks to block the services. Researchers found that cognitive radio (CR) technology may resolve the spectrum scarcity. CR network proved to next generation wireless communication system that proposed as a way to reuse under-utilised spectrum of licensee user (primary network) in an opportunistic and non-interfering basis. A CR is a self-configuring entity in a wireless networking that senses its environment, tracks changes, and frequently exchanges information with their networks. Adding this layer of such intelligence to the ad hoc network by looking at the overall geography of the network known as cogni...

  15. Quantitative Analysis of Transmission Power Control in Wireless Ad-hoc Networks

    E-Print Network [OSTI]

    Sivakumar, Raghupathy

    -hoc network is determined by the transmission power of the stations. Be- cause different topologies have transmis- sion power is determined by the network load, the number of stations, and the network size1 Quantitative Analysis of Transmission Power Control in Wireless Ad-hoc Networks Seung-Jong Park

  16. XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks Roger Wattenhofer and Aaron Zollinger

    E-Print Network [OSTI]

    over several small (energy-efficient) hops. For this purpose each node in the ad-hoc network chooses buildings. In this paper we present the XTC1 topology control algorithm that works i) without GPS and ii

  17. Cross-Layer Design of Outage Optimum Routing Metric for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2011-01-01

    PAPER Cross-layer design of outage optimum routing metricof wireless ad hoc network outage probability in a fadingJ. J. Garcia-Luna-Aceves Outage optimum routing for wireless

  18. Quality of Service (QoS) security in mobile ad hoc networks 

    E-Print Network [OSTI]

    Lu, Bin

    2006-10-30

    With the rapid proliferation of wireless networks and mobile computing applications, Quality of Service (QoS) for mobile ad hoc networks (MANETs) has received increased attention. Security is a critical aspect of QoS ...

  19. Hierarchical Skeletons and ad hoc Parallelism Marcus I. Marr and Murray Cole

    E-Print Network [OSTI]

    Cole, Murray

    Hierarchical Skeletons and ad hoc Parallelism Marcus I. Marr and Murray Cole Department of Computer Science, University of Edinburgh, email: marr@dcs.ed.ac.uk We investigate the controlled introduction

  20. Reliability and energy-efficiency in wireless ad-hoc networks

    E-Print Network [OSTI]

    Srinivas, Anand, 1979-

    2004-01-01

    In this thesis, we address issues related to reliability and energy-efficiency in wireless ad hoc networks. In the first part of the work, we deal with the problem of simultaneously routing data along multiple disjoint ...

  1. Autonomous Undersea Systems Network (AUSNet) Protocols To Support Ad-Hoc AUV Communications

    E-Print Network [OSTI]

    semi-autonomous networked robots. Emerging flexible low bandwidth, energy efficient architectures opposed to network support) data transmissions. Current efforts are focused on transitionAutonomous Undersea Systems Network (AUSNet) ­ Protocols To Support Ad-Hoc AUV Communications

  2. Service Provision in Disconnected Mobile Ad hoc Networks Nicolas Le Sommer

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Service Provision in Disconnected Mobile Ad hoc Networks Nicolas Le Sommer Valoria Laboratory, University of South Brittany Nicolas.Le-Sommer@univ-ubs.fr Abstract With the proliferation of mobiles devices

  3. The design and implementation of a distributed photo sharing Android application over ad-hoc wireless

    E-Print Network [OSTI]

    Li, HaoQi, M. Eng. Massachusetts Institute of Technology

    2012-01-01

    We present a distributed photo-sharing Android application, CameraDP, that primarily relies on ad-hoc Wifi. The app runs on top of the novel DIstributed Programming Layer Over Mobile Agents (DIPLOMA) programming abstraction. ...

  4. Distributed Call Admission Control for Ad Hoc Shahrokh Valaee and Baochun Li

    E-Print Network [OSTI]

    Li, Baochun

    structure of management schemes in an ad hoc network may allow destructive operation of mali- cious sources -- such as the The authors are with the Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University

  5. Energy Efficient Broadcast in Wireless Ad hoc Networks with Hitch-hiking

    E-Print Network [OSTI]

    Wu, Jie

    , weather forecasting, home appliance control, and protec- tion against bioterrorism. Ad hoc networks can of applications that can improve quality of life, and even save lives. Sensor networks find their appli- cation

  6. Tree Based Broadcast in Ad Hoc Networks Alpar Juttner1,2

    E-Print Network [OSTI]

    Jüttner, Alpár

    , Broadcast, Multicast, Routing algorithms, Wireless LANs. 1 #12;1 Introduction Mobile ad hoc networks (MANETs infrastructure in such a way, that each communi- cating device (hereafter node) can serve as a router

  7. Secure Neighborhood Discovery: A Fundamental Element for Mobile Ad Hoc Networking

    E-Print Network [OSTI]

    Capkun, Srdjan

    devices. Static ad hoc or mesh networks are being formed by home computers with roof-top antennas. Low, topology control, transmission scheduling, energy-efficient communication, as well as physical access

  8. Analyzing the Impact of Mobility in Ad Hoc Networks Vincent Lenders, Jorg Wagner, and Martin May

    E-Print Network [OSTI]

    Lenders, Vincent

    Analyzing the Impact of Mobility in Ad Hoc Networks Vincent Lenders, J¨org Wagner, and Martin May Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich, Switzerland lenders

  9. An Adaptive Routing Mechanism For Ad Hoc Wireless Sensor Jane E Tateson and Ian W Marshall, BTexact

    E-Print Network [OSTI]

    Haddadi, Hamed

    An Adaptive Routing Mechanism For Ad Hoc Wireless Sensor Networks Jane E Tateson and Ian W Marshall for a network of ad hoc wireless sensor nodes. The mechanism enables sensor nodes to minimize route cost by varying their transmission range, and by experimenting with the neighbours from which they forward data

  10. Power Control MAC Protocol Analysis and Improvement for Ad Hoc Networks Ping Ding, JoAnne Holliday, Aslihan Celik

    E-Print Network [OSTI]

    Holliday, JoAnne

    Power Control MAC Protocol Analysis and Improvement for Ad Hoc Networks Ping Ding, JoAnne Holliday power control protocols have been proposed to address the limited power supplies in ad hoc networks. Recent protocols suggest varying the transmission power such that the RTS/CTS handshake is done

  11. Ad-hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks Hasan Guclu

    E-Print Network [OSTI]

    Yuksel, Murat

    , search success rate, routing reachability and stability) de- pend on the capability of preserving structure even over the churn caused by the ad-hoc nodes joining or leaving the network. Preserving mainly depends on the capability of preserving structure even over the churn caused by the ad-hoc nodes

  12. Int. J. Ad Hoc and Ubiquitous Computing, Vol. 1, No. 4, 2006 239 Copyright 2006 Inderscience Enterprises Ltd.

    E-Print Network [OSTI]

    Maróti, Miklós

    Int. J. Ad Hoc and Ubiquitous Computing, Vol. 1, No. 4, 2006 239 Copyright © 2006 Inderscience: sensor networks; ad hoc networks; ubiquitous computing; time synchronisation; clock synchronisation and Ubiquitous Computing, Vol. 1, No. 4, pp.239­251. Biographical notes: Branislav Kusý is a Research Assistant

  13. Energy-Aware Secure Multicast Communication In Wireless Ad-Hoc Networks Loukas Lazos, and Radha Poovendran

    E-Print Network [OSTI]

    Lazos, Loukas

    Energy-Aware Secure Multicast Communication In Wireless Ad-Hoc Networks Loukas Lazos, and Radha Poovendran Abstract-- In this paper we address the problem of efficiently securing multicast communication in energy constrained wireless ad hoc networks. We show that existing scalable key distribution techniques

  14. A Lightweight Encryption Scheme for Network-Coded Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Shen, Xuemin "Sherman"

    schemes. Index Terms--Mobile ad hoc networks, energy saving, network coding, lightweight encryption. ! 1 a lower energy consumption in MANETs [6]­[8]. The energy saving comes from fact that less transmissions operations, this means 1/4 energy can be saved. Besides basic transmissions, energy consumption can also come

  15. JTP: An Energy-conscious Transport Protocol for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    JTP: An Energy-conscious Transport Protocol for Wireless Ad Hoc Networks (Technical Report BUCS the energy gains of JTP over one-size-fits-all transport protocols. I. INTRODUCTION Motivation and Scope physical to transport [8], [9]. JAVeLEN's design ensures that energy gains obtained in one layer would

  16. Exploiting Trust Relations for Nash Equilibrium Efficiency in Ad Hoc Networks

    E-Print Network [OSTI]

    Baras, John S.

    Exploiting Trust Relations for Nash Equilibrium Efficiency in Ad Hoc Networks Shanshan Zheng, Tao where the nodes' payoffs are affected by their trust relations. We characterize the Nash equilibrium the interactions among nodes as a game, the Nash equilibria are used to study the operating points of the network

  17. On Data-Centric Trust Establishment in Ephemeral Ad Hoc Networks

    E-Print Network [OSTI]

    Chen, Ing-Ray

    On Data-Centric Trust Establishment in Ephemeral Ad Hoc Networks Maxim Raya, Panagiotis that the traditional notion of trust as a relation among entities, while useful, becomes insufficient for emerging data-centric the traditional notion of trust to data-centric trust: trustworthiness attributed to node- reported data per se

  18. Resilient Data-Centric Storage in Wireless Ad-Hoc Sensor Networks

    E-Print Network [OSTI]

    Chuang, John C.-I.

    Resilient Data-Centric Storage in Wireless Ad-Hoc Sensor Networks Abhishek Ghose, Jens Grossklags to the limited battery life of sensor devices. It has been shown that data-centric methodologies can be used to solve this problem efficiently. In data-centric storage, a recently proposed data dissemina- tion

  19. Non-Blocking, Localized Routing Algorithm for Balanced Energy Consumption in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Yu, Chansu

    relevant nodes but also to balance individual battery levels. Unbalanced energy usage will result1 Non-Blocking, Localized Routing Algorithm for Balanced Energy Consumption in Mobile Ad Hoc Networks Kyungtae Woo, Chansu Yu, and Dongman Lee Hee Yong Youn Ben Lee School of Engineering Information

  20. Mobility Models for Ad hoc Network Simulation Guolong Lin, Guevara Noubir, and Rajmohan Rajaraman

    E-Print Network [OSTI]

    Chan, Agnes Hui

    present the random waypoint model as a renewal process and derive an accurate characterizationMobility Models for Ad hoc Network Simulation Guolong Lin, Guevara Noubir, and Rajmohan Rajaraman.neu.edu Abstract-- In this paper, we propose a novel general technique, based on renewal theory, for analyzing

  1. Mobility Models for Ad hoc Network Simulation Guolong Lin, Guevara Noubir, and Rajmohan Rajaraman

    E-Print Network [OSTI]

    Rajaraman, Rajmohan

    are twofold: #15; Analytical: We present the random waypoint model as a renewal process and derive an accurateMobility Models for Ad hoc Network Simulation Guolong Lin, Guevara Noubir, and Rajmohan Rajaraman@ccs.neu.edu Abstract--- In this paper, we propose a novel general technique, based on renewal theory, for analyzing

  2. Energy consumption models for ad-hoc mobile Emmanuel Lochin1

    E-Print Network [OSTI]

    Lochin, Emmanuel

    1 Energy consumption models for ad-hoc mobile terminals Emmanuel Lochin1 Anne Fladenmuller1 Jean describes a set of experiments based on ACPI BIOS measurements which evaluate the energy consumption of an IEEE802.11 wireless net- work interface. Based on our ACPI measurements, two models of energy

  3. Delay and Capacity Trade-offs in Mobile Ad Hoc Networks: A Global Perspective

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

    Mazumdar, Ness Shroff School of Electrical and Computer Engineering Purdue University West Lafayette, IN 47907, USA Email: {gsharma,shroff}@ecn.purdue.edu Department of Electrical and Computer Engineering the delay and capacity trade-offs in mobile ad hoc networks. This line of investigation started

  4. Outage in a Cellular Network Overlaid with an Ad hoc Network: The Uplink Case

    E-Print Network [OSTI]

    Yanikomeroglu, Halim

    Outage in a Cellular Network Overlaid with an Ad hoc Network: The Uplink Case Arshdeep S. Kahlon}@sce.carleton.ca Abstract--We analyze the uplink outage probability at the randomly, but not necessarily independently nor, large-scale power control, and the knowledge of the initial outages in the absence of the secondary

  5. Asymptotic Outage Analysis of General Motion-Invariant Ad Hoc Networks

    E-Print Network [OSTI]

    Haenggi, Martin

    Asymptotic Outage Analysis of General Motion-Invariant Ad Hoc Networks Riccardo Giacomelli Dept Dame, IN, USA E-mail: mhaenggi@nd.edu Abstract--The outage analysis of networks with randomly a homogeneous Poisson point process. In this paper, we show that in great generality, the outage probability

  6. A Power Efficient Scheduling Mechanism for an IEEE 802.11 Multiple Rate Ad Hoc Network

    E-Print Network [OSTI]

    Tseng, Yu-Chee

    that of 802.11 PSM. Keywords: Ad Hoc Network, DCF, 802.11 PSM, Beacon Interval, and ATIM Window 1 Introduction Mechanism (802.11 PSM) that allows a wireless STA to go from the active state to doze or power-saving state

  7. Progressive Network Coding for Message-Forwarding in Ad-Hoc Wireless Networks

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

    repetition-forward and progressive network coding are analyzed with respect to different transmit power. This paper considers the multi-hop transmission prob- lem in wireless ad-hoc networks. In a three-node sce of multi- hop transmission. The new framework, exploiting the technology of progressive network coding

  8. Scalable, Ad Hoc Deployable RF-based Localization Nirupama Bulusu, Vladimir Bychkovskiy, Deborah Estrin John Heidemann

    E-Print Network [OSTI]

    Heidemann, John

    monitoring in the water and soil, tagging small animals unobtrusively, or tagging small and light objects hardware and energy constrained de- vices, for noisy, unpredictable environments and for very large ad hoc, despite be- ing largely unattended, overcoming energy limitations and a lack of pre

  9. Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network 

    E-Print Network [OSTI]

    Pandey, Sanat Kumar

    2015-08-05

    In this thesis we consider the problem of neighbor discovery in synchronous single hop wireless ad-hoc networks. The central problem is to establish a broadcasting sequence such that only one transmitter broadcasts at a time while all others listen...

  10. Capacity Bounds for Energy Efficient Data Streaming in Homogeneous Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Li, Zongpeng

    Capacity Bounds for Energy Efficient Data Streaming in Homogeneous Wireless Ad Hoc Networks Hanan activation schemes with provable asymptotic bounds on the capacity and energy efficiency of the induced add to the noise levels of each other and cause the overall network capacity to decrease

  11. Cooperative Energy Spanners: Energy-Efficient Topology Control in Cooperative Ad Hoc Networks

    E-Print Network [OSTI]

    Wang, Yu

    Cooperative Energy Spanners: Energy-Efficient Topology Control in Cooperative Ad Hoc Networks Ying introduce a new topology control problem: energy-efficient topology control problem with cooperative communication, and propose two topology control algorithms to build cooperative energy spanners in which

  12. Energy-Efficient Distributed Constructions of Minimum Spanning Tree for Wireless Ad-hoc

    E-Print Network [OSTI]

    Khan, Maleq

    1 Energy-Efficient Distributed Constructions of Minimum Spanning Tree for Wireless Ad-hoc Networks and energy efficient for being practical. Motivated by these considerations, we study the performance of a class of simple and local algorithms called Nearest Neighbor Tree (NNT) algorithms for energy

  13. Price/Utility-based Optimized Resource Allocation in Wireless Ad hoc Networks

    E-Print Network [OSTI]

    Price/Utility-based Optimized Resource Allocation in Wireless Ad hoc Networks Calin Curescu of Service (QoS) levels for each end-to-end flow are expressed using resource-utility functions, and our algorithms aim to maximise the aggregated utility of the flows. The scheme differentiates between applica

  14. An Energy Efficient MAC Protocol for Fully Connected Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Zhuang, Weihua

    1 An Energy Efficient MAC Protocol for Fully Connected Wireless Ad Hoc Networks Kamal Rahimi Abstract--Energy efficiency is an important performance mea- sure of wireless network protocols, especially for battery-powered mobile devices such as smartphones. This paper presents a new energy-efficient medium

  15. Improved Power-Delay Trade-off in Wireless Ad Hoc Networks Using Opportunistic Routing

    E-Print Network [OSTI]

    Lee, Yong Hoon

    Improved Power-Delay Trade-off in Wireless Ad Hoc Networks Using Opportunistic Routing Won power- delay trade-off than the conventional routing while providing up to a logarithmic boost that the power can be reduced at the expense of increased delay for both scenarios, but better trade-off can

  16. 14. A TAXONOMY OF DATA COMMUNICATION PROTOCOLS FOR VEHICULAR AD HOC NETWORKS

    E-Print Network [OSTI]

    Stojmenovic, Ivan

    1 14. A TAXONOMY OF DATA COMMUNICATION PROTOCOLS FOR VEHICULAR AD HOC NETWORKS Yousef efficiency. In this paper, we provide the first known taxonomy of VANET data communication protocols, based, vehicle connectivity, urgency, and message contents. The taxonomy provides fundamental blocks in VANET

  17. Impact of Social Relation and Group Size in Multicast Ad Hoc Networks

    E-Print Network [OSTI]

    Wang, Xinbing

    1 Impact of Social Relation and Group Size in Multicast Ad Hoc Networks Yi Qin, Riheng Jia, Jinbei wireless social networks. We adopt the two-layer network model, which includes the social layer and the networking layer. In the social layer, the social group size of each source node is modeled as power

  18. Supporting Secure Ad-hoc User Collaboration in Grid Environments Markus Lorch, Dennis Kafura

    E-Print Network [OSTI]

    Cao, Yong

    Supporting Secure Ad-hoc User Collaboration in Grid Environments Markus Lorch, Dennis Kafura is a key requirement. Current grid security mechanisms support individual users who are members of well-defined virtual organizations. Recent research seeks to provide manageable grid security services for self

  19. Route Throughput Analysis with Spectral Reuse for Multi-Rate Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Tseng, Yu-Chee

    networks (MANETs) have received a lot of attention for its flexible network architecture. While many network (MANET) is a flexible and dynamic architecture that is attractive due to its ease in network1 Route Throughput Analysis with Spectral Reuse for Multi-Rate Mobile Ad Hoc Networks Lien-Wu Chen

  20. Energy-Balanced Cooperative Routing in Multihop Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Wang, Yu

    Energy-Balanced Cooperative Routing in Multihop Wireless Ad Hoc Networks Siyuan Chen Minsu Huang. In this paper, we aim to study the impact of cooperative routing on balancing the energy distribution among their transmission power, our cooperative routing method can balance the energy among neighboring nodes and maximize

  1. Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking

    E-Print Network [OSTI]

    Sirer, Emin Gun

    Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment Laura Marie Feeney, Martin Nilsson Abstract--Energy-aware design and evaluation of network protocols re- quires knowledge of the energy consumption behavior of actual wireless interfaces. But little

  2. LHAP: A Lightweight Network Access Control Protocol for Ad-Hoc Networks

    E-Print Network [OSTI]

    Xu, Shouhuai

    , One-way Key Chain, TESLA I. INTRODUCTION In ad hoc wireless networks, no base stations exist and every of the nodes relaying the packets. For example, since mobile hosts are usually battery powered, they are susceptible to battery exhaustion attacks [36]. Clearly, a network access control capability is essential

  3. Energy-based adaptation in simulations of survivability of ad hoc communication

    E-Print Network [OSTI]

    Energy-based adaptation in simulations of survivability of ad hoc communication Massimiliano Raciti by the IDS. The approach is based on a model for accounting CPU energy consumption in network simulation are overloaded or not available. Unfortunately, the constrained capacity of their batteries and the energy

  4. UAV surveillance using multihop ad-hoc wireless networks: a demonstrator

    E-Print Network [OSTI]

    Boucherie, Richard J.

    de Graaf and Gerard Hoekstra shelf quadrotor drones and wireless routers to create an ad-hoc network based on optimized link state routing, extending the operational range of the drones. 1 Introduction, flying robots equipped with cameras, often referred to as drones, have been used to overcome

  5. TCP Performance over Mobile Ad-hoc Networks -A Quantitative Study

    E-Print Network [OSTI]

    Park, Seung-Jong "Jay"

    gaining maturity, some researchers have lately shifted focus to the transport layer performance in ad-hoc networks [8], [9], [10]. Since TCP (Transmission Control Protocol) is by far the most used transport pro notification (ELFN) to the source from the link failure point. The source, upon receiving the ELFN freezes TCP

  6. Modular Topology Control and Energy Model for Wireless Ad Hoc Sensor Networks

    E-Print Network [OSTI]

    Jay Yang, Shanchieh

    Modular Topology Control and Energy Model for Wireless Ad Hoc Sensor Networks Niranjan in a harsh terrain typically are battery operated and, therefore, require energy efficient network protocols. In order to ease the analysis of the energy usage of proposed network protocols, this paper proposes

  7. Energy savings in wireless ad hoc sensor networks as a result of network synchronisation

    E-Print Network [OSTI]

    Haddadi, Hamed

    Energy savings in wireless ad hoc sensor networks as a result of network synchronisation Antonio of oceanographic monitoring using a collegiate-managed autonomous network of energy-conscious wireless sensors. We-to-node synchronised transmissions in order to reduce overhearing and therefore reduce energy expenses. SSSNP (Self

  8. ENERGY-AWARE SECURE MULTICAST COMMUNICATION IN AD-HOC NETWORKS USING GEOGRAPHIC LOCATION INFORMATION

    E-Print Network [OSTI]

    Lazos, Loukas

    ENERGY-AWARE SECURE MULTICAST COMMUNICATION IN AD-HOC NETWORKS USING GEOGRAPHIC LOCATION INFORMATION Loukas Lazos, Radha Poovendran Network Security and Cryptography Laboratory University by NSF grant ANI-0093187 and ARO grant DAAD-190210242 ABSTRACT The problem of securing multicast

  9. Exploiting Overhearing: Flow-Aware Routing for Improved Lifetime in Ad Hoc Networks

    E-Print Network [OSTI]

    Mans, Bernard

    neighboring flows and adapt their local routing dynamically. By combining this awareness with battery- aware flow and neighborhood is then presented in Section II-D. By combining the flow awareness with batteryExploiting Overhearing: Flow-Aware Routing for Improved Lifetime in Ad Hoc Networks Nirisha

  10. By-Law on ad hoc Consultation with MAUT [Approved April 16, 2015 Council Meeting] MAUT supports collegial governance and open communication and welcomes invitation from

    E-Print Network [OSTI]

    Shoubridge, Eric

    1 By-Law on ad hoc Consultation with MAUT [Approved April 16, 2015 Council Meeting] Preamble MAUT-Law concerns ad hoc requests for consultation with MAUT. It does not concern participation of MAUT governed by the MAUT Constitution and/or University Regulations. Principles and process An ad hoc

  11. IEEE ICC 2014 -Ad-hoc and Sensor Networking Symposium 978-1-4799-2003-7/14/$31.00 2014 IEEE 305

    E-Print Network [OSTI]

    Bahk, Saewoong

    IEEE ICC 2014 - Ad-hoc and Sensor Networking Symposium 978-1-4799-2003-7/14/$31.00 ©2014 IEEE 305 Ds Data packet of sequence number s A L Acknowledgement Channel sensing Forwarding data packet IEEE ICC 2014 - Ad-hoc and Sensor Networking Symposium 306 #12;IEEE ICC 2014 - Ad-hoc and Sensor Networking

  12. PNNI routing support for ad hoc mobile networking: A flat architecture

    SciTech Connect (OSTI)

    Martinez, L.; Sholander, P.; Tolendino, L.

    1997-12-01

    This contribution extends the Outside Nodal Hierarchy List (ONHL) procedures described in ATM Form Contribution 97-0766. These extensions allow multiple mobile networks to form either an ad hoc network or an extension of a fixed PNNI infrastructure. This contribution covers the simplest case where the top-most Logical Group Nodes (LGNs), in those mobile networks, all reside at the same level in a PNNI hierarchy. Future contributions will cover the general case where those top-most LGNs reside at different hierarchy levels. This contribution considers a flat ad hoc network architecture--in the sense that each mobile network always participates in the PNNI hierarchy at the preconfigured level of its top-most LGN.

  13. PNNI routing support for ad hoc mobile networking: The multilevel case

    SciTech Connect (OSTI)

    Martinez, L.; Sholander, P.; Tolendino, L.

    1998-01-01

    This contribution extends the Outside Nodal Hierarchy List (ONHL) procedures described in ATM Forum Contributions 97-0766 and 97-0933. These extensions allow multiple mobile networks to form either an ad hoc network or an extension of a fixed PNNI infrastructure. A previous contribution (97-1073) covered the simplest case where the top-most Logical Group Nodes (LGNs), in those mobile networks, all resided at the same level in a PNNI hierarchy. This contribution covers the more general case wherein those top-most LGNs may reside at different PNNI hierarchy levels. Both of the SNL contributions consider flat ad hoc network architectures in the sense that each mobile network always participates in the PNNI hierarchy at the pre-configured level of its top-most LGN.

  14. A Dirichlet reputation system in reliable routing of wireless ad hoc network

    SciTech Connect (OSTI)

    Yang, Dr. Li [University of Tennessee, Knoxville (UTK); Cui, Xiaohui [ORNL; Cemerlic, Alma [University of Tennessee, Knoxville (UTK)

    2010-01-01

    Ad hoc networks are very helpful in situations when no fixed network infrastructure is available, such as natural disasters and military conflicts. In such a network, all wireless nodes are equal peers simultaneously serving as both senders and routers for other nodes. Therefore, how to route packets through reliable paths becomes a fundamental problems when behaviors of certain nodes deviate from wireless ad hoc routing protocols. We proposed a novel Dirichlet reputation model based on Bayesian inference theory which evaluates reliability of each node in terms of packet delivery. Our system offers a way to predict and select a reliable path through combination of first-hand observation and second-hand reputation reports. We also proposed moving window mechanism which helps to adjust ours responsiveness of our system to changes of node behaviors. We integrated the Dirichlet reputation into routing protocol of wireless ad hoc networks. Our extensive simulation indicates that our proposed reputation system can improve good throughput of the network and reduce negative impacts caused by misbehaving nodes.

  15. Channel Sharing of Competing Flows in Ad Hoc Networks Yu Wang J. J. Garcia-Luna-Aceves

    E-Print Network [OSTI]

    California at Santa Cruz, University of

    again. Due to its stability and long-term fairness, the binary exponential backoff (BEB) is favored proposed for ad hoc networks. The BEB scheme is very effective in col- lision resolution when nodes face

  16. Channel Sharing of Competing Flows in Ad Hoc Networks Yu Wang J. J. GarciaLunaAceves

    E-Print Network [OSTI]

    California at Santa Cruz, University of

    again. Due to its stability and long­term fairness, the binary exponential backoff (BEB) is favored proposed for ad hoc networks. The BEB scheme is very effective in col­ lision resolution when nodes face

  17. Measurements from an 802.11b Mobile Ad Hoc Network Vincent Lenders, Jorg Wagner and Martin May

    E-Print Network [OSTI]

    Lenders, Vincent

    Measurements from an 802.11b Mobile Ad Hoc Network Vincent Lenders, J¨org Wagner and Martin May Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich, Switzerland {lenders, may

  18. Ad-hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks

    E-Print Network [OSTI]

    Guclu, Hasan; Yuksel, Murat

    2008-01-01

    Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the churn caused by the ad-hoc nodes joining or leaving the network. Preserving the structure becomes more prohibitive due to the distributed and potentially uncooperative nature of such networks, as in the peer-to-peer (P2P) networks. Thus, most practical solutions involve unstructured approaches while attempting to maintain the structure at various levels of protocol stack. The primary focus of this paper is to investigate construction and maintenance of scale-free topologies in a distributed manner without requiring global topology information at the time when nodes join or leave. We consider the uncooperative behavior of peers by limiting the number of neighbors to a pre-defined hard cutoff value (i.e., no peer is a major hub), and the ad-hoc behavior of peers by rewiring the neighbors of nodes leaving the network. We also investigate t...

  19. Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks

    E-Print Network [OSTI]

    Matijevic, Domagoj

    Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks Stefan Funke stations in such a way that approximately energy optimal paths can be retrieved in constant time, i. Keywords: Ad-Hoc and Sensor Networks, Routing, Power Control, Wireless LANs I. INTRODUCTION Ad hoc radio

  20. Inspiration from genetics to promote recognition and protection within ad hoc sensor networks

    E-Print Network [OSTI]

    Korsnes, Reinert

    2009-01-01

    This work illustrates potentials for recognition within {\\em ad hoc} sensor networks if their nodes possess individual inter-related biologically inspired genetic codes. The work takes ideas from natural immune systems protecting organisms from infection. Nodes in the present proposal have individual gene sets fitting into a self organised phylogenetic tree. Members of this population are genetically ''relatives''. Outsiders cannot easily copy or introduce a new node in the network without going through a process of conception between two nodes in the population. Related nodes can locally decide to check each other for their genetic relation without directly revealing their gene sets. A copy/clone of a gene sequence or a random gene set will appear as alien. Nodes go through a cycle of introduction (conception or ''birth'') with parents in the network and later exit from it (''death''). Hence the phylogenetic tree is dynamic or possesses a genetic drift. Typical lifetimes of gene sets and number of offspring ...

  1. Transmission Capacity of Wireless Ad Hoc Networks with Energy Harvesting Nodes

    E-Print Network [OSTI]

    Vaze, Rahul

    2012-01-01

    Transmission capacity of an ad hoc wireless network is analyzed when each node of the network harvests energy from nature, e.g. solar, wind, vibration etc. Transmission capacity is the maximum allowable density of nodes, satisfying a per transmitter-receiver rate, and an outage probability constraint. Energy arrivals at each node are assumed to follow a Bernoulli distribution, and each node stores energy using an energy buffer/battery. For ALOHA medium access protocol (MAP), optimal transmission probability that maximizes the transmission capacity is derived as a function of the energy arrival distribution. Game theoretic analysis is also presented for ALOHA MAP, where each transmitter tries to maximize its own throughput, and symmetric Nash equilibrium is derived. For CSMA MAP, back-off probability and outage probability are derived in terms of input energy distribution, thereby characterizing the transmission capacity.

  2. 2014 IEEE 28-th Convention of Electrical and Electronics Engineers in Israel The Ergodic Rate Density of MIMO Ad-hoc

    E-Print Network [OSTI]

    Bergel, Itsik

    2014 IEEE 28-th Convention of Electrical and Electronics Engineers in Israel The Ergodic Rate the scaling laws of the Ergodic Rate Density (ERD) in ALOHA Wireless Ad-hoc Networks (WANETs) that utilize bound and the accuracy of the estimated parameters. I. INTRODUCTION Wireless Ad-hoc Networks (WANETs

  3. Abstract--Wireless Sensor Network (WSN) is an emerging special type of ad-hoc wireless networks technology. It is

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Abstract-- Wireless Sensor Network (WSN) is an emerging special type of ad-hoc wireless networks that differentiate it from other types of wireless networks. These differences raise new challenges to be overcome are wireless networks where nodes can communicate wirelessly with each other without the need for a fixed

  4. 228 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 7, NO. 2, APRIL 1999 Ad Hoc Mobility Management with

    E-Print Network [OSTI]

    Haas, Zygmunt J.

    the construction of UQS through the balanced incomplete block designs. The average cost, due to call loss is sometimes necessary to reduce the cost of mobility management. Index Terms--Ad hoc network, balanced on the average cost, we investigate the tradeoff between the system reliability and the cost of location updates

  5. Int. J. Ad Hoc and Ubiquitous Computing, Vol. 4, No. 5, 2009 251 Multi-hop scatternet formation and routing

    E-Print Network [OSTI]

    Wang, Yu

    Int. J. Ad Hoc and Ubiquitous Computing, Vol. 4, No. 5, 2009 251 Multi-hop scatternet formation of Computer Science, Illinois Institute of Technology, Chicago, IL 60616, USA E-mail: xli@cs.iit.edu Abstract: This paper addresses the scatternet formation for large scale multi-hop Bluetooth networks. We first describe

  6. Abstract-Mobile Ad Hoc NETworks (MANETs) are an emerging class of network architectures that are characterized

    E-Print Network [OSTI]

    Perkins, Dmitri

    of fixed infrastructure. The primary motivation for such networks is increased flexibility and mobilityAbstract- Mobile Ad Hoc NETworks (MANETs) are an emerging class of network architectures that are characterized by their highly dynamic topology, limited resources (i. e., bandwidth and power), and lack

  7. Ad-hoc Authorship Attribution Competition, part of ALLC/ACH 2004 CNG Method with Weighted Voting

    E-Print Network [OSTI]

    Keselj, Vlado

    Ad-hoc Authorship Attribution Competition, part of ALLC/ACH 2004 CNG Method with Weighted Voting Vlado Keselj and Nick Cercone ({vlado,nick}cs.dal.ca) CNG Method for Authorship Attribution. The Common N-Grams (CNG) classification method for authorship attribution (AATT) was described in [2

  8. Ad-hoc Authorship Attribution Competition, part of ALLC/ACH 2004 CNG Method with Weighted Voting

    E-Print Network [OSTI]

    Keselj, Vlado

    Ad-hoc Authorship Attribution Competition, part of ALLC/ACH 2004 CNG Method with Weighted Voting Vlado Ke#20;selj and Nick Cercone (fvlado,nickg@cs.dal.ca) CNG Method for Authorship Attribution. The Common N-Grams (CNG) classi#12;cation method for authorship attribution (AATT) was described in [2

  9. Load-Sensitive Transmission Power Control in Wireless Ad-hoc Networks Seung-Jong Park Raghupathy Sivakumar

    E-Print Network [OSTI]

    Sivakumar, Raghupathy

    transmis- sion power depends on several network characteristics such as the number of stations, the network problem in ad-hoc wireless networks. The transmission power of the stations in a network determines the network topol- ogy, The transmission power of the stations in a network deter- mines the network topology

  10. Energy and Bandwidth-Efficient Key Distribution in Wireless Ad-Hoc Networks: A Cross-Layer

    E-Print Network [OSTI]

    Lazos, Loukas

    messages, and (d) average update energy. For each metric, we formulate an optimization problem and show1 Energy and Bandwidth-Efficient Key Distribution in Wireless Ad-Hoc Networks: A Cross metrics: (a) member key storage, (b) group controller (GC) transmissions, (c) multicast group (MG) update

  11. Energy and Bandwidth-Efficient Key Distribution in Wireless Ad-Hoc Networks: A Cross-Layer

    E-Print Network [OSTI]

    Poovendran, Radha

    ) multicast group (MG) update messages, and (d) average update energy. For each metric, we formulate1 Energy and Bandwidth-Efficient Key Distribution in Wireless Ad-Hoc Networks: A Cross, and GC transmissions, while significantly reducing the energy and bandwidth consumption of the network

  12. Design Considerations for an On-Demand Minimum Energy Routing Protocol for a Wireless Ad Hoc Network

    E-Print Network [OSTI]

    Brown, Timothy X.

    1 Design Considerations for an On-Demand Minimum Energy Routing Protocol for a Wireless Ad Hoc at Boulder Boulder, CO-80309 Abstract--A minimum energy routing protocol reduces the energy con- sumption of energy to get the packets to their destination. This paper identifies the necessary features of an on

  13. AN ECONOMICS-BASED POWER-AWARE PROTOCOL FOR COMPUTATION DISTRIBUTION IN MOBILE AD-HOC NETWORKS

    E-Print Network [OSTI]

    Shang, Li

    AN ECONOMICS-BASED POWER-AWARE PROTOCOL FOR COMPUTATION DISTRIBUTION IN MOBILE AD-HOC NETWORKS Li, Princeton, NJ 08544, USA ABSTRACT In this paper, we present a new economics-based power- aware protocol, called the distributed economic subcontracting protocol (DESP), that dynamically distributes task

  14. Int. J. Ad Hoc and Ubiquitous Computing, Vol. , No. , 2012 1 Worst-case Latency of Broadcast in Intermittently

    E-Print Network [OSTI]

    Int. J. Ad Hoc and Ubiquitous Computing, Vol. , No. , 2012 1 Worst-case Latency of Broadcast one year as a Research Fellow at Trinity College Dubin. He received his MSc degree in computer science and engi- neering in 2005 and his PhD in computer science in 2011 both from Link¨oping University. His Ph

  15. Int. J. Ad Hoc and Ubiquitous Computing, Vol. 1, No. 4, 2006 203 Copyright 2006 Inderscience Enterprises Ltd.

    E-Print Network [OSTI]

    Huang, Xinming

    Int. J. Ad Hoc and Ubiquitous Computing, Vol. 1, No. 4, 2006 203 Copyright © 2006 Inderscience and Ubiquitous Computing, Vol. 1, No. 4, pp.203­209. Biographical notes: Xin-Ming Huang is an Assistant Professor, embedded systems and reconfigurable computing. Jing Ma received BE and ME Degrees from North

  16. How gas-dynamic flare models powered by Petschek reconnection differ from those with ad hoc energy sources

    E-Print Network [OSTI]

    Longcope, Dana

    2015-01-01

    Aspects of solar flare dynamics, such as chromospheric evaporation and flare light-curves, have long been studied using one-dimensional models of plasma dynamics inside a static flare loop, subjected to some energy input. While extremely successful at explaining the observed characteristics of flares, all such models so far have specified energy input ad hoc, rather than deriving it self-consistently. There is broad consensus that flares are powered by magnetic energy released through reconnection. Recent work has generalized Petschek's basic reconnection scenario, topological change followed by field line retraction and shock heating, to permit its inclusion into a one-dimensional flare loop model. Here we compare the gas dynamics driven by retraction and shocking to those from more conventional static loop models energized by ad hoc source terms. We find significant differences during the first minute, when retraction leads to larger kinetic energies and produces higher densities at the loop top, while ad h...

  17. Characterizing the Interaction Between Routing and MAC Protocols in Ad-Hoc Networks

    SciTech Connect (OSTI)

    Barrett, C. L. (Christopher L.); Drozda, M. (Martin); Marathe, A. (Achla); Marathe, M. V. (Madhav V.)

    2002-01-01

    We empirically study the effect of mobility on the performance of protocols designed for wireless ad-hoc networks. An important objective is to study the interaction of the Routing and MAC layer protocols under different mobility parameters. We use three basic mobility models: grid mobility model, random waypoint model, and exponential correlated random model. The performance of protocols is measured in terms of (i) latency, (ii) throughput, (iii) number of packets received, (iv) long term fairness and (v) number of control packets at the MAC and routing layer level. Three different commonly studied routing protocols are used: AODV, DSR and LAR1. Similarly three well known MAC protocols are used: MACA, 802.1 1 and CSMA. Our main contribution is simulation based experiments coupled with rigorous statistical analysis to characterize the interaction of MAC layer protocols with routing layer protocols in ad-hoc networks. From the results, we can conclude the following: e No single MAC or Routing protocol dominated the other protocols in their class. Probably more interestingly, no MAURouting protocol combination was better than other combinations over all scenarios and response variables. 0 In general, it is not meaningful to speak about a MAC or a routing protocol in isolation. Presence of interaction leads to trade-offs between the amount of control packets generated by each layer. The results raise the possibility of improving the performance of a particular MAC layer protocol by using a cleverly designed routing protocol or vice-versa. Thus in order to improve the performanceof a communication network, it is important to study the entire protocol stack as a single algorithmic construct; optimizing individual layers in the seven layer OS1 stack will not yield performance improvements beyond a point. A methodological contribution of this paper is the use of statistical methods such as analysis of variance (ANOVA), to characterize the interaction between the protocols, mobility patterns and speed. Such methods allow us to analyze complicated experiments with large input space in a systematic manner.

  18. Cross-layer Routing for Peer Database Querying over Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Papapetrou, Evaggelos

    community has witnessed a significant rise of data-centric net- working applications over the last years. Furthermore, the advent of mobile devices has created an increased interest for data-centric applications. On the other hand, although significant work has been performed on data-centric applications over MANETs

  19. Automatic Hypermedia Generation for Ad-hoc Queries on Semi-structured Data

    E-Print Network [OSTI]

    Houben, Geert-Jan

    attributes or to show extra ones. The user also enters object selection criteria. We could use a language process. We address important aspects of the software that facilitates the genera- tion process. KEYWORDS for the desired information. Our target applications are collections or libraries of digital (semi

  20. RealTime SpatioTemporal Query Processing in Mobile AdHoc Sensor Networks

    E-Print Network [OSTI]

    that has multiple sensors (e.g., mo­ tion sensors, acoustic sensors, infrared light emitting diodes,

  1. Real-Time Spatio-Temporal Query Processing in Mobile Ad-Hoc Sensor Networks

    E-Print Network [OSTI]

    that has multiple sensors (e.g., mo- tion sensors, acoustic sensors, infrared light emitting diodes, and pa

  2. Spectrum Sharing between Cooperative Relay and Ad-hoc Networks: Dynamic Transmissions under Computation and Signaling Limitations

    E-Print Network [OSTI]

    Sun, Yin; Li, Yunzhou; Zhou, Shidong; Xu, Xibin

    2010-01-01

    This paper studies a spectrum sharing scenario between an uplink cognitive relay network (CRN) and some nearby low power ad-hoc networks. In particular, the dynamic resource allocation of the CRN is analyzed, which aims to minimize the average interfering time with the ad-hoc networks subject to a minimal average uplink throughput constraint. A long term average rate formula is considered, which is achieved by a half-duplex decode-and-forward (DF) relay strategy with multi-channel transmissions. Both the source and relay are allowed to queue their data, by which they can adjust the transmission rates flexibly based on sensing and predicting the channel state and ad-hoc traffic. The dynamic resource allocation of the CRN is formulated as a non-convex stochastic optimization problem. By carefully analyzing the optimal transmission time scheduling, it is reduced to a stochastic convex optimization problem and solved by the dual optimization method. The signaling and computation processes are designed carefully t...

  3. Skyline Queries Against Mobile Lightweight Devices in MANETs Zhiyong Huang1

    E-Print Network [OSTI]

    Ooi, Beng Chin

    Skyline Queries Against Mobile Lightweight Devices in MANETs Zhiyong Huang1 Christian S. Jensen2 and distributed setting, where each mobile device is capable of holding only a portion of the whole dataset; where devices communicate through mobile ad hoc networks; and where a query issued by a mobile user

  4. Ad Hoc & Sensor Wireless Networks, Vol. 3, pp. 5575 Reprints available directly from the publisher

    E-Print Network [OSTI]

    Liang, Weifa

    Photocopying permitted by license only c 2007 Old City Publishing, Inc. Published by license under the OCP Science imprint, a member of the Old City Publishing Group Energy-Efficient Aggregate Query Evaluation. In Final Form: February 28, 2006. Wireless sensor networks, consisting of sensors equipped with energy

  5. Qunits: queried units in database search

    E-Print Network [OSTI]

    Nandi, Arnab

    2009-01-01

    Keyword search against structured databases has become a popular topic of investigation, since many users find structured queries too hard to express, and enjoy the freedom of a ``Google-like'' query box into which search terms can be entered. Attempts to address this problem face a fundamental dilemma. Database querying is based on the logic of predicate evaluation, with a precisely defined answer set for a given query. On the other hand, in an information retrieval approach, ranked query results have long been accepted as far superior to results based on boolean query evaluation. As a consequence, when keyword queries are attempted against databases, relatively ad-hoc ranking mechanisms are invented (if ranking is used at all), and there is little leverage from the large body of IR literature regarding how to rank query results. Our proposal is to create a clear separation between ranking and database querying. This divides the problem into two parts, and allows us to address these separately. The first tas...

  6. The Capacityand Energy Efficiency of Wireless Ad Hoc Networks with MultipacketReception

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2008-01-01

    Meng, T. Bits-per-joule capacity of energy-limited wirelessThe Capacity and Energy Efficiency of Wireless Ad Hocl ( n ) Figure 5: Capacity and energy efficiency tradeoff

  7. EFFECT OF MOBILITY ON PERFORMANCE OF WIRELESS AD-HOC NETWORK PROTOCOLS.

    SciTech Connect (OSTI)

    Barrett, C. L. (Christopher L.); Drozda, M. (Martin); Marathe, M. V. (Madhav V.); Marathe, A. (Achla)

    2001-01-01

    We empirically study the effect of mobility on the performance of protocols designed for wireless adhoc networks. An important ohjective is to study the interaction of the Routing and MAC layer protocols under different mobility parameters. We use three basic mobility models: grid mobility model, random waypoint model, and exponential correlated random model. The performance of protocols was measured in terms of (i) latency, (ii) throughput, (iii) number of packels received, (iv) long term fairness and (v) number of control packets at the MAC layer level. Three different commonly studied routing protocols were used: AODV, DSR and LAR1. Similarly three well known MAC protocols were used: MACA, 802.1 1 and CSMA. The inair1 conclusion of our study include the following: 1. 'I'he performance of the: network varies widely with varying mobility models, packet injection rates and speeds; and can ba in fact characterized as fair to poor depending on the specific situation. Nevertheless, in general, it appears that the combination of AODV and 802.1 I is far better than other combination of routing and MAC protocols. 2. MAC layer protocols interact with routing layer protocols. This concept which is formalized using statistics implies that in general it is not meaningful to speak about a MAC or a routing protocol in isolation. Such an interaction leads to trade-offs between the amount of control packets generated by each layer. More interestingly, the results wise the possibility of improving the performance of a particular MAC layer protocol by using a cleverly designed routing protocol or vice-versa. 3. Routing prolocols with distributed knowledge about routes are more suitable for networks with mobility. This is seen by comparing the performance of AODV with DSR or LAR scheme 1. In DSli and IAR scheme 1, information about a computed path is being stored in the route query control packct. 4. MAC layer protocols have varying performance with varying mobility models. It is not only speed that influences the performance but also node degree and connectivity of the dynamic network that affects the protocol performance. 'The main implication of OUI' work is that performance analysis of protocols at a given level in the protocol stack need to be studied not locally in isolation but as a part of the complete protocol stack. The results suggest that in order to improve the pcrlormance of a communication network, it will be important to study the entire protocol stack as a single algorithmic construct; optimizing individual layers in the 7 layer OS1 stilck will not yield performance improvements beyond a point. A methodological contribution of this paper is the use of statistical methods such as design of experinierits arzd aiialysis qf variance methods to characterize the interaction between the protocols, mobility patterns and speed. This allows us to mako much more informed conclusions about the performance of thc protocols than would have been possible by merely running these experiments and observing the data. These ideas are of independtmt interest and are applicable in other contexts wherein one experimentally analyzes algorithms.

  8. Canonical and kinetic forms of the electromagnetic momentum in an ad hoc quantization scheme for a dispersive dielectric

    SciTech Connect (OSTI)

    Garrison, J.C.; Chiao, R.Y.

    2004-11-01

    An ad hoc quantization scheme for the electromagnetic field in a weakly dispersive, transparent dielectric leads to the definition of canonical and kinetic forms for the momentum of the electromagnetic field in a dispersive medium. The canonical momentum is uniquely defined as the operator that generates spatial translations in a uniform medium, but the quantization scheme suggests two possible choices for the kinetic momentum operator, corresponding to the Abraham or the Minkowski momentum in classical electrodynamics. Another implication of this procedure is that a wave packet containing a single dressed photon travels at the group velocity through the medium. The physical significance of the canonical momentum has already been established by considerations of energy and momentum conservation in the atomic recoil due to spontaneous emission, the Cerenkov effect, the Doppler effect, and phase matching in nonlinear optical processes. In addition, the data of the Jones and Leslie radiation pressure experiment is consistent with the assignment of one ({Dirac_h}/2{pi})k unit of canonical momentum to each dressed photon. By contrast, experiments in which the dielectric is rigidly accelerated by unbalanced electromagnetic forces require the use of the Abraham momentum.

  9. A Time-Slotted On-Demand Routing Protocol for Mobile Ad Hoc Unmanned Vehicle Systems

    SciTech Connect (OSTI)

    Hope Forsmann; Robert Hiromoto; John Svoboda

    2007-04-01

    The popularity of UAVs has increased dramatically because of their successful deployment in military operations, their ability to preserve human life, and the continual improvements in wireless communication that serves to increase their capabilities. We believe the usefulness of UAVs would be dramatically increased if formation flight were added to the list of capabilities. Currently, sustained formation flight with a cluster of UAVs has only been achieved with two nodes by the Multi-UAV Testbed at the Massachusetts Institute of Technology. (Park, 2004) Formation flight is a complex operation requiring the ability to adjust the flight patterns on the fly and correct for wind gusts, terrain, and differences in node equipment. All of which increases the amount of inner node communication. Since one of the problems with MANET communication is network congestion, we believe a first step towards formation flight can be made through improved inner node communication. We have investigated current communication routing protocols and developed an altered hybrid routing protocol in order to provide communication with less network congestion.

  10. Ad hoc cloud computing 

    E-Print Network [OSTI]

    McGilvary, Gary Andrew

    2014-11-27

    Commercial and private cloud providers offer virtualized resources via a set of co-located and dedicated hosts that are exclusively reserved for the purpose of offering a cloud service. While both cloud models appeal to ...

  11. With respect to energy balance in mobile ad hoc networks, there have been active researches proposing energy-aware

    E-Print Network [OSTI]

    Yu, Chansu

    hoc communication, because nodes work both as host and as router, nodes can easily consume much energy consume more energy than others and deplete its energy early [5]. This can cause an unbalanced nodes easily consume more energy than others. Even if the route path is too stable to be changed

  12. Document Representation and Query Expansion Models for Blog Recommendation

    E-Print Network [OSTI]

    Callan, Jamie

    Document Representation and Query Expansion Models for Blog Recommendation Jaime Arguello document representation models and two query expansion models for the task of recommend- ing blogs to a user in response to a query. Blog relevance ranking differs from traditional document ranking in ad

  13. Spatial Keyword Query (SKQ)

    E-Print Network [OSTI]

    Papadias, Dimitris

    S contains keywords {"Starbucks", "Boardway", "Cinema"} 3 #12;Types of Query Single object oriented SKQ o", "Starbucks"} Result = {o7, o9 } 10 #12;m Closest Keywords Query (mCK Query) Query input o a set of keywords., ICDE'09 Example Input: q. = {"Cinema", "Starbucks"} Result = {o7, o9 } 11 #12;localitySearch Query

  14. Capacity consideration of wireless ad hoc networks

    E-Print Network [OSTI]

    Tan, Yusong

    2008-01-01

    in Electrical Engineering (Communication Theory and Systems)of Science Electrical Engineering (Communication Theory andPhilosophy Electrical Engineering (Communication Theory and

  15. Communication Paradigms for Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Collins, Justin Scott

    2014-01-01

    Mur06] Amy L. Murphy et al. “Lime: A Coordination Middlewareof mobile devices using the LIME II tuple-space framework. ”Bogdan Carbunar and et al. “Lime revisited. ” In Mobile

  16. Adaptive protocols for mobile ad hoc networks 

    E-Print Network [OSTI]

    Holland, Gavin Douglas

    2005-02-17

    to take advantage of the presence of multirate links. We then investigate the performance of iv TCP, showing how communication outages caused by link failures and routing delays can be very detrimental to its performance. In response, we present a solution.... : : : : : : : : : : : : : : : : : : : : : : : : 62 15 Performance of RBAR when a simple heuristic is used by the sender to try and predict the best data rate for the conditions, in an e?ort to reduce the frequency of the necessity for reservation subheaders...

  17. Clock synchronization for mobile ad hoc networks 

    E-Print Network [OSTI]

    Chandra, Rajan

    2013-02-22

    synchronization uses MANet specific communication primitives with Minimum Connected Dominating Set (MCDS) approximation algorithms. This involves using a subset of nodes in the network to broadcast clock information to neighboring nodes. Several MCDS approximation...

  18. Multicast Routing in Ad-Hoc Networks

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2007-01-01

    or IRs, which are wireless routers. However, it will beIR 100a-1001‘ is a wireless router with an IP address and anot be based on wireless links for router interconnection.

  19. Multiple Query Probabilistic Roadmap Planning using Single Query Planning Primitives

    E-Print Network [OSTI]

    Chen, Brian Y.

    Multiple Query Probabilistic Roadmap Planning using Single Query Planning Primitives Kostas E query planners. Our implementation uses a probabilistic roadmap method (PRM) with bidirec- tional the strengths of both is obtained. The probabilistic roadmap method (PRM) approach to motion planning

  20. Query Optimization Techniques Class Hierarchies

    E-Print Network [OSTI]

    Mannheim, Universität

    Query Optimization Techniques Exploiting Class Hierarchies Sophie Cluet 1 Guido Moerkotte 2 1 INRIA Since the introduction of object base management systems (OBMS), many query optimization techniques tailored for object query languages have been proposed. They adapt known optimization techniques

  1. A Query Simulation System To Illustrate Database Query Execution

    E-Print Network [OSTI]

    Wagner, Paul J.

    the steps a DBMS performs during query execution. Database students need to be familiar with the underlying query execution process in order to understand how the DBMS implements commits and rollbacks. The query execution process also impacts query optimization techniques, and provides the foundation for how the DBMS

  2. Smithsonian/NASA ADS Physics/Geophysics Abstract Service Find Similar Abstracts (with default settings below)

    E-Print Network [OSTI]

    Mojahedi, Mohammad

    Smithsonian/NASA ADS Physics/Geophysics Abstract Service · Find Similar Abstracts (with default | Query Form | Preferences | HELP | FAQ Physics/Geophysics arXiv e-prints Send Query Reset #12;

  3. Multiple Query Probabilistic Roadmap Planning using Single Query Planning Primitives

    E-Print Network [OSTI]

    Kavraki, Lydia E.

    Multiple Query Probabilistic Roadmap Planning using Single Query Planning Primitives Kostas E query planners. Our implementation uses a probabilistic roadmap method PRM with bidirectional rapidly which uses the strengths of both is obtained. The probabilistic roadmap method (PRM) approach to motion

  4. ARGUS: Efficient Scalable Continuous Query Optimization for Large-Volume Data Streams

    E-Print Network [OSTI]

    Carbonell, Jaime

    , and topological query network optimization. Building on top of a DBMS, the system provides a value-adding package to directly running the continuous queries on the DBMS, ARGUS achieves well over a 100-fold improvement processing becomes increasingly demanding. It readily arises from the existing DBMS applications to manage

  5. Reflections for quantum query algorithms

    E-Print Network [OSTI]

    Ben W. Reichardt

    2010-05-10

    We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently queries the input string. Originally introduced for solving the unstructured search problem, this two-reflections structure is therefore a universal feature of quantum algorithms. Our proof goes via the general adversary bound, a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. By a quantum algorithm for evaluating span programs, this lower bound is known to be tight up to a sub-logarithmic factor. The extra factor comes from converting a continuous-time query algorithm into a discrete-query algorithm. We give a direct and simplified quantum algorithm based on the dual SDP, with a bounded-error query complexity that matches the general adversary bound. Therefore, the general adversary lower bound is tight; it is in fact an SDP for quantum query complexity. This implies that the quantum query complexity of the composition f(g,...,g) of two boolean functions f and g matches the product of the query complexities of f and g, without a logarithmic factor for error reduction. It further shows that span programs are equivalent to quantum query algorithms.

  6. INDOOR POSITIONING AN AD-HOC POSITIONING SYSTEM Rainer Mautz

    E-Print Network [OSTI]

    to enable continuous tracking of the location of devices in all environments. Highly accurate, reliable 3D computers, printers, or simple tags with wireless radio connections that are `intelligent' enough to be able

  7. Throughput optimal routing in wireless Ad-hoc networks

    E-Print Network [OSTI]

    Zhuang, Hairuo

    2010-01-01

    in Electrical Engineering (Communication Theory and Systems)Ph. D. in Electrical Engineering (Communication Theory andin Electrical Engineering (Communication Theory and Systems)

  8. Power and spectrum efficient communications in wireless ad hoc networks

    E-Print Network [OSTI]

    Qu, Qi

    2008-01-01

    in Electrical and Computer Engineering (Communication Theoryin Electrical Engineering (Communication Theory and Systems)in Electrical Engineering (Communication Theory and Systems)

  9. Information Dissemination in Mobile Ad-Hoc Geosensor Networks

    E-Print Network [OSTI]

    Duckham, Matt

    , and Lars Kulik3 1 National Center for Geographic Information and Analysis University of Maine, Orono, ME-aware systems are founded on a centralized model of information systems, typified by the client-server model- dancy. 1 Introduction Increasing decentralization is a widespread feature of information system archi

  10. Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Grosu, Radu

    devices that communicate over wireless links. Mobile devices are typically powered by batteries applications [3] [4] [5] [6] need sensor nodes to be mobile making such networks similar to MANETS. However, embedded devices and impracticality of recharging batteries. Thus, mobile sensor networks make

  11. Energy Aware Implementation of an Ad Hoc Routing Protocol

    E-Print Network [OSTI]

    Brown, Timothy X.

    to the world of research. This thesis is a product of his never-ending knowledge, ingenious ideas, constant, and encouragement. I would like to thank my parents for inspiring me to pursue higher education. I would lik

  12. Delay Optimal Event Detection on Ad Hoc Wireless Sensor Networks

    E-Print Network [OSTI]

    Kumar, Anurag

    , Bangalore, INDIA email: kprem@ece.iisc.ernet.in, prasanthi.m@gmail.com, anurag@ece.iisc.ernet.in We consider causal order. In this case, the decision statistic depends on the network delays as well, whereas in the network­oblivious case, the decision statistic does not depend on the network delays. This yields

  13. Towards the Efficient Design of Vehicular Ad-Hoc Networks

    E-Print Network [OSTI]

    Dulmage, Jared

    2012-01-01

    OFDM Outage . . . . . . . . . . .Outage probability vs.vs. SNR . . . . . . . . . . . . . . . . . . . . . . Outage

  14. Wireless Networks wireless ad-hoc and mesh networks

    E-Print Network [OSTI]

    Biagioni, Edoardo S.

    instead of radio waves Wireless Sensor Networks the Internet of Things, IoT #12;wireless mesh networks radio on and receiving a packet requires the most but even leaving on the radio still uses energy keep the radio off as much as possible, limit the number of packets sent hard to know when to turn on the radio

  15. Lifeline: Emergency Ad hoc Network Se-Hang Cheong1

    E-Print Network [OSTI]

    Si, Yain Whar "Lawrence"

    propagation techniques. Lifeline also has the ability to recover from partial crash of network and nodes lost be disrupted during natural disasters, such as earthquakes, hurricane, tsunami, etc. In such situations, mobile from partial crash of network and nodes lost. In this paper, we show how commonly available mobile

  16. Stable Energy-Aware Topology Management in Ad Hoc Networks

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2010-01-01

    Different types of nodes consume energy at different rates.less interference and consume less energy. Significant worksnodes can consume large amounts of energy by main- taining

  17. Power and spectrum efficient communications in wireless ad hoc networks

    E-Print Network [OSTI]

    Qu, Qi

    2008-01-01

    A. Bahai, “Energy-efficiency of MIMO and cooperative MIMOMIMO-based cooperative communication for energy-constrainedcooperation, cooperative MIMO can achieve better energy and

  18. Multiple-antenna systems in ad-hoc wireless networks

    E-Print Network [OSTI]

    Govindasamy, Siddhartan, 1975-

    2008-01-01

    The increasing demand for wireless communication services has resulted in crowding of the electromagnetic spectrum. The "spectral-commons" model, where a portion of the electromagnetic spectrum is public and used on an ...

  19. Topic Based Language Models for ad hoc Information Retrieval

    E-Print Network [OSTI]

    Azzopardi, Leif

    University of Paisley Paisley UK E-mail: leif.azzopardi@paisley.ac.uk Mark Girolami Computing Science

  20. Throughput Analysis of Wireless Ad-Hoc Cognitive Radio Networks 

    E-Print Network [OSTI]

    Banaei, Armin

    2014-04-25

    In this dissertation we consider the throughput performance of cognitive radio networks and derive the optimal sensing and access schemes for secondary users that maximizes their sum-throughput while guaranteeing certain ...

  1. SBA: A Simple Backoff Algorithm for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Guérin-Lassous, Isabelle

    approaches modify the BEB (Binary Exponential Backoff) al- gorithm of IEEE 802.11 to provide better. Contrary to the BEB algorithm, SBA has only two distinct contention window sizes. SBA also uses the same

  2. A Benchmarking System for Mobile Ad Hoc Network Routing Protocols

    E-Print Network [OSTI]

    Hiranandani, Daniel

    2012-01-01

    Smart EnergyMap . . . . . . . . . . . . . . . . . . Smart Energy GridSelected for Smart Energy Grid Scenario . . . . . . . . .

  3. A Secure Routing Protocol for Ad Hoc Wireless Networks

    E-Print Network [OSTI]

    Klappenecker, Andreas

    't need to pass through firewalls or gateways Routing protocol controls the network but is based DSR uses source routes in data packets Can lead to DoS #12;Attacks using modification ­ Tunneling Two

  4. 1 Antenna Beamforming and Power Control for Ad Hoc Networks

    E-Print Network [OSTI]

    Ramanathan, Ram

    parameters ­ transmit power, and antenna beam direction ­ and present state-of-the-art methods control includes reduced interference and lower energy consumption. Beamforming and lower powers are also and power control appears to have potential, a number of questions need to be answered: What techniques

  5. A Power Control MAC Protocol for Ad Hoc Networks

    E-Print Network [OSTI]

    Han, Richard Y.

    . Copyright 2002 ACM 1-58113-486-X/02/0009 ...¯ 5.00. D¥BUiFhVGB@BGIBxD¥|§twVGS§I8Hh£vw9£P¥7SXIwAsD¥BSe27I

  6. Adaptive Scheduling in Ad Hoc and Cellular Wireless Networks

    E-Print Network [OSTI]

    Tan, Choo Chin

    2013-01-01

    classes: regular nodes (RNs) and backbone capable nodes (that consists solely of RNs. We note that for the specialits associated BCNs and RNs will form an access network (

  7. Poster: -Graphs: Flexible Topology Control in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Williamson, Carey

    (m) 0 100 200 300 400 500 600 700 0 100 200 300 400 500 600 700 YCoordinate(m) X Coordinate (m) (c) G consumption. 0 100 200 300 400 500 600 700 0 100 200 300 400 500 600 700 YCoordinate(m) X Coordinate (m) 0 100 200 300 400 500 600 700 0 100 200 300 400 500 600 700 YCoordinate(m) X Coordinate (m) (a) Gm (Initial

  8. Scalable Phrase Mining for Ad-hoc Text Analytics

    E-Print Network [OSTI]

    Waldmann, Uwe

    , customer mail and reports, or Web 2.0 con- tributions offer a great potential for enhancing business, and Web 2.0 community data. This enables advanced Business-Intelligence (BI) ap- plications, or by focusing on a particular time period. We investigate alterna- tive definitions of phrase interestingness

  9. Unified Routing Scheme for Ad-Hoc Internetworking

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2007-01-01

    life of tetherless wireless routers. By contrast, an on-IR is essentially a wireless IP router; with the exceptionswireless environment. In contrast to the IP Internet, mobility of hosts and routers,

  10. Maximizing the throughput of large ad hoc wireless networks

    E-Print Network [OSTI]

    Hua, Y; Huang, Y; Garcia-Luna-Aceves, J J

    2006-01-01

    network consists of wireless routers that are highly coop-point for every m wireless routers in a 2-D This capacitylinks are used for wireless routers). tion rates of a small

  11. Topology management protocols in ad hoc wireless sensor networks 

    E-Print Network [OSTI]

    Kim, Hogil

    2009-05-15

    and destination. The multiple paths discovered are maintained in a memory, i.e., route cache, and can be used either as a backup route for a broken path or to balance network tra c. However, the decision procedure to nd an optimal path to balance network tra c... in this work. From the set S of all sensor nodes, All sensor nodes 1st-layer 2nd-layer Kth -layer Fig. 1. K-Layer Coverage we select only a small number of nodes to form 1-coverage and repeat this process K times to form K-coverage. A set Si, which is ith...

  12. Asymptotically Optimal Geometric Mobile Ad-Hoc Routing Fabian Kuhn

    E-Print Network [OSTI]

    -geometric algorithm that also matches the lower bound, but needs some mem- ory at each node. This establishes

  13. Bid Activation Multiple Access in Ad Hoc Networks

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2006-01-01

    12]. Each node bids on a varying number of data slots in acorrect schedule bid for slots. A Data B Fig. 2. E C Data Ddata, A and C will request activation. Hence, B will bid and

  14. Resource Management in Multi-hop Ad Hoc Networks

    E-Print Network [OSTI]

    , they do not provide a way to control the consumption of resources in the network, such as the battery power or the carrying capacity of the nodes. This proposal describes a scheme of path-state and flow : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 5.2 Balancing Battery Life

  15. Query | Department of Energy

    Broader source: Energy.gov (indexed) [DOE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustmentsShirleyEnergy AEnergyPresidentialThis 3-D rendering of apumpthe firstEnergyQuery

  16. Optimal Bayesian Recommendation Sets and Myopically Optimal Choice Query Sets

    E-Print Network [OSTI]

    Toronto, University of

    .g., query responses or behavioral observations). The most natural criterion for choosing queries is expected

  17. Top-N Query: Query Language, Distance Function and Processing Strategies

    E-Print Network [OSTI]

    Meng, Weiyi

    Top-N Query: Query Language, Distance Function and Processing Strategies Yuxi Chen, Weiyi Meng@cs.binghamton.edu Abstract. The top-N query problem is to find the N results that satisfy the query condition the best and products are sold on the Internet. This paper addresses three important issues related to the top-N query

  18. Failure Analysis in Query Construction: Data and Analysis from A Large Sample of Web Queries

    E-Print Network [OSTI]

    Saracevic, Tefko

    are on its Web site. Excite searchesare basedon the exact terms that a user enters in the query, however query construction) of 51,473 queries from 18,113 users of Excite, a major Web search engine. Given of the traditional search engine interfaces. KEYWORDS: Web queries, query construction INTRODUCTION Many digital

  19. RankSQL: Query Algebra and Optimization for Relational Top-k Queries

    E-Print Network [OSTI]

    Ilyas, Ihab Francis

    RankSQL: Query Algebra and Optimization for Relational Top-k Queries Chengkai Li1 Kevin Chen systems (RDBMS), by extending relational algebra and query optimization. Previously, top-k query and principled framework to support efficient evaluations of ranking (top-k) queries in relational database

  20. Technical Note Post hoc Bayesian model selection

    E-Print Network [OSTI]

    Penny, Will

    Technical Note Post hoc Bayesian model selection Karl Friston , Will Penny The Wellcome Trust and Raftery, 1995; Penny et al., 2004). We will try to illustrate this perspective with a few toy examples

  1. Asymmetric Structure-Preserving Subgraph Queries for Large Graphs

    E-Print Network [OSTI]

    Xu, Jianliang

    is subgraph isomorphism queries (a.k.a subgraph queries). Due to the computational hardness of subgraph queries that preserve the query structure (a.k.a topology) over large networks has not yet been studied

  2. Text Queries on Document Time Series

    E-Print Network [OSTI]

    Baeza-Yates, Ricardo

    Retrieved for Query "iraq war" #12;Smoothed Timeline for "iraq war" #12;Temporal Models Goal: Estimate;Documents Retrieved for Query "iraq war" #12;Weighted by Document Relevance #12;Smoothed with Background

  3. Assisting Web Search Using Query Suggestion Based on Word Similarity Measure and Query Modification

    E-Print Network [OSTI]

    Ng, Yiu-Kai Dennis

    . For example, when the word "Tiger" is entered by a user, current web search engines are mostly focusedAssisting Web Search Using Query Suggestion Based on Word Similarity Measure and Query Modification search engines is query suggestion (QS), which assists users in formulating keyword queries by suggesting

  4. Demand Queries with Preprocessing Uriel Feige

    E-Print Network [OSTI]

    Demand Queries with Preprocessing Uriel Feige and Shlomo Jozeph May 1, 2014 )>IJH=?J Given a set of items and a submodular set-function f that determines the value of every subset of items, a demand query, the value of S minus its price. The use of demand queries is well motivated in the context of com

  5. Scalable Continuous Query Processing by Tracking Hotspots

    E-Print Network [OSTI]

    Yang, Jun

    Scalable Continuous Query Processing by Tracking Hotspots Pankaj K. Agarwal Junyi Xie Jun Yang Hai}@cs.duke.edu ABSTRACT This paper considers the problem of scalably processing a large number of continuous queries. We for intervals in linear time. 1. INTRODUCTION Continuous query processing has attracted much interest

  6. Black holes, AdS, and CFTs

    E-Print Network [OSTI]

    Marolf, Donald

    2009-01-01

    Boundary observables and AdS/CFT . . . . .Unitiarity and AdS/CFT . . . . . . . . . . . . Thecharges in asymptotically AdS-spacetimes. Class. Quant.

  7. D. Florescu , J. Freire 1SBBD 2000 -Querying the Web Querying the Web

    E-Print Network [OSTI]

    Freire, Juliana

    D. Florescu , J. Freire 1SBBD 2000 - Querying the Web Querying the Web Daniela Florescu INRIA 2000 - Querying the Web The Web - some history x 1989 First Web browser x 1993 Mosaic is released, there are 50 Web sites x 1994 First search engines (WWWW, WebCrawler) x 1996 US$1 billion spent in Internet

  8. Query

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on DeliciousMathematicsEnergyInterested PartiesBuildingBudget ||

  9. The Query Complexity of Correlated Equilibria

    E-Print Network [OSTI]

    Hart, Sergiu

    The Query Complexity of Correlated Equilibria Sergiu Hart September 2015 SERGIU HART c 2015 ­ p. #12;The Query Complexity of Correlated Equilibria Sergiu Hart Center for the Study of Rationality Dept of Mathematics Dept of Economics The Hebrew University of Jerusalem hart@huji.ac.il http://www.ma.huji.ac.il/hart

  10. Fault Tolerant Evaluation of Continuous Selection Queries over Sensor Data

    E-Print Network [OSTI]

    Lazaridis, Iosif; Han, Qi; Mehrotra, Sharad; Venkatasubramanian, Nalini

    2009-01-01

    Evaluation of Continuous Selection Queries over Sensor Dataevaluation of continuous selection queries (CSQs) over sensor-sensor suffices and there is no Fault Tolerant Evaluation of

  11. T-703: Cisco Unified Communications Manager Open Query Interface...

    Energy Savers [EERE]

    Cisco Unified Communications Manager Open Query Interface Lets Remote Users Obtain Database Contents T-703: Cisco Unified Communications Manager Open Query Interface Lets Remote...

  12. PET: Reducing Database Energy Cost via Query Optimization

    E-Print Network [OSTI]

    Tu, Yicheng

    PET: Reducing Database Energy Cost via Query Optimization Zichen Xu The Ohio State University xuz a cost-based query optimizer that eval- uates query plans by both performance and energy costs. By fol can achieve a good understanding of the energy- related query optimization and cost-based plan

  13. Processing Top N and Bottom N Queries Michael J. Carey

    E-Print Network [OSTI]

    Kemper, Alfons

    DBMS, which does not have built-in support for top N and bottom N queries, will end up wasting work.e., one without integrated support for top N and bottom N queries, would end up wasting work. We then show goal is to evaluate such queries with as little wasted work as possible. That is, if a query asks

  14. Expressiveness Issues and Decision Problems for Active Database Event Queries

    E-Print Network [OSTI]

    Mikulas, Szabolcs

    query (specified using the event algebra) over a history of all previously occurring primitive events. 1 will use the terms complex event detection and (complex) event query evaluation over a history synonymously classes of event queries. For example, the histories over which event queries may be evaluated can be very

  15. Optimizing Energy-Efficient Query Processing in Wireless Sensor Networks

    E-Print Network [OSTI]

    Lee, Wang-Chien

    , to collect metadata from sensor nodes to the query optimizer (i.e. the AP) requires an energy overhead1 Optimizing Energy-Efficient Query Processing in Wireless Sensor Networks Ross Rosemark Wang of energy-efficient query optimization for wireless sensor networks. Different from existing query

  16. Exploring Reductions for Long Web Queries Niranjan Balasubramanian

    E-Print Network [OSTI]

    Murphy, Robert F.

    Exploring Reductions for Long Web Queries Niranjan Balasubramanian University of Massachusetts queries form a difficult, but increasingly important seg- ment for web search engines. Query reduction on TREC collections. Also, it has great potential for improving long web queries (upto 25% improvement

  17. Classifying Web Search Queries to Identify High Revenue Generating Customers

    E-Print Network [OSTI]

    Jansen, James

    searching, the set of terms for which a user searches is called the query. If a user enters a query and then clicks on a result, these query terms are embedded within the URL that is passed from the search engineClassifying Web Search Queries to Identify High Revenue Generating Customers Adan Ortiz-Cordova 329

  18. Privacy-preserving Queries over Relational Databases

    E-Print Network [OSTI]

    Goldberg, Ian

    techniques, such as onion routers and mix networks, offer anonymizing protection for users' identities the query through Tor [12] to preserve the privacy of his or her network address. Nevertheless, the server

  19. Uniform Quantifier Elimination and Constraint Query Processing

    E-Print Network [OSTI]

    2015-08-29

    tics. However, this is not always the case. Consider the. query,. Q= (9T1):R(T1): Clearly, the natural and active domain semantics give dif-. ferent interpretation to

  20. Stability of AdS black strings

    E-Print Network [OSTI]

    T. Delsate

    2008-08-14

    We review the recent developements in the stability problem and phase diagram for asymptotically locally $AdS$ black strings. First, we quickly review the case of locally flat black string before turning to the case of locally $AdS$ spacetimes.

  1. AdS$_3$ and AdS$_2$ Magnetic Brane Solutions

    E-Print Network [OSTI]

    Ahmed Almuhairi

    2010-11-04

    We investigate AdS$_3$ and AdS$_2$ magnetic brane solutions within the consistent truncation of AdS$_5 \\times S^5$ supergravity. The AdS$_3$ solution extends earlier work by allowing a general embedding of the magnetic $U(1)$ in $SO(6)$. We determine the ratio of strong- and weak-coupling entropies as a function of this embedding. Further, by considering crossed magnetic fields in different $U(1)$'s we are able to construct a solution that runs from AdS$_5$ in the UV to AdS$_2 \\times R^3$ in the IR. We find the notable result that there is a zero temperature entropy at strong coupling but not at weak coupling. We also show that the AdS$_2$ solution and at least some of the AdS$_3$ solutions are stable within the truncation.

  2. Query Plans for Conventional and Temporal Queries Involving Duplicates and Ordering

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    substantially from built- in temporal support in the DBMS. To achieve this, temporal query representation for providing temporal support both via a stand-alone temporal DBMS and via a layer on top of a conventional DBMS. By capturing duplicate removal and retention and order preservation for all queries, as well

  3. Failure Analysis in Query Construction: Data and Analysis from A Large Sample of Web Queries

    E-Print Network [OSTI]

    Jansen, James

    ­ more details are on its Web site. Excite searches are based on the exact terms that a user enters in the query, however, capitalization is disregarded. Stemming is not available. Multiple term searches return,473 queries from 18,113 users of Excite, a major Web search engine. Given that many digital libraries

  4. TreeQ-VISTA: An Interactive Tree Visualization Tool with Functional Annotation Query Capabilities

    E-Print Network [OSTI]

    2007-01-01

    for users with or without SQL knowledge. The query resultspowerful and user-friendly SQL query interface that extractsof constructing complex SQL queries that flat file storage

  5. SINA: Scalable Incremental Processing of Continuous Queries in Spatiotemporal Databases

    E-Print Network [OSTI]

    Kaiserslautern, Universität

    SINA: Scalable Incremental Processing of Continuous Queries in Spatiotemporal Databases Mohamed F F. Mokbel, Xiaopeng Xiong, Walid G. Aref ()SINA: Scalable Incremental Processing of Continuous, Xiaopeng Xiong, Walid G. Aref ()SINA: Scalable Incremental Processing of Continuous Queries

  6. Privacy-preserving Queries over Relational Databases Femi Olumofin

    E-Print Network [OSTI]

    Goldberg, Ian

    . While today's most developed and deployed privacy tech- niques, such as onion routers and mix networks' queries. For the front running example, the user could tunnel the query through Tor [17] to preserve

  7. Answering queries using materialized views with minimum size

    E-Print Network [OSTI]

    Chirkova, R; Li, C; Li, J

    2006-01-01

    Mehrotra. Execut- u u s ing SQL over encrypted data in theUrata. Answering complex SQL queries using automatic summaryconsider select-project-join SQL queries and their unions.

  8. Query-based database policy assurance using semantic web technologies

    E-Print Network [OSTI]

    Soltren, José Hiram

    2009-01-01

    In this thesis, we present a novel approach to database security which looks at queries instead of the database tables themselves. In doing so, we use a number of Semantic Web technologies to define rules, translate queries, ...

  9. Query Languages and Tools for XML Documents and Databases

    E-Print Network [OSTI]

    Miller, John A.

    review the evolution of query languages starting in 1974 with SEQUEL and leading to today's SQL3 and OQLv.2 as well as emerging languages based on XML. Figure (1) depicts this evolution of query languages of the the object­oriented DBMS (OODBMS). The current OQL (Object Query Language, v.2) [Cattell et al., 1997] as we

  10. Multi-Objective Query Processing for Data Aggregation

    E-Print Network [OSTI]

    Kambhampati, Subbarao

    data sources all export fragments of a single relation. Given a query, the primary query processing integrate information sources available on the Internet. Data integration systems [13], [21], [22], [28], [31] provide a uniform interface to a multitude of information sources, query the relevant sources

  11. Multi-Objective Query Processing for Data Aggregation

    E-Print Network [OSTI]

    Kambhampati, Subbarao

    data sources all export fragments of a single relation. Given a query, the primary query processing of structured information sources on the web has recently led to significant interest in query processing frameworks that can integrate information sources available on the Internet. Data integration systems [13

  12. Dismantling Complicated Query Attributes with Crowd Matan Laadan

    E-Print Network [OSTI]

    Milo, Tova

    Dismantling Complicated Query Attributes with Crowd Matan Laadan Tel Aviv University Tel Aviv the crowd to dismantle the query attributes into finer related ones (whose value estimation is easier beneficial not to only disman- tle the query attributes themselves, but rather to continue dismantling newly

  13. Private Database Queries Using Somewhat Homomorphic Craig Gentry

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Private Database Queries Using Somewhat Homomorphic Encryption Dan Boneh Craig Gentry Shai Halevi Frank Wang David J. Wu Abstract In a private database query system, a client issues queries to a database and obtains the results with- out learning anything else about the database and without the server

  14. Querying RDF Data from a Graph Database Perspective

    E-Print Network [OSTI]

    Baeza-Yates, Ricardo

    }@dcc.uchile.cl Agenda · Motivations, Problem and Proposal · Database Models · Graph Database Models · RDF as data model of data model with inherent graph structure. · Database models and query languages should support its that a query language for RDF should provide. Database Models Data structures Operators and Query Language

  15. Incorporating Seasonality into Search Suggestions Derived from Intranet Query Logs

    E-Print Network [OSTI]

    Kruschwitz, Udo

    Incorporating Seasonality into Search Suggestions Derived from Intranet Query Logs Stephen Dignum performed on query logs collected for major Web search engines, query log analysis to enhance search search engine can be enhanced by adapting the search system to real users' search behaviour through

  16. A Simple Model for Classifying Web Queries by User Intent

    E-Print Network [OSTI]

    Rosso, Paolo

    València, Spain 3 NLE Lab.- ELiRF, Universitat Politècnica de València, Spain 4 PRHLT, Universitat query classification, User intent, Query analysis 1 Introduction Web Search Engines (WSEs) are the most in an interaction with a Web Search Engine. Query Classification based on user intent is different from traditional

  17. Roadmap Query for Sensor Network Assisted Navigation in Dynamic Environments

    E-Print Network [OSTI]

    Lu, Chenyang

    Roadmap Query for Sensor Network Assisted Navigation in Dynamic Environments Sangeeta Bhattacharya approach that integrates a roadmap based navigation algorithm with a novel WSN query protocol called Roadmap Query (RQ). RQ enables collection of frequent, up-to- date information about the surrounding

  18. Query Suggestions for Mobile Search: Understanding Usage Patterns

    E-Print Network [OSTI]

    Cortes, Corinna

    Inc 1600 Amphitheatre Parkway, Mountain View, CA shumeet@google.com ABSTRACT Entering search terms that users who were asked to enter queries on a search interface with query suggestions rated their workload heavily on suggestions if they are provided. Users who were asked to enter queries on a search interface

  19. Structured Annotations of Web Queries Nikos Sarkas

    E-Print Network [OSTI]

    California at Berkeley, University of

    nsarkas@cs.toronto.edu Stelios Paparizos Microsoft Research Mountain View, CA, USA steliosp@microsoft.com Panayiotis Tsaparas Microsoft Research Mountain View, CA, USA panats@microsoft.com ABSTRACT Queries asked advantage and that copies bear this notice and the full citation on the first page. To copy otherwise

  20. The Temporal Query Language TQuel Richard Snodgrass

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    gives the complete syntax of the TQuel retrieve statement. 2. QUERY LANGUAGES FOR HISTORI- CAL DATABASES solely by the application pr+ grams; the DBMS interprets dates as values in the basedata types's medical history is particularly important. The model supported by TOD (for Time Oriented Data bank

  1. Incremental Aggregation on Multiple Continuous Queries

    E-Print Network [OSTI]

    Carbonell, Jaime

    atop of a DBMS. The evaluation study shows that our approaches are effective and efficient on typical updated upon data changes without revisiting the entire history of grouping elements; while other-defined ones. The system also supports holistic functions by reaggregating the stream history. Consider a query

  2. Answering Historical Queries in Databases using Relevance

    E-Print Network [OSTI]

    Bertossi, Leopoldo

    consider the problem of answering queries about the evolution of the database along a sequence Reiter's proposal [14, 16] to specify the database evolution in the situation calculus, a first.e. in the whole evolution of the database, that a given property holds''? or ``Has a given property been true

  3. Representing and Querying Data Transformations Yannis Velegrakis

    E-Print Network [OSTI]

    Velegrakis, Yannis

    - known sources such as government organizations, research institutes or private companies may be well to their query. In systems where information from multiple sources is used, such knowledge may assist of Toronto, Canada jm@cs.toronto.edu Abstract Modern information systems often store data that has been

  4. Matrix Completion with Queries Natali Ruchansky

    E-Print Network [OSTI]

    Crovella, Mark

    Matrix Completion with Queries Natali Ruchansky Boston University natalir@cs.bu.edu Mark Crovella applications, e.g., recommender systems and traffic monitoring, the data comes in the form of a matrix that is only partially observed and low rank. A fundamental data- analysis task for these datasets is matrix

  5. Comment on the new AdS universe

    E-Print Network [OSTI]

    Ozgur Sarioglu; Bayram Tekin

    2008-11-25

    We show that Bonnor's new Anti-de Sitter (AdS) universe and its D-dimensional generalization is the previously studied AdS soliton.

  6. Analytical Study of Backoff Algorithms for MAC Protocol in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Manaseer, S.

    Manaseer,S. Ould-Khaoua,M. Mackenzie,L. 22nd Uk Performance Engineering Workshop, Bournemouth University pp 89-94

  7. Improvement of Robustness for Ad Hoc Networks Through Energy-Aware Routing

    E-Print Network [OSTI]

    Engineering 2 InterOperability Laboratory 3 Department of Computer Science University of New Hampshire, Durham,2 , Radim Bartos3 , Michael J. Carter1 , and Sai S. Mupparapu1,2 1 Department of Computer and Electrical

  8. Cross-layer Networking for Peer Databases over Wireless Ad-Hoc Communities

    E-Print Network [OSTI]

    Papapetrou, Evaggelos

    Over the last years, the scientific community has wit- nessed a significant rise of data-centric of the communicating nodes. Since data-centric communication depends on the application layer, the key for providing mostly in wired [1] but also in wireless networks [3]. According to this approach, data-centric

  9. On physical carrier sensing for random wireless ad-hoc networks

    E-Print Network [OSTI]

    Wong, Chiu Ngok Eric

    2008-01-01

    in Electrical Engineering (Communication Theory and Systems)Field: Electrical Engineering (Communication Theory andin Electrical Engineering (Communication Theory and Systems)

  10. Cross-layer design of wideband CDMA systems and cooperative diversity for wireless ad hoc networks :

    E-Print Network [OSTI]

    Annavajjala, Ramesh

    2006-01-01

    in Electrical Engineering (Communication Theory and Systems)Ph. D. , Electrical Engineering (Communication Theory andin Electrical Engineering (Communication Theory and Systems)

  11. RaWMS -Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Cortes, Corinna

    consumption associated with sending and receiving many messages could quickly drain the batteries of mobile-YOSSEF Department of Electrical Engineering, Technion - Israel Institute of Technology and Google Haifa Engineering, Technion - Israel Institute of Technology, Haifa 32000, Israel {roy,gabik}@cs.technion.ac.il This paper

  12. Energy-Efficient Transaction Management for Mobile Ad-hoc Network Databases

    E-Print Network [OSTI]

    Gruenwald, Le

    mobile node to support services and applications [6]. Also the battery technology is not developed as rapidly as the mobile devices and wireless technologies, so that the limited battery lifetime is always system. In this system, both clients and servers are mobile, wireless and battery

  13. An Energy-efficient Concurrency Control Algorithm for Mobile Ad-hoc Network Databases

    E-Print Network [OSTI]

    Gruenwald, Le

    and applications [5]. Also battery technology is not developed as rapidly as mobile devices and wireless and battery- powered nodes, and every node can roam freely. A mobile database system built on a MANET is called a MANET database system. In this system, both clients and servers are mobile, wireless and battery

  14. PowerSaving Protocols for IEEE 802.11Based MultiHop Ad Hoc Networks

    E-Print Network [OSTI]

    Tseng, Yu-Chee

    devices supported by battery powers is power saving. Without power, any mobile device will become useless. Battery power is a limited resource, and it is expected that battery technology is not likely to progress as fast as computing and com­ munication technologies do. Hence, how to lengthen the lifetime of batteries

  15. Cross-Layer Design for Energy-Efficient Secure Multicast Communications in Ad Hoc Networks

    E-Print Network [OSTI]

    Poovendran, Radha

    number of mobile personal devices. Most of the sensors are battery- operated and hence, constrained and is the most dominant factor in battery depletion [1]. Many group applications already implemented in wired net significantly reducing due to advances in silicon technologies[1]. However, the power consumption due

  16. Distributed Detection and Localization of Events in Large Ad Hoc Wireless Sensor Networks

    E-Print Network [OSTI]

    Kumar, Anurag

    are application­specific networks that com- prise a large number of tiny, energy­limited, smart sensor devices by . This formulation is motivated by the change detection/isolation framework introduced by Nikiforov [6]. We extend decisions of ALL toggle rapidly. Motivated by this fact, we propose a distributed change detection

  17. Spectrum Leasing via Cooperative Opportunistic Routing in Distributed Ad Hoc Networks: Optimal and Heuristic Policies

    E-Print Network [OSTI]

    Rossi, Michele

    and a set of unlicensed nodes. The primary network consists of a source, a destination and a set Department of Information Engineering, University of Padova, Italy CWCSPR, New Jersey Institute of Technology of additional primary nodes that can act as relays. In addition, the secondary nodes can be used as extra relays

  18. Performance Improvements in Ad Hoc Networks Through Mobility Groups and Channel Diversity

    E-Print Network [OSTI]

    Rossi, Michele

    by using short-range, low-power, low- bandwidth devices (e.g., IEEE 802.15.4 (Zigbee) [5]) to create a city, each with a comput- ing device with both Zigbee and IEEE 802.11 interfaces. All of the people

  19. Poster: Adaptive Topology Control for Wireless Ad-hoc Seung-Jong Park Raghupathy Sivakumar

    E-Print Network [OSTI]

    Sivakumar, Raghupathy

    that maximizes network performance. Recently, using effective topology control to optimize energy usage Sivakumar School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta, GA 30332 linearly (given that the path loss ex- ponent typically ranges from 2 to 4). Hence, the overall energy con

  20. PERFORMANCE ANALYSIS OF POWER-AWARE ROUTE SELECTION PROTOCOLS IN MOBILE AD HOC NETWORKS

    E-Print Network [OSTI]

    California at Santa Cruz, University of

    , a hybrid protocol like the CMMBCR (Conditional Max-Min Battery Capacity Routing) mechanism has been devised-Max Battery Cost Routing) scheme tries to consider the remaining battery power of nodes to prolong- gardless of the remaining battery power of nodes. Since the transmission network2002: submitted to World

  1. Ad-Hoc Real-time Agent Networks Summer Research Institute

    E-Print Network [OSTI]

    with voracious energy appetites Energy supplies often limited Enablers: Microelectronics Comm/Info Theory/tracking Distributed control of built environments and processes Structural health monitoring Public safety Disaster response Space Biomedical Environmental monitoring we have not yet been able to do #12;Wireless Sensor

  2. On the Modeling of Entities for Ad-Hoc Entity Search in the Web of Data

    E-Print Network [OSTI]

    -Verlag Berlin Heidelberg 2012 #12;134 R. Neumayer, K. Balog, and K. Nørvåg dbpedia:Audi_A4 dbpedia:Volkswagen

  3. Comparison of Two Intrusion Detection Schemes for Sparsely Connected Ad Hoc Networks M. Chuah, P. Yang

    E-Print Network [OSTI]

    Chuah, Mooi-Choo "Mooi"

    ] uses a variant of Telsa [8] to provide source authentication for DSR. All the above approaches suggest

  4. Impact of Asymmetric Traffic Densities on Delay Tolerant Vehicular Ad Hoc Networks

    E-Print Network [OSTI]

    is considered as an enabler for driverless cars of the future [1]. Presently, there is a strong need to enable-neighbor communication, for safety appli- cations, and multihop communications for message propagation. Due to frequent vehicular communication for applications such as safety messaging, traffic and congestion monitoring

  5. An Analytical Framework for Neighbor Discovery Strategies in Ad hoc Networks with Sectorized

    E-Print Network [OSTI]

    Park, Joon-Sang

    /reception directions. Neighbor discovery is a process of finding one-hop neighbors and is the first step towards. An analytical model for randomized neighbor discovery algorithms is presented in [9]; however, due to its inherent limitation the model can only be used to analyze randomized neighbor discovery algorithms and thus

  6. High-Precision Ad-Hoc Indoor Positioning in Challenging Industrial Environments

    E-Print Network [OSTI]

    Sreenan, Cormac J.

    infrastructure. Several technologies are assessed with regard to these challenges and their shortcomings relatively quickly and easily. Sample environments include chemical plants and oil or gas rigs. These surveys will cause problems for positioning technologies that use radio propagation methods, line-of-sight methods

  7. ACRR: Ad-hoc On-Demand Distance Vector Routing with Controlled Route Requests Jayesh Kataria*

    E-Print Network [OSTI]

    Sanyal, Sugata

    * Mumbai University, India, jayeshkataria@gmail.com P.S. Dhekne BARC, Mumbai, India, dhekne@barc.gov.in Sugata Sanyal TIFR, Mumbai, India, sanyal@tifr.res.in *Corresponding Author Abstract Reactive routing

  8. Cross-layer design of wideband CDMA systems and cooperative diversity for wireless ad hoc networks :

    E-Print Network [OSTI]

    Annavajjala, Ramesh

    2006-01-01

    High SNR Outage Analysis . . . . . . . . . . .Accuracy of High SNR Outage Probability Approximations . . .of High SNR Outage Probability Expressions . . . . .

  9. A Study of Connectivity in MIMO Fading Ad-Hoc Networks

    E-Print Network [OSTI]

    Yousefi'zadeh, Homayoun; Jafarkhani, Hamid; Kazemitabar, Javad

    2009-01-01

    Approximations to the Outage Capacity of MIMO channels? ,”of connectivity relying on the outage capacity of MIMOis de?ned based on an outage capacity analysis for such

  10. Packet Leashes: A Defense against Wormhole Attacks in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Xu, Wenyuan

    operations, military or police networks, and safety-critical business operations such as oil drilling channel. The main advantage of such networks is low cost of deployment and maintenance, since the nodes

  11. Routing Mechanisms for Mobile Ad Hoc Networks based on the Energy Drain Rate

    E-Print Network [OSTI]

    Obraczka, Katia

    -points are not directly within their radio range. A critical issue for MANETs is that the activity of #12;nodes is power which nodes can be part of an active route. We describe new route selection mechanisms for MANET routing extends nodal battery life and the duration of paths, while CMDR also minimizes the total transmission

  12. Routing Mechanisms for Mobile Ad Hoc Networks based on the Energy Drain Rate

    E-Print Network [OSTI]

    Obraczka, Katia

    ­points are not directly within their radio range. A critical issue for MANETs is that the activity of #12; nodes is power which nodes can be part of an active route. We describe new route selection mechanisms for MANET routing extends nodal battery life and the duration of paths, while CMDR also minimizes the total transmission

  13. Stochastic Traffic and Connectivity Dynamics for Vehicular Ad-Hoc Networks in Signalized Road Systems

    E-Print Network [OSTI]

    Leung, Kin K.

    Engineering, Imperial College London Centre for Transport Studies, Imperial College London {wh.ho, kin

  14. RTRD: Real-Time and Reliable Data Delivery in Ad Hoc Networks

    E-Print Network [OSTI]

    Ravindran, Binoy

    -time task. A real-time task executes on an individual node, with a given termination time tT erm. As shown and has some data which requires to be delivered to another node before tT erm. The time for real-time data delivery is the task's slack time ST, ST = tT erm - tF inish. Before task execution starts, ET

  15. A Self-Organizing Heuristic for Building Optimal Heterogeneous Ad-Hoc Sensor Networks

    E-Print Network [OSTI]

    Minai, Ali A.

    with equal power, which means that they all have the same transmission radius. Such homoge- neous networks-making about transmission power. However, in sufficiently dense networks (or in networks with significant amount of work on heterogeneous networks, mainly due to their flexibility and better fit into potential

  16. Phase Transition Behavior of Message Propagation in Delay Tolerant Vehicular Ad Hoc Networks

    E-Print Network [OSTI]

    Little, Thomas

    that is used to avoid contention in the system for shared resources and avoid accidents. By interconnecting part of networked information and control systems [1, 2]. Vehicle manufacturers seek to enhance connectivity. Creating safer transportation system is an important goal. One way of achieving safety

  17. MULTIPATH HYBRID AD HOC NETWORKS FOR AVIONICS APPLICATIONS IN DISASTER AREA

    E-Print Network [OSTI]

    Atiquzzaman, Mohammed

    helicopters up in the sky and first responders on the ground. However, transmitting video and running high for rapidly establishing communication among the helicopters and first responders in a disaster area, among helicopters and ground responders to carry out necessary relief efforts. Our proposed network

  18. A resilient synchronization algorithm for wireless ad hoc and sensor networks based on distributed

    E-Print Network [OSTI]

    Spagnolini, Umberto

    ) to the establishment of period oscillations with the same frequency and, possibly, phase (e.g., for medium access with: (i) construction of a packet, (ii) queuing at the MAC layer, (iii) propagation and (iv a benign environment and cannot survive the presence of malfunctioning nodes in an emergency situation

  19. A New Task-Based Approach for Supporting Distributed Applications on Mobile Ad Hoc Networks1

    E-Print Network [OSTI]

    Little, Thomas

    resources were found near the devices that needed those resources. Embedding of general TGs onto general case of TGs, namely trees. However, this optimal algorithm for tree TGs has a high time complexity

  20. Simultaneous localization and tracking in wireless ad-hoc sensor networks

    E-Print Network [OSTI]

    Taylor, Christopher J. (Christopher Jorgen)

    2005-01-01

    In this thesis we present LaSLAT, a sensor network algorithm that uses range measurements between sensors and a moving target to simultaneously localize the sensors, calibrate sensing hardware, and recover the target's ...

  1. Maximizing the Number of Broadcast Operations in Random Geometric Ad-Hoc Wireless Networks

    E-Print Network [OSTI]

    Calamoneri, Tiziana

    of a node depends, in turn, on the energy power supplied to the node. In particular, the power Pv required by a node v to correctly transmit data to another station w must satisfy the inequality (see [24]): Pv dist, in some network models (like sensor networks), the adopted technology allows to have only few possible

  2. Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks

    E-Print Network [OSTI]

    Calamoneri, Tiziana

    -Verlag Berlin Heidelberg 2007 #12;248 T. Calamoneri et al. supplied to the node. In particular, the power Pv]) Pv dist(v, w)2 (1) where dist(v, w) is the Euclidean distance between v and w while is a constant, in some network models (like sensor networks), the adopted technology allows to have only few possible

  3. Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms

    E-Print Network [OSTI]

    Calamoneri, Tiziana

    of a node de- pends, in turn, on the energy power supplied to the node. In particular, the power Pv required by a node v to cor- rectly transmit data to another station w must satisfy the inequality Pv dist(v, w)2: the adopted tech- nology allows nodes to have only few possible transmission range values. For this reason, we

  4. A Failure Self-recovery Strategy with Balanced Energy Consumption for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Qiu, Tie; Xia, Feng; Wu, Guowei; Zhou, Yu

    2012-01-01

    In energy constrained wireless sensor networks, it is significant to make full use of the limited energy and maximize the network lifetime even when facing some unexpected situation. In this paper, all sensor nodes are grouped into clusters, and for each cluster, it has a mobile cluster head to manage the whole cluster. We consider an emergent situation that one of the mobile cluster heads is broken down, and hence the whole cluster is consequently out of work. An efficient approach is proposed for recovering the failure cluster by selecting multiple static sensor nodes as the cluster heads to collect packets and transmit them to the sink node. Improved simulated annealing algorithm is utilized to achieve the uniform deployment of the cluster heads. The new cluster heads are dynamically changed in order to keep balanced energy consumption. Among the new cluster heads, packets are transmitted through multi-hop forwarding path which is cost-lowest path found by Dijkstra's algorithm. A balanced energy consumptio...

  5. Neighbour -Aware, Collision Avoidance MAC Protocol (NCMac) for Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    . The IEEE 802.11 specifies the Binary Exponential Backoff (BEB) algorithm, where the duration of a backoff

  6. Security of Future eEnabled Aircraft Ad hoc Networks Krishna Sampigethaya

    E-Print Network [OSTI]

    Poovendran, Radha

    with some open problems. I. Introduction Aviation is today faced with major challenges due effort called NextGen between the Federal Aviation Administration (FAA) and other federal agencies operation, maintenance and control. For example, the Global Positioning System (GPS) and Automated Dependent

  7. Cross-layer design of wideband CDMA systems and cooperative diversity for wireless ad hoc networks :

    E-Print Network [OSTI]

    Annavajjala, Ramesh

    2006-01-01

    protocol: Power allocation as a function of rate Rate=1/4optimal power allocation is plotted as a function of ? inour objective functions. Optimum Bandwidth Allocation If we

  8. A MULTIMEDIA CONFERENCING ON A MOBILE AD-HOC NETWORK OVER VEHICLES

    E-Print Network [OSTI]

    Jang, Ju-Wook

    -dong, Hwaseong-si, Gyeonggi-do, Korea 445-706° Next Generation Vehicle Technology(NGV), Shinlim-dong, Kwanak

  9. On Physical Carrier Sensing in Wireless Ad Hoc Xue Yang and Njtin Vaidya

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

    attenuation and shadowing by obstacles. Second, wireless stations communicate over the air and there is significant interference among stations that are spatially close to each other. Whether two wireless stations power used by the transmitter, etc. Additionally, the quality of the communication link depends

  10. Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning Regina Bischoff Roger Wattenhofer

    E-Print Network [OSTI]

    scenarios where the nodes do not receive anchors directly (multi-hop) and where no phys- ical distance positioning system (GPS) has spawned a multi-billion dollar market for positioning with an enormous variety questions of cost and even accessi- bility dominate the design. To our knowledge, all previous positioning

  11. Community-based Bus System as Routing Backbone for Vehicular Ad Hoc Networks

    E-Print Network [OSTI]

    Chu, Xiaowen

    information [2] and tourist points of interest [3]. The work in the second category is to deliver messages collection and information sharing [4]. The work in the third category is to disseminate messages, e, Yiu-Wing Leung, Xiaowen Chu and Beihong Jin State Key Laboratory of Computer Science, Institute

  12. A General Design towards Secure Ad-hoc Collaboration Masayuki Nakae

    E-Print Network [OSTI]

    Sandhu, Ravi

    assgned to a collaboratve team (.e., a vrtual organzaton), our TUCON- based polcy scheme allows fne-graned

  13. DYNAMMA: A DYNAmic Multi-channel Medium Access Framework for Wireless Ad HocNetworks

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2007-01-01

    Estrin. An energy-efficient MAC protocol for wireless sensoradaptive energy- efficient MAC protocol for wireless sensorEnergy-efficient collision-free medium access control for wireless

  14. Efficient Broadcast in Wireless Ad Hoc and Sensor Networks with a Realistic Physical Layer

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2008-01-01

    T. H. Meng. Minimum energy mobile wireless networks. IEEE J.minimum-energy multicast tree construction in wireless adenergy-efficient broadcast and multicast trees in wireless

  15. Applying Light Natural Language Processing to Ad-Hoc Cross Language Information Retrieval

    E-Print Network [OSTI]

    Lioma, C.

    Lioma,C. Macdonald,C. Plachouras,V. He,B. Ounis,I. In Accessing Multilingual Information Repositories: 6th Cross-Language Evaluation Forum, CLEF 2005, Vienna, Austria, Revised Selected Papers. Lecture Notes in Computer Science, Vol. 4022 LNCS, Springer

  16. Proceedings of the AD HOC Workshop on Ceramics for Li/FeS{sub 2} batteries

    SciTech Connect (OSTI)

    Not Available

    1993-12-31

    Representatives from industry, the U.S. Advanced Battery Consortium (USABC), DOE, national laboratories, and other govt agencies met to develop recommendations and actions for accelerating the development of ceramic components critical to the successful introduction of the Li/FeS{sub 2} bipolar battery for electric vehicles. Most of the workshop is devoted to electrode materials, bipolar designs, separators, and bipolar plates. The bulk of this document is viewographs and is divided into: ceramics, USABC overview, SAFT`s Li/FeS{sub 2} USABC program, bipolar Li/FeS{sub 2} component development, design requirements for bipolar plates, separator design requirements, compatibility of ceramic insulators with lithium, characterization of MgO for use in separators, resistivity measurements of separators, sintered AlN separators for LiMS batteries, etc.

  17. AUTONOMOUS UNDERSEA SYSTEMS NETWORK (AUSNET) PROTOCOLS TO SUPPORT AD-HOC AUV COMMUNICATIONS

    E-Print Network [OSTI]

    (as opposed to network support) data transmissions. Next steps in this effort will focus on store to support a dynamically evolving topology of truly semi-autonomous networked robots. Emerging flexible low bandwidth, energy efficient architectures and protocols will enable more effective networked subsurface

  18. Geodesic packet routing over self-organizing mobile ad-hoc

    E-Print Network [OSTI]

    Julien, Christine

    -011 Thayne R. Coffman Christine Julien © Copyright 2006 The University of Texas at Austin #12;IEEE SECON `07 Thayne R. Coffman and Christine Julien, Member, IEEE Abstract--The development of routing protocols of some basic simulations that measure its ability to perform efficient geodesic packet forwarding over

  19. Cluster-Based Failure Detection Service for Large-Scale Ad Hoc Wireless Network Applications

    E-Print Network [OSTI]

    Sanders, William H.

    Introduction Recent advances in MEMS (micro-electro-mechanical systems) and wireless networking technologies

  20. Securing Network Services for Wireless Ad Hoc and Sensor Networks Loukas Lazos

    E-Print Network [OSTI]

    Lazos, Loukas

    RLoc that is well suited in resource-constrained environments such as Wireless Sensor Networks (WSN). Furthermore we on the quantification of the performance of WSN. We address the problem of coverage in stochastically deployed WSN and Geometric Probability we provide analytical formulas for heterogeneous WSN, where sensors do not have

  1. REAct: Resource-Efficient Accountability for Node Misbehavior in Ad Hoc Networks based on Random Audits

    E-Print Network [OSTI]

    Lazos, Loukas

    Audits William Kozma Jr. University of Arizona Electrical and Computer Engineering Dept. Tucson, Arizona 85721 wkozma@ece.arizona.edu Loukas Lazos University of Arizona Electrical and Computer Engineering Dept performance (mali- ciousness). In this paper, we investigate the problem of uniquely iden- tifying the set

  2. Ad-hoc wireless network coverage with networked robots that cannot localize

    E-Print Network [OSTI]

    Correll, Nikolaus

    We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless network access for higher-level agents. Possible ...

  3. Ad hoc wireless networks with femto-cell deployment: a study 

    E-Print Network [OSTI]

    Bharucha, Zubin Rustam

    2010-01-01

    Nowadays, with a worldwide market penetration of over 50% in the mobile telecommunications sector, there is also an unrelenting demand from the subscribers for ever increasing transmission rates and availability of ...

  4. Master thesis Implementation of an ad-hoc routing module for

    E-Print Network [OSTI]

    Router framework and the design of a wireless test bed based upon this implementation. The code. The router can be executed in user level or kernel level as well as in the network simulator ns. Performance analysis of the OLSR implementation in Click showed that the single threaded router environment of Click

  5. Minimum-Energy Topology Control Algorithms in Ad Hoc Joseph Y. Halpern Li (Erran) Li

    E-Print Network [OSTI]

    Halpern, Joseph Y.

    for an extended period of time. In order to accomplish this without a renewable energy source, energy conservation, network lifetime can be increased by energy reduction in the hardware, the software (operating systems consumption. For example, CPU energy consumption can be reduced through dy- namic voltage scaling

  6. Investigation of Media Access Control Protocols for Mobile Ad-hoc Networks

    E-Print Network [OSTI]

    , the protocol guarantees bounded delay for emergency tra c. #12;4 1 EXECUTIVE SUMMARY This report contains.D. Final Report Submitted to: National Institute of Standards and Technology Gaithersburg, MD 20899-0001 Request no. Q-912364 Purchase request no. 892-9326 #12;2 Contents 1 EXECUTIVE SUMMARY 4 2 Introduction 6 3

  7. A Unifying Perspective on The Capacity of Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2008-01-01

    We introduce (n, m, k)-casting as a generalization of allWe define (n, m, k)-casting as a generalization of all formsIn the context of (n, m, k)-casting, n, m, and k denote the

  8. Report of the Provost's Ad Hoc Committee on Faculty in Interdisciplinary Programs

    E-Print Network [OSTI]

    Emshwiller, Eve

    development (e.g., administrative staff, course buyouts for lead faculty). 2. Allocation of Credit to Academic

  9. Best effort QoS support routing in mobile ad hoc networks 

    E-Print Network [OSTI]

    Luo, Heng

    2012-06-25

    In the past decades, mobile traffic generated by devices such as smartphones, iphones, laptops and mobile gateways has been growing rapidly. While traditional direct connection techniques evolve to provide better access ...

  10. Mobility changes anonymity: new passive threats in mobile ad hoc networks

    E-Print Network [OSTI]

    Hong, Xiaoyan; Kong, Jiejun; Gerla, Mario

    2006-01-01

    delay on most portable mobile devices. D. Anonymity study inmobile nodes and prepare the counterattacks. The needed eavesdropping devices,

  11. Robust Position-Based Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges

    E-Print Network [OSTI]

    Chaudhuri, Soma

    Barri~re Departament de Matem&tica Aplicada i Telem&tica Univ. Polit~.cnicade Catalunya Barcelona, Spain

  12. Design and analysis of distributed primitives for mobile ad hoc networks 

    E-Print Network [OSTI]

    Chen, Yu

    2006-10-30

    by the network, which poses a serious challenge for the design and analysis of reliable protocols. In this work, three different approaches are used to handle mobility. The first part of the dissertation employs the simple technique of ignoring the mobility...

  13. Abstract --Developing software for mobile or ad hoc scenarios is very cost intensive. Different software and

    E-Print Network [OSTI]

    Steimann, Friedrich

    communication infrastructure is modified or exchanged, applications should not be developed 'from scratch.g., is not compatible with Standard Java, thus we cannot use programs across platforms without re-implementing major manufacturers: even if devices in principle are able to accommodate high-level com- munication platforms

  14. MODULO AND GRID BASED CHANNEL SELECTION IN AD HOC Gareth Owen Mo Adda

    E-Print Network [OSTI]

    Kent, University of

    based. Antenna techniques attempt to reduce the interference or mitigate it by for example, directional, University of Portsmouth Buckingham Building, Lion Terrace, Portsmouth England, PO1 3HE {gareth.owen, mo.adda}@port.ac channels. We analyse many techniques requiring only information available locally and those that do

  15. Social Welfare Based Routing in Ad hoc Networks Mingming Lu and Jie Wu

    E-Print Network [OSTI]

    Wu, Jie

    is to save energy. Existing energy-efficient routing protocols save energy by selecting the lowest energy cost route. However, energy saving is not equal to energy efficiency. Consider a large number, and hence most packets transmitted through this path are lost, it is energy waste rather than energy saving

  16. The Limits of Theory: Pragmatic Challenges in Mobile Ad Hoc Systems

    E-Print Network [OSTI]

    Lenders, Vincent

    , Martin May ETH Zurich 8092 Zurich, Switzerland legendre,maym@tik.ee.ethz.ch Vincent Lenders Armasuisse 3000 Berne, Switzerland lenders@tik.ee.ethz.ch Gunnar Karlsson KTH, Royal Inst. of Technology 10044

  17. Multi-path Routing Protocols in Wireless Mobile Ad Hoc Networks: A Quantitative

    E-Print Network [OSTI]

    Lenders, Vincent

    Parissidis, Vincent Lenders, Martin May, and Bernhard Plattner Swiss Federal Institute of Technology Communications Systems Group Gloriastrasse 35, 8092 Zurich, Switzerland {parissid, lenders, may, plattner

  18. SPARQL Query Form | OpenEI

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page onRAPID/Geothermal/Exploration/ColoradoRemsenburg-Speonk, NewMichigan:Roxbury,RushS.KSPARQL Query Form Default Graph URI

  19. AdS spacetimes and isometric embeddings

    E-Print Network [OSTI]

    Steven Willison

    2013-02-07

    An algebraic global isometric embedding of the nonrotating BTZ black hole is presented. The ambient spacetime is $\\mathbb{M}^{2,3}$, the 3+2 dimensional flat spacetime. We also present the analogous embedding for the Euclidean BTZ spacetime and by performing a kind of double analytic continuation construct a 1-parameter family of embeddings of cosmological AdS spacetime into $\\mathbb{M}^{2,3}$ which coincide asymptotically with the embedded BTZ manifold of the appropriate mass. Finally we note that the family of embeddings of cosmological AdS$_{n}$ into $\\mathbb{M}^{2,n}$ generalises to higher dimensions.

  20. Systematics of Coupling Flows in AdS Backgrounds

    E-Print Network [OSTI]

    Goldberger, Walter D.

    2009-01-01

    can be calculated using the AdS/CFT correspondence bySystematics of Coupling Flows in AdS Backgrounds Walter D.Systematics of Coupling Flows in AdS Backgrounds Walter D.

  1. Instability corners in AdS space

    E-Print Network [OSTI]

    Fotios V. Dimitrakopoulos; Ben Freivogel; Matthew Lippert; I-Sheng Yang

    2014-10-07

    We investigate whether arbitrarily small perturbations in global AdS space are generically unstable and collapse into black holes on the time scale set by gravitational interactions. We argue that current evidence, combined with our analysis, strongly suggests that a set of nonzero measure in the space of initial conditions does not collapse on this time scale. On the other hand, existing results do not provide an equally strong indication whether the unstable solutions also form a set of nonzero measure. We perform an analysis in position space to address this puzzle, and our formalism allows us to directly address the vanishing-amplitude limit. We show that gravitational self-interaction leads to tidal deformations which are equally likely to focus or defocus energy, and we sketch the phase diagram accordingly. We also clarify the connection between gravitational evolution in global AdS and holographic thermalization.

  2. Refined Holographic Entanglement Entropy for the AdS Solitons and AdS black Holes

    E-Print Network [OSTI]

    Masafumi Ishihara; Feng-Li Lin; Bo Ning

    2013-04-04

    We consider the refinement of the holographic entanglement entropy for the holographic dual theories to the AdS solitons and AdS black holes, including the corrected ones by the Gauss-Bonnet term. The refinement is obtained by extracting the UV-independent piece of the holographic entanglement entropy, the so-called renormalized entanglement entropy which is independent of the choices of UV cutoff. Our main results are (i) the renormalized entanglement entropies of the AdS$_{d+1}$ soliton for $d=4,5$ are neither monotonically decreasing along the RG flow nor positive definite, especially around the deconfinement/confinement phase transition; (ii) there is no topological entanglement entropy for AdS$_5$ soliton even with Gauss-Bonnet correction; (iii) for the AdS black holes, the renormalized entanglement entropy obeys an expected volume law at IR regime, and the transition between UV and IR regimes is a smooth crossover even with Gauss-Bonnet correction; (iv) based on AdS/MERA conjecture, we postulate that the IR fixed-point state for the non-extremal AdS soliton is a trivial product state.

  3. EuroSPI 2009 -1 Software provides an increasing part of the added value of modern automation systems and

    E-Print Network [OSTI]

    SPI 2009 1 Introduction Software-intensive automation systems, like industrial manufacturing plants, need automation systems and thus becomes more complex. System requirements may change even late in the development process, lead to ad-hoc modifications of the product and require systematic (and automated) testing

  4. Extracting and Querying Probabilistic Information in BayesStore

    E-Print Network [OSTI]

    Wang, Zhe

    2011-01-01

    68 Join over Model M F OBN Viterbi SQL74 SQL Implementation of MCMCjoin algorithms. . 99 The SQL+IE query template. . . . . . .

  5. Metadata Challenge for Query Processing Over Heterogeneous Wireless Sensor Network

    E-Print Network [OSTI]

    Komalavalli, C

    2011-01-01

    Wireless sensor networks become integral part of our life. These networks can be used for monitoring the data in various domain due to their flexibility and functionality. Query processing and optimization in the WSN is a very challenging task because of their energy and memory constraint. In this paper, first our focus is to review the different approaches that have significant impacts on the development of query processing techniques for WSN. Finally, we aim to illustrate the existing approach in popular query processing engines with future research challenges in query optimization.

  6. REGULAR PATHS IN SPARQL: QUERYING THE NCI THESAURUS

    E-Print Network [OSTI]

    Washington at Seattle, University of

    REGULAR PATHS IN SPARQL: QUERYING THE NCI THESAURUS University of Washington Structural Informatics path enhancements Examples NCI Thesaurus Widely used Exhibits common OWL representational patterns

  7. Black hole microstates in AdS

    E-Print Network [OSTI]

    Shaghoulian, Edgar

    2015-01-01

    We extend a recently derived higher-dimensional Cardy formula to include angular momenta, which we use to obtain the Bekensten-Hawking entropy of AdS black branes, compactified rotating branes, and large Schwarzschild/Kerr black holes. This is the natural generalization of Strominger's microscopic derivation of the BTZ black hole entropy to higher dimensions. We propose an extension to include $U(1)$ charge, which agrees with the Bekenstein-Hawking entropy of large Reissner-Nordstrom/Kerr-Newman black holes at high temperature. We extend the results to arbitrary hyperscaling violation exponent (this captures the case of black D$p$-branes as a subclass) and reproduce logarithmic corrections.

  8. ask queries | OpenEI Community

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIX ECoop IncIowa (UtilityMichigan) JumpZhuyuanWindeyZibo BaoyunZoukask queries Home

  9. March 24, 2008 ADBS: Query Opt. 1 Algorithms for Query Processing and

    E-Print Network [OSTI]

    Adam, Salah

    Algebra SELECT LNAME, FNAME FROM EMPLOYEE WHERE SALARY > ( SELECT MAX (SALARY) FROM EMPLOYEE WHERE DNO = 5); SELECT MAX (SALARY) FROM EMPLOYEE WHERE DNO = 5 SELECT LNAME, FNAME FROM EMPLOYEE WHERE SALARY > C MAX SALARY (DNO=5 (EMPLOYEE))LNAME, FNAME (SALARY>C(EMPLOYEE)) #12;March 24, 2008 ADBS: Query Opt. 7

  10. AutoEval: An Evaluation Methodology for Evaluating Query Suggestions Using Query Logs

    E-Print Network [OSTI]

    Kruschwitz, Udo

    . User evaluations of search engines are expensive and not easy to replicate. The problem is even more pronounced when assessing adap- tive search systems, for example system-generated query modification suggestions that can be derived from past user interactions with a search engine. Automatically predicting

  11. Input-Sensitive Scalable Continuous Join Query This paper considers the problem of scalably processing a large number of continuous queries. Our

    E-Print Network [OSTI]

    Agarwal, Pankaj K.

    Input-Sensitive Scalable Continuous Join Query Processing Anonymous This paper considers the problem of scalably processing a large number of continuous queries. Our approach, consisting of novel in query predicates for efficient group processing. We partition the collection of continuous queries

  12. Semiclassical strings in AdS(3) X S^2

    E-Print Network [OSTI]

    Bogeun Gwak; Bum-Hoon Lee; Kamal L. Panigrahi; Chanyong Park

    2009-01-30

    In this paper, we investigate the semiclassical strings in AdS(3)XS^2, in which the string configuration of AdS(3) is classified to three cases depending on the parameters. Each of these has a different anomalous dimension proportional to logS, S^(1/3) and S, where S is a angular momentum on AdS(3). Further we generalize the dispersion relations for various string configuration on AdS(3)XS^2.

  13. A RETRIEVAL PATTERN-BASED INTER-QUERY LEARNING APPROACH FOR CONTENT-BASED IMAGE RETRIEVAL

    E-Print Network [OSTI]

    Qi, Xiaojun

    -query learning (a.k.a., short- term learning) to perform query tuning in a single retrieval session. Recently, inter-query learning (a.k.a., long-term learning) has been employed to further improve retrieval

  14. Adaptive Query Processing in Mobile Environment Hocine Grine

    E-Print Network [OSTI]

    Madiraju, Praveen

    . Furthermore, query optimization and execution must take into account available resources in or- der computing. In this context, actual query evaluation and op- timization techniques in distributed databases Descriptors C.2.4 [Computer-Communication Networks]: Distributed Systems--distributed applications; H.2

  15. PackageBuilder: Querying for packages of tuples Kevin Fernandes

    E-Print Network [OSTI]

    Meliou, Alexandra

    to query a database of recipes to retrieve all the gluten-free meals, assuming that the amount of gluten be gluten-free. This example cannot be expressed in traditional SQL: SQL queries can easily check conditions. For example, in the meal planner application, the gluten-free restriction is a base constraint, as it can

  16. Energy-Efficient Aggregate Query Evaluation in Sensor Networks

    E-Print Network [OSTI]

    Liang, Weifa

    Energy-Efficient Aggregate Query Evaluation in Sensor Networks Zhuoyuan Tu and Weifa Liang efficiently. This paper considers the aggregate query evaluation in a sensor network database, wliang}@cs.anu.edu.au Abstract. Sensor networks, consisting of sensor devices equipped with energy

  17. Article ID: Query Translation on the Fly in Deep Web

    E-Print Network [OSTI]

    Article ID: Query Translation on the Fly in Deep Web Integration Jiang Fangjiao, Jia Linlin, Meng users to access the desired information, many researches have dedicated to the Deep Web (i.e. Web databases) integration. We focus on query translation which is an important part of the Deep Web integration

  18. Maximizing the Sustained Throughput of Distributed Continuous Queries

    E-Print Network [OSTI]

    Palpanas, Themis

    the query plans that maximize throughput and adhere to the input profile. Examples of data stream managementMaximizing the Sustained Throughput of Distributed Continuous Queries Ioana Stanoi, George Mihaila of execution time for every incoming data tuple, which leads to an upper bound on the rate at which tuples can

  19. Materialized View Selection and Maintenance Using Multi-Query Optimization

    E-Print Network [OSTI]

    Ramamritham, Krithi

    Materialized View Selection and Maintenance Using Multi-Query Optimization Hoshi Mistry ¡ Prasan the differentials as above. Our work addresses the problem of optimizing the main- tenance of a set of materialized Materialized views have been found to be very effective at speeding up queries, and are increasingly being

  20. A Statistical Approach for Achievable Dose Querying in IMRT Planning

    E-Print Network [OSTI]

    Kazhdan, Michael

    Introduction We explore a data-driven approach for achievable dose querying in intensity- modulated radiation specifies too low a target dose to the OAR, the treatment plan may not be realiz- able and the treatmentA Statistical Approach for Achievable Dose Querying in IMRT Planning Patricio Simari1 , Binbin Wu2

  1. Query Specific Fusion for Image Retrieval Shaoting Zhang2

    E-Print Network [OSTI]

    Chen, Kuang-Yu

    Query Specific Fusion for Image Retrieval Shaoting Zhang2 , Ming Yang1 , Timothee Cour1 , Kai Yu1 indexed by compact hashing codes both demonstrate excellent scalability. However, their retrieval propose a graph-based query specific fusion approach where multiple retrieval sets are merged and reranked

  2. Efficient Query Processing on Graph Databases JAMES CHENG

    E-Print Network [OSTI]

    Ng, Wilfred Siu Hung

    . In this article, we propose an efficient index, FG*-index, to solve this problem. The cost of processing a subgraph query using most existing indexes mainly consists of two parts, the index probing cost and the candidate verification cost. Index probing is to find the query in the index, or to find the graphs from

  3. Window Query Processing in Linear Quadtrees Ashraf Aboulnaga

    E-Print Network [OSTI]

    Aboulnaga, Ashraf

    blocks and searching for these quadtree blocks in the linear quadtree index. The cost model is also based/O cost of processing a window query, and it uses two very simple parameters of the linear quadtree index the query window to search the B-tree. We also present a cost model that estimates the I/O cost

  4. Top-Down XML Keyword Query Processing Junfeng Zhou1

    E-Print Network [OSTI]

    New South Wales, University of

    keyword query w.r.t. LCA/SLCA/ELCA semantics. By "top-down", we mean that we visit all common ancestor (CA to define meaningful results, for which the basic semantics is Lowest Common Ancestor (LCA). Based on LCA, the most widely adopted query semantics are Exclusive LCA (ELCA) [3,7,10,23,27] and Smallest LCA (SLCA) [3

  5. A Foundation for Conventional and Temporal Query Optimization

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    substantially from built-in temporal support in the DBMS. To achieve this, temporal query representation DBMS architectures and ones where the temporal support is obtained via a layer on top of a conventional DBMS. This foundation captures duplicates and ordering for all queries, as well as coalescing

  6. Efficient Temporal Coalescing Query Support in Relational Database Systems

    E-Print Network [OSTI]

    Zaniolo, Carlo

    demand for temporal databases have only in- creased with time; unfortunately, DBMS vendors and standard by the lessons learned from the very history of temporal databases, where past proposals failed to gain much temporal query models with current DBMS engines [5]. Even if temporal database and query model can be well

  7. Efficient Consistency Proofs for Generalized Queries on a Committed Database

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Efficient Consistency Proofs for Generalized Queries on a Committed Database Rafail Ostrovsky UCLA@csail.mit.edu July 20, 2004 Abstract A consistent query protocol (CQP) allows a database owner to publish a very short string c which commits her and everybody else to a particular database D, so that any copy

  8. Efficient Consistency Proofs for Generalized Queries on a Committed Database

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Efficient Consistency Proofs for Generalized Queries on a Committed Database #3; Rafail Ostrovsky asmith@csail.mit.edu July 20, 2004 Abstract A consistent query protocol (CQP) allows a database owner to publish a very short string c which commits her and everybody else to a particular database D, so that any

  9. Modeling and Querying Video Databases \\Lambda Cyril Decleir

    E-Print Network [OSTI]

    Baader, Franz

    Modeling and Querying Video Databases \\Lambda Cyril Decleir LISI­INSA Lyon, Bâ??atiment 501 F­69621 database point of view, video data presents an interesting challenge in the development of data models is essential for providing content based access. This paper develops a data model and a rule­based query

  10. SQL Reference Learning Gupta SQLBase Structured Query Language

    E-Print Network [OSTI]

    SQL Reference Learning Gupta SQLBase Structured Query Language (SQL) By William Sprouse CENTER, CO 80523 Spring 1996 #12;SQL Reference Learning Gupta SQLBase Structured Query Language (SQL.1.2.4 The Clipboard 5 2.2 GETTING STARTED 5 2.2.1 STARTING QUEST 5 2.2.2 GETTING HELP 6 3. SQL BASICS 6 3

  11. Automatic Word Similarity Detection for TREC 4 Query Expansion

    E-Print Network [OSTI]

    Kansas, University of

    Boolean queries by including terms from an online thesaurus was able to improve search results (Gauch the query. However, the latter two approaches require the presence of an online thesaurus whose words closely match the contents of the database. #12;Where can such a thesaurus come from? In some cases

  12. LOGICAL QUERY COMPOSITION FROM LOCAL VISUAL FEATURE THESAURUS

    E-Print Network [OSTI]

    Fauqueur, Julien

    LOGICAL QUERY COMPOSITION FROM LOCAL VISUAL FEATURE THESAURUS Julien FAUQUEUR and Nozha BOUJEMAA photometric thesaurus. It gives an overview of the database content in the query interface. Unsupervised generation of this thesaurus is based on grouping similar regions into "region categories". The user can

  13. Properties and Application of Nondeterministic Quantum Query Algorithms

    E-Print Network [OSTI]

    Alina Dubrovska Vasilieva

    2006-11-07

    Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact, zero-error, bounded-error and even nondeterministic. In this paper, we study the latter class of algorithms. We introduce a fresh notion in addition to already studied nondeterministic algorithms and introduce dual nondeterministic quantum query algorithms. We examine properties of such algorithms and prove relations with exact and nondeterministic quantum query algorithm complexity. As a result and as an example of the application of discovered properties, we demonstrate a gap of n vs. 2 between classical deterministic and dual nondeterministic quantum query complexity for a specific Boolean function.

  14. A Digital Watermarking Approach to Secure and Precise Range Query Processing in Sensor Networks

    E-Print Network [OSTI]

    Liu, Alex X.

    . In this paper, we propose QuerySec, a protocol that enables storage nodes to process queries correctly while queries, which allows storage nodes to process queries correctly without knowing the actual values of both of sending to the sink via multiple hops, which saves energy for sensors. Second, storage nodes store sensor

  15. Fall 2011 CIS 452 STRUCTURED QUERY LANGUAGE (SQL) Course Number: CIS 452

    E-Print Network [OSTI]

    Diestel, Geoff

    Fall 2011 CIS 452 STRUCTURED QUERY LANGUAGE (SQL) Course Number: CIS 452 Course Name: Structured Query Language (SQL) Catalog Description: (2010-2011) A study of SQL, including relational database schema in SQL, formulating SQL queries and sub queries of varying complexity, embedding SQL statements

  16. Say What? Why users choose to speak their web queries Maryam Kamvar, Doug Beeferman

    E-Print Network [OSTI]

    Cortes, Corinna

    a higher probability of being typed than shorter queries. Index Terms: speech, voice, search, Google, query of voice web search (where the query is entered by speaking rather than by keyboard) is sparse, most likely on an aggregate level factors that are correlated with a decision to speak a web search query rather than type it

  17. HDF5-FastQuery: An API for Simplifying Access to Data Storage,Retrieval, Indexing and Querying

    SciTech Connect (OSTI)

    Bethel, E. Wes; Gosink, Luke; Shalf, John; Stockinger, Kurt; Wu,Kesheng

    2006-06-15

    This work focuses on research and development activities that bridge a gap between fundamental data management technology index, query, storage and retrieval and use of such technology in computational and computer science algorithms and applications. The work has resulted in a streamlined applications programming interface (API) that simplifies data storage and retrieval using the HDF5 data I/O library, and eases use of the FastBit compressed bitmap indexing software for data indexing/querying. The API, which we call HDF5-FastQuery, will have broad applications in domain sciences as well as associated data analysis and visualization applications.

  18. Query-Driven Visualization and Analysis

    SciTech Connect (OSTI)

    Ruebel, Oliver; Bethel, E. Wes; Prabhat, Mr.; Wu, Kesheng

    2012-11-01

    This report focuses on an approach to high performance visualization and analysis, termed query-driven visualization and analysis (QDV). QDV aims to reduce the amount of data that needs to be processed by the visualization, analysis, and rendering pipelines. The goal of the data reduction process is to separate out data that is "scientifically interesting'' and to focus visualization, analysis, and rendering on that interesting subset. The premise is that for any given visualization or analysis task, the data subset of interest is much smaller than the larger, complete data set. This strategy---extracting smaller data subsets of interest and focusing of the visualization processing on these subsets---is complementary to the approach of increasing the capacity of the visualization, analysis, and rendering pipelines through parallelism. This report discusses the fundamental concepts in QDV, their relationship to different stages in the visualization and analysis pipelines, and presents QDV's application to problems in diverse areas, ranging from forensic cybersecurity to high energy physics.

  19. Fermilab Today - Classified Ad Policy

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Fermilab Classified Ad Policy Fermilab Today now requires that people placing classified ads must belong to one of these categories: a. active and retired employees of Fermi...

  20. Running the AP DDR Query in PeopleSoft 8.8 1 Running the AP DDR Query in PeopleSoft 8.8

    E-Print Network [OSTI]

    Barrash, Warren

    Running the AP DDR Query in PeopleSoft 8.8 1 Running the AP DDR Query in PeopleSoft 8.8 People Novell user ID and password and click the Sign In button. #12;Running the AP DDR Query in PeopleSoft 8: In the top border of your window you will see your user Id. #12;Running the AP DDR Query in PeopleSoft 8.8 3

  1. CRAWLING DEEP WEB CONTENT THROUGH QUERY FORMS Jun Liu, Zhaohui Wu, Lu Jiang, Qinghua Zheng, Xiao Liu

    E-Print Network [OSTI]

    Shamos, Michael I.

    CRAWLING DEEP WEB CONTENT THROUGH QUERY FORMS Jun Liu, Zhaohui Wu, Lu Jiang, Qinghua Zheng, Xiao: Deep Web, Deep Web Surfacing, Minimum Executable Pattern, Adaptive Query Abstract: This paper proposes-based Deep Web adaptive query method. The query method extends query interface from single textbox to MEP set

  2. Logarithmic Operators in AdS_3/CFT_2

    E-Print Network [OSTI]

    Alex Lewis

    1999-11-30

    We discuss the relation between singletons in AdS_3 and logarithmic operators in the CFT on the boundary. In 2 dimensions there can be more logarithmic operators apart from those which correspond to singletons in AdS, because logarithmic operators can occur when the dimensions of primary fields differ by an integer instead of being equal. These operators may be needed to account for the greybody factor for gauge bosons in the bulk.

  3. Central Charge for 2D Gravity on AdS(2) and AdS(2)/CFT(1) Correspondence

    E-Print Network [OSTI]

    Mohsen Alishahiha; Farhad Ardalan

    2008-08-19

    We study 2D Maxwell-dilaton gravity on AdS(2). We distinguish two distinctive cases depending on whether the AdS(2) solution can be lifted to an AdS(3) geometry. In both cases, in order to get a consistent boundary condition we need to work with a twisted energy momentum tensor which has non-zero central charge. With this central charge and the explicit form of the twisted Virasoro generators we compute the entropy of the system using the Cardy formula. The entropy is found to be the same as that obtained from gravity calculations for a specific value of the level of the U(1) current. The agreement is an indication of $AdS(2)/CFT(1) correspondence.

  4. Adding Value to Agricultural Products 

    E-Print Network [OSTI]

    Anderson, David P.; Hanselka, Daniel

    2009-06-01

    You can significantly increase farm income by adding value to agricultural products and marketing those products effectively. This publication explains how to design a value-added product based on consumer preferences and how to build a business...

  5. AdS Field Theory from Conformal Field Theory

    E-Print Network [OSTI]

    A. Liam Fitzpatrick; Jared Kaplan

    2012-08-01

    We provide necessary and sufficient conditions for a Conformal Field Theory to have a description in terms of a perturbative Effective Field Theory in AdS. The first two conditions are well-known: the existence of a perturbative `1/N' expansion and an approximate Fock space of states generated by a finite number of low-dimension operators. We add a third condition, that the Mellin amplitudes of the CFT correlators must be well-approximated by functions that are bounded by a polynomial at infinity in Mellin space, or in other words, that the Mellin amplitudes have an effective theory-type expansion. We explain the relationship between our conditions and unitarity, and provide an analogy with scattering amplitudes that becomes exact in the flat space limit of AdS. The analysis also yields a simple connection between conformal blocks and AdS diagrams, providing a new calculational tool very much in the spirit of the S-Matrix program. We also begin to explore the potential pathologies associated with higher spin fields in AdS by generalizing Weinberg's soft theorems to AdS/CFT. The AdS analog of Weinberg's argument constrains the interactions of conserved currents in CFTs, but there are potential loopholes that are unavailable to theories of massless higher spin particles in flat spacetime.

  6. Recap Dictionaries Wildcard queries Edit distance Spelling correction Soundex Introduction to Information Retrieval

    E-Print Network [OSTI]

    Nejdl, Wolfgang

    Dictionaries Wildcard queries Edit distance Spelling correction Soundex Skip pointers 16 28 72 5 51 98 2 4 8 16

  7. Fully Power-Aware and Location-Aware Protocols for Wireless Multi-hop Ad Hoc Networks

    E-Print Network [OSTI]

    Tseng, Yu-Chee

    issue for MANET since most mobile hosts will be oper- ated by battery powers. In this paper, we address for almost all kinds of portable devices supported battery energy is power saving. Without power, any mobile to extend the lifetime of batteries is an important issue, especially for MANET, which consists of mobile

  8. Distributed Multicast Grouping for Publish/Subscribe over Mobile Ad Hoc Networks Eiko Yoneki and Jean Bacon

    E-Print Network [OSTI]

    Cambridge, University of

    and Jean Bacon University of Cambridge Computer Laboratory J J Thomson Avenue, Cambridge CB3 0FD, UK Email: {eiko.yoneki, jean.bacon}@cl.cam.ac.uk Abstract-- Event broker grids that deploy the pub- lish

  9. Spectral-efficiency of multi-antenna links in ad-hoc wireless networks with limited Tx CSI

    E-Print Network [OSTI]

    Govindasamy, Siddhartan

    An asymptotic expression is derived for the mean spectral efficiency of multi-antenna links randomly distributed on a plane in a uniform manner where transmitters (Tx) have Channel-State-Information (CSI) of the channels ...

  10. 60 Int. J. Ad Hoc and Ubiquitous Computing, Vol. 7, No. 1, 2011 A mobility framework to improve heterogeneous

    E-Print Network [OSTI]

    Atkinson, Robert C

    @hainu.edu.cn *Corresponding author Robert Atkinson and James Irvine Department of Electronic and Electrical Engineering, University of Strathclyde, Scotland, G1 1XW, UK E-mail: r.atkinson@eee.strath.ac.uk E-mail: j technologies. Wencai Du is a Professor and the Dean of College of Information Science & Technology, Hainan

  11. A Mobile Ad Hoc Bio-Sensor Network Yihan Li, Shivendra S. Panwar, Shiwen Mao, Srinivas Burugupalli, Jong ha Lee

    E-Print Network [OSTI]

    Panwar, Shivendra S.

    @photon.poly.edu, jlee25@utopia.poly.edu. Abstract-- Recent research shows that animals can be guided remotely, The system architecture and operation is introduced, and major challenges and issues are discussed. Because to sensor networks using robots. In this paper, we will first introduce the system architecture and major

  12. Fundamental Limits of Information Dissemination in Wireless Ad Hoc Networks---Part I: Single-Packet Reception

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2009-01-01

    ==D=P BHAA FG KDBT BTA BFB? C @D=D@A? = >DEB? =QJ? EB T? XA BTA @D=D@BFB? C "A? = >DEB? =JA0QJ? EB BHAA BT? B T? E @D=D@BFB? C ? HA? 0 #TA ? HA?

  13. Quorum-Based Asynchronous Power-Saving Protocols for IEEE 802.11 Ad Hoc Jehn-Ruey Jiang1

    E-Print Network [OSTI]

    Tseng, Yu-Chee

    rescue operations, and outdoor activities. This work is co-sponsored by the MOE Program for Promoting Aca is a critical issue for portable devices supported by batteries. Battery power is a limited re- source prediction: Since a host entering the PS mode will reduce its radio activity, other hosts who intend to send

  14. Broadcasting Based on Dominated Connecting Sets with MPR in a Realistic Environment for WSNs & AD-HOC

    E-Print Network [OSTI]

    Boyer, Edmond

    the redundancy, such as MPR (MultiPoint Relay) or DS-MPR (Connected Dominating Sets with MPR). These methods and existence of obstacles. This paper focuses on DS-MPR. Firstly, we test it in a realistic environment to show Sensor Networks; Broadcasting; Connected Dominating Sets; MultiPoint Relay; Lognormal model. 1

  15. Abstract--This article overviews the information-driven approach to sensor collaboration in ad hoc sensor networks. The

    E-Print Network [OSTI]

    Zhao, Feng

    into energy savings) and mitigate the risk of network node/link failures. The longevity of a network depends on the rate the power is consumed performing computation and communication tasks at these un- tethered, battery powered sensors. Therefore, one of the central issues for Collaborative Signal and Information

  16. A survey on securing user authentication in vehicular ad hoc networks Mrs. Arzoo Dahiya Mr. Vaibhav Sharma

    E-Print Network [OSTI]

    Jagannatham, Aditya K.

    Department Institute of Technology and Management Institute of Technology and Management Sector-23 A, Gurgaon(MANET). On demand set up, fault tolerance and unconstrained connectivity are a couple of advantages that why mobile vehicle to vehicle (V2V) communication and vehicle to road side communication. This paper describes

  17. Impact of Transport Models on Connectivity of Vehicular Ad-hoc Networks HO, Ivan; NORTH, Robin; POLAK, John; LEUNG, Kin

    E-Print Network [OSTI]

    Leung, Kin K.

    . For instance, Festag et al. (Festag et al., 2004) describe the real-world field trials of a car-to-car communication platform with an IEEE 802.11 air interface, while Bucciol et al. (Bucciol et al., 2005) conducted

  18. An Energy-Aware Simulation Model and Transaction Protocol for Dynamic Workload Distribution in Mobile Ad Hoc Networks1

    E-Print Network [OSTI]

    Pedram, Massoud

    An Energy-Aware Simulation Model and Transaction Protocol for Dynamic Workload Distribution an undesirable occurrence. Uneven distribution of energy resources and computational workloads is especially for detailed evaluation of the performance of different energy management policies in a MANET. Next it presents

  19. LA-DCF: A New Multiple Access Protocol for Ad-Hoc Wireless Richard Akester & Stephen Hailes

    E-Print Network [OSTI]

    Haddadi, Hamed

    during backoff, the host "freezes" the backoff timer. Once the carrier is sensed idle again, the backoff-to-end transport protocol, but this can take too long to detect the loss and take action, causing channel variations in delay affects the calculation of round trip times in transport protocols. Also, they are only

  20. Attacking the Asokan-Ginzboorg Protocol for Key Distribution in an Ad-Hoc Bluetooth Network Using CORAL 

    E-Print Network [OSTI]

    Steel, G.; Maidl, M.; Bundy, Alan

    We describe Coral, a counterexample finder for incorrect inductive conjectures. By devising a first-order version of Paulson's formalism for cryptographic protocol analysis, we are able to use Coral to attack protocols ...

  1. Poster Abstract: Energy-Efficient Data Organization and Query Processing in Sensor Networks

    E-Print Network [OSTI]

    Shahabi, Cyrus

    stor- age and query processing techniques called Data-Centric Storage that leverages locality, Performance, Experimentation Keywords: Sensor Networks, Data-Centric Storage, DCS, Data Organization, Query queries fall under one of the two broad categories namely, Data-Centric Routing (DCR) and Data-Centric

  2. Scalable Continuous Query Processing by Tracking Pankaj K. Agarwal Junyi Xie Jun Yang Hai Yu

    E-Print Network [OSTI]

    Agarwal, Pankaj K.

    Scalable Continuous Query Processing by Tracking Hotspots Pankaj K. Agarwal Junyi Xie Jun Yang Hai}@cs.duke.edu ABSTRACT This paper considers the problem of scalably processing a large number of continuous queries for group-processing and indexing hundreds of thousands of continuous queries. In our approach, we first

  3. Scalable Continuous Query Processing by Tracking Hotspots Pankaj K. Agarwal Junyi Xie Jun Yang Hai Yu

    E-Print Network [OSTI]

    Yang, Jun

    Scalable Continuous Query Processing by Tracking Hotspots Pankaj K. Agarwal Junyi Xie Jun Yang Hai}@cs.duke.edu Abstract This paper considers the problem of scalably processing a large number of continuous queries. We for intervals in linear time. 1 Introduction Continuous query processing has attracted much interest

  4. SEEDEEP: A System for Exploring and Querying Scientific Deep Web Data Sources

    E-Print Network [OSTI]

    Agrawal, Gagan

    SEEDEEP: A System for Exploring and Querying Scientific Deep Web Data Sources Fan Wang Gagan that are hidden behind query forms, thus forming what is re- ferred to as the deep web. In this paper, we propose SEEDEEP, a System for Exploring and quErying scientific DEEP web data sources. SEEDEEP is able

  5. Efficient XML-to-SQL Query Translation: Where to Add the Intelligence?

    E-Print Network [OSTI]

    Pennsylvania, University of

    Efficient XML-to-SQL Query Translation: Where to Add the Intelligence? Rajasekar Krishnamurthy of queries generated by XML to SQL translation. We first show that published XML-to-SQL query translation algo- rithms are suboptimal in that they often trans- late simple path expressions into complex SQL

  6. Efficient discrete-time simulations of continuous-time quantum query algorithms

    E-Print Network [OSTI]

    R. Cleve; D. Gottesman; M. Mosca; R. D. Somma; D. L. Yonge-Mallo

    2008-11-26

    The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuously in time. Interesting algorithms have been discovered in this model, such as an algorithm for evaluating nand trees more efficiently than any classical algorithm. Subsequent work has shown that there also exists an efficient algorithm for nand trees in the discrete query model; however, there is no efficient conversion known for continuous-time query algorithms for arbitrary problems. We show that any quantum algorithm in the continuous-time query model whose total query time is T can be simulated by a quantum algorithm in the discrete query model that makes O[T log(T) / log(log(T))] queries. This is the first upper bound that is independent of the driving operations (i.e., it holds even if the norm of the driving Hamiltonian is very large). A corollary is that any lower bound of T queries for a problem in the discrete-time query model immediately carries over to a lower bound of \\Omega[T log(log(T))/log (T)] in the continuous-time query model.

  7. A Protein Patent Query System Powered By Kleisli Jing Chen Limsoon Wong Louxin Zhang

    E-Print Network [OSTI]

    Wong, Limsoon

    A Protein Patent Query System Powered By Kleisli Jing Chen Limsoon Wong Louxin Zhang Bio effectively query protein patents. This system uses Kleisli to tie to­ gether the following sources to answer queries on protein patents that are considerably more demanding than simple free­text search: (1

  8. Query Cost Estimation through Remote System Contention States Analysis over the Internet

    E-Print Network [OSTI]

    Liu, Weiru

    Query Cost Estimation through Remote System Contention States Analysis over the Internet Weiru Liu costs of possible query plans in order to select the best one with the minimum cost. In this context, the cost of a query is affected by three factors: network congestion, server contention state

  9. Static Query Result Caching Revisited Rifat Ozcan, Ismail Sengor Altingovde, zgr Ulusoy

    E-Print Network [OSTI]

    Ulusoy, �zgür

    Static Query Result Caching Revisited Rifat Ozcan, Ismail Sengor Altingovde, �zgür Ulusoy first review several query features that are used to determine the contents of a static result cache and effectiveness). General Terms Performance, Experimentation. Keywords Search engine, static caching, query result

  10. Query Suggestion based on User Landing Pages Silviu Cucerzan and Ryen W. White

    E-Print Network [OSTI]

    Cucerzan, Silviu

    formulation, search process. General Terms Algorithms, Experimentation, Human Factors. Keywords Search engine results page, may not contain the queried terms, or may not even be indexed by the search engine users' post-query navigation patterns and the query logs of a large search engine. We compare

  11. SEARCHING FOR MULTIMEDIA: AN ANALYSIS OF AUDIO, VIDEO, AND IMAGE WEB QUERIES

    E-Print Network [OSTI]

    Jansen, James

    search engine. From this data set, terms were used to identify queries for audio, image, and video multimedia files by searching for file extensions and matching the filename to terms in the query (WittenSEARCHING FOR MULTIMEDIA: AN ANALYSIS OF AUDIO, VIDEO, AND IMAGE WEB QUERIES Bernard J. Jansen

  12. A SingleQuery BiDirectional Probabilistic Roadmap Planner with Lazy Collision Checking

    E-Print Network [OSTI]

    LaValle, Steven M.

    1 A Single­Query Bi­Directional Probabilistic Roadmap Planner with Lazy Collision Checking Gildardo probabilistic roadmap (PRM) planner that is: single­query --it does not pre­compute a roadmap, but uses the two the robot's free space by concurrently building a roadmap made of two trees rooted at the query

  13. Automatic Reformulation of Children's Search Queries Maarten van Kalsbeek, Joost de Wit, Dolf Trieschnigg,

    E-Print Network [OSTI]

    Hiemstra, Djoerd

    Terms Algorithms, Human Factors, Design Keywords Automatic Query Expansion, Search Behavior, 1 children may make. Most of the search engines offer only the possibility to enter a Boolean queryAutomatic Reformulation of Children's Search Queries Maarten van Kalsbeek, Joost de Wit, Dolf

  14. A New ClientServer Architecture for Distributed Query Processing

    E-Print Network [OSTI]

    with an essentially ``free'' backward reduction capability is proposed. We explore in detail the benefits and costsA New Client­Server Architecture for Distributed Query Processing Zhe Li Kenneth A. Ross Computer Science Department Computer Science Department Columbia University Columbia University New York, NY 10027

  15. Active Query Forwarding in Sensor Networks Narayanan Sadagopan

    E-Print Network [OSTI]

    Krishnamachari, Bhaskar

    , response latency and storage requirements. We show that with optimal parameter settings, depending on the update frequency, ACQUIRE obtains order of magnitude reduction over FBQ and potentially 60 to 85% energy days with a frequency of 1 measurement per hour") versus One-shot queries, which have a simple response

  16. STQL --A SPATIO-TEMPORAL QUERY LANGUAGE Martin Erwig

    E-Print Network [OSTI]

    Erwig, Martin

    evolutions of spatial objects over time. We consider spatio- temporal operations that are particularly useful is to provide a DBMS data model and query language capable of handling such time-dependent geome- tries. Thereby. Our modeling also includes the sim- pler, discrete case where temporal evolutions are stepwise

  17. Answering Table Queries on the Web using Column Rakesh Pimplikar

    E-Print Network [OSTI]

    Sarawagi, Sunita

    , India rakesh.pimplikar@in.ibm.com Sunita Sarawagi IIT Bombay Mumbai, India sunita@iitb.ac.in ABSTRACT We, . . . , Qq, decide for each Ti if it is relevant to Q and if so, identify the mapping between the columns of Ti and query columns. We represent this task as a graphical model that jointly maps all tables

  18. CQ-Buddy: Harnessing Peers For Distributed Continuous Query Processing

    E-Print Network [OSTI]

    Ng, Wee Siong

    In this paper, we present the design and evaluation of CQ-Buddy, a peer-to-peer (p2p) continuous query (CQ) processing system that is distributed, and highly-scalable. CQ-Buddy exploits the differences in capabilities ...

  19. On the Query Complexity of Perfect Gate Discrimination

    E-Print Network [OSTI]

    D'Ariano, Giacomo Mauro

    On the Query Complexity of Perfect Gate Discrimination Giulio Chiribella1 , Giacomo Mauro D'Ariano2 both deterministic strategies. For unambiguous gate discrimination, where errors are not tolerated that there is no difference between perfect probabilistic and perfect determin- istic gate discrimination. Hence, evaluating

  20. Dynamic LCA Queries on Trees # Richard Cole + Ramesh Hariharan #

    E-Print Network [OSTI]

    Cole, Richard

    Dynamic LCA Queries on Trees # Richard Cole + Ramesh Hariharan # Abstract We show how to maintain. The primary use of LCA computations in a su#x tree is to determine the longest common prefix of two substrings common ancestor of the corresponding nodes. The first constant time LCA computation algorithm was due

  1. Adaptable Query Optimization and Evaluation in Temporal Middleware

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    that such data- base applications may benefit substantially from built-in temporal support in the DBMS the DBMS proper or as a source level translation from temporal queries to conventional SQL. This paper proposes a new approach: using a middleware component on top of a conventional DBMS. This component accepts

  2. A Query Answering System for Data with Evolution Relationships

    E-Print Network [OSTI]

    Velegrakis, Yannis

    for exploiting the evolution relationships between the structures in the database. In particular, our system]: Miscellaneous General Terms Algorithms, Performance Keywords Data evolution, Probabilistic databases, GraphA Query Answering System for Data with Evolution Relationships Siarhei Bykau University of Trento

  3. Relational Databases for Querying XML Documents: Limitations and Opportunities

    E-Print Network [OSTI]

    Bertini, Robert L.

    ­ structured data models and query languages for this purpose, this paper explores the more conservative, and notice is given that copying is by permission of the Very Large Data Base Endowment. To copy otherwise@microsoft.com Abstract XML is fast emerging as the dominant standard for representing data in the World Wide Web

  4. Mining Databases and Data Streams with Query Languages and Rules

    E-Print Network [OSTI]

    Zaniolo, Carlo

    Mining Databases and Data Streams with Query Languages and Rules Carlo Zaniolo Computer Science that are beyond the reach of traditional Data Base Management Systems (DBMS), data mining stands out because extensions that have proven very effective at supporting data mining. Finally, we turn our attention

  5. DATA CONCERN AWARE QUERYING FOR THE INTEGRATION OF DATA SERVICES

    E-Print Network [OSTI]

    Dustdar, Schahram

    DATA CONCERN AWARE QUERYING FOR THE INTEGRATION OF DATA SERVICES Muhammad Intizar Ali, Reinhard,dustdar}@infosys.tuwien.ac.at Keywords: Data Services, Database as a Service, Data Services Integration, Data Concerns, XQuery. Abstract: There is an increasing trend for organizations to publish data over the web using data services. The published data

  6. Dynamic Query Optimization under Access Limitations and Dependencies

    E-Print Network [OSTI]

    Calvanese, Diego

    : Unlike relational tables in a database, data sources on the Web typically can only be accessed in limited ways. In particular, some of the source fields may be required as input and thus need to be mandatorily filled in order to access the source. Answering queries over sources with access limitations is a complex

  7. Taxonomy and synthesis of Web services querying languages

    E-Print Network [OSTI]

    Bitar, Ibrahim El; Roudies, Ounsa

    2012-01-01

    Most works on Web services has focused on discovery, composition and selection processes of these kinds of services. Other few works were interested in how to represent Web services search queries. However, these queries cannot be processed by ensuring a high level of performance without being adequately represented first. To this end, different query languages were designed. Even so, in the absence of a standard, these languages are quite various. Their diversity makes it difficult choosing the most suitable language. In fact, this language should be able to cover all types of preferences or requirements of clients such as their functional, nonfunctional,temporal or even specific constraints as is the case of geographical or spatial constraints and meet their needs and preferences helping to provide them the best answer. It must also be mutually simple and imposes no restrictions or at least not too many constraints in terms of prior knowledge to use and also provide a formal or semi-formal queries presentat...

  8. Multi-Query Feedback Motion Planning with LQR-Roadmaps

    E-Print Network [OSTI]

    Jackson, Daniel

    Multi-Query Feedback Motion Planning with LQR-Roadmaps Anirudha Majumdar School of Engineering "roadmap", with each segment representing a locally optimal trajectory of the system and a continuous) - and for parameterized finite-time invariance around a trajectory, as well as a "roadmap" construction al- gorithm

  9. IBM Haifa Research Lab 2010 IBM Corporation Query Performance Prediction

    E-Print Network [OSTI]

    Kurland, Oren

    IBM Haifa Research Lab © 2010 IBM Corporation Query Performance Prediction for IR David Carmel, IBM Haifa Research Lab Oren Kurland, Technion SIGIR Tutorial Portland Oregon, August 12, 2012 IBM Labs. David Carmel Research Staff Member at the Information Retrieval group at IBM Haifa Research Lab Ph

  10. Advanced SQL To write queries using nested select statements.

    E-Print Network [OSTI]

    Liang, Y. Daniel

    with the highest salary. You may attempt to solve the query using the following statement: select lastName || ', ' || firstName as "Name", salary from Faculty where salary = max(salary); This is erroneous because lastName || ', ' || firstName as "Name", salary from Faculty where salary = (select max(salary) from

  11. SUPPORTING SKYLINE QUERIES ON CATEGORICAL DATA IN WEB INFORMATION SYSTEMS

    E-Print Network [OSTI]

    Balke, Wolf-Tilo

    Electrical Engineering and Computer Science University of California, Berkeley, USA balke@eecs.berkeley.edu Ulrich Güntzer Institut für Informatik Universität Tübingen, Tübingen, Germany guentzer applications are economical choices e.g. a product's expected lifetime against its price. Skyline queries

  12. Bounded Conjunctive Queries Yang Cao1,2

    E-Print Network [OSTI]

    Fan, Wenfei

    of Edinburgh 2 RCBD and SKLSDE Lab, Beihang University 3 Facebook Inc. {Y.Cao-17@sms, wenfei@inf}.ed.ac.uk woty can reduce big D to a "small" DQ of a manageable size. Many real-life queries are actually (effectively) bounded. Example 1: Social networks, e.g., Facebook, allow us to tag a photo and show who

  13. Querying a Bioinformatic Data Sources Registry with Concept Lattices

    E-Print Network [OSTI]

    Devignes, Marie-Dominique

    on metadata reflecting information about sources rather than on data extracted from documents. Formal concept323 Querying a Bioinformatic Data Sources Registry with Concept Lattices Nizar Messai, Marie Bioinformatic data sources available on the web are multi- ple and heterogenous. The lack of documentation

  14. Large rotating AdS black holes from fluid mechanics

    E-Print Network [OSTI]

    Sayantani Bhattacharyya; Subhaneil Lahiri; R. Loganayagam; Shiraz Minwalla

    2008-07-25

    We use the AdS/CFT correspondence to argue that large rotating black holes in global AdS(D) spaces are dual to stationary solutions of the relativistic Navier-Stokes equations on S**(D-2). Reading off the equation of state of this fluid from the thermodynamics of non-rotating black holes, we proceed to construct the nonlinear spinning solutions of fluid mechanics that are dual to rotating black holes. In all known examples, the thermodynamics and the local stress tensor of our solutions are in precise agreement with the thermodynamics and boundary stress tensor of the spinning black holes. Our fluid dynamical description applies to large non-extremal black holes as well as a class of large non-supersymmetric extremal black holes, but is never valid for supersymmetric black holes. Our results yield predictions for the thermodynamics of all large black holes in all theories of gravity on AdS spaces, for example, string theory on AdS(5) x S**5 and M theory on AdS(4) x S**7 and AdS(7) x S**4.

  15. This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Secure and Robust Localization In A Wireless Ad

    E-Print Network [OSTI]

    Misra, Satyajayant

    This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. 1 Secure and Robust Localization the problem of accurate localization of static or mobile nodes in a wireless ad hoc network, using

  16. A Technique for Power-Aware Query-Informed Routing in Support of Long-Duration Queries for Sensor Networks

    E-Print Network [OSTI]

    Shatz, Sol M.

    informed" method enables the query process to be efficient in terms of energy consumption. The technique inventory, and healthcare, to military environments. Specific applications include wildlife tracking [6 is the energy constraint, which is a major objective in recent research on the design of sensor network systems

  17. 3-D Electrical Resistivity Tomography for Cliff Stability Assessment at Pointe du Hoc in Normandy, France 

    E-Print Network [OSTI]

    Udphuay, Suwimon

    2010-01-14

    Pointe du Hoc overlooking the English Channel in Normandy, France was host to one of the most important military engagements of World War II. While the site is a valuable historic cultural resource, it is vulnerable to ...

  18. VIQI: A New Approach for Visual Interpretation of Deep Web Query Interfaces

    E-Print Network [OSTI]

    Boughamoura, Radhouane; Omri, Mohamed Nazih

    2012-01-01

    Deep Web databases contain more than 90% of pertinent information of the Web. Despite their importance, users don't profit of this treasury. Many deep web services are offering competitive services in term of prices, quality of service, and facilities. As the number of services is growing rapidly, users have difficulty to ask many web services in the same time. In this paper, we imagine a system where users have the possibility to formulate one query using one query interface and then the system translates query to the rest of query interfaces. However, interfaces are created by designers in order to be interpreted visually by users, machines can not interpret query from a given interface. We propose a new approach which emulates capacity of interpretation of users and extracts query from deep web query interfaces. Our approach has proved good performances on two standard datasets.

  19. The Niagara Internet Query System Jeffrey Naughton, David DeWitt, David Maier, Ashraf Aboulnaga, Jianjun Chen,

    E-Print Network [OSTI]

    Bertini, Robert L.

    The Niagara Internet Query System Jeffrey Naughton, David DeWitt, David Maier, Ashraf Aboulnaga, merely being an XML query-processing engine does not render a system suitable for querying the Internet, or are infinite streams, or both. The Niagara Internet Query System was designed from the bottom-up to provide

  20. ObjectGlobe: Ubiquitous Query Processing on the Internet

    E-Print Network [OSTI]

    Kemper, Alfons

    for scalable Internet applications, such as business-to-business (B2B) e-commerce systems like SAP's "mySAP capabilities. The goal of the ObjectGlobe project is to establish an open market place in which data and query on the Internet. One of the main challenges in the design of such an open system is to ensure privacy and security

  1. Ultraviolet asymptotics for quasiperiodic AdS_4 perturbations

    E-Print Network [OSTI]

    Ben Craps; Oleg Evnin; Puttarak Jai-akson; Joris Vanhoof

    2015-10-29

    Spherically symmetric perturbations in AdS-scalar field systems of small amplitude epsilon approximately periodic on time scales of order 1/epsilon^2 (in the sense that no significant transfer of energy between the AdS normal modes occurs) have played an important role in considerations of AdS stability. They are seen as anchors of stability islands where collapse of small perturbations to black holes does not occur. (This collapse, if it happens, typically develops on time scales of the order 1/epsilon^2.) We construct an analytic treatment of the frequency spectra of such quasiperiodic perturbations, paying special attention to the large frequency asymptotics. For the case of a self-interacting phi^4 scalar field in a non-dynamical AdS background, we arrive at a fairly complete analytic picture involving quasiperiodic spectra with an exponential suppression modulated by a power law at large mode numbers. For the case of dynamical gravity, the structure of the large frequency asymptotics is more complicated. We give analytic explanations for the general qualitative features of quasiperiodic solutions localized around a single mode, in close parallel to our discussion of the probe scalar field, and find numerical evidence for logarithmic modulations in the gravitational quasiperiodic spectra existing on top of the formulas previously reported in the literature.

  2. Ultraviolet asymptotics for quasiperiodic AdS_4 perturbations

    E-Print Network [OSTI]

    Ben Craps; Oleg Evnin; Puttarak Jai-akson; Joris Vanhoof

    2015-09-04

    Spherically symmetric perturbations in AdS-scalar field systems of small amplitude epsilon approximately periodic on time scales of order 1/epsilon^2 (in the sense that no significant transfer of energy between the AdS normal modes occurs) have played an important role in considerations of AdS stability. They are seen as anchors of stability islands where collapse of small perturbations to black holes does not occur. (This collapse, if it happens, typically develops on time scales of the order 1/epsilon^2.) We construct an analytic treatment of the frequency spectra of such quasiperiodic perturbations, paying special attention to the large frequency asymptotics. For the case of a self-interacting phi^4 scalar field in a non-dynamical AdS background, we arrive at a fairly complete analytic picture involving quasiperiodic spectra with an exponential suppression modulated by a power law at large mode numbers. For the case of dynamical gravity, the structure of the large frequency asymptotics is more complicated. We give analytic explanations for the general qualitative features of quasiperiodic solutions localized around a single mode, in close parallel to our discussion of the probe scalar field, and find numerical evidence for logarithmic modulations in the gravitational quasiperiodic spectra existing on top of the formulas previously reported in the literature.

  3. Ultraviolet asymptotics for quasiperiodic AdS_4 perturbations

    E-Print Network [OSTI]

    Craps, Ben; Jai-akson, Puttarak; Vanhoof, Joris

    2015-01-01

    Spherically symmetric perturbations in AdS-scalar field systems of small amplitude epsilon approximately periodic on time scales of order 1/epsilon^2 (in the sense that no significant transfer of energy between the AdS normal modes occurs) have played an important role in considerations of AdS stability. They are seen as anchors of stability islands where collapse of small perturbations to black holes does not occur. (This collapse, if it happens, typically develops on time scales of the order 1/epsilon^2.) We construct an analytic treatment of the frequency spectra of such quasiperiodic perturbations, paying special attention to the large frequency asymptotics. For the case of a self-interacting phi^4 scalar field in a non-dynamical AdS background, we arrive at a fairly complete analytic picture involving quasiperiodic spectra with an exponential suppression modulated by a power law at large mode numbers. For the case of dynamical gravity, the structure of the large frequency asymptotics is more complicated....

  4. A paucity of bulk entangling surfaces: AdS wormholes with de Sitter interiors

    E-Print Network [OSTI]

    Fischetti, S; Marolf, D; Wall, AC

    2015-01-01

    Inside the horizon with AdS / CFT, Phys.Rev. D67 (2003)entanglement entropy from AdS/CFT, Phys.Rev.Lett. 96 (2006)dual to Reissner-Nordstrm AdS 5 , JHEP 1404 (2014) 023, [

  5. Perturbative entanglement thermodynamics for AdS spacetime: Renormalization

    E-Print Network [OSTI]

    Mishra, Rohit

    2015-01-01

    We study the effect of charged excitations in the AdS spacetime on the first law of entanglement thermodynamics. It is found that `boosted' AdS black holes give rise to a more general form of first law which includes chemical potential and charge density. To obtain this result we have to resort to a second order perturbative calculation of entanglement entropy for small size subsystems. At first order the form of entanglement law remains unchanged even in the presence of charged excitations. But the thermodynamic quantities have to be appropriately `renormalized' at the second order due to the corrections. We work in the perturbative regime where $T_{thermal}\\ll T_E$.

  6. Perturbative entanglement thermodynamics for AdS spacetime: Renormalization

    E-Print Network [OSTI]

    Rohit Mishra; Harvendra Singh

    2015-07-14

    We study the effect of charged excitations in the AdS spacetime on the first law of entanglement thermodynamics. It is found that `boosted' AdS black holes give rise to a more general form of first law which includes chemical potential and charge density. To obtain this result we have to resort to a second order perturbative calculation of entanglement entropy for small size subsystems. At first order the form of entanglement law remains unchanged even in the presence of charged excitations. But the thermodynamic quantities have to be appropriately `renormalized' at the second order due to the corrections. We work in the perturbative regime where $T_{thermal}\\ll T_E$.

  7. Emergent quantum criticality, Fermi surfaces, and AdS2

    E-Print Network [OSTI]

    Thomas Faulkner; Hong Liu; John McGreevy; David Vegh

    2011-10-30

    Gravity solutions dual to d-dimensional field theories at finite charge density have a near-horizon region which is AdS_2 x R^{d-1}. The scale invariance of the AdS_2 region implies that at low energies the dual field theory exhibits emergent quantum critical behavior controlled by a (0+1)-dimensional CFT. This interpretation sheds light on recently-discovered holographic descriptions of Fermi surfaces, allowing an analytic understanding of their low-energy excitations. For example, the scaling behavior near the Fermi surfaces is determined by conformal dimensions in the emergent IR CFT. In particular, when the operator is marginal in the IR CFT, the corresponding spectral function is precisely of the "Marginal Fermi Liquid" form, postulated to describe the optimally doped cuprates.

  8. Spiky Strings on AdS(4) X CP**3

    E-Print Network [OSTI]

    Bum-Hoon Lee; Kamal L. Panigrahi; Chanyong Park

    2008-11-07

    We study a giant magnon and a spike solution for the string rotating on AdS(4) X CP**3 geometry. We consider rigid rotating fundamental string in the SU(2) X SU(2) sector inside the CP**3 and find out the general form of all the conserved charges. We find out the dispersion relation corresponding to both the known giant magnon and the new spike solutions. We further study the finite size correction in both cases.

  9. Fermilab Today | Classifieds Ad Form

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    will be posted on the Internet and can lead to responses from outside the lab. Some ads posted in Fermilab Today in the past have received responses from scammers who, for...

  10. Optimised Phrase Querying and Browsing of Large Text Databases Dirk Bahle Hugh E. Williams Justin Zobel

    E-Print Network [OSTI]

    Zobel, Justin

    ://www.searchenginewatch.com/ efficient--that is, able to find documents quickly--when users pose informal ranked queries or Boolean

  11. Reordering an index to speed query processing without loss of effectiveness.

    E-Print Network [OSTI]

    Hawking, David

    of CO2 emissions. To illustrate the importance o world wide web search engines, a factor of two in query processing effi- ciency could translate

  12. QCS: a system for querying, clustering and summarizing documents.

    SciTech Connect (OSTI)

    Dunlavy, Daniel M.; Schlesinger, Judith D. (Center for Computing Sciences, Bowie, MD); O'Leary, Dianne P. (University of Maryland, College Park, MD); Conroy, John M. (Center for Computing Sciences, Bowie, MD)

    2006-10-01

    Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel hybrid information retrieval system--the Query, Cluster, Summarize (QCS) system--which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of components in the QCS design improves retrievals by providing users more focused information organized by topic. We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) along with the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines. Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence 'trimming', and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format. Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of the design, and the value of this particular combination of modules.

  13. Thermal Fluctuations in a Charged AdS Black Hole

    E-Print Network [OSTI]

    Pourhassan, B

    2015-01-01

    In this paper, we will analyze the effects of thermal fluctuations on a charged AdS black hole. This will be done by analyzing the corrections to black hole thermodynamics due to these thermal fluctuations. We will demonstrate that the entropy of this black hole get corrected by logarithmic term. We will also calculate other corrections to other important thermodynamic quantities for this black hole. Finally, we will use the corrected value of the specific heat to analyze the phase transition in this system.

  14. Thermal Fluctuations in a Charged AdS Black Hole

    E-Print Network [OSTI]

    B. Pourhassan; Mir Faizal

    2015-08-12

    In this paper, we will analyze the effects of thermal fluctuations on a charged AdS black hole. This will be done by analyzing the corrections to black hole thermodynamics due to these thermal fluctuations. We will demonstrate that the entropy of this black hole get corrected by logarithmic term. We will also calculate other corrections to other important thermodynamic quantities for this black hole. Finally, we will use the corrected value of the specific heat to analyze the phase transition in this system.

  15. Tunneling during Quantum Collapse in AdS Spacetime

    E-Print Network [OSTI]

    Cenalo Vaz; Kinjalk Lochan

    2013-01-30

    We extend previous results on the reflection and transmission of self-gravitating dust shells across the apparent horizon during quantum dust collapse to non-marginally-bound dust collapse in arbitrary dimensions with a negative cosmological constant. We show that the Hawking temperature is independent of the energy function and that the wave functional describing the collapse is well behaved at the Hawking-Page transition point. Thermal radiation from the apparent horizon appears as a generic result of non-marginal collapse in AdS space-time owing to the singular structure of the Hamiltonian constraint at the apparent horizon.

  16. Entanglement Entropy and Duality in AdS(4)

    E-Print Network [OSTI]

    Ioannis Bakas; Georgios Pastras

    2015-04-30

    Small variations of the entanglement entropy \\delta S and the expectation value of the modular Hamiltonian \\delta E are computed holographically for circular entangling curves in the boundary of AdS(4), using gravitational perturbations with general boundary conditions in spherical coordinates. Agreement with the first law of thermodynamics, \\delta S = \\delta E, requires that the line element of the entangling curve remains constant. In this context, we also find a manifestation of electric-magnetic duality for the entanglement entropy and the corresponding modular Hamiltonian, following from the holographic energy-momentum/Cotton tensor duality.

  17. Energy-Efficient Data Organization and Query Processing in Sensor Networks

    E-Print Network [OSTI]

    a class of data stor- age and query processing techniques called Data-Centric Storage that leverages approaches to organizing data and processing queries fall under one of the two broad categories namely, Data-Centric Routing (DCR) and Data-Centric Storage (DCS). In DCR, the data generated by the sensors is stored

  18. The OLAP-Enabled Grid: Model and Query Processing Algorithms Michael Lawrence Andrew Rau-Chaplin

    E-Print Network [OSTI]

    Rau-Chaplin, Andrew

    is on the efficient optimization of resources for answering queries based on a distributed query algorithm which uses com- puting resources. Grids, widely distributed collections of heterogeneous computers whose.cgmLab.org Abstract The operation of modern distributed enterprises, be they commercial, scientific, or health related

  19. Classifying the user intent of web queries using k-means

    E-Print Network [OSTI]

    Jansen, James

    , Queensland University of Technology, Brisbane, Australia Abstract Purpose ­ Web search engines are frequently 75 percent of web queries (clustered into eight classifications) are informational in nature the intents of the user queries. Automatic classification of user intent can lead to improved web search

  20. Query Optimization as a Datalog Program Mengmeng Liu, Zachary G. Ives, and Boon Thau Loo

    E-Print Network [OSTI]

    Ives, Zachary G.

    Query Optimization as a Datalog Program Mengmeng Liu, Zachary G. Ives, and Boon Thau Loo University is that of specifying the transformation rules and search process of a query optimizer [1]. In certain emerging domains universally understood than the languages used in transformational optimizers like those generated by Volcano

  1. Join Synopses for Approximate Query Answering Swarup Acharya Phillip B. Gibbons Viswanath Poosala Sridhar Ramaswamy

    E-Print Network [OSTI]

    Gibbons, Phillip B.

    optimizer to estimate plan costs; such an application demands very fast response times but not exact answers to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full solely on providing exact answers to queries, in a manner that seeks to minimize response time

  2. Figure 1. IDVL interface showing 12 documents returned for "El Nio" query along with different multimedia

    E-Print Network [OSTI]

    Wactlar, Howard D.

    to evaluate them. We aggregate and integrate video content on-demand to enable summarization and visualization that provides the users with coherent responses to their queries in a useful broader context, perhaps library, i.e., metadata, to return a set of video documents in response to a user query, as shown

  3. MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System

    E-Print Network [OSTI]

    Liu, Ling

    MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile. Significant research efforts have been dedicated to techniques for efficient processing of spatial continuous and scalable solution to processing continuously moving queries on moving objects and describe the design

  4. Query Planning for Searching Inter-Dependent Deep-web Databases

    E-Print Network [OSTI]

    Agrawal, Gagan

    Query Planning for Searching Inter-Dependent Deep-web Databases Fan Wang1 , Gagan Agrawal1 query forms, thus forming what is referred to as the deep web. It is de- sirable to have systems data retrieval from the deep web. However, such systems need to address the following challenges. First

  5. Query Planning for Searching Inter-dependent Deep-Web Databases

    E-Print Network [OSTI]

    Jin, Ruoming

    Query Planning for Searching Inter-dependent Deep-Web Databases Fan Wang1 , Gagan Agrawal1 query forms, thus forming what is referred to as the deep web. It is de- sirable to have systems data retrieval from the deep web. However, such systems need to address the following challenges. First

  6. Improving Performance of Web Services Query Matchmaking with Automated Knowledge Acquisition

    E-Print Network [OSTI]

    Meng, Weiyi

    Improving Performance of Web Services Query Matchmaking with Automated Knowledge Acquisition that abstract away the fundamental complexity of XML-based Web services specifications and toolkits, and provide an elegant, intuitive, simple, and powerful query-based invocation system to end users. Web services based

  7. All-Nearest-Neighbors Queries in Spatial Databases School of Computer Engineering

    E-Print Network [OSTI]

    Papadias, Dimitris

    applications: · Geographical Information Systems: Example queries include "find the nearest parking lot to the use of ANN queries, as opposed to previous quadratic-cost approaches. · Computer Architecture/VLSI design: The operability and speed of very large circuits depends on the relative distance between

  8. Anonymous Query Processing in Road Networks Kyriakos Mouratidis, Man Lung Yiu

    E-Print Network [OSTI]

    Yiu, Man Lung

    -based services (LBS). Due to the nature of spatial queries, an LBS needs the user position in order to pro- cess spatial query processing, but the main challenge in the LBS industry is of a different nature, etc. User privacy may be threatened because of the sensitive nature of accessed data; e.g., inquiring

  9. Prioritized Sequencing for Efficient Query on Broadcast Geographical Information in Mobile-Computing

    E-Print Network [OSTI]

    Gruenwald, Le

    in improving query efficiency in geographical information broadcast systems. We also proved the linearPrioritized Sequencing for Efficient Query on Broadcast Geographical Information in Mobile and efficient way to disseminate public geographical information to massive users. In this paper, we use R

  10. Ontology-based Query Construction for GeoCLEF and Gnter Neumann2

    E-Print Network [OSTI]

    Neumann, Günter

    : Geographical Information Retrieval, query expansion, ontology 1 Introduction The goal of geographic information). As for GIR, since geographic variation is an important criterion for evaluating such systems, we assume the traditional information retrieval, we focus more on the query expansion instead of document ranking. We parse

  11. Yuan, M. and J. McIntosh. 2002. A Typology of Spatiotemporal Information Queries. Mining

    E-Print Network [OSTI]

    Yuan, May

    1 Chapter Yuan, M. and J. McIntosh. 2002. A Typology of Spatiotemporal Information Queries. Mining Spatiotemporal Information Systems. K. Shaw, R. Ladner, and M. Abdelguerfi (eds.). Kuwer Academic Publishers. PP. 63-82. A Typology of Spatiotemporal Information Queries May Yuan and John McIntosh Department

  12. Flexible and Scalable CostBased Query Planning in Mediators: A Transformational

    E-Print Network [OSTI]

    Ambite, José Luis

    the utility of a plan decreases with time, thus a trade­off between planning time and plan qualityFlexible and Scalable Cost­Based Query Planning in Mediators: A Transformational Approach Jos to networked information. Query planning, the task of generating a cost­efficient plan that computes a user

  13. Algebra-to-SQL Query Translation for Spatio-Temporal Databases

    E-Print Network [OSTI]

    Libre de Bruxelles, Université

    of transforming the queries expressed for the conceptual schema into an operational query for a target DBMS or GIS their applications, such specifications must be translated into the operational model of current DBMS or GIS who have little technical knowledge of the underlying DBMS or GIS software. #12;The MurMur project

  14. Representing and Querying the Evolution of Databases and their Schemas in Fusheng Wang and Carlo Zaniolo

    E-Print Network [OSTI]

    Zaniolo, Carlo

    Representing and Querying the Evolution of Databases and their Schemas in XML Fusheng Wang surprisingly effective solutions to the problem of representing and querying the evolution of databases for evolution [20, 19, 13]. Meanwhile, there is much current interest in publishing and viewing database

  15. SQL4X: A Flexible Query Language for XML and Relational Databases

    E-Print Network [OSTI]

    Kanza, Yaron

    SQL4X: A Flexible Query Language for XML and Relational Databases Sara Cohen, Yaron Kanza, and Yehoshua Sagiv The Hebrew University, Institute of Computer Science, Jerusalem 91904, Israel Abstract. SQL4. Using SQL4X, one can create both relations and XML documents as query results. Thus, SQL4X can

  16. Modeling and Querying Metadata in the Semantic Sensor Web: the Model stRDF and the

    E-Print Network [OSTI]

    Koubarakis, Manolis

    Modeling and Querying Metadata in the Semantic Sensor Web: the Model stRDF and the Query Language extend RDF, which will often be the metadata model of choice in the Semantic Sensor Web, with a uniform and Kapodistrian University of Athens Greece {koubarak,kkyzir}@di.uoa.gr Abstract. RDF will often be the metadata

  17. Querying Big Data: Bridging Theory and Practice Wenfei Fana,b

    E-Print Network [OSTI]

    Fan, Wenfei

    Querying Big Data: Bridging Theory and Practice Wenfei Fana,b , Jinpeng Huaib aInternational Research Center on Big Data, Beihang University, Beijing, No.37 XueYuan Road, 100083, Beijing, China Abstract Big data introduces challenges to query answering, from theory to practice. A number of questions

  18. Continuous Query Processing of Spatio-temporal Data Streams in PLACE

    E-Print Network [OSTI]

    Mokbel, Mohamed F.

    of Calgary, Calgary, Alberta E-mail:hammad@cpsc.ucalgary.ca Abstract. The tremendous increase in the use as queries are continuously moving. In this paper, we present a continuous query processor designed receive data from mobile objects (e.g., moving vehicles in road networks). The streaming nature

  19. Window-aware Load Shedding for Aggregation Queries over Data Streams

    E-Print Network [OSTI]

    - tem must shed load in order to maintain low-latency query results. In this paper, we describe a loadWindow-aware Load Shedding for Aggregation Queries over Data Streams Nesime Tatbul Brown University tatbul@cs.brown.edu Stan Zdonik Brown University sbz@cs.brown.edu ABSTRACT Data stream management

  20. Combining Multiple Evidence from Dierent Types of Thesaurus for Query Expansion

    E-Print Network [OSTI]

    Nie, Jian-Yun

    Combining Multiple Evidence from Dierent Types of Thesaurus for Query Expansion Rila Mandala only one type of thesaurus has generally been used. In this paper we analyze the characteristics of dierent thesaurus types and propose a method to combine them for query ex- pansion. Experiments using

  1. RESQ: Rank-Energy Selective Query Forwarding for Distributed Search Systems

    E-Print Network [OSTI]

    decisions. Using a large-scale query log and publicly-available energy price time series, we demonstrate ranking query results and savings in temporally- and spatially-varying energy prices. Categories Deviation = $52.78/mWh Average = $111.87/mWh Figure 1: Energy price temporal and spatial varia- tion: (top

  2. Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution

    E-Print Network [OSTI]

    Gupta, Himanshu

    in a collaborative fashion, and is periodically queried by an external source to report a summary of the sensed data algorithm, and propose several optimizations to reduce the communication overhead of the algorithm. Finally certain objects of interest, say tanks. A typical query could be: Report the number of tank sightings

  3. Anti-pattern Detection with Model Queries: A Comparison of Approaches

    E-Print Network [OSTI]

    Ferenc, Rudolf

    Anti-pattern Detection with Model Queries: A Comparison of Approaches Zoltán Ujhelyi, Ákos Horváth (EMF) as an underlying representation of program models processed by three general-purpose model query with a metamod- eling framework, such as the Eclipse Modeling Framework (EMF), which offers advanced tooling

  4. Towards Large-Scale Collaborative Planning: Answering High-Level Search Queries Using Human Computation

    E-Print Network [OSTI]

    Chen, Yiling

    Towards Large-Scale Collaborative Planning: Answering High-Level Search Queries Using Human of Engineering and Applied Sciences Harvard University hq@eecs.harvard.edu Abstract Behind every search query is a high-level mission that the user wants to accomplish. While current search en- gines can often provide

  5. Real time search on the web: Queries, topics, and economic value Bernard J. Jansen a,

    E-Print Network [OSTI]

    Jansen, James

    examine aggregate usage of the search engine, including number of users, queries, and terms. We term interest in a topic and the polling nature of real time queries. Concerning search topics geographical affinity, pointing to a location-based aspect to real time search. In terms of economic value, we

  6. Rounds vs Queries Trade-off in Noisy Computation [Extended Abstract

    E-Print Network [OSTI]

    Saks, Michael

    Rounds vs Queries Trade-off in Noisy Computation [Extended Abstract] Navin Goyal Michael Saks OR of n bits. This answers a question of Newman [21]. We prove more general trade-offs between the number (noise-free) model, a boolean function f(x1, . . . , xn) is to be computed by querying variables

  7. Context-Sensitive Query Auto-Completion Ziv Bar-Yossef

    E-Print Network [OSTI]

    Bar-Yossef, Ziv

    , Israel nkraus@cs.technion.ac.il ABSTRACT Query auto completion is known to provide poor predictions 31905, Israel zivby@ee.technion.ac.il Naama Kraus Computer Science Department Technion Haifa 32000 that context, such as the user's recent queries, can be used to improve the prediction quality considerably

  8. Frequent query discovery: a unifying ILP approach to association rule mining

    E-Print Network [OSTI]

    Hinneburg, Alexander

    Frequent query discovery: a unifying ILP approach to association rule mining Luc Dehaspe and Hannu Celestijnenlaan 200A -- B­3001 Heverlee (Belgium) #12; Frequent query discovery: a unifying ILP approach to association rule mining Luc Dehaspe \\Lambda and Hannu Toivonen y Report CW 258, March 2, 1998 Department

  9. Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps

    E-Print Network [OSTI]

    Kavraki, Lydia E.

    Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps Mert Akinc sample-based method primarily designed for multiple query planning (the Probabilistic Roadmap Method the Probabilistic Roadmap of Trees (PRT), uses a tree algorithm as a subroutine for PRM. The nodes of the PRM

  10. ROADTRACK: Scaling Location Updates for Mobile Clients on Road Networks with Query Awareness

    E-Print Network [OSTI]

    Liu, Ling

    ROADTRACK: Scaling Location Updates for Mobile Clients on Road Networks with Query Awareness Peter ROADTRACK ­ a road- network based, query-aware location update framework with two unique features. First, we road-network based check-free inter- val optimization further enhances the effectiveness of the ROAD

  11. Second-Order Signature: A Tool for Specifying Data Models, Query Processing, and Optimization

    E-Print Network [OSTI]

    Güting, Ralf Hartmut

    -order signature (and algebra), a system of two coupled many-sorted signatures, where the top-level signature the types defined as terms of the top level. Hence the top level can be used to define a data or representation model and the bottom level to describe a query algebra or a query processing algebra. We show

  12. Rethinking Query Processing for Energy Efficiency: Slowing Down to Win the Race

    E-Print Network [OSTI]

    Patel, Jignesh

    Rethinking Query Processing for Energy Efficiency: Slowing Down to Win the Race Willis Lang of an energy efficiency metric along with traditional performance metrics. This change is fueled by the growing, real, and urgent demand for energy-efficient database processing. Database query processing engines

  13. Topics in 3D N=2 AdS supergravity in superspace

    E-Print Network [OSTI]

    Gabriele Tartaglino-Mazzucchelli

    2012-02-01

    We review some recent results on the construction in superspace of 3D N=2 AdS supergravities and on the formulation of rigid supersymmetric theories in (1,1) and (2,0) AdS superspaces.

  14. Scattering States in AdS/CFT

    E-Print Network [OSTI]

    A. Liam Fitzpatrick; Jared Kaplan

    2011-04-13

    We show that suitably regulated multi-trace primary states in large N CFTs behave like `in' and `out' scattering states in the flat-space limit of AdS. Their transition matrix elements approach the exact scattering amplitudes for the bulk theory, providing a natural CFT definition of the flat space S-Matrix. We study corrections resulting from the AdS curvature and particle propagation far from the center of AdS, and show that AdS simply provides an IR regulator that disappears in the flat space limit.

  15. Strings on AdS Wormholes and Nonsingular Black Holes

    E-Print Network [OSTI]

    H. Lu; Justin F. Vazquez-Poritz; Zhibai Zhang

    2014-10-22

    Certain AdS black holes in the STU model can be conformally scaled to wormhole and black hole solutions of an f(R) type theory which have two asymptotically AdS regions and are completely free of curvature singularities. While there is a delta-function source for the dilaton, classical string probes are not sensitive to this singularity. If the AdS/CFT correspondence can be applied in this context, then the wormhole background describes a phase in which two copies of a conformal field theory interact with each other, whereas the nonsingular black hole describes entangled states. By studying the behavior of open strings on these backgrounds, we extract a number of features of the quarks and anti-quarks that live in the field theories. In the interacting phase, we find that there is a maximum speed with which the quarks can move without losing energy, beyond which energy is transferred from a quark in one field theory to a quark in the other. We also compute the rate at which moving quarks within entangled states lose energy to the two surrounding plasmas. While a quark-antiquark pair within a single field theory exhibits Coulomb interaction for small separation, a quark in one field theory exhibits spring-like confinement with an anti-quark in the other field theory. For the entangled states, we study how the quark-antiquark screening length depends on temperature and chemical potential. In the interacting phase of the two field theories, a quadruplet made up of one quark-antiquark pair in each field theory can undergo transitions involving how the quarks and antiquarks are paired in terms of the screening.

  16. Parallelizing Skyline Queries for Scalable Distribution Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Divyakant Agrawal and Amr El

    E-Print Network [OSTI]

    Zhao, Ben Y.

    a partial or­ der on query propagation in order to pipeline query execution. Our analysis shows that DSL,000 to $15,000 and mileage between 50K and 100K miles. The discussion hereafter focuses on this generalized

  17. Parallelizing Skyline Queries for Scalable Distribution Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Divyakant Agrawal,

    E-Print Network [OSTI]

    Almeroth, Kevin C.

    order on query propagation in order to pipeline query execution. Our analysis shows that DSL is optimal records within the price range of $10,000 to $15,000 and mileage between 50K and 100K miles

  18. AdHeat: An Influence-based Diffusion Model for Propagating Hints to Match Ads

    E-Print Network [OSTI]

    Cortes, Corinna

    AdHeat: An Influence-based Diffusion Model for Propagating Hints to Match Ads Hongji Bao Google edchang@google.com ABSTRACT In this paper, we present AdHeat, a social ad model con- sidering user influence in addition to relevance for match- ing ads. Traditionally, ad placement employs the relevance

  19. Query-aware Test Generation Using a Relational Constraint Solver Shadi Abdul Khalek Bassem Elkarablieh Yai O. Laleye Sarfraz Khurshid

    E-Print Network [OSTI]

    Khurshid, Sarfraz

    systems (DBMS) using the Alloy tool-set. Given a database schema and an SQL query as inputs, our approach the execution result of a DBMS query processor. By incorporating both the schema and the query during is prohibitively expensive [10]. DBMS testing, in general, is a labor intensive, time consuming process, often

  20. Thermodynamics of Charged Lovelock - AdS Black Holes

    E-Print Network [OSTI]

    Prasobh C. B.; Jishnu Suresh; V. C. Kuriakose

    2015-10-16

    We investigate the thermodynamic behavior of maximally symmetric charged, asymptotically AdS black hole solutions of Lovelock gravity. We explore the thermodynamic stability of such solutions by the ordinary method of calculating the specific heat of the black holes and investigating its divergences which signal second order phase transitions between black hole states. We then utilize the methods of thermodynamic geometry of black hole spacetimes in order to explain the origin of these points of divergence. We calculate the curvature scalar corresponding to a Legendre-invariant thermodynamic metric of these spacetimes and find that the divergences in the black hole specific heat correspond to singularities in the thermodynamic phase space. We also calculate the area spectrum for large black holes in the model by applying the Bohr-Sommerfeld quantization to the adiabatic invariant calculated for the spacetime.