Rensselaer Polytechnic Institute

Displaying 1-40 of 77 results

  • White Papers // Jan 2012

    An End-to-End Transport Protocol for Extreme Wireless Network Environments

    As the Joint forces move towards the vision of Network-Centric Warfare (NCW), it is extremely important that the network services be reliable and dependable, even under degraded network conditions. Tactical wireless and satellite based networks are prone to disruptions over multiple time-scales: bursty bit errors and packet loss (small time-scale),...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2011

    Bio-Inspired Multi-Period Routing Algorithms in Delay Tolerant Networks

    In this paper, inspired by the impact of incubation period on epidemic dynamics, the authors present a class of routing algorithms for Delay Tolerant Networks (DTN) in which the copies or coded blocks of messages are distributed to other nodes in multiple periods. The authors' objective is to minimize the...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jul 2011

    VTL Zone-Aware Path Cloaking Algorithm

    Traffic engineering applications often benefit from collecting vehicle GPS traces in well-defined locations. As a motivating example, the authors will consider a traffic signal performance evaluation technique which requires GPS traces of vehicles traversing intersections. Since these applications do not require vehicle identity information, they are a good candidate for...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jul 2011

    Evaluation of Privacy Preserving Algorithms Using Traffic Knowledge Based Adversary Models

    By providing location traces of individual vehicles, mobile traffic sensors have quickly emerged as an important data source for traffic applications. In dealing with the privacy issues associated with this, researchers have been proposing different privacy protection algorithms. In this paper, the authors propose traffic-knowledge-based adversary models to attack privacy...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jul 2011

    Parallel I/O Performance for Application-Level Checkpointing on the Blue Gene/P System

    As the number of processors increases to hundreds of thousands in parallel computer architectures, the failure probability rises correspondingly, making fault tolerance a highly important and challenging task. Application-level check-pointing is one of the most popular techniques to proactively deal with unexpected failures because of its portability and flexibility. During...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // May 2011

    On Secure Multi-Copy Based Routing in Compromised Delay Tolerant Networks

    Routing in Delay Tolerant Networks (DTNs) is challenging due to their unique characteristics of intermittent node connectivity. Different protocols (single-copy, multi-copy, erasure-coding-based etc.) utilizing store-carry-and-forward paradigm are proposed to achieve routing of messages in such environments by opportunistic message exchanges between nodes that are in the communication range of each...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Mar 2011

    Efficient Structure Learning of Bayesian Networks Using Constraints

    This paper addresses the problem of learning Bayesian network structures from data based on score functions that are decomposable. It describes properties that strongly reduce the time and memory costs of many known methods without losing global optimality guarantees. These properties are derived for different score criteria such as Minimum...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Feb 2011

    Energy-Efficient Location Service Protocols for Mobile Ad Hoc Networks

    Location-based routing protocols are stateless since they rely on position information in forwarding decisions. However, their efficiency depends on performance of location services which provide the position information of the desired destination node. Although several location service schemes have been proposed, their main goal is merely to find the location...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jan 2011

    Joint Problem of Power Optimal Connectivity and Coverage in Wireless Sensor Networks

    This work considers a multi-hop sensor network which is comprised of a large number of sensor nodes communicating with RF links. The authors assume that sensor nodes are deployed in an ad-hoc fashion to cover a specified area with their sensing capabilities. Sensors monitor, sense and collect data from a...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jan 2011

    Survey of Peer-to-Peer Systems

    Over the past decade, Peer-To-Peer systems (P2P) have gained an increasing popularity among the Internet community. Although the P2P concept is as old as the creation of the Internet itself, it has been given recently a paramount attention by researchers from various computer science fields. P2P systems provide a paradigm...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jan 2011

    Scheduling Algorithms for Point-to-Multipoint Operation in IEEE 802.16 Networks

    The authors study the resource allocation problem in OFDMA based 802.16 broadband wireless access systems. Frequency and time resources must be allocated by a central controller (Base Station) to a number of users. They consider variations of a resource allocation problem, some of which are difficult to solve. Situations in...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jan 2011

    Impact of Social Networks in Delay Tolerant Routing

    Delay Tolerant Networks (DTNs) are wireless networks in which at any given time instance, the probability of having a complete path from a source to destination is low due to the intermittent connectivity between nodes. Several routing schemes have been proposed for such networks to make the delivery of messages...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jan 2011

    Balancing Cost-Quality Tradeoff in Cooperative Ad Hoc Sensor Networks

    In wireless ad hoc and sensor networks, each node is capable of functioning using only its local information about the environment. However, such a node can reach only locally optimal decisions that may prevent the network from ever reaching the global optimum performance for the given application. To avoid this...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jan 2011

    Minimizing Average Spraying Cost for Routing in Delay Tolerant Networks

    In this paper, the authors study cost efficient multi-copy spraying algorithm for routing in Delay Tolerant Networks (DTN) in which source-to-destination path does not exist most of the time. They present a novel idea and the corresponding algorithm for achieving the average minimum cost of packet transmission while maintaining the...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jan 2011

    Time Dependent Message Spraying for Routing in Intermittently Connected Networks

    Intermittently connected mobile networks, also called Delay Tolerant Networks (DTN) are wireless networks in which at any given time instance, the probability of having a complete path from a source to destination is low. Several routing algorithms are proposed for such networks based on flooding and erasure coding techniques. Since...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Dec 2010

    Behavioral Economics, Neuroeconomics, And Climate Change Policy: Baseline Review For The Garrison Institute Initiative On Climate Change Leadership

    In spite of the increasing scientific certainty that the earth's climate is warming and that human activity is partially responsible, public willingness to take steps to reduce greenhouse gas emissions seems to be decreasing. How can the scientific consensus as to the urgency of the climate change problem be conveyed...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Dec 2010

    Discounting, Ethics, And Options For Maintaining Biodiversity And Ecosystem Integrity

    This paper presents the economic logic behind the concept of discounting the future and discusses how it applies to biodiversity conservation. How should economists account for the effects of biodiversity and ecosystem losses in the immediate and distant future? The authors discuss how to integrate traditional cost-benefit analysis with other...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Nov 2010

    The Relevance Of Evolutionary Science For Economic Theory And Policy

    This white paper emphasizes the relevance of evolutionary science as a way to integrate the SBE sciences, similar to the integration that is more advanced in the biological sciences. Modern evolutionary science is broadly construed to include cultural in addition to biological evolution and the study of neural and psychological...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Oct 2010

    Do Government Deficits Crowd Out Consumer And Investment Spending?

    This paper econometrically tests whether deficits financed by government borrowing "Crowd out" business and consumer spending reductions by reducing credit availability. To test the hypothesis, the government deficit variables are added to consumption and investment models to see if they increase explained variance, negatively impact consumption and investment spending, and...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Oct 2010

    Sectors May Use Multiple Technologies Simultaneously: The Rectangular Choice-Of-Technology Model With Binding Factor Constraints

    The authors develop the rectangular choice-of-technology model with factor constraints, or RCOT, for analysis of the economy of a single region, or of multiple regions in the context of a model of the world economy. RCOT allows for one or more sectors to operate more than one technology simultaneously, using...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Sep 2010

    Efficient Computation Of Optimal Trading Strategies

    Given the return series for a set of instruments, a trading strategy is a switching function that transfers wealth from one instrument to another at specified times. The authors present efficient algorithms for constructing (ex-post) trading strategies that are optimal with respect to the total return, the Sterling ratio and...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Sep 2010

    Relational Algebra Coarse Grained Query Cost Models for DDFDs

    This paper defines a number of Query models used to visualize and explore the performance of Relational Algebra queries evaluated in a Dynamic, Distributed and Federated Database with a number of distinct network topologies. Query costs are modelled at a coarse grained level, using a small number of parameters and...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Sep 2010

    High Efficiency, High Switching Speed, AlGaAs/Gaas P-HEMT DC-DC Converter for Integrated Power Amplifier Modules

    In wireless communication systems, the efficiency of the Radio Frequency Power Amplifiers (RF-PA) dominates the power consumption of the radio transceiver. In addition, to improve spectral efficiency of communication standards, non-constant envelope modulations with high peak to average signal variations are being adopted. This translates to strict requirements on the...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2010

    Service Discovery for Delay Tolerant Networks

    Service discovery is an essential step in deploying many wireless network applications. The design of service discovery protocols is particularly challenging for mobile wireless networks because of their dynamic and unstructured nature. Most of the previously proposed protocols are based on the assumption that there exists an end-to-end connection from...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2010

    A Formal Context Representation Framework for Network-Enabled Cognition

    Network-accessible resources are inherently contextual with respect to the specific situations (e.g., location and default assumptions) in which they are used. Therefore, the explicit conceptualization and representation of contexts is required to address a number of problems in Network-Enabled Cognition (NEC). The authors propose a context representation framework to address...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2010

    Static Analysis for Understanding Shared Objects in Open Concurrent Java Programs

    Concurrent programming with shared memory in an object-oriented language such as Java is notoriously difficult. Therefore, it is important to study new program understanding techniques for concurrent object-oriented languages. This paper studies shared objects in open concurrent Java programs. First, it proposes a classification of shared objects into three categories:...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2010

    Optimally Increasing Secure Connectivity in Multi-Hop Wireless Ad Hoc Networks

    This paper considers the problem of how to maximize secure connectivity of multi-hop wireless ad hoc networks after deployment. Two approaches, based on graph augmentation problems with nonlinear edge costs, are formulated. The first one is based on establishing a secret key using only the links that are already secured...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2010

    An Energy Efficient Dynamic Location Server Hierarchy for Mobile Ad Hoc Networks

    By using position information in forwarding decisions, location based routing protocols for mobile networks are stateless and efficient. However, they are heavily dependent on location services which provide the position information of the desired destination node. Although several location service schemes have been proposed, their main goal is just to...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2010

    Dynamic Composition of Services in Sensor Networks and Its Implementation Under Sensor Fabric

    Service modeling and composition is a fundamental method for offering advanced functionality by combining a set of primitive services provided by the system. Unlike in the case of web services for which there is an abundance of reliable resources, in sensor networks, the resources are constrained and communication among nodes...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jul 2010

    Sensors as a Service Oriented Architecture: Middleware for Sensor Networks

    There is a significant challenge in designing, optimizing, deploying and managing complex sensor networks over heterogeneous communications infrastructures. The ITA Sensor Fabric addresses these challenges in the areas of sensor identification and discovery, sensor access and control, and sensor data consumable, by extending the message bus model commonly found in...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jul 2010

    A Model-Driven Approach to the Construction, Composition and Analysis of Services on Sensor Networks

    This paper investigates the application of model-driven techniques to the construction and composition of services on sensor networks. The authors present a model that gives the user a visual representation of a service, that can be annotated with semantic information (for example performance characteristics, deployment constraints, policies and rules, etc.)...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jul 2010

    Efficient Routing in Delay Tolerant Networks With Correlated Node Mobility

    In a Delay Tolerant Network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path from source to destination is unlikely to exist, message delivery relies on opportunistic routing. However, effective forwarding based on a limited knowledge of contact...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // May 2010

    Cost Efficient Erasure Coding Based Routing in Delay Tolerant Networks

    Routing in Delay Tolerant Networks (DTNs) in which most of the nodes are mobile and intermittently connected is a challenging problem because of unpredictable node movements and lack of knowledge of future node connections. To ensure reliability against failures and increase the success rate of delivery, erasure coding technique is...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // May 2010

    The Effect of Neighbor Graph Connectivity on Coverage Redundancy in Wireless Sensor Networks

    Coverage redundancy problem is one of the significant problems in wireless sensor networks. To reduce the energy consumption that arises when the high number of sensors is active, various coverage control protocols (sleep scheduling algorithms) have been proposed. In these protocols, a subset of nodes necessary to maintain sufficient sensing...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Apr 2010

    Owl: sameAs and Linked Data: An Empirical Study

    Linked Data is a steadily growing presence on the Web. In Linked Data, the description of resources can be obtained incrementally by dereferencing the URIs of resources via the HTTP protocol. The use of owl:sameAs further enriches the Linked Data space by declaratively supporting distributed semantic data integration at the...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Apr 2010

    An Energy Efficient Location Service for Mobile Ad Hoc Networks

    Location based routing protocols are heavily dependent on location services which provide the position information of the desired destination node. Seldom location service schemes include energy efficiency metrics when evaluating their performance in forwarding location update and query packets. The authors propose a novel location service that aims at decreasing...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Apr 2010

    Comparison of Object-Oriented and Functional Programming for Code Generation

    Creating software systems begins with creating abstractions that model the problem and/or solution. The most popular paradigm for creating these abstractions is Object-Oriented Programming (OOP), but Functional Programming (FP) is gaining traction. Functional programs are reputedly easier to reason about, simpler to understand, and friendlier to concurrency. Computer Build is...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Apr 2010

    Conditional Shortest Path Routing in Delay Tolerant Networks

    Delay tolerant networks are characterized by the sporadic connectivity between their nodes and therefore the lack of stable end-to-end paths from source to destination. Since the future node connections are mostly unknown in these networks, opportunistic forwarding is used to deliver messages. However, making effective forwarding decisions using only the...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Apr 2010

    Measuring Behavioral Trust in Social Networks

    Trust is an important yet complex and little understood dyadic relation among actors in a social network. There are many dimensions to trust; trust plays an important role in the formation of communities in social networks, in assessing quality and credibility of information as well as in determining how information...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Mar 2010

    PCFG Based Synthetic Mobility Trace Generation

    This paper introduces a novel method of generating mobility traces based on Probabilistic Context Free Grammars (PCFGs). A PCFG is a generalization of a context free grammar in which each production rule is augmented with a probability with which this production is applied during sentence generation. A concise PCFG can...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Dec 2010

    Behavioral Economics, Neuroeconomics, And Climate Change Policy: Baseline Review For The Garrison Institute Initiative On Climate Change Leadership

    In spite of the increasing scientific certainty that the earth's climate is warming and that human activity is partially responsible, public willingness to take steps to reduce greenhouse gas emissions seems to be decreasing. How can the scientific consensus as to the urgency of the climate change problem be conveyed...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Apr 2010

    Comparison of Object-Oriented and Functional Programming for Code Generation

    Creating software systems begins with creating abstractions that model the problem and/or solution. The most popular paradigm for creating these abstractions is Object-Oriented Programming (OOP), but Functional Programming (FP) is gaining traction. Functional programs are reputedly easier to reason about, simpler to understand, and friendlier to concurrency. Computer Build is...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Apr 2010

    Measuring Behavioral Trust in Social Networks

    Trust is an important yet complex and little understood dyadic relation among actors in a social network. There are many dimensions to trust; trust plays an important role in the formation of communities in social networks, in assessing quality and credibility of information as well as in determining how information...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2009

    Active Attacks Against Modulation-Based Radiometric Identification

    Radiometric identification is a recently coined term that describes a broad category of techniques for determining the identity of a wireless device based on unique characteristics of its transmitted signal that result from imperfections and variances in the device's manufacturing processes. Existing techniques are based on extracting and classifying features...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2010

    Static Analysis for Understanding Shared Objects in Open Concurrent Java Programs

    Concurrent programming with shared memory in an object-oriented language such as Java is notoriously difficult. Therefore, it is important to study new program understanding techniques for concurrent object-oriented languages. This paper studies shared objects in open concurrent Java programs. First, it proposes a classification of shared objects into three categories:...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Feb 2009

    Practical Static Analysis for Inference of Security-Related Program Properties

    The authors present a static analysis framework for inference of security-related program properties. Within this framework the authors design and implement ownership, immutability and information flow inference analyses for Java. They perform empirical investigation on a set of Java components, and on a set of established security benchmarks. The results...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // May 2008

    Recursive Data Mining for Author and Role Identification

    Like paintings and verbal dialogues, written documents exhibit the author's distinctive style and identification of the author of an anonymous document is an important and challenging task in computer security. Even more challenging is identification of a style of a group of diverse individuals acting in similar circumstances, like authors...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Apr 2010

    Owl: sameAs and Linked Data: An Empirical Study

    Linked Data is a steadily growing presence on the Web. In Linked Data, the description of resources can be obtained incrementally by dereferencing the URIs of resources via the HTTP protocol. The use of owl:sameAs further enriches the Linked Data space by declaratively supporting distributed semantic data integration at the...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jan 2011

    Joint Problem of Power Optimal Connectivity and Coverage in Wireless Sensor Networks

    This work considers a multi-hop sensor network which is comprised of a large number of sensor nodes communicating with RF links. The authors assume that sensor nodes are deployed in an ad-hoc fashion to cover a specified area with their sensing capabilities. Sensors monitor, sense and collect data from a...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Oct 2009

    A Semantic Wiki Based Light-Weight Web Application Model

    Wikis are a well-known Web 2.0 content management platform. The recent introduction of semantic wikis extends the capabilities of conventional wikis by allowing users to edit and query structured semantic annotations (e.g., categories and typed links) rather than plain wiki text. This new feature, as shown in this paper, supports...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Dec 2008

    An Efficient Model of 802.11 Ad Hoc Networks Under a Block-Fading Rayleigh Channel With Physical Layer Capture

    The authors present a model that predicts the saturated single-hop performance of IEEE 802.11 ad hoc network in the face of the physical capture effect under a block-fading Rayleigh channel. Based on an estimate of the frame delivery rate and a fixed point iteration algorithm, they devise an efficient control...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Dec 2008

    Performance Modeling of 802.11 Ad Hoc Networks With Time-Varying Carrier Sense Range and Physical Capture Capability

    In a slow fading environment, the carrier sense range is not constant, so there is not a constant set of hidden terminals for a mobile station. The probability of capture with a set of interferers is not a fixed value either, and it fundamentally affects the loss rate and throughput...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Mar 2011

    Efficient Structure Learning of Bayesian Networks Using Constraints

    This paper addresses the problem of learning Bayesian network structures from data based on score functions that are decomposable. It describes properties that strongly reduce the time and memory costs of many known methods without losing global optimality guarantees. These properties are derived for different score criteria such as Minimum...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2009

    The Real Exchange Rate And The U. S. Economy 2000 - 2008

    This paper is a revision of Rensselaer Polytechnic Institute's Working Papers in Economics Series, No. 803, entitled "How Falling Exchange Rates 2000 - 2007 have Affected the U.S. Economy and Trade Deficit (Evaluated Using the Federal Reserve's Real Broad Exchange Rate)". It expands the analysis to measure exchange rate effects...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Mar 2009

    A Distributed Coordination Scheme to Improve the Performance of IEEE 802.11 in Multi-Hop Networks

    This paper investigates the performance of IEEE 802.11 in multi-hop scenarios and shows how its aggressive behavior can throttle the spatial reuse and reduce bandwidth efficiency. An adaptive, layer-2, distributed coordination scheme for 802.11 using explicit Medium Access Control (MAC) feedback is then proposed to pace the transmissions on adjacent...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Sep 2009

    Queueing Analysis of Polled Service Classes in the IEEE 802.16 MAC Protocol

    This paper considers the performance of the polling based service classes of IEEE 802.16 based broadband wireless access networks and develops queueing models to evaluate their delay distributions and loss rates. Both single and multiple carriers OFDMA operations are considered and models are proposed for two polling strategies. The models...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Sep 2010

    Efficient Computation Of Optimal Trading Strategies

    Given the return series for a set of instruments, a trading strategy is a switching function that transfers wealth from one instrument to another at specified times. The authors present efficient algorithms for constructing (ex-post) trading strategies that are optimal with respect to the total return, the Sterling ratio and...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Feb 2011

    Energy-Efficient Location Service Protocols for Mobile Ad Hoc Networks

    Location-based routing protocols are stateless since they rely on position information in forwarding decisions. However, their efficiency depends on performance of location services which provide the position information of the desired destination node. Although several location service schemes have been proposed, their main goal is merely to find the location...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Oct 2008

    Visualization in Sensor Network Simulator, SENSE and Its Use in Protocol Verification

    People are always looking for a way to visualize a problem. Whether that is by creating a 3-dimensional model, building a graph, or simply drawing on a board. The issue of visualizing a problem also finds its way into networking, and more specifically wireless sensor networking. Many networking simulation tools...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jan 2011

    Survey of Peer-to-Peer Systems

    Over the past decade, Peer-To-Peer systems (P2P) have gained an increasing popularity among the Internet community. Although the P2P concept is as old as the creation of the Internet itself, it has been given recently a paramount attention by researchers from various computer science fields. P2P systems provide a paradigm...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2010

    Dynamic Composition of Services in Sensor Networks and Its Implementation Under Sensor Fabric

    Service modeling and composition is a fundamental method for offering advanced functionality by combining a set of primitive services provided by the system. Unlike in the case of web services for which there is an abundance of reliable resources, in sensor networks, the resources are constrained and communication among nodes...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2010

    An Energy Efficient Dynamic Location Server Hierarchy for Mobile Ad Hoc Networks

    By using position information in forwarding decisions, location based routing protocols for mobile networks are stateless and efficient. However, they are heavily dependent on location services which provide the position information of the desired destination node. Although several location service schemes have been proposed, their main goal is just to...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2010

    A Formal Context Representation Framework for Network-Enabled Cognition

    Network-accessible resources are inherently contextual with respect to the specific situations (e.g., location and default assumptions) in which they are used. Therefore, the explicit conceptualization and representation of contexts is required to address a number of problems in Network-Enabled Cognition (NEC). The authors propose a context representation framework to address...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2010

    Service Discovery for Delay Tolerant Networks

    Service discovery is an essential step in deploying many wireless network applications. The design of service discovery protocols is particularly challenging for mobile wireless networks because of their dynamic and unstructured nature. Most of the previously proposed protocols are based on the assumption that there exists an end-to-end connection from...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jul 2010

    Efficient Routing in Delay Tolerant Networks With Correlated Node Mobility

    In a Delay Tolerant Network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path from source to destination is unlikely to exist, message delivery relies on opportunistic routing. However, effective forwarding based on a limited knowledge of contact...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Apr 2010

    An Energy Efficient Location Service for Mobile Ad Hoc Networks

    Location based routing protocols are heavily dependent on location services which provide the position information of the desired destination node. Seldom location service schemes include energy efficiency metrics when evaluating their performance in forwarding location update and query packets. The authors propose a novel location service that aims at decreasing...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Apr 2010

    Conditional Shortest Path Routing in Delay Tolerant Networks

    Delay tolerant networks are characterized by the sporadic connectivity between their nodes and therefore the lack of stable end-to-end paths from source to destination. Since the future node connections are mostly unknown in these networks, opportunistic forwarding is used to deliver messages. However, making effective forwarding decisions using only the...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // May 2010

    Cost Efficient Erasure Coding Based Routing in Delay Tolerant Networks

    Routing in Delay Tolerant Networks (DTNs) in which most of the nodes are mobile and intermittently connected is a challenging problem because of unpredictable node movements and lack of knowledge of future node connections. To ensure reliability against failures and increase the success rate of delivery, erasure coding technique is...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // May 2010

    The Effect of Neighbor Graph Connectivity on Coverage Redundancy in Wireless Sensor Networks

    Coverage redundancy problem is one of the significant problems in wireless sensor networks. To reduce the energy consumption that arises when the high number of sensors is active, various coverage control protocols (sleep scheduling algorithms) have been proposed. In these protocols, a subset of nodes necessary to maintain sufficient sensing...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2009

    Impact of Social Networks on Delay Tolerant Routing

    Delay Tolerant Networks (DTNs) are wireless networks in which at any given time instance, the probability of having a complete path from a source to destination is low due to the intermittent connectivity between nodes. Several routing schemes have been proposed for such networks to make the delivery of messages...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2009

    A Participation Incentive Market Mechanism for Allocating Heterogeneous Network Services

    The combinatorial winner selection of the GVA mechanism allocates resources to bidders optimally for a single round of an auction. However, the recurring nature of auction for network resource allocation may cause bidder drop resulting from the paradox of incentive compatible mechanism in recurring auction. Therefore, in designing auction based...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2009

    Distributed Target Tracking With Directional Binary Sensor Networks

    One of the most common and important applications of wireless sensor networks is target tracking. The authors study it in its most basic form, assuming the binary sensing model in which each sensor can return only information regarding target's presence or absence within its sensing range. However, unlike most of...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Apr 2009

    Self-Selecting Reliable Path Routing in Diverse Wireless Sensor Network Environments

    Routing protocols for Wireless Sensor Networks (WSNs) face three major performance challenges. The first one is an efficient use of bandwidth that minimizes the transfer delay of packets between nodes to ensure the shortest end-to-end delay for packet transmission from source to destination. The second challenge is the ability to...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Feb 2009

    Energy Efficient Collision Aware Multipath Routing for Wireless Sensor Networks

    Multipath routing can reduce the need for route updates, balance the traffic load and increase the data transfer rate in a wireless sensor network, improving the utilization of the limited energy of sensor nodes. However, previous multiple path routing methods use flooding for route discovery and transmit data with maximum...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jan 2009

    Agency Problem And Investment-Cash Flow Sensitivity: Evidence From Antitakeover Legislation

    Theories of capital market imperfections envision that financing frictions caused by agency problems increases the sensitivity of investment expenditures to fluctuations in internal financing. Agency theory predicts that overinvestment by entrenched managers also increases investment-cash flow sensitivity. Previous empirical tests of the relation between investment and internal financing have relied...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jul 2011

    VTL Zone-Aware Path Cloaking Algorithm

    Traffic engineering applications often benefit from collecting vehicle GPS traces in well-defined locations. As a motivating example, the authors will consider a traffic signal performance evaluation technique which requires GPS traces of vehicles traversing intersections. Since these applications do not require vehicle identity information, they are a good candidate for...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jan 2011

    Scheduling Algorithms for Point-to-Multipoint Operation in IEEE 802.16 Networks

    The authors study the resource allocation problem in OFDMA based 802.16 broadband wireless access systems. Frequency and time resources must be allocated by a central controller (Base Station) to a number of users. They consider variations of a resource allocation problem, some of which are difficult to solve. Situations in...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Aug 2008

    Wavelet Based Detection of Session Hijacking Attacks in Wireless Networks

    This paper develops a mechanism for detecting session hijacking attacks in wireless networks. The proposed scheme is based on detecting abrupt changes in the strength of the received signal. The authors first develop a mathematical model to describe the signal strength during a session hijacking: a step function signal, which...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // May 2011

    On Secure Multi-Copy Based Routing in Compromised Delay Tolerant Networks

    Routing in Delay Tolerant Networks (DTNs) is challenging due to their unique characteristics of intermittent node connectivity. Different protocols (single-copy, multi-copy, erasure-coding-based etc.) utilizing store-carry-and-forward paradigm are proposed to achieve routing of messages in such environments by opportunistic message exchanges between nodes that are in the communication range of each...

    Provided By Rensselaer Polytechnic Institute

  • White Papers // Jan 2009

    Trajectory-Based Forwarding Mechanisms for Ad-Hoc Sensor Networks

    Routing in ad-hoc sensor networks is a complicated task because of many reasons. The nodes are low powered and they cannot maintain routing tables large enough for well-known routing protocols. Because of that, greedy forwarding at intermediate nodes is desirable in ad-hoc networks. Also, for traffic engineering, multipath capabilities are...

    Provided By Rensselaer Polytechnic Institute