University of Waterloo

Displaying 41-80 of 134 results

  • White Papers // Aug 2011

    Specifying Overlaps of Heterogeneous Models for Global Consistency Checking

    Software development often involves a set of models defined in different metamodels, each model capturing a specific view of the system. The authors call this set a multimodel, and its elements partial or local models. Since partial models overlap, they may be consistent or inconsistent wrt. a set of global...

    Provided By University of Waterloo

  • White Papers // Aug 2011

    On Verifying Dynamic Multiple Data Copies Over Cloud Servers

    Currently, many individuals and organizations outsource their data to remote Cloud Service Providers (CSPs) seeking to reduce the maintenance cost and the burden of large local data storage. The CSP offers paid storage space on its infrastructure to store customers' data. Replicating data on multiple servers across multiple data centers...

    Provided By University of Waterloo

  • White Papers // Aug 2011

    SMURFEN: A System Framework for Rule Sharing Collaborative Intrusion Detection

    Intrusion Detection Systems (IDSs) are designed to monitor network traffic and computer activities in order to alert users about suspicious intrusions. Collaboration among IDSs allows users to benefit from the collective knowledge and information from their collaborators and achieve more accurate intrusion detection. However, most existing collaborative intrusion detection networks...

    Provided By University of Waterloo

  • White Papers // Aug 2011

    Privacy: Gone With the Typing! Identifying Web Users by Their Typing Patterns

    The lack of privacy protection for Internet users has been identified as a major problem in modern web browsers. Despite potentially high risk of identification by typing patterns, this topic has received little attention in both the research and general community. In this paper, the authors present a simple but...

    Provided By University of Waterloo

  • White Papers // Jul 2011

    An Efficient and Secure User Revocation Scheme in Mobile Social Networks

    Mobile Social Network (MSN) is a promising networking and communication platform for users having similar interests (or attributes) to connect and interact with one another. For many recently introduced secure MSN data communication schemes, attribute-based encryption is often adopted to preserve user privacy. These schemes are mainly to prevent outside...

    Provided By University of Waterloo

  • White Papers // Jul 2011

    From State-To Delta-Based Bidirectional Model Transformations: The Symmetric Case

    A bidirectional transformation (BX) keeps a pair of interrelated models synchronized. Symmetric BXs are those for which neither model in the pair fully determines the other. The authors build two algebraic frameworks for symmetric BXs, with one correctly implementing the other, and both being delta-based generalizations of known state-based frameworks....

    Provided By University of Waterloo

  • White Papers // Jun 2011

    A Light-weight Message Authentication Scheme for Smart Grid Communications

    Smart Grid (SG) communication has recently received significant attentions to facilitate intelligent and distributed electric power transmission systems. However, communication trust and security issues still present practical concerns to the deployment of SG. In this paper, to cope with these challenging concerns, the authors propose light-weight message authentication scheme features...

    Provided By University of Waterloo

  • White Papers // Jun 2011

    Grammar Inference for Web Documents

    Presentational XML documents, such as XHTML or Presentation MathML, use XML tags mainly for formatting purposes, while descriptive XML applications, such as a well-structured movie database, use tags to structure data items in a semantically meaningful way. There is little semantic connection between tags in a presentational XML document and...

    Provided By University of Waterloo

  • White Papers // Jun 2011

    BUPLE: Securing Passive RFID Communication Through Physical Layer Enhancements

    Although RFID systems offer many noteworthy characteristics, security and privacy issues associated with them are not easy to address. In this paper, the authors investigate how to solve the eavesdrop-ping, modification and one particular type of relay attacks toward the tag-to-reader communication in passive RFID systems without requiring lightweight ciphers...

    Provided By University of Waterloo

  • White Papers // May 2011

    Comments on a Sensor Network Key Redistribution Technique of Cichon, Golebiewski and Kutylowski

    Cichon, Golebiewski and Kutylowski proposed a technique for "Key redistribution" in sensor networks. The idea is that long-term keys held by the sensor nodes are used to encrypt temporal keys that a base station then broadcasts to the network. The temporal keys are used as session keys by the nodes...

    Provided By University of Waterloo

  • White Papers // May 2011

    Throughput Optimization in Multi-Hop Wireless Networks With Random Access

    This paper investigates cross-layer design in multi-hop wireless networks with random access. Due to the complexity of the problem, the authors study cross-layer design with a simple slotted ALOHA Medium Access Control (MAC) protocol without considering any network dynamics. Firstly, they study the optimal joint configuration of routing and MAC...

    Provided By University of Waterloo

  • White Papers // May 2011

    Cooperative Data Dissemination Via Roadside WLANs

    Data dissemination services embrace a wide variety of telematic applications where data packets are generated at a remote server in the Internet and destined to a group of nomadic users such as vehicle passengers and pedestrians. The quality of a data dissemination service is highly dependent on the availability of...

    Provided By University of Waterloo

  • White Papers // May 2011

    TMAC: Timestamp-Ordered MAC for CSMA/CA Wireless Mesh Networks

    The authors propose TMAC, a timestamp-ordered MAC protocol for Wireless Mesh Networks (WMNs). TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed...

    Provided By University of Waterloo

  • White Papers // May 2011

    Anonymity and One-Way Authentication in Key Exchange Protocols

    Key establishment is a crucial cryptographic primitive for building secure communication channels between two parties in a network. It has been studied extensively in theory and widely deployed in practice. In the research literature a typical protocol in the public-key setting aims for key secrecy and mutual authentication. However, there...

    Provided By University of Waterloo

  • White Papers // May 2011

    Enabling Network Convergence Through Contextual Session Mobility With IMS

    To fully benefit from the all IP convergence, it should be possible for a user not only to access services ubiquitously and at any time, but also to automatically and seamlessly transfer ongoing communication between different devices. This paper investigates the problem space of supporting Session Mobility (SM) with IMS...

    Provided By University of Waterloo

  • White Papers // Apr 2011

    Paging for Multicore Processors

    Paging for multicore processors extends the classical paging problem to a setting in which several processes simultaneously share the cache. Recently, Hassidim studied cache eviction policies for multicores under the traditional competitive analysis metric, showing that LRU is not competitive against an offline policy that has the power of arbitrarily...

    Provided By University of Waterloo

  • White Papers // Apr 2011

    Improving The Design Of Financial Products In A Multidimensional Black-Scholes Market

    Using various techniques, authors have shown that in one-dimensional markets, complex (path-dependent) contracts are generally not optimal for rational consumers. In this paper the authors generalize these results to a multidimensional Black-Scholes market. In such a market, they discuss optimal contracts for investors who prefer more to less and have...

    Provided By University of Waterloo

  • White Papers // Apr 2011

    Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious Interference

    Interference is an unavoidable property of the wireless communication medium and, in sensor networks, such interference is exacerbated due to the energy-starved nature of the network devices themselves. In the presence of antagonistic interference, reliable communication in sensor networks becomes an extremely challenging problem that, in recent years, has attracted...

    Provided By University of Waterloo

  • White Papers // Apr 2011

    Selections: Internet Voting with Over-the-Shoulder Coercion-Resistance

    The authors present Selections, a new cryptographic voting protocol that is end-to-end verifiable and suitable for Internet voting. After a one-time in-person registration, voters can cast ballots in an arbitrary number of elections. They say a system provides over-the-shoulder coercion-resistance if a voter can undetectably avoid complying with an adversary...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    Monitoring Burst (M-Burst)- A Novel Framework of Failure Localization in All-Optical Mesh Networks

    Achieving instantaneous and precise failure localization in all-optical Wavelength Division Multiplexing (WDM) networks has been an attractive feature of network fault management systems, and is particularly important when failure-dependent protection is employed. The paper introduces a novel framework of real-time failure localization in all-optical WDM mesh networks, called monitoring-burst (m-burst),...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    Collaborative Intrusion Detection Networks and Insider Attacks

    Cyber intrusion is becoming an increasingly global and urgent problem. Intrusion Detection Systems (IDSs) are deployed to identify intrusions and mitigate their damage. A stand alone IDS does not have complete information or knowledge to detect intrusions. A Collaborative Intrusion Detection Network (CIDN) consists in a set of cooperating IDSs...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    SMURFEN: A Knowledge Sharing Intrusion Detection Network

    The problem of Internet intrusions has become a world-wide security concern. To protect computer users from malicious attacks, Intrusion Detection Systems (IDSs) are designed to monitor network traffic and computer activities in order to alert users about suspicious intrusions. Collaboration among IDSs allows users to benefit from the collective knowledge...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    Combining Multiple Dimensions of Knowledge in API Migration

    The authors combine multiple dimensions of knowledge about APIs so that they can support API migration by wrapping or transformation in new ways. That is, they assess wrapper-based API re-implementations and provide guidance for migrating API methods. They demonstrate their approach with two major GUI APIs for the Java platform...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    Unconditionally Secure Signature Schemes Revisited

    Unconditionally Secure Signature (USS) schemes provide the ability to electronically sign documents without the reliance on computational assumptions needed in traditional digital signatures. Unlike digital signatures, USS schemes require both different signing and different verification algorithms for each user in the system. Thus, any viable security definition for a USS...

    Provided By University of Waterloo

  • White Papers // Feb 2011

    Dynamic Resource Allocation for Spot Markets in Clouds

    Cloud computing promises on-demand provisioning of resource to applications and services. To deal with dynamically fluctuating resource demands, market-driven resource allocation has been proposed and recently implemented by commercial cloud providers like Amazon EC2. In this environment, cloud resources are offered in distinct types of Virtual Machines (VMs) and the...

    Provided By University of Waterloo

  • White Papers // Feb 2011

    D-MG Tradeoff of DF and AF Relaying Protocols Over Asynchronous PAM Cooperative Networks

    The diversity multiplexing tradeoff of a general two-hop asynchronous cooperative network is examined for various relaying protocols such as Non-orthogonal Selection Decode-and-Forward (NSDF), Orthogonal Selection Decode-and-Forward (OSDF), Non-orthogonal Amplify-and-Forward (NAF), and Orthogonal Amplify-and-Forward (OAF). The transmitter nodes are assumed to send Pulse Amplitude Modulation (PAM) signals asynchronously, in which information...

    Provided By University of Waterloo

  • White Papers // Feb 2011

    Side Channel Monitoring: Packet Drop Attack Detection in Wireless Ad Hoc Networks

    Wireless ad hoc networks have great potentials in a broad range of applications. Their inherent vulnerability to various network attacks however limits their wide adaptation and deployment in practice. In this paper, the authors address one of the most dangerous attacks, packet drop attack, in wireless ad hoc networks by...

    Provided By University of Waterloo

  • White Papers // Feb 2011

    Fine-Grained Identification With Real-Time Fairness in Mobile Social Networks

    Mutual user identification is a necessary step for establishing trust among users in an unattended Mobile Social Network (MSN). Directly revealing identity information to others who are unknown to the users may result in an unfair situation regarding identity when other parties of the identification process misbehave. Using an on-line...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Optimal Scheduling for Roadside WLANs With Pre-Downloaded Messages

    In this paper, data dissemination services are discussed in the context of Vehicular Ad hoc NETworks (VANETs). In order to improve the efficiency of data dissemination, messages are network coded and pre-downloaded to the local nodes within the RoadSide WLANs (RS-WLANs) and then scheduled for transmission when a vehicle goes...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Link Scheduling in Wireless Networks With Successive Interference Cancellation

    Successive Interference Cancellation (SIC) is an effective way of Multi-Packet Reception (MPR) to combat interference at the physical layer. To understand the potential MPR advantages, the authors study link scheduling in an ad hoc network with SIC at the physical layer. The fact that the links detected sequentially by SIC...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Forward Focus: Medium Access Control for Ad Hoc Networks

    The wireless medium must be effectively shared in an ad hoc network. The multihop nature of the network demands it, with packets often requiring several transmissions in order to reach their destination. This paper describes a mechanism for improving the IEEE 802.11 MAC specifically for ad hoc networks. The Forward...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Throughput Optimization for Hierarchical Cooperation in Ad Hoc Networks

    Wireless networks formed by radio nodes is a subject of much topical interest, and they are found in various applications such as ad hoc networks, mesh networks, sensor networks, etc. For the optimal design and operation of such networks, it is of fundamental importance to determine the information-theoretic capacity of...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Optimal Speedup on a Low-Degree Multi-Core Parallel Architecture (LoPRAM)

    Modern microprocessor architectures have gradually incorporated support for parallelism. In the past the degree of parallelism was rather small and as such it could be best modeled as a constant speedup over the traditional RAM model, however, as a consequence of continued growth this assumption might no longer hold. For...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Universal Top K Keyword Search Over Relational Databases

    Keyword search is one of the most effective paradigms for information discovery. One of the key advantages of keyword search querying is its simplicity. There is an increasing need for allowing ordinary users to issue keyword queries without any knowledge of the database schema. The retrieval unit of keyword search...

    Provided By University of Waterloo

  • White Papers // Dec 2010

    A Scalable and Effective Trust-Based Framework for Vehicular Ad-Hoc Networks

    In this paper, the authors present a trust-based framework for message propagation and evaluation in vehicular ad-hoc networks where peers share information regarding road condition or safety and others provide opinions about whether the information can be trusted. More specifically, their trust-based message propagation model collects and propagates peers' opinions...

    Provided By University of Waterloo

  • White Papers // Dec 2010

    A Practical Platform for Cube-Attack-Like Cryptanalyses

    Cube Attack was announced by Dinur and Shamir in 2008, and published at Eurocrypt'09. Cube Attack was first designed to search linear expressions of the secret keys in stream ciphers. In Cube Attack, a cipher can be treated as a black box and expressed in Boolean functions. By manipulating the...

    Provided By University of Waterloo

  • White Papers // Nov 2010

    Exact, Efficient and Information-Theoretically Secure Voting With an Arbitrary Number of Cheaters

    The authors present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel. Unlike previously proposed protocols in this model, the protocols that they present deterministically output the...

    Provided By University of Waterloo

  • White Papers // Nov 2010

    Omnidirectional Relay in Wireless Networks

    For wireless networks with multiple sources, an omnidirectional relay scheme is developed, where each node can simultaneously relay different messages in different directions. This is accomplished by the decode-and-forward relay strategy, with each relay binning the multiple messages to be transmitted, in the same spirit of network coding. Specially for...

    Provided By University of Waterloo

  • White Papers // Oct 2010

    Improving the Dominating-Set Routing Over Delay-Tolerant Mobile Ad-Hoc Networks Via Estimating Node Intermeeting Times

    With limited coverage of wireless networks and frequent roaming of mobile users, providing a seamless communication service poses a technical challenge. In the authors' previous research, they presented a supernode system architecture that employs the Delay-Tolerant Network (DTN) concept to provide seamless communications for roaming users over interconnected heterogeneous wireless...

    Provided By University of Waterloo

  • White Papers // Sep 2010

    Investigation of Targeting-Assistance Techniques for Distant Pointing With Relative Ray Casting

    Pointing at displays from a distance is becoming a common scenario for controlling computers and entertainment systems. Several devices use direct-pointing methods, where the user points a hand-held device at targets on a screen, but these often suffer from accuracy problems. Many techniques have been explored for improving mouse-based pointing,...

    Provided By University of Waterloo

  • White Papers // Jul 2010

    ARBR: Adaptive Reinforcement-Based Routing for DTN

    This paper introduces a novel routing protocol in Delay Tolerant Networks (DTNs), aiming to solve the online distributed routing problem. By manipulating a collaborative reinforcement learning technique, a group of nodes can cooperate with each other and make a forwarding decision for the stored messages based on a cost function...

    Provided By University of Waterloo

  • White Papers // May 2011

    Comments on a Sensor Network Key Redistribution Technique of Cichon, Golebiewski and Kutylowski

    Cichon, Golebiewski and Kutylowski proposed a technique for "Key redistribution" in sensor networks. The idea is that long-term keys held by the sensor nodes are used to encrypt temporal keys that a base station then broadcasts to the network. The temporal keys are used as session keys by the nodes...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Forward Focus: Medium Access Control for Ad Hoc Networks

    The wireless medium must be effectively shared in an ad hoc network. The multihop nature of the network demands it, with packets often requiring several transmissions in order to reach their destination. This paper describes a mechanism for improving the IEEE 802.11 MAC specifically for ad hoc networks. The Forward...

    Provided By University of Waterloo

  • White Papers // Apr 2010

    Design Principles for Robust Opportunistic Communication

    Several researchers have proposed the use of transient communication opportunities, that is, opportunistic communication, to reduce the cost of rural communication. The authors propose some design principles for robust opportunistic communication drawing from the experiences in developing and deploying several practical systems. They conclude with a sketch of some areas...

    Provided By University of Waterloo

  • White Papers // Feb 2011

    Side Channel Monitoring: Packet Drop Attack Detection in Wireless Ad Hoc Networks

    Wireless ad hoc networks have great potentials in a broad range of applications. Their inherent vulnerability to various network attacks however limits their wide adaptation and deployment in practice. In this paper, the authors address one of the most dangerous attacks, packet drop attack, in wireless ad hoc networks by...

    Provided By University of Waterloo

  • White Papers // Feb 2011

    Fine-Grained Identification With Real-Time Fairness in Mobile Social Networks

    Mutual user identification is a necessary step for establishing trust among users in an unattended Mobile Social Network (MSN). Directly revealing identity information to others who are unknown to the users may result in an unfair situation regarding identity when other parties of the identification process misbehave. Using an on-line...

    Provided By University of Waterloo

  • White Papers // May 2011

    Anonymity and One-Way Authentication in Key Exchange Protocols

    Key establishment is a crucial cryptographic primitive for building secure communication channels between two parties in a network. It has been studied extensively in theory and widely deployed in practice. In the research literature a typical protocol in the public-key setting aims for key secrecy and mutual authentication. However, there...

    Provided By University of Waterloo

  • White Papers // Apr 2011

    Improving The Design Of Financial Products In A Multidimensional Black-Scholes Market

    Using various techniques, authors have shown that in one-dimensional markets, complex (path-dependent) contracts are generally not optimal for rational consumers. In this paper the authors generalize these results to a multidimensional Black-Scholes market. In such a market, they discuss optimal contracts for investors who prefer more to less and have...

    Provided By University of Waterloo

  • White Papers // Apr 2010

    On the Capacity and Scheduling of a Multi-Sector Cell With Co-Channel Interference Knowledge

    The authors study the capacity of a single-hop wireless cell comprised of M fixed directional antennas concentrically arranged around a common axis and each reusing the same channel. The premise for this architecture is that co-channel interference between the fixed directional beams can be identified and reported, allowing joint conflict-free...

    Provided By University of Waterloo

  • White Papers // Aug 2011

    On Verifying Dynamic Multiple Data Copies Over Cloud Servers

    Currently, many individuals and organizations outsource their data to remote Cloud Service Providers (CSPs) seeking to reduce the maintenance cost and the burden of large local data storage. The CSP offers paid storage space on its infrastructure to store customers' data. Replicating data on multiple servers across multiple data centers...

    Provided By University of Waterloo

  • White Papers // Jul 2010

    BitTorrent Under a Microscope: Towards Static QoS Provision in Dynamic Peer-to-Peer Networks

    For Peer-To-Peer (P2P) networks continually to flourish, QoS provision is critical. However, the P2P networks are notoriously dynamic and heterogeneous. As a result, QoS provision in P2P networks is a challenging task with nodes of the varying and intermittent throughput. This raises a fundamental problem: is stable and delicate QoS...

    Provided By University of Waterloo

  • White Papers // Mar 2010

    Spectrum Allocation for Smooth Video Delivery Over Cognitive Radio Networks

    In Cognitive Radio (CR) networks, users are allowed to dynamically access the temporally unused channels to recycle the spectrum for better throughput. However, the dynamic channel availability also results in the highly variable and intermittent download to the users, which directly threats the on-top applications, especially for real-time service such...

    Provided By University of Waterloo

  • White Papers // Jan 2010

    MAC Performance Analysis for Vehicle-to-Infrastructure Communication

    The newly emerged vehicular ad hoc network adopts the contention based IEEE 802.11 DCF as its MAC. While it has been extensively studied in the stationary indoor environment (e.g., WLAN), the performance of DCF in the highly mobile vehicular environment is still unclear. On addressing this issue, the authors propose...

    Provided By University of Waterloo

  • White Papers // May 2011

    Throughput Optimization in Multi-Hop Wireless Networks With Random Access

    This paper investigates cross-layer design in multi-hop wireless networks with random access. Due to the complexity of the problem, the authors study cross-layer design with a simple slotted ALOHA Medium Access Control (MAC) protocol without considering any network dynamics. Firstly, they study the optimal joint configuration of routing and MAC...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Link Scheduling in Wireless Networks With Successive Interference Cancellation

    Successive Interference Cancellation (SIC) is an effective way of Multi-Packet Reception (MPR) to combat interference at the physical layer. To understand the potential MPR advantages, the authors study link scheduling in an ad hoc network with SIC at the physical layer. The fact that the links detected sequentially by SIC...

    Provided By University of Waterloo

  • White Papers // May 2011

    Cooperative Data Dissemination Via Roadside WLANs

    Data dissemination services embrace a wide variety of telematic applications where data packets are generated at a remote server in the Internet and destined to a group of nomadic users such as vehicle passengers and pedestrians. The quality of a data dissemination service is highly dependent on the availability of...

    Provided By University of Waterloo

  • White Papers // Apr 2010

    Throughput-Lifetime Tradeoffs in Multihop Wireless Networks Under an SINR-Based Interference Model

    High throughput and lifetime are both crucial design objectives for a number of multi-hop wireless network applications. As these two objectives are often in conflict with each other, it naturally becomes important to identify the tradeoffs between them. Several works in the literature have focused on improving one or the...

    Provided By University of Waterloo

  • White Papers // Jan 2010

    Engineering Wireless Mesh Networks: Joint Scheduling, Routing, Power Control and Rate Adaptation

    The authors present a number of significant engineering insights on what makes a good configuration for medium-to large-size WMNs when the objective function is to maximize the minimum throughput among all flows. For this, they first develop efficient and exact computational tools using column generation with greedy pricing that allow...

    Provided By University of Waterloo

  • White Papers // Feb 2011

    Dynamic Resource Allocation for Spot Markets in Clouds

    Cloud computing promises on-demand provisioning of resource to applications and services. To deal with dynamically fluctuating resource demands, market-driven resource allocation has been proposed and recently implemented by commercial cloud providers like Amazon EC2. In this environment, cloud resources are offered in distinct types of Virtual Machines (VMs) and the...

    Provided By University of Waterloo

  • White Papers // Oct 2009

    Case Study of Scientific Data Processing on a Cloud Using Hadoop

    With the increasing popularity of cloud computing, Hadoop has become a widely used open source cloud computing framework for large scale data processing. However, few efforts have been made to demonstrate the applicability of Hadoop to various real-world application scenarios in fields other than server side computations such as web...

    Provided By University of Waterloo

  • White Papers // Jun 2010

    Resource and Service Discovery in Large-Scale Multi-Domain Networks

    With the increasing need for networked applications and distributed resource sharing, there is a strong incentive for an open large-scale service infrastructure operating over multi-domain and multi-technology networks. Service discovery, as an essential support function of such an infrastructure, is a crucial current research challenge. Although a few survey papers...

    Provided By University of Waterloo

  • White Papers // Oct 2010

    Improving the Dominating-Set Routing Over Delay-Tolerant Mobile Ad-Hoc Networks Via Estimating Node Intermeeting Times

    With limited coverage of wireless networks and frequent roaming of mobile users, providing a seamless communication service poses a technical challenge. In the authors' previous research, they presented a supernode system architecture that employs the Delay-Tolerant Network (DTN) concept to provide seamless communications for roaming users over interconnected heterogeneous wireless...

    Provided By University of Waterloo

  • White Papers // Apr 2010

    DFMAC: DTN-Friendly Medium Access Control for Wireless Local Area Networks Supporting Voice/Data Services

    In this paper, the authors consider a wireless communication network for both local nodes residing in densely populated hotspots and nomadic nodes roaming in a large area. Wireless Local Area Networks (WLANs) are deployed in the hotspots, while a Delay/disruption Tolerant Network (DTN) provides services to nomadic nodes in the...

    Provided By University of Waterloo

  • White Papers // Jun 2011

    A Light-weight Message Authentication Scheme for Smart Grid Communications

    Smart Grid (SG) communication has recently received significant attentions to facilitate intelligent and distributed electric power transmission systems. However, communication trust and security issues still present practical concerns to the deployment of SG. In this paper, to cope with these challenging concerns, the authors propose light-weight message authentication scheme features...

    Provided By University of Waterloo

  • White Papers // Sep 2011

    Characterizing Task Usage Shapes in Google~s Compute Clusters

    The increase in scale and complexity of large compute clusters motivates a need for representative workload bench-marks to evaluate the performance impact of system changes, so as to assist in designing better scheduling algorithms and in carrying out management activities. To achieve this goal, it is necessary to construct workload...

    Provided By University of Waterloo

  • White Papers // Nov 2011

    Network Cooperation for Energy Saving in Green Radio Communications

    Financial and environmental considerations have motivated a trend in wireless communication network design and operation to minimize the amount of energy consumption. Such a trend is referred to as green radio communications. In this paper, network cooperation is investigated as a means of energy saving. Networks with overlapped coverage can...

    Provided By University of Waterloo

  • White Papers // Feb 2010

    Topology-Awareness and Reoptimization Mechanism for Virtual Network Embedding

    Embedding of Virtual Network (VN) requests on top of a shared physical network poses an intriguing combination of theoretical and practical challenges. Two major problems with the state-of-the-art VN embedding algorithms are their indifference to the underlying substrate topology and their lack of re-optimization mechanisms for already embedded VN requests....

    Provided By University of Waterloo

  • White Papers // Sep 2011

    Resolving State Inconsistency in Distributed Fault-Tolerant Real-Time Dynamic TDMA Architectures

    State consistency in safety-critical distributed systems is mandatory for synchronizing distributed decisions as found in dynamic Time Division Multiple Access (TDMA) schedules in the presence of faults. A TDMA schedule that supports networked systems making decisions at run time is sensitive to transient faults, because stations can make incorrect local...

    Provided By University of Waterloo

  • White Papers // Jan 2010

    Does Compressed Sensing Improve the Throughput of Wireless Sensor Networks?

    Although Compressed Sensing (CS) has been envisioned as a useful technique to improve the performance of Wireless Sensor Networks (WSNs), it is still not very clear how exactly it will be applied and how big the improvements will be. In this paper, the authors propose two different ways (plain-CS and...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    Efficient Algorithms to Solve a Class of Resource Allocation Problems in Large Wireless Networks

    The authors focus on efficient algorithms for resource allocation problems in large wireless networks. They first investigate the link scheduling problem and identify the properties that make it possible to compute solutions efficiently. They, then show that the node on-off scheduling problem shares these features and is amenable to the...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    Throughput-Lifetime Tradeoffs in Multihop Wireless Networks Under a Realistic Interference Model

    Throughput and lifetime are both crucial design objectives for multi-hop wireless networks. In general, it is not sufficient to optimize either of them separately. As these two objectives are often conflicting with each other, the authors can only hope to identify the tradeoffs between them. This entails a harder problem...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    TESP2: Timed Efficient Source Privacy Preservation Scheme for Wireless Sensor Networks

    Recent advances in micro electro mechanical systems and wireless communication have paved the way for the rapid deployment of wireless sensor networks, which have been well recognized as a ubiquitous and general approach for some emerging applications such as real-time traffic monitoring, ecosystem and battlefield surveillance. Typically, a wireless sensor...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Throughput Optimization for Hierarchical Cooperation in Ad Hoc Networks

    Wireless networks formed by radio nodes is a subject of much topical interest, and they are found in various applications such as ad hoc networks, mesh networks, sensor networks, etc. For the optimal design and operation of such networks, it is of fundamental importance to determine the information-theoretic capacity of...

    Provided By University of Waterloo

  • White Papers // Jun 2012

    Enable Pervasive Healthcare Through Continuous Remote Health Monitoring

    In this paper, the authors introduce a novel Remote Health Monitoring (RHM) system to enable high-quality pervasive healthcare services to users with low delivery delay and reduced costs. They define the RHM architecture and summarize the design considerations. They then present a promising commercialized solution, ViiCare, with system infrastructures and...

    Provided By University of Waterloo

  • White Papers // Feb 2012

    A Secure Payment Scheme With Low Communication and Processing Overhead for Multihop Wireless Networks

    The authors propose RACE, a report-based payment scheme for multi-hop wireless networks to stimulate node cooperation, regulate packet transmission, and enforce fairness. The nodes submit lightweight payment reports (instead of receipts) to the Accounting Center (AC) and temporarily store undeniable security tokens called Evidences. The reports contain the alleged charges...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    Multipath Transmission for Wireless Internet Access - From an End-to-End Transport Layer Perspective

    With the growing demand of Internet services, network operators have put significant efforts to improve network error resilience and efficiency. Since there exist different wired/wireless technologies for Internet access such as Digital Subscriber Line (DSL), Ethernet, and worldwide interoperability for microwave access (WiMax), a mobile host can use multiple access...

    Provided By University of Waterloo

  • White Papers // Nov 2011

    A Cloud-Based Scheme for Protecting Source-Location Privacy Against Hotspot-Locating Attack in Wireless Sensor Networks

    In wireless sensor networks, adversaries can make use of traffic information to locate the monitored objects, e.g., to hunt endangered animals or kill soldiers. In this paper, the authors first define a hotspot phenomenon that causes an obvious inconsistency in the network traffic pattern due to a large volume of...

    Provided By University of Waterloo

  • White Papers // Mar 2012

    SUCCESS: A Secure User-Centric and Social-Aware Reputation Based Incentive Scheme for DTNs

    Delay/Disruption Tolerant Networks (DTNs) are self-organized wireless ad-hoc networks, where end-to-end connectivity can not be guaranteed and communications rely on the assumption that the nodes are willing to store-carry-and-forward bundles in an opportunistic way. However, this assumption would be easily violated due to the selfish nodes which are unwilling to...

    Provided By University of Waterloo

  • White Papers // Aug 2011

    Specifying Overlaps of Heterogeneous Models for Global Consistency Checking

    Software development often involves a set of models defined in different metamodels, each model capturing a specific view of the system. The authors call this set a multimodel, and its elements partial or local models. Since partial models overlap, they may be consistent or inconsistent wrt. a set of global...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    Combining Multiple Dimensions of Knowledge in API Migration

    The authors combine multiple dimensions of knowledge about APIs so that they can support API migration by wrapping or transformation in new ways. That is, they assess wrapper-based API re-implementations and provide guidance for migrating API methods. They demonstrate their approach with two major GUI APIs for the Java platform...

    Provided By University of Waterloo