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 条

[21] A Generalized A* Algorithm for Finding Globally Optimal Paths in Weighted Colored Graphs
Lim, Jaein
Tsiotras, Panagiotis
[J]. 2021 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA 2021), 2021, : 7503 - 7509
[22] Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes
Bossard, Antoine
Kaneko, Keiichi
[J]. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2014, 30 (04) : 1087 - 1093
[23] Identifying multiple optimal paths in Antnet Routing Algorithm with negligible Overhead
Upadhyaya, Shuchita
Setiya, Richa
[J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2009, 9 (02): : 314 - 319
[24] A routing algorithm for finding low-cost pair of no-shared-risk paths
Wen, HB
Li, LM
Wang, S
[J]. 6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL X, PROCEEDINGS: MOBILE/WIRELESS COMPUTING AND COMMUNICATION SYSTEMS II, 2002, : 430 - 434
[25] Integer linear program method of finding link- disjoint paths for QoS routing
Ni, Ming-Fang
Gao, Shi-Yun
Wu, Xin-Rong
Tong, Wei
[J]. Kongzhi yu Juece/Control and Decision, 2012, 27 (10): : 1597 - 1600
[26] A distributed routing protocol for finding two node-disjoint paths in computer networks
Ishida, K
Kakuda, Y
Kikuno, T
Amano, K
[J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 1999, E82B (06) : 851 - 858
[27] An Optimal Algorithm for Finding Disjoint Rectangles and Its Application to PCB Routing
Kong, Hui
Ma, Qiang
Yan, Tan
Wong, Martin D. F.
[J]. PROCEEDINGS OF THE 47TH DESIGN AUTOMATION CONFERENCE, 2010, : 212 - 217
[28] ALGORITHMS FOR FINDING AN OPTIMAL SET OF SHORT DISJOINT PATHS IN A COMMUNICATION-NETWORK
TORRIERI, D
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1992, 40 (11) : 1698 - 1702
[29] A novel scalable parallel algorithm for finding optimal paths over heterogeneous terrain
Maple, C
Hitchcock, J
[J]. NINTH INTERNATIONAL CONFERENCE ON INFORMATION VISUALISATION, PROCEEDINGS, 2005, : 664 - 669
[30] SPEEDING UP DYNAMIC-PROGRAMMING ALGORITHMS FOR FINDING OPTIMAL LATTICE PATHS
SPOUGE, JL
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1989, 49 (05) : 1552 - 1566

← 1 2 3 4 5 →