A novel gossip-based sensing coverage algorithm for dense wireless sensor networks

DOI10.1016/J.COMNET.2009.04.003zbMATH Open1176.68024OpenAlexW2119894130MaRDI QIDQ838488FDOQ838488

Authors: Vinh Tran-Quang, Takumi Miyoshi 

Publication date: 26 August 2009

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

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

Recommendations

• A distributed algorithmic framework for coverage problems in wireless sensor networks
• Distributed algorithms for dynamic coverage in sensor networks
• Distributed Sensor Coordination Algorithms for Efficient Coverage in a Network of Heterogeneous Mobile Sensors
• Sensor Network Gossiping or How to Break the Broadcast Lower Bound
• Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks

zbMATH Keywords

algorithmenergy efficiencywireless sensor networksgossip-basedrouting protocolsensing coverage

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Cited In (3)

• Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)
• Energy-efficient sensing coverage and communication for wireless sensor networks
• On the scalability of expanding ring search for dense wireless sensor networks

This page was built for publication: A novel gossip-based sensing coverage algorithm for dense wireless sensor networks

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