816 resultados para Secure protocol


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Clustering combined with multihop communication is a promising solution to cope with the energy requirements of large scale Wireless Sensor Networks. In this work, a new cluster based routing protocol referred to as Energy Aware Cluster-based Multihop (EACM) Routing Protocol is introduced, with multihop communication between cluster heads for transmitting messages to the base station and direct communication within clusters. We propose EACM with both static and dynamic clustering. The network is partitioned into near optimal load balanced clusters by using a voting technique, which ensures that the suitability of a node to become a cluster head is determined by all its neighbors. Results show that the new protocol performs better than LEACH on network lifetime and energy dissipation

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Now a days, email has become the most widely communication way in daily life. The main reason for using email is probably because of the convenience and speed in which it can be transmitted irrespective of geographical distances. To improve security and efficiency of email system, most of the email system adopt PKI and IBE encryption schemes. However, both PKI and IBE encryption schemes have their own shortcomings and consequently bring security issues to email systems. This paper proposes a new secure email system based on IBE which combines finger print authentication and proxy service for encryption and decryption

Relevância:

20.00% 20.00%

Publicador:

Resumo:

As the number of processors in distributed-memory multiprocessors grows, efficiently supporting a shared-memory programming model becomes difficult. We have designed the Protocol for Hierarchical Directories (PHD) to allow shared-memory support for systems containing massive numbers of processors. PHD eliminates bandwidth problems by using a scalable network, decreases hot-spots by not relying on a single point to distribute blocks, and uses a scalable amount of space for its directories. PHD provides a shared-memory model by synthesizing a global shared memory from the local memories of processors. PHD supports sequentially consistent read, write, and test- and-set operations. This thesis also introduces a method of describing locality for hierarchical protocols and employs this method in the derivation of an abstract model of the protocol behavior. An embedded model, based on the work of Johnson[ISCA19], describes the protocol behavior when mapped to a k-ary n-cube. The thesis uses these two models to study the average height in the hierarchy that operations reach, the longest path messages travel, the number of messages that operations generate, the inter-transaction issue time, and the protocol overhead for different locality parameters, degrees of multithreading, and machine sizes. We determine that multithreading is only useful for approximately two to four threads; any additional interleaving does not decrease the overall latency. For small machines and high locality applications, this limitation is due mainly to the length of the running threads. For large machines with medium to low locality, this limitation is due mainly to the protocol overhead being too large. Our study using the embedded model shows that in situations where the run length between references to shared memory is at least an order of magnitude longer than the time to process a single state transition in the protocol, applications exhibit good performance. If separate controllers for processing protocol requests are included, the protocol scales to 32k processor machines as long as the application exhibits hierarchical locality: at least 22% of the global references must be able to be satisfied locally; at most 35% of the global references are allowed to reach the top level of the hierarchy.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Aquest projecte té com a objectius: determinar les Directrius a seguir per la futura redacció d’un protocol de gestió de les zones inundables del PNAE, amb la finalitat de potenciar la presència d’aus; determinar les millors condicions d’hàbitat per les poblacions d’aus del PNAE i redactar unes línies de seguiment que permetin d'una banda avaluar si les pautes proposades tindran l’efecte desitjat i d'altra banda que permetin la redacció del protocol de gestió

Relevância:

20.00% 20.00%

Publicador:

Resumo:

El treball té l’objectiu de dissenyar un protocol d’actuació que contempli aspectes sobre prevenció, detecció i intervenció contra l’absentisme escolar i la desescolarització al municipi. Per a això s’ha desenvolupat una diagnosi municipal d’anàlisi de la realitat sobre el tema, fent èmfasi en la intervenció socioeducativa que s’ha de realitzar per a tractar el fenomen des d’una perspectiva holística i global

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

La I Trobada de Coordinadors Ambientals tuvo lugar el día 10 de mayo de 2004 en el CEP de Palma y se organizó en colaboración con el Seminario de Ambientalización de centros escolares (SACE). El autor es profesor del colegio Sant Francesc d'Asís (Sa Pobla, Mallorca) y miembro de SACE

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Speaker(s): Prof. David Evans Organiser: Dr Tim Chown Time: 22/05/2014 10:45-11:45 Location: B53/4025 Abstract Secure multi-party computation enables two (or more) participants to reliably compute a function that depends on both of their inputs, without revealing those inputs to the other party or needing to trust any other party. It could enable two people who meet at a conference to learn who they known in common without revealing any of their other contacts, or allow a pharmaceutical company to determine the correct dosage of a medication based on a patient’s genome without compromising the privacy of the patient. A general solution to this problem has been known since Yao's pioneering work in the 1980s, but only recently has it become conceivable to use this approach in practice. Over the past few years, my research group has worked towards making secure computation practical for real applications. In this talk, I'll provide a brief introduction to secure computation protocols, describe the techniques we have developed to design scalable and efficient protocols, and share some recent results on improving efficiency and how secure computing applications are developed.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Animation with key areas of consideration includes audio. This version has a scaleable player

Relevância:

20.00% 20.00%

Publicador:

Resumo:

protocol writing Methodology for evidence-based practice