Computer Science

Computer Science ›› 2024, Vol. 51 ›› Issue (3): 300-308.doi: 10.11896/jsjkx.221200135

• Computer Network • Previous Articles     Next Articles

Efficient Routing Algorithm Based on Virtual Currency Transaction in DTN

CUI Jianqun, LIU Shan, CHANG Yanan, LIU Qiangqiang, WU Qingcheng   

  1. School of Computer Science,Central China Normal University,Wuhan 430079,China
  • Received:2022-12-23 Revised:2023-05-14 Online:2024-03-15 Published:2024-03-13
  • About author:CUI Jianqun,born in 1974,Ph.D,professor,is a member of CCF(No.27790M).Her main research interests include opportunity network,Internet of things,mobile network and application layer multicast.CHANG Yanan,born in 1984,Ph.D,associate professor,is a member of CCF(No.35671M).Her main research interests include wireless network,social network and Internet of things.
  • Supported by:
    National Natural Science Foundation of China(62272189,61672257)

PDF (PC)

87

Abstract: Due to the characteristics of intermittent connection of the delay tolerant network,as well as the limited resources such as the node's own cache and energy,the nodes in the DTN tend to show a certain degree of selfishness.The existence of selfish nodes may increase the network overhead and reduce the successful delivery rate of messages.In order to promote selfish nodes to participate in cooperation,an efficient routing algorithm PVCT(efficient routing algorithm based on virtual currency transaction in DTN) is proposed,which combines the small world characteristics of the delay tolerant network to improve the efficiency of the routing algorithm.The algorithm uses the virtual currency transaction mode,and prices according to the basic attributes,location attributes,social attributes,etc.of the node.The node gives the corresponding quotation according to the designed price function,and uses the price function to reasonably allocate the number of message copies.In PVCT strategy,nodes are divided into normal nodes and selfish nodes according to their judgments.When the number of hops of messages is less than or equal to two hops,they are forwarded according to the probability routing strategy.On the contrary,when the number of hops of the message is more than two hops,if a selfish node is encountered,the routing algorithm of the virtual currency transaction is executed.If the bid of the message carrying node is higher than the price of the forwarding node,the transaction will be conducted and the respective revenue status will be updated.Otherwise,entering the secondary price adjustment stage to coordinate the virtual quotation of both parties.Simulation results show that PVCT routing algorithm can better promote message forwarding in DTN,thus improving the overall performance of the network.

Key words: DTN, Virtual currency, Small world, Price function, Selfish node

CLC Number: 

  • TP393
