Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
