OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks

被引：4
|
作者：
Zhang, Kejia [1 ]
Han, Qilong [1 ]
Yin, Guisheng [1 ]
Pan, Haiwei [1 ]
机构：
[1] Harbin Engn Univ, Coll Comp Sci & Technol, Room 541,Bldg 21, Harbin 150001, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2016年 / 31卷 / 04期
基金：
中国国家自然科学基金;
关键词：
Disjoint paths; Minimum total length; Sensor networks; Distributed algorithm; COMPLEXITY;
D O I：
10.1007/s10878-015-9845-2
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper investigates the MINimum-length--Disjoint-Paths (MIN--DP) problem: in a sensor network, given two nodes and , a positive integer , finding (node) disjoint paths connecting and with minimum total length. An efficient distributed algorithm named Optimally-Finding-Disjoint-Paths (OFDP) is proposed for this problem. OFDP guarantees correctness and optimality, i.e., (1) it will find disjoint paths if there exist disjoint paths in the network or the maximum number of disjoint paths otherwise; (2) the disjoint paths it outputs do have minimum total length. To the best of our knowledge, OFDP is the first distributed algorithm that can solve the MIN--DP problem with correctness and optimality guarantee. Compared with the existing centralized algorithms which also guarantee correctness and optimality, OFDP is shown to be much more efficient by simulation results.
引用
收藏
页码：1623 / 1641
页数：19
相关论文
共 50 条
  • [31] A Distributed Clustering Algorithm for Wireless Sensor Networks
    Lv, T.
    Cai, Z. B.
    INTERNATIONAL CONFERENCE ON ADVANCED MANAGEMENT SCIENCE AND INFORMATION ENGINEERING (AMSIE 2015), 2015, : 818 - 824
  • [32] A distributed reorganization algorithm in wireless sensor networks
    Zou, Zhen
    Yu, Fengqi
    2007 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND BIOMIMETICS, VOLS 1-5, 2007, : 664 - 667
  • [33] A Distributed Clustering Algorithm for Wireless Sensor Networks
    SHANG Fengjun College of Computer Science and Technology
    Wuhan University Journal of Natural Sciences, 2008, (04) : 385 - 390
  • [34] A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
    Babenko, Maxim A.
    Kolesnichenko, Ignat I.
    Razenshteyn, Ilya P.
    SOFSEM 2010: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2010, 5901 : 165 - 175
  • [35] Finding Two Edge-Disjoint Paths with Length Constraints
    Cai, Leizhen
    Ye, Junjie
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2016, 2016, 9941 : 62 - 73
  • [36] Finding Disjoint Paths in Boolean-valued Networks
    Shcherba, Evgeny, V
    Litvinov, George A.
    2018 26TH TELECOMMUNICATIONS FORUM (TELFOR), 2018, : 108 - 111
  • [37] Finding Arc and Vertex-Disjoint Paths in Networks
    Xie, Zheng
    Chen, Zhi
    Leng, Hongze
    Zhang, Jun
    EIGHTH IEEE INTERNATIONAL CONFERENCE ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, PROCEEDINGS, 2009, : 539 - +
  • [38] An Explicit Disjoint Multipath Algorithm for Cost Efficiency in Wireless Sensor Networks
    Oh, Hyun Woo
    Jang, Jong Hyun
    Moon, Kyeong Deok
    Park, Soochang
    Lee, Euisin
    Kim, Sang-Ha
    2010 IEEE 21ST INTERNATIONAL SYMPOSIUM ON PERSONAL INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2010, : 1899 - 1904
  • [39] Minimum energy broadcasting algorithm in wireless sensor networks
    College of Computing Science and Engineering, UESTC, Chengdu 610054, China
    Tongxin Xuebao, 2007, 4 (80-86):
  • [40] Finding sensing coverage and breach paths in surveillance wireless sensor networks
    Onur, E
    Ersoy, C
    Deliç, H
    2004 IEEE 15TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2004, : 984 - 988
12345