Computing of trust in wireless networks

Author

Zhu, Huafei ; Bao, Feng ; Deng, Robert H.

Author_Institution

Inst. for Infocomm Res., Singapore, Singapore

Volume

4

fYear

2004

fDate

26-29 Sept. 2004

Firstpage

2621

Abstract

The concept of small world in the context of wireless networks, first studied by A. Helmy (see IEEE Commun. Lett., vol.7, no.10, 2003), enables a path-finder to find paths from a source node to a designated target node in efficiently wireless networks. Based on this observation, we provide a practical approach to compute trust in wireless networks by viewing an individual mobile device as a node of a delegation graph, G, and mapping a delegation path from the source node, S, to the target node, T, into an edge in the correspondent transitive closure of the graph, G, from which a trust value is computed.

Keywords

authorisation; graph theory; mobile radio; telecommunication computing; telecommunication network routing; telecommunication security; delegation graph; delegation path; designated target node; mobile device; small world concept; source node; transitive closure; trust; wireless networks; Computer networks; Distributed computing; Energy management; Intelligent networks; Large-scale systems; Military computing; Mobile computing; Public key; Search engines; Wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th

ISSN

1090-3038

Print_ISBN

0-7803-8521-7

Type

conf

DOI

10.1109/VETECF.2004.1400531

Filename

1400531