Computer Science ›› 2020, Vol. 47 ›› Issue (2): 300-305.doi: 10.11896/jsjkx.190100172

• Information Security • Previous Articles     Next Articles

Trust Based Energy Efficient Opportunistic Routing Algorithm in Wireless Sensor Networks

SU Fan-jun,DU Ke-yi   

  1. (School of Optical-Electrical and Computer Engineering,University of Shanghai for Science and Technology,Shanghai 200093,China)
  • Received:2019-01-21 Online:2020-02-15 Published:2020-03-18
  • About author:SU Fan-jun,born in 1976,Ph.D,lectu-rer.His main research interests include wireless sensor networks,data center network and recommendation algorithm;DU Ke-yi,born in 1992,postgraduate.Her main research interests includewireless sensor networks and opportuni-stic routing.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (61703278).

Abstract: In order to prevent potential malicious nodes in the network from being added to the candidate forwarding set of opportunistic routing,reduce network energy consumption and ensure reliable data transmission,a trust based energy efficient opportunity routing in wireless sensor networks (TBEEOR) algorithm was proposed.The algorithm calculates the algebraic connectivity of nodes according to the topology of the network,then calculates the sincerity of the connectivity of the nodes,and then combines forwarding sincerity and ACK sincerity of nodes to calculate the comprehensive trust degree by using the concept of information entropy.Finally,comprehensive trust of nodes is used to calculate the energy consumption caused by communication and cooperation between nodes,thereby obtaining the expected cost of the network.In addition,the algorithm can effectively identify and judge malicious nodes in the network,further reducing the impact of malicious nodes on network performance.The experimental results show that the TBEEOR algorithm effectively guarantees the reliability of data transmission and helps to prolong the network life cycle,thereby improving the throughput of network,and reducing network energy consumption.

Key words: Algebraic connectivity, Energy consumption, Opportunistic routing, Trust, Wireless sensor networks

CLC Number: 

  • TP393
