Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Algorithmica

Search In Journal Title:

Abbravation: Algorithmica

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1016/0162-0134(93)80049-f

Search In DOI:

ISSN

1432-0541

Search In ISSN:
Search In Title Of Papers:

Average Case Network Lifetime on an Interval with

Authors: Amotz BarNoy Ben Baumer
Publish Date: 2013/11/28
Volume: 72, Issue: 1, Pages: 148-166
PDF Link

Abstract

Given n sensors on an interval each of which is equipped with an adjustable sensing radius and a unit battery charge that drains in inverse linear proportion to its radius what schedule will maximize the lifetime of a network that covers the entire interval Trivially any reasonable algorithm is at least a 2approximation for this Sensor Strip Cover problem so we focus on developing an efficient algorithm that maximizes the expected network lifetime under a random uniform model of sensor distribution We demonstrate one such algorithm that achieves an expected network lifetime within 12  of the theoretical maximum Most of the algorithms that we consider come from a particular family of RoundRobin coverage in which sensors take turns covering predefined areas until their battery runs out

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. On Minimum Sum of Radii and Diameters Clustering
  2. Integer Representation and Counting in the Bit Probe Model
  3. An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization
  4. New Approximation Algorithms for Minimum Cycle Bases of Graphs
  5. The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
  6. Aligning Two Convex Figures to Minimize Area or Perimeter
  7. Introduction for S.I. AofA14
  8. Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
  9. Detecting Regular Visit Patterns
  10. Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
  11. Random Matrices and Codes for the Erasure Channel
  12. On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs
  13. The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
  14. Optimal Parallel Quantum Query Algorithms
  15. Maximum Series-Parallel Subgraph
  16. A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties
  17. Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets
  18. The Parameterized Complexity of Local Search for TSP, More Refined
  19. Approximating Fixation Probabilities in the Generalized Moran Process
  20. Approximation Algorithms for Scheduling with Reservations
  21. Algorithms for the Homogeneous Set Sandwich Problem
  22. A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
  23. Computing Minimum Cuts by Randomized Search Heuristics
  24. Constructing Labeling Schemes through Universal Matrices
  25. An Approximation Algorithm for the Minimum Co-Path Set Problem
  26. Scheduling with an Orthogonal Resource Constraint
  27. Approximate Boyer-Moore String Matching for Small Alphabets
  28. Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
  29. Between Treewidth and Clique-Width
  30. What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid
  31. Multi-sided Boundary Labeling
  32. A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Search Result: