TY - CHAP
T1 - Approximation bounds on the number of mixedcast rounds in wireless ad-hoc networks
AU - Lee, Sang Hyuk
AU - Radzik, Tomasz
PY - 2013
Y1 - 2013
N2 - We consider the following type of Maximum Network Lifetime problems. For a wireless network N with given capacities of node batteries, and a specification of a communication task which is to be performed periodically in N, find a maximum-size feasible collection of routing topologies for this task. Such a collection of routing topologies defines the maximum number of rounds this task can be performed before the first node in the network dies due to battery depletion. The types of communication tasks which we consider are unicast, broadcast, convergecast and mixedcast. The mixedcast is the requirement that some fixed number of tasks of the basic types (unicast, broadcast, convergecast) are periodically performed. We show that one can compute in polynomial time the number k of mixedcast rounds which is at least ⌊kopt/ 5⌋, for the single-topology variant of the problem, and at least ⌊kopt/6⌋, for the multiple-topology variant, improving the previous bounds.
AB - We consider the following type of Maximum Network Lifetime problems. For a wireless network N with given capacities of node batteries, and a specification of a communication task which is to be performed periodically in N, find a maximum-size feasible collection of routing topologies for this task. Such a collection of routing topologies defines the maximum number of rounds this task can be performed before the first node in the network dies due to battery depletion. The types of communication tasks which we consider are unicast, broadcast, convergecast and mixedcast. The mixedcast is the requirement that some fixed number of tasks of the basic types (unicast, broadcast, convergecast) are periodically performed. We show that one can compute in polynomial time the number k of mixedcast rounds which is at least ⌊kopt/ 5⌋, for the single-topology variant of the problem, and at least ⌊kopt/6⌋, for the multiple-topology variant, improving the previous bounds.
KW - Approximation Algorithm
KW - Broadcast
KW - Convergecast
KW - Network Lifetime
KW - Wireless Networks
UR - http://www.scopus.com/inward/record.url?scp=84893078200&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-45278-9_24
DO - 10.1007/978-3-642-45278-9_24
M3 - Conference paper
AN - SCOPUS:84893078200
SN - 9783642452772
VL - 8288 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 283
EP - 296
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
T2 - 24th International Workshop on Combinatorial Algorithms, IWOCA 2013
Y2 - 10 July 2013 through 12 July 2013
ER -