The polynomial-assisted ad-hoc charging protocol
The area of trustworthy charging in self-organized environments has been developed quite recently. This paper introduces a new secure charging-protocol, the polynomial-assisted charging protocol, for these environments. The protocol relies on polynomial composition for speeding the identification pr...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2005
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/8072 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/8072 |
| Resumo: | The area of trustworthy charging in self-organized environments has been developed quite recently. This paper introduces a new secure charging-protocol, the polynomial-assisted charging protocol, for these environments. The protocol relies on polynomial composition for speeding the identification process in small groups. This protocol is able to provide strict guarantees of cooperative behavior in traffic forwarding, with minimal network overhead. Protocol performance is evaluated in multiple ad-hoc environments and results are compared with previously proposed work. The performance results show the merits of this protocol in multiple types of environments. |
|---|