Asynchronous Distributed Greedy Link Scheduling in Multihop Wireless Networks

• Published in: IEEE transactions on vehicular technology Vol. 67; no. 10; pp. 10166 - 10170
• Main Authors: Chackochan, Reena, Dhanasekaran, Senthilkumar, Sunny, Albert
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.10.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Approximation algorithms; asynchronous algorithm; distributed algorithm; Graphical representations; Greedy algorithms; greedy heuristic; Heuristic algorithms; Interference; Production scheduling; Schedules; Scheduling; Scheduling algorithms; Spread spectrum communication; Wireless link scheduling; Wireless networks
• ISSN: 0018-9545; 1939-9359
• DOI: 10.1109/TVT.2018.2864091

We consider the problem of link scheduling in multihop wireless networks subject to interference constraints. We consider a graph-based representation of wireless networks where scheduled links adhere to the <inline-formula> <tex-math notation="LaTeX">K</tex-math></inline-formula>-hop link interference model. For this scheduling problem, we develop an asynchronous and distributed greedy heuristic. Furthermore, we show that this distributed heuristic computes the exact same schedule as the well-known centralized greedy link scheduling algorithm.