MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Author, Editor
Author(s):
Funke, Stefan
Guibas, Leonidas
Nguyen, An
Wang, Yusu
dblp
dblp
dblp
dblp
Not MPG Author(s):
Guibas, Leonidas
Nguyen, An
Wang, Yusu
Editor(s):
Gibbons, Phillip B.
Abdelzaher, Tarek F.
Aspnes, James
Rao, Ramesh
dblp
dblp
dblp
dblp
Not MPII Editor(s):
Gibbons, Phillip B.
Abdelzaher, Tarek F.
Aspnes, James
Rao, Ramesh
BibTeX cite key*:
FuGui2006
Title, Booktitle
Title*:
Distance-Sensitive Information Brokerage in Sensor Networks
Booktitle*:
Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006
Event, URLs
Conference URL::
http://www.dcoss.org
Downloading URL:
http://www.springerlink.com/content/h627406xv68n3256/fulltext.pdf
Event Address*:
San Francisco, USA
Language:
English
Event Date*
(no longer used):
Organization:
IEEE
Event Start Date:
18 June 2006
Event End Date:
20 June 2006
Publisher
Name*:
Springer
URL:
http://www.springer-ny.com/
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Computer Science
Volume:
4026
Number:
Month:
Pages:
234-251
Year*:
2006
VG Wort Pages:
ISBN/ISSN:
978-3-540-35227-3
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:

In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms of interactions between nodes that are producers of information, e.g., those that have collected data, detected events, etc., and nodes that are consumers of information, i.e., nodes that seek data or events of certain types. Our overall goal in this paper is to construct efficient schemes allowing consumer and producer nodes to discover each other so that the desired information can be delivered quickly to those who seek it. Here, efficiency means both limiting the redundancy of where producer information is stored, as well as bounding the consumer query times. We introduce the notion of distance-sensitive information brokerage and provide schemes for efficiently bringing together information producers and consumers at a cost proportional to the separation between them — even though neither the consumers nor the producers know about each other beforehand.

Our brokerage scheme is generic and can be implemented on top of several hierarchical routing schemes that have been proposed in the past, provided that they are augmented with certain key sideway links. For such augmented hierarchical routing schemes we provide a rigorous theoretical performance analysis, which further allows us to prove worst case query times and storage requirements for our information brokerage scheme. Experimental results demonstrate that the practical performance of the proposed approaches far exceeds their theoretical (worst-case) bounds. The presented algorithms rely purely on the topology of the communication graph of the sensor network and do not require any geographic location information.

URL for the Abstract:
http://www.springerlink.com/content/h627406xv68n3256/
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{FuGui2006,
AUTHOR = {Funke, Stefan and Guibas, Leonidas and Nguyen, An and Wang, Yusu},
EDITOR = {Gibbons, Phillip B. and Abdelzaher, Tarek F. and Aspnes, James and Rao, Ramesh},
TITLE = {Distance-Sensitive Information Brokerage in Sensor Networks},
BOOKTITLE = {Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006},
PUBLISHER = {Springer},
YEAR = {2006},
ORGANIZATION = {IEEE},
VOLUME = {4026},
PAGES = {234--251},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {San Francisco, USA},
ISBN = {978-3-540-35227-3},
}


Entry last modified by Christine Kiesel, 02/07/2007
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/09/2007 02:37:26 PM
Revisions
2.
1.
0.

Editor(s)
Christine Kiesel
Stefan Funke
Stefan Funke

Edit Dates
07.02.2007 16:43:01
01/09/2007 02:38:40 PM
01/09/2007 02:37:26 PM