An Optimal Stopping Decision Method for Routing in Opportunistic Networks

被引:0
|
作者
Huang, Di [1 ,2 ]
Zhang, Sanfeng [1 ]
Chen, Zhou [1 ]
机构
[1] Southeast Univ, Minist Educ, Key Lab Comp Network & Informat Integrat, Nanjing 211189, Jiangsu, Peoples R China
[2] Southeast Univ, Sch Software Engn, Nanjing 211189, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Delivery Delay; Delivery Rate; Opportunistic Networks; Optimal Stopping;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Delivery delay is an important performance metric in opportunistic networks. With given buffer size and copy numbers, how to select appropriate nodes to replicate message is the key to minimizing delivery delay. To solve this problem, this paper proposes an Optimal Stopping Decision method for Routing of opportunistic networks (OSDR). With OSDR, the average meeting time between a node and the destination is regarded as the forwarding utility of the node. A node carrying a message observes the random forwarding utilities of the nodes it meets, and replicates messages according to the optimal stopping rule, which turns out to be threshold-based. By making tradeoffs between the forwarding utility and waiting cost, OSDR achieves the minimum delivery delay expectation. This paper introduces the OSDR network model and existence proof and calculation of optimal stopping rule in detail. Simulation results show that OSDR outperforms other protocols in delivery delay and delivery rate.
引用
收藏
页码:2074 / 2079
页数:6
相关论文
共 50 条
  • [1] Optimal stopping decision method for routing of opportunistic networks
    Zhang, San-Feng
    Huang, Di
    Chen, Zhou
    Wu, Guo-Xin
    Ruan Jian Xue Bao/Journal of Software, 2014, 25 (06): : 1291 - 1300
  • [2] OPTIMAL STOPPING AND CONTROL OF DYNAMIC ROUTING IN NETWORKS
    YAVIN, Y
    MATHEMATICAL AND COMPUTER MODELLING, 1993, 17 (03) : 57 - 65
  • [3] Efficient broadcast in opportunistic networks using optimal stopping theory
    Borrego, Carlos
    Borrell, Joan
    Robles, Sergi
    AD HOC NETWORKS, 2019, 88 : 5 - 17
  • [4] Near-optimal online routing in opportunistic networks
    Arastouie, Narges
    Sabaei, Masoud
    Bakhshi, Bahador
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2019, 32 (03)
  • [5] Forwarding in Opportunistic Information-Centric Networks: An Optimal Stopping Approach
    Borrego, Carlos
    Amadeo, Marica
    Molinaro, Antonella
    Mendes, Paulo
    Sofia, Rute C.
    Magaia, Naercio
    Borrell, Joan
    IEEE COMMUNICATIONS MAGAZINE, 2020, 58 (05) : 56 - 61
  • [6] Throughput Regions and Optimal Policies in Wireless Networks with Opportunistic Routing
    Libman, Lavy
    Paschos, Georgios S.
    Georgiadis, Leonidas
    Zhao, Xin
    2013 11TH INTERNATIONAL SYMPOSIUM ON MODELING & OPTIMIZATION IN MOBILE, AD HOC & WIRELESS NETWORKS (WIOPT), 2013, : 516 - 523
  • [7] Routing in Opportunistic Networks
    Nguyen, Hoang Anh
    Giordano, Silvia
    INTERNATIONAL JOURNAL OF AMBIENT COMPUTING AND INTELLIGENCE, 2009, 1 (03) : 19 - 38
  • [8] Self-decision geographic opportunistic routing for highly dynamic networks
    Yang, X., 1600, Xi'an Jiaotong University (47):
  • [9] Leapfrog:Optimal Opportunistic Routing in Probabilistically Contacted Delay Tolerant Networks
    肖明军
    黄刘生
    董群峰
    刘安
    杨振国
    Journal of Computer Science & Technology, 2009, 24 (05) : 975 - 986
  • [10] Leapfrog: Optimal Opportunistic Routing in Probabilistically Contacted Delay Tolerant Networks
    Xiao, Ming-Jun
    Huang, Liu-Sheng
    Dong, Qun-Feng
    Liu, An
    Yang, Zhen-Guo
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2009, 24 (05) : 975 - 986