Method for optimal allocation of network resources based on discrete probability model

被引:1
作者
Song, Zhengqiang [1 ]
Hao, Guo [2 ]
机构
[1] Yantai Vocat Coll, Org & Personnel Off, Yantai 264670, Peoples R China
[2] Yantai Vocat Coll, Dept Construct Engn, Yantai 264670, Peoples R China
关键词
Discrete probability model; Network resources; Optimal configuration; Perceptual probability; Convergence; Coverage enhancement; OPTIMIZATION;
D O I
10.1007/s11276-021-02727-7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The method for optimal allocation of network resources based on discrete probability model is proposed. In order to take into account multiple coverage of the monitored points, the method constructs the discrete probability perception model of the network nodes. The model is introduced into the solution of the node coverage area, and the optimized parameters of the sensor optimization arrangement are used to optimize the layout of the multimedia sensor nodes. After setting the node scheduling standard, the interaction force between the sensor nodes and the points on the curve path is analyzed by the virtual force analysis method based on the discrete probability model At the same time On this basis, the path coverage algorithm based on the moving target is used to optimize the coverage of the wireless sensor network node in order to achieve optimal configuration of network resources. The experimental results show that the proposed method has good convergence and can complete the node coverage process in a short time. The introduction of the node selection criteria and the adoption of the dormant scheduling mechanism greatly improve the energy saving effect and enhance the network resource optimization effect.
引用
收藏
页码:2743 / 2754
页数:12
相关论文
共 29 条
  • [1] Concurrent optimal allocation of geometric and process tolerances based on the present worth of quality loss using evolutionary optimisation techniques
    Balamurugan, C.
    Saravanan, A.
    Babu, P. Dinesh
    Jagan, S.
    Narasimman, S. Ranga
    [J]. RESEARCH IN ENGINEERING DESIGN, 2017, 28 (02) : 185 - 202
  • [2] Brown T.S., 2018, APPL MATH NONLIN SCI, V1, P55, DOI 10.21042/AMNS.2018.1.00006
  • [3] Hybrid Microgrid Many-Objective Sizing Optimization With Fuzzy Decision
    Cao, Bin
    Dong, Weinan
    Lv, Zhihan
    Gu, Yu
    Singh, Surjit
    Kumar, Pawan
    [J]. IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2020, 28 (11) : 2702 - 2710
  • [4] A Many-Objective Optimization Model of Industrial Internet of Things Based on Private Blockchain
    Cao, Bin
    Wang, Xuesong
    Zhang, Weizheng
    Song, Houbing
    Lv, Zhihan
    [J]. IEEE NETWORK, 2020, 34 (05): : 78 - 83
  • [5] Quantum-enhanced multiobjective large-scale optimization via parallelism
    Cao, Bin
    Fan, Shanshan
    Zhao, Jianwei
    Yang, Po
    Muhammad, Khan
    Tanveer, Mohammad
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2020, 57 (57)
  • [6] Stability analysis of fourth-order iterative method for finding multiple roots of non-linear equations
    Cordero, Alicia
    Jaiswal, Jai P.
    Torregrosa, Juan R.
    [J]. APPLIED MATHEMATICS AND NONLINEAR SCIENCES, 2019, 4 (01) : 43 - 56
  • [7] Perceptual QoE-Optimal Resource Allocation for Adaptive Video Streaming
    Eswara, Nagabhushan
    Chakraborty, Soumen
    Sethuram, Hemanth P.
    Kuchi, Kiran
    Kumar, Abhinav
    Channappayya, Sumohana S.
    [J]. IEEE TRANSACTIONS ON BROADCASTING, 2020, 66 (02) : 346 - 358
  • [8] Optimal allocation of hybrid energy storage for microgrids based on multi-attribute utility theory
    Feng, Xiaoshan
    Gu, Jie
    Guan, Xuefei
    [J]. JOURNAL OF MODERN POWER SYSTEMS AND CLEAN ENERGY, 2018, 6 (01) : 107 - 117
  • [9] Modeling and analysis of cascading node-link failures in multi-sink wireless sensor networks
    Fu, Xiuwen
    Yang, Yongsheng
    [J]. RELIABILITY ENGINEERING & SYSTEM SAFETY, 2020, 197
  • [10] Environment-fusion multipath routing protocol for wireless sensor networks
    Fu, Xiuwen
    Fortino, Giancarlo
    Pace, Pasquale
    Aloi, Gianluca
    Li, Wenfeng
    [J]. INFORMATION FUSION, 2020, 53 : 4 - 19