University of Rochester

Displaying 1-40 of 70 results

  • White Papers // May 2014

    Correlating Power Consumption and Network Traffic for Improving Data Centers Resiliency

    The deployment of business critical applications and information infrastructures are moving to the cloud. This means they are hosted in large scale data centers with other business applications and infrastructures with less (or none) mission critical constraints. This mixed and complex environment makes very challenging the process of monitoring critical...

    Provided By University of Rochester

  • White Papers // Dec 2013

    Revision and Enhancement of Two Three Party Key Agreement Protocols Vulnerable to KCI Attacks

    The authors have shown that the three party key agreement protocols recently published in the literature by the researchers are not resilient to KCI attacks although their authors claim the contrary. Designing secure key agreement protocols is far from being a simple task, such protocols involve so many details and...

    Provided By University of Rochester

  • White Papers // Dec 2013

    On the Security Of Wang's Provably Secure Identity-Based Key Agreement Protocol

    In a 2005 IACR report, Wang published an efficient IDentity-based key Agreement Protocol (IDAK) suitable for resource constrained devices. The author shows that the IDAK key agreement protocol is secure in the Bellare-Rogaway model with random oracles and also provides separate ad-hoc security proofs claiming that the IDAK protocol is...

    Provided By University of Rochester

  • White Papers // Dec 2013

    Proofs of Space: When Space is of the Essence

    Proofs of computational effort were devised to control denial of service attacks. Dwork and naor (CRYPTO '92), for example, proposed to use such proofs to discourage spam. The idea is to couple each email message with a proof of work that demonstrates the sender performed some computational task. A proof...

    Provided By University of Rochester

  • White Papers // Nov 2013

    Mobile Offloading in the Wild: Findings and Lessons Learned Through a Real-life Experiment with a New Cloud-aware System

    Mobile-cloud offloading mechanisms delegate heavy mobile computation to the cloud. In real life use, the energy trade-off of computing the task locally or sending the input data and the code of the task to the cloud is often negative, especially with popular communication intensive jobs like social networking, gaming, and...

    Provided By University of Rochester

  • White Papers // Nov 2013

    Automatic Generation of Failure Scenarios for SoC

    As process technology downscales, testing difficulties and susceptibility of circuits to random hardware faults arise. This trend, combined with increasing complexity of functions to be performed by Systems-on-Chip, poses crucial concerns when system engineers have to quantify the dependability achieved by their SoC design. In this paper, the authors propose...

    Provided By University of Rochester

  • White Papers // Sep 2013

    Securitizing Area Insurance: A Risk Management Approach

    In this paper, the author examines the possibility of developing a risk management instrument by designing a financial security whose value is linked to the average revenue of a given area. This type of program is sufficiently general to be considered for any group of businesses that face production uncertainty....

    Provided By University of Rochester

  • White Papers // Jan 2013

    CloneDoc: Exploiting the Cloud to Leverage Secure Group Collaboration Mechanisms for Smartphones

    The limited battery of Smartphones makes it hard for users to fully exploit their devices. Recent research considers offloading mobile computation to the cloud to improve efficiency and to extend battery life. The authors design Clone2Clone (C2C), a distributed P2P platform for software cloud clones of Smartphones. Upon C2C they...

    Provided By University of Rochester

  • White Papers // Jan 2013

    Towards Symmetric Multi-Threaded Optimistic Simulation Kernels

    In this paper, the authors address the reshuffle of the design of optimistic simulation kernels in order to t multi-core/multiprocessor machines. This is done by providing a reference optimistic simulation architecture based on the symmetric multithreaded paradigm, where each simulation kernel instance is allowed to run a dynamically changing set...

    Provided By University of Rochester

  • White Papers // Dec 2012

    Multi-Threaded Simulation of 4G Cellular Systems within the LTE-Sim Framework

    Now-a-days, an always increasing number of researchers and industries are putting a large effort in the design and the implementation of protocols, algorithms, and network architectures targeted at the emerging 4G cellular technology. In this context, multi-core/multi-processor simulation tools can accelerate their activities by drastically reducing the time required to...

    Provided By University of Rochester

  • White Papers // Dec 2012

    Load Sharing for Optimistic Parallel Simulations on Multi?Core Machines

    Parallel Discrete Event Simulation (PDES) is based on the partitioning of the simulation model into distinct Logical Processes (LPs), each one modeling a portion of the entire system, which are allowed to execute simulation events concurrently. This allows exploiting parallel computing architectures to speedup model execution, and to make very...

    Provided By University of Rochester

  • White Papers // Nov 2012

    Route Discovery and Caching: A Way to Improve the Scalability of Information-Centric Networking

    Information Centric Networking (ICN) is a new paradigm in which the network layer provides users with content, instead of providing communication channels between hosts, and is aware of the name (or identifiers) of the contents. In this paper, the authors first describe what, they believe, are the main advantages and...

    Provided By University of Rochester

  • White Papers // Sep 2012

    Interleaving Command Sequences: a Threat to Secure Smartcard Interoperability

    The increasingly widespread use of smartcards for a variety of sensitive applications, including digital signatures, creates the need to ensure and possibly certify the secure interoperability of these devices. Standard certification criteria, in particular the Common Criteria, define security requirements but do not sufficiently address the problem of interoperability. Here,...

    Provided By University of Rochester

  • White Papers // Aug 2012

    A Load-Sharing Architecture for High Performance Optimistic Simulations on Multi-Core Machines

    In Parallel Discrete Event Simulation (PDES), the simulation model is partitioned into a set of distinct Logical Processes (LPs) which are allowed to concurrently execute simulation events. In this paper, the authors present an innovative approach to load-sharing on multi-core/multiprocessor machines, targeted at the optimistic PDES paradigm, where LPs are...

    Provided By University of Rochester

  • White Papers // Jul 2012

    CloudShield: Efficient Anti-Malware Smartphone Patching With a P2P Network on the Cloud

    The battery limits of today Smartphones require a solution. In the scientific community it is believed that a promising way of prolonging battery life is to offload mobile computation to the cloud. State of the art offloading architectures consists of virtual copies of real Smartphones (the clones) that run on...

    Provided By University of Rochester

  • White Papers // Jun 2012

    Assessing Load Sharing with in Optimistic Simulation Platforms

    The advent of multi-core machines has lead to the need for revising the architecture of modern simulation platforms. Specifically, recent proposals attempted to explore the viability of load-sharing for optimistic simulators run on top of these types of machines. In this paper, the authors provide an extensive experimental study for...

    Provided By University of Rochester

  • White Papers // May 2012

    Transparent and Efficient Shared-State Management for Optimistic Simulations on Multi-Core Machines

    Traditionally, Logical Processes (LPs) forming a simulation model store their execution information into disjoint simulations states, forcing events exchange to communicate data between each other. In this paper, the authors propose the design and implementation of an extension to the traditional Time Warp (optimistic) synchronization protocol for parallel/distributed simulation, targeted...

    Provided By University of Rochester

  • White Papers // May 2012

    A Modular, Flexible and Virtualizable Framework for IEEE 802.11

    Wireless networks are extensively deployed due to their low cost and configuration easiness. However, they are not adapted to the new services and applications that are increasingly demanded by users. Current implementation of the IEEE 802.11 specification is supported in hardware devices and software developments, but they do not provide...

    Provided By University of Rochester

  • White Papers // May 2012

    BaNa: A Hybrid Approach for Noise Resilient Pitch Detection

    Pitch is one of the essential features in many speech related applications. Although numerous pitch detection algorithms have been developed, as shown in this paper, the detection ratio in noisy environments still needs improvement. In this paper, the authors present a hybrid noise resilient pitch detection algorithm named BaNa that...

    Provided By University of Rochester

  • White Papers // May 2012

    Traffic-aware Design of a High Speed FPGA Network Intrusion Detection System

    Security of today's networks heavily relies on Network Intrusion Detection Systems (NIDSs). The ability to promptly update the supported rule sets and detect new emerging attacks makes Field Programmable Gate Arrays (FPGAs) a very appealing technology. An important issue is how to scale FPGA-based NIDS implementations to ever faster network...

    Provided By University of Rochester

  • White Papers // Jan 2012

    FIOS: A Fair, Efficient Flash I/O Scheduler

    Flash-based Solid-State Drives (SSDs) have the potential to eliminate the I/O bottlenecks in data-intensive applications. However, the large performance discrepancy between Flash reads and writes introduces challenges for fair resource usage. Further, existing fair queueing and quanta-based I/O schedulers poorly manage the I/O anticipation for Flash I/O fairness and efficiency....

    Provided By University of Rochester

  • White Papers // Jan 2012

    Random Walk Based Node Sampling in Self-Organizing Networks

    Random walk is a means of network node sampling that requires little index maintenance and can function on almost all connected network topologies. With careful guidance, node samples following a desired probability distribution can be generated with the only requirement that the sampling probabilities of each visited node and its...

    Provided By University of Rochester

  • White Papers // Nov 2011

    Power and Energy Containers for Multicore Servers

    Energy efficiency and power capping remain growing concerns in server systems. Online applications continue to evolve with new features and dynamic client-directed processing, resulting in varying power profiles. New computing platforms with multicore resource sharing and heterogeneity further obfuscate the system behaviors, presenting challenges for request/client-based energy accounting, identification and...

    Provided By University of Rochester

  • White Papers // Nov 2011

    Algorithmic Programming Language Identification

    Motivated by the amount of code that goes unidentified on the web, the authors introduce a practical method for algorithmically identifying the programming language of source code. Their work is based on supervised learning and intelligent statistical features. They also explored, but abandoned, a grammatical approach. In testing, their implementation...

    Provided By University of Rochester

  • White Papers // Jul 2011

    Sleeping Multipath Routing: A Trade-Off Between Reliability and Lifetime in Wireless Sensor Networks

    In wireless sensor networks, multi-path routing is used to alleviate reliability degradation due to multi-hop transmissions over error-prone wireless channels. However, multi-path routing is not energy-efficient, as it requires all the nodes in the network to always be awake. To prolong the network lifetime while maintaining a certain reliability performance,...

    Provided By University of Rochester

  • White Papers // May 2011

    Personal Marks and Community Certificates: Detecting Clones in Mobile Wireless Networks of Smart-Phones

    The authors consider the problem of detecting clones in wireless mobile ad hoc networks. They assume that one of the devices of the network has been cloned. Everything, including certificates and secret keys. This can happen quite easily, because of a virus that immediately after sending all the content of...

    Provided By University of Rochester

  • White Papers // Mar 2011

    Modeling and Performance Analysis for Duty-Cycled MAC Protocols With Applications to S-MAC and X-MAC

    Wireless sensor networks are often battery-powered, and hence extending the network lifetime is one of the primary concerns in the ubiquitous deployment of wireless sensor networks. One approach to efficiently utilize the limited energy supplies of the sensors is to have the Medium Access Control (MAC) protocol duty-cycle the sensors,...

    Provided By University of Rochester

  • White Papers // Jan 2011

    Energy-Efficient Duty Cycle Assignment for Receiver-Based Convergecast in Wireless Sensor Networks

    Duty cycling is often used to reduce the energy consumption caused by idle listening in Wireless Sensor Networks (WSNs). Most studies on WSN protocols define a common duty cycle value throughout the network to achieve synchronization among the nodes. On the other hand, a few studies propose adaptation of the...

    Provided By University of Rochester

  • White Papers // Jan 2011

    Popularity-Biased Random Walks for Peer-to-Peer Search Under the Square-Root Principle

    The square-root principle is known to achieve low search time for peer-to-peer search techniques that do not utilize query routing indices (e.g., query flooding or random walk searches). Under this principle, each object is probed with probability proportional to the square root of its query popularity. Existing search methods realize...

    Provided By University of Rochester

  • White Papers // Jan 2011

    Searching Strategies for Target Discovery in Wireless Networks

    Information dissemination and information retrieval are the ultimate goals of wireless networks. Before information propagates within the network, the target peers, from which information is retrieved or to which information is disseminated, first need to be discovered. This target discovery problem has extensive applications in wireless ad hoc networks and...

    Provided By University of Rochester

  • White Papers // Jan 2011

    Searching Strategy for Multi-Target Discovery in Wireless Networks

    In this paper, the authors address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the multi-target discovery problem in wireless networks. In order to find the nearest k targets from a total of m members with the least cost, how many searching attempts should...

    Provided By University of Rochester

  • White Papers // Jan 2011

    A Declarative Approach to Agent-Centered Context-Aware Computing in Ad Hoc Wireless Environments

    Much of the current work on context-aware computing relies on information directly available to an application via context sensors on its local host, e.g., user profile, host location, time of day, resource availability, and quality of service measurements. The authors propose a new notion of context which includes in principle...

    Provided By University of Rochester

  • White Papers // Jan 2011

    Energy Efficient Co-Adaptive Instruction Fetch and Issue

    Front-end instruction delivery accounts for a significant fraction of the energy consumed in a dynamic superscalar processor. The issue queue in these processors serves two crucial roles: it bridges the front and back ends of the processor and serves as the window of instructions for the out-of-order engine. A mismatch...

    Provided By University of Rochester

  • White Papers // Jan 2011

    Performance Modeling and System Management for Multi-Component Online Services

    Many dynamic-content online services are comprised of multiple interacting components and data partitions distributed across server clusters. Understanding the performance of these services is crucial for efficient system management. This paper presents a profile-driven performance model for cluster-based multi-component online services. The offline constructed application profiles characterize component resource needs...

    Provided By University of Rochester

  • White Papers // Nov 2010

    Initial Results of Prototyping a 3-D Integrated Intra-Chip Free-Space Optical Interconnect

    A new optical interconnect system for intra-chip communications based on free-space optics is summarized in this paper. All-to-all direct communications is provided using dedicated lasers and photodetectors, hence avoiding packet switching while offering ultra-low latency and scalable bandwidth. A board-level prototype for technology demonstration is built using fabricated germanium photodetectors,...

    Provided By University of Rochester

  • White Papers // Oct 2010

    Autonomic Log/Restore for Advanced Optimistic Simulation Systems

    In this paper, the authors address state recoverability in optimistic simulation systems by presenting autonomic log/restore architecture. Their proposal is unique in that it jointly provides the following features: log/restore operations are carried out in a completely transparent manner to the application programmer, the simulation-object state can be scattered across...

    Provided By University of Rochester

  • White Papers // Sep 2010

    Toward Optimal Cross-Layer Solutions for Cognitive Radio Wireless Networks

    Cognitive Radio (CR) networks have been proposed as a viable solution to spectrum scarcity problems. In CR networks, CR nodes exploit spectrum holes in space, time and/or frequency to transmit on licensed frequency bands without affecting primary users. In such a dynamic and unpredictable environment, CR networks require the ability...

    Provided By University of Rochester

  • White Papers // Sep 2010

    Decentralized Interference Management in Femtocells: A Game-Theoretic Approach

    Femtocells are receiving considerable interest in mobile communications as a strategy to overcome the indoor coverage problems as well as to improve the efficiency of current macrocell systems. One of the most critical issues in femtocells is the potential interference between nearby femtocells and from femtocells to macrocells or to...

    Provided By University of Rochester

  • White Papers // Jul 2010

    Multicasting Vs. Broadcasting: What Are the Trade-Offs?

    Network-wide broadcasting and multicasting are two important routing schemes used in group communications. In network-wide broadcasting, generated packets at the source node are distributed to all nodes in the network, while multicasting delivers the packets only to a subset of the nodes by creating and maintaining a data dissemination structure....

    Provided By University of Rochester

  • White Papers // Jul 2010

    Feasibility and Benefits of Passive RFID Wake-Up Radios for Wireless Sensor Networks

    Energy efficiency is one of the crucial design criteria for wireless sensor networks. Idle listening constitutes a major part of energy waste, and thus solutions such as duty cycling and the use of wake-up radios have been proposed to reduce idle listening and save energy. Compared to duty cycling, wake-up...

    Provided By University of Rochester

  • White Papers // Sep 2010

    Toward Optimal Cross-Layer Solutions for Cognitive Radio Wireless Networks

    Cognitive Radio (CR) networks have been proposed as a viable solution to spectrum scarcity problems. In CR networks, CR nodes exploit spectrum holes in space, time and/or frequency to transmit on licensed frequency bands without affecting primary users. In such a dynamic and unpredictable environment, CR networks require the ability...

    Provided By University of Rochester

  • White Papers // Sep 2010

    Decentralized Interference Management in Femtocells: A Game-Theoretic Approach

    Femtocells are receiving considerable interest in mobile communications as a strategy to overcome the indoor coverage problems as well as to improve the efficiency of current macrocell systems. One of the most critical issues in femtocells is the potential interference between nearby femtocells and from femtocells to macrocells or to...

    Provided By University of Rochester

  • White Papers // Sep 2012

    Interleaving Command Sequences: a Threat to Secure Smartcard Interoperability

    The increasingly widespread use of smartcards for a variety of sensitive applications, including digital signatures, creates the need to ensure and possibly certify the secure interoperability of these devices. Standard certification criteria, in particular the Common Criteria, define security requirements but do not sufficiently address the problem of interoperability. Here,...

    Provided By University of Rochester

  • White Papers // Jul 2012

    CloudShield: Efficient Anti-Malware Smartphone Patching With a P2P Network on the Cloud

    The battery limits of today Smartphones require a solution. In the scientific community it is believed that a promising way of prolonging battery life is to offload mobile computation to the cloud. State of the art offloading architectures consists of virtual copies of real Smartphones (the clones) that run on...

    Provided By University of Rochester

  • White Papers // Jan 2013

    CloneDoc: Exploiting the Cloud to Leverage Secure Group Collaboration Mechanisms for Smartphones

    The limited battery of Smartphones makes it hard for users to fully exploit their devices. Recent research considers offloading mobile computation to the cloud to improve efficiency and to extend battery life. The authors design Clone2Clone (C2C), a distributed P2P platform for software cloud clones of Smartphones. Upon C2C they...

    Provided By University of Rochester

  • White Papers // May 2012

    A Modular, Flexible and Virtualizable Framework for IEEE 802.11

    Wireless networks are extensively deployed due to their low cost and configuration easiness. However, they are not adapted to the new services and applications that are increasingly demanded by users. Current implementation of the IEEE 802.11 specification is supported in hardware devices and software developments, but they do not provide...

    Provided By University of Rochester

  • White Papers // Mar 2010

    Accounting Integration And Comparability: Evidence From Relative Performance Evaluation Around IFRS Adoption

    For a sample of Continental European firms, changes were studied in the sensitivity of their CEO turnover to foreign peers' accounting performance around mandatory adoption of International Financial Reporting Standards (IFRS). It's found that a post-adoption increase in the use of Relative Performance Evaluation (RPE) based on foreign peers' accounting...

    Provided By University of Rochester

  • White Papers // Jan 2009

    Improving QoS in Multicasting Through Adaptive Redundancy

    In Mobile Ad-hoc NETworks (MANETs), Quality of Service (QoS) of a multicast protocol is one of the most important performance metrics. Channel conditions and network topology frequently change, and in order to achieve a certain QoS, complex algorithms and protocols are needed. Often channel conditions are neglected during the design...

    Provided By University of Rochester

  • White Papers // May 2002

    Artificial Intelligence In Games: A Look At The Smarts Behind Lionhead Studio's "Black And White" And Where It Can And Will Go In The Future

    With its latest release "Black and White", Lionhead Studios has set the new standard for artificial intelligence in games. Creatures in this game have an incredible ability to learn that is implemented through a variety of AI algorithms and techniques. There is much that could be added to the game...

    Provided By University of Rochester

  • White Papers // Nov 2008

    Financial Regulation And Securitization: Evidence From Subprime Loans

    The authors examine the consequences of existing regulations on the quality of mortgage loans originations in the originate to distribute (OTD) market. The information asymmetries in the OTD market can lead to moral hazard problems on the part of lenders. The authors find, using a plausibly exogenous source of variation...

    Provided By University of Rochester

  • White Papers // Jun 2010

    Cache-Related Preemption and Migration Delays: Empirical Approximation and Impact on Schedulability

    A job that is impeded by a preemption or migration incurs additional cache misses when it resumes execution due to a loss of cache affinity. While often regarded negligible in scheduling-theoretic work, such cache-related delays must be accounted for when comparing scheduling algorithms in real systems. Two empirical methods to...

    Provided By University of Rochester

  • White Papers // Aug 2009

    A Local Information Based Protocol for Networks Data Exchange with Application to Mobile Sensor Networks

    In this paper, the authors present a new protocol for multi hop data transmission between nodes in a mobile sensor network. The only requirement for the network is to be connected. The routing is handled locally on the basis of information contained in the data transmitted. Global (time dependent) routing...

    Provided By University of Rochester

  • White Papers // Nov 2012

    Route Discovery and Caching: A Way to Improve the Scalability of Information-Centric Networking

    Information Centric Networking (ICN) is a new paradigm in which the network layer provides users with content, instead of providing communication channels between hosts, and is aware of the name (or identifiers) of the contents. In this paper, the authors first describe what, they believe, are the main advantages and...

    Provided By University of Rochester

  • White Papers // Dec 2012

    Load Sharing for Optimistic Parallel Simulations on Multi?Core Machines

    Parallel Discrete Event Simulation (PDES) is based on the partitioning of the simulation model into distinct Logical Processes (LPs), each one modeling a portion of the entire system, which are allowed to execute simulation events concurrently. This allows exploiting parallel computing architectures to speedup model execution, and to make very...

    Provided By University of Rochester

  • White Papers // Dec 2012

    Multi-Threaded Simulation of 4G Cellular Systems within the LTE-Sim Framework

    Now-a-days, an always increasing number of researchers and industries are putting a large effort in the design and the implementation of protocols, algorithms, and network architectures targeted at the emerging 4G cellular technology. In this context, multi-core/multi-processor simulation tools can accelerate their activities by drastically reducing the time required to...

    Provided By University of Rochester

  • White Papers // Aug 2012

    A Load-Sharing Architecture for High Performance Optimistic Simulations on Multi-Core Machines

    In Parallel Discrete Event Simulation (PDES), the simulation model is partitioned into a set of distinct Logical Processes (LPs) which are allowed to concurrently execute simulation events. In this paper, the authors present an innovative approach to load-sharing on multi-core/multiprocessor machines, targeted at the optimistic PDES paradigm, where LPs are...

    Provided By University of Rochester

  • White Papers // Jun 2012

    Assessing Load Sharing with in Optimistic Simulation Platforms

    The advent of multi-core machines has lead to the need for revising the architecture of modern simulation platforms. Specifically, recent proposals attempted to explore the viability of load-sharing for optimistic simulators run on top of these types of machines. In this paper, the authors provide an extensive experimental study for...

    Provided By University of Rochester

  • White Papers // May 2012

    Transparent and Efficient Shared-State Management for Optimistic Simulations on Multi-Core Machines

    Traditionally, Logical Processes (LPs) forming a simulation model store their execution information into disjoint simulations states, forcing events exchange to communicate data between each other. In this paper, the authors propose the design and implementation of an extension to the traditional Time Warp (optimistic) synchronization protocol for parallel/distributed simulation, targeted...

    Provided By University of Rochester

  • White Papers // Jan 2013

    Towards Symmetric Multi-Threaded Optimistic Simulation Kernels

    In this paper, the authors address the reshuffle of the design of optimistic simulation kernels in order to t multi-core/multiprocessor machines. This is done by providing a reference optimistic simulation architecture based on the symmetric multithreaded paradigm, where each simulation kernel instance is allowed to run a dynamically changing set...

    Provided By University of Rochester

  • White Papers // Oct 2010

    Autonomic Log/Restore for Advanced Optimistic Simulation Systems

    In this paper, the authors address state recoverability in optimistic simulation systems by presenting autonomic log/restore architecture. Their proposal is unique in that it jointly provides the following features: log/restore operations are carried out in a completely transparent manner to the application programmer, the simulation-object state can be scattered across...

    Provided By University of Rochester

  • White Papers // Nov 2010

    Initial Results of Prototyping a 3-D Integrated Intra-Chip Free-Space Optical Interconnect

    A new optical interconnect system for intra-chip communications based on free-space optics is summarized in this paper. All-to-all direct communications is provided using dedicated lasers and photodetectors, hence avoiding packet switching while offering ultra-low latency and scalable bandwidth. A board-level prototype for technology demonstration is built using fabricated germanium photodetectors,...

    Provided By University of Rochester

  • White Papers // Jan 2011

    Popularity-Biased Random Walks for Peer-to-Peer Search Under the Square-Root Principle

    The square-root principle is known to achieve low search time for peer-to-peer search techniques that do not utilize query routing indices (e.g., query flooding or random walk searches). Under this principle, each object is probed with probability proportional to the square root of its query popularity. Existing search methods realize...

    Provided By University of Rochester

  • White Papers // Mar 2010

    Information-Sharing Protocol Architectures for Sensor Networks: The State of the Art and a New Solution

    Protocols for Wireless Sensor Networks (WSNs) are very diverse. Reflecting this diversity, no single protocol architecture for WSNs dominates: Programmers often modify the legacy-architecture to fit their set of protocols in the stack. However, there exists desirable goals for a sensor network architecture: Modularity, flexibility and universality. At the same...

    Provided By University of Rochester

  • White Papers // Aug 2009

    Schedule Adaptation of Low-Power-Listening Protocols for Wireless Sensor Networks

    Applications for Wireless Sensor Networks (WSN) are becoming increasingly complex, and they require the network to maintain a satisfactory level of operation for extended periods of time. Consequently, sensor networks have to make the best possible use of their initial energy resources, specifically by constantly adapting their protocols to the...

    Provided By University of Rochester

  • White Papers // Jan 2010

    Duty Cycle Control for Low-Power-Listening MAC Protocols

    Energy efficiency is of the utmost importance in wireless sensor networks. The family of Low-Power-Listening MAC protocols was proposed to reduce one form of energy dissipation - idle listening, a radio state for which the energy consumption cannot be neglected. Low-Power-Listening MAC protocols are characterized by a duty cycle: A...

    Provided By University of Rochester

  • White Papers // Jan 2011

    Searching Strategies for Target Discovery in Wireless Networks

    Information dissemination and information retrieval are the ultimate goals of wireless networks. Before information propagates within the network, the target peers, from which information is retrieved or to which information is disseminated, first need to be discovered. This target discovery problem has extensive applications in wireless ad hoc networks and...

    Provided By University of Rochester

  • White Papers // Jul 2010

    Feasibility and Benefits of Passive RFID Wake-Up Radios for Wireless Sensor Networks

    Energy efficiency is one of the crucial design criteria for wireless sensor networks. Idle listening constitutes a major part of energy waste, and thus solutions such as duty cycling and the use of wake-up radios have been proposed to reduce idle listening and save energy. Compared to duty cycling, wake-up...

    Provided By University of Rochester

  • White Papers // Dec 2008

    RBMulticast: Receiver Based Multicast for Wireless Sensor Networks

    Multicast routing protocols typically rely on the a-priori creation of a multicast tree (or mesh), which requires the individual nodes to maintain state information. In sensor networks where traffic is bursty, with long periods of silence between the bursts of data, this multicast state maintenance adds a large amount of...

    Provided By University of Rochester

  • White Papers // Jan 2011

    Searching Strategy for Multi-Target Discovery in Wireless Networks

    In this paper, the authors address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the multi-target discovery problem in wireless networks. In order to find the nearest k targets from a total of m members with the least cost, how many searching attempts should...

    Provided By University of Rochester

  • White Papers // Jul 2010

    Multicasting Vs. Broadcasting: What Are the Trade-Offs?

    Network-wide broadcasting and multicasting are two important routing schemes used in group communications. In network-wide broadcasting, generated packets at the source node are distributed to all nodes in the network, while multicasting delivers the packets only to a subset of the nodes by creating and maintaining a data dissemination structure....

    Provided By University of Rochester

  • White Papers // Jan 2009

    Adaptation of TDMA Parameters Based on Network Conditions

    Soft clustering of the nodes combined with Time Division Multiple Access (TDMA) channel access within a cluster has been shown to provide an energy-efficient solution for Mobile Ad-Hoc NETworks (MANET). Such channel access schemes use a parameter that is critical in determining network performance: the number of frames per superframe,...

    Provided By University of Rochester

  • White Papers // Jan 2011

    A Declarative Approach to Agent-Centered Context-Aware Computing in Ad Hoc Wireless Environments

    Much of the current work on context-aware computing relies on information directly available to an application via context sensors on its local host, e.g., user profile, host location, time of day, resource availability, and quality of service measurements. The authors propose a new notion of context which includes in principle...

    Provided By University of Rochester

  • White Papers // Mar 2010

    ATMA: Advertisement-Based TDMA Protocol for Bursty Traffic in Wireless Sensor Networks

    Energy conservation is one of the primary goals of the majority of MAC protocols designed for wireless sensor networks. In Sensor-MAC (S-MAC), one of the first MAC protocols designed for sensor networks, nodes sleep and wake up periodically to save energy. MAC protocols such as Timeout-MAC (T-MAC) and ADVertisement-MAC (ADV-MAC)...

    Provided By University of Rochester

  • White Papers // Dec 2009

    ADV-MAC: Advertisement-Based MAC Protocol for Wireless Sensor Networks

    Several Medium Access Control (MAC) protocols have been proposed for wireless sensor networks with the objective of minimizing energy consumption. For example, Sensor-MAC (S-MAC) was proposed to reduce energy consumption by introducing a duty cycle. Under variable traffic load, the fixed duty cycle of S-MAC results in energy loss due...

    Provided By University of Rochester

  • White Papers // Feb 2010

    Maximizing the Lifetime of Clusters With Slepian-Wolf Coding

    In this paper, the authors propose an iteration-free algorithm to find the optimal configuration, including transmit power and source coding rates, to maximize the lifetime of a cluster utilizing Slepian-Wolf source coding of data sent to a fusion center. Exact closed form solutions are derived when the fusion center is...

    Provided By University of Rochester

  • White Papers // Jan 2009

    Minimizing Energy Consumption in IR-UWB Based Wireless Sensor Networks

    Impulse Radio Ultra-WideBand (IR-UWB) communication has proven an important technique for supporting high-rate, short-range, low-power communication. These are necessary criteria for emerging sensor networks, which oftentimes have very short distance communication requirements, necessitate low power operation and may require high data rates (e.g., for supporting the transmission of images or...

    Provided By University of Rochester

  • White Papers // Nov 2008

    A Better Choice for Sensor Sleeping

    Sensor sleeping is a widely-used and cost-effective technique to save energy in wireless sensor networks. Protocols at different stack levels can, either individually or simultaneously, make the sensor sleep so as to extend the application lifetime. To determine the best choice for sensor sleeping under different network conditions and application...

    Provided By University of Rochester

  • White Papers // Mar 2010

    Modeling and Throughput Analysis for SMAC With a Finite Queue Capacity

    SMAC is a popular duty-cycled MAC protocol, designed for wireless sensor networks to save energy and prolong the network lifetime. However, existing work evaluates the performance of SMAC solely through simulations or field measurements. To the best of the knowledge, there are no analytical models for evaluating the performance of...

    Provided By University of Rochester

  • White Papers // Jan 2011

    Energy-Efficient Duty Cycle Assignment for Receiver-Based Convergecast in Wireless Sensor Networks

    Duty cycling is often used to reduce the energy consumption caused by idle listening in Wireless Sensor Networks (WSNs). Most studies on WSN protocols define a common duty cycle value throughout the network to achieve synchronization among the nodes. On the other hand, a few studies propose adaptation of the...

    Provided By University of Rochester

  • White Papers // Jan 2011

    Energy Efficient Co-Adaptive Instruction Fetch and Issue

    Front-end instruction delivery accounts for a significant fraction of the energy consumed in a dynamic superscalar processor. The issue queue in these processors serves two crucial roles: it bridges the front and back ends of the processor and serves as the window of instructions for the out-of-order engine. A mismatch...

    Provided By University of Rochester