Distributed Greedy Scheduling for Multihop Wireless Networks

2010/06/25 by Albert Sunny, Sunny, Albert, Joy Kuri +1
Computer Science · Engineering · Mathematics · #Advanced Wireless Network Optimization #Algorithm #Artificial intelligence #Computer network #Computer science #Cooperative Communication and Network Coding #Distributed computing #FOS: Computer and information sciences #Greedy algorithm #Heuristic #Mathematical optimization #Mathematics #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Schedule #Scheduling (production processes) #Telecommunications #Wireless #Wireless network #cs.NI

paper · pdf · doi:10.48550/arxiv.1006.4937

arxiv created 2010/06/25 · openalex publication_date 2010/06/25 · arxiv updated 2010/06/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

We consider the problem of scheduling in multihop wireless networks subject to interference constraints. We consider a graph based representation of wireless networks, where scheduled links adhere to the K-hop link interference model. We develop a distributed greedy heuristic for this scheduling problem. Further, we show that this distributed greedy heuristic computes the exact same schedule as the centralized greedy heuristic.

Related

• Link Scheduling for Throughput Maximization in Multihop Wireless Networks Under Physical Interference
• A Greedy link scheduler for Wireless Networks having Gaussian Broadcast and Multiple Access Channels
• Approximation Algorithms for Link Scheduling with Physical Interference Model in Wireless Multi-hop Networks
• Approximate Aggregate Utility Maximization in Multi-Hop Wireless Networks using Distributed Greedy Scheduling
• Distributed Link Scheduling with Constant Overhead