University of Maryland

Displaying 1-40 of 172 results

  • White Papers // Feb 2012

    Deaf Cooperation for Secrecy With Multiple Antennas at the Helper

    In this paper, the authors investigate the roles of Cooperative Jamming (CJ) and Noise Forwarding (NF) in improving the achievable secrecy rates of a Gaussian WireTap channel (GWT) when the helper node is equipped with multiple antennas. They decompose the channel from the helper to the eavesdropper into two orthogonal...

    Provided By University of Maryland

  • White Papers // Feb 2012

    Deaf Cooperation and Relay Selection Strategies for Secure Communication in Multiple Relay Networks

    In this paper, the authors investigate the roles of Cooperative Jamming (CJ) and Noise Forwarding (NF) in improving the achievable secrecy rates of a Gaussian WireTap channel (GWT). In particular, they study the role of a deaf helper in confusing the eavesdropper in a GWT channel by either transmitting white...

    Provided By University of Maryland

  • White Papers // Jan 2012

    Secure Communication in Multiple Relay Networks Through Decode-and-Forward Strategies

    In this paper, the authors first study the Decode-and-Forward strategy for secrecy in a single-relay network. They propose a suboptimal Decode-and-Forward with Zero Forcing (DF/ZF) strategy for which they obtain the optimal power control policy. Next, they consider the multiple relay problem. They propose three different strategies based on DF/ZF....

    Provided By University of Maryland

  • White Papers // Jan 2012

    Formal Specification and Analysis of PCF Protocol in the 802.11 Standard Using Systems of Communicating Machines

    With the widespread usage of the 802.11 protocol, it becomes important to study the protocol operation. In this paper, the authors propose a formal model for the point coordination function of the 802.11 MAC layer using systems of communicating machines. Their goal is to analyze the protocol for safety and...

    Provided By University of Maryland

  • White Papers // Jan 2012

    Towards an Optimal Strategy for WLAN Location Determination Systems

    This paper presents a general analysis for the performance of WLAN location determination systems. In particular, the authors present an analytical method for calculating the average distance error and probability of error of WLAN location determination systems. These expressions are obtained with no assumptions regarding the distribution of signal strength...

    Provided By University of Maryland

  • White Papers // Jan 2012

    Kitsune: Efficient, General-Purpose Dynamic Software Updating for C

    Dynamic Software Updating (DSU) systems allow programs to be updated while running, thereby allowing developers to add features and fix bugs without downtime. This paper introduces Kitsune, a new DSU system for C whose design has three notable features. First, Kitsune's updating mechanism updates the whole program, not individual functions....

    Provided By University of Maryland

  • White Papers // Jan 2012

    Universally-Composable Two-Party Computation in Two Rounds

    Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. The authors show here a Universally Composable (UC) protocol (in the common reference string model) for two-party computation of any functionality, where both parties receive output,...

    Provided By University of Maryland

  • White Papers // Jan 2012

    Jamming Games for Power Controlled Medium Access With Dynamic Traffic

    Due to the broadcast nature of the wireless medium, wireless networks are highly susceptible to jamming attacks. Such attacks are often studied in a game theoretic framework under the assumption of uninterrupted traffic subject to continuous jamming opportunities. The authors analyze the effect of dynamically changing traffic on jamming games...

    Provided By University of Maryland

  • White Papers // Dec 2011

    Neighbor Discovery in a Wireless Sensor Network: Multipacket Reception Capability and Physical-Layer Signal Processing

    In randomly deployed networks, such as sensor networks, an important problem for each node is to discover its neighbor nodes so that the connectivity amongst nodes can be established. In this paper, the authors consider this problem by incorporating the physical layer parameters in contrast to the most of the...

    Provided By University of Maryland

  • White Papers // Dec 2011

    Chinese Restaurant Game - Part II: Applications to Wireless Networking, Cloud Computing, and Online Social Networking

    In this paper, the authors proposed a new game, called Chinese restaurant game, to analyze the social learning problem with negative network externality. The best responses of agents in the Chinese restaurant game with imperfect signals are constructed through a recursive method, and the influence of both learning and network...

    Provided By University of Maryland

  • White Papers // Oct 2011

    Wiretap Channels: Implications of the More Capable Condition and Cyclic Shift Symmetry

    Characterization of the rate-equivocation region of a general wiretap channel involves two auxiliary random variables: U, for rate splitting and V, for channel prefixing. Evaluation of regions involving auxiliary random variables is generally difficult. In this paper, the authors explore specific classes of wiretap channels for which the expression and...

    Provided By University of Maryland

  • White Papers // Oct 2011

    The Network Stack Trace: Performance Diagnosis for Networked Systems

    Transient network stalls that degrade application performance are frustrating to users and developers alike. Software bugs, network congestion, and intermittent connectivity all have the same symptoms - low throughput, high latency, and user-level timeouts. In this paper, the authors show how an end host can identify the sources of network...

    Provided By University of Maryland

  • White Papers // Sep 2011

    ITree: Efficiently Discovering High-Coverage Configurations Using Interaction Trees

    Software configurability has many benefits, but it also makes programs much harder to test, as in the worst case the program must be tested under every possible configuration. One potential remedy to this problem is Combinatorial Interaction Testing (CIT), in which typically the developer selects a strength t and then...

    Provided By University of Maryland

  • White Papers // Sep 2011

    Evaluating Dynamic Software Update Safety Using Systematic Testing

    Dynamic Software Updating (DSU) systems patch programs on the fly without incurring downtime. To avoid failures due to the updating process itself, many DSU systems employ timing restrictions. However, timing restrictions are theoretically imperfect, and their practical effectiveness is an open question. This paper presents the first significant empirical evaluation...

    Provided By University of Maryland

  • White Papers // Sep 2011

    Bandwidth Management for Mobile Media Delivery

    Mobile broadband networks such as 3G and WiMAX present unique challenges to media delivery. Rich media applications require high throughput and low end-to-end delay in order to maintain good quality. Due to the inherent noise in congestion signals (delay / loss) on mobile networks, existing bandwidth management approaches are unable...

    Provided By University of Maryland

  • White Papers // Aug 2011

    A Demo of Coco: A Compiler for Monadic Coercions in ML

    Combining monadic computations may induce a significant syntactic overhead. To allow monadic programming in direct style, the authors have developed Coco, a type-based tool that automatically rewrites ML code inserting necessary binds, unit, and morphisms between monads. This tool demonstration will show how to take advantage of Coco to facilitate...

    Provided By University of Maryland

  • White Papers // Aug 2011

    MultiOtter: Multiprocess Symbolic Execution

    Symbolic execution can be an effective technique for exploring large numbers of program paths, but it has generally been applied to programs running in isolation, whose inputs are files or command-line arguments. Programs that take inputs from other programs-servers, for example-have been beyond the reach of symbolic execution. To address...

    Provided By University of Maryland

  • White Papers // Jul 2011

    Motif-Based Topology Design for Efficient Performance by Networks of Mobile Autonomous Vehicles

    Networked systems of autonomous agents have emerged in a variety of applications such as collaborative robotics, mobile sensor networks and disaster relief operations. Complex phenomena are often observed in these systems due to the large number of agents, nonlinear interactions, locality of information transmission, and changes in the connectivity of...

    Provided By University of Maryland

  • White Papers // Jun 2011

    History-Free Sequential Aggregate Signatures

    Aggregation schemes allows to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion of unforgeability is preserved. Recently, Eikemeier et al. (SCN 2010) considered the notion of history-free sequential aggregation for message authentication codes, where the sequentially-executed aggregation algorithm...

    Provided By University of Maryland

  • White Papers // Jun 2011

    Towards Shrink-Wrapped Security: Practically Incorporating Context Into Security Services

    The mobile workforce is rapidly increasing, and technological advances make it feasible for these workers to have ubiquitous access to a variety of resources with various protection requirements. The dynamic computing environment of these workers mandates a security paradigm in which security is tightly coupled with a user's current situation....

    Provided By University of Maryland

  • White Papers // Jun 2011

    Universally Composable Synchronous Computation

    In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronous world: i.e., they can simultaneously achieve input completeness (all honest parties' inputs are included in the computation) and guaranteed termination (honest parties do not "Hang" indefinitely). In practice, truly synchronous networks rarely exist, but synchrony...

    Provided By University of Maryland

  • White Papers // Jun 2011

    Directed Symbolic Execution

    In this paper, the authors study the problem of automatically finding program executions that reach a particular target line. This problem arises in many debugging scenarios; for example, a developer may want to confirm that a bug reported by a static analysis tool on a particular line is a true...

    Provided By University of Maryland

  • White Papers // Jun 2011

    Optimal Packet Scheduling in a Multiple Access Channel With Energy Harvesting Transmitters

    In this paper, the authors investigate the optimal packet scheduling problem in a two-user multiple access communication system, where the transmitters are able to harvest energy from the nature. Under a deterministic system setting, they assume that the energy harvesting times and harvested energy amounts are known before the transmission...

    Provided By University of Maryland

  • White Papers // Jun 2011

    Multi-Receiver Wiretap Channel With Public and Confidential Messages

    The authors study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter sends a pair of public and confidential messages to each legitimate user. While there...

    Provided By University of Maryland

  • White Papers // May 2011

    Round Optimal Blind Signatures

    All known round optimal (i.e., two-move) blind signature schemes either need a common reference string, rely on random oracles, or assume the hardness of some interactive assumption. At Eurocrypt 2010, Fischlin and Schr?der showed that a broad class of three-move blind signature scheme cannot be instantiated in the standard model...

    Provided By University of Maryland

  • White Papers // May 2011

    Secure Multi-Party Computation of Boolean Circuits With Applications to Privacy in On-Line Marketplaces

    Protocols for generic secure Multi-Party Computation (MPC) come in two forms: they either represent the function being computed as a Boolean circuit or as an arithmetic circuit over a large field. Either type of protocol can be used for any function, but the choice of which type of protocol to...

    Provided By University of Maryland

  • White Papers // May 2011

    Analysis of Explanatory and Predictive Architectures and the Relevance in Explaining the Adoption of IT in SMEs

    This paper critiques the explanatory and predictive architectures of six prominent innovation adoption theories with a view to unraveling their individual capabilities in providing lenses to the understanding of the social and idiosyncratic components of Small and Medium Enterprise (SMEs) in adopting Information Technology (IT). The analysis unravels that the...

    Provided By University of Maryland

  • White Papers // May 2011

    Adaptive Transmission Policies for Energy Harvesting Wireless Nodes in Fading Channels

    In this paper, the authors consider a single-user communication system, where an energy harvesting transmitter communicates with a receiver over a fading wireless channel. They design adaptive transmission policies that adapt to the random energy arrivals at the transmitter and random fluctuations in the channel, in order to maximize the...

    Provided By University of Maryland

  • White Papers // May 2011

    LeechLock: Preventing Selfish Clients in the BitTorrent Protocol

    Although the BitTorrent protocol incentivizes sharing by increasing a peer's download rate, tools have demonstrated that the tit-for-tat mechanism alone is insufficient to prevent peers from downloading content without reciprocation. The authors propose an enhancement to the BitTorrent protocol, called Leechlock, which uses globally shared tables to track peers' ratings...

    Provided By University of Maryland

  • White Papers // Apr 2011

    CloudFuice: A flexible Cloud-Based Data Integration System

    The advent of cloud computing technologies shows great promise for web engineering and facilitates the development of flexible, distributed, and scalable web applications. Data integration can notably benefit from cloud computing because integrating web data is usually an expensive task. This paper introduces CloudFuice, a data integration system that follows...

    Provided By University of Maryland

  • White Papers // Apr 2011

    Dynamic Enforcement of Knowledge-Based Security Policies

    This paper explores the idea of knowledge-based security policies, which are used to decide whether to answer queries over secret data based on an estimation of the querier's (possibly increased) knowledge given the results. Limiting knowledge is the goal of existing information release policies that employ mechanisms such as noising,...

    Provided By University of Maryland

  • White Papers // Apr 2011

    Neural Network to Identify Individuals at Health Risk

    The risk of diseases such as heart attack and high blood pressure could be reduced by adequate physical activity. However, even though majority of general population claims to perform some physical exercise, only a minority exercises enough to keep a healthy living style. Thus, physical inactivity has become one of...

    Provided By University of Maryland

  • White Papers // Apr 2011

    Virtual MeshTest - Improving Wireless Network Testbed Using Virtualization and Migration Algorithm

    There are several laboratory-based mobile wireless testbeds such as the MeshTest and the CMU wireless emulator. These testbeds provide powerful computing network platforms for users who want to perform controlled, repeatable, mobile experiments in the lab. However, such systems can only use 10-15 nodes in an experiment. The Virtual Mesh...

    Provided By University of Maryland

  • White Papers // Mar 2011

    Image Ranking and Retrieval Based on Multi-Attribute Queries

    The authors propose a novel approach for ranking and retrieval of images based on multi-attribute queries. Existing image retrieval methods train separate classifiers for each word and heuristically combine their outputs for retrieving multiword queries. Moreover, these approaches also ignore the interdependencies among the query terms. In contrast, they propose...

    Provided By University of Maryland

  • White Papers // Mar 2011

    Constructing Inverted Files on a Cluster of Multicore Processors Near Peak I/O Throughput

    The authors develop a new strategy for processing a collection of documents on a cluster of multicore processors to build the inverted files at almost the peak I/O throughput of the underlying system. The algorithm is based on a number of novel techniques including: A high-throughput pipelined strategy that produces...

    Provided By University of Maryland

  • White Papers // Feb 2011

    Partitioning Detection and Connectivity Restoration Algorithm for Wireless Sensor Actor Networks

    Recently, Wireless Sensor and Actor Networks have been receiving a growing attention from the research community because of their suitability for critical applications. Maintaining inter-actor connectivity becomes extremely crucial in such situations where actors have to quickly plan optimal coordinated response to detected events. Failure of critical actor partitions the...

    Provided By University of Maryland

  • White Papers // Feb 2011

    Managing the Quality of Virtualized Services

    Managing the quality of virtualized services that are delivered on the cloud is very challenging. Such services are often composed of smaller components that are assembled on an as-needed basis. In this paper, the authors propose a framework to measure and semi-automatically track quality delivered by a Virtualized service delivery...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Retrofitting Security in COTS Software With Binary Rewriting

    The authors present a practical tool for inserting security features against low-level software attacks into third-party, proprietary or otherwise binary-only software. They are motivated by the inability of software users to select and use low-overhead protection schemes when source code is unavailable to them, by the lack of information as...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Position Paper: Dynamically Inferred Types for Dynamic Languages

    Over the past few years the authors have been developing Diamondback Ruby (DRuby), a tool that brings static type inference to Ruby, a dynamically typed, object-oriented language. Developing DRuby required creating a Ruby front-end, which was extremely challenging: like other dynamic languages, Ruby has a complex, yet poorly documented syntax...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Using Data for Systemic Financial Risk Management

    The recent financial collapse has laid bare the inadequacies of the information infrastructure supporting the US financial system. Technical challenges around large-scale data systems interact with significant economic forces involving innovation, transparency, confidentiality, complexity, and organizational change, to create a very difficult problem. The post-crisis reform legislation has created a...

    Provided By University of Maryland

  • White Papers // Jul 2006

    Design And Construction Of A Floating Living Machine

    A number of different types of ecosystems have been created for wastewater treatment including microbial reactors, algal tanks and scrubbers and constructed wetlands. Treatment is performed by these ecosystems through physical/chemical processes such as soil absorption and through metabolic processes such as denitrification. A set of constructed ecosystems that is...

    Provided By University of Maryland

  • White Papers // Mar 2007

    The Negotiation And Design Of Strategic Access Agreements

    Since the time of the ancient Greeks and Romans, powerful political actors have pursued access to strategic foreign and overseas territory primarily through the use of military force and the imposition of colonial rule.1 However, the end of World War II in 1945 and the onset of a new wave...

    Provided By University of Maryland

  • White Papers // Jan 2011

    KeyChains: A Decentralized Public-Key Infrastructure

    A Certification Authority (CA) can be used to certify keys and build a Public-Key Infrastructure (PKI) when all users trust the same CA. A decentralized PKI trades off absolute assurance on keys for independence from central control and improved scalability and robustness. The PGP "Web of trust" model has been...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Indexing Cached Multidimensional Objects in Large Main Memory Systems

    Semantic caches allow queries into large datasets to leverage cached results either directly or through transformations, using semantic information about the data objects in the cache. As the price of main memory continues to drop and its size increases, the size of semantic caches grows proportionately, and it is becoming...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Using Content-Addressable Networks for Load Balancing in Desktop Grids

    Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently matching incoming jobs to available system resources and achieving good load balance in a fully decentralized and heterogeneous computing environment is a challenging problem. In this paper, the authors...

    Provided By University of Maryland

  • White Papers // Jun 2009

    Evaluating Interaction Patterns in Configurable Software Systems

    Many modern software systems are designed to be highly configurable, which makes testing them a challenge. One popular approach is combinatorial configuration testing, which, given an interaction strength t, computes a set of configurations to test such that all t-way combinations of option settings appear at least once. Basically, this...

    Provided By University of Maryland

  • White Papers // Sep 2009

    Compressing Kinetic Data From Sensor Networks

    The authors introduce a framework for storing and processing kinetic data observed by sensor networks. These sensor networks generate vast quantities of data, which motivates a significant need for data compression. They are given a set of sensors, each of which continuously monitors some region of space. They are interested...

    Provided By University of Maryland

  • White Papers // Dec 2009

    Using Symbolic Evaluation to Understand Behavior in Configurable Software Systems

    Many modern software systems are designed to be highly configurable, which increases flexibility but can make programs hard to test, analyze, and understand. The authors present an initial empirical study of how configuration options affect program behavior. They conjecture that, at certain levels of abstraction, configuration spaces are far smaller...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Using Data for Systemic Financial Risk Management

    The recent financial collapse has laid bare the inadequacies of the information infrastructure supporting the US financial system. Technical challenges around large-scale data systems interact with significant economic forces involving innovation, transparency, confidentiality, complexity, and organizational change, to create a very difficult problem. The post-crisis reform legislation has created a...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Network-Aware Join Processing in Global-Scale Database Federations

    The authors introduce join scheduling algorithms that employ a balanced network utilization metric to optimize the use of all network paths in a global-scale database federation. This metric allows algorithms to exploit excess capacity in the network, while avoiding narrow, long-haul paths. They give a two-approximate, polynomial-time algorithm for serial...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Studying the Characteristics of a "Good" GUI Test Suite

    The widespread deployment of Graphical-User Interfaces (GUIs) has increased the overall complexity of testing. A GUI test designer needs to perform the daunting task of adequately testing the GUI, which typically has very large input interaction spaces, while considering tradeoffs between GUI test suite characteristics such as the number of...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Bounds on the Efficiency of Generic Cryptographic Constructions

    A central focus of modern cryptography is the construction of efficient, "High-level" cryptographic tools (e.g., encryption schemes) from weaker, "Low-level" cryptographic primitives (e.g., one-way functions). Of interest are both the existence of such constructions, and their efficiency. Here, the authors show essentially-tight lower bounds on the best possible efficiency of...

    Provided By University of Maryland

  • White Papers // Jun 2011

    Universally Composable Synchronous Computation

    In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronous world: i.e., they can simultaneously achieve input completeness (all honest parties' inputs are included in the computation) and guaranteed termination (honest parties do not "Hang" indefinitely). In practice, truly synchronous networks rarely exist, but synchrony...

    Provided By University of Maryland

  • White Papers // Mar 2011

    Image Ranking and Retrieval Based on Multi-Attribute Queries

    The authors propose a novel approach for ranking and retrieval of images based on multi-attribute queries. Existing image retrieval methods train separate classifiers for each word and heuristically combine their outputs for retrieving multiword queries. Moreover, these approaches also ignore the interdependencies among the query terms. In contrast, they propose...

    Provided By University of Maryland

  • White Papers // Jun 2011

    History-Free Sequential Aggregate Signatures

    Aggregation schemes allows to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion of unforgeability is preserved. Recently, Eikemeier et al. (SCN 2010) considered the notion of history-free sequential aggregation for message authentication codes, where the sequentially-executed aggregation algorithm...

    Provided By University of Maryland

  • White Papers // Apr 2010

    On Computing Compression Trees for Data Collection in Wireless Sensor Networks

    The authors address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and understanding how close they can get to the known theoretical lower bounds. The proposed approach is based on finding an optimal or a near-optimal...

    Provided By University of Maryland

  • White Papers // May 2009

    Private Virtual Infrastructure for Cloud Computing

    Cloud computing places an organization's sensitive data in the control of a third party, introducing a significant level of risk on the privacy and security of the data. The authors propose a new management and security model for cloud computing called the Private Virtual Infrastructure (PVI) that shares the responsibility...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Characterizing the IEEE 802.11 Traffic: The Wireless Side

    Many studies on measurement and characterization of wireless LANs have been performed recently. Most of these measurements have been conducted from the wired portion of the network based on wired monitoring or SNMP statistics. In this paper, the authors argue that traffic measurements from a wireless vantage point in the...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Privacy-Preserving Inter-Database Operations

    The authors present protocols for distributed computation of relational intersections and equi-joins such that each site gains no information about the tuples at the other sites that do not intersect or join with its own tuples. Such protocols form the building blocks of distributed information systems that manage sensitive information,...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Energy-Efficient Reliable Paths for On-Demand Routing Protocols

    The authors define techniques to compute energy efficient reliable paths within the framework of on-demand routing protocols. Computation of minimum energy reliable paths for proactive protocols can be performed by simply using the appropriate cost metric in distributed route computation. No additional changes to the protocols are needed. In this...

    Provided By University of Maryland

  • White Papers // Apr 2011

    Virtual MeshTest - Improving Wireless Network Testbed Using Virtualization and Migration Algorithm

    There are several laboratory-based mobile wireless testbeds such as the MeshTest and the CMU wireless emulator. These testbeds provide powerful computing network platforms for users who want to perform controlled, repeatable, mobile experiments in the lab. However, such systems can only use 10-15 nodes in an experiment. The Virtual Mesh...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Coinonia: Privacy-Aware Meeting Scheduler Based on Location-Based Services for Mobile Users

    The location based service has been attracted more and more in recent years with the advance of wireless communication technologies. Some mobile applications are designed to provide users with their current location information shared by a group of people where a user might be reluctant to reveal the private information....

    Provided By University of Maryland

  • White Papers // May 2009

    Improving Graph Drawing Readability by Incorporating Readability Metrics: A Software Tool for Network Analysts

    Designing graph drawings that effectively communicate the underlying network is challenging as for every network there are many potential unintelligible or even misleading drawings. Automated graph layout algorithms have helped, but frequently generate ineffective drawings. In order to build awareness of effective graph drawing strategies, the authors detail readability metrics...

    Provided By University of Maryland

  • White Papers // May 2011

    LeechLock: Preventing Selfish Clients in the BitTorrent Protocol

    Although the BitTorrent protocol incentivizes sharing by increasing a peer's download rate, tools have demonstrated that the tit-for-tat mechanism alone is insufficient to prevent peers from downloading content without reciprocation. The authors propose an enhancement to the BitTorrent protocol, called Leechlock, which uses globally shared tables to track peers' ratings...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Adapting Transmission Power for Optimal Energy Reliable Multi-Hop Wireless Communication

    The authors define a transmission power adaptation-based routing technique that finds optimal paths for minimum energy reliable data transfer in multi-hop wireless networks. This optimal choice of the transmission power depends on the link distance between the two nodes and the channel characteristics. Typical energy efficient routing techniques use a...

    Provided By University of Maryland

  • White Papers // Mar 2010

    Improving Communications: Awareness And Management Of Perceiving Disagreement

    Interpersonal communications often fail to communicate the intended message. Language, contextual, and cultural differences between the sender and receiver of the message influence the receipt of the intended message exacerbates a lack of understanding when the message contains inexact words and phrases. The resultant message obtained by the receiver may...

    Provided By University of Maryland

  • White Papers // Jan 2010

    Your House Or Your Credit Card, Which Would You Choose? Personal Delinquency Tradeoffs And Precautionary Liquidity Motives

    This paper presents evidence that precautionary liquidity concerns lead many individuals to pay credit card bills even at the cost of mortgage delinquencies and foreclosures. While the popular press and some recent literature have suggested that this choice may emerge from steep declines in housing prices, the authors find evidence...

    Provided By University of Maryland

  • White Papers // May 2011

    Secure Multi-Party Computation of Boolean Circuits With Applications to Privacy in On-Line Marketplaces

    Protocols for generic secure Multi-Party Computation (MPC) come in two forms: they either represent the function being computed as a Boolean circuit or as an arithmetic circuit over a large field. Either type of protocol can be used for any function, but the choice of which type of protocol to...

    Provided By University of Maryland

  • White Papers // May 2011

    Round Optimal Blind Signatures

    All known round optimal (i.e., two-move) blind signature schemes either need a common reference string, rely on random oracles, or assume the hardness of some interactive assumption. At Eurocrypt 2010, Fischlin and Schr?der showed that a broad class of three-move blind signature scheme cannot be instantiated in the standard model...

    Provided By University of Maryland

  • White Papers // Mar 2010

    Informal Sector, Government Policy And Institutions

    The authors document cross-country differences in informal activity, government policies and institutions using a data set covering 118 countries. Five key facts emerge from this data set. Better institutions are associated with lower inflation, higher income tax rates and less informal activity. Related to these, they also find that higher...

    Provided By University of Maryland

  • White Papers // Oct 2009

    Integrated Lifecycle of IT Services in a Cloud Environment

    Virtualized Service models are now emerging and redefining the way information technology is delivered to end users. Current research is focused on specific pieces like service discovery, composition etc. There is no holistic view of what would constitute a lifecycle of virtualized services delivered on a cloud environment. This paper...

    Provided By University of Maryland

  • White Papers // Sep 2009

    A Pegasus Over WiFi and WiMax Demo: Connectivity at High Speeds

    This paper presents Pegasus, a system providing wireless connection roaming at high velocities over multiple interfaces. The system operates over WiMax, as well as over "In situ" WiFi networks, while at the same time offering transparency to user level applications by allowing a single IP address per user, operating in...

    Provided By University of Maryland

  • White Papers // Nov 2009

    New WiMAX Forum Lab to Develop Next-Generation Wireless Applications

    With the widespread prevalence of handheld devices like PDAs, Internet Tablets, BlackBerries, and iPhones, people increasingly want and expect to be able to browse the internet at high speed anytime, anywhere, and not just at wireless hot spots where broadband internet access is available over a few hundred feet. Ashok...

    Provided By University of Maryland

  • White Papers // Jan 2010

    Temporal Visualization of Planning Polygons for Efficient Partitioning of Geo-Spatial Data

    Partitioning of geo-spatial data for efficient allocation of resources such as schools and emergency health care services is driven by a need to provide better and more effective services. Partitioning of spatial data is a complex process that depends on numerous factors such as population, costs incurred in deploying or...

    Provided By University of Maryland

  • White Papers // May 2009

    Employees' Investment Behavior In Company Based Savings Plan

    This paper investigates the investment behavior of 44,649 employees working in a CAC 40 index listed company. The company savings plan offers its employees a choice of the various asset categories generally listed by financial institutions. The authors focus on the determinants of employee participation and of the total amount...

    Provided By University of Maryland

  • White Papers // Dec 2009

    Distributional Convergence of Inter-Meeting Times Under Generalized Hybrid Random Walk Mobility Model

    The performance of a mobile wireless network depends on the time-varying connectivity of the network as nodes move around. Hence, there has been a growing interest in the distribution of inter-meeting times between two nodes in mobile wireless networks. The authors study the distribution of inter-meeting times under the generalized...

    Provided By University of Maryland

  • White Papers // Apr 2010

    Network Connectivity With a Family of Group Mobility Models - A Lesson Learned

    The authors investigate the communication range of the nodes necessary for network connectivity, which they call bidirectional connectivity, in a simple setting. Unlike in most of existing studies, however, the locations or mobilities of the nodes may be correlated through group mobility: nodes are broken into groups, with each group...

    Provided By University of Maryland

  • White Papers // Dec 2010

    Dynamic Spectrum Trading Market - Auction-Based Approach to Spectrum Allocation and Profit Sharing

    Recently, dynamic spectrum sharing has been gaining interest as a potential solution to scarcity of available spectrum. The authors study the problem of designing a secondary spectrum trading market when there are multiple sellers and multiple buyers. First, they introduce a new optimal auction mechanism, called the Generalized Branco's Mechanism...

    Provided By University of Maryland

  • White Papers // Aug 2009

    Performance Analysis of Epidemic With Immunity Routing for Disruption Tolerant Networks

    The authors propose a new message routing mechanism based on the concept of immunity for Disruption Tolerant Networks (DTNs). The new mechanism allows more efficient utilization of limited buffer space at the nodes, by removing redundant copies of messages that have already been delivered. They first develop a new mathematical...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Distribution of Path Durations in Mobile Ad-Hoc Networks and Path Selection

    The authors investigate the issue of path selection in multi-hop wireless networks with the goal of identifying a scheme that can select a path with the largest expected duration. To this end they first study the distribution of path duration. They show that, under a set of mild conditions, when...

    Provided By University of Maryland