Finding optimal paths in MREP routing

被引：0
|
作者：
Fleischer, R [1 ]
Golin, M
Lea, CT
Wong, S
机构：
[1] HKUST, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
[2] HKUST, Dept EEE, Kowloon, Hong Kong, Peoples R China
来源：
INFORMATION PROCESSING LETTERS | 2004年 / 89卷 / 02期
关键词：
approximation algorithms; graph algorithms; computational complexity;
D O I：
10.1016/j.ipl.2003.10.005
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Maximum Residual Energy Path (MREP) routing has been shown an effective routing scheme for energy conservation in battery powered wireless networks. Past studies on MREP routing are based on the assumption that the transmitting node consumes power, but the receiving node does not. This assumption is false if acknowledgment is required as occurs, for example, in some Bluetooth applications. If the receiving node does not consume power then the MREP routing problem for a single message is easily solvable in polynomial time using a simple Dijkstra-like algorithm. We further show in that when the receiving node does consume power the problem becomes NP-complete and is even impossible to approximate with an exponential approximation factor in polynomial time unless P = NP. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码：57 / 63
页数：7
相关论文
共 50 条
  • [1] On the algorithm for finding an optimal routing
    Wang, XP
    Wang, QA
    Wen, YD
    Zeng, LB
    [J]. 7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XI, PROCEEDINGS: COMMUNICATION, NETWORK AND CONTROL SYSTEMS, TECHNOLOGIES AND APPLICATIONS: II, 2003, : 272 - 275
  • [2] Finding routing paths for alternate routing in all-optical WDM networks
    Lin, Hwa-Chun
    Wang, Sheng-Wei
    Hung, Meng-Lin
    [J]. JOURNAL OF LIGHTWAVE TECHNOLOGY, 2008, 26 (9-12) : 1432 - 1444
  • [3] On finding approximate optimal paths in weighted regions
    Sun, Z
    Reif, JH
    [J]. JOURNAL OF ALGORITHMS, 2006, 58 (01) : 1 - 32
  • [4] On finding dissimilar Pareto-Optimal paths
    Dell'Olmo, P
    Gentili, M
    Scozzari, A
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 162 (01) : 70 - 82
  • [5] Dynamic distributed unicast routing: optimal incremental paths
    Heydarian, Mohsen
    [J]. JOURNAL OF SUPERCOMPUTING, 2014, 68 (01): : 214 - 244
  • [6] Dynamic distributed unicast routing: optimal incremental paths
    Mohsen Heydarian
    [J]. The Journal of Supercomputing, 2014, 68 : 214 - 244
  • [7] A Flexible Approach for Finding Optimal Paths with Minimal Conflicts
    Bowles, Juliana K. F.
    Caminati, Marco B.
    [J]. FORMAL METHODS AND SOFTWARE ENGINEERING, ICFEM 2017, 2017, 10610 : 209 - 225
  • [8] Algorithms for finding optimal disjoint paths around a rectangle
    Chan, WT
    Chin, FYL
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, 1350 : 314 - 323
  • [9] Optimal Number of Paths with Multipath Routing in Hybrid Networks
    Henri, Sebastien
    Thiran, Patrick
    [J]. 2018 IEEE 19TH INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS (WOWMOM), 2018,
  • [10] Efficient approaches for finding QoS constrained paths with applications for multicast routing
    Shih, TF
    Shih, CC
    [J]. PROCEEDINGS OF THE 8TH JOINT CONFERENCE ON INFORMATION SCIENCES, VOLS 1-3, 2005, : 312 - 315
12345