A Localized Algorithm Based on Minimum Cost Arborescences for the MECBS Problem with Asymmetric Edge Costs

Barboza, Frederico J. R.; Assis, Flávio

doi:10.1007/978-3-642-29096-1_16

Cited by 2 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…it defines a transmission power to each node such that the induced graph contains a broadcast tree rooted at the source node. This algorithm is described in details in [1].…”

Section: The Lmca Algorithmmentioning

confidence: 99%

“…The algorithm, as described above, does not guarantee that all nodes become covered. However, full coverage does not happen only in very rare situations [1]. Full coverage is guaranteed by a second phase of the algorithm, where each node checks (after a certain period of time) if it has been covered.…”

Section: The Lmca Algorithmmentioning

confidence: 99%

“…The chosen neighbour adjusts its transmission power in order to cover the requesting node and thus becomes a relay (if it has not been one yet). Any uncovered node will eventually have a covered node in its neighbourhood (see [1]). …”

Section: The Lmca Algorithmmentioning

confidence: 99%

“…Due to lack of space, proofs are omitted. As DLMCA is based on LMCA, arguments for its correctness are based on those of LMCA [1]. It is assumed that the graph (network) is strongly connected when all processes transmit at maximum power.…”

Section: Correctnessmentioning

confidence: 99%

“…It consists in dynamically applying LMCA (Localized algorithm for energy-efficient broadcast based on Local Minimum Cost Arborescences) [1]. LMCA is a heuristic for the related MECBS (Minimum Energy Consumption Broadcast Subgraph) problem.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Localized Algorithm for the Maximum Lifetime Broadcast Problem with Asymmetric Edge Costs

Nunes

Barboza

Silva³

2012

2012 IEEE 11th International Symposium on Network Computing and Applications

Self Cite

View full text Add to dashboard Cite

In this paper we present an algorithm for the Maximum Lifetime Broadcast (MLB) problem, i.e. the problem of extending network lifetime when a series of broadcast operations is executed. The algorithm, called DLMCA, is localized (it uses only 2-hop information) and supports asymmetric edge costs, i.e. those scenarios where the cost of sending a message from a node u to node v might be different from the cost of sending a message from v to u. Addressing asymmetry of edge costs is an important issue, as it arises in different scenarios, such as in heterogeneous networks or when overhearing costs are taken into consideration. According to our experiments, DLMCA outperformed alternative solutions to the problem. As far as we know, DLMCA is the first localized algorithm to the MLB problem with asymmetric edge costs. Keywords-MaximumLifetime Broadcast; asymmetric edge costs; localized algorithm 2012 IEEE 11th International Symposium on Network Computing and Applications 978-0-7695-4773-2/12 $26.00

show abstract

“…it defines a transmission power to each node such that the induced graph contains a broadcast tree rooted at the source node. This algorithm is described in details in [1].…”

Section: The Lmca Algorithmmentioning

confidence: 99%

Section: The Lmca Algorithmmentioning

confidence: 99%

Section: The Lmca Algorithmmentioning

confidence: 99%

Section: Correctnessmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations