Improved lower bounds for data-gathering time in sensor networks

Yoram Revah, Michael Segal

Research output: Contribution to conferencePaperpeer-review

4 Scopus citations

Abstract

Many-to-one packet routing and scheduling are fundamental operations of sensor networks. It is well known that many sensor network applications rely on data collection from the nodes (the sensors) by a central processing device. There is a wide range of data gathering applications like: target and hazard detection, environmental monitoring, battlefield surveillance, etc. Consequently, efficient data collection solutions are needed to improve the performance of the network. In this paper, we assume a known distribution of sources (each node wants to transmit at most one packet) and one common destination (called base station). We provide via simple mathematical models, a transmission schedule for routing all the messages to the base station, jointly minimizing both the completion time and the average packet delivery time. We present improved lower bounds for linear, two-branch, and star (or multi-branch) network topologies. All our algorithms run in polynomial time.

Original languageEnglish
DOIs
StatePublished - 1 Dec 2007
Event3rd International Conference on Networking and Services, ICNS 2007 - Athens, Greece
Duration: 19 Jun 200725 Jun 2007

Conference

Conference3rd International Conference on Networking and Services, ICNS 2007
Country/TerritoryGreece
CityAthens
Period19/06/0725/06/07

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Fingerprint

Dive into the research topics of 'Improved lower bounds for data-gathering time in sensor networks'. Together they form a unique fingerprint.

Cite this