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 条
  • [41] DTN routing as a resource allocation problem
    Balasubramanian, Aruna
    Levine, Brian Neil
    Venkataramani, Arun
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2007, 37 (04) : 373 - 384
  • [42] Research on unicast routing for deep space sensor networks based on DTN
    Li, Wenjie
    Yao, Lin
    Feng, Lifang
    2012 FOURTH INTERNATIONAL CONFERENCE ON MULTIMEDIA INFORMATION NETWORKING AND SECURITY (MINES 2012), 2012, : 616 - 619
  • [43] A Machine Learning Concept for DTN Routing
    Dudukovich, Rachel
    Hylton, Alan
    Papachristou, Christos
    2017 IEEE INTERNATIONAL CONFERENCE ON WIRELESS FOR SPACE AND EXTREME ENVIRONMENTS (WISEE), 2017, : 110 - 115
  • [44] ARAG: A Routing Algorithm Based on Incentive Mechanisms for DTN With Nodes' Selfishness
    Wang, Hezhe
    Wang, Huiqiang
    Guo, Fangfang
    Feng, Guangsheng
    Lv, Hongwu
    IEEE ACCESS, 2018, 6 : 29419 - 29425
  • [45] A routing strategy based on duplicates adaptive allocation and rapid spray in DTN
    Huang, Hongcheng
    Xiong, Zhongyang
    Wang, Dingguo
    Journal of Computational Information Systems, 2015, 11 (15): : 5681 - 5688
  • [46] A source routing algorithm based on CGR for DTN-Nanosatellite Networks
    Marchese, Mario
    Patrone, Fabio
    GLOBECOM 2017 - 2017 IEEE GLOBAL COMMUNICATIONS CONFERENCE, 2017,
  • [47] A DTN Probabilistic Routing Protocol based on Exponentially Weighted Moving Average
    Kou, Lan
    Wang, Dingguo
    INTERNATIONAL CONFERENCE ON ELECTRICAL AND CONTROL ENGINEERING (ICECE 2015), 2015, : 691 - 695
  • [48] DTN Based Dominating Set Routing for MANET in Heterogeneous Wireless Networking
    Hany Samuel
    Weihua Zhuang
    Bruno Preiss
    Mobile Networks and Applications, 2009, 14 : 154 - 164
  • [49] A Named Data Approach for DTN Routing
    Li, Yaoxing
    Li, Yuhong
    Wolf, Lars
    Lingren, Anders
    Wang, Ji
    2017 WIRELESS DAYS, 2017, : 163 - 166
  • [50] Feedback Adaptive Routing Algorithm for DTN
    Ling, Shen
    Wei, Wu
    2009 WRI INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND MOBILE COMPUTING: CMC 2009, VOL 2, 2009, : 267 - 271