Computing of trust in wireless networks

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.