Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Funke, Stefan
Kesselman, Alexander
Lotker, Zvi
Segal, Michael

dblp
dblp
dblp
dblp

Not MPG Author(s):

Segal, Michael

Editor(s):

Nikolaidis, Ioanis
Barbeau, Michel
Kranakis, Evangelos

dblp
dblp
dblp

Not MPII Editor(s):

Nikolaidis, Ioanis
Barbeau, Michel
Kranakis, Evangelos

BibTeX cite key*:

FKLS2004

Title, Booktitle

Title*:

Improved Approximation Algorithms for Connected Sensor Cover

Booktitle*:

Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004

Event, URLs

URL of the conference:

http://namur.cs.ualberta.ca:8080/adhocnow04/Default.htm

URL for downloading the paper:

http://www.mpi-sb.mpg.de/~funke/Papers/cover.pdf

Event Address*:

Vancouver, Canada

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

22 July 2004

Event End Date:

24 July 2004

Publisher

Name*:

Springer

URL:

http://www.springer.de

Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

3158

Number:


Month:

July

Pages:

56-69

Year*:

2004

VG Wort Pages:


ISBN/ISSN:

3-540-22543-9

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Wireless sensor networks have recently posed many new system building challenges. One of the main problems is energy conservation since most of the sensors are devices with limited battery life and it is infeasible to replenish energy via replacing batteries. An effective approach for energy conservation is scheduling sleep intervals for some sensors, while the remaining sensors stay active providing continuous service. In this paper we consider the problem of selecting a set of active sensors of minimum cardinality that maintains sensing coverage and network connectivity. We study different variations of this problem. The main contribution of this paper is a thorough investigation of algorithms for covering an area with sensors that have fixed locations.

Keywords:

ADHOC networks, wireless, sensor cover



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{FKLS2004,
AUTHOR = {Funke, Stefan and Kesselman, Alexander and Lotker, Zvi and Segal, Michael},
EDITOR = {Nikolaidis, Ioanis and Barbeau, Michel and Kranakis, Evangelos},
TITLE = {Improved Approximation Algorithms for Connected Sensor Cover},
BOOKTITLE = {Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004},
PUBLISHER = {Springer},
YEAR = {2004},
VOLUME = {3158},
PAGES = {56--69},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Vancouver, Canada},
MONTH = {July},
ISBN = {3-540-22543-9},
}


Entry last modified by Anja Becker, 03/02/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Stefan Funke
Created
01/20/2005 08:18:53 PM
Revisions
6.
5.
4.
3.
2.
Editor(s)
Anja Becker
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Edit Dates
08.02.2008 14:46:05
06.06.2005 15:30:12
30.05.2005 15:21:29
30.05.2005 15:20:26
02.02.2005 10:55:36
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section