Average case network lifetime on an interval with adjustable sensing ranges

DOI10.1007/s00453-013-9853-5zbMath1312.68025OpenAlexW1998781240MaRDI QIDQ2345943

Amotz Bar-Noy, Ben Baumer

Publication date: 21 May 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://scholarworks.smith.edu/cgi/viewcontent.cgi?article=1024&context=mth_facpubs

zbMATH Keywords

lifetimewireless sensor networksarea coveragebarrier coverageadjustable rangerestricted strip cover

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Maximizing Barrier Coverage Lifetime with Static Sensors ⋮ Set it and forget it: approximating the set once strip cover problem ⋮ ``Green barrier coverage with mobile sensors ⋮ Minimizing the Maximum Moving Cost of Interval Coverage ⋮ Maximizing barrier coverage lifetime with static sensors ⋮ Maximizing Barrier Coverage Lifetime with Mobile Sensors

Cites Work

• Unnamed Item
• Unnamed Item
• Optimally decomposing coverings with translates of a convex polygon
• Connecting a set of circles with minimum sum of radii
• Set it and forget it: approximating the set once strip cover problem
• Polynomial time approximation schemes for base station coverage with minimum total radii
• On Clustering to Minimize the Sum of Radii
• Changing of the Guards: Strip Cover with Duty Cycling
• A distributed algorithmic framework for coverage problems in wireless sensor networks
• ENERGY-EFFICIENT NODE SCHEDULING MODELS IN SENSOR NETWORKS WITH ADJUSTABLE RANGES
• Probability and Computing
• Algorithms – ESA 2005