A distributed algorithmic framework for coverage problems in wireless sensor networks

DOI10.1080/17445760902720008zbMath1186.68018OpenAlexW2138515457MaRDI QIDQ3399239

Akshaye Dhawan, Sushil K. Prasad

Publication date: 29 September 2009

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.ursinus.edu/math_comp_fac/2

zbMATH Keywords

schedulingdistributed algorithmswireless sensor networksenergy efficiencymaximum lifetimelocalised algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (1)

Average case network lifetime on an interval with adjustable sensing ranges

Cites Work

• Unnamed Item
• Two minimum spanning forest algorithms on fixed-size hypercube computers
• Improving energy efficiency of centrally controlled wireless data networks

This page was built for publication: A distributed algorithmic framework for coverage problems in wireless sensor networks