TPS_DR: A Universal Dimension Reducing Algorithm for Optimal Trust Path Selection in Complex Sensor Network

Energy efficiency, one of the key factors for sensor network, is a challenging work. It is agreed that sink routing is the main influencing factor for energy efficiency and selecting an optimal routing path becomes critical. It is hard for source participant (sink nodes, namely trustor) to select a trustworthy target participant (data collecting sensor nodes, namely trustee), especially when the scale of sensor network becomes increasingly larger. An optimal trust path selection problem (TPS problem) is a Multi-Constrained Optimal Path (MCOP) problem, which is proved to be a NP-Complete problem. In this paper, we first introduce a concept of complex trust network to model the relationships among network nodes in a complex sensor network. In this model, we represent the trust network based on high dimensional vector and matrix. Then, we propose an algorithm TPS DR (Trust Path Selection based on Dimensionality Reduction) to simplify the trust network through reducing the dimensionality, i.e. cluster some similar nodes into a supernode. Our example demonstrates the usage and advantage of our model and algorithm.

[1]  Jennifer Golbeck,et al.  Inferring Trust Relationships in Web-Based Social Networks , 2006 .

[2]  Ilkyeun Ra,et al.  A Queuing Network Model Based on Ad Hoc Routing Networks for Multimedia Communications , 2012 .

[3]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Yuan Gao,et al.  A Routing Protocol Based on Trust for MANETs , 2005, GCC.

[5]  Yanguo Michael Liu.  Properties for Security Measures of Software Products , 2007 .

[6]  Mehmet A. Orgun,et al.  Optimal Social Trust Path Selection in Complex Social Networks , 2010, AAAI.

[7]  Christian Bauckhage,et al.  The slashdot zoo: mining a social network with negative edges , 2009, WWW.

[8]  Bin Liu,et al.  Research on Subjective Trust Routing Algorithm for Mobile Ad Hoc Networks , 2010, 2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM).

[9]  Lei Li,et al.  Trust-Oriented Composite Service Selection with QoS Constraints , 2010, J. Univers. Comput. Sci..

[10]  Annika Hinze,et al.  Trust- and Location-Based Recommendations for Tourism , 2009, OTM Conferences.

[11]  Tao Yu,et al.  Efficient algorithms for Web services selection with end-to-end QoS constraints , 2007, TWEB.

[12]  Munindar P. Singh,et al.  Operators for propagating trust and their evaluation in social networks , 2009, AAMAS.

[13]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .

[14]  P. Adler.  Market, Hierarchy, and Trust: The Knowledge Economy and the Future of Capitalism , 2001 .