University of New Mexico

Displaying 41-67 of 67 results

  • White Papers // Jan 2010

    Putting Trojans on the Horns of a Dilemma: Redundancy for Information Theft Detection

    Conventional approaches to either information flow security or intrusion detection are not suited to detecting Trojans that steal information such as credit card numbers using advanced cryptovirological and inference channel techniques. The authors propose a technique based on repeated deterministic replays in a virtual machine to detect the theft of...

    Provided By University of New Mexico

  • White Papers // Jan 2010

    Wi-Fi Community Area Networks Enable a Connected Community

    The authors propose a Community Area Network (CAN), which is an all-wireless network connecting a community or a metropolitan area. This is a multi-hop network consisting of many Wi-Fi supernodes, each of them serving a number of resident homes and/or mobile users. Users in the covered area are able to...

    Provided By University of New Mexico

  • White Papers // Jan 2010

    Design, Implementation, and Performance of MPI on Portals 3.0

    This paper describes an implementation of the Message Passing Interface (MPI) on the Portals 3.0 data movement layer. Portals 3.0 provide low-level building blocks that are flexible enough to support higher-level message passing layers such as MPI very efficiently. Portals 3.0 is also designed to allow for programmable network interface...

    Provided By University of New Mexico

  • White Papers // Dec 2009

    Term Rewriting With Built-In Numbers and Collection Data Structures

    Term rewrite systems have been extensively used in order to model computer programs for the purpose of formal verification. This is in particular true if the termination behavior of computer programs is investigated, and automatic termination proving for term rewrite systems has received increased interest in recent years. Ordinary term...

    Provided By University of New Mexico

  • White Papers // Nov 2009

    Trade-Off Between Mobile Node Density and the Detection Performance in Mobility-Assisted Sensor Networks

    In this paper, stationary target detection in a hybrid sensor network consisting of both static and mobile nodes is considered with random node mobility models. Static nodes and mobile nodes (initially) are assumed to be deployed independently and randomly in the sensing field. Mobile nodes are exploited to compensate for...

    Provided By University of New Mexico

  • White Papers // Sep 2009

    Throughput Optimization and Traffic Engineering in WDM Networks Considering Multiple Metrics

    In this paper, the authors present a multi-objective Integer Linear Program (ILP) for the joint throughput optimization and traffic engineering problem in Wavelength-Division Multiplexing (WDM) networks. The proposed model simultaneously maximizes the aggregated throughput, minimizes the resource consumption, and achieves load balancing by minimizing the Maximum Link Utilization (MLU). Even...

    Provided By University of New Mexico

  • White Papers // Sep 2009

    Minimum Length Scheduling in Single-Hop Multiple Access Wireless Networks

    In this paper, the authors address the minimum length scheduling problem in wireless networks, where each transmitter has a finite amount of data to deliver to a common receiver node (e.g., base station). In contrast with previous works that model wireless channels according to the Protocol or Physical model of...

    Provided By University of New Mexico

  • White Papers // Aug 2009

    Fusion and Diversity Trade-Offs in Cooperative Estimation Over Fading Channels

    In this paper, the authors consider a network of distributed sensors that are trying to measure a parameter of interest cooperatively, by exchanging their acquired information repeatedly over fading channels. They consider different ways of using the available bandwidth, in terms of what each node can send to its neighbors....

    Provided By University of New Mexico

  • White Papers // Aug 2009

    Characterization and Modeling of Wireless Channels for Networked Robotic and Control Systems - A Comprehensive Overview

    The goal of this paper is to serve as a reference for researchers in robotics and control that are interested in realistic modeling, theoretical analysis and simulation of wireless links. To realize the full potentials of networked robotic systems, an integration of communication issues with motion planning/control is necessary. While...

    Provided By University of New Mexico

  • White Papers // Aug 2009

    Sequential Estimation Over Noisy Channels With Distributed Node Selection

    In an autonomous sensor network without a central fusion center, it is desired that any node has the ability to make the final decision once it has enough information about the Phenomenon of Interest (PoI) within a certain confidence level. In this paper, the authors propose a distributed sequential methodology...

    Provided By University of New Mexico

  • White Papers // May 2009

    An Immune System Inspired Approach to Automated Program Verification

    An immune system inspired Artificial Immune System (AIS) algorithm is presented, and is used for the purposes of automated program verification. Relevant immunological concepts are discussed and the field of AIS is briefly reviewed. It is proposed to use this AIS algorithm for a specific automated program verification task: That...

    Provided By University of New Mexico

  • White Papers // May 2009

    Dependency Pairs for Rewriting With Built-in Numbers and Semantic Data Structures

    This paper defines an expressive class of constrained equational rewrite systems that supports the use of semantic data structures (e.g., sets or multisets) and contains built-in numbers, thus extending the previous work presented at CADE 2007. These rewrite systems, which are based on normalized rewriting on constructor terms, allow the...

    Provided By University of New Mexico

  • White Papers // May 2009

    A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

    An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is transformed into rewrite rules with constraints from quantifier-free Presburger arithmetic. Any computation in the imperative program corresponds to a rewrite sequence, and termination of the rewrite...

    Provided By University of New Mexico

  • White Papers // May 2009

    Proving Termination of Integer Term Rewriting

    Recently, techniques and tools from term rewriting have been successfully applied to prove termination automatically for different programming languages. The advantage of rewrite techniques is that they are very powerful for algorithms on user-defined data structures, since they can automatically generate suitable well-founded orders comparing arbitrary forms of terms. But...

    Provided By University of New Mexico

  • White Papers // May 2009

    Compressive Cooperative Sensing and Mapping in Mobile Networks

    In this paper, the authors consider a mobile cooperative network that is tasked with building a map of the spatial variations of a parameter of interest, such as an obstacle map or an aerial map. They propose a new framework that allows the nodes to build a map of the...

    Provided By University of New Mexico

  • White Papers // Apr 2009

    Distributed Grooming in Multi-Domain IP/MPLS-DWDM Networks

    This paper studies distributed multi-domain, multilayer provisioning (grooming) in IP/MPLS-DWDM networks. Although many multi-domain studies have emerged over the years, these have primarily considered "Homogeneous" network layers. Meanwhile, most grooming studies have assumed idealized settings with "Global" link state across all layers. Hence there is a critical need to develop...

    Provided By University of New Mexico

  • White Papers // Mar 2009

    Task Reallocation for Maximal Reliability in Distributed Computing Systems With Uncertain Topologies and Non-Markovian Delays

    The ability to model and optimize reliability is central in designing survivable Distributed Computing Systems (DCSs) where servers are prone to fail permanently. In this paper the service reliability of a DCS in uncertain topologies is analytically characterized by using a novel regeneration-based probabilistic analysis. The analysis takes into account...

    Provided By University of New Mexico

  • White Papers // Mar 2009

    Using Execution Paths to Evolve Software Patches

    The authors present an evolutionary approach using Genetic Programming (GP) to automatically create software repairs. By concentrating the modifications on regions related to where the bug occurs, they effectively minimize the search space complexity and hence increase the performance of the GP process. To preserve the core functionalities of the...

    Provided By University of New Mexico

  • White Papers // Mar 2009

    Distributed Load Balancing Over Directed Network Topologies

    In this paper the authors consider the problem of distributed load balancing over a directed graph that is not fully connected. They study the impact of network topology on the stability and balance of distributed computing. They furthermore propose Informed Load Balancing (I-LB), an approach in which the nodes first...

    Provided By University of New Mexico

  • White Papers // Feb 2009

    Communication-Aware Target Tracking Using Navigation Functions - Centralized Case

    In this paper, the authors consider a team of robots that are tasked with tracking a moving target cooperatively, while maintaining their connectivity to a base station and avoiding collision. They propose a novel extension of the classical navigation function framework in order to ensure task completion. More specifically, they...

    Provided By University of New Mexico

  • White Papers // Feb 2009

    The Forgiving Graph: A Distributed Data Structure for Low Stretch Under Adversarial Attack

    The authors consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. They assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such...

    Provided By University of New Mexico

  • White Papers // Feb 2009

    Automatically Finding Patches Using Genetic Programming

    Automatic repair of programs has been a longstanding goal in software engineering, yet debugging remains a largely manual process. The authors introduce a fully automated method for locating and repairing bugs in software. The approach works on off-the-shelf legacy applications and does not require formal specifications, program annotations or special...

    Provided By University of New Mexico

  • White Papers // Feb 2009

    Termination of Context-Sensitive Rewriting With Built-In Numbers and Collection Data Structures

    Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it can be used to model lazy evaluation in functional languages such as Haskell. Building upon the previous work on an expressive and elegant class of rewrite...

    Provided By University of New Mexico

  • White Papers // Dec 2008

    A Novel Primary-Secondary User Power Control Game for Cognitive Radios

    In cognitive radio networks, secondary users need to access the licensed spectrum while neither disturbing the transmissions of the primary users nor introducing much interference to other secondary users. Hence, proper power controlling is of paramount importance to ensure efficient system operation. The previous work on power control in cognitive...

    Provided By University of New Mexico

  • White Papers // Oct 2008

    Valuation Of The Embedded Option In A Non-Cancelable Lease: Theory And Application

    This paper applies a "Real" option literature based model to valuing the option element of a non-cancelable lease without an early exercise provision. The model is applied to a common lease type - the closed-end automobile lease. The findings show that the value of the option inherent in an automobile...

    Provided By University of New Mexico

  • White Papers // Oct 2008

    SMOCK: A Scalable Method of Cryptographic Key Management for Mission-Critical Wireless Ad Hoc Networks

    Mission-critical networks show great potential in emergency response and/or recovery, health care, critical infrastructure monitoring, etc. Such mission-critical applications demand security service be "Anywhere", "Anytime" and "Anyhow". However, it is challenging to design a key management scheme in current mission-critical networks to fulfill the required attributes of secure communications, such...

    Provided By University of New Mexico

  • White Papers // Sep 2008

    Binary Consensus With Soft Information Processing in Cooperative Networks

    In this paper, the authors consider reaching binary consensus over a network with AWGN channels. They consider the case where knowledge of the corresponding link qualities is available at every receiving node. They propose novel soft information processing approaches to improve the performance in the presence of noisy links. They...

    Provided By University of New Mexico

  • White Papers // Feb 2011

    Optimal Myopic Sensing and Dynamic Spectrum Access in Centralized Secondary Cognitive Radio Networks With Low-Complexity Implementations

    Cognitive Radio (CR) techniques allow unlicensed Secondary Users (SUs) to opportunistically access underutilized primary channels that are licensed to Primary Users (PUs). The authors consider a multi-primary channel scenario in which the SUs cooperatively try to find these primary channel spectrum holes by limited spectrum sensing. The objective is to...

    Provided By University of New Mexico

  • White Papers // Feb 2011

    Optimal and Low-Complexity Algorithms for Dynamic Spectrum Access in Centralized Cognitive Radio Networks With Fading Channels

    In this paper, the authors develop a centralized spectrum sensing and Dynamic Spectrum Access (DSA) scheme for Secondary Users (SUs) in a Cognitive Radio (CR) network. Assuming that the primary channel occupancy follows a Markovian evolution, the channel sensing problem is modeled as a Partially Observable Markov Decision Process (POMDP)....

    Provided By University of New Mexico

  • White Papers // Aug 2010

    Kalman Filtering overWireless Fading Channels

    In this paper, the authors consider the estimation of a dynamical system over a wireless fading channel using a Kalman filter. They develop a framework for understanding the impact of stochastic communication noise, packet drop and the knowledge available on the link qualities on Kalman filtering over fading channels. They...

    Provided By University of New Mexico

  • White Papers // Oct 2011

    On the Spatial Predictability of Communication Channels

    In this paper, the authors are interested in fundamentally understanding the spatial predictability of wireless channels. They propose a probabilistic channel prediction framework for predicting the spatial variations of a wireless channel, based on a small number of measurements. By using this framework, they then develop a mathematical foundation for...

    Provided By University of New Mexico

  • White Papers // Aug 2011

    Binary Consensus for Cooperative Spectrum Sensing in Cognitive Radio Networks

    In this paper, the authors propose to use binary consensus algorithms for distributed cooperative spectrum sensing in cognitive radio networks. They propose to use two binary approaches, namely diversity and fusion binary consensus spectrum sensing. The performance of these algorithms is analyzed over fading channels. The probability of networked detection...

    Provided By University of New Mexico

  • White Papers // Apr 2011

    Communication-Aware Surveillance in Mobile Sensor Networks

    In this paper, the authors consider a surveillance problem, where a number of mobile nodes are tasked with surveying an area for the possible presence of stationary targets and reporting their findings back to a fixed base station, in the presence of realistic fading communication channels. They develop a mathematical...

    Provided By University of New Mexico

  • White Papers // Aug 2010

    Compressive Cooperative Obstacle Mapping in Mobile Networks

    In this paper, the authors consider a mobile cooperative network that is tasked with building an obstacle map in an environment. They propose a framework that allows the robots to build the obstacle map non-invasively and with a small number of wireless channel measurements. By extending their previous work on...

    Provided By University of New Mexico

  • White Papers // Aug 2009

    Fusion and Diversity Trade-Offs in Cooperative Estimation Over Fading Channels

    In this paper, the authors consider a network of distributed sensors that are trying to measure a parameter of interest cooperatively, by exchanging their acquired information repeatedly over fading channels. They consider different ways of using the available bandwidth, in terms of what each node can send to its neighbors....

    Provided By University of New Mexico

  • White Papers // Aug 2009

    Characterization and Modeling of Wireless Channels for Networked Robotic and Control Systems - A Comprehensive Overview

    The goal of this paper is to serve as a reference for researchers in robotics and control that are interested in realistic modeling, theoretical analysis and simulation of wireless links. To realize the full potentials of networked robotic systems, an integration of communication issues with motion planning/control is necessary. While...

    Provided By University of New Mexico

  • White Papers // Oct 2008

    SMOCK: A Scalable Method of Cryptographic Key Management for Mission-Critical Wireless Ad Hoc Networks

    Mission-critical networks show great potential in emergency response and/or recovery, health care, critical infrastructure monitoring, etc. Such mission-critical applications demand security service be "Anywhere", "Anytime" and "Anyhow". However, it is challenging to design a key management scheme in current mission-critical networks to fulfill the required attributes of secure communications, such...

    Provided By University of New Mexico

  • White Papers // Apr 2009

    Distributed Grooming in Multi-Domain IP/MPLS-DWDM Networks

    This paper studies distributed multi-domain, multilayer provisioning (grooming) in IP/MPLS-DWDM networks. Although many multi-domain studies have emerged over the years, these have primarily considered "Homogeneous" network layers. Meanwhile, most grooming studies have assumed idealized settings with "Global" link state across all layers. Hence there is a critical need to develop...

    Provided By University of New Mexico

  • White Papers // Jan 2010

    Wi-Fi Community Area Networks Enable a Connected Community

    The authors propose a Community Area Network (CAN), which is an all-wireless network connecting a community or a metropolitan area. This is a multi-hop network consisting of many Wi-Fi supernodes, each of them serving a number of resident homes and/or mobile users. Users in the covered area are able to...

    Provided By University of New Mexico

  • White Papers // Jan 2010

    Design, Implementation, and Performance of MPI on Portals 3.0

    This paper describes an implementation of the Message Passing Interface (MPI) on the Portals 3.0 data movement layer. Portals 3.0 provide low-level building blocks that are flexible enough to support higher-level message passing layers such as MPI very efficiently. Portals 3.0 is also designed to allow for programmable network interface...

    Provided By University of New Mexico

  • White Papers // Oct 2008

    Valuation Of The Embedded Option In A Non-Cancelable Lease: Theory And Application

    This paper applies a "Real" option literature based model to valuing the option element of a non-cancelable lease without an early exercise provision. The model is applied to a common lease type - the closed-end automobile lease. The findings show that the value of the option inherent in an automobile...

    Provided By University of New Mexico

  • White Papers // Nov 2010

    Opportunities for Leveraging OS Virtualization in High-End Supercomputing

    This paper examines potential motivations for incorporating virtualization support in the system software stacks of high end capability supercomputers. This paper advocates that this will increase the exibility of these platforms significantly and enable new capabilities that are not possible with current fixed software stacks. The results indicate that compute,...

    Provided By University of New Mexico

  • White Papers // Mar 2009

    Task Reallocation for Maximal Reliability in Distributed Computing Systems With Uncertain Topologies and Non-Markovian Delays

    The ability to model and optimize reliability is central in designing survivable Distributed Computing Systems (DCSs) where servers are prone to fail permanently. In this paper the service reliability of a DCS in uncertain topologies is analytically characterized by using a novel regeneration-based probabilistic analysis. The analysis takes into account...

    Provided By University of New Mexico

  • White Papers // Mar 2009

    Distributed Load Balancing Over Directed Network Topologies

    In this paper the authors consider the problem of distributed load balancing over a directed graph that is not fully connected. They study the impact of network topology on the stability and balance of distributed computing. They furthermore propose Informed Load Balancing (I-LB), an approach in which the nodes first...

    Provided By University of New Mexico

  • White Papers // Jan 2011

    Increasing Communications Security Through Protocol Parameter Diversity

    Pulsing attacks use carefully synchronized high-rate low-duration bursts of traffic that are injected into a network to induce denial-of-service. These attacks are effective because the bursts force protocols into low-performance states. The synchronization relies on the fact that most computers run protocols with identical parameter values. The use of diverse...

    Provided By University of New Mexico

  • White Papers // Jan 2010

    Putting Trojans on the Horns of a Dilemma: Redundancy for Information Theft Detection

    Conventional approaches to either information flow security or intrusion detection are not suited to detecting Trojans that steal information such as credit card numbers using advanced cryptovirological and inference channel techniques. The authors propose a technique based on repeated deterministic replays in a virtual machine to detect the theft of...

    Provided By University of New Mexico

  • White Papers // May 2009

    Compressive Cooperative Sensing and Mapping in Mobile Networks

    In this paper, the authors consider a mobile cooperative network that is tasked with building a map of the spatial variations of a parameter of interest, such as an obstacle map or an aerial map. They propose a new framework that allows the nodes to build a map of the...

    Provided By University of New Mexico

  • White Papers // Feb 2009

    Communication-Aware Target Tracking Using Navigation Functions - Centralized Case

    In this paper, the authors consider a team of robots that are tasked with tracking a moving target cooperatively, while maintaining their connectivity to a base station and avoiding collision. They propose a novel extension of the classical navigation function framework in order to ensure task completion. More specifically, they...

    Provided By University of New Mexico

  • White Papers // Sep 2008

    Binary Consensus With Soft Information Processing in Cooperative Networks

    In this paper, the authors consider reaching binary consensus over a network with AWGN channels. They consider the case where knowledge of the corresponding link qualities is available at every receiving node. They propose novel soft information processing approaches to improve the performance in the presence of noisy links. They...

    Provided By University of New Mexico

  • White Papers // Jan 2011

    To Drop or Not to Drop: Receiver Design Principles for Estimation Over Wireless Links

    In this paper, the authors consider estimation of a multiple-input multiple-output dynamical system over a wireless fading communication channel using a Kalman filter. They are interested in finding the optimum receiver design in terms of handing noisy samples. They reformulate the estimation problem to include the impact of stochastic communication...

    Provided By University of New Mexico

  • White Papers // Aug 2009

    Sequential Estimation Over Noisy Channels With Distributed Node Selection

    In an autonomous sensor network without a central fusion center, it is desired that any node has the ability to make the final decision once it has enough information about the Phenomenon of Interest (PoI) within a certain confidence level. In this paper, the authors propose a distributed sequential methodology...

    Provided By University of New Mexico

  • White Papers // Nov 2009

    Trade-Off Between Mobile Node Density and the Detection Performance in Mobility-Assisted Sensor Networks

    In this paper, stationary target detection in a hybrid sensor network consisting of both static and mobile nodes is considered with random node mobility models. Static nodes and mobile nodes (initially) are assumed to be deployed independently and randomly in the sensing field. Mobile nodes are exploited to compensate for...

    Provided By University of New Mexico

  • White Papers // Feb 2010

    Mobility Assisted Distributed Tracking in Hybrid Sensor Networks

    In this paper, the authors propose a new Mobility Assisted Tracking (MAT) algorithm for tracking a single target in a hybrid sensor network consisting of both static and mobile nodes. The network is assumed to be partitioned into clusters and cluster heads are formed from a set of high capacity...

    Provided By University of New Mexico

  • White Papers // Feb 2011

    A Cooperative Game Theoretic Solution for Lifetime Maximization of WSNs in Sequential Estimation

    In this paper, the problem of sequential estimation and lifetime maximization of a Wireless Sensor Network (WSN) is formulated in a cooperative game theoretic framework. This framework allows addressing problems of fair resource allocation for sequential estimation at the Fusion Center (FC) of a wireless sensor network as a solution...

    Provided By University of New Mexico