Design of Opportunistic Routing Based on Markov Decision Process

被引:0
|
作者
Hao, Jun [1 ]
Jia, Xinchun [1 ]
Han, Zongyuan [2 ]
Yang, Bo [1 ]
Peng, Dengyong [1 ]
机构
[1] Shanxi Univ, Sch Math Sci, Taiyuan 030006, Shanxi, Peoples R China
[2] China Acad Railway Sci, Inst Comp Technol, Beijing 100081, Peoples R China
关键词
Opportunistic Routing; Markov Decision Process; Optimal Forwarding Strategy; NETWORKS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The instability of wireless links makes the choice of forwarding nodes have too many possibilities in opportunistic routing. In this paper, the Markov decision process (MDP) is used to model the whole packet forwarding process from the source node to the destination node, which facilitates making reasonable decisions when the sender selects the forwarding nodes. By solving a finite-state MDP problem, an optimal forwarding strategy is obtained to minimize the expected number of transmissions for each node. Further more, the properties of expected any-path transmissions (EAX) are used for the selection of candidate forwarder set, which can significantly reduce the feasible optimal solution space. Finally, An opportunistic routing protocol based on Markov decision process (MDP-OR) is designed, whose effectiveness is verified by an example and its simulation.
引用
收藏
页码:8976 / 8981
页数:6
相关论文
共 50 条
  • [21] Design of Routing Protocol for Opportunistic Network Based on Adaptive Motion
    Zhang, Qifei
    Song, Ying
    Sun, Baolin
    Dai, Zhifeng
    IEEE ACCESS, 2020, 8 : 18228 - 18239
  • [22] A Markov decision process approach to vacant taxi routing with e-hailing
    Yu, Xinlian
    Gao, Song
    Hu, Xianbiao
    Park, Hyoshin
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2019, 121 : 114 - 134
  • [23] MARKOV DECISION ALGORITHMS FOR DYNAMIC ROUTING
    KRISHNAN, KR
    IEEE COMMUNICATIONS MAGAZINE, 1990, 28 (10) : 66 - 69
  • [24] Markov Decision Process Design for Imitation of Optimal Task Schedulers
    Rademacher, Paul
    Wagner, Kevin
    Smith, Leslie
    2023 IEEE STATISTICAL SIGNAL PROCESSING WORKSHOP, SSP, 2023, : 56 - 60
  • [25] Traffic Signal Control based on Markov Decision Process
    Xu, Yunwen
    Xi, Yugeng
    Li, Dewei
    Zhou, Zhao
    IFAC PAPERSONLINE, 2016, 49 (03): : 67 - 72
  • [26] A Tensor-Based Markov Decision Process Representation
    Kuinchtner, Daniela
    Meneguzzi, Felipe
    Sales, Afonso
    ADVANCES IN SOFT COMPUTING, MICAI 2020, PT I, 2020, 12468 : 313 - 324
  • [27] HIERARCHICAL MARKOV DECISION PROCESS BASED ON DEVS FORMALISM
    Kessler, Celine
    Capocchi, Laurent
    Santucci, Jean-Francois
    Zeigler, Bernard
    2017 WINTER SIMULATION CONFERENCE (WSC), 2017, : 1001 - 1012
  • [28] The Intervention of Community Evolution Based on Markov Decision Process
    Chai, Pei-Hua
    Man, Jun-Yi
    Zeng, Yi-Feng
    Cao, Lang-Cai
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2022, 43 (11): : 1536 - 1543
  • [29] Approximate Regret Based Hicitation in Markov Decision Process
    Alizadeh, Pegah
    Chevaleyre, Yann
    Zucker, Jean-Daniel
    2015 IEEE RIVF INTERNATIONAL CONFERENCE ON COMPUTING & COMMUNICATION TECHNOLOGIES - RESEARCH, INNOVATION, AND VISION FOR THE FUTURE (RIVF), 2015, : 47 - 52
  • [30] Infinite-Horizon Average-Cost Markov Decision Process Routing Games
    Calderone, Dan
    Sastry, S. Shankar
    2017 IEEE 20TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC), 2017,