Cornell University

Displaying 1-40 of 1120 results

  • White Papers // Oct 2014

    Machine Learning Techniques in Cognitive Radio Networks

    Cognitive radio is an intelligent radio that can be programmed and configured dynamically to fully use the frequency resources that are not used by licensed users. It defines the radio devices that are capable of learning and adapting to their transmission to the external radio environment, which means it has...

    Provided By Cornell University

  • White Papers // Oct 2014

    An Algorithm for Mining High Utility Closed Itemsets and Generators

    Traditional association rule mining based on the support-confidence framework provides the objective measure of the rules that are of interest to users. However, it does not reflect the utility of the rules. To extract non-redundant association rules in support-confidence framework frequent closed itemsets and their generators play an important role....

    Provided By Cornell University

  • White Papers // Oct 2014

    Distributed SIR-Aware Opportunistic Access Control for D2D Underlaid Cellular Networks

    In this paper, the authors propose a distributed interference and channel-aware opportunistic access control technique for D2D underlaid cellular networks, in which each potential D2D link is active whenever its estimated Signal-to-Interference Ratio (SIR) is above a predetermined threshold so as to maximize the D2D area spectral efficiency. Their SIR-aware...

    Provided By Cornell University

  • White Papers // Sep 2014

    A Study on Impacts of RTT Inaccuracy on Dynamic Bandwidth Allocation in PON and Solution

    The circle travelling delay between OLT (Optical Line Terminal) and ONU (Optical Network Unit) is one of most important items in Dynamic Bandwidth Allocation (DBA) algorithms in PON, called RTT (Round Trip Time). The RTT is taken into account when OLT assigns the start times for upstream bandwidth grants. In...

    Provided By Cornell University

  • White Papers // Sep 2014

    Importance of Realistic Mobility Models for VANET Network Simulation

    In the performance evaluation of a protocol for a Vehicular Ad hoc NETwork (VANET), the protocol should be tested under a realistic conditions including, representative data traffic models, and realistic movements of the mobile nodes which are the vehicles (i.e., a mobility model). This paper is a comparative study between...

    Provided By Cornell University

  • White Papers // Aug 2014

    Optimal Joint User Association and Resource Allocation in Heterogeneous Networks via Sparsity Pursuit

    In this paper, the authors study the joint user association and resource allocation in Heterogeneous Networks (HetNets) from a novel perspective, motivated by and generating the idea of fractional frequency reuse. By treating the multi-cell multi-user resource allocation as resource partitioning among multiple reuse patterns, they propose a unified framework...

    Provided By Cornell University

  • White Papers // Aug 2014

    Optimal Radius for Connectivity in Duty-Cycled Wireless Sensor Networks

    Wireless Sensor Networks (WSNs) have a wide range of applications from wildlife monitoring to critical infrastructure monitoring, from traffic management to individual health management. The three primary functions of a sensor are to sense, process and communicate. After being deployed randomly over a limited area, sensors start to sense a...

    Provided By Cornell University

  • White Papers // Aug 2014

    Enhancing the Accuracy of Device-Free Localization Using Spectral Properties of the RSS

    Received signal strength based device-free localization has attracted considerable attention in the research society over the past years to locate and track people who are not carrying any electronic device. Typically, the person is localized using a spatial model that relates the time domain signal strength measurements to the person's...

    Provided By Cornell University

  • White Papers // Aug 2014

    Wireless Powered Communication: Opportunities and Challenges

    The performance of wireless communication is fundamentally constrained by the limited battery life of wireless devices, whose operations are frequently disrupted due to the need of manual battery replacement/recharging. The recent advance in Radio Frequency (RF) enabled Wireless Energy Transfer (WET) technology provides an attractive solution named Wireless Powered Communication...

    Provided By Cornell University

  • White Papers // Jun 2014

    A Tale of Two Data-Intensive Paradigms: Applications, Abstractions, and Architectures

    Scientific problems that depend on processing large amounts of data require overcoming challenges in multiple areas: managing large-scale data distribution, co-placement and scheduling of data with compute resources, and storing and transferring large volumes of data. The authors analyze the ecosystems of the two prominent paradigms for data-intensive applications, hereafter...

    Provided By Cornell University

  • White Papers // Jun 2014

    Wireless Backhaul Networks: Capacity Bound, Scalability Analysis and Design Guidelines

    In this paper, the authors study the scalability of a wireless backhaul network modeled as a random extended network with multi-antenna Base Stations (BSs), where the number of antennas per BS is allowed to scale as a function of the network size. The antenna scaling is justified by the current...

    Provided By Cornell University

  • White Papers // Jun 2014

    Integration of a Predictive, Continuous Time Neural Network Into Securities Market Trading Operations

    In this paper, the authors have presented an example of deep learning, namely the integration of a predictive, continuous time recurrent neural network into trading and risk assessment operations. During application within a trading environment the potential need to adapt technical analysis indicators that their use might be continued and...

    Provided By Cornell University

  • White Papers // May 2014

    Ameliorate Threshold Distributed Energy Efficient Clustering Algorithm for Heterogeneous Wireless Sensor Networks

    Ameliorating the lifetime in heterogeneous Wireless Sensor Network (WSN) is an important task because the sensor nodes are limited in the resource energy. The best way to improve a WSN lifetime is the clustering based algorithms in which each cluster is managed by a leader called Cluster Head (CH). Each...

    Provided By Cornell University

  • White Papers // May 2014

    Bargaining-Based Mobile Data Offloading

    The unprecedented growth of mobile data traffic challenges the performance and economic viability of today's cellular networks, and calls for novel network architectures and communication solutions. Data offloading through third-party WiFi or femtocell Access Points (APs) can effectively alleviate the cellular network congestion in a low operational and capital expenditure....

    Provided By Cornell University

  • White Papers // May 2014

    Algebraic Codes and a New Physical Layer Transmission Protocol for Wireless Distributed Storage Systems

    In a wireless storage system, having to communicate over a fading channel makes repair transmissions prone to physical layer errors. The first approach to combat fading is to utilize the existing optimal space-time codes. However, it was recently pointed out that such codes are in general too complex to decode...

    Provided By Cornell University

  • White Papers // May 2014

    Repair for Distributed Storage Systems in Packet Erasure Networks

    Reliability is essential for storing files in many applications of distributed storage systems. To maintain reliability, when a storage node fails, a new node should be regenerated by a repair process. Most of the previous results on the repair problem assume perfect (error-free) links in the networks. However, in practice,...

    Provided By Cornell University

  • White Papers // May 2014

    The SQL++ Semi-structured Data Model and Query Language: A Capabilities Survey of SQL-on-Hadoop, NoSQL and NewSQL Databases

    Numerous SQL-on-Hadoop, NewSQL and NoSQL databases provide semi-structured data model and query language capabilities, but it is difficult to compare these capabilities. Many differences between the data models and (especially) between the query languages are superficial, but nonetheless distract from the essential differences. Other query language differences are direct derivatives...

    Provided By Cornell University

  • White Papers // May 2014

    Full-Duplex Cloud Radio Access Networks: An Information-Theoretic Viewpoint

    The conventional design of cellular systems prescribes the separation of uplink and downlink transmissions via time-division or frequency-division duplex. Recent advances in analog and digital domain self-interference interference cancellation challenge the need for this arrangement and open up the possibility to operate base stations, especially low-power ones, in a full-duplex...

    Provided By Cornell University

  • White Papers // May 2014

    NScale: Neighborhood-Centric Large-Scale Graph Analytics in the Cloud

    There is an increasing interest in executing rich and complex analysis tasks over large-scale graphs, many of which require processing and reasoning about a large number of multi-hop neighborhoods or sub-graphs in the graph. Examples of such tasks include ego network analysis, motif counting, finding social circles, personalized recommendations, link...

    Provided By Cornell University

  • White Papers // May 2014

    Emulated ASIC Power and Temperature Monitor System for FPGA Prototyping of an Invasive MPSoC Computing Architecture

    In this contribution the emulation of an ASIC Temperature and Power Monitoring system (TPMon) for FPGA prototyping is presented and tested to control processor temperatures under different control targets and operating strategies. The approach for emulating the power monitor is based on an instruction-level energy model. For emulating the temperature...

    Provided By Cornell University

  • White Papers // May 2014

    Massively Parallel Processor Architectures for Resource-Aware Computing

    The authors present a class of massively parallel processor architectures called invasive Tightly Coupled Processor Arrays (TCPAs). The presented processor class is a highly parameterizable template, which can be tailored before runtime to fulfill costumers' requirements such as performance, area cost, and energy efficiency. These programmable accelerators are well suited...

    Provided By Cornell University

  • White Papers // May 2014

    Anytime Control Using Input Sequences With Markovian Processor Availability

    The authors study an anytime control algorithm for situations where the processing resources available for control are time-varying in an a priori unknown fashion. Thus, at times, processing resources are insufficient to calculate control inputs. To address this issue, the algorithm calculates sequences of tentative future control inputs whenever possible,...

    Provided By Cornell University

  • White Papers // May 2014

    NetSecCC: A Scalable and Fault-tolerant Architecture without Outsourcing Cloud Network Security

    Modern cloud computing platforms based on virtual machine monitors carry a variety of complex business that present many network security vulnerabilities. At present, the traditional architecture employs a number of security devices at front-end of cloud computing to protect its network security. Under the new environment, however, this approach cannot...

    Provided By Cornell University

  • White Papers // Apr 2014

    Intelligent Resource Allocation Technique For Desktop-as-a-Service in Cloud Environment

    The specialty of desktop-as-a-service cloud computing is that user can access their desktop and can execute applications in virtual desktops on remote servers. Resource management and resource utilization are most significant in the area of desktop-as-a-service, cloud computing; however, handling a large amount of clients in the most efficient manner...

    Provided By Cornell University

  • White Papers // Apr 2014

    Computing an Optimal Control Policy for an Energy Storage

    The authors introduce StoDynProg, a small library created to solve Optimal Control problems arising in the management of Renewable Power Sources, in particular when coupled with an Energy Storage System. The library implements generic Stochastic Dynamic Programming (SDP) numerical methods which can solve a large class of Dynamic Optimization problems....

    Provided By Cornell University

  • White Papers // Apr 2014

    Automated Classification of Airborne Laser Scanning Point Clouds

    Making sense of the physical world has always been at the core of mapping. Up until recently, this has always dependent on using the human eye. Using airborne lasers, it has become possible to quickly \"See\" more of the world in many more dimensions. The resulting enormous point clouds serve...

    Provided By Cornell University

  • White Papers // Apr 2014

    Cache-Oblivious VAT-Algorithms

    Modern processors have a memory hierarchy and use virtual memory. The authors concentrate on two-levels of the hierarchy and refer to the faster memory as the cache. Data is moved between the fast and the slow memory in blocks of contiguous memory cells, and only data residing in the fast...

    Provided By Cornell University

  • White Papers // Apr 2014

    A Signal Processor for Gaussian Message Passing

    In this paper, the authors present a novel signal processing unit built upon the theory of factor graphs, which is able to address a wide range of signal processing algorithms. More specifically, the demonstrated Factor Graph Processor (FGP) is tailored to Gaussian message passing algorithms. They show how to use...

    Provided By Cornell University

  • White Papers // Apr 2014

    CernVM Online and Cloud Gateway: A Uniform Interface for CernVM Contextualization and Deployment

    In a virtualized environment, contextualization is the process of configuring a VM instance for the needs of various deployment use cases. Contextualization in CernVM can be done by passing a handwritten context to the user data field of cloud APIs, when running CernVM on the cloud, or by using CernVM...

    Provided By Cornell University

  • White Papers // Apr 2014

    Max-min Fair Wireless Energy Transfer for Secure Multiuser Communication Systems

    In this paper, the authors consider max-min fairness for wireless energy transfer in a downlink multiuser communication system. Their resource allocation design maximizes the minimum harvested energy among multiple multiple-antenna energy harvesting receivers (potential eavesdroppers) while providing Quality of Service (QoS) for secure communication to multiple single antenna information receivers....

    Provided By Cornell University

  • White Papers // Apr 2014

    GraphGen: An FPGA Framework for Vertex-Centric Graph Computation

    Vertex-centric graph computations are widely used in many machine learning and data mining applications that operate on graph data structures. This paper presents GraphGen, a vertex-centric framework that targets FPGA for hardware acceleration of graph computations. GraphGen accepts a vertex-centric graph specification and automatically compiles it onto an application-specific synthesized...

    Provided By Cornell University

  • White Papers // Apr 2014

    Towards Cloud Computing: A Swot Analysis on Its Adoption in SMEs

    Over the past few years, emergence of cloud computing has notably made an evolution in the IT industry by putting forward an 'Everything as a service' idea .Cloud computing is of growing interest to companies throughout the world, but there are many barriers associated with its adoption which should be...

    Provided By Cornell University

  • White Papers // Apr 2014

    Estimation of Optimized Energy and Latency Constraint for Task Allocation in 3D Network on Chip

    In Network on Chip (NoC) rooted system, energy consumption is affected by task scheduling and allocation schemes which affect the performance of the system. In this paper, the authors test the pre-existing proposed algorithms and introduced a new energy skilled algorithm for 3D NoC architecture. An efficient dynamic and cluster...

    Provided By Cornell University

  • White Papers // Apr 2014

    Web Log Data Analysis by Enhanced Fuzzy C Means Clustering

    World Wide Web is a huge repository of information and there is a tremendous increase in the volume of information daily. The number of users is also increasing day by day. To reduce users browsing time lot of research is taken place. Web Usage Mining is a type of web...

    Provided By Cornell University

  • White Papers // Apr 2014

    Hardware Efficient WiMAX Deinterleaver Capable of Address Generation for Random Interleaving Depths

    The variation in the prescribed modulation schemes and code rates for WiMAX interleaver design, as defined by IEEE 802.16 standard, demands a plethora of hardware if all the modulation schemes and code rates have to be unified into a single electronic device. Add to this the complexities involved with the...

    Provided By Cornell University

  • White Papers // Apr 2014

    A New Multi-Tiered Solid State Disk Using SLC/MLC Combined Flash Memory

    Storing digital information, ensuring the accuracy, steady and uninterrupted access to the data is considered as fundamental challenges in enterprise-class organizations and companies. In recent years, new types of storage systems such as Solid State Disks (SSD) have been introduced. Unlike hard disks that have mechanical structure, SSDs are based...

    Provided By Cornell University

  • White Papers // Apr 2014

    Classification of Attacks in Wireless Sensor Networks

    In Wireless Sensor Networks (WSNs), security has a vital importance. Recently, it was be a huge interest to propose a security solution in WSNs because of their applications in both civilian and military domain. Adversaries can lunch different types of attacks, and cryptography is used to countering these attacks. In...

    Provided By Cornell University

  • White Papers // Mar 2014

    Tile Optimization for Area in FPGA Based Hardware Acceleration of Peptide Identification

    Advances in life sciences over the last few decades have lead to the generation of a huge amount of biological data. Computing research has become a vital part in driving biological discovery where analysis and categorization of biological data are involved. String matching algorithms can be applied for protein/gene sequence...

    Provided By Cornell University

  • White Papers // Mar 2014

    Design Architecture-Based on Web Server and Application Cluster in Cloud Environment

    Cloud has been a computational and storage solution for many data centric organizations. The problem today those organizations are facing from the cloud is in data searching in an efficient manner. A framework is required to distribute the work of searching and fetching from thousands of computers. The data in...

    Provided By Cornell University

  • White Papers // Mar 2014

    Increasing Flash Memory Lifetime by Dynamic Voltage Allocation for Constant Mutual Information

    The read channel in Flash memory systems degrades over time because the Fowler-Nordheim tunneling used to apply charge to the floating gate eventually compromises the integrity of the cell because of tunnel oxide degradation. While degradation is commonly measured in the number of program/erase cycles experienced by a cell, the...

    Provided By Cornell University

  • White Papers // Mar 2009

    Programming Live Distributed Objects With Distributed Data Flows

    This paper presents a new object-oriented approach to modeling the semantics of distributed multi-party protocols such as leader election, distributed locking, or reliable multicast, and a programming language that supports it. The approach builds on and extends the live distributed objects model by introducing a new concept of a distributed...

    Provided By Cornell University

  • White Papers // Aug 2009

    Multi-Verifier Signatures

    Multi-verifier signatures generalize traditional digital signatures to a secret-key setting. Just like digital signatures, these signatures are both transferable and secure under arbitrary (unbounded) adaptive chosen-message attacks. In contrast to digital signature schemes, however, the authors exhibit practical constructions of multi-verifier signature schemes that are provably secure and are based...

    Provided By Cornell University

  • White Papers // Apr 2010

    Optimal Network Design for the Spread of Cascades

    The authors introduce a new optimization framework to maximize the expected spread of cascades in networks. The model allows a rich set of actions that directly manipulate cascade dynamics by adding nodes or edges to the network. The motivating application is one in spatial conservation planning, where a cascade models...

    Provided By Cornell University

  • White Papers // May 2011

    On the Feasibility of Completely Wireless Data Centers

    The authors introduce a novel data center design based on emerging 60 GHz RF technology that uses wires only to deliver power to its server nodes. Fundamental limitation of wireless data centers is that the maximum number of live connections in the network is directly proportional to the full volume...

    Provided By Cornell University

  • White Papers // Apr 2011

    Doctrine for Cybersecurity

    Successions of doctrines have been advocated in the past for enhancing cybersecurity: Prevention, risk management, and deterrence through accountability. None has proved effective, and their failings are discussed. Most recently, proposals are being made to view cyber-security as a public good or to adopt mechanisms inspired by those used for...

    Provided By Cornell University

  • White Papers // Nov 2009

    Network Congestion Control Using NetFlow

    The goal of congestion control is to avoid congestion in network elements. A network element is congested if it is being offered more traffic than it can process. To detect such situations and to neutralize them the authors should monitor traffic in the network. In this paper, they propose using...

    Provided By Cornell University

  • White Papers // Nov 2009

    PAKE-Based Mutual HTTP Authentication for Preventing Phishing Attacks

    This paper describes a new password-based mutual authentication protocol for Web systems which prevents various kinds of phishing attacks. This protocol provides a protection of user's passwords against any phishers even if dictionary attack is employed, and prevents phishers from imitating a false sense of successful authentication to users. The...

    Provided By Cornell University

  • White Papers // Dec 2009

    NP-Completeness of Certain Sub-Classes of the Syndrome Decoding Problem

    The problem of Syndrome Decoding was proven to be NP-complete in 1978 and, since then, quite a few cryptographic applications have had their security rely on the (provable) difficulty of solving some instances of it. However, in most cases, the instances to be solved follow some specific constraint: the target...

    Provided By Cornell University

  • White Papers // Dec 2009

    Fingerprint Verification Based on Gabor Filter Enhancement

    Human fingerprints are reliable characteristics for personnel identification as it is unique and persistence. A fingerprint pattern consists of ridges, valleys and minutiae. In this paper the authors propose Fingerprint Verification based on Gabor Filter Enhancement (FVGFE) algorithm for minutiae feature extraction and post processing based on 9-pixel neighborhood. A...

    Provided By Cornell University

  • White Papers // Dec 2009

    Fault Predictions in Object Oriented Software

    The dynamic software development organizations optimize the usage of resources to deliver the products in the specified time with the fulfilled requirements. This requires prevention or repairing of the faults as quick as possible. In this paper an approach for predicting the run-time errors in java is introduced. The paper...

    Provided By Cornell University

  • White Papers // Dec 2009

    Detection and Prevention of New and Unknown Malware Using Honeypots

    Security has become ubiquitous in every domain today as newly emerging malware pose an ever-increasing perilous threat to systems. Consequently, honeypots are fast emerging as an indispensible forensic tool for the analysis of malicious network traffic. Honeypots can be considered to be traps for hackers and intruders and are generally...

    Provided By Cornell University

  • White Papers // Nov 2009

    Steganography an Art of Hiding Data

    In today's world the art of sending & displaying the hidden information especially in public places, has received more attention and faced many challenges. Therefore, different methods have been proposed so far for hiding information in different cover media. In this paper a method for hiding of information on the...

    Provided By Cornell University

  • White Papers // Jan 2011

    Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows

    The authors study a wireless relay network, with a single source and a single destination. The main result is to show that an appropriate compress-and-forward scheme supports essentially the same reliable data rate as the quantize-map-and-forward and noisy network coding schemes; thus, it is approximately optimal - in the sense,...

    Provided By Cornell University

  • White Papers // Dec 2008

    The Web as a Graph Measurements, Models, and Methods

    The pages and hyperlinks of the World-Wide Web may be viewed as nodes and edges in a directed graph. This graph is a fascinating object of study: it has several hundred million nodes today over a billion links and appears to grow exponentially with time. There are many reasons -...

    Provided By Cornell University

  • White Papers // Jan 2011

    Perseus Technology: New Trends in Information and Communication Security

    Using cryptography to protect information and communication has basically two major drawbacks. First, the specific entropy profile of encrypted data makes their detection very easy. Second, the use of cryptography can be more or less regulated, not to say forbidden, according to the countries. If the right to freely protect...

    Provided By Cornell University

  • White Papers // Dec 2010

    Throughput and Latency in Finite-Buffer Line Networks

    This paper investigates the effect of finite buffer sizes on the throughput capacity and packet delay of line networks with packet erasure links that have perfect feedback. These performance measures are shown to be linked to the stationary distribution of an underlying irreducible Markov chain that models the system exactly....

    Provided By Cornell University

  • White Papers // Dec 2010

    A Self-Organising Neural Network for Processing Data From Multiple Sensors

    This paper shows how a folded Markov chain network can be applied to the problem of processing data from multiple sensors, with an emphasis on the special case of 2 sensors. It is necessary to design the network so that it can transform a high dimensional input vector into a...

    Provided By Cornell University

  • White Papers // Dec 2010

    SNEED: Enhancing Network Security Services Using Network Coding and Joint Capacity

    Traditional network security protocols depend mainly on developing cryptographic schemes and on using biometric methods. These have led to several network security protocols that are unbreakable based on difficulty of solving un-tractable mathematical problems such as factoring large integers. In this paper, Security of Networks Employing Encoding and Decoding (SNEED)...

    Provided By Cornell University

  • White Papers // Jun 2011

    Learning, Investments And Derivatives

    The recent crisis and the following flight to simplicity put most derivative businesses around the world under considerable pressure. The authors argue that the traditional modeling techniques must be extended to include product design. They propose a quantitative framework for creating products which meet the challenge of being optimal from...

    Provided By Cornell University

  • White Papers // Jun 2009

    Observed Universality of Phase Transitions in High-Dimensional Geometry, With Implications for Modern Data Analysis and Signal Processing

    The authors review connections between phase transitions in high-dimensional combinatorial geometry and phase transitions occurring in modern high-dimensional data analysis and signal processing. In data analysis, such transitions arise as abrupt breakdown of linear model selection, robust data fitting or compressed sensing reconstructions, when the complexity of the model or...

    Provided By Cornell University

  • White Papers // Jul 2009

    Applying Local Clustering Method to Improve the Running Speed of Ant Colony Optimization

    Ant Colony Optimization (ACO) has time complexity O(tmN2), and its typical application is to solve Traveling Salesman Problem (TSP), where t, m, and N denotes the iteration number, number of ants, number of cities respectively. Cutting down running time is one of study focuses, and one way is to decrease...

    Provided By Cornell University

  • White Papers // Jul 2009

    Bit Copying - The Ultimate Computational Simplicity

    This paper presents the proof that referencing and bit copying are operations sufficient for Turing-complete computation. A programming language consisting of just one instruction - bit copy, is presented. This language is not just the proof of concept: programs like calculating factorial and "Hello, World!" with an iteration over an...

    Provided By Cornell University

  • White Papers // Jul 2009

    4G Wireless Networks: Opportunities and Challenges

    With the major wireless service providers planning to start deployment of 4G wireless networks by mid 2010, research and industry communities are racing against time to find solutions for some of the prominent still open issues in 4G networks. The growing interest in 4G networks is driven by the set...

    Provided By Cornell University

  • White Papers // Jul 2009

    Web of Lossy Adapters for Interface Interoperability: An Algorithm and NP-Completeness of Minimization

    Different services that provide similar functionality will often be accessed using widely different interfaces, especially if standardization is lacking. To avoid having to rewrite separate code for all interfaces that may have to be used, interface adapters can be used to translate calls to one interface into calls to another...

    Provided By Cornell University

  • White Papers // Jul 2009

    Optimal Routing and Power Control for a Single Cell, Dense, Ad Hoc Wireless Network

    The authors consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data packets are sent between source-destination pairs by multihop relaying. They assume that nodes self-organise into a...

    Provided By Cornell University

  • White Papers // Apr 2010

    Interacting Branching Processes and Linear File-Sharing Networks

    File-sharing networks are distributed systems used to disseminate files among nodes of a communication network. The general simple principle of these systems is that once a node has retrieved a file, it may become a server for this file. In this paper, the capacity of these networks is analyzed with...

    Provided By Cornell University

  • White Papers // Aug 2009

    Performance Analysis Over Slow Fading Channels of a Half-Duplex Single-Relay Protocol: Decode or Quantize and Forward

    In this work, a new static relaying protocol is introduced for half duplex single-relay networks, and its performance is studied in the context of communications over slow fading wireless channels. The proposed protocol is based on a Decode or Quantize and Forward (DoQF) approach. In slow fading scenarios, two performance...

    Provided By Cornell University

  • White Papers // Aug 2009

    Lazy Mixin Modules and Disciplined Effects

    Programming languages are expected to support programmer's effort to structure program code. The ML module system, object systems and mixins are good examples of language constructs promoting modular programming. Among the three, mixins can be thought of as a generalization of the two others in the sense that mixins can...

    Provided By Cornell University

  • White Papers // Aug 2009

    Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems

    The multiprocessor Fixed-Job Priority (FJP) scheduling of real-time systems is studied. An important property for the schedulability analysis, the predictability (regardless to the execution times), is studied for heterogeneous multiprocessor platforms. The main contribution is to show that any FJP schedulers are predictable on unrelated platforms. A convenient consequence is...

    Provided By Cornell University

  • White Papers // May 2010

    Rapid Self-Organised Initiation of Ad Hoc Sensor Networks Close Above the Percolation Threshold

    This work shows potentials for rapid self-organisation of sensor networks where nodes collaborate to relay messages to a common data collecting unit (sink node). The study problem is, in the sense of graph theory, to find a shortest path tree spanning a weighted graph. This is a well-studied problem where...

    Provided By Cornell University

  • White Papers // May 2010

    Inferring Loop Invariants Using Postconditions

    One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, also known as its contract); the present work takes advantage of this observation by using the postcondition as the basis for...

    Provided By Cornell University

  • White Papers // Sep 2009

    On the Relations Between Diffie-Hellman and ID-Based Key Agreement From Pairings

    This paper studies the relationships between the traditional Diffie-Hellman key agreement protocol and the IDentity-based (ID-based) key agreement protocol from pairings. For the Sakai-Ohgishi-Kasahara (SOK) ID-based key construction, the authors show that identical to the Diffie-Hellman protocol, the SOK key agreement protocol also has three variants, namely ephemeral, semi-static and...

    Provided By Cornell University

  • White Papers // Sep 2009

    An Efficient and Publicly Verifiable Id-Based Multi-Signcryption Scheme

    Secure message transmission over an insecure channel, require both confidentiality and authenticity, which may be achieved through 'Signature then encryption' approach. However, in 1997 Zheng proposed a cryptographic primitive "Signcryption" which achieves both confidentiality and authenticity in a single logical step with much lower computational cost than signature then encryption...

    Provided By Cornell University

  • White Papers // Sep 2009

    Single-Generation Network Coding for Networks With Delay

    A single-source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the incoming symbols (received at their incoming edges) on their outgoing edges. Memory-free networks with delay using network coding...

    Provided By Cornell University

  • White Papers // Aug 2009

    Philosophical Survey of Passwords

    Over the years security experts in the field of Information Technology have had a tough time in making passwords secure. This paper studies and takes a careful look at this issue from the angle of philosophy and cognitive science. The authors have studied the process of passwords to rank its...

    Provided By Cornell University

  • White Papers // Aug 2009

    Self-Partial and Dynamic Reconfiguration Implementation for AES Using FPGA

    This paper addresses efficient hardware/software implementation approaches for the AES (Advanced Encryption Standard) algorithm and describes the design and performance testing algorithm for embedded system. Also, with the spread of reconfigurable hardware such as FPGAs (Field Programmable Gate Array) embedded cryptographic hardware became cost-effective. Nevertheless, it is worthy to note...

    Provided By Cornell University

  • White Papers // Aug 2009

    DPRAODV: A Dynamic Learning System Against Blackhole Attack in AODV Based MANET

    Security is an essential requirement in mobile ad hoc networks to provide protected communication between mobile nodes. Due to unique characteristics of MANETS, it creates a number of consequential challenges to its security design. To overcome the challenges, there is a need to build a multifence security solution that achieves...

    Provided By Cornell University

  • White Papers // Aug 2009

    Electric Routing and Concurrent Flow Cutting

    The authors address a vision of the Internet where every participant exchanges messages with their direct friends and no one else. Yet such an Internet should be able to support reliable and efficient routing to remote locations identified by unchanging names in the presence of an ever changing graph of...

    Provided By Cornell University

  • White Papers // Sep 2009

    On the Degrees of Freedom of Finite State Compound Wireless Networks - Settling a Conjecture by Weingarten Et. Al

    The authors explore the Degrees of Freedom (DoF) of three classes of finite state compound wireless networks in this paper. First, they study the Multiple-Input Single-Output (MISO) finite state compound Broadcast Channel (BC) with arbitrary number of users and antennas at the transmitter. In prior work, Weingarten et. al. have...

    Provided By Cornell University

  • White Papers // Sep 2009

    Higher-Dimensional Models of Networks

    Networks are often studied as graphs, where the vertices stand for entities in the world and the edges stand for connections between them. While relatively easy to study, graphs are often inadequate for modeling real-world situations, especially those that include contexts of more than two entities. For these situations, one...

    Provided By Cornell University