.png){kind=icon}
返回
An efficient distributed max-flow algorithm for Wireless Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jnca.2015.04.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The max-flow problem (MFP) is one of the most explored problems in the area of combinatorial optimization and it has a wide variety of potential applications in computer networks, especially in Wireless Sensor Networks (WSNs). In this paper, we propose a WSN-specific solution to MFP based on the well-known push-relabel method. In our solution we provide several techniques and heuristics to implement asynchronous communication, reduce message complexity, support adaptability, and satisfy soft real-time requirements. Because these heuristics are independent, we can adjust the algorithm by applying some heuristics and ignoring the others, according to the application requirements. Both theoretical analysis and simulation results show that the proposed algorithm makes a significant improvement in the case of message and time complexities in comparison with the best existing algorithms. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Wireless Sensor Networks
Max-flow problem
Adaptive algorithm
Distributed algorithm
Asynchronous algorithm
Near-optimal flow
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
3.6K
被引数:
1.1W
机构
引用论文
Mechanical Properties of Fibre Reinforced Polymers under Elevated Temperatures: An Overview.png)
Polymers
OAAI
PolymersIF0
OAAI分享收藏Label switched protocol routing with guaranteed bandwidth and end to end path delay in MPLS networks
PREAI
分享收藏
查看更多内容