Data harvesting with mobile elements in wireless sensor networks

DOI10.1016/J.COMNET.2006.01.008zbMATH Open1103.68325OpenAlexW2168970473MaRDI QIDQ2432689FDOQ2432689

Authors: Yaoyao Gu, Doruk Bozdağ, Robert W. Brewer, Eylem Ekici 

Publication date: 25 October 2006

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2006.01.008

Recommendations

• A fast algorithm for data collection along a fixed track
• A fast algorithm for data collection along a fixed track
• Using mobile data collectors to improve network lifetime of wireless sensor networks with reliability constraints
• Distributed clustering algorithms for data-gathering in wireless mobile sensor networks
• Optimal relay node placement and trajectory computation in sensor networks with mobile data collector

zbMATH Keywords

mobilityschedulingsensor networkspath planningdata collectionsensor--actor

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (4)

• A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
• The minimum backlog problem
• Group sweep coverage with guaranteed approximation ratio
• An approximation algorithm for general energy restricted sweep coverage problem

This page was built for publication: Data harvesting with mobile elements in wireless sensor networks

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