A distributed and asynchronous approach for optimizing weighted graph matchings in wireless network services
作者：
Highlights：
• An approach for optimizing weighted matchings in wireless networks is proposed.
• A distributed and asynchronous weighted matching algorithm is presented.
• A tree-based efficient heuristic is provided for energy-efficient communication.
• Time and message complexities are analyzed.
• The effectiveness of proposed approach is shown by extensive experiments.
摘要
•An approach for optimizing weighted matchings in wireless networks is proposed.•A distributed and asynchronous weighted matching algorithm is presented.•A tree-based efficient heuristic is provided for energy-efficient communication.•Time and message complexities are analyzed.•The effectiveness of proposed approach is shown by extensive experiments.
论文关键词：Graph matching,Wireless networks,Distributed algorithms,Graph theory
论文评审过程：Received 12 March 2018, Revised 1 October 2018, Accepted 2 October 2018, Available online 10 October 2018, Version of Record 28 October 2018.
论文官网地址：https://doi.org/10.1016/j.eswa.2018.10.001
