Cornell University

Displaying 1-40 of 1070 results

  • White Papers // Mar 2014

    Era of Big Data Processing: A New Approach via Tensor Networks and Tensor Decompositions

    Modern applications such as computational neuroscience, neuroinformatics and pattern/image recognition generate massive amounts of multidimensional data with multiple aspects and high dimensionality. Big data require novel technologies to efficiently process massive datasets within tolerable elapsed times. Such a new emerging technology for multidimensional big data is a multi-way analysis via...

    Provided By Cornell University

  • White Papers // Mar 2014

    Large-Scale Geospatial Processing on Multi-Core and Many-Core Processors: Evaluations on CPUs, GPUs and MICs

    Geospatial Processing, such as queries based on point-to-polyline shortest distance and point-in-polygon test, are fundamental to many scientific and engineering applications, including post-processing large-scale environmental and climate model outputs and analyzing traffic and travel patterns from massive GPS collections in transportation engineering and urban studies. Commodity parallel hardware, such as...

    Provided By Cornell University

  • White Papers // Feb 2014

    Intensional RDB Manifesto: a Unifying NewSQL Model for Flexible Big Data

    In this paper, the authors present a new family of Intensional RDBs (IRDBs) which extends the traditional RDBs with the Big Data and flexible and 'Open schema' features, able to preserve the user-defined relational database schemas and all preexisting user's applications containing the SQL statements for a deployment of such...

    Provided By Cornell University

  • White Papers // Feb 2014

    Distributed Storage over Unidirectional Ring Networks

    In this paper, the authors study distributed storage problems over unidirectional ring networks, whose storage nodes form a directed ring and data is transmitted along the same direction. The original data is distributed to store on these nodes. Each user can connect one and only one storage node to download...

    Provided By Cornell University

  • White Papers // Feb 2014

    Big Data and the SP Theory of Intelligence

    This paper is about how the SP theory of intelligence and its realization in the SP machine may, with advantage, be applied to the management and analysis of big data. The issues which are discussed are general and need to be addressed in any scenario. The SP system introduced in...

    Provided By Cornell University

  • White Papers // Feb 2014

    Erasure-Coded Byzantine Storage with Separate Metadata

    Although many distributed storage protocols have been introduced, a solution that combines the strongest properties in terms of availability, consistency, fault-tolerance, storage complexity and the supported level of concurrency, has been elusive for a long time. Combining these properties is difficult, especially if the resulting solution is required to be...

    Provided By Cornell University

  • White Papers // Feb 2014

    Concept of Feedback in Future Computing Models to Cloud Systems

    Currently, it is urgent to ensure QoS in distributed computing systems. This became especially important to the development and spread of cloud services. Big data structures become heavily distributed. Necessary to consider the communication channels and data transmission systems and virtualization and scalability in future design of computational models in...

    Provided By Cornell University

  • White Papers // Feb 2014

    Towards Optimal Secure Distributed Storage Systems with Exact Repair

    A continuous rise in the volume of data managed across various systems, calls for new storage mechanisms that maintain this data reliably. Distributed storage is the default technique for storing data in all new generation applications. The data from a file is stored in a decentralized manner on several un-reliable...

    Provided By Cornell University

  • White Papers // Feb 2014

    On Block Security of Regenerating Codes at the MBR Point for Distributed Storage Systems

    A passive adversary can eavesdrop stored content or downloaded content of some storage nodes, in order to learn illegally about the file stored across a Distributed Storage System (DSS). Previous work in the literature focuses on code constructions that trade storage capacity for perfect security. In other words, by decreasing...

    Provided By Cornell University

  • White Papers // Feb 2014

    On Heterogeneous Regenerating Codes and Capacity of Distributed Storage Syste

    Heterogeneous Distributed Storage Systems (DSS) are close to real world applications for data storage. Internet caching system and peer-to-peer storage clouds are the examples of such DSS. In this paper, the authors calculate the capacity formula for such systems where each node store different number of packets and each having...

    Provided By Cornell University

  • White Papers // Feb 2014

    Locality and Availability in Distributed Storage

    In this paper, the authors show that it is possible to construct codes that can support a scaling number of parallel reads while keeping the rate to be an arbitrarily high constant. It further shows that this is possible with the minimum distance arbitrarily close to the singleton bound. This...

    Provided By Cornell University

  • White Papers // Feb 2014

    Application of Selective Algorithm for Effective Resource Provisioning in Cloud Computing Environment

    Modern day continued demand for resource hungry services and applications in IT sector has led to development of Cloud computing. Cloud computing environment involves high cost infrastructure on one hand and need high scale computational resources on the other hand. These resources need to be provisioned (allocation and scheduling) to...

    Provided By Cornell University

  • White Papers // Jan 2014

    A Comparison With Two Semantic Sensor Data Storages in Total Data Transmission

    The creation of small and cheap sensors promoted the emergence of large scale sensor networks. Sensor networks allow monitoring a variety of physical phenomena, like weather conditions, traffic levels on highways or rooms occupancy in public buildings. Some of the sensors produce large volume of data such as weather temperature....

    Provided By Cornell University

  • White Papers // Jan 2014

    A Novel Admission Control Model in Cloud Computing

    With the rapid development of cloud computing technologies and wide adopt of cloud services and applications, QoS provisioning in clouds becomes an important research topic. In this paper, the authors propose an admission control mechanism for cloud computing. In particular, they consider the high volume of simultaneous requests for cloud...

    Provided By Cornell University

  • White Papers // Jan 2014

    DDoS Attack and Defense: Review of Some Traditional and Current Techniques

    Distributed Denial of Service (DDoS) attacks exhaust victim's bandwidth or services. Traditional architecture of Internet is vulnerable to DDoS attacks and an ongoing cycle of attack & defense is observed. In this paper, different types and techniques of DDoS attacks and their countermeasures are reviewed. The significance of this paper...

    Provided By Cornell University

  • White Papers // Jan 2014

    New Approaches to Website Fingerprinting Defenses

    Website fingerprinting attacks enable an adversary to infer which website a victim is visiting, even if the victim uses an encrypting proxy, such as Tor. Previous work has shown that all proposed defenses against website fingerprinting attacks are ineffective. This paper advances the study of website fingerprinting attacks and defenses...

    Provided By Cornell University

  • White Papers // Jan 2014

    Unconditional Security of Time-Energy Entanglement Quantum Key Distribution Using Dual-Basis Interferometry

    High-Dimensional Quantum Key Distribution (HDQKD) offers the possibility of high secure-key rate with high photon-information efficiency. The authors consider HDQKD based on the time-energy entanglement produced by spontaneous parametric down conversion, and show that it is secure against collective attacks. Its security rests upon visibility data - obtained from Franson...

    Provided By Cornell University

  • White Papers // Jan 2014

    Enhancing Template Security of Face Biometrics by Using Edge Detection and Hashing

    In this paper, the authors address the issues of using edge detection techniques on facial images to produce cancellable biometric templates and a novel method for template verification against tampering. With increasing use of biometrics, there is a real threat for the conventional systems using face databases, which store images...

    Provided By Cornell University

  • White Papers // Jan 2014

    Cryptanalysis of Multi-Server Authenticated Key Agreement Scheme Based on Trust Computing Using Smart Cards and Biometrics

    Advancement in communication technology provides a scalable platform for various services where a remote user can access the server from anywhere without moving from its place. It has provided a unique opportunity for online services, such that the user need not physically present at the service center. These services adopt...

    Provided By Cornell University

  • White Papers // Jan 2014

    Lightweight and Secure Two-Party Range Queries over Outsourced Encrypted Databases

    With the many benefits of cloud computing, an entity may want to outsource its data and their related analytics tasks to a cloud. When data are sensitive, it is in the interest of the entity to outsource encrypted data to the cloud; however, this limits the types of operations that...

    Provided By Cornell University

  • White Papers // Jan 2014

    A Review of Security Attacks and Intrusion Detection Schemes in Wireless Sensor Network

    Wireless Sensor Networks (WSN) are currently the greatest innovation in the field of telecommunications. WSNs have a wide range of potential applications, including security and surveillance, control, actuation and maintenance of complex systems and fine-grain monitoring of indoor and outdoor environments. However, security is one of the major aspects of...

    Provided By Cornell University

  • White Papers // Jan 2014

    Power Grid Defense Against Malicious Cascading Failure

    An adversary looking to disrupt a power grid may look to target certain substations and sources of power generation to initiate a cascading failure that maximizes the number of customers without electricity. This is particularly an important concern when the enemy has the capability to launch cyber-attacks as practical concerns...

    Provided By Cornell University

  • White Papers // Dec 2013

    Comparative study of Authorship Identification Techniques for Cyber Forensics Analysis

    Authorship Identification techniques are used to identify the most appropriate author from group of potential suspects of online messages and find evidences to support the conclusion. Cybercriminals make misuse of online communication for sending blackmail or a spam email and then attempt to hide their true identities to void detection....

    Provided By Cornell University

  • White Papers // Dec 2013

    Cache-Aware Static Scheduling for Hard Real-Time Multicore Systems Based on Communication Affinities

    The growing need for continuous processing capabilities has led to the development of multicore systems with a complex cache hierarchy. Such multicore systems are generally designed for improving the performance in average case, while hard real-time systems must consider worst-case scenarios. An open challenge is therefore to efficiently schedule hard...

    Provided By Cornell University

  • White Papers // Dec 2013

    Verifying the Consistency of Remote Untrusted Services with Commutative Operations

    A group of mutually trusting clients outsources a computation service to a remote server, which they do not fully trust and that may be subject to attacks. The clients do not communicate with each other and would like to verify the correctness of the remote computation and the consistency of...

    Provided By Cornell University

  • White Papers // Nov 2013

    Scalable Data Cube Analysis over Big Data

    Data cubes are widely used as a powerful tool to provide multidimensional views in data warehousing and On-Line Analytical Processing (OLAP). However, with increasing data sizes, it is becoming computationally expensive to perform data cube analysis. The problem is exacerbated by the demand of supporting more complicated aggregate functions (e.g....

    Provided By Cornell University

  • White Papers // Nov 2013

    Limits of Extractability Assumptions with Distributional Auxiliary Input

    Extractability, or \"Knowledge\", assumptions (such as the \"Knowledge-of-exponent\" assumption) have recently gained popularity in the cryptographic community - leading to the study of primitives such as extractable one-way functions, extractable hash functions, Succinct Non-interactive ARguments of Knowledge (SNARKs), and extractable obfuscation, and spurring the development of a wide spectrum of...

    Provided By Cornell University

  • White Papers // Nov 2013

    Big Data Analytics in Future Internet of Things

    Current research on Internet of Things (IoT) mainly focuses on how to enable general objects to see, hear, and smell the physical world for themselves, and make them connected to share the observations. In this paper, the authors argue that only connected is not enough, beyond that, general objects should...

    Provided By Cornell University

  • White Papers // Nov 2013

    On the Inequality of the 3V's of Big Data Architectural Para-Digms: A Case for Heterogeneity

    The well-known 3V architectural paradigm for Big Data introduced by Laney (2011) provides a simplified framework for defining the architecture of a big data platform to be deployed in various scenarios tackling processing of massive datasets. While additional components such as Variability and Veracity have been discussed as an extension...

    Provided By Cornell University

  • White Papers // Nov 2013

    A Big Data Approach to Computational Creativity

    Computational creativity is an emerging branch of artificial intelligence that places computers in the center of the creative process. Broadly, creativity involves a generative step to produce many ideas and a selective step to determine the ones that are the best. Many previous attempts at computational creativity, however, have not...

    Provided By Cornell University

  • White Papers // Oct 2013

    Analyzing Big Data with Dynamic Quantum Clustering

    How does one search for a needle in a multi-dimensional haystack without knowing what a needle is and without knowing if there is one in the haystack? This kind of problem requires a paradigm shift - away from hypothesis driven searches of the data - towards a methodology that lets...

    Provided By Cornell University

  • White Papers // Oct 2013

    EPOBF: Energy Efficient Allocation of Virtual Machines in High Performance Computing Cloud

    Cloud computing has become more popular in provision of computing resources under Virtual Machine (VM) abstraction for High Performance Computing (HPC) users to run their applications. A HPC cloud is such cloud computing environment. One of challenges of energy-efficient resource allocation for VMs in HPC cloud is trade-off between minimizing...

    Provided By Cornell University

  • White Papers // Oct 2013

    Hopping over Big Data: Accelerating Ad-hoc OLAP Queries with Grasshopper Algorithms

    This paper presents a family of algorithms for fast subset filtering within ordered sets of integers representing composite keys. Applications include significant acceleration of (ad-hoc) analytic queries against a data warehouse without any additional indexing. The algorithms work for point, range and set restrictions on multiple attributes, in any combination,...

    Provided By Cornell University

  • White Papers // Oct 2013

    Reliability Models for Highly Fault-Tolerant Storage Systems

    The authors found that a reliability model commonly used to estimate Mean-Time-To-Data-Loss (MTTDL), while suitable for modeling RAID 0 and RAID 5, fails to accurately model systems having a fault-tolerance greater than 1. Therefore, to model the reliability of RAID 6, Triple-Replication, or k-of-n systems requires an alternate technique. In...

    Provided By Cornell University

  • White Papers // Oct 2013

    Load Balancing Using Ant Colony in Cloud Computing

    Ants are very small insects. They are capable to find food even they are complete blind. The ants live in their nest and their job is to search food while they get hungry. The authors are not interested in their living style, such as how they live, how they sleep....

    Provided By Cornell University

  • White Papers // Sep 2013

    Design of Generic Framework for Botnet Detection in Network Forensics

    With the raise in practice of Internet, in social, personal, commercial and other aspects of life, the cybercrime is as well escalating at an alarming rate. Such usage of Internet in diversified areas also augmented the illegal activities, which in turn, bids many network attacks and threats. Network forensics is...

    Provided By Cornell University

  • White Papers // Sep 2013

    EsPRESSo: Efficient Privacy-Preserving Evaluation of Sample Set Similarity

    Electronic information is increasingly often shared among entities without complete mutual trust. To address related security and privacy issues, a few cryptographic techniques have emerged that support privacy-preserving information sharing and retrieval. One interesting open problem in this context involves two parties that need to assess the similarity of their...

    Provided By Cornell University

  • White Papers // Sep 2013

    Efficient Batched Synchronization in Dropbox-Like Cloud Storage Services

    As tools for personal storage, file synchronization and data sharing, cloud storage services such as Dropbox have quickly gained popularity. These services provide users with ubiquitous, reliable data storage that can be automatically synced across multiple devices, and also shared among a group of users. To minimize the network overhead,...

    Provided By Cornell University

  • White Papers // Sep 2013

    Unmixing Incoherent Structures of Big Data by Randomized or Greedy Decomposition

    Learning big data by matrix decomposition always suffers from expensive computation, mixing of complicated structures and noise. In this paper, the authors study more adaptive models and efficient algorithms that decompose a data matrix as the sum of semantic components with incoherent structures. They firstly introduce \"GO Decomposition (GoDec)\", an...

    Provided By Cornell University

  • White Papers // Sep 2013

    Knowledge-Based Expressive Technologies Within Cloud Computing Environments

    In this paper, the authors describe the development of comprehensive approach for knowledge processing within e-Sceince tasks. Considering the task solving within a simulation-driven approach a set of knowledge-based procedures for task definition and composite application processing can be identified. This procedure could be supported by the use of domain-specific...

    Provided By Cornell University

  • White Papers // Dec 2013

    Cache-Aware Static Scheduling for Hard Real-Time Multicore Systems Based on Communication Affinities

    The growing need for continuous processing capabilities has led to the development of multicore systems with a complex cache hierarchy. Such multicore systems are generally designed for improving the performance in average case, while hard real-time systems must consider worst-case scenarios. An open challenge is therefore to efficiently schedule hard...

    Provided By Cornell University

  • White Papers // Jan 2012

    Energy Balancing Through Cluster Head Selection Using K-Theorem in Homogeneous Wireless Sensor Networks

    The objective of this paper is to increase life time of homogeneous Wireless Sensor Networks (WSNs) through minimizing long range communication and energy balancing. Sensor nodes are resource constrained particularly with limited energy that is difficult o r impossible to replenish. LEACH (Low Energy Adaptive Clustering Hierarchy) is most well...

    Provided By Cornell University

  • White Papers // Jul 2009

    A New Approach to Services Differentiation Between Mobile Terminals of a Wireless LAN

    This paper aims to identify the advantages and disadvantages of several mechanisms for service differentiation in mobile terminals of a wireless LAN to establish a better and more efficient network. According to the analysis of available approaches for the quality of service of the IEEE 802.11 standard, this paper is...

    Provided By Cornell University

  • White Papers // Sep 2012

    ShadowDB: A Replicated Database on a Synthesized Consensus Core

    This paper describes ShadowDB, a replicated version of the BerkeleyDB database. ShadowDB is a primary-backup based replication protocol where failure handling, the critical part of the protocol, is taken care of by a synthesized consensus service that is correct by construction. The service has been proven correct semi-automatically by the...

    Provided By Cornell University

  • White Papers // Dec 2012

    How Many Software Engineering Professionals Hold This Certificate?

    Estimates of quantity of the certificates issued during 10 years of existence of the professional's certification program in the area of software engineering implemented by one of the leading professional associations are presented. The estimates have been obtained by way of processing certificate records openly accessible at the certification program...

    Provided By Cornell University

  • White Papers // Oct 2011

    The Study and Approach of Software Re-Engineering

    The nature of software re-engineering is to improve or transform existing software so it can be understood, controlled and reused as new software. Needs, the necessity of re-engineering software has greatly increased. The system software has become obsolete no longer used in architecture, platform they're running, stable and consistent they...

    Provided By Cornell University

  • White Papers // Apr 2012

    Software Engineering and Complexity in Effective Algebraic Geometry

    One may represent polynomials not only by their coefficients but also by arithmetic circuits which evaluate them. This idea allowed in the last fifteen years considerable complexity progress in effective polynomial equation solving. The authors present a circuit based computation model which captures all known symbolic elimination algorithms in effective...

    Provided By Cornell University

  • White Papers // Mar 2013

    Testing Java implementations of Algebraic Specifications

    In this paper, the authors focus on exploiting a specification and the structures that satisfy it, to obtain a means of comparing implemented and expected behaviors and find the origin of faults in implementations. They present an approach to the creation of tests that are based on those specification-compliant structures,...

    Provided By Cornell University

  • White Papers // May 2012

    Advanced Digital Steganography using Encrypted Secret Message and Encrypted Embedded Cover File

    In this paper, the authors are proposing a new steganography method to hide any encrypted secret message in multiple steps. The secret message is encrypted using TTJSA algorithm. The authors embed this encrypted message inside one known image or audio file using 4-th bit from LSB substitution method. They again...

    Provided By Cornell University

  • White Papers // Jan 2013

    A New Metric for Routing in Multi-Hop Wireless Sensor Networks for Detection of Correlated Random Fields

    The problem of combining task performance and routing for the detection of correlated random fields using multi-hop wireless sensor networks is considered. Under the assumption of Gauss-Markov structure along a given route, a link metric that captures the detection performance associated with a route is derived. Under Bayesian formulation Chernoff...

    Provided By Cornell University

  • White Papers // Jul 2012

    Reputation Algebra for Cloud-Based Anonymous Data Storage Systems

    Given a cloud-based anonymous data storage system, there are two ways for managing the nodes involved in file transfers. One of them is using reputations and the other uses a micropayment system. In reputation-based approach, each node has a reputation associated with it, which is used as a currency or...

    Provided By Cornell University

  • White Papers // Mar 2013

    Enhanced Security for Cloud Storage Using File Encryption

    Cloud computing is a term coined to a network that offers incredible processing power, a wide array of storage space and unbelievable speed of computation. Social media channels, corporate structures and individual consumers are all switching to the magnificent world of cloud computing. The flip side to this coin is...

    Provided By Cornell University

  • White Papers // Aug 2012

    Integration of SOA and Cloud Computing in RMODP

    The objective of ODP is according to ITU-T Recommendation X.901 stated as follows: "The objective of ODP standardization is the development of standards that allow the benefits of distributing information processing services to be realized in an environment of heterogeneous IT resources and multiple organizational domains. These standards address constraints...

    Provided By Cornell University

  • White Papers // Feb 2013

    A Genetic Algorithm for Power-Aware Virtual Machine Allocation in Private Cloud

    Energy efficiency has become an important measurement of scheduling algorithm for private cloud. The challenge is trade-off between minimizing of energy consumption and satisfying Quality of Service (QoS) (e.g. performance or resource availability on time for reservation request). The authors consider resource needs in context of a private cloud system...

    Provided By Cornell University

  • White Papers // Feb 2013

    On Weak Dress Codes for Cloud Storage

    In a distributed storage network, reliability and bandwidth optimization can be provided by regenerating codes. Recently table based regenerating codes viz. DRESS (Distributed Replication-based Exact Simple Storage) codes has been proposed which also optimizes the disk I/O. Dress codes consists of an outer MDS code with an inner Fractional Repetition...

    Provided By Cornell University

  • White Papers // Jan 2013

    CloudSVM : Training an SVM Classi Er in Cloud Computing Systems

    In conventional method, distributed Support Vector Machines (SVM) algorithms are trained over pre-configured intranet/internet environments to find out an optimal classifier. These methods are very complicated and costly for large datasets. Hence, the authors propose a method that is referred as the Cloud SVM training mechanism (CloudSVM) in a cloud...

    Provided By Cornell University

  • White Papers // Mar 2013

    Closed-Form Rate Outage Probability for OFDMA Multi-Hop Broadband Wireless Networks Under Nakagami-m Channels

    Rate outage probability is an important performance metric to measure the level of Quality of Service (QoS) in the Generation (4G) broadband access networks. Thus, in this paper, the authors calculate a closed form expression of the rate outage probability for a given user in a down-link multi-hop OFDMA based...

    Provided By Cornell University

  • White Papers // Mar 2013

    Adaptive Energy-Aware Encoding for DWT-Based Wireless EEG Monitoring System

    Wireless ElectroencephaloGraphy (EEG) tele-monitoring systems performing encoding and streaming over energy-hungry wireless channels are limited in energy supply. However, excessive power consumption either in encoding or radio channels may render some applications inapplicable. Hence, energy efficient methods are needed to improve such applications. In this paper, an embedded EEG encoding...

    Provided By Cornell University

  • White Papers // Mar 2013

    A Practical System for Improved Efficiency in Frequency Division Multiplexed Wireless Networks

    Spectral efficiency is a key design issue for all wireless communication systems. Orthogonal Frequency Division Multiplexing (OFDM) is a very well-known technique for efficient data transmission over many carriers overlapped in frequency. Recently, several papers have appeared which describe spectrally efficient variations of multi-carrier systems where the condition of orthogonality...

    Provided By Cornell University

  • White Papers // Jan 2013

    Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Networks

    Energy efficiency is the most important issue in all facets of Wireless Sensor Networks (WSNs) operations because of the limited and non-replenish able energy supply. Data aggregation mechanism is one of the possible solutions to prolong the life time of sensor nodes and on the other hand it also helps...

    Provided By Cornell University

  • White Papers // Mar 2013

    Wireless Information and Power Transfer: Energy Efficiency Optimization in OFDMA Systems

    In this paper, the authors consider Orthogonal Frequency Division Multiple Access (OFDMA) systems with simultaneous wireless information and power transfer. They study the resource allocation algorithm design for maximization of the energy efficiency of data transmission (bits/Joule delivered to the receivers). In particular, they focus on power splitting hybrid receivers...

    Provided By Cornell University

  • White Papers // Mar 2013

    Low-Complexity Channel Estimation with Set-Membership Algorithms for Cooperative Wireless Sensor Networks

    In this paper, the authors consider a general cooperative Wireless Sensor Network (WSN) with multiple hops and the problem of channel estimation. Two matrix-based set-membership algorithms are developed for the estimation of the complex matrix channel parameters. The main goal is to reduce the computational complexity significantly as compared with...

    Provided By Cornell University

  • White Papers // Mar 2013

    Secure Wireless Communications via Cooperative Transmitting

    Information theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to exchange a secret key with a new receiver at a random location, in the presence of passive eavesdroppers at...

    Provided By Cornell University

  • White Papers // Jan 2013

    Efficient Compressive Sampling of Spatially Sparse Fields in Wireless Sensor Networks

    Wireless Sensor Networks (WSN), i.e. networks of autonomous, wireless sensing nodes spatially deployed over a geographical area, are often faced with acquisition of spatially sparse fields. In this paper, the authors present a novel bandwidth/energy efficient CS scheme for acquisition of spatially sparse fields in a WSN. The paper contribution...

    Provided By Cornell University

  • White Papers // Jul 2011

    A Novel Algorithm for Crypto Key Generation by Unification of Encoding Plus Image Pixel Shuffling and Chaotic Blended Blum Blum Shub Generator and Its Applicability in Image Based Cryptosystems

    The use of the data exchange in e-way along with the tremendous growth in ecommerce and m-commerce has created an intense demand for information security. Information security becomes very significant in data storage and transmission. However, widespread popularity of wireless data communication gadgets, integrated with the availability of higher bandwidths,...

    Provided By Cornell University

  • White Papers // Jul 2012

    A Review of Routing Protocols for Mobile Cognitive Radio Ad Hoc Networks

    Ad hoc network is a collection of wireless mobile nodes that dynamically form a temporary network without the use of any existing network infrastructure or centralized administration. A cognitive radio is a radio that can change its transmitter parameters based on interaction with the environment in which it operates. The...

    Provided By Cornell University

  • White Papers // Jun 2012

    Live Network Streaming With Utilities and Cost

    The growth in Internet traffic associated with video streaming and sharing of videos is so rapid that it may soon dwarf all other forms of Internet content. One reason for this is that only some forms of content can be cached (such as movies). Data generated in real time such...

    Provided By Cornell University

  • White Papers // Apr 2011

    Extracting Device Fingerprints From Flash Memory by Exploiting Physical Variations

    Many computing applications require the ability to uniquely identify a particular electronic device. Personalized services, digital rights management, and authentication schemes can all leverage per-device identifiers that are difficult (or impossible) to forge. At the same time, the growing economic importance and popularity of electronic devices has provided criminals with...

    Provided By Cornell University

  • White Papers // Feb 2010

    Wireless Congestion Control Protocol for Multihop Ad Hoc Networks

    The traditional TCP congestion control mechanism encounters a number of new problems and suffers a poor performance when the IEEE 802.11 MAC protocol is used in multihop ad hoc networks. Many of the problems result from medium contention at the MAC layer. In this paper, the authors first illustrate that...

    Provided By Cornell University

  • White Papers // Mar 2013

    An Overview of Wireless Local Area Networks

    Wireless communication is an application of science and technology that has come to be vital for modern existence. From the early radio and telephone to current devices such as mobile phones and laptops, accessing the global network has become the most essential and indispensable part of the authors' lifestyle. Wireless...

    Provided By Cornell University

  • White Papers // Mar 2013

    Schema Formalisms for Unordered XML

    The authors consider unordered XML, where the relative order among siblings is ignored, and propose two simple yet practical schema formalisms: Disjunctive Multiplicity Schemas (DMS), and its restriction, disjunction-free Multiplicity Schemas (MS). They investigate their computational properties and characterize the complexity of the following static analysis problems: schema satisfiability, membership...

    Provided By Cornell University

  • White Papers // Mar 2013

    Improving Network Efficiency by Removing Energy Holes in WSNs

    Cluster based Wireless Sensor Networks (WSNs) have been widely used for better performance in terms of energy efficiency. Efficient use of energy is challenging task of designing these protocols. Energy holedare created due to quickly drain the energy of a few nodes due to non-uniform distribution in the network. Normally,...

    Provided By Cornell University

  • White Papers // Mar 2013

    Z-SEP: Zonal-Stable Election Protocol for Wireless Sensor Networks

    Wireless Sensor Networks (WSNs) are comprised of thousands of sensor nodes, with restricted energy, that co-operate to accomplish a sensing task. Various routing Protocols are designed for transmission in WSNs. In this paper, the authors proposed a hybrid routing protocol: Zonal-Stable Election Protocol (Z-SEP) for heterogeneous WSNs. In this protocol,...

    Provided By Cornell University

  • White Papers // Mar 2013

    Link Scheduling for Multiple Multicast Sessions in Distributed Wireless Networks

    In this paper, the authors investigate link scheduling algorithms for throughput maximization in multicast wireless networks. According to their system model, each source node transmits to a multicast group that resides one hop away. They adopt the physical interference model to reflect the aggregate Signal to Interference and Noise Ratio...

    Provided By Cornell University

  • White Papers // Nov 2012

    Intrusion Detection on Smartphones

    Smartphone technology is more and more becoming the predominant communication tool for people across the world. People use their smartphones to keep their contact data, to browse the internet, to exchange messages, to keep notes, carry their personal files and documents, etc. Users while browsing are also capable of shopping...

    Provided By Cornell University

  • White Papers // Sep 2012

    The Curious Case of Non-Interactive Commitments

    It is well-known that one-way permutations (and even one-to-one one-way functions) imply the existence of non-interactive commitments. Furthermore the construction is black-box (i.e., the underlying one-way function is used as an oracle to implement the commitment scheme, and an adversary attacking the commitment scheme is used as an oracle in...

    Provided By Cornell University

  • White Papers // Jul 2012

    The Half-Duplex AWGN Single-Relay Channel: Full Decoding or Partial Decoding?

    This paper compares the partial-decode-forward and the complete-decode-forward coding strategies for the half-duplex Gaussian single-relay channel. The authors analytically show that the rate achievable by partial-decode-forward outperforms that of the more straightforward complete-decode-forward by at most 12.5%. Furthermore, in the following asymptotic cases, the gap between the partial-decode-forward and the...

    Provided By Cornell University

  • White Papers // Dec 2012

    Demand Shaping to Achieve Steady Electricity Consumption With Load Balancing in a Smart Grid

    The purpose of this paper is to study conflicting objectives between the grid operator and consumers in a future smart grid. Traditionally, customers in electricity grids have different demand profiles and it is generally assumed that the grid has to match and satisfy the demand profiles of all its users....

    Provided By Cornell University

  • White Papers // Aug 2011

    Capacity of Strong and Very Strong Gaussian Interference Relay-Without-Delay Channels

    In this paper, the authors study the interference relay-without-delay channel which is an interference channel with a relay helping the communication. They assume the relay's transmit symbol depends not only on its past received symbols but also on its current received symbol, which is an appropriate model for studying amplify-and-forward...

    Provided By Cornell University

  • White Papers // Oct 2011

    Capacity of a Class of Multicast Tree Networks

    In this paper, the authors characterize the capacity of a new class of single-source multicast discrete memoryless relay networks having a tree topology in which the root node is the source and each parent node in the graph has at most one noisy child node and any number of noiseless...

    Provided By Cornell University