Budapest University of Technology and Economics

Displaying 1-40 of 74 results

  • White Papers // Jun 2013

    On-the-Fly Packet Error Recovery in a Cooperative Cluster of Mobile Devices

    This paper investigates the possibility of packet error recovery in a cooperative cluster of mobile devices. The authors assume that these devices receive data from a broadcast transmission on their primary network interface (e.g. LTE network), and they are using a secondary network interface (e.g. ad hoc WLAN network) to...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jun 2013

    Extending an Application with Security Code Using Intermediate Level Obfuscation Technique

    Software piracy in general is the illegal copying, distribution, or use of software. The problem of mislicensing, unauthorized reproduction, or misuse of software has to be solved to successfully counteract software piracy. Such copy-protection and misuse-protection mechanism as a dongle is often used with expensive packages and vertical market software....

    Provided By Budapest University of Technology and Economics

  • White Papers // Feb 2013

    SDTP+: Securing a Distributed Transport Protocol for WSNs Using Merkle Trees and Hash Chains

    Transport protocols for Wireless Sensor Networks (WSNs) are designed to fulfill both reliability and energy efficiency requirements. Distributed Transport for Sensor Networks (DTSN) is one of the most promising transport protocols designed for WSNs because of its effectiveness; however, it does not address any security issues, hence it is vulnerable...

    Provided By Budapest University of Technology and Economics

  • White Papers // Feb 2013

    Blocking and Non-Blocking Concurrent Hash Tables in Multi-Core Systems

    Widespread use of multi-core systems demands highly parallel applications and algorithms in everyday computing. Parallel data structures, which are basic building blocks of concurrent algorithms, are hard to design in a way that they remain both fast and simple. By using mutual exclusion they can be implemented with little effort,...

    Provided By Budapest University of Technology and Economics

  • White Papers // Nov 2012

    Stateless Multi-Stage Dissemination of Information: Source Routing Revisited

    Large-scale information distribution has been increasingly attracting attention, be it through uptake in new services or through recent research efforts in fields like information-centric networking. The core issue to be addressed is the more efficient distribution of information to a large set of receivers. Avoiding state in the forwarding elements...

    Provided By Budapest University of Technology and Economics

  • White Papers // Oct 2012

    Quantum Hyperdense Coding for Distributed Communications

    Superdense coding proved that entanglement-assisted quantum communications can improve the data transmission rates compared to classical systems. It allows sending 2 classical bits between the parties in exchange of 1 quantum bit and a pre-shared entangled Bell pair. This paper introduces a new protocol which is intended for distributed communication....

    Provided By Budapest University of Technology and Economics

  • White Papers // Jul 2012

    Information Geometric Security Analysis of Differential Phase Shift Quantum Key Distribution Protocol

    This paper analyzes the information-theoretical security of the Differential Phase Shift (DPS) Quantum Key Distribution (QKD) protocol, using efficient computational information geometric algorithms. The DPS QKD protocol was introduced for practical reasons, since the earlier QKD schemes were too complicated to implement in practice. The DPS QKD protocol can be...

    Provided By Budapest University of Technology and Economics

  • White Papers // Apr 2012

    Game-Theoretic Robustness of Many-to-One Networks

    In this paper, the authors study the robustness of networks that are characterized by many-to-one communications (e.g., access networks and sensor networks) in a game-theoretic model. More specifically, they model the interactions between a network operator and an adversary as a two player zero-sum game, where the network operator chooses...

    Provided By Budapest University of Technology and Economics

  • White Papers // Feb 2012

    Integrated OpenFlow Virtualization Framework with Flexible Data, Control and Management Functions

    Today's virtualization tools for OpenFlow networks make use of the FlowVisor concept. It limits extending the switch functionality, as there could be various types of OpenFlow switches and controllers in the same network using different versions of the OpenFlow protocol. Existing frameworks do not focus on running and configuring the...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2012

    Concurrency Without Locking in Parallel Hash Structures Used for Data Processing

    Various mechanisms providing mutual exclusion and thread synchronization can be used to support parallel processing within a single computer. Instead of using locks, semaphores, barriers or other traditional approaches in this paper, the authors focus on alternative ways for making better use of modern multi-threaded architectures and preparing hash tables...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2012

    A Machine Learning Based Approach for Predicting Undisclosed Attributes in Social Networks

    Online Social Networks have gained increased popularity in recent years. However, besides their many advantages, they also represent privacy risks for the users. In order to control access to their private information, users of OSNs are typically allowed to set the visibility of their profile attributes, but this may not...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2012

    Secure and Reliable Clustering in Wireless Sensor Networks: A Critical Survey

    In the past few years, research interest has been increased towards Wireless Sensor Networks (WSNs) and their application in both the military and civil domains. To support scalability in WSNs and increase network lifetime, nodes are often grouped into disjoint clusters. However, secure and reliable clustering, which is critical in...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2012

    Elastic Traffic Effects on WDM Dynamic Grooming Algorithms

    Traffic grooming in IP over WDM networks introduces a coupling between the optical layer and the IP layer. Grooming algorithms are normally studied with a very simple traffic model that completely ignores this interaction. This paper compares the performance of two simple grooming algorithms with a traditional, Poisson based traffic...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2012

    Impact of Intra-LTE Handover With Forwarding on the User Connections

    In order to ensure long-term competitiveness of 3G technology, a new study item has been started by 3GPP to define the Long Term Evolution (LTE) of 3G. The scope of the LTE concept is to improve the system performance in terms of data rate, throughput, latency, coverage and cost. LTE...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2012

    Dynamic Grooming in IP Over Optical Networks Based on the Overlay Architecture

    This paper defines a formal framework for the definition of dynamic grooming policies in IP over optical networks. The formal framework is then specialized for the Overlay Architecture, where the control plane of the IP and optical level are separated, and no information is shared between the two. The authors...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2012

    Analysis of Elastic Traffic Effects on WDM Dynamic Grooming Algorithms

    Traffic grooming in IP over WDM networks introduces a coupling between the optical layer and the IP layer. Grooming algorithms are normally studied with a very simple traffic model that completely ignores this interaction. This paper compares the performance of two simple grooming algorithms with a traditional, Poisson based traffic...

    Provided By Budapest University of Technology and Economics

  • White Papers // Dec 2011

    UC Framework for Anonymous Communication

    In this paper, the authors present an UC framework for the general task of anonymous communication. Definition of the ideal and the real models are carried out in the BPW (Backes-Pfitzmann-Waidner) formalism. It is shown how this approach relates to and extends earlier proposals. They consider also the adaptive adversary....

    Provided By Budapest University of Technology and Economics

  • White Papers // Oct 2011

    Designing Robust Network Topologies for Wireless Sensor Networks in Adversarial Environments

    In this paper, the authors address the problem of deploying sink nodes in a wireless sensor network such that the resulting network topology is robust. In order to measure network robustness, they propose a new metric, called persistence, which better captures the notion of robustness than the widely known connectivity...

    Provided By Budapest University of Technology and Economics

  • White Papers // Sep 2011

    Analysis of Channel Estimation Imperfections within the 3GPP LTE Physical Layer

    This paper aims the investigation of radio link performance of the 3GPP LTE in terms of the bit- and block error rate, assuming different error models for the feedback of the channel state information and the pre-coding matrix indicator. For the former, the imperfect knowledge of the radio channel is...

    Provided By Budapest University of Technology and Economics

  • White Papers // Sep 2011

    Cloud Computing Technology for Networked Enterprises

    Today manufacturing enterprises have to organize themselves into effective system architectures to match fast changing market demands. These architectures can be realized only by using computer networks in order to co-ordinate the production of the distributed units forming different types of Networked Enterprises (NE). Cloud Computing (CC) is an important...

    Provided By Budapest University of Technology and Economics

  • White Papers // Aug 2011

    VeRA - Version Number and Rank Authentication in RPL

    Designing a routing protocol for large Low-power and Lossy Networks (LLNs), consisting of thousands of constrained nodes and unreliable links, presents new challenges. The IPv6 Routing Protocol for Low-power and Lossy Networks (RPL), have been developed by the IETF ROLL Working Group as a preferred routing protocol to provide IPv6...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jun 2011

    Anonymous Aggregator Election and Data Aggregation in Wireless Sensor Networks

    In mission critical cyber-physical systems, dependability is an important requirement at all layers of the system architecture. In this paper, the authors propose protocols that increase the dependability of wireless sensor networks, which are potentially useful building blocks in cyber-physical systems. More specifically, they propose two private aggregator node election...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jun 2011

    XCS Based Hidden Firmware Modification on Embedded Devices

    Most contemporary embedded devices, such as wireless routers, digital cameras, and digital photo frames, have Web based management interfaces that allow an administrator to perform management tasks on the device from a Web browser connecting to the device's Web server. It has been shown earlier that many of these devices...

    Provided By Budapest University of Technology and Economics

  • White Papers // May 2011

    CLEARER: CrySyS Laboratory Security and Privacy Research Roadmap

    The Laboratory of Cryptography and System Security (CrySyS) is dedicated to conduct research in the field of computer security and user privacy. This paper shows a research roadmap of the CrySyS Lab from its inception in 2003 until today. The authors will present the major achievements in the past with...

    Provided By Budapest University of Technology and Economics

  • White Papers // May 2011

    Analytic Results And Weighted Monte Carlo Simulations For CDO Pricing

    The authors explore the possibilities of importance sampling in the Monte Carlo pricing of a structured credit derivative referred to as Collateralized Debt Obligation (CDO). Modeling a CDO contract is challenging, since it depends on a pool of (typically 100) assets, Monte Carlo simulations are often the only feasible approach...

    Provided By Budapest University of Technology and Economics

  • White Papers // May 2011

    Optimization of Out-of-Core Data Preparation Methods Identifying Runtime Determining Factors

    In the data preparation phase of a data mining task the raw, fine granulated data has to be transformed according to analytical aims into a more compact form in order to represent data at a higher abstraction level suitable for machine processing and human understanding as well. Vast datasets require...

    Provided By Budapest University of Technology and Economics

  • White Papers // Mar 2011

    Backpressure Approach for Bypassing Jamming Attacks in Wireless Sensor Networks

    The wireless medium used by sensor networks makes it easy for adversaries to launch jamming attacks that can block communication. In order to bypass the jamming area, tree-based routing protocols need to reconstruct the tree, a path or choosing new parent which is time consuming. In addition, bypassing congests the...

    Provided By Budapest University of Technology and Economics

  • White Papers // Mar 2011

    Click Trajectories: End-to-End Analysis of the Spam Value Chain

    Spam-based advertising is a business. While it has engendered both widespread antipathy and a multi-billion dollar anti-spam industry, it continues to exist because it fuels a profitable enterprise. The authors lack, however, a solid understanding of this enterprise's full structure, and thus most anti-spam interventions focus on only one facet...

    Provided By Budapest University of Technology and Economics

  • White Papers // Mar 2011

    Cryptographically Sound Security Proof for On-Demand Source Routing Protocol EndairA

    This paper presents the first cryptographically sound security proof of a routing protocol for mobile ad-hoc networks. More precisely, the authors show that the route discovery protocol does not output a non-existing path under arbitrary active attacks, where on a non-existing path there exists at least one pair of neighboring...

    Provided By Budapest University of Technology and Economics

  • White Papers // Feb 2011

    IP Fast ReRoute: Loop Free Alternates Revisited

    IP Fast ReRoute (IPFRR) is the IETF standard for providing fast failure protection in IP and MPLS/LDP networks and Loop Free Alternates (LFA) is a basic specification for implementing it. Even though LFA is simple and unobtrusive, it has a significant drawback: it does not guarantee protection for all possible...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2011

    Automatic Rearrangement of Localized Graphical User Interface

    The localization of software products is essential for reaching the users of the international market. An important task for this is the translation of the user interface into local national languages. As graphical interfaces are usually optimized for the size of the texts in the original language, after the translation...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2011

    Shared Protection of Virtual Private Networks With Traffic Concentration

    In the authors' paper, they analyze algorithms that solve the optimal path search problem including the protection as well. They investigated the special case when multiple full mesh demand sets (forming VPNs) have to be built. They addressed the pro-active path based shared protection scheme and investigated heuristic algorithms to...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2011

    Heuristic Algorithms for Shared Protection of Virtual Private Networks

    Optimal routing in backbone networks with capacity constraints is a known problem. The task could be solved e.g. by integer programming or by heuristic algorithms. In the authors' paper, they analyzed heuristic algorithms that solve the above-mentioned problem including protection. Furthermore they investigated a special case when multiple full mesh...

    Provided By Budapest University of Technology and Economics

  • White Papers // Oct 2010

    Design Principles of Routing Protocols in Wireless Sensor Networks

    There have been proposed multiple surveys on wireless sensor network routing in the past. However, they use rough operational and network models to classify routing protocols as well as disregard works which are not routing protocols but rather function as separate routing modules. Moreover, dependability concepts of sensor network routing...

    Provided By Budapest University of Technology and Economics

  • White Papers // Oct 2010

    A Novel Approach for Failure Localization in All-Optical Mesh Networks

    Achieving fast and precise failure localization has long been a highly desired feature in all-optical mesh networks. M-trail (monitoring trail) has been proposed as the most general monitoring structure for achieving Unambiguous Failure Localization (UFL) of any single link failure while effectively reducing the amount of alarm signals flooding the...

    Provided By Budapest University of Technology and Economics

  • White Papers // Sep 2010

    On Scheduling and Redundancy for P2P Backup

    An online backup system should be quick and reliable in both saving and restoring users' data. To do so in a peer-to-peer implementation, data transfer scheduling and the amount of redundancy must be chosen wisely. The authors formalize the problem of exchanging multiple pieces of data with intermittently available peers,...

    Provided By Budapest University of Technology and Economics

  • White Papers // Aug 2010

    Perfectly Anonymous Data Aggregation in Wireless Sensor Networks

    Clustering and data aggregation in wireless sensor networks improves scalability, and helps the efficient use of scarce resources. Yet, these mechanisms also introduce some security issues; in particular, aggregator nodes become attractive targets of physical destruction and jamming attacks. In order to mitigate this problem, the authors propose a new...

    Provided By Budapest University of Technology and Economics

  • White Papers // Aug 2010

    Marketing Relations In The Case Of A Micro-Enterprise In The High Tech Industry

    In this paper, the development and the change of the marketing-communication of a microenterprise is discussed. This micro-enterprise is operating in the field of the medical technology, i.e. in the high tech industry. The paper commenced with the thorough investigation of the relevant literature and from the conclusions of this...

    Provided By Budapest University of Technology and Economics

  • White Papers // Aug 2010

    Efficiency In Transport Logistics

    Efficiency in transport logistics can be evaluated from several aspects: From the point of view of the service provider, from the perspective of the customer, or that of the government and from the point of view of sustainability. Efficiency will always mean approximately the same thing but emphasis might shift...

    Provided By Budapest University of Technology and Economics

  • White Papers // Aug 2010

    Model Transformation With a Visual Control Flow Language

    Graph rewriting-based visual model processing is a widely used technique for model transformation. Visual model transformations often need to follow an algorithm that requires a strict control over the execution sequence of the transformation steps. Therefore, in Visual Model Processors (VMPs) the execution order of the transformation steps is crucial....

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2012

    Elastic Traffic Effects on WDM Dynamic Grooming Algorithms

    Traffic grooming in IP over WDM networks introduces a coupling between the optical layer and the IP layer. Grooming algorithms are normally studied with a very simple traffic model that completely ignores this interaction. This paper compares the performance of two simple grooming algorithms with a traditional, Poisson based traffic...

    Provided By Budapest University of Technology and Economics

  • White Papers // Apr 2010

    Misbehaving Router Detection in Link-State Routing for Wireless Mesh Networks

    In this paper, the authors address the problem of detecting misbehaving routers in wireless mesh networks and avoiding them when selecting routes. They assume that link-state routing is used, and they essentially propose a reputation system, where trusted gateway nodes compute Node Trust Values for the routers, which are fed...

    Provided By Budapest University of Technology and Economics

  • White Papers // Oct 2010

    Design Principles of Routing Protocols in Wireless Sensor Networks

    There have been proposed multiple surveys on wireless sensor network routing in the past. However, they use rough operational and network models to classify routing protocols as well as disregard works which are not routing protocols but rather function as separate routing modules. Moreover, dependability concepts of sensor network routing...

    Provided By Budapest University of Technology and Economics

  • White Papers // Oct 2012

    Quantum Hyperdense Coding for Distributed Communications

    Superdense coding proved that entanglement-assisted quantum communications can improve the data transmission rates compared to classical systems. It allows sending 2 classical bits between the parties in exchange of 1 quantum bit and a pre-shared entangled Bell pair. This paper introduces a new protocol which is intended for distributed communication....

    Provided By Budapest University of Technology and Economics

  • White Papers // Jul 2012

    Information Geometric Security Analysis of Differential Phase Shift Quantum Key Distribution Protocol

    This paper analyzes the information-theoretical security of the Differential Phase Shift (DPS) Quantum Key Distribution (QKD) protocol, using efficient computational information geometric algorithms. The DPS QKD protocol was introduced for practical reasons, since the earlier QKD schemes were too complicated to implement in practice. The DPS QKD protocol can be...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2012

    Impact of Intra-LTE Handover With Forwarding on the User Connections

    In order to ensure long-term competitiveness of 3G technology, a new study item has been started by 3GPP to define the Long Term Evolution (LTE) of 3G. The scope of the LTE concept is to improve the system performance in terms of data rate, throughput, latency, coverage and cost. LTE...

    Provided By Budapest University of Technology and Economics

  • White Papers // Sep 2011

    Analysis of Channel Estimation Imperfections within the 3GPP LTE Physical Layer

    This paper aims the investigation of radio link performance of the 3GPP LTE in terms of the bit- and block error rate, assuming different error models for the feedback of the channel state information and the pre-coding matrix indicator. For the former, the imperfect knowledge of the radio channel is...

    Provided By Budapest University of Technology and Economics

  • White Papers // Apr 2012

    Game-Theoretic Robustness of Many-to-One Networks

    In this paper, the authors study the robustness of networks that are characterized by many-to-one communications (e.g., access networks and sensor networks) in a game-theoretic model. More specifically, they model the interactions between a network operator and an adversary as a two player zero-sum game, where the network operator chooses...

    Provided By Budapest University of Technology and Economics

  • White Papers // Oct 2011

    Designing Robust Network Topologies for Wireless Sensor Networks in Adversarial Environments

    In this paper, the authors address the problem of deploying sink nodes in a wireless sensor network such that the resulting network topology is robust. In order to measure network robustness, they propose a new metric, called persistence, which better captures the notion of robustness than the widely known connectivity...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2012

    Secure and Reliable Clustering in Wireless Sensor Networks: A Critical Survey

    In the past few years, research interest has been increased towards Wireless Sensor Networks (WSNs) and their application in both the military and civil domains. To support scalability in WSNs and increase network lifetime, nodes are often grouped into disjoint clusters. However, secure and reliable clustering, which is critical in...

    Provided By Budapest University of Technology and Economics

  • White Papers // Mar 2010

    Efficient Computational Information Geometric Analysis of Physically Allowed Quantum Cloning Attacks for Quantum Key Distribution Protocols

    In secret quantum communications the best eavesdropping attacks on quantum cryptography are based on imperfect cloning machines. The incoherent attack, based on quantum cloning, is the most common eavesdropping strategy. Using a probe, the eavesdropper imperfectly clones the sender's quantum state which keeps one copy and sends the other. The...

    Provided By Budapest University of Technology and Economics

  • White Papers // Dec 2009

    Characterization of Advanced Round Robin Scheduler

    In this paper, the authors show that Advanced Round Robin (ARR) scheduler is in the class of Latency Rate servers and it also belongs to the class of guaranteed rate servers. They present the latency parameter and the error term of ARR. Next, they evaluate the fairness characteristic. Finally, they...

    Provided By Budapest University of Technology and Economics

  • White Papers // Nov 2012

    Stateless Multi-Stage Dissemination of Information: Source Routing Revisited

    Large-scale information distribution has been increasingly attracting attention, be it through uptake in new services or through recent research efforts in fields like information-centric networking. The core issue to be addressed is the more efficient distribution of information to a large set of receivers. Avoiding state in the forwarding elements...

    Provided By Budapest University of Technology and Economics

  • White Papers // Feb 2013

    SDTP+: Securing a Distributed Transport Protocol for WSNs Using Merkle Trees and Hash Chains

    Transport protocols for Wireless Sensor Networks (WSNs) are designed to fulfill both reliability and energy efficiency requirements. Distributed Transport for Sensor Networks (DTSN) is one of the most promising transport protocols designed for WSNs because of its effectiveness; however, it does not address any security issues, hence it is vulnerable...

    Provided By Budapest University of Technology and Economics

  • White Papers // Apr 2010

    Detection and Recovery From Pollution Attacks in Coding Based Distributed Storage Schemes

    The authors address the problem of pollution attacks in coding based distributed storage systems. In a pollution attack, the adversary maliciously alters some of the stored encoded packets, which results in the incorrect decoding of a large part of the original data upon retrieval. They propose algorithms to detect and...

    Provided By Budapest University of Technology and Economics

  • White Papers // May 2011

    Optimization of Out-of-Core Data Preparation Methods Identifying Runtime Determining Factors

    In the data preparation phase of a data mining task the raw, fine granulated data has to be transformed according to analytical aims into a more compact form in order to represent data at a higher abstraction level suitable for machine processing and human understanding as well. Vast datasets require...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jun 2013

    On-the-Fly Packet Error Recovery in a Cooperative Cluster of Mobile Devices

    This paper investigates the possibility of packet error recovery in a cooperative cluster of mobile devices. The authors assume that these devices receive data from a broadcast transmission on their primary network interface (e.g. LTE network), and they are using a secondary network interface (e.g. ad hoc WLAN network) to...

    Provided By Budapest University of Technology and Economics

  • White Papers // Feb 2012

    Integrated OpenFlow Virtualization Framework with Flexible Data, Control and Management Functions

    Today's virtualization tools for OpenFlow networks make use of the FlowVisor concept. It limits extending the switch functionality, as there could be various types of OpenFlow switches and controllers in the same network using different versions of the OpenFlow protocol. Existing frameworks do not focus on running and configuring the...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2009

    Application of Data Mining in Failure Data Analysis

    The paper outlines the application of two data mining techniques for the automatic processing of failure data. The first solutions aims at identifying those parts of a complex HW/SW system built up of COTS components whose incompatibilities or undesired interactions lead to system failures. The second approach is proposed for...

    Provided By Budapest University of Technology and Economics

  • White Papers // Aug 2009

    Consistency Verification of Stateful Firewalls Is Not Harder Than the Stateless Case

    Firewalls play an important role in the enforcement of access control policies in contemporary networks. However, firewalls are effective only if they are configured correctly such that their access control rules are consistent and the firewall indeed implements the intended access control policy. Unfortunately, due to the potentially large number...

    Provided By Budapest University of Technology and Economics

  • White Papers // Feb 2009

    Motivations, Design and Business Models of Wireless Community Networks

    This paper provides an integrated presentation of applications, technologies and business models for wireless community network together with design considerations and examples. An overview is given of the state-of-the-affairs of wireless community networks. Driving forces and stakeholders of the projects and the applications and services will be presented for some...

    Provided By Budapest University of Technology and Economics

  • White Papers // May 2009

    A Measurement Study on IKEv2 Authentication Performance in Wireless Networks

    This paper presents an experimental evaluation of the performance costs of a wide variety of authentication methods over IKEv2 in wireless networks. The studied methods are Pre-Shared Keys (PSK), Extensible Authentication Protocol (EAP) using MD5, SIM, TTLS-MD5, TLS, and PEAP-MSCHAPv2. For the EAP-based methods RADIUS is used as Authentication, Authorization,...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2009

    Adaptation of Terminal to Base Station Assignment to Terminal Activities and Rain Event in Broadband Fixed Wireless Access Systems

    In point-multipoint systems the signal to interference plus noise ratio highly depends on the assignment of terminal stations (TS) to base stations (BS). The Broadband Fixed Wireless Access (BFWA) systems operate at high carrier frequencies, i.e. microwave domain. In this frequency range wave propagation is highly influenced by precipitation, especially...

    Provided By Budapest University of Technology and Economics

  • White Papers // Feb 2010

    Security Analysis of Reliable Transport Layer Protocols for Wireless Sensor Networks

    End-to-end reliability of communications is an important requirement in many applications of wireless sensor networks. For this reason, a number of reliable transport protocols specifically designed for wireless sensor networks have been proposed in the literature. Besides providing end-to-end reliability, some of those protocols also address the problems of fairness...

    Provided By Budapest University of Technology and Economics

  • White Papers // Oct 2009

    SLOW: A Practical Pseudonym Changing Scheme for Location Privacy in VANETs

    Untraceability of vehicles is an important requirement in future vehicle communications systems. Unfortunately, heartbeat messages used by many safety applications provide a constant stream of location data, and without any protection measures, they make tracking of vehicles easy even for a passive eavesdropper. One commonly known solution is to transmit...

    Provided By Budapest University of Technology and Economics

  • White Papers // Aug 2011

    VeRA - Version Number and Rank Authentication in RPL

    Designing a routing protocol for large Low-power and Lossy Networks (LLNs), consisting of thousands of constrained nodes and unreliable links, presents new challenges. The IPv6 Routing Protocol for Low-power and Lossy Networks (RPL), have been developed by the IETF ROLL Working Group as a preferred routing protocol to provide IPv6...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jun 2010

    Cross-Layer Security and Resilience in Wireless Mesh Networks

    Security and resilience has become an important concern in the security design and architecture of future wireless networking technologies like Wireless Mesh Networks (WMN). Network operators and service providers consider mesh networking to be a serious candidate to solve the so called "Last mile problem" based on their wider coverage...

    Provided By Budapest University of Technology and Economics

  • White Papers // Sep 2011

    Cloud Computing Technology for Networked Enterprises

    Today manufacturing enterprises have to organize themselves into effective system architectures to match fast changing market demands. These architectures can be realized only by using computer networks in order to co-ordinate the production of the distributed units forming different types of Networked Enterprises (NE). Cloud Computing (CC) is an important...

    Provided By Budapest University of Technology and Economics

  • White Papers // Dec 2008

    Designing a Secure Label-Switching Routing Protocol for Wireless Sensor Networks

    Although a multitude of routing protocols exist for wireless sensor networks developed for various application domains, secure sensor network routing protocols do not exhibit such variety. In addition, those few sensor network routing protocols that were developed with security in mind still lack a formal proof of their security properties....

    Provided By Budapest University of Technology and Economics

  • White Papers // Dec 2009

    Application-Level Data Dissemination in Multi-Hop Wireless Networks

    The authors investigate different schemes for data dissemination in multi-hop ad-hoc networks using network coding. They study the performance of these schemes in terms of the completion time when a set of data packets must be disseminated from a single source to all nodes in a multi-hop network, i.e. a...

    Provided By Budapest University of Technology and Economics

  • White Papers // Aug 2009

    Multipath Video Streaming Using GRA Network Ordering Algorithm Without Rank Inconsistency

    Simultaneous connection to several networks through multiple interfaces is possible with today's mobile terminals. In order to efficiently utilize the interfaces' capabilities and increase the quality of the streamed video, multipath streaming can be used. Resource intensive applications can deliver high bitrate streams over multiple paths by cumulating the available...

    Provided By Budapest University of Technology and Economics

  • White Papers // Oct 2010

    A Novel Approach for Failure Localization in All-Optical Mesh Networks

    Achieving fast and precise failure localization has long been a highly desired feature in all-optical mesh networks. M-trail (monitoring trail) has been proposed as the most general monitoring structure for achieving Unambiguous Failure Localization (UFL) of any single link failure while effectively reducing the amount of alarm signals flooding the...

    Provided By Budapest University of Technology and Economics

  • White Papers // Aug 2009

    Scalable Web Reasoning Using Logic Programming Techniques

    One of the key issues for the uptake of the Semantic Web idea is the availability of reasoning techniques that are usable on a large scale and that offer rich modelling capabilities by providing comprehensive coverage of the OWL language. In this paper, the authors present a scalable extension of...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jun 2009

    Prolog Based Description Logic Reasoning

    In this paper, the authors present the recent developments of the DLog system, an ABox reasoning engine for the SHIQ description logic language. DLog differs from traditional description logic reasoners in that it transforms description logic axioms into a Prolog program. The transformation is done independently from the ABox, i.e....

    Provided By Budapest University of Technology and Economics

  • White Papers // Apr 2010

    Detection and Recovery From Pollution Attack in Coding Based Distributed Storage Schemes

    The authors address the problem of pollution attacks in coding based distributed storage systems. In a pollution attack, the adversary maliciously alters some of the stored encoded packets, which results in the incorrect decoding of a large part of the original data upon retrieval. They propose algorithms to detect and...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2012

    A Machine Learning Based Approach for Predicting Undisclosed Attributes in Social Networks

    Online Social Networks have gained increased popularity in recent years. However, besides their many advantages, they also represent privacy risks for the users. In order to control access to their private information, users of OSNs are typically allowed to set the visibility of their profile attributes, but this may not...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jun 2011

    XCS Based Hidden Firmware Modification on Embedded Devices

    Most contemporary embedded devices, such as wireless routers, digital cameras, and digital photo frames, have Web based management interfaces that allow an administrator to perform management tasks on the device from a Web browser connecting to the device's Web server. It has been shown earlier that many of these devices...

    Provided By Budapest University of Technology and Economics

  • White Papers // Jan 2012

    Concurrency Without Locking in Parallel Hash Structures Used for Data Processing

    Various mechanisms providing mutual exclusion and thread synchronization can be used to support parallel processing within a single computer. Instead of using locks, semaphores, barriers or other traditional approaches in this paper, the authors focus on alternative ways for making better use of modern multi-threaded architectures and preparing hash tables...

    Provided By Budapest University of Technology and Economics

  • White Papers // Mar 2010

    Accelerating RSA Encryption Using Random Precalculations

    RSA encryption and digital signature algorithm is considered secure if keys are 1024 - 4096 bits long. Since, it requires modular exponentiation on numbers of this length, embedded systems need either a cryptographic co-processor or a fast CPU to calculate ciphertexts and signatures. In many applications, the sender is resource-scare,...

    Provided By Budapest University of Technology and Economics

  • White Papers // Dec 2011

    UC Framework for Anonymous Communication

    In this paper, the authors present an UC framework for the general task of anonymous communication. Definition of the ideal and the real models are carried out in the BPW (Backes-Pfitzmann-Waidner) formalism. It is shown how this approach relates to and extends earlier proposals. They consider also the adaptive adversary....

    Provided By Budapest University of Technology and Economics