[1]ZHANG J,WANG G,LIU C,et al.Delay Tolerant Network and the Algorithms of DTN Routing[J].Journal of Physics:Confe-rence Series,2019,1169(1):012058.
[2]YANG W X.A rescue/rescue scheme based on DTN wildlifetracking network[J].China Science and Technology Information,2020(24):88-89.
[3]CAINI C.Delay-tolerant networks(DTNs) for satellite communications[J].Advances in Delay-Tolerant Networks(DTNs),2015(1):25-47.
[4]DUAN Z J,WANG X M,LI C B.Research on DTN based earthquake emergency rescue communication system [J].Computer Application and Software,2014,31(1):111-116.
[5]AMIT K SR P.An efficient and intelligent routing strategy for vehicular delay tolerant networks[J].Wireless Networks,2020(1):1-18.
[6]QIAO G H,WU Q,WANG X,et al.Reinforcement learning based routing algorithm for UAV ad-hoc networks[J].Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition),2023,35(2):335-342.
[7]ANDERS L,AVRI D,OLOV S.Probabilistic routing in intermit-tently connected networks[J].ACM SIGMOBILE Mobile Computing and Communications Review,2003,7(3):19-20.
[8]ZHOU C R,XU X Q,YANG L,et al.Delay tolerant network routing algorithm based on small world and energy efficiency[J].Journal of University of Electronic Science and Technology of China,2016,45(1):129-134.
[9]KAWABATA N,YAMASAKI Y,OHSAKI H.On message delivery delay of epidemic DTN routing with broadcasting ACKs[C]// IEEE 41st Annual Computer Software and Applications Conference(COMPSAC).IEEE,2017,1:701-704.
[10]KHALILI A,SAMI A.SysDetect:A systematic approach tocritical state determination for Industrial Intrusion Detection Systems using Apriori algorithm[J].Journal of Process Control,2015,32:154-160.
[11]KASHI S S,SHARIFI M.Coverage rate calculation in wireless sensor networks[J].Computing,2012,94(11):833-856.
[12]WANG J,JIANZHU L U,ZENG X.Data aggregation scheme for wireless sensor network to timely determine compromised nodes[J].Journal of Computer Applications,2016,36(9):2432-2437.
[13]JIANG Q F,MEN C G,LI X,et al.DTNs incentive aware low delay routing based on virtual currency[J].Computer Research and Development,2015,52(12):2707-2724.
[14]LIU H,CHEN Z G,ZHANG L M.Data forwarding incentivemechanism based on auction model in mobile social network[J].Journal of Communication,2017,38(11):111-120.
[15]LIU Q L,LIU M S,LI Y.Research on incentive mechanism of opportunity network based on game theory [J].Computer Application Research,2015,32(7):2128-2132.
[16]NING Z,LI L,FENG X,et al.CAIS:A Copy Adjustable Incentive Scheme in Community-Based Socially Aware Networking[J].IEEE Transactions on VehicularTechnology,2017,66(4):3406-3419.
[17]LI X L,XUAN M Y.Research on Node Incentive Strategies in Selfish Opportunity Networks[J].Computer Science,2017,44(4):213-217,222.
[18]AMIR B N,MOHAMMAD H R.An Incentive-Compatible Routing Protocol for Delay-Tolerant Networks Using Second-Price Sealed-Bid Auction Mechanism[J].Wireless Personal Communications,2021,121(3):1-30.
[19]FU H Z.Research on energy consumption equilibrium opportu-nistic network routing strategy based on game theory[D].Hohhot:Inner Mongolia University,2022.
[20]ZHONG C C,LI T,WANG R C.Research on DTN congestion control based on enhanced PROPHET routing[J].Journal of Nanjing University of Posts and Telecommunications,2016,36(2):118-123.
[21]FAROUK M,RIADH D,MICHELE N L,ANDRE-LUC B.Content dissemination in vehicular social networks:taxonomy and usersatisfaction[J].IEEE Communications Magazine,2014,52(12):34-40.
[22]WU L B,CAO S Q,CHEN Y J,et al.An adaptive multiplespray-and-wait routing algorithm based on social circles in delay tolerant networks[J].Computer Networks,2021,189(12):107901.
[23]KERANEN A,OTT J,KARKKAINEN T.The ONE simulator for DTN protocol evaluation[C]// Proceedings of the 2nd International Conference on Simulation Tools and Techniques.Brussels:Institute for Computer Sciences.Social-Informatics and Telecommunications Engineering,2009:1-10.
[24]LI J B,XIAO M J.Routing algorithms in delay tolerant networks [M].Beijing:Science Press,2014:247-255.
[25]LIANG Z,REN Z P,WU X J.Congestion aware routing algorithm based on time factor in DTN[J].Computer Engineering and Application,2015,51(5):97-101.
[26]HU H,YANG D W,WANG H,et al.Delay tolerant network routing algorithm based on motion state awareness [J].Journal of Beijing University of Technology,2019,39(1):68-74.
[1] LU Yuhan, CHEN Liquan, WANG Yu, HU Zhiyuan. Efficient Encrypted Image Content Retrieval System Based on SecureCNN [J]. Computer Science, 2023, 50(9): 26-34.
[2] LIU Han-qing, KANG Xiao-dong, GAO Wan-chun, LI Bo, WANG Ya-ge, ZHANG Hua-li, BAI Fang. Research on Propagation of COVID-19 Based on Multiple Models [J]. Computer Science, 2021, 48(6A): 196-202.
[3] HU Jun, WANG Yu-tong, HE Xin-wei, WU Hui-dong, LI Hui-jia. Analysis and Application of Global Aviation Network Structure Based on Complex Network [J]. Computer Science, 2021, 48(6A): 321-325.
[4] CUI Jian-qun, HUANG Dong-sheng, CHANG Ya-nan, WU Shu-qing. Congestion Control Based on Message Quality and Node Reliability in DTN [J]. Computer Science, 2021, 48(4): 268-273.
[5] LI Zhi-yuan,LI Jing,ZHANG Jian. Simulation for Integrated Space-Ground TT&C and Communication Network Routing Algorithm [J]. Computer Science, 2018, 45(6A): 295-299.
[6] LI Xiang-li and XUAN Mao-yi. Research on Incentive Strategy of Nodes in Selfish Opportunistic Network [J]. Computer Science, 2017, 44(4): 213-217.
[7] WEN Guan-qi, WANG Zhong, GONG Zheng-zheng, ZHANG Shao-lei and WANG Jing. Two-hop ACK Message Based Routing Algorithm with Alternative Copy in DTN [J]. Computer Science, 2016, 43(Z11): 275-277.
[8] HAN Jin, SHI Jin and REN Yong-jun. DTN Routing Algorithm Based on Region Segmentation [J]. Computer Science, 2015, 42(10): 113-116.
[9] LIU Zhen,QI Yong,LI Qian-mu,HAN Hui and ZHANG Hong. DTN Resilience Quality Adaptive Prototype System Based on ASSFR [J]. Computer Science, 2013, 40(8): 100-108.
[10] CHEN Song-lin and QIN Yan. Energy-efficient Game Theoretic Model in Multi-hop Networks Having Selfish Nodes [J]. Computer Science, 2013, 40(12): 182-185.
[11] HUANG Gang,LI Jin-hang,JIA Yan. SWO: A Fast Search Algorithm Based on Small World Effect [J]. Computer Science, 2011, 38(7): 255-260.
[12] MA Chi,ZHANG Hong, LIU Feng-yu. Integrated Route Strategy for Large Scale MANET [J]. Computer Science, 2011, 38(6): 96-100.
[13] ZHOU Ming-qiang,WANG Dong,LI Shuang-qing,HU Jun,ZHU Qing-sheng. Strategy of UDDI Superpeer Configuration Based on Vertex Weight Priority [J]. Computer Science, 2010, 37(6): 118-121.
[14] SUN Qi-lu,DAI Guan-zhong,PAN Wen-ping. Adaptive Control-based Proportional Delay Differentiated Service on DTN Web Servers [J]. Computer Science, 2010, 37(2): 105-109.
[15] CHEN Zi-yu ,HE Zhong-shi ,ZHANG Cheng （College of Computer Science, Chongqing University, Chongqing 400044, China）. [J]. Computer Science, 2009, 36(3): 201-204.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
Add:18# Honghu West Rd., Yubei ,Chongqing,China    Post Code: 401121
Tel: 023-63500828/023-67039612/023-67039623
E-mail: jsjkx12@163.com
Powered by Beijing Magtech Co., Ltd.