[1]HOLGER K,ANDREAS W.Protocols and Architectures for Wireless Sensor Networks [M].New York:John Wiley & Sons,2007.
[2]MASSAYUKI O A,AUGUSTO F A.Ant-based Dynamic Hop Optimization Protocol:a Routing Algorithm for Mobile Wireless Sensor Networks [C]∥2011 IEEE Globecom Workshops.IEEE,2011:1139-1143.
[3]RAJU J,GARCIA-LUNA-ACEVES J J.A new approach to on-de-mand loop-free multipath routing [C]∥International Conferenceon Computer Communications & Networks.IEEE,1999.
[4]NASIPURI A,CASTANEDA R,DAS S R.Performance of multipath routing for on-demand protocols in mobile ad hoc networks [J].Mobile Networks & Applications,2001,6(4):339-349.
[5]RAPPAPORT T.Wireless Communications:Principles and Practice[M].Electronic Industry Press,2011.
[6]BISWAS S,MORRIS R.ExOR:Opportunistic multi-hop routing for wireless networks [J].Acm Sigcomm Computer Communication Review,2005,35(4):133-144.
[7]AZZEDINE B,AMIR D.Opportunistic Routing in Wireless Net-works:Models,Algorithms,and Classifications [J].ACM Computing Surveys,2014:47(2):1-36.
[8]SZYMON C,MICHAEL J,SACHIN K,et al.Trading structure for randomness in wireless opportunistic routing [J].Acm Sigcomm Computer Communication Review,2007,37(4):169-180.
[9]MAO X F,TANG S J,XU X H,et al.Energy-Efficient Opportunistic Routing in Wireless Sensor Networks[J].IEEE Transa-ctions on Parallel and Distributed Systems,2011,22(11):1934-1942.
[10]CHEN W,CHEN Z,FAN P Y,et al.AsOR:An Energy Effi-cient Multi-Hop Opportunistic Routing Protocol for Wireless Sensor Networks over Rayleigh Fading Channels [J].IEEE Transactions on Wireless Communications,2009,8(5):2452-2463.
[11]KARYAKARTE M S,TAVILDAR A S,KHANNA R.Connectivity Based Energy Efficient Opportunistic Robust Routing for Mobile Wireless Sensor Networks [J].Wireless Personal Communications,2015,84(1):729-744.
[12]HAN G J,JIANG J F,LEI S,et al.Management and applications of trust in Wireless Sensor Networks:A survey [J].Journal of Computer and System Sciences,2014,80(3):602-617.
[13]JIANG J F,HAN G J,FENG W,et al.An Efficient Distributed Trust Model for Wireless Sensor Networks [J].IEEE Transactions on Parallel and Distributed Systems,2016,26(5):1228-1237.
[14]CAI S B,HAN Q L,GAO Z G,et al.Research on Cloud Trust Model for Malicious Node Detection in Wireless Sensor Network [J].Acta Electronica Sinica,2012,40(11):2232-2238.
[15]LIU T,XIONG Y,HUANG W C,et al.Trust Computation Model of Nodes Based on Bayes Estimation in Wireless Sensor Networks [J].Computer Science,2013,40(10):61-64.
[16]WANG B,HUANG C H,LI L Y,et al.Trust-based minimum cost opportunistic routing for Ad hoc networks [J].Journal of Systems and Software,2011,84(12):2107-2122.
[17]THORAT S A,KULKARNI P J.Opportunistic Routing in Presence of Selfish Nodes for MANET [J].Wireless Personal Communications,2015,82(2):689-708.
[18]MAHMOOD S,AZZEDINE B,AMIR D,et al.Towards a novel trust-based opportunistic routing protocol for wireless networks [J].Wireless Networks,2015,22(3):1-17.
[19]DANG X C,WANG H M,HAO Z J.Three dimensional coverage algorithm based on node trust degree in wireless sensor networks [J].Application Research of Computers,2016,33(12):3794-2796.
[20]FIEDLER M.Algebraic connectivity of graphs [J].Czechoslovak Mathematical Journal,1973,23(23):298-305.
[21]YIN X Q,WU J,MO W W,et al.Improved Opportunistic Routing Algorithm Based on Node Trustworthiness for WMNs [J].Computer Science,2017,44(8):151-156.
[1] YUAN Hao-nan, WANG Rui-jin, ZHENG Bo-wen, WU Bang-yan. Design and Implementation of Cross-chain Trusted EMR Sharing System Based on Fabric [J]. Computer Science, 2022, 49(6A): 490-495.
[2] CAI Xiao-juan, TAN Wen-an. Improved Collaborative Filtering Algorithm Combining Similarity and Trust [J]. Computer Science, 2022, 49(6A): 238-241.
[3] YU Ai-xin, FENG Xiu-fang, SUN Jing-yu. Social Trust Recommendation Algorithm Combining Item Similarity [J]. Computer Science, 2022, 49(5): 144-151.
[4] JIANG Rui, XU Shan-shan, XU You-yun. New Hybrid Precoding Algorithm Based on Sub-connected Structure [J]. Computer Science, 2022, 49(5): 256-261.
[5] YANG Zhen, HUANG Song, ZHENG Chang-you. Study on Crowdsourced Testing Intellectual Property Protection Technology Based on Blockchain and Improved CP-ABE [J]. Computer Science, 2022, 49(5): 325-332.
[6] DU Hui, LI Zhuo, CHEN Xin. Incentive Mechanism for Hierarchical Federated Learning Based on Online Double Auction [J]. Computer Science, 2022, 49(3): 23-30.
[7] GAO Yan-lu, XU Yuan, ZHU Qun-xiong. Predicting Electric Energy Consumption Using Sandwich Structure of Attention in Double -LSTM [J]. Computer Science, 2022, 49(3): 269-275.
[8] YANG Yu-li, LI Yu-hang, DENG An-hua. Trust Evaluation Model of Cloud Manufacturing Services for Personalized Needs [J]. Computer Science, 2022, 49(3): 354-359.
[9] WANG Ran-ran, WANG Yong, CAI Yu-tong, JIANG Zheng-tao, DAI Gui-ping. Formal Verification of Yahalom Protocol Based on Process Algebra [J]. Computer Science, 2021, 48(6A): 481-484.
[10] CHEN Hai-biao, HUANG Sheng-yong, CAI Jie-rui. Trust Evaluation Protocol for Cross-layer Routing Based on Smart Grid [J]. Computer Science, 2021, 48(6A): 491-497.
[11] SHAO Chao, SONG Shu-mi. Collaborative Filtering Recommendation Algorithm Based on User Preference Under Trust Relationship [J]. Computer Science, 2021, 48(6A): 240-245.
[12] WANG Guo-wu, CHEN Yuan-yan. Improvement of DV-Hop Location Algorithm Based on Hop Correction and Genetic Simulated Annealing Algorithm [J]. Computer Science, 2021, 48(6A): 313-316.
[13] HE Quan-qi, YU Fei-hong. Review of Low Power Architecture for Wireless Network Cameras [J]. Computer Science, 2021, 48(6A): 369-373.
[14] PAN Rui-jie, WANG Gao-cai, HUANG Heng-yi. Attribute Access Control Based on Dynamic User Trust in Cloud Computing [J]. Computer Science, 2021, 48(5): 313-319.
[15] DING Shi-ming, WANG Tian-jing, SHEN Hang, BAI Guang-wei. Energy Classifier Based Cooperative Spectrum Sensing Algorithm for Anti-SSDF Attack [J]. Computer Science, 2021, 48(2): 282-288.
Full text



No Suggested Reading articles found!