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
来源
2013 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC) | 2013年
基金
中国国家自然科学基金;
关键词
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] Efficient broadcast in opportunistic networks using optimal stopping theory
    Borrego, Carlos
    Borrell, Joan
    Robles, Sergi
    AD HOC NETWORKS, 2019, 88 : 5 - 17
  • [3] Near-optimal online routing in opportunistic networks
    Arastouie, Narges
    Sabaei, Masoud
    Bakhshi, Bahador
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2019, 32 (03)
  • [4] Routing in Opportunistic Networks
    Nguyen, Hoang Anh
    Giordano, Silvia
    INTERNATIONAL JOURNAL OF AMBIENT COMPUTING AND INTELLIGENCE, 2009, 1 (03) : 19 - 38
  • [5] An Opportunistic Network Coding Routing for Opportunistic Networks
    Yao, Jiansheng
    Ma, Chunguang
    Wu, Peng
    Du, Gang
    Yuan, Qi
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2017, 45 (01) : 157 - 171
  • [6] An Opportunistic Network Coding Routing for Opportunistic Networks
    Jiansheng Yao
    Chunguang Ma
    Peng Wu
    Gang Du
    Qi Yuan
    International Journal of Parallel Programming, 2017, 45 : 157 - 171
  • [7] Interest community detecting method and routing scheme in opportunistic networks
    Liu, Qi-Lie, 1600, Beijing University of Posts and Telecommunications (37): : 62 - 66
  • [8] Distributed Opportunistic Scheduling for Ad Hoc Networks With Random Access: An Optimal Stopping Approach
    Zheng, Dong
    Ge, Weiyan
    Zhang, Junshan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (01) : 205 - 222
  • [9] Routing Protocols in Opportunistic Networks - A Survey
    Alajeely, Majeed
    Doss, Robin
    Ahmad, Asma'a
    IETE TECHNICAL REVIEW, 2018, 35 (04) : 369 - 387
  • [10] Prioritized Epidemic Routing for Opportunistic Networks
    Ramanathan, Ram
    Hansen, Richard
    Basu, Prithwish
    Rosales-Hain, Regina
    Krishnan, Rajesh
    MOBIOPP'07 - PROCEEDINGS OF THE FIRST INTERNATIONAL MOBISYS WORKSHOP ON MOBILE OPPORTUNISTIC NETWORKING, 2007, : 62 - 66