Fast algorithm for multicast and data gathering in wireless networks

DOI10.1016/J.IPL.2007.12.007zbMATH Open1185.68048OpenAlexW2163067344MaRDI QIDQ963390FDOQ963390

Authors: Michael Segal 

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.12.007

Recommendations

• Optimal time data gathering in wireless networks with multidirectional antennas
• Algorithmic Applications in Management
• Maximum Lifetime Broadcasting in Wireless Networks
• An Approximation Algorithm for the Wireless Gathering Problem
• Algorithms for energy-efficient multicasting in static ad hoc wireless networks

zbMATH Keywords

analysis of algorithmswireless networkmulticasting

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Cites Work

• Time bounds for selection
• Title not available (Why is that?)
• Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
• Minimum-energy broadcasting in static ad hoc wireless networks
• Maximum Lifetime Broadcasting in Wireless Networks
• The partial sum criterion for Steiner trees in graphs and shortest paths

Cited In (1)

• Improved approximation algorithms for maximum lifetime problems in wireless networks

This page was built for publication: Fast algorithm for multicast and data gathering in wireless networks

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