Dissertations / Theses on the topic 'TTH protocolo'

One of the most crucial factors that e-commerce protocols should address is a fair exchange. In this research, an advanced method of cryptography coupled with the pay per use technique is used. A new electronic commerce protocol for the exchange of commodities is introduced. The proposed new protocol guarantees both features while addressing the main drawbacks associated with other related protocols. The new suggested e-commerce protocol is composed of two stages: pre-exchange and exchange stages. When the suggested new protocol is analysed with scrupulous protocol analysis, it attains fair exchange and a secure method of payment. The suggested new e-commerce protocol is more efficient than other related existing protocols. In this research “protocol prototype” and “model checking” is used for the purpose of authentication. The protocol prototype verifies that the suggested new protocol is executable when it's used in a real context. By experimental designs, this research shows the length of asymmetric keys as the biggest element that affects the efficiency of the protocol. When model-checking is applied in this protocol, the outcome indicates that the suggested protocol achieves the required features of fairness. Protocol extensions give those involved in the protocol the capacity to be resilient to failure. By using three methods of authentication, this research confirms that the new proposed protocol is well formulated. The work reported in this thesis first study the existing fair exchange protocols that solve the fairness problem. Then, propose more efficient protocol to solve the fairness problem. The original idea in this thesis is to reduce the communication overheads, risks and solve the bottleneck problems in the protocols that involve an online TTP.

O trabalho apresenta uma comparação entre protocolos de comunicação tolerantes a falha, TTP/C e Flexray, utilizando um simulador de tempo real, propondo modelar uma aplicação brake-by-wire tolerante a falhas que gere uma intensa troca de dados validando a comparação. O presente trabalho toma como base um modelo de um sistema de freio antitravamento (ABS - Antilock Brake System) para uma única roda, de Michaels e Quinn (1997), estendendo tal trabalho ao desenvolvimento de uma aplicação brake-by-wire, composta basicamente de 5 nós, sendo um controlador central e 4 nós locais apara as rodas do veículo. Após uma breve descrição introdutória sobre os conceitos básicos necessários para entender o projeto, a aplicação brake-by-wire será apresentada. Posteriormente serão apresentados conceitos de funcionamento da aplicação, tolerância a falha, controle de frenagem, entre outros. A modelagem e simulação do sistema foi realizada na ferramenta computacional TrueTime baseada no Matlab/Simulink, utilizando kernels de tempo real. A simulação demonstra os diferentes comportamentos da aplicação quando protocolos TTP/C e Flexray variam em largura de banda e taxa de utilização do barramento. Foi inserido um nó de interferência na rede, visando verificar o comportamento de tais protocolos com um trafego mais intenso na rede. Os resultados obtidos com a simulação de tempo real demonstram que o protocolo TTP/C apresentou um comportamento mais estável e seguro para tal aplicação considerada de tempo real crítico.

ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada
The RCC TTG initiated task TT-49 to generate a standard for the transport of serial streaming telemetry (TM) over the Internet Protocol (IP). An ad hoc committee was activated comprised of Range and vendor participation to develop this standard. This paper will address the progress of the standard, the use of commercial standards, and the benefits to the ranges. The early meetings focused on developing the packet structure; the preliminary results will be presented along with the latest status on the RCC approval cycle.

