Cart (Loading....) | Create Account
Close category search window
 

Improved Lower Bounds for Data-Gathering Time in Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Revah, Y. ; Ben-Gurion Univ. of the Negev, Beer-Sheva ; Segal, M.

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.

Published in:

Networking and Services, 2007. ICNS. Third International Conference on

Date of Conference:

19-25 June 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.