DTN Routing based on Search Theory - An Overview

被引:0
|
作者
Sundararaj, Laveen [1 ]
Vellaiyan, Palanisamy [1 ]
机构
[1] Alagappa Univ, Dept Comp Sci & Engn, Karaikkudi 630003, Tamil Nadu, India
来源
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY | 2010年 / 10卷 / 11期
关键词
DTN - Delay and Disruption Tolerant Networking; IPN - Inter Planetary Internet; AUDTHMN - Alagappa University Delay Tolerant Habitat Monitoring Network; Alunivdtnsim - Alagappa University Delay Tolerant Network Simulator; LTP - Lick Lider Transmission Protocol; PRoPHET - Probabilistic Routing Protocol using History of Encounters and Transitivity; Lebesgue Measure; Ky Fan's minimax theorem; Neymanp - Pearson lemma;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper explores the theoretical approach to improve existing Delay and Disruption Tolerant Networking routing algorithms using Search Theory. Search Theory is a discipline within the field of operations research, whose applications range from deep-ocean search for submerged objects to deep space surveillance for artificial satellites. DTN deals with networks in challenged environment. DTN focuses on deep space to a broader class of heterogeneous networks that may suffer disruptions, affected by design decisions such as naming and addressing, message formats, data encoding methods, routing, congestion management and security. DTN is part of the Inter Planetary Internet with primary application being deep space networks. The hypothesis behind modeling DTN routing as a search game is based on the understanding that when the DTN agents are in the mode of Search game, routing decision based on Search theory becomes a prudent choice.
引用
收藏
页码:202 / 210
页数:9
相关论文
共 50 条
  • [21] CRSG:A congestion control routing algorithm for security defense based on social psychology and game theory in DTN
    王珵珺
    龚正虎
    陶勇
    张子文
    赵宝康
    JournalofCentralSouthUniversity, 2013, 20 (02) : 440 - 450
  • [22] An Efficient Routing Protocol for DTN
    Arya, Aikta
    Singh, Awadhesh Kumar
    ADVANCED INFORMATICS FOR COMPUTING RESEARCH, ICAICR 2017, 2017, 712 : 271 - 282
  • [23] Clustering routing method based on social characteristic in campus DTN
    Wang, En
    Yang, Yongjian
    Liu, Wenbin
    Wang, Fan
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2016, 31 (02): : 137 - 145
  • [24] Efficient routing in social DTN based on nodes' movement prediction
    Zhang, Zhen-Jing
    Jin, Zhi-Gang
    Shu, Yan-Tai
    Jisuanji Xuebao/Chinese Journal of Computers, 2013, 36 (03): : 626 - 635
  • [25] DTN Routing with Back-Pressure based Replica Distribution
    Jiao, Zhenzhen
    Tian, Rui
    Zhang, Baoxian
    Li, Cheng
    JOURNAL OF COMMUNICATIONS AND NETWORKS, 2014, 16 (04) : 378 - 384
  • [26] A HYBRID DTN-DSR ROUTING PROTOCOL BASED ON CLUSTERING
    Zhang, Gang
    Han, Tingting
    Shan, Wenwei
    Liu, Chunfen
    Shu, Yantai
    2012 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING (WICOM), 2012,
  • [27] A DTN Oriented Adaptive Routing Algorithm Based on Node Load
    Cui, Hongyan
    Chen, Diyue
    Welsch, Roy E.
    CHINA COMMUNICATIONS, 2022, 19 (12) : 54 - 63
  • [28] A improved Prophet routing based on congestion level of nodes in DTN
    Wang, Guizhu
    Tao, Jian
    Zhang, Hui
    Pan, Dong
    2017 IEEE 2ND ADVANCED INFORMATION TECHNOLOGY, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (IAEAC), 2017, : 1666 - 1669
  • [29] DTN routing algorithm based on gradient and fuzzy neural network
    Zhang, Wen-Zhu
    Zhao, Bei
    Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2012, 40 (03): : 57 - 63
  • [30] Clustered DTN routing based on sensing node relationship strength
    Chen, Hongsheng
    Wu, Chunhui
    IET COMMUNICATIONS, 2024, 18 (12) : 726 - 743