Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks

DOI10.1007/S11464-009-0050-4MaRDI QIDQ2266832zbMATH OpenOpenAlexFDO

Authors Weiping Shang, Peng-Jun Wan, Xiaodong Hu

Publication date 26 February 2010

Published in Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11464-009-0050-4

zbMATH Keywords

approximation algorithmbroadcast scheduleunit disk graphwireless sensor network

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks
• Approximation for a scheduling problem with application in wireless networks
• Minimum-time aggregation scheduling in duty-cycled wireless sensor networks
• Improved algorithm for minimum data aggregation time problem in wireless sensor networks
• An approximation algorithm for the wireless gathering problem

Cites work

• Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
• scientific article; zbMATH DE number 3975775 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2038712 (Why is no real title available?)
• scientific article; zbMATH DE number 2079323 (Why is no real title available?)
• scientific article; zbMATH DE number 910916 (Why is no real title available?)
• Message Multicasting in Heterogeneous Networks
• Wireless Sensor Networks

Cited in

(10)

• Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks
• Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks
• A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem
• Lower and upper bounds for minimum energy broadcast and sensing problems in sensor networks†
• A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
• Scheduling sensors by tiling lattices
• Strong bounds and exact solutions to the minimum broadcast time problem
• A near optimal periodic transmission schedule in bounded degree wireless sensor network
• Biased random-key genetic algorithms for the weighted minimum broadcast time problem
• Approximation for a scheduling problem with application in wireless networks

This page was built for publication: Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266832)