Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

DOI10.1080/17445760601111459zbMath1124.68013OpenAlexW2080147710MaRDI QIDQ5421614

Richard Lahusen, Fenghua Yuan, Behrooz Shirazi, Wen-Zhan Song

Publication date: 24 October 2007

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760601111459

zbMATH Keywords

algorithmschedulinggraph theoryenergy efficiencyWireless sensor networkstime optimum

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks

Cites Work

• The relative neighbourhood graph of a finite planar set
• Time-constrained scheduling of weighted packets on trees and meshes
• Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
• General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate)
• A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria

This page was built for publication: Time-optimum packet scheduling for many-to-one routing in wireless sensor networks