2015
DOI: 10.1016/j.jnca.2015.04.004
|View full text |Cite
|
Sign up to set email alerts
|

An efficient distributed max-flow algorithm for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 28 publications
0
2
0
Order By: Relevance
“…Applications Technique [7] Interference-free localization Maximum flow [10], [32] Nodes deployment Quadratic Assignment [23] Network lifetime Set Cover Problem and variant [30] [43] Routing Graph Coloring Problem [33] Routing Voronoi based path searching [44], [47] Energy Saving Multipath [28] Network lifetime Linear programming [12] QoS Multipath [24] Minimizing Energy Binary Integer Linear Programming [27] Energy saving Mixed Integer Linear Programming [48] Routing and sink location Integer programming [29] Energy Minimum Dominant set [34] Routing Dominant Set [31] Node localization Integer linear programming [38] Node localization Mathematical programing [39] Node localization, network lifetime Linear Programming [41] Interference [7], [10], [27], [29], [32] [34], [41], [43], [45], [48], [49], [52], [58], [59], [62], [65] √ √ [12], [23], [24], [28], [33], [38], [39], [44], [46], …”
Section: Referencesmentioning
confidence: 99%
See 1 more Smart Citation
“…Applications Technique [7] Interference-free localization Maximum flow [10], [32] Nodes deployment Quadratic Assignment [23] Network lifetime Set Cover Problem and variant [30] [43] Routing Graph Coloring Problem [33] Routing Voronoi based path searching [44], [47] Energy Saving Multipath [28] Network lifetime Linear programming [12] QoS Multipath [24] Minimizing Energy Binary Integer Linear Programming [27] Energy saving Mixed Integer Linear Programming [48] Routing and sink location Integer programming [29] Energy Minimum Dominant set [34] Routing Dominant Set [31] Node localization Integer linear programming [38] Node localization Mathematical programing [39] Node localization, network lifetime Linear Programming [41] Interference [7], [10], [27], [29], [32] [34], [41], [43], [45], [48], [49], [52], [58], [59], [62], [65] √ √ [12], [23], [24], [28], [33], [38], [39], [44], [46], …”
Section: Referencesmentioning
confidence: 99%
“…In standard network flow problems this constraint is usually related to link capacity. In this context, authors in [7] proposed push-relabel method of Max-Flow technique to reduce message complexity and satisfy real-time requirements. They modeled WSNs as a network G= (V, E) whose nodes V are sensors and E is the set of the full-duplex directed communication edge.…”
Section: Referencesmentioning
confidence: 99%