Mestrado em Desenvolvimento e Cooperação Internacional
Muitas vezes chamado de "escravatura moderna," o TSH tem sido perpetrado por décadas, podemos até identificá-lo no início da sociedade humana. No entanto, ainda não se sabe muito sobre a sua dinâmica. De acordo com o último relatório do Departamento do Governo dos Estados Unidos (baseado em dados da Organização Internacional do Trabalho - OIT), o número de pessoas traficadas em matéria de trabalho forçado e de exploração sexual foi estimado em cerca de 12,3 milhões. Considerando essa grandeza, a ONG Terre des Hommes estima que um número de crianças situado entre os 300,000 milhões e os 1,2 milhões sejam traficadas por ano. Uma forma de combater e eliminar esse crime reside na tentativa de compreender as raízes do TSH e cada vez mais na importância do papel desempenhado pela Declaração Universal dos Direitos do Homem e pela Convenção sobre os Direitos da Criança. O tráfico de crianças é visto não só como uma violação grosseira dos direitos humanos, mas também como uma questão de trabalho infantil, entre outras formas de exploração. Este facto pode induzir à ideia de um conflito entre a economia e os direitos humanos em contextos de crise económica e social. O que numa perspectiva de globalização, resulta numa ampliação deste crime hediondo. Neste contexto, tendo em atenção o passado histórico e cultural português, a grande questão deste estudo é a de entender qual é a situação em Portugal, considerando as redes transnacionais de TSH e o seu modus operandi (com especial atenção para com as crianças). As respostas a esta questão são e foram muito difíceis de obter. Apenas foi possível aceder aos dados da Direcção-Geral da Administração Interna, da Associação de Planeamento Familiar, do Programa para a Prevenção e Eliminação da Exploração do Trabalho Infantil e do recém-criado Observatório para o Tráfico Humano.
Often called as "modern slavery," trafficking in human beings has been perpetrated for decades, we can even trace it at the beginning of human society. Nevertheless, we still do not know much about its dynamics. According to the latest report from the U.S. State Department (based on data from the International Labor Organization-ILO), the number of people trafficked concerning forced labor and sexual exploitation was estimated at about 12.3 million. Bearing it in mind, the NGO Terre des Hommes estimates that a number of children situated between 300,000,000,000 and 1.2000000 is trafficked every year. A way of combating and eliminating such a crime is to try and understand the roots of human trafficking and the increasingly importance of the role played by the Universal Declaration of Human Rights and the Convention on the Rights of the Child. Child trafficking is configured not only as a gross violation of human rights, but also as a matter of child labor, amongst other forms of exploitation. This fact may lead us to an idea of conflict between economy and human rights within contexts of economic and social crises. As far as globalization is concerned, it may also enforce this huge crime. So, taking due notice of the cultural and historical Portuguese past, the big question of this study is to understand what is the situation in Portugal considering the transnational nets of trafficking in human beings and their way of operating (with particular attention towards children). Answers to this question are and were very difficult to obtain. So, we could only access to data from the Portuguese Directorate-General of Internal Administration, the Association for Family Planning, the Program for the Prevention and Elimination of Child Labor Exploitation and the newly created Observatory for Human Trafficking.

This thesis addresses the problem of wireless transmission between the operator station and the robot. There is a solution presented by way of testing the parameters of wireless modules, compare them in the environment and the draft protocol.

This work is about Hierarchical agregation and it describes its parts in the rst part of this work. Next is described its parts, main features and properties in this rst part. Document describes the possibilities of realization. Second part describes an analysis of the stability problem. Realizes the detection of failures of the Feedback target stations by the implemented protocol. The protocol is programaticly realized in JAVA language and tested in the real enviroment. In this document it is described an function of bandwidth on the speed of failure detection. The issues of detection of failure on the feedback target manager machine are discussed in this document.

The master's thesis' objective is to study basics of high-frequency trading, especially trading at foreign exchange market. Project deals with foreign exchange data preprocessing, fundamentals of market data collecting, data storing and cleaning are discussed. Doing decisions based on poor quality data can lead into fatal consequences in money business therefore data cleaning is necessary. The thesis describes adaptive data cleaning algorithm which is able to adapt current market conditions. According to design a modular plug-in application for data collecting, storing and following cleaning has been implemented.

This work is about position prediction in network, it is focused to find Landmark closest to the Host in the network (with lowest distance vector). The algorithm is based on GNP system. In terms of GNP system simulation was selected method for mathematical part of position prediction. The method was Simplex Downhill. The designed algorithm was implemented in Java. In the first step chose Host continent by meassuring the distance vector. In next step is selected nearest part in the continent. In conclusion estimate Host its position and then closest Landmark. Results from this work is important for designing TTP protocol. The verdict is that the GNP can be used for TTP, but Landmarks must be located in uniform density.

Il lavoro è stato suddiviso in tre macro-aree. Una prima riguardante un'analisi teorica di come funzionano le intrusioni, di quali software vengono utilizzati per compierle, e di come proteggersi (usando i dispositivi che in termine generico si possono riconoscere come i firewall). Una seconda macro-area che analizza un'intrusione avvenuta dall'esterno verso dei server sensibili di una rete LAN. Questa analisi viene condotta sui file catturati dalle due interfacce di rete configurate in modalità promiscua su una sonda presente nella LAN. Le interfacce sono due per potersi interfacciare a due segmenti di LAN aventi due maschere di sotto-rete differenti. L'attacco viene analizzato mediante vari software. Si può infatti definire una terza parte del lavoro, la parte dove vengono analizzati i file catturati dalle due interfacce con i software che prima si occupano di analizzare i dati di contenuto completo, come Wireshark, poi dei software che si occupano di analizzare i dati di sessione che sono stati trattati con Argus, e infine i dati di tipo statistico che sono stati trattati con Ntop. Il penultimo capitolo, quello prima delle conclusioni, invece tratta l'installazione di Nagios, e la sua configurazione per il monitoraggio attraverso plugin dello spazio di disco rimanente su una macchina agent remota, e sui servizi MySql e DNS. Ovviamente Nagios può essere configurato per monitorare ogni tipo di servizio offerto sulla rete.

Consumers of digital contents are empowered with numerous technologies allowing them to produce perfect copies of these contents and distribute them around the world with little or no cost. To prevent illegal copying and distribution, a technology called Digital Rights Management (DRM) is developed. With this technology, consumers are allowed to access digital contents only if they have purchased the corresponding licenses from license issuers. The problem, however, is that those consumers are not allowed to resell their own licenses- a restriction that goes against the first-sale doctrine. Enabling a consumer to buy a digital license directly from another consumer and allowing the two consumers to fairly exchange the license for a payment are still an open issue in DRM research area. This thesis investigates existing security solutions for achieving digital license reselling and analyses their strengths and weaknesses. The thesis then proposes a novel Reselling Deal Signing (RDS) protocol to achieve fairness in a license reselling. The idea of the protocol is to integrate the features of the concurrent signature scheme with functionalities of a License Issuer (LI). The security properties of this protocol is informally analysed and then formally verified using ATL logic and the model checker MOCHA. To assess its performance, a prototype of the RDS protocol has been developed and a comparison with related protocols has been conducted. The thesis also introduces two novel digital tokens a Reselling Permission (RP) token and a Multiple Reselling Permission (MRP) token. The RP and MRP tokens are used to show whether a given license is single and multiple resalable, respectively. Moreover, the thesis proposes two novel methods supporting fair and secure digital license reselling. The first method is the Reselling Deal (RD) method which allows a license to be resold once. This method makes use of the existing distribution infrastructure, RP, License Revocation List (LRL), and three protocols: RDS protocol RD Activation (RDA) protocol, and RD Completion (RDC) protocol. The second method is a Multiple License Reselling (MLR) method enabling one license to be resold N times by N consumers. The thesis presents two variants of the MLR method: RRP-MR (Repeated RP-based Multi-Reselling) and HC-MR (Hash Chain-based Multi-Reselling). The RRP-MR method is designed such that a buyer can choose to either continue or stop a multi-reselling of a license. Like the RD method, the RRP-MR method makes use of RP, LI, LRL, and the RDS, RDA, and RDC protocols to achieve fair and secure reselling. The HC-MR method allows multiple resellings while keeping the overhead on LI at a minimum level and enable a buyer to check how many times a license can be further resold. To do so, the HC-MR utilises MRP and the hash chain cryptographic primitive along with LRL, LI and the RDS, RDA and RDC protocols. The analysis and the evaluation of these three methods have been conducted. While supporting the license reselling, the two methods are designed to prevent a reseller from (1) continuing using a resold license, (2) reselling a non-resalable license, and (3) reselling one license a unauthorised number of times. In addition, they enable content owners of resold contents to trace a buyer who has violated any of the usage rights of a license bought from a reseller. Moreover, the methods enable a buyer to verify whether a license he is about to buy is legitimate for re-sale. Furthermore, the two methods support market power where a reseller can maximise his profit and a buyer can minimise his cost in a reselling process. In comparison with related works, our solution does not make use of any trusted hardware device, thus it is more cost-effective, while satisfying the interests of both resellers and buyers, and protecting the content owner's rights.

This thesis deals with a creation of a company´s electronic shopping. On the basis of the knowledge and information acquired from a theoretical part, the suggestion involves the best possibilities of electronic shopping that will lead to a stable and firm position on this kind of market, and to increase of the capital as well as the reputation of the company with potential customers.

Vehicular ad hoc networks (VANETs) are a subclass of mobile ad hoc networks (MANETs) in which the mobile nodes are vehicles; these vehicles are autonomous systems connected by wireless communication on a peer-to-peer basis. They are self-organized, self-configured and self-controlled infrastructure-less networks. This kind of network has the advantage of being able to be set-up and deployed anywhere and anytime because it has no infrastructure set-up and no central administration. Distributing information between these vehicles over long ranges in such networks, however, is a very challenging task, since sharing information always has a risk attached to it especially when the information is confidential. The disclosure of such information to anyone else other than the intended parties could be extremely damaging, particularly in military applications where controlling the dissemination of messages is essential. This thesis therefore provides a review of the issue of security in VANET and MANET; it also surveys existing solutions for dissemination control. It highlights a particular area not adequately addressed until now: controlling information flow in VANETs. This thesis contributes a policy-based framework to control the dissemination of messages communicated between nodes in order to ensure that message remains confidential not only during transmission, but also after it has been communicated to another peer, and to keep the message contents private to an originator-defined subset of nodes in the VANET. This thesis presents a novel framework to control data dissemination in vehicle ad hoc networks in which policies are attached to messages as they are sent between peers. This is done by automatically attaching policies along with messages to specify how the information can be used by the receiver, so as to prevent disclosure of the messages other than consistent with the requirements of the originator. These requirements are represented as a set of policy rules that explicitly instructs recipients how the information contained in messages can be disseminated to other nodes in order to avoid unintended disclosure. This thesis describes the data dissemination policy language used in this work; and further describes the policy rules in order to be a suitable and understandable language for the framework to ensure the confidentiality requirement of the originator. This thesis also contributes a policy conflict resolution that allows the originator to be asked for up-to-date policies and preferences. The framework was evaluated using the Network Simulator (NS-2) to provide and check whether the privacy and confidentiality of the originators’ messages were met. A policy-based agent protocol and a new packet structure were implemented in this work to manage and enforce the policies attached to packets at every node in the VANET. Some case studies are presented in this thesis to show how data dissemination can be controlled based on the policy of the originator. The results of these case studies show the feasibility of our research to control the data dissemination between nodes in VANETs. NS-2 is also used to test the performance of the proposed policy-based agent protocol and demonstrate its effectiveness using various network performance metrics (average delay and overhead).

碩士
國立中興大學
資訊管理學系所
101
Mobile ad hoc networks (MANETs) are temporary and decentralized networks without using any fixed infrastructure. Dynamic topology is a unique characteristic of MANETs, all the nodes along the path always change its position. The path is easily-broken when the topology changes rapidly. The speed of nodes is a critical factor. If the node speed is high, the topology will change rapidly and increase the probability of path failure. When the path failed, the source node should restart the route discovery procedure and it will bring additional routing cost. Accordingly, finding a stable path using low speed nodes to route is our goal. On the other hand, most reactive routing protocols use flooding route request to start the route discovery procedure. The propagation distance of this kind of flooding approach is restrained by setting the time to live (TTL) field. The TTL value is only decreased by one at each node. When the TTL value declines to zero, the route request packet should be dropped. Consequently, it may incur considerable routing overheads owing to aimless flooding. In this thesis, we proposed an adaptive TTL-based protocol (AODV-TTL) modified Ad hoc On-Demand Distance Vector (AODV) routing protocol to route packets. The TTL value will be deducted dynamically according to the node speed and reaches zero quickly when the packet pass through some faster nodes. By this way, not only the broadcast range is restrained to a smaller area, the overall routing required number of broadcast packets can also be reduced. Consequently, the routing overheads can cut down and we can find a stable path because some faster speed nodes have been excluded automatically. Simulation results showed that our AODV-TTL protocol can find a more stable path and offer better performance in the number of broadcast packets and throughput than original AODV.

Yes
Ambassador Tibor Toth, Chairman of the Ad Hoc Group, gives an address relating to the submission to the Ad Hoc Group of the Chairman's Composite Text of the Protocol to the Biological and Toxin Weapons Convention.