Computing of Trust in Wireless Networks
Publication Type
Conference Proceeding Article
Publication Date
9-2004
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.
Discipline
Information Security
Research Areas
Cybersecurity
Publication
Proceedings of the 60th IEEE Vehicular Technology Conference, 26-29 September 2004, Los Angeles, California
First Page
2621
Last Page
2624
ISBN
9780780385214
Identifier
10.1109/VETECF.2004.1400531
Publisher
IEEE
City or Country
Piscataway, NJ
Citation
ZHU, Huafei; BAO, Feng; and DENG, Robert H..
Computing of Trust in Wireless Networks. (2004). Proceedings of the 60th IEEE Vehicular Technology Conference, 26-29 September 2004, Los Angeles, California. 2621-2624.
Available at: https://ink.library.smu.edu.sg/sis_research/533
Additional URL
https://doi.org/10.1109/VETECF.2004.1400531