Optimally Fast Data Gathering in Sensor Networks

DOI10.1007/11821069_35MaRDI QIDQ5756706zbMATH OpenOpenAlexFDO

Authors Adele A. Rescigno, Luisa Gargano

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_35

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
• Real-time data gathering in sensor networks

Cited in

(12)

• Collision-free path coloring with application to minimum-delay gathering in sensor networks
• Optimal gathering protocols on paths under interference constraints
• Bi-objective data gathering path planning for vehicles with bounded curvature
• Sensor network topology design and analysis for efficient data gathering by a mobile mule
• Improved solution to data gathering with mobile mule
• Optimal coloring for data collection in tree-based wireless sensor networks
• Rijndael for sensor networks: is speed the main issue?
• Gathering with Minimum Delay in Tree Sensor Networks
• GATHERING RADIO MESSAGES IN THE PATH
• Algorithmic Aspects of Wireless Sensor Networks
• Optimal gathering in radio grids with interference
• Real-time data gathering in sensor networks

This page was built for publication: Optimally Fast Data Gathering in Sensor Networks

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