INRIA

Displaying 1-40 of 536 results

  • White Papers // Jan 2015

    Privacy by Design: On the Conformance Between Protocols and Architectures

    In systems design, the authors generally distinguish the architecture and the protocol levels. In the context of privacy by design, in the first case, they talk about privacy architectures, which define the privacy goals and the main features of the system at high level. In this paper, they consider the...

    Provided By INRIA

  • White Papers // Jul 2014

    A Taxonomy and Survey on eScience as a Service in the Cloud

    Cloud computing has recently evolved as a popular computing infrastructure for many applications. Scientific computing, which was mainly hosted in private clusters and grids, has started to migrate development and deployment to the public cloud environment. eScience as a service becomes an emerging and promising direction for science computing. The...

    Provided By INRIA

  • White Papers // Apr 2014

    Bridging Data in the Clouds: An Environment-Aware System for Geographically Distributed Data Transfers

    Today's continuously growing cloud infrastructures provide support for processing ever increasing amounts of scientific data. Cloud resources for computation and storage are spread among globally distributed datacenters. Thus, to leverage the full computation power of the clouds, global data processing across multiple sites has to be fully enabled. However, managing...

    Provided By INRIA

  • White Papers // Mar 2014

    Evaluating Streaming Strategies for Event Processing across Infrastructure Clouds

    Infrastructure clouds revolutionized the way in which the authors approach resource procurement by providing an easy way to lease compute and storage resources on short notice, for a short amount of time, and on a pay-as-you-go basis. This new opportunity, however, introduces new performance trade-offs. Making the right choices in...

    Provided By INRIA

  • White Papers // Mar 2014

    Optimizing Buffer Sizes for Pipeline Workflow Scheduling with Setup Times

    Mapping linear workflow applications onto a set of homogeneous processors can be optimally solved in polynomial time for the throughput objective with fewer processors than stages. This result even holds true, when setup times occur in the execution and homogeneous buffers are available for the storage of intermediate results. In...

    Provided By INRIA

  • White Papers // Mar 2014

    Sum-of-Product Architectures Computing Just Right

    Many digital filters and signal-processing transforms can be expressed as a Sum of Products with Constants (SPC). This paper addresses the automatic construction of low-precision, but high accuracy SPC architectures: these architectures are specified as last-bit accurate with respect to a mathematical definition. In other words, they behave as if...

    Provided By INRIA

  • White Papers // Feb 2014

    Efficient Workstealing for Multicore Event-Driven Systems

    Many high-performance communicating systems are designed using the event-driven paradigm. As multi-core platforms are now pervasive, it becomes crucial for such systems to take advantage of the available hardware parallelism. Event coloring is a promising approach in this regard. First, it allows programmers to simply and progressively inject support for...

    Provided By INRIA

  • White Papers // Feb 2014

    BlobSeer: Bringing High Throughput under Heavy Concurrency to Hadoop Map-Reduce Applications

    Hadoop is a software framework supporting the Map-Reduce programming model. It relies on the Hadoop Distributed File System (HDFS) as its primary storage system. The efficiency of HDFS is crucial for the performance of Map-Reduce applications. The authors substitute the original HDFS layer of Hadoop with a new, concurrency-optimized data...

    Provided By INRIA

  • White Papers // Jan 2014

    Interactive Inference of Join Queries

    The authors investigate the problem of inferring join queries from user interactions. The user is presented with a set of candidate tuples and is asked to label them as positive or negative depending on whether or not she would like the tuples as part of the join result. The goal...

    Provided By INRIA

  • White Papers // Jan 2014

    Context-Aware Top-k Processing using Views

    Search applications where queries are dependent on their context are becoming increasingly relevant in today's online applications. For example, the context may be the location of the user in location-aware search or the social network of the query initiator in social-aware search. Processing such queries efficiently is inherently difficult, and...

    Provided By INRIA

  • White Papers // Jan 2014

    Deduction with Contradictions in Datalog

    The authors study deduction in the presence of inconsistencies. Following previous works, they capture deduction via datalog programs and in-consistencies through violations of Functional Dependencies (FDs). They study and compare two semantics for datalog with FDs: the first, of a logical nature, is based on inferring facts one at a...

    Provided By INRIA

  • White Papers // Dec 2013

    A Fine-grained Approach for Power Consumption Analysis and Prediction

    Power consumption has become a critical concern in modern computing systems for various reasons including financial savings and environmental protection. With battery powered devices, the authors need to care about the available amount of energy since it is limited. For the case of supercomputers, as they imply a large aggregation...

    Provided By INRIA

  • White Papers // Dec 2013

    Toward Better Simulation of MPI Applications on Ethernet/TCP Networks

    In the High Performance Computing (HPC) field, accurately predicting the execution time of parallel applications is of utmost importance to assess their scalability, and this is particularly true for applications slated for deployment on next-generation exascale systems. While much effort has been put towards understanding the high-level behavior of these...

    Provided By INRIA

  • White Papers // Nov 2013

    Extracting UML/OCL Integrity Constraints and Derived Types from Relational Databases

    Relational databases usually enforce relevant organizational business rules. This aspect is ignored by current database reverse engineering approaches which only focus on the extraction of the structural part of the conceptual schema. Other database elements like triggers, views, column constraints, etc. are not considered by those methods. As a result,...

    Provided By INRIA

  • White Papers // Nov 2013

    Reasoning About Pattern-Based XML Queries

    The authors survey results about static analysis of pattern-based queries over XML documents. These queries are analogs of conjunctive queries, their unions and Boolean combinations, in which tree patterns play the role of atomic formulae. As in the relational case, they can be viewed as both queries and incomplete documents,...

    Provided By INRIA

  • White Papers // Nov 2013

    Dynamic Workload-Based Partitioning Algorithms for Continuously Growing Databases

    Applications with very large databases, where data items are continuously appended, are becoming more and more common. Thus, the development of efficient data partitioning is one of the main requirements to yield good performance. In the case of applications that have complex access patterns, e.g. scientific applications, workload-based partitioning could...

    Provided By INRIA

  • White Papers // Nov 2013

    Mapping Applications on Volatile Resources

    In this paper, the authors study the execution of iterative applications on volatile processors such as those found on desktop grids. They envision two models, one where all tasks are assumed to be independent, and another where all tasks are tightly coupled and keep exchanging information throughout the iteration. These...

    Provided By INRIA

  • White Papers // Oct 2013

    On the Performance and Energy Efficiency of Hadoop Deployment Models

    The exponential growth of scientific and business data has resulted in the evolution of the cloud computing and the MapReduce parallel programming model. Cloud computing emphasizes increased utilization and power savings through consolidation while MapReduce enables large scale data analysis. The Hadoop framework has recently evolved to the standard framework...

    Provided By INRIA

  • White Papers // Oct 2013

    WaRG: Warehousing RDF Graphs

    Databases of facts, each characterized by multiple dimensions, whose values are recorded in measures, are at the core of multidimensional Data Warehouses (DWs in short). The facts can then be analyzed by means of aggregating the measures. Data warehouses are typically built to analyze (some aspects of) an enterprise's business...

    Provided By INRIA

  • White Papers // Sep 2013

    Response Time Analysis for Fixed-Priority Tasks with Multiple Probabilistic Parameters

    In this paper, the authors consider a probabilistic model for real-time task systems with probabilistic worst-case execution times, probabilistic minimum inter-arrival times and probabilistic deadlines. They propose an analysis computing response time distributions of the tasks scheduled on one processor under a task-level fixed-priority preemptive scheduling policy. The complexity of...

    Provided By INRIA

  • White Papers // Aug 2013

    Folklore Confirmed: Compiling for Speed = Compiling for Energy

    The main motivations behind the arrival of multi-core processors were power and energy considerations. Increasing power density coupled with heat problems rendered untenable the premise that steadily increased performance could be achieved merely by steadily increasing processor clock speed. Multi-core processors were introduced based on the observation that multiple processors...

    Provided By INRIA

  • White Papers // Aug 2013

    Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints

    The authors consider allocation problems that arise in the context of service allocation in clouds. More specifically, they assume on the one part that each computing resource is associated with a capacity, that can be chosen using the Dynamic Voltage and Frequency Scaling (DVFS) method, and with a probability of...

    Provided By INRIA

  • White Papers // Aug 2013

    GeCoS: A Framework for Prototyping Custom Hardware Design Flows

    GeCoS is an open source framework that provides a highly productive environment for hardware design. GeCoS primarily targets custom hardware design using High Level Synthesis, distinguishing itself from classical compiler infrastructures. Compiling for custom hardware makes use of domain specific semantics that are not considered by general purpose compilers. Finding...

    Provided By INRIA

  • White Papers // Aug 2013

    Proved Generation of Implementations from Computationally Secure Protocol Specifications

    In order to obtain implementations of security protocols proved secure in the computational model, the authors previously proposed the following approach: they write a specification of the protocol in the input language of the computational protocol verifier CryptoVerif, prove it secure using CryptoVerif, then generate an OCaml implementation of the...

    Provided By INRIA

  • White Papers // Aug 2013

    Collective Mind: Cleaning Up the Research and Experimentation Mess in Computer Engineering Using Crowdsourcing, Big Data and Machine Learning

    Software and hardware co-design and optimization of HPC systems has become intolerably complex, ad-hoc, time consuming and error prone due to enormous number of available design and optimization choices, complex interactions between all software and hardware components, and multiple strict requirements placed on performance, power consumption, size, reliability and cost....

    Provided By INRIA

  • White Papers // Aug 2013

    On the Impact of Network Topology on Wireless Sensor Networks Performances

    Wireless Sensor Networks (WSN) are composed of constrained devices and deployed in unattended and hostile environments. Most papers presenting solutions for WSN evaluate their work over random topologies to highlight some of their \"Good\" performances. They rarely study these behaviors over more than one topology. Yet, the topology used can...

    Provided By INRIA

  • White Papers // Aug 2013

    Reliable Service Allocation in Clouds with Memory and Capacity Constraints

    The authors consider allocation problems that arise in the context of service allocation in clouds. More specifically, on the one part they assume that each Physical Machine (denoted as PM) is offering resources (memory, CPU, disk, network). On the other part, they assume that each application in the IaaS cloud...

    Provided By INRIA

  • White Papers // Jul 2013

    Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions

    In this paper, the authors investigate the security of a public-key encryption scheme introduced by Huang, Liu and Yang (HLY) at PKC'12. This new scheme can be provably reduced to the hardness of solving a set of quadratic equations whose coefficients of highest degree are chosen according to a discrete...

    Provided By INRIA

  • White Papers // Jul 2013

    CrystalGPU: Transparent and Efficient Utilization of GPU Power

    The explosion of the amount of data stored in cloud systems calls for more efficient paradigms for redundancy. While replication is widely used to ensure data availability, erasure correcting codes provide a much better trade-off between storage and availability. Regenerating codes are good candidates for they also offer low repair...

    Provided By INRIA

  • White Papers // Jul 2013

    Towards a Framework for Semantic Exploration of Frequent Patterns

    Mining frequent patterns is an essential task in discovering hidden correlations in datasets. Although frequent patterns unveil valuable information, there are some challenges which limit their usability. The number of possible patterns is often very large which hinders their effective exploration. Patterns with many items are hard to read and...

    Provided By INRIA

  • White Papers // Jul 2013

    Probabilistic Real-Time Systems

    Proposed originally as stochastic scheduling, the probabilistic real-time scheduling concerns real-time systems with at least one parameter described by a random variable. Any parameter of the task may have such description, but the existing work concentrates on the probabilistic worst-case execution times. This paper will provide the main results for...

    Provided By INRIA

  • White Papers // Jul 2013

    Privacy in Content-Oriented Networking: Threats and Countermeasures

    As the Internet struggles to cope with scalability, mobility, and security issues, new network architectures are being proposed to better accommodate the needs of modern systems and applications. In particular, Content-Oriented Networking (CON) has emerged as promising next-generation Internet architecture: it sets to decouple content from hosts, at the network...

    Provided By INRIA

  • White Papers // Jul 2013

    Towards QoS-Oriented SLA Guarantees for Online Cloud Services

    Cloud computing provides a convenient means of remote on-demand and pay-per-use access to computing resources. However, its ad hoc management of quality-of-service and SLA poses significant challenges to the performance, dependability and costs of online cloud services. The paper precisely addresses this issue and makes a threefold contribution. It introduces...

    Provided By INRIA

  • White Papers // Jun 2013

    Model-driven Extraction and Analysis of Network Security Policies

    Firewalls are a key element in network security. They are in charge of filtering the traffic of the network in compliance with a number of access-control rules that enforce a given security policy. In an always-evolving context, where security policies must often be updated to respond to new security requirements,...

    Provided By INRIA

  • White Papers // Jun 2013

    A Prioritized Distributed Mutual Exclusion Algorithm Balancing Priority Inversions and Response Time

    Distributed priority-based mutual exclusion algorithms may present starvation for low priority requests if the shared resource is continuously asked by high priority requests. To address this problem, several existing algorithms dynamically increment the priority of pending low-priority requests. The drawback of this approach is that it may lead to a...

    Provided By INRIA

  • White Papers // Jun 2013

    DB2SNA: An All-in-One Tool for Extraction and Aggregation of Underlying Social Networks From Relational Databases

    In the enterprise context, people need to visualize different types of interactions between heterogeneous objects (e.g. product and site, customers and product, people interaction (social network)...). The existing approaches focus on social networks extraction using web document. However a considerable amount of information is stored in relational databases. Therefore, relational...

    Provided By INRIA

  • White Papers // May 2013

    Adapting Workflows Using Generic Schemas: Application to the Security of Business Processes

    Existing approaches to the adaptation of workflows over web services fall short in two respects. First, they only provide, if ever, limited means for taking into account the execution history of a workflow. Second, they do not support adaptations that require modifications not only at the service composition level but...

    Provided By INRIA

  • White Papers // May 2013

    Advanced Validation of the DVMS Approach to Fully Distributed VM Scheduling

    The holy grail for Infrastructure as a Service (IaaS) providers is to maximize the utilization of their infrastructure while ensuring the Quality of Service (QoS) for the virtual machines they host. Although the frameworks in charge of managing Virtual Machines (VM) on pools of physical ones (PM) have been significantly...

    Provided By INRIA

  • White Papers // May 2013

    Dynamic Scalability of a Consolidation Service

    In the coming years, cloud environments will increasingly face energy saving issues. While consolidating the virtual machines running in a cloud is a well-accepted solution to reduce the energy consumption, ensuring the scalability of the consolidation service remains a challenging issue. In this paper, the authors propose an elastic consolidation...

    Provided By INRIA

  • White Papers // May 2013

    Performance Modeling for Power Consumption Reduction on SCC

    As power is becoming one of the biggest challenge in high performance computing, the authors are proposing a performance model on the Single-chip Cloud Computer in order to predict both power consumption and runtime of regular codes. This model takes into account the frequency at which the cores of the...

    Provided By INRIA

  • White Papers // Jul 2011

    An Efficient Attack on All Concrete KKS Proposals

    Kabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme based on a couple of random error-correcting codes. A variation of this scheme was proposed recently and was proven to be EUF-1CMA secure in the random oracle model. In this paper, the authors investigate the security of these schemes...

    Provided By INRIA

  • White Papers // Aug 2009

    MESURE Tool to Benchmark Java Card Platforms

    The advent of the Java Card standard has been a major turning point in smart card technology. With the growing acceptance of this standard, understanding the performance behavior of these platforms is becoming crucial. To meet this need, the authors present in this paper a novel benchmarking framework to test...

    Provided By INRIA

  • White Papers // Jun 2011

    Web Information Management With Access Control

    The authors investigate the problem of sharing private information on the Web, where the information is hosted on different machines that may use different access control and distribution schemes. They introduce a distributed knowledge-base model, termed WEBDAMEXCHANGE, which comprises logical statements for specifying data, access control, distribution and knowledge about...

    Provided By INRIA

  • White Papers // Jul 2011

    Automatic Multi-GPU Code Generation Applied to Simulation of Electrical Machines

    The electrical and electronic engineering has used parallel programming to solve its large scale complex problems for performance reasons. However, as parallel programming requires a non-trivial distribution of tasks and data, developers find it hard to implement their applications effectively. Thus, in order to reduce design complexity, the authors propose...

    Provided By INRIA

  • White Papers // Nov 2009

    Optimal Mobile Association on Hybrid Networks: Centralized and Decentralized Case

    This paper proposes a new approach based on optimal transport theory to model network topologies for purpose of strategic planning and optimal design. The authors study the SINR mobile association game: They determine the cells corresponding to each base station, i.e., the locations at which mobile terminals prefer to connect...

    Provided By INRIA

  • White Papers // Apr 2010

    On the Selection of Cluster Heads in MANETs

    Clustering schemes offer a practical way of providing scalability when dealing with large and dense Mobile Ad hoc NETworks (MANETs). The feasibility of a clustering method can be primarily determined by the complexity of the cluster head selection. Optimizing the cluster head selection allows for the network to be more...

    Provided By INRIA

  • White Papers // Apr 2011

    Sparse Image Representation With Epitomes

    Sparse coding, which is the decomposition of a vector using only a few basis elements, is widely used in machine learning and image processing. The basis set, also called dictionary, is learned to adapt to specific data. This approach has proven to be very effective in many image processing tasks....

    Provided By INRIA

  • White Papers // May 2011

    Learning Structured Prediction Models for Interactive Image Labeling

    The authors propose structured models for image labeling that take into account the dependencies among the image labels explicitly. These models are more expressive than independent label predictors, and lead to more accurate predictions. While the improvement is modest for fully-automatic image labeling, the gain is significant in an interactive...

    Provided By INRIA

  • White Papers // Jan 2011

    Security of Multithreaded Programs by Compilation

    Information security is a pressing challenge for mobile code technologies. In order to claim end-to-end security of mobile code, it is necessary to establish that the code neither intentionally nor accidentally propagates sensitive information to an adversary. Although mobile code is commonly multithreaded low-level code, the literature is lacking enforcement...

    Provided By INRIA

  • White Papers // Apr 2010

    Multi-Facet Approach to Reduce Energy Consumption in Clouds and Grids: The GREEN-NET Framework

    This paper presents an integrated framework for energy savings in large scale distributed systems such as grids and clouds. The framework comprises tools and mechanisms: to measure and log data about the energy consumed by resources; to present this information to users; to involve the users in decisions to reduce...

    Provided By INRIA

  • White Papers // Jun 2010

    Some Ideas on Virtualized System Security, and Monitors

    Virtualized systems such as Xen, VirtualBox, VMWare or QEmu have been proposed to increase the level of security achievable on personal computers. On the other hand, such virtualized systems are now targets for attacks. The authors propose intrusion detection architecture for virtualized systems, and discuss some of the security issues...

    Provided By INRIA

  • White Papers // Jul 2009

    A Generic Security API for Symmetric Key Management on Cryptographic Devices

    Security APIs are used to define the boundary between trusted and untrusted code. The security properties of existing APIs are not always clear. In this paper, the authors give a new generic API for managing symmetric keys on a trusted cryptographic device. They state and prove security properties for the...

    Provided By INRIA

  • White Papers // Jun 2009

    Type-Based Analysis of PIN Processing APIs

    The authors examine some known attacks on the PIN verification framework, based on weaknesses of the security API for the tamper resistant Hardware Security Modules used in the network. They specify this API in an imperative language with cryptographic primitives, and show how its flaws are captured by a notion...

    Provided By INRIA

  • White Papers // Aug 2009

    Efficient and Scalable Merging Algorithms for Wireless Traces

    Analysis of wireless experimentation results is a complex task to achieve. As multiple probes are needed in order to get a global view of a wireless experimentation, the resulting packet traces may be very large. In this paper the authors propose an algorithm that performs trace synchronization and merging in...

    Provided By INRIA

  • White Papers // Mar 2011

    On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model

    Bellare and Kohno introduced a formal framework for the study of related-key attacks against blockciphers. They established sufficient conditions (output-unpredictability and collision-resistance) on the set of Related-Key-Deriving (RKD) functions under which an ideal cipher is secure against related-key attacks, and suggested this could be used to derive security goals for...

    Provided By INRIA

  • White Papers // Jul 2010

    Enforcing Secure Object Initialization in Java

    Sun and the CERT recommend for secure Java development to not allow partially initialized objects to be accessed. The CERT considers the severity of the risks taken by not following this recommendation as high. The solution currently used to enforce object initialization is to implement a coding pattern proposed by...

    Provided By INRIA

  • White Papers // May 2011

    On Constructing Homomorphic Encryption Schemes From Coding Theory

    Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the recent decades but none of them was based on coding theory. The existence of such schemes would be interesting for several reasons. First, it is well...

    Provided By INRIA

  • White Papers // Nov 2010

    A Theory of Distributed Aspects

    Distributed applications are more complex to develop than sequential applications, mainly because of synchronization issues and distribution of the code across the network. It has been advocated that traditional programming languages do not allow to separate distribution concerns from standard functional concerns in a satisfactory way. For instance, data replication,...

    Provided By INRIA

  • White Papers // May 2010

    A Machine-Checked Formalization of Sigma-Protocols

    Proofs of knowledge are two-party interactive protocols where one party, called the prover, convinces the other one, called the verifier, that she knows something. Typically, both parties share a common input x and something refers to a witness w of membership of the input x to an N P language....

    Provided By INRIA

  • White Papers // Jun 2009

    Modeling and Verifying Ad Hoc Routing Protocols

    Mobile ad hoc networks consist of mobile wireless devices which autonomously organize their infrastructure. In such a network, a central issue, ensured by routing protocols, is to find a route from one device to another. Those protocols use cryptographic mechanisms in order to prevent a malicious node from compromising the...

    Provided By INRIA

  • White Papers // Jan 2011

    Self-Organization in Large Scale Ad Hoc Networks

    Flat ad hoc architectures are not scalable. In order to overcome this major drawback, hierarchical routing is introduced since it is found to be more effective. The main challenge in hierarchical routing is to group nodes into clusters. Each cluster is represented by one cluster head. Conventional methods use either...

    Provided By INRIA

  • White Papers // Jan 2011

    OLSR for IPv6 Networks

    Mobile ad-hoc networks are infrastructure-free, highly dynamics wireless networks, which enjoy sustained interest, especially, inside IETF within the MANET working-group. One of the MANET protocols which have been recently promoted to experimental RFC is the OLSR routing protocol, on which this paper focuses. Like many MANET routing protocols, the adaptation...

    Provided By INRIA

  • White Papers // Jan 2011

    An Aloha Protocol for Multihop Mobile Wireless Networks

    The authors define an Aloha type access control mechanism for large mobile, multihop, wireless networks. The access scheme is designed for the multihop context, where it is important to find a compromise between the spatial density of communications and the range of each transmission. More precisely, they optimize the product...

    Provided By INRIA

  • White Papers // Nov 2010

    On Energy-Aware Communication and Control Co-design in Wireless Networked Control Systems

    Energy is a key resource in Networked Control Systems, in particular in applications concerning wireless networks. This paper reviews the multi-layer architecture of those systems in the light of their energy-use, and points out major contributions in the area of energy-management policies, layer per layer. This review of the literature...

    Provided By INRIA

  • White Papers // Oct 2010

    On-line Distributed Bayesian Decision and Diagnosis of Wireless Networked Mobile Robots

    This paper deals with the problem of co-design of Wireless Networked Control Systems (WNCS). The integration of the Wireless Network (WN) in the control loop influences the Quality of Control (QoC) of the system in terms of the Quality of Service (QoS) of the WN. In this paper, a new...

    Provided By INRIA

  • White Papers // Apr 2011

    Node Coloring for Dense Wireless Sensor Networks

    Coloring is used in wireless networks to improve communication efficiency, mainly in terms of bandwidth, energy and possibly end-to-end delays. In this paper, the authors define the h-hop node coloring problem, with h any positive integer. They prove that the associated decision problem is NP-complete. They then present a 3-hop...

    Provided By INRIA

  • White Papers // Dec 2009

    Node Activity Scheduling in Wireless Sensor Networks

    Wireless sensor networks have resources of limited capacity (e.g. bandwidth, processing power, memory and energy). That is why these resources should be efficiently used. Node activity scheduling is a technique that allows nodes to alternate sleep and awake states. This technique spares energy insofar as the sleep state is the...

    Provided By INRIA

  • White Papers // May 2009

    Neighbor Discovery in Multi-Hop Wireless Networks: Evaluation and Dimensioning With Interference Considerations

    In this paper, the authors study the impact of collisions and interference on a neighbor discovery process in the context of multi-hop wireless networks. They consider three models in which interference and collisions are handled in very different ways. From an ideal channel where simultaneous transmissions do not interfere, they...

    Provided By INRIA

  • White Papers // Sep 2010

    On the Performance Evaluation of Wireless Networks With Broadcast and Interference-Limited Channels

    In this paper, the authors propose a MultiObjective (MO) performance evaluation framework for wireless ad hoc networks where criteria such as capacity, robustness, energy and delay are optimized concurrently. Within such a framework, they can determine both the Pareto-optimal performance bounds and the networking parameters that provide these bounds. The...

    Provided By INRIA

  • White Papers // Jul 2010

    Optimized Cross-Layer Adaptation for Improved Resource Management in Wireless Networks

    The theoretical analysis of a cross-layer mechanism for improving the quality of service of real-time applications in wireless networks is presented. The mechanism coordinates adaptations of the modulation order at the Physical layer and the media encoding mode at the Application layer, to improve packet loss rate, throughput and mean...

    Provided By INRIA

  • White Papers // Jul 2010

    Optimal Transmission Schemes in Wireless Networks and Their Comparison With Simple ALOHA Based Scheme

    The authors present their analysis and results that allow them to conjecture that maximum capacity in wireless networks can be achieved if nodes transmitting simultaneously are positioned in a hexagonal grid pattern. But obviously, it is very difficult to realize such a protocol which ensures that active transmitters in the...

    Provided By INRIA

  • White Papers // Nov 2009

    Optimal Routing and Call Scheduling in Wireless Mesh Networks With Localized Information

    Wireless mesh network performance issues have been modeled by the Joint Routing and Scheduling Problem (JRSP) in which a maximum per-flow throughput is computed. A classical relaxation of JRSP, denoted as the RoundWeighting Problem (RWP), consists in assigning enough weight to sets of compatible simultaneous transmissions (rounds), while minimizing the...

    Provided By INRIA

  • White Papers // Nov 2009

    An Optimization Framework for the Joint Routing and Scheduling in Wireless Mesh Networks

    In this paper, the authors address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a major impact on the capacity provided to the clients. A cross-layer optimization of these problems allows the routing to take into account contentions...

    Provided By INRIA

  • White Papers // Jun 2011

    Adapting Dynamically Neighbourhood Table Entry Lifetime in Wireless Sensor Networks

    Neighbour discovery and maintenance of neighbourhood tables have importance in wireless sensor networks. Almost every upper layer application such as routing or self-organizing relies on neighbourhood tables. Imprecise tables may lead to failures that may be costly in terms of resources which are very limited in such networks. Neighbourhood tables...

    Provided By INRIA

  • White Papers // Sep 2009

    A Distributed Algorithm for Fair and Efficient User-Network Association in Multi-Technology Wireless Networks

    Recent mobile equipment (as well as the norm IEEE 802.21) now offers the possibility for users to switch from one technology to another (vertical handover). This allows flexibility in resource assignments and, consequently, increases the potential throughput allocated to each user. In this paper, the authors design a fully distributed...

    Provided By INRIA

  • White Papers // Jul 2010

    A Multiobjective Performance Evaluation Framework for Routing in Wireless Ad Hoc Networks

    Wireless ad hoc networks are seldom characterized by one single performance metric, yet the current literature lacks a flexible framework to assist in characterizing the design tradeoffs in such networks. The aim of this paper is not to propose another routing strategy. Instead, the authors address this problem by proposing...

    Provided By INRIA

  • White Papers // May 2009

    A Line-Based Data Dissemination Protocol for Wireless Sensor Networks With Mobile Sink

    In wireless sensor networks, data dissemination is generally performed from the sensor nodes towards a static sink. In this paper, the authors address the particular case where the sink is mobile, according to an unpredictable mobility pattern. First, they study existing approaches. As an alternative, they present the Line-Based Data...

    Provided By INRIA

  • White Papers // Nov 2009

    A Prioritized Multi-Channel Multi-Time Slot MAC Protocol for Large-Scale Wireless Sensor Networks

    This paper addresses a new Prioritized MultiChannel Multi-Time slot MAC Protocol (PMCMTP) for large-scale WSNs especially for Ultra-Wide Band (UWB) based networks. To reduce the complexity of resource sharing, the global network is composed of a set of Personal Area Networks (PANs) or cells. According to available resource and PANs...

    Provided By INRIA

  • White Papers // Apr 2011

    A Novel Family of Geometric Planar Graphs for Wireless Ad Hoc Networks

    The authors propose a radically new family of geometric graphs, i.e., Hypocomb, Reduced Hypocomb and Local Hypocomb. The first two are extracted from a complete graph; the last is extracted from a Unit Disk Graph (UDG). They analytically study their properties including connectivity, planarity and degree bound. All these graphs...

    Provided By INRIA

  • White Papers // Aug 2011

    A Theoretical Model for Analyzing the Impact of Jitter-Based Techniques on Flooding Over Wireless Ad Hoc Networks

    Jitter is used in wireless ad hoc networks to reduce the number of packet collisions and the number of transmissions. This is done by scheduling random back-off for each packet to be transmitted and by piggybacking multiple packets in a single transmission. This technique has been standardized by the IETF...

    Provided By INRIA