• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Coverage Problems in Wireless Ad-hoc Sensor Networks (2001)

Cached

  • Download as a PDF

Download Links

  • [www.ieee-infocom.org]
  • [www.cs.ucla.edu]
  • [www.cse.fau.edu]
  • [www.cse.fau.edu]
  • [www.vs.inf.ethz.ch]
  • [www.tik.ee.ethz.ch]
  • [www.lisha.ufsc.br]
  • [www.cis.temple.edu]
  • [www.cis.temple.edu]
  • [www.ece.rice.edu]
  • [web.cs.ucla.edu]
  • [www.cse.fau.edu]
  • [www.cse.fau.edu]
  • [www.ece.rice.edu]
  • [discolab.rutgers.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Seapahn Meguerdichian , Farinaz Koushanfar , Miodrag Potkonjak , Mani B. Srivastava
Venue:in IEEE INFOCOM
Citations:439 - 9 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Meguerdichian01coverageproblems,
    author = {Seapahn Meguerdichian and Farinaz Koushanfar and Miodrag Potkonjak and Mani B. Srivastava},
    title = {Coverage Problems in Wireless Ad-hoc Sensor Networks},
    booktitle = {in IEEE INFOCOM},
    year = {2001},
    pages = {1380--1387}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Wireless ad-hoc sensor networks have recently emerged as a premier research topic. They have great longterm economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. In this paper, we address one of the fundamental problems, namely coverage. Coverage in general, answers the questions about quality of service (surveillance) that can be provided by a particular sensor network. We first define the coverage problem from several points of view including deterministic, statistical, worst and best case, and present examples in each domain. By combining computational geometry and graph theoretic techniques, specifically the Voronoi diagram and graph search algorithms, we establish the main highlight of the paper - optimal polynomial time worst and average case algorithm for coverage calculation. We also present comprehensive experimental results and discuss future research directions related to coverage in sensor networks. I.

Keyphrases

wireless ad-hoc sensor network    coverage problem    sensor network    coverage calculation    many application    fundamental issue    voronoi diagram    several point    graph theoretic technique    computational geometry    particular sensor network    great longterm economic potential    average case algorithm    premier research topic    present example    main highlight    fundamental problem    optimization problem    many new system-building challenge    comprehensive experimental result    graph search algorithm    paper optimal polynomial time    discus future research direction